def __getitem__(self, index):
if isinstance(index, slice):
keys = self._mapping._sortedkeys[index]
rv = sortedset(key=self._mapping._sortedkeys.key)
rv.update(self._mapping[key] for key in keys)
return rv
key = self._mapping.sortedkeys[index]
return self._mapping[key]
def __getitem__(self, index):
if isinstance(index, slice):
keys = self._mapping._sortedkeys[index]
rv = sortedset(key=self._mapping._sortedkeys.key)
rv.update(self._mapping[key] for key in keys)
return rv
key = self._mapping.sortedkeys[index]
return self._mapping[key]
def kn_cooccurences(self, target_column, k):
"""Gets k top columns having max cooccurence with target_column"""
coolset = sortedset()
for word in self.get_tokens():
if not word.startswith("*"):
coolset.add((self.get(target_column, target_column, word), word))
array = list(coolset[len(coolset) - k : len(coolset)])
array.reverse()
return array
def kn_columns(self, target_column, k, dist_func):
"""Gets k nearest columns to target_column by distance function provided by dist_func"""
n = len(self.get_tokens())
coolset = sortedset()
for word in self.get_tokens():
if not word.startswith("*"):
coolset.add((dist_func(target_column, word), word))
array = list(coolset[1 : k + 1])
return array
def __init__(self, *args, **kw):
self._map = dict()
key = None
if len(args) > 0:
if hasattr(args[0], '__call__'):
key = args[0]
args = args[1:]
elif len(args) > 1:
raise TypeError("'%s' object is not callable" %
args[0].__class__.__name__)
if len(args) > 1:
raise TypeError('sorteddict expected at most 2 arguments, got %d'
% len(args))
self._sortedkeys = sortedset(key=key)
self.update(*args, **kw)
def __init__(self, *args, **kw):
if hasattr(self, '__missing__'):
self._map = missingdict()
self._map._missing = self.__missing__
else:
self._map = dict()
key = None
if len(args) > 0:
if hasattr(args[0], '__call__'):
key = args[0]
args = args[1:]
elif len(args) > 1:
raise TypeError("'%s' object is not callable" %
args[0].__class__.__name__)
if len(args) > 1:
raise TypeError('sorteddict expected at most 2 arguments, got %d'
% len(args))
if len(args) == 1 and isinstance(args[0], sorteddict) and key is None:
key = args[0]._sortedkeys._key
self._sortedkeys = sortedset(key=key)
self.update(*args, **kw)
def __init__(self, *args, **kw):
if hasattr(self, '__missing__'):
self._map = missingdict()
self._map._missing = self.__missing__
else:
self._map = dict()
key = None
if len(args) > 0:
if hasattr(args[0], '__call__'):
key = args[0]
args = args[1:]
elif len(args) > 1:
raise TypeError("'%s' object is not callable" %
args[0].__class__.__name__)
if len(args) > 1:
raise TypeError('sorteddict expected at most 2 arguments, got %d' %
len(args))
if len(args) == 1 and isinstance(args[0], sorteddict) and key is None:
key = args[0]._sortedkeys._key
self._sortedkeys = sortedset(key=key)
self.update(*args, **kw)
def _from_iterable(cls, it):
return sortedset(key=lambda item:
self._mapping._sortedkeys.key(item[0]))
def _from_iterable(cls, it):
return sortedset(key=self._mapping._sortedkeys.key)
def _from_iterable(cls, it):
return sortedset(
key=lambda item: self._mapping._sortedkeys.key(item[0]))
def _from_iterable(cls, it):
return sortedset(key=self._mapping._sortedkeys.key)
