Repository navigation
Expand file tree
/
Copy pathfold_case_dict.py
More file actions
126 lines (97 loc) · 3.25 KB
/
Copy pathfold_case_dict.py
File metadata and controls
126 lines (97 loc) · 3.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
# -*- coding: utf-8 -*-
# Minio Python Library for Amazon S3 Compatible Cloud Storage, (C)
# 2017 Minio, Inc.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""
minio.fold_case_dict
This module implements a case insensitive dictionary.
:copyright: (c) 2017 by Minio, Inc.
:license: Apache 2.0, see LICENSE for more details.
"""
class FoldCaseDict(dict):
def __init__(self, dictionary={}):
self._data = self.__create(dictionary)
def __create(self, value):
if isinstance(value, dict):
data = {}
for k, v in value.items():
if isinstance(v, dict):
data[k.lower()] = FoldCaseDict(self.__create(v))
else:
data[k.lower()] = v
return data
else:
return value
def __getitem__(self, item):
return self._data[item.lower()]
def __contains__(self, item):
return item.lower() in self._data
def __setitem__(self, key, value):
self._data[key.lower()] = self.__create(value)
def __delitem__(self, key):
del self._data[key.lower()]
def __iter__(self):
return (k for k in self._data.keys())
def __len__(self):
return len(self._data)
def __eq__(self, other):
if isinstance(other, dict):
other = FoldCaseDict(other)
elif isinstance(other, FoldCaseDict):
pass
else:
raise NotImplementedError
# Compare insensitively
return self.items() == other.items()
def __repr__(self):
return str(self._data)
def get(self, key, default=None):
if not key.lower() in self:
return default
else:
return self[key]
def has_key(self, key):
return key.lower() in self
def items(self):
return [(k, v) for k, v in self.iteritems()]
def keys(self):
return [k for k in self.iterkeys()]
def values(self):
return [v for v in self.itervalues()]
def iteritems(self):
for k, v in self._data.items():
yield k, v
def iterkeys(self):
for k, v in self._data.items():
yield k
def itervalues(self):
for k, v in self._data.items():
yield v
def update(self, dictionary):
if not (isinstance(dictionary, dict) or
isinstance(dictionary, FoldCaseDict)):
raise TypeError
for k, v in dictionary.items():
self[k] = v
def copy(self):
copy_dict = FoldCaseDict()
for k, v in self._data.items():
copy_dict[k] = v
return copy_dict
def clear(self):
self._data = {}
def pop(self, key):
return self._data.pop(key)
def popitem(self):
return self._data.popitem()