1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
# -*- coding: utf-8 -*-
#cython: embedsignature=True, language_level=3
#cython: boundscheck=False, cdivision=True, initializedcheck=False
## This is for developping:
##cython: profile=True, warn.undeclared=True, warn.unused=True, warn.unused_result=False, warn.unused_arg=True
##Not to be used: wraparound=False
# -*- coding: utf-8 -*-
#
# Project: Fast Azimuthal integration
# https://github.com/silx-kit/pyFAI
#
# Copyright (C) 2015-2020 European Synchrotron Radiation Facility, Grenoble, France
#
# Principal author: Jérôme Kieffer (Jerome.Kieffer@ESRF.eu)
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
# THE SOFTWARE.
"""Module used in file hierarchy tree for the diff_map graphical user interface.
"""
__author__ = "Jerome Kieffer"
__license__ = "MIT"
__date__ = "30/04/2020"
__copyright__ = "2011-2015, ESRF"
__contact__ = "jerome.kieffer@esrf.fr"
import cython
import os
cdef class TreeItem(object):
"""
Node of a tree ...
Each node contains:
* children: list
* parent: TreeItem parent
* label: str
* order: int
* type: str can be "dir", "file", "group" or "dataset"
* extra: any object
"""
cdef public list children
cdef public TreeItem parent
cdef public str label
cdef public int order
cdef public str type # can by "dir", "file", "group" or "dataset"
cdef public object extra
def __init__(self, str label=None, TreeItem parent=None):
self.children = []
self.parent = parent
self.label = label or ""
if parent:
parent.add_child(self)
self.order = parent.order + 1
else:
self.order = 0
self.extra = None
cpdef add_child(self, TreeItem child):
self.children.append(child)
child.parent = self
cpdef update(self, TreeItem new_root):
"""
Add new children in tree
"""
for new_child in new_root.children:
child = self.get(new_child.label)
if child:
child.update(new_child)
else:
self.add_child(new_child)
cpdef bint has_child(self, str label):
return label in [i.label for i in self.children]
cpdef TreeItem get(self, str label):
for i in self.children:
if i.label == label:
return i
def __repr__(self):
if self.parent:
return "TreeItem %s->%s with children: " % (self.parent.label, self.label) + ", ".join([i.label for i in self.children])
else:
return "Root TreeItem %s with children: %s" % (self.label, ", ".join([i.label for i in self.children]))
def sort(self):
for child in self.children:
child.sort()
self.children.sort(key=lambda x: x.label)
cpdef TreeItem next(self):
cdef int idx
if self.parent is None:
raise IndexError("Next does not exist")
idx = self.parent.children.index(self)
if idx < len(self.parent.children) - 1:
return self.parent.children[idx + 1]
else:
return self.parent.next().children[0]
cpdef TreeItem previous(self):
cdef int idx
if self.parent is None:
raise IndexError("Previous does not exist")
idx = self.parent.children.index(self)
if idx > 0:
return self.parent.children[idx - 1]
else:
return self.parent.previous().children[-1]
cpdef TreeItem first(self):
if self.children:
return self.children[0].first()
else:
return self
cpdef TreeItem last(self):
if self.children:
return self.children[-1].last()
else:
return self
property size:
def __get__(self):
cdef int s = 0
cdef TreeItem child
if self.children:
for child in self.children:
s += child.size
return s
else:
return 1
property name:
def __get__(self):
if self.order <= 1:
return self.label or ""
if self.parent.type == "file":
return self.parent.name + ":" + self.label
elif self.parent.type == "group":
return self.parent.name + "/" + self.label
else:
return self.parent.name + os.sep + self.label
|
