Home
last modified time | relevance | path

Searched refs:idx_b (Results 1 – 25 of 352) sorted by relevance

12345678910>>...15

/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/cpp/src/gandiva/
H A Dexpr_decomposer_test.cc82 int idx_b = decomposer.PushThenEntry(node_b); in TEST_F() local
83 EXPECT_EQ(idx_b, 0); // must reuse bitmap. in TEST_F()
86 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
118 int idx_b = decomposer.PushThenEntry(node_b); in TEST_F() local
122 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
163 int idx_b = decomposer.PushThenEntry(node_b); in TEST_F() local
164 EXPECT_EQ(idx_b, 1); // must not reuse bitmap. in TEST_F()
167 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
230 int idx_b = decomposer.PushThenEntry(node_b); in TEST_F() local
231 EXPECT_EQ(idx_b, 1); // must reuse bitmap. in TEST_F()
[all …]
/dports/audio/hydrogen/hydrogen-1.0.1/src/core/src/basics/
H A Dpattern.cpp149 Note* Pattern::find_note( int idx_a, int idx_b, Instrument* instrument, Note::Key key, Note::Octave… in find_note() argument
156 if( idx_b==-1 ) return nullptr; in find_note()
157 for( notes_cst_it_t it=__notes.lower_bound( idx_b ); it!=__notes.upper_bound( idx_b ); it++ ) { in find_note()
164 for ( int n=0; n<idx_b; n++ ) { in find_note()
168 …( note->match( instrument, key, octave ) && ( ( idx_b<=note->get_position()+note->get_length() ) &… in find_note()
174 Note* Pattern::find_note( int idx_a, int idx_b, Instrument* instrument, bool strict ) const in find_note() argument
182 if( idx_b==-1 ) return nullptr; in find_note()
183 for( it=__notes.lower_bound( idx_b ); it!=__notes.upper_bound( idx_b ); it++ ) { in find_note()
190 for ( int n=0; n<idx_b; n++ ) { in find_note()
194 …f ( note->get_instrument() == instrument && ( ( idx_b<=note->get_position()+note->get_length() ) &… in find_note()
H A Dpattern_list.cpp173 void PatternList::swap( int idx_a, int idx_b ) in swap() argument
176 assert( idx_b >= 0 && idx_b < __patterns.size() ); in swap()
177 if( idx_a == idx_b ) return; in swap()
180 __patterns[idx_a] = __patterns[idx_b]; in swap()
181 __patterns[idx_b] = tmp; in swap()
184 void PatternList::move( int idx_a, int idx_b ) in move() argument
187 assert( idx_b >= 0 && idx_b < __patterns.size() ); in move()
188 if( idx_a == idx_b ) return; in move()
192 __patterns.insert( __patterns.begin() + idx_b, tmp ); in move()
H A Dinstrument_list.cpp208 void InstrumentList::swap( int idx_a, int idx_b ) in swap() argument
211 assert( idx_b >= 0 && idx_b < __instruments.size() ); in swap()
212 if( idx_a == idx_b ) return; in swap()
215 __instruments[idx_a] = __instruments[idx_b]; in swap()
216 __instruments[idx_b] = tmp; in swap()
219 void InstrumentList::move( int idx_a, int idx_b ) in move() argument
222 assert( idx_b >= 0 && idx_b < __instruments.size() ); in move()
223 if( idx_a == idx_b ) return; in move()
227 __instruments.insert( __instruments.begin() + idx_b, tmp ); in move()
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/cpp/src/gandiva/
H A Dexpr_decomposer_test.cc83 int idx_b = decomposer.PushThenEntry(node_b, true); in TEST_F() local
84 EXPECT_EQ(idx_b, 0); // must reuse bitmap. in TEST_F()
87 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
120 EXPECT_EQ(idx_b, 1); // must not reuse bitmap. in TEST_F()
123 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
164 int idx_b = decomposer.PushThenEntry(node_b, false); in TEST_F() local
165 EXPECT_EQ(idx_b, 1); // must not reuse bitmap. in TEST_F()
168 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
232 EXPECT_EQ(idx_b, 1); // must reuse bitmap. in TEST_F()
235 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
[all …]
/dports/databases/arrow/apache-arrow-6.0.1/cpp/src/gandiva/
H A Dexpr_decomposer_test.cc83 int idx_b = decomposer.PushThenEntry(node_b, true); in TEST_F() local
84 EXPECT_EQ(idx_b, 0); // must reuse bitmap. in TEST_F()
87 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
120 EXPECT_EQ(idx_b, 1); // must not reuse bitmap. in TEST_F()
123 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
164 int idx_b = decomposer.PushThenEntry(node_b, false); in TEST_F() local
165 EXPECT_EQ(idx_b, 1); // must not reuse bitmap. in TEST_F()
168 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
232 EXPECT_EQ(idx_b, 1); // must reuse bitmap. in TEST_F()
235 decomposer.PushElseEntry(node_b, idx_b); in TEST_F()
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/
H A Dmerge_arrays.cpp19 std::size_t idx_a = 0, idx_b = 0; in merge() local
26 if ( b[idx_b] < a[idx_a]) in merge()
31 c.push_back( b[idx_b]); in merge()
36 while ( idx_b < b.size() ) in merge()
38 if ( a[idx_a] < b[idx_b]) in merge()
40 c.push_back(b[idx_b++]); in merge()
/dports/databases/percona57-server/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/
H A Dmerge_arrays.cpp19 std::size_t idx_a = 0, idx_b = 0; in merge() local
26 if ( b[idx_b] < a[idx_a]) in merge()
31 c.push_back( b[idx_b]); in merge()
36 while ( idx_b < b.size() ) in merge()
38 if ( a[idx_a] < b[idx_b]) in merge()
40 c.push_back(b[idx_b++]); in merge()
/dports/databases/xtrabackup/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/
H A Dmerge_arrays.cpp19 std::size_t idx_a = 0, idx_b = 0; in merge() local
26 if ( b[idx_b] < a[idx_a]) in merge()
31 c.push_back( b[idx_b]); in merge()
36 while ( idx_b < b.size() ) in merge()
38 if ( a[idx_a] < b[idx_b]) in merge()
40 c.push_back(b[idx_b++]); in merge()
/dports/databases/percona57-client/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/
H A Dmerge_arrays.cpp19 std::size_t idx_a = 0, idx_b = 0; in merge() local
26 if ( b[idx_b] < a[idx_a]) in merge()
31 c.push_back( b[idx_b]); in merge()
36 while ( idx_b < b.size() ) in merge()
38 if ( a[idx_a] < b[idx_b]) in merge()
40 c.push_back(b[idx_b++]); in merge()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/
H A Dmerge_arrays.cpp19 std::size_t idx_a = 0, idx_b = 0; in merge() local
26 if ( b[idx_b] < a[idx_a]) in merge()
31 c.push_back( b[idx_b]); in merge()
36 while ( idx_b < b.size() ) in merge()
38 if ( a[idx_a] < b[idx_b]) in merge()
40 c.push_back(b[idx_b++]); in merge()
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 UPDATE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
39 1 UPDATE t1 NULL index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # 100.00 Using intersect(idx_b,idx_d)…
69 1 UPDATE t1 NULL index_merge idx_a,idx_b,idx_d idx_a,idx_b 4,4 NULL # 100.00 Using intersect(idx_a,…
79 KEY idx_b (b),
103 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
114 1 SIMPLE t1 NULL index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # 90.00 Using intersect(idx_b,i…
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 UPDATE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
39 1 UPDATE t1 NULL index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # 100.00 Using intersect(idx_b,idx_d)…
69 1 UPDATE t1 NULL index_merge idx_a,idx_b,idx_d idx_a,idx_b 4,4 NULL # 100.00 Using intersect(idx_a,…
79 KEY idx_b (b),
103 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
114 1 SIMPLE t1 NULL index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # 90.00 Using intersect(idx_b,i…
/dports/databases/mysql57-client/mysql-5.7.36/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 UPDATE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
39 1 UPDATE t1 NULL index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # 100.00 Using intersect(idx_b,idx_d)…
69 1 UPDATE t1 NULL index_merge idx_a,idx_b,idx_d idx_a,idx_b 4,4 NULL # 100.00 Using intersect(idx_a,…
79 KEY idx_b (b),
103 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
114 1 SIMPLE t1 NULL index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # 90.00 Using intersect(idx_b,i…
/dports/databases/percona57-server/percona-server-5.7.36-39/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 UPDATE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
39 1 UPDATE t1 NULL index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # 100.00 Using intersect(idx_b,idx_d)…
69 1 UPDATE t1 NULL index_merge idx_a,idx_b,idx_d idx_a,idx_b 4,4 NULL # 100.00 Using intersect(idx_a,…
79 KEY idx_b (b),
103 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
114 1 SIMPLE t1 NULL index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # 90.00 Using intersect(idx_b,i…
H A Dfilesort_merge.result5 INDEX idx_b(b),
35 SELECT COUNT(*) FROM t1 FORCE INDEX(idx_b, idx_c)
38 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_c,idx_b 5,4 NULL # 100.00 Using sort_union(idx_c,idx_b…
40 …unt(0) AS `COUNT(*)` from `test`.`t1` FORCE INDEX (`idx_c`) FORCE INDEX (`idx_b`) where (((`test`.…
41 SELECT COUNT(*) FROM t1 FORCE INDEX(idx_b, idx_c)
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 UPDATE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
39 1 UPDATE t1 NULL index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # 100.00 Using intersect(idx_b,idx_d)…
69 1 UPDATE t1 NULL index_merge idx_a,idx_b,idx_d idx_a,idx_b 4,4 NULL # 100.00 Using intersect(idx_a,…
79 KEY idx_b (b),
103 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
114 1 SIMPLE t1 NULL index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # 90.00 Using intersect(idx_b,i…
/dports/databases/percona57-client/percona-server-5.7.36-39/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 UPDATE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
39 1 UPDATE t1 NULL index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # 100.00 Using intersect(idx_b,idx_d)…
69 1 UPDATE t1 NULL index_merge idx_a,idx_b,idx_d idx_a,idx_b 4,4 NULL # 100.00 Using intersect(idx_a,…
79 KEY idx_b (b),
103 1 SIMPLE t1 NULL index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # 100.00 Using intersect(idx_b,idx_c)…
114 1 SIMPLE t1 NULL index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # 90.00 Using intersect(idx_b,i…
/dports/databases/percona56-server/percona-server-5.6.51-91.0/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
39 1 SIMPLE t1 index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Using where
69 1 SIMPLE t1 range idx_a,idx_b,idx_d idx_a 4 const # Using where; Using temporary
79 KEY idx_b (b),
102 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
112 1 SIMPLE t1 index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Usin…
/dports/databases/percona56-client/percona-server-5.6.51-91.0/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
39 1 SIMPLE t1 index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Using where
69 1 SIMPLE t1 range idx_a,idx_b,idx_d idx_a 4 const # Using where; Using temporary
79 KEY idx_b (b),
102 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
112 1 SIMPLE t1 index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Usin…
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
39 1 SIMPLE t1 index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Using where
69 1 SIMPLE t1 range idx_a,idx_b,idx_d idx_a 4 const # Using where; Using temporary
79 KEY idx_b (b),
102 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
112 1 SIMPLE t1 index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Usin…
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
39 1 SIMPLE t1 index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Using where
69 1 SIMPLE t1 range idx_a,idx_b,idx_d idx_a 4 const # Using where; Using temporary
79 KEY idx_b (b),
102 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
112 1 SIMPLE t1 index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Usin…
/dports/databases/mysql56-client/mysql-5.6.51/mysql-test/r/
H A Dindex_merge_intersect_dml.result10 KEY idx_b (b),
19 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
39 1 SIMPLE t1 index_merge idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Using where
69 1 SIMPLE t1 range idx_a,idx_b,idx_d idx_a 4 const # Using where; Using temporary
79 KEY idx_b (b),
102 1 SIMPLE t1 index_merge idx_b,idx_c idx_b,idx_c 4,4 NULL # Using intersect(idx_b,idx_c); Using where
112 1 SIMPLE t1 index_merge idx_a,idx_b,idx_d idx_b,idx_d 4,4 NULL # Using intersect(idx_b,idx_d); Usin…
/dports/games/tads/tads-3.0.8/tads3/
H A Dvmsort.h47 virtual int compare(VMG_ size_t idx_a, size_t idx_b) = 0;
50 virtual void exchange(VMG_ size_t idx_a, size_t idx_b) = 0;
71 virtual int compare(VMG_ size_t idx_a, size_t idx_b);
74 virtual void exchange(VMG_ size_t idx_a, size_t idx_b);
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/mysql-test/suite/innodb/r/
H A Dinnodb_corrupt_bit.result172 CREATE INDEX idx_b ON t3(b);
183 ERROR HY000: Index idx_b is corrupted
197 ERROR HY000: Index idx_b is corrupted
201 Error 1712 Index idx_b is corrupted
218 ERROR HY000: Index idx_b is corrupted
228 ERROR HY000: Index idx_b is corrupted
236 ERROR HY000: Index idx_b is corrupted
247 ERROR HY000: Index idx_b is corrupted
249 DROP INDEX idx_b ON t5;
251 CREATE INDEX idx_b ON t5(b);
[all …]

12345678910>>...15