Lines Matching refs:is

4 # a legal notice, here is a blessing:
12 # The focus of this file is testing the r-tree extension.
28 # This command assumes that the argument is a node blob for a 2 dimensional
30 # as a list. Each cell is itself a list of the following form:
34 # For internal (non-leaf) nodes, the rowid is replaced by the child node
56 # as a 16-bit big-endian integer and return the value. If this blob is
57 # the root node of an r-tree, this value is the height of the tree.
78 #      Invoked each time the xQueryCallback function is called. This Tcl
83 #      Invoked each time a row is returned. Checks that the row returned
87 #    The priority queue is stored as a Tcl list. The order of elements in 
88 #    the list is unimportant - it is just used as a set here. Each element
89 #    in the priority queue is itself a list. The first element is the
90 #    priority value for the entry (a real). Following this is a list of
100   # EVIDENCE-OF: R-54708-13595 An R*Tree query is initialized by making
112     error "priority queue is empty!"
164   # EVIDENCE-OF: R-65127-42665 If the extracted priority queue entry is a
165   # node (a subtree), then the next child of that node is passed to the
169   # xQueryCallback being called on a child - as is happening here.
185   # Check level is as expected
209   # EVIDENCE-OF: R-07194-63805 If the node has more children then it is
210   # returned to the priority queue. Otherwise it is discarded.
225   # EVIDENCE-OF: R-13214-54017 If that entry is a leaf (meaning that it is
226   # an actual R*Tree entry and not a subtree) then that entry is returned
242   # EVIDENCE-OF: R-57438-45968 The query runs until the priority queue is
245     error "priority queue is not empty!"