MCPcopy Index your code
hub / github.com/TheAlgorithms/Python / get

Method get

data_structures/binary_tree/fenwick_tree.py:178–196  ·  view source on GitHub ↗

Get value at index in O(lg N) Parameters: index (int): index to get the value Returns: int: Value of element at index >>> a = [i for i in range(128)] >>> f = FenwickTree(a) >>> res = True >>> for i in range(len(a)):

(self, index: int)

Source from the content-addressed store, hash-verified

176 return self.prefix(right) - self.prefix(left)
177
178 def get(self, index: int) -> int:
179 """
180 Get value at index in O(lg N)
181
182 Parameters:
183 index (int): index to get the value
184
185 Returns:
186 int: Value of element at index
187
188 >>> a = [i for i in range(128)]
189 >>> f = FenwickTree(a)
190 >>> res = True
191 >>> for i in range(len(a)):
192 ... res = res and f.get(i) == a[i]
193 >>> res
194 True
195 """
196 return self.query(index, index + 1)
197
198 def rank_query(self, value: int) -> int:
199 """

Callers 1

updateMethod · 0.95

Calls 1

queryMethod · 0.95

Tested by

no test coverage detected