/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
H A D | spellcheck-tree.c | 32 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 33 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 52 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 60 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/ |
H A D | spellcheck-tree.c | 32 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 33 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 52 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 60 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/lang/gcc9/gcc-9.4.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
H A D | spellcheck-tree.h | 40 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE); 46 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gcc10/gcc-10.3.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gcc8/gcc-8.5.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in levenshtein_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in levenshtein_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
H A D | spellcheck-tree.c | 35 gcc_assert (TREE_CODE (ident_s) == IDENTIFIER_NODE); in get_edit_distance() 36 gcc_assert (TREE_CODE (ident_t) == IDENTIFIER_NODE); in get_edit_distance() 55 gcc_assert (TREE_CODE (target) == IDENTIFIER_NODE); in find_closest_identifier() 62 gcc_assert (TREE_CODE (identifier) == IDENTIFIER_NODE); in find_closest_identifier()
|