medcat.cdb.concepts
Classes
dict() -> new empty dictionary |
|
dict() -> new empty dictionary |
|
Represents all the info regarding a type ID. |
Functions
|
|
|
|
|
Module Contents
- class medcat.cdb.concepts.CUIInfo
Bases:
TypedDictdict() -> new empty dictionary dict(mapping) -> new dictionary initialized from a mapping object’s
(key, value) pairs
- dict(iterable) -> new dictionary initialized as if via:
d = {} for k, v in iterable:
d[k] = v
- dict(**kwargs) -> new dictionary initialized with the name=value pairs
in the keyword argument list. For example: dict(one=1, two=2)
- cui: str
- preferred_name: str
- names: set[str]
- subnames: set[str]
- type_ids: set[str]
- description: str | None
- original_names: set[str] | None
- tags: list[str] | None
- group: str | None
- in_other_ontology: set[str] | None
- count_train: int
- context_vectors: dict[str, numpy.ndarray] | None
- average_confidence: float
- __contains__()
True if the dictionary has the specified key, else False.
- __delattr__()
Implement delattr(self, name).
- __delitem__()
Delete self[key].
- __dir__()
Default dir() implementation.
- __eq__()
Return self==value.
- __format__()
Default object formatter.
- __ge__()
Return self>=value.
- __getattribute__()
Return getattr(self, name).
- __getitem__()
x.__getitem__(y) <==> x[y]
- __gt__()
Return self>value.
- __init__()
Initialize self. See help(type(self)) for accurate signature.
- __ior__()
Return self|=value.
- __iter__()
Implement iter(self).
- __le__()
Return self<=value.
- __len__()
Return len(self).
- __lt__()
Return self<value.
- __ne__()
Return self!=value.
- __new__()
Create and return a new object. See help(type) for accurate signature.
- __or__()
Return self|value.
- __reduce__()
Helper for pickle.
- __reduce_ex__()
Helper for pickle.
- __repr__()
Return repr(self).
- __reversed__()
Return a reverse iterator over the dict keys.
- __ror__()
Return value|self.
- __setattr__()
Implement setattr(self, name, value).
- __setitem__()
Set self[key] to value.
- __sizeof__()
D.__sizeof__() -> size of D in memory, in bytes
- __str__()
Return str(self).
- __subclasshook__()
Abstract classes can override this to customize issubclass().
This is invoked early on by abc.ABCMeta.__subclasscheck__(). It should return True, False or NotImplemented. If it returns NotImplemented, the normal algorithm is used. Otherwise, it overrides the normal algorithm (and the outcome is cached).
- clear()
D.clear() -> None. Remove all items from D.
- copy()
D.copy() -> a shallow copy of D
- get()
Return the value for key if key is in the dictionary, else default.
- items()
D.items() -> a set-like object providing a view on D’s items
- keys()
D.keys() -> a set-like object providing a view on D’s keys
- pop()
D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If the key is not found, return the default if given; otherwise, raise a KeyError.
- popitem()
Remove and return a (key, value) pair as a 2-tuple.
Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.
- setdefault()
Insert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
- update()
D.update([E, ]**F) -> None. Update D from dict/iterable E and F. If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]
- values()
D.values() -> an object providing a view on D’s values
- medcat.cdb.concepts.get_new_cui_info(cui, preferred_name, names=set(), subnames=set(), type_ids=set(), description=None, original_names=None, tags=None, group=None, in_other_ontology=None, count_train=0, context_vectors=None, average_confidence=0.0)
- Parameters:
cui (str)
preferred_name (str)
names (set[str])
subnames (set[str])
type_ids (set[str])
description (Optional[str])
original_names (Optional[set[str]])
tags (Optional[list[str]])
group (Optional[str])
in_other_ontology (Optional[set[str]])
count_train (int)
context_vectors (Optional[dict[str, numpy.ndarray]])
average_confidence (float)
- Return type:
- class medcat.cdb.concepts.NameInfo
Bases:
TypedDictdict() -> new empty dictionary dict(mapping) -> new dictionary initialized from a mapping object’s
(key, value) pairs
- dict(iterable) -> new dictionary initialized as if via:
d = {} for k, v in iterable:
d[k] = v
- dict(**kwargs) -> new dictionary initialized with the name=value pairs
in the keyword argument list. For example: dict(one=1, two=2)
- name: str
- per_cui_status: dict[str, str]
- is_upper: bool
- count_train: int
- __contains__()
True if the dictionary has the specified key, else False.
- __delattr__()
Implement delattr(self, name).
- __delitem__()
Delete self[key].
- __dir__()
Default dir() implementation.
- __eq__()
Return self==value.
- __format__()
Default object formatter.
- __ge__()
Return self>=value.
- __getattribute__()
Return getattr(self, name).
- __getitem__()
x.__getitem__(y) <==> x[y]
- __gt__()
Return self>value.
- __init__()
Initialize self. See help(type(self)) for accurate signature.
- __ior__()
Return self|=value.
- __iter__()
Implement iter(self).
- __le__()
Return self<=value.
- __len__()
Return len(self).
- __lt__()
Return self<value.
- __ne__()
Return self!=value.
- __new__()
Create and return a new object. See help(type) for accurate signature.
- __or__()
Return self|value.
- __reduce__()
Helper for pickle.
- __reduce_ex__()
Helper for pickle.
- __repr__()
Return repr(self).
- __reversed__()
Return a reverse iterator over the dict keys.
- __ror__()
Return value|self.
- __setattr__()
Implement setattr(self, name, value).
- __setitem__()
Set self[key] to value.
- __sizeof__()
D.__sizeof__() -> size of D in memory, in bytes
- __str__()
Return str(self).
- __subclasshook__()
Abstract classes can override this to customize issubclass().
This is invoked early on by abc.ABCMeta.__subclasscheck__(). It should return True, False or NotImplemented. If it returns NotImplemented, the normal algorithm is used. Otherwise, it overrides the normal algorithm (and the outcome is cached).
- clear()
D.clear() -> None. Remove all items from D.
- copy()
D.copy() -> a shallow copy of D
- get()
Return the value for key if key is in the dictionary, else default.
- items()
D.items() -> a set-like object providing a view on D’s items
- keys()
D.keys() -> a set-like object providing a view on D’s keys
- pop()
D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If the key is not found, return the default if given; otherwise, raise a KeyError.
- popitem()
Remove and return a (key, value) pair as a 2-tuple.
Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.
- setdefault()
Insert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
- update()
D.update([E, ]**F) -> None. Update D from dict/iterable E and F. If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]
- values()
D.values() -> an object providing a view on D’s values
- medcat.cdb.concepts.get_new_name_info(name, per_cui_status={}, is_upper=False, count_train=0)
- Parameters:
name (str)
per_cui_status (dict[str, str])
is_upper (bool)
count_train (int)
- Return type: