Message from JavaScript discussions

July 2017

— continue = "stop traversing if this is false"
skipNode = "don't traverse into the current node"
tuple = set of objects from nodeMap which keeps track of relations and previously seen objects. clone algorithm uses this to pair clone nodes with source nodes.
iterations = just a count of how many iterations were done.
length = total number of props in current node.
existing = boolean indicating if node was seen before, if so it will be in tuple
isContainer = is the current leaf a container.
invertedIndex = Is the search index the search subject too.
isLast = obvious.
isFirst = obvious.
loc = current accessor, can be integer or string.

Message permanent page


With that an external algo can tell the traversal algorithm to skip nodes, insert relation objects into tuple which it might see again later if there's multiple props point at the same object, or a cycle. They can also determine if a node was seen before and assign props to the existing clone from tuple, among lots of other things

— InvertedIndex is a number?

— Boolean

— Oh

— IsInverted?

— Basically says if the search index (used to navigate) is also the search subject (looked at for it's props)

Message permanent page

— I see

— I think

— IDDFS is still confusing to me

— It's a hybrid DFS/BFS which is very fast and memory efficient

— Gets to the deepest node very quickly