| /dports/textproc/p5-XML-Twig/XML-Twig-3.52/t/ |
| H A D | test_xpath_cond.t | 85 //[@id=~ /elt/] => elt-1 elt-2 elt2-1 elt-3 elt2-2 elt2-3 elt2-4 :elt
89 //*[@id=~ /elt/] => elt-1 elt-2 elt2-1 elt-3 elt2-2 elt2-3 elt2-4 :elt
90 //elt2[@att_int > 2] => elt2-4
91 /doc/elt2[ last()]/* => elt2-3 elt2-4
92 //*[@id=~/elt2/] => elt2-1 elt2-2 elt2-3 elt2-4
93 /doc/*[@id=~/elt2/] => elt2-1 elt2-2
94 /doc//*[@id=~/elt2/] => elt2-1 elt2-2 elt2-3 elt2-4
95 //*[@id=~/elt2-[34]/] => elt2-3 elt2-4
97 //[@id=~/elt2-[34]/] => elt2-3 elt2-4
98 //[@id!~/elt2-[34]/] => doc elt-1 elt-2 elt2-1 elt-3 elt2-2 :elt
[all …]
|
| H A D | test_nav.t | 64 elt2 => elt2-1
76 elt2[@id=~/elt2/] => elt2-1
78 elt2[@id="elt2-1"] => elt2-1
96 elt2[text(subelt)="text}"] => elt2-3
98 elt2[text(subelt)='text"'] => elt2-3
99 elt2[text(subelt)="text'"] => elt2-3
105 elt2[text(subelt)="text 2"]=> elt2-3
113 elt2[text(subelt)="text"] => elt2-2
118 elt2[text(subelt)="text"] => elt2-3
120 elt2[text(subelt)=~/tex/] => elt2-3
[all …]
|
| /dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
| H A D | bitmap.h | 200 bi->elt2 = NULL; in bmp_iter_set_init()
250 bi->elt2 = NULL; in bmp_iter_and_init()
262 if (!bi->elt2) in bmp_iter_and_init()
270 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
327 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
328 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
337 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
462 bi->elt2 = bi->elt2->next; in bmp_iter_and()
506 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
520 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | bitmap.h | 340 bi->elt2 = NULL; in bmp_iter_set_init()
390 bi->elt2 = NULL; in bmp_iter_and_init()
402 if (!bi->elt2) in bmp_iter_and_init()
410 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
468 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
469 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
478 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
616 bi->elt2 = bi->elt2->next; in bmp_iter_and()
656 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
670 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | bitmap.h | 340 bi->elt2 = NULL; in bmp_iter_set_init()
390 bi->elt2 = NULL; in bmp_iter_and_init()
402 if (!bi->elt2) in bmp_iter_and_init()
410 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
468 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
469 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
478 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
616 bi->elt2 = bi->elt2->next; in bmp_iter_and()
656 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
670 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | bitmap.h | 342 bi->elt2 = NULL; in bmp_iter_set_init()
392 bi->elt2 = NULL; in bmp_iter_and_init()
404 if (!bi->elt2) in bmp_iter_and_init()
412 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
470 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
471 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
480 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
618 bi->elt2 = bi->elt2->next; in bmp_iter_and()
658 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
672 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 398 bi->elt2 = NULL; in bmp_iter_set_init()
448 bi->elt2 = NULL; in bmp_iter_and_init()
468 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
527 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
683 bi->elt2 = bi->elt2->next; in bmp_iter_and()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
740 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
743 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, OEP_BITWISE); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | bitmap.h | 398 bi->elt2 = NULL; in bmp_iter_set_init()
448 bi->elt2 = NULL; in bmp_iter_and_init()
468 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
527 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
683 bi->elt2 = bi->elt2->next; in bmp_iter_and()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
740 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
743 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, 0); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 398 bi->elt2 = NULL; in bmp_iter_set_init()
448 bi->elt2 = NULL; in bmp_iter_and_init()
468 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
527 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
683 bi->elt2 = bi->elt2->next; in bmp_iter_and()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
740 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
743 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, OEP_BITWISE); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 398 bi->elt2 = NULL; in bmp_iter_set_init()
448 bi->elt2 = NULL; in bmp_iter_and_init()
468 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
527 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
683 bi->elt2 = bi->elt2->next; in bmp_iter_and()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
740 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
743 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, OEP_BITWISE); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | bitmap.h | 398 bi->elt2 = NULL; in bmp_iter_set_init()
448 bi->elt2 = NULL; in bmp_iter_and_init()
468 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
527 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
683 bi->elt2 = bi->elt2->next; in bmp_iter_and()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
740 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
743 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, OEP_BITWISE); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | bitmap.h | 398 bi->elt2 = NULL; in bmp_iter_set_init()
448 bi->elt2 = NULL; in bmp_iter_and_init()
468 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
527 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
683 bi->elt2 = bi->elt2->next; in bmp_iter_and()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
740 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
743 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, OEP_BITWISE); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | bitmap.h | 513 bi->elt2 = NULL; in bmp_iter_set_init()
567 bi->elt2 = NULL; in bmp_iter_and_init()
587 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
646 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
647 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
656 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
803 bi->elt2 = bi->elt2->next; in bmp_iter_and()
843 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
860 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
863 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
| H A D | bitmap.h | 513 bi->elt2 = NULL; in bmp_iter_set_init()
567 bi->elt2 = NULL; in bmp_iter_and_init()
587 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
646 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
647 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
656 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
803 bi->elt2 = bi->elt2->next; in bmp_iter_and()
843 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
860 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
863 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | bitmap.h | 513 bi->elt2 = NULL; in bmp_iter_set_init()
567 bi->elt2 = NULL; in bmp_iter_and_init()
587 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
646 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
647 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
656 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
803 bi->elt2 = bi->elt2->next; in bmp_iter_and()
843 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
860 gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); in bmp_iter_and_compl()
863 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-vector-builder.h | 83 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const in equal_p() argument
85 return operand_equal_p (elt1, elt2, OEP_BITWISE); in equal_p()
110 tree_vector_builder::step (const_tree elt1, const_tree elt2) const in step() argument
112 return wi::to_wide (elt2) - wi::to_wide (elt1); in step()
129 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2) in note_representative() argument
131 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2)) in note_representative()
133 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0)); in note_representative()
134 if (!TREE_OVERFLOW (elt2)) in note_representative()
135 *elt1_ptr = elt2; in note_representative()
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | bitmap.h | 405 bi->elt2 = NULL; in bmp_iter_set_init()
455 bi->elt2 = NULL; in bmp_iter_and_init()
467 if (!bi->elt2) in bmp_iter_and_init()
475 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
533 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
534 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
543 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
681 bi->elt2 = bi->elt2->next; in bmp_iter_and()
721 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
735 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | bitmap.h | 405 bi->elt2 = NULL; in bmp_iter_set_init()
455 bi->elt2 = NULL; in bmp_iter_and_init()
467 if (!bi->elt2) in bmp_iter_and_init()
475 bi->elt2 = bi->elt2->next; in bmp_iter_and_init()
533 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
534 bi->elt2 = bi->elt2->next; in bmp_iter_and_compl_init()
543 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
681 bi->elt2 = bi->elt2->next; in bmp_iter_and()
721 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
735 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| /dports/devel/collada-dom/collada-dom-2.5.0/dom/src/dae/ |
| H A D | daeElement.cpp | 486 elt2(NULL), in compareResult()
494 if (!elt1 || !elt2) in format()
546 result.elt2 = &elt2; in nameMismatch()
555 result.elt2 = &elt2; in attrMismatch()
565 result.elt2 = &elt2; in charDataMismatch()
575 result.elt2 = &elt2; in childCountMismatch()
614 return attrMismatch(elt1, elt2, elt1.getAttributeName(elt2.getAttributeCount())); in compareElementsDifferentTypes()
616 return attrMismatch(elt1, elt2, elt2.getAttributeName(elt1.getAttributeCount())); in compareElementsDifferentTypes()
626 elt2.getCharData(value2); in compareElementsDifferentTypes()
628 return charDataMismatch(elt1, elt2); in compareElementsDifferentTypes()
[all …]
|