/* eslint-disable */ @ // import linker macros @include '../store.jmacs' @macro each_ab_traditional() // search ab's adjacency list for predicate let c_offset_ab = -1; let i_data_ab_start = a_idx_ab[i_test_a - 1]; // each object pointed to in a's adjacency list for(;;) { // pull up b's id let i_test_b = a_data_ab[i_data_ab_start + (++c_offset_ab)]; // reach data ab end-of-adjacency list; break loop if(!i_test_b) break; @ // otherwise... @end @macro each_ab(test) // search ab's adjacency list for predicate let c_offset_ab = 0; let i_data_ab_start = a_idx_ab[i_test_a - 1]; // let c_offset_ab_end = a_idx_ab[i_test_a] - i_data_ab_start; let a_idx_x_bc = a_idx_a_bc[i_test_a - 1]; let c_offset_ab_end = a_idx_x_bc.length - 1; // each predicate in subject's ab adjacency list do { // pull up b's id let i_test_b = a_data_ab[i_data_ab_start + c_offset_ab]; @ // otherwise... @set close_each_ab '} while(++c_offset_ab !== c_offset_ab_end);' @end @macro each_abc_traditional() // pull up c's data index let i_data_a_bc = a_idx_a_bc[i_test_a - 1][c_offset_ab]; // each object pointed to by predicate for(;;) { // pull up c's id let i_test_c = a_data_a_bc[i_data_a_bc++]; // reach data c end-of-adjacency list; break loop if(!i_test_c) break; @ // otherwise... @end @macro each_abc() // pull up c's data index let a_idx_x_bc = a_idx_a_bc[i_test_a - 1]; let i_data_a_bc = a_idx_x_bc[c_offset_ab]; let i_data_a_bc_end = a_idx_x_bc[c_offset_ab + 1]; // each object pointed to by predicate do { // pull up c's id let i_test_c = a_data_a_bc[i_data_a_bc]; @ // otherwise... @set close_each_abc '} while(++i_data_a_bc !== i_data_a_bc_end);' @end @macro find_abc(what) // search ab's adjacency list for 'b' let c_offset_a_bc = -1; // starting position of adjacency list (for counting item offset) let a_idx_a_b = a_idx_a_bc[i_test_a - 1]; let i_start = a_idx_a_b[c_offset_ab]; // bounds of binary search let i_lo = i_start; let i_hi = (a_idx_a_b.length - 1) === c_offset_ab? a_idx_a_bc[i_test_a] - 1: a_idx_a_b[c_offset_ab + 1] - 1; searching_adjacency_list: for(;;) { // binary search for(;;) { let x_lo = a_data_a_bc[i_lo]; let x_hi = a_data_a_bc[i_hi]; // target value out of bounds if(@{what} < x_lo || @{what} > x_hi) break searching_adjacency_list; // compute midpoint search index let i_mid = (i_lo + i_hi) >> 1; let x_mid = a_data_a_bc[i_mid]; // miss low if(x_mid < @{what}) { i_lo = i_mid + 1; } // miss high else if(x_mid > @{what}) { i_hi = i_mid - 1; } // hit! else { // set offset accordingly c_offset_a_bc = i_mid - i_start; break; } // indexes crossed; target not in list if(i_hi < i_lo) break searching_adjacency_list; } @ // then... @end @macro each_s() let n_s = k_graph.range_s; for(let i_test_s=1; i_test_s x_hi) break searching_adjacency_list; // compute interpolated search index let i_mid = (i_lo + ((@{what} - x_lo) * (i_hi - i_lo) / (x_hi - x_lo))) | 0; let x_mid = a_data_ab[i_mid]; // miss low if(x_mid < @{what}) { i_lo = i_mid + 1; } // miss high else if(x_mid > @{what}) { i_hi = i_mid - 1; } // hit! else { // set offset accordingly c_offset_ab = i_mid - i_start; break; } // indexes crossed; target not in list if(i_hi < i_lo) break searching_adjacency_list; } @ // then... @end @macro find_ab(what) // search ab's adjacency list for 'b' let c_offset_ab = -1; // starting position of adjacency list (for counting item offset) let i_start = a_idx_ab[i_test_a - 1]; // bounds of binary search let i_lo = i_start; let i_hi = a_idx_ab[i_test_a] - 1; searching_adjacency_list: for(;;) { // binary search for(;;) { let x_lo = a_data_ab[i_lo]; let x_hi = a_data_ab[i_hi]; // compute midpoint search index let i_mid = (i_lo + i_hi) >> 1; let x_mid = a_data_ab[i_mid]; // miss low if(x_mid < @{what}) { i_lo = i_mid + 1; } // miss high else if(x_mid > @{what}) { i_hi = i_mid - 1; } // hit! else { // set offset accordingly c_offset_ab = i_mid - i_start; break; } // indexes crossed; target not in list if(i_hi < i_lo) break searching_adjacency_list; } @ // then... @end @macro end_find() break; } @end const HP_RANGE_ALL = Symbol('range:all'); const HP_RANGE_HOPS = Symbol('range:hops'); const HP_RANGE_NODES = Symbol('range:nodes'); const HP_RANGE_LITERALS = Symbol('range:literals'); const HP_RANGE_SOURCES = Symbol('range:sources'); const HP_RANGE_SINKS = Symbol('range:sinks'); const HP_HOP = Symbol('hop'); const HP_SUBJECT = Symbol('subject'); const HP_PREDICATE = Symbol('predicate'); const HP_INVERSE_PREDICATE = Symbol('inverse-predicate'); const HP_OBJECT = Symbol('object'); const HP_USE_SPO = Symbol('use:SPO'); const HP_USE_POS = Symbol('use:POS'); const HP_USE_OSP = Symbol('use:OSP'); const A_DATA_MAP = [ HP_USE_SPO, // Ks Kp Ko : 0 0 0 HP_USE_SPO, // Ks Kp Vo : 0 0 1 HP_USE_OSP, // Ks Vp Ko : 0 1 0 HP_USE_SPO, // Ks Vp Vo : 0 1 1 HP_USE_POS, // Vs Kp Ko : 1 0 0 HP_USE_POS, // Vs Kp Vo : 1 0 1 HP_USE_OSP, // Vs Vp Ko : 1 1 0 HP_USE_SPO, // Vs Vp Vo : 1 1 1 ]; const $_DATA = Symbol('data'); @{encoders()} @{buffer_utils()} @macro iterate_a(a, mark, save) // iterate a for(let i_@{a} of f_@{a}()) { @if mark || save let h_row_a = Object.create(h_row__); @ // a is marked @if mark // store marked h_row_a[s_mark_@{a}] = k_graph.@{a}(i_@{a}); @end @ // a is saved @if save // store saved h_row_a[s_save_a] = k_data_instance_a.load(i_@{a}); @end @else let h_row_a = h_row__; @end @end @macro iterate_b(b, mark, save) // iterate b for(let [i_@{b}, c_offset_data_@{a}@{b}] of f_@{b}(i_@{a})) { @if mark || save // extend row a let h_row_b = Object.create(h_row_a); @ // b is marked @if mark // store marked h_row_b[s_mark_@{b}] = k_graph.@{b}(i_@{b}); @end @ // b is saved @if save // store saved h_row_b[s_save_b] = k_data_instance_b.load(i_@{b}); @end @else let h_row_b = h_row_a; @end @end @macro iterate_c(c, mark, save) // iterate c for(let i_@{c} of f_@{c}(i_@{a}, c_offset_data_@{a}@{b})) { @if mark || save // extend row b let h_row_c = Object.create(h_row_b); @ // c is marked @if mark // store marked h_row_c[s_mark_@{c}] = k_graph.@{c}(i_@{c}); @end @ // c is saved @if save // store saved h_row_c[s_save_c] = k_data_instance_c.load(i_@{c}); @end @else let h_row_c = h_row_b; @end @end @macro end_iterate() } @end @macro mk_iterators(a, b, c) // mk iteration generators let { gen: f_@{a}, data: h_data_a, } = this.iterate_a(h_@{a}, '@{a}'); let { gen: f_@{b}, data: h_data_b, } = this.iterate_b(h_@{b}, '@{b}', '@{a}@{b}'); let { gen: f_@{c}, data: h_data_c, } = this.iterate_c(h_@{c}, '@{c}', '@{a}_@{b}@{c}'); let s_save_a = h_data_a && h_data_a.save; let s_save_b = h_data_b && h_data_b.save; let s_save_c = h_data_c && h_data_c.save; let k_data_instance_a, k_data_instance_b, k_data_instance_c; if(s_save_a) k_data_instance_a = h_@{a}.data.plugin.instance; if(s_save_b) k_data_instance_b = h_@{b}.data.plugin.instance; if(s_save_c) k_data_instance_c = h_@{c}.data.plugin.instance; let b_extend_a = s_mark_@{a} || s_save_a; let b_extend_b = s_mark_@{b} || s_save_b; let b_extend_c = s_mark_@{c} || s_save_c; @end @macro mk_proceed_inner(a, b, c, yield) // ref head(s) let i_head = b_inverse? i_@{c}: i_@{a}; let a_heads = h_results[i_head]; if(!a_heads) a_heads = h_results[i_head] = []; // tail has probes if(h_@{c}.probes) { // simulate pattern head just for probe let h_sim_c = { id: i_@{c}, probes: h_@{c}.probes, }; // probe all of c let h_survivors = this.probe(k_pattern, h_row_c, h_sim_c); if(h_survivors.size) { for(let i_tail in h_survivors) { let a_survivors = h_survivors[i_tail]; @{each('survivor', 'a')} @if yield yield a_survivor; @else a_heads.push(a_survivor); @end @{end_each()} } } } // reached end of pattern; push the current row else if(b_terminate) { @if yield yield h_row_C; @else // save row a_heads.push(h_row_c); @end } // more pattern to match else { // simulate pattern head for next triple let h_sim_c = { id: i_@{c}, type: HP_HOP, }; // proceed on c let h_survivors = this.proceed(k_pattern.copy(), h_row_c, h_sim_c); for(let i_survivor in h_survivors) { @if yield yield* h_survivors[i_survivor]; @else // push all onto this super-head's list a_heads.push(...h_survivors[i_survivor]); @end } } @end @macro mk_proceed_eval(a, b, c, yield) @{mk_iterators(a, b, c)} // bidirectional set intersection if(!h_@{a}.range && !h_@{b}.range && h_@{c}.range && k_pattern.length >= 2 && !k_pattern.peek(0).range && !k_pattern.peek(1).range) { // set m1 let a_m1 = []; @{iterate_a(a, true)} let a_heads = h_results[i_@{a}] = []; @{iterate_b(b, true)} @{iterate_c(c)} // accumulate ids to m1 a_m1.push(i_@{c}); @{end_iterate()} // compute intersection between m1 and m2 a_heads.push(...this.intersection(k_pattern, h_row_b, h_tail, a_m1)); @{end_iterate()} @{end_iterate()} } else { if(s_mark_@{a}) { if(s_save_a) { @{iterate_a(a, true, true)} if(s_mark_@{b}) { if(s_save_b) { @{iterate_b(b, true, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, true, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } // no mark b else { if(s_save_b) { @{iterate_b(b, false, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, false, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } @{end_iterate()} } // no save a else { @{iterate_a(a, true, false)} if(s_mark_@{b}) { if(s_save_b) { @{iterate_b(b, true, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, true, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } // no mark b else { if(s_save_b) { @{iterate_b(b, false, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, false, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } @{end_iterate()} } } // no mark a else { if(s_save_a) { @{iterate_a(a, false, true)} if(s_mark_@{b}) { if(s_save_b) { @{iterate_b(b, true, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, true, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } // no mark b else { if(s_save_b) { @{iterate_b(b, false, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, false, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } @{end_iterate()} } // no save a else { @{iterate_a(a, false, false)} if(s_mark_@{b}) { if(s_save_b) { @{iterate_b(b, true, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, true, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } // no mark b else { if(s_save_b) { @{iterate_b(b, false, true)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } // no save b else { @{iterate_b(b, false, false)} if(s_mark_@{c}) { if(s_save_c) { @{iterate_c(c, true, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, true, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } // no mark c else { if(s_save_c) { @{iterate_c(c, false, true)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } else { @{iterate_c(c, false, false)} @{mk_proceed_inner(a, b, c, yield)} @{end_iterate()} } } @{end_iterate()} } } @{end_iterate()} } } } @end @macro mk_intersection_eval(a, b, c) @{mk_iterators(a, b, c)} // head is marked if(h_head.mark) { @{iterate_a(a, true)} @{iterate_b(b, true)} let i_m1 = 0; find_intersections: @{iterate_c(c)} // skip over non-intersecting ids for(; a_m1[i_m1] < i_@{c}; i_m1++) { if(i_m1 === n_m1) { debugger; // no more intersections break find_intersections; } } // intersection if(a_m1[i_m1] === i_@{c}) { debugger; // extend b h_row_c = Object.create(h_row_b); // save marked h_row_c[s_mark_@{c}] = k_graph.@{c}(i_@{c}); // add to results a_results.push(h_row_c); } @{end_iterate()} // results?! debugger; @{end_iterate()} @{end_iterate()} } // head is not marked, so long as there is one intersection we can continue matching else { // testing intersections...... debugger; } // continue pattern.... debugger; @end class Row { // constructor() { // this[$_DATA] = {}; // } // data(s_name) { // if(undefined === s_name) return this[$_DATA]; // return this[$_DATA][s_name]; // } } class Selection { constructor(k_graph, k_pattern) { this.graph = k_graph; this.pattern = k_pattern; } rows() { //x let h_results = this.consume(this.pattern); let a_rows = []; for(let i_head in h_results) { let a_survivors = h_results[i_head]; @{each('survivor', 'h')} a_rows.push(h_survivor); @{end_each()} } return a_rows; } *results() { let k_pattern = this.pattern; let h_row__ = {}; // head of triple pattern let h_head = k_pattern.shift(); let k_graph = this.graph; let b_inverse = false; let x_triple_pattern = 0; let h_s; let h_o; // predicate(s) of triple pattern let h_p = k_pattern.shift(); // Vp if(h_p.range) x_triple_pattern |= 2; // tail of triple pattern let h_tail = k_pattern.shift(); // end of pattern sequence let b_terminate = !k_pattern.length; // body is normal direction if(HP_PREDICATE === h_p.type) { // Vs if(h_head.range) x_triple_pattern |= 4; // claim subjects h_s = h_head; // Vo if(h_tail.range) x_triple_pattern |= 1; // claim objects h_o = h_tail; } // body is inverse direction else { b_inverse = true; // Vs if(h_head.range) x_triple_pattern |= 1; // claim objects h_o = h_head; // Vs if(h_tail.range) x_triple_pattern |= 4; // claim subjects h_s = h_tail; } // let hp_data_use = A_DATA_MAP[x_triple_pattern]; // ref markings let s_mark_s = h_s.mark; let s_mark_p = h_p.mark; let s_mark_o = h_o.mark; // save which heads were used and their associated rows let h_results = {}; // SPO if(HP_USE_SPO === hp_data_use) { if(!k_graph.data_sp) { throw 'Query requires the POS triples index to be built.'; } @{mk_proceed_eval('s', 'p', 'o', true)} } // POS else if(HP_USE_POS === hp_data_use) { if(!k_graph.data_po) { throw 'Query requires the POS triples index to be built.'; } @{mk_proceed_eval('p', 'o', 's', true)} } // OSP else { if(!k_graph.data_os) { throw 'Query requires the OSP triples index to be built.'; } @{mk_proceed_eval('o', 's', 'p', true)} } } iterate_a(h_entity, s_term) { let k_graph = this.graph; // ref filter let f_filter = h_entity.filter; // ref data let h_data = h_entity.data; // K*[1] if(h_entity.id) { let i_entity = h_entity.id; // user bound a filter if(f_filter) { // filter rejects reconstructed term if(!f_filter(k_graph[s_term](i_entity))) { // empty generator return {*gen() {}}; } } // user bound a data handler if(h_data) { let h_checker = h_data.plugin.checker(h_data.action); // apply plugin handler; action dissaproves of this entity if(!h_checker.evaluate(i_entity)) { // empty generator return {*gen() {}}; } // data saves entity if(h_checker.save) { return { // mk entity generator gen: function*() { // simply return entity id (already known to be a valid entity) yield i_entity; }, // data role data: { save: h_checker.save, }, }; } } return { // mk entity generator gen: function*() { // simply return entity id (already known to be a valid entity) yield i_entity; }, }; } // K*[+] else if(h_entity.ids) { let a_entity_ids = h_entity.ids; // user bound a filter if(f_filter) { // filter entities let a_entity_ids_cleaned = []; @{each('entity_id', 'i', 'entity')} // entity passes filter test if(f_filter(k_graph[s_tream](i_entity))) { // preserve entity in set a_entity_ids_cleaned.push(i_entity); } @{end_each()} // reassign id set a_entity_ids = a_entity_ids_cleaned; } // user bound a data handler if(h_data) { // data plugin checker let h_checker = h_data.plugin.checker(h_data.action); let f_evaluate = h_checker.evaluate; // filter entities if(f_evaluate) { let a_entity_ids_cleaned = []; @{each('entity_id', 'i', 'entity')} // entity passes plugin test if(f_evaluate(i_entity)) { // preserve entity in set a_entity_ids_cleaned.push(i_entity); } @{end_each()} // reassign id set a_entity_ids = a_entity_ids_cleaned; } // data saves entity if(h_checker.save) { return { // mk entity generator gen: function*() { // simply iterate each entity node id (already known to be valid entities) yield* a_entity_ids; }, // data role data: { save: h_checker.save, }, }; } } // mk entity iterator return { *gen() { // simply iterate each entity node id (already known to be valid entities) yield* a_entity_ids; }, }; } // V* else { let hp_entity_type = h_entity.type; let hp_entity_range = h_entity.range; let i_start = 1; let i_stop; // V*[all] if(HP_RANGE_ALL === hp_entity_range) { // for subjects if(HP_SUBJECT === hp_entity_type) { i_stop = k_graph.range_s; } // for objects else if(HP_OBJECT === hp_entity_type) { i_stop = k_graph.range_l; } // for predicates else { i_stop = k_graph.range_p; } } // V*[hops] else if(HP_RANGE_HOPS === hp_entity_range) { i_stop = k_graph.range_d; } // V*[literals] else if(HP_RANGE_LITERALS === hp_entity_range) { i_start = k_graph.range_o; i_stop = k_graph.range_l; } // V*[sources] else if(HP_RANGE_SOURCES === hp_entity_range) { i_stop = k_graph.range_s; } // V*[sinks] else if(HP_RANGE_SINKS === hp_entity_range) { i_stop = k_graph.range_o; } // V*[custom] else if(HP_RANGE_CUSTOM === hp_entity_range) { i_start = h_entity.start; i_stop = h_entity.stop; } // ?? else { throw 'invalid variable source type. only expected {ALL, HOPS}; found '+hp_entity_range; } // no filter if(!f_filter) { // no data if(!h_data) { // mk entity iterator return { gen: function*() { // each and every entity node for(let i_e=i_start; i_e= i_stop) break; // filter rejects reconstructed term; skip if(!f_filter(k_graph[s_term](i_test_b))) continue; // accepted yield [i_test_b, c_offset_ab]; @{end_each()} }, }; } // yes filter else { // mk entity iterator return { gen: function*(i_test_a) { // search data table for given range @{each_ab()} // too low (not in range yet) if(i_test_b < i_start) continue; // too high (out of range) if(i_test_b >= i_stop) break; // filter rejects reconstructed term; skip if(!f_filter(k_graph[s_term](i_test_b))) continue; // accepted yield [i_test_b, c_offset_ab]; @{end_each()} }, }; } } // ?? else { throw 'invalid variable source type. only expected {ALL, CUSTOM}'; } } } iterate_c(h_entity, s_term, s_key) { let k_graph = this.graph; // data and index let a_data_a_bc = k_graph['data_'+s_key]; let a_idx_a_bc = k_graph['idx_'+s_key]; // ref filter let f_filter = h_entity.filter; // ref data let h_data = h_entity.data; // K*[1] if(h_entity.id) { let i_entity = h_entity.id; // user bound a filter if(f_filter) { // filter rejects reconstructed term if(!f_filter(k_graph[s_term](i_entity))) { // empty iterator return {gen: function*() {}}; } } // mk entity iterator return { gen: function*(i_test_a, c_offset_ab) { // search data table for given entity @{find_abc('i_entity')} yield i_entity; @{end_find()} }, }; } // K*[+] else if(h_entity.ids) { let a_entity_ids = h_entity.ids; // user bound a filter if(f_filter) { // filter entities let a_entity_ids_cleaned = []; @{each('entity_id', 'i', 'entity')} // entity passes filter test if(f_filter(k_graph[s_tream](i_entity))) { // preserve entity in set a_entity_ids_cleaned.push(i_entity); } @{end_each()} // reassign id set a_entity_ids = a_entity_ids_cleaned; } // user bound a data handler if(h_data) { // plugin data checker let f_checker = h_data.plugin.checker(h_data.action); // filter entities let a_entity_ids_cleaned = []; @{each('entity_id', 'i', 'entity')} // entity passes plugin test if(f_checker(i_entity)) { // preserve entity in set a_entity_ids_cleaned.push(i_entity); } @{end_each()} // reassign id set a_entity_ids = a_entity_ids_cleaned; } // mk entity iterator return { gen: function*(i_test_a, c_offset_ab) { // copy ids list let a_search_ids = a_entity_ids.slice(); // search data table for given entities @{each_abc()} // found a target entity let i_found_entity = a_search_ids.indexOf(i_test_c); if(-1 !== i_found_edge) { // delete from search list a_search_ids.splice(i_found_entity, 1); // yield yield i_test_c; // found all ids; stop searching if(!a_search_ids.length) break; } @{end_each()} }, }; } // V* else { let hp_entity_type = h_entity.type; let hp_entity_range = h_entity.range; let i_start = 1; let i_stop; // let i_high_range = k_graph.range_l; // V*[all] if(HP_RANGE_ALL === hp_entity_range) { // for subjects if(HP_SUBJECT === hp_entity_type) { i_stop = k_graph.range_s; } // for objects else { i_stop = i_high_range; } } // V*[hops] else if(HP_RANGE_HOPS === hp_entity_range) { i_stop = k_graph.range_d; } // V*[literals] else if(HP_RANGE_LITERALS === hp_entity_range) { i_start = k_graph.range_o; i_stop = i_high_range; } // V*[sources] else if(HP_RANGE_SOURCES === hp_entity_range) { i_stop = k_graph.range_s; } // V*[sinks] else if(HP_RANGE_SINKS === hp_entity_range) { i_stop = k_graph.range_o; } // V*[custom] else if(HP_RANGE_CUSTOM === hp_entity_range) { i_start = h_entity.start; i_stop = h_entity.stop; } // ?? else { throw 'invalid variable source type. only expected {ALL, HOPS}'; } // yes data let f_evaluate, s_save, f_gen; if(h_data) { let k_plugin = h_data.plugin; let f_action = h_data.action; if(k_plugin.has_exclusive_ranges) { let a_ranges = k_plugin.ranges_within(i_start, i_stop); // data incompatible with selection criteria if(!a_ranges.length) { return function*() {}; } // single range! else if(1 === a_ranges.length) { i_start = a_ranges[0].low; i_stop = a_ranges[0].high; } // multiple ranges else { debugger; throw 'multiple ranges'; } } let h_checker = k_plugin.checker(f_action); s_save = h_checker.save; f_evaluate = h_checker.evaluate; } // no evaluate if(!f_evaluate) { // no filter if(!f_filter) { // no need to check low if(i_start === 1) { // no need to check high if(i_stop === i_high_range) { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { @{each_abc()} yield i_test_c; @{end_each()} }; } // only check for high else { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too high (out of range) if(i_test_c >= i_stop) break; // within range yield i_test_c; @{end_each()} }; } } // must check for low else { // no need to check high if(i_stop === i_high_range) { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too low (not in range yet) if(i_test_c < i_start) continue; // within range yield i_test_c; @{end_each()} }; } // check for high too else { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too low (not in range yet) if(i_test_c < i_start) continue; // too high (out of range) if(i_test_c >= i_stop) break; // within range yield i_test_c; @{end_each()} }; } } } // yes filter else { // no need to check low if(i_start === 1) { // no need to check high if(i_stop === i_high_range) { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { @{each_abc()} // filter rejects reconstructed term; skip if(!f_filter(k_graph[s_term](i_test_c))) continue; // accepted yield i_test_c; @{end_each()} }; } // only check for high else { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too high (out of range) if(i_test_c >= i_stop) break; // filter rejects reconstructed term; skip if(!f_filter(k_graph[s_term](i_test_c))) continue; // within range yield i_test_c; @{end_each()} }; } } // must check for low else { // no need to check high if(i_stop === i_high_range) { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too low (not in range yet) if(i_test_c < i_start) continue; // filter rejects reconstructed term; skip if(!f_filter(k_graph[s_term](i_test_c))) continue; // within range yield i_test_c; @{end_each()} }; } // check for high too else { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too low (not in range yet) if(i_test_c < i_start) continue; // too high (out of range) if(i_test_c >= i_stop) break; // filter rejects reconstructed term; skip if(!f_filter(k_graph[s_term](i_test_c))) continue; // within range yield i_test_c; @{end_each()} }; } } } // if(s_save) { return { gen: f_gen, data: { save: s_save, }, }; } else { return {gen: f_gen}; } } // yes data evaluate else { // no need to check low if(i_start === 1) { // no need to check high if(i_stop === i_high_range) { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { @{each_abc()} // plugin rejects reconstructed term; skip if(!f_evaluate(i_test_c)) continue; // accepted yield i_test_c; @{end_each()} }; } // only check for high else { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too high (out of range) if(i_test_c >= i_stop) break; // plugin rejects reconstructed term; skip if(!f_evaluate(i_test_c)) continue; // within range yield i_test_c; @{end_each()} }; } } // must check for low else { // no need to check high if(i_stop === i_high_range) { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too low (not in range yet) if(i_test_c < i_start) continue; // plugin rejects reconstructed term; skip if(!f_evaluate(i_test_c)) continue; // within range yield i_test_c; @{end_each()} }; } // check for high too else { // mk entity iterator f_gen = function*(i_test_a, c_offset_ab) { // search data table for given range @{each_abc()} // too low (not in range yet) if(i_test_c < i_start) continue; // too high (out of range) if(i_test_c >= i_stop) break; // plugin rejects reconstructed term; skip if(!f_evaluate(i_test_c)) continue; // within range yield i_test_c; @{end_each()} }; } } // if(s_save) { return { gen: f_gen, data: { save: s_save, }, }; } else { return {gen: f_gen}; } } } } intersection(k_pattern, h_row__, h_head, a_m1) { let k_graph = this.graph; // predicate(s) of triple pattern let h_p = k_pattern.shift(); // Vp if(h_p.range) x_triple_pattern |= 2; // tail of triple pattern let h_tail = k_pattern.shift(); // end of pattern sequence let b_terminate = !k_pattern.length; // which data/index to use let hp_data_use, h_s, h_o; // body is normal direction if(HP_PREDICATE === h_p.type) { h_s = h_head; h_o = h_tail; hp_data_use = HP_USE_POS; } // body is inverse direction else { b_inverse = true; h_s = h_tail; h_o = h_head; hp_data_use = HP_USE_SPO; } // ref markings let s_mark_s = h_s.mark; let s_mark_p = h_p.mark; let s_mark_o = h_o.mark; // save results as list let a_results = []; // m1 read index and length let i_m1 = 0; let n_m1 = a_m1.length; // SPO if(HP_USE_SPO === hp_data_use) { if(!k_graph.data_sp) { throw 'Query requires the POS triples index to be built.'; } @{mk_intersection_eval('s', 'p', 'o')} } // POS else if(HP_USE_POS === hp_data_use) { if(!k_graph.data_po) { throw 'Query requires the POS triples index to be built.'; } @{mk_intersection_eval('p', 'o', 's')} } // return a_results; } consume(k_pattern) { let k_graph = this.graph // head of triple pattern let h_head = k_pattern.shift(); // head has probes if(h_head.probes) { throw 'probing first'; // let a_combine = a_rows; // each probe let a_probes = h_head.probes; for(let i_probe=0; i_probe=0; i_combine_row--) { // take combine row out from array let h_combine_row = a_combine[i_combine_row]; a_combine.splice(i_combine_row, 1); // each probe row to combine for(let i_probe_row=0; i_probe_row=0; i_combine_row--) { // take combine row out from array let h_combine_row = a_combine[i_combine_row]; a_combine.splice(i_combine_row, 1); // each probe row to combine for(let i_probe_row=0; i_probe_row