* Performs incremental computation on a node, evaluating the bounds and inserting into the cache, * queue, and permutation map if appropriate. * This is the function that contains the majority of the logic of the algorithm. * * parent -- the node that is going to have all of its children evaluated. * parent_not_captured -- the vector representing data points NOT captured by the parent. */
source not stored for this graph (policy: none)
no test coverage detected