def __init__(self, arbre, parent, sax, cardinality, timeseries):
self.iSAX_word = []
for i in range(len(sax)):
self.iSAX_word.append([sax[i], cardinality[i]])
Node.__init__(self, parent=parent, name=str(self.iSAX_word))
self.arbre = arbre
self.sax = sax
self.cardinality = cardinality
# TODO attention si split est appelé recursivement, ne retourne pas le card nécessaire
# TODO donc sera forcément rappelé, est donc un noeud intermédiaire qui ne sert à rien
list_ts_paa = list_ts_to_list_paa(timeseries, self.arbre.size_word)
# TODO pourquoi toujours meme segment
mean, stdev = self.computeMeanStDev(list_ts_paa)
position_min, next_cardinality = self.split(list_ts_paa,
min(self.cardinality),
mean, stdev)
# TODO attribut global rajouté pour les tests
self.cmpt_seg_split.append(position_min)
self.cardinality_next = deepcopy(self.cardinality)
# TODO : réfléchir si c'est une bonne idée...
# TODO self.cardinality_next[position_min] = next_cardinality
self.cardinality_next[position_min] *= 2
# Spécifique aux noeuds internes
self.nodes = {}
self.terminal = False
def __init__(self, url, name, server_id):
Client.__init__(self, url)
AnyTreeNode.__init__(self, name=name)
self.runtime_id = id(self.uaclient)
self.id = server_id
self.url = url
self.subscriptions = {}
def __init__(self, name, permanent_id, ip, server_config, queue_host):
AnyTreeNode.__init__(self, name=name, parent=None)
self.permanent_id = permanent_id
self.ip = ip
self.runtime_id = id(self)
self.server_config = server_config
self.queue_host = queue_host
self.servers = {}
def __init__(self, arbre, cardinality_next):
Node.__init__(self, "root")
print("create -> root")
self.arbre = arbre
self.cardinality_next = cardinality_next
self.nodes = {}
def __init__(self, server, nodeid, name, parent, server_id, **kwargs):
OpcNode.__init__(self, server=server, nodeid=nodeid)
AnyTreeNode.__init__(self, name=name, parent=parent, **kwargs)
self.namespace_index = self.nodeid.NamespaceIndex
self.node_class = None
self.variant_type = None
self.string_nodeid = self.nodeid.to_string()
self.node_id = self.nodeid.to_string()
self.server_id = server_id
self.web_client_ids = set()
self.handle = None
def __init__(self, name, parent=None):
Node.__init__(self, name, parent)
self.id = 0
self.name = name
self.parent = parent
self.tuple = []
self.is_dead = False
self.edge_length = 0
# alelle length for each chromosome, root has the same as reference
self.cn = []
self.chrlen = []
self.ref = []
def __init__(self, id, parent=None):
Node.__init__(self, id, parent)
self.id = id # The node value
self.name = None
self.left_node_id = -1 # Left child
self.right_node_id = -1 # Right child
self.missing_node_id = -1
self.feature = -1
self.threshold = -1
self.cover = -1
self.values = -1
def __init__(self, tree, parent, sax, cardinality):
"""
Initialization function of the rootnode class
:returns: a root node
:rtype: RootNode
"""
self.iSAX_word = np_array([sax, cardinality]).T
Node.__init__(self, parent=parent, name=str(self.iSAX_word))
self.tree = tree
self.sax = sax
self.cardinality = cardinality
self.cardinality_next = np_copy(self.cardinality)
self.cardinality_next = np_array([x*2 for x in self.cardinality_next])
# Number of sequences contained in the node (or by its sons)
self.nb_sequences = 0
""" The incremental computing part for CFOF """
self.mean = np_empty(shape=self.tree.size_word)
# Allows the incremental calculation of self.mean
self.sum = np_empty(shape=self.tree.size_word)
self.std = np_empty(shape=self.tree.size_word)
# Allows the incremental calculation of self.std
self.sn = np_empty(shape=self.tree.size_word)
# Specific to internal nodes
self.nodes = []
self.key_nodes = {}
self.terminal = False
self.level = 0
self.id = RootNode.id_global
RootNode.id_global += 1
def __init__(self, arbre, parent, sax, cardinality):
self.iSAX_word = []
for i in range(len(sax)):
self.iSAX_word.append([sax[i], cardinality[i]])
Node.__init__(self, parent=parent, name=str(self.iSAX_word))
# print(" -create -> terminal",str(iSAX_word))
self.arbre = arbre
self.sax = sax
self.cardinality = cardinality
self.cardinality_next = None
# Spécifique aux noeuds terminaux
# (quoi? on dit des noeuds terminals?)
# Nombre de series temportelles contenu dans le noeud (ou par ses fils)
self.nb_timeseries = 0
# Si c'est une feuille, contient une liste de séries temporelles, sinon contient liste vide
self.timeseries = []
# TODO si seuil connu, pourquoi pas un narray numpy...
self.terminal = True
def __init__(self, *a, **kwa):
BaseNode.__init__(self, *a, **kwa)
self.ctime = datetime.now()
self.mtime = copy.copy(self.ctime)
self.atime = copy.copy(self.ctime)
