| /dports/science/highfive/HighFive-2.3.1/src/examples/ |
| H A D | read_write_fixedlen_string.cpp | 41 FixedLenStringArray<4> array_back; in main() local
42 ds.read(array_back); in main()
43 std::cout << "First item is '" << array_back[0] << "'" << std::endl in main()
44 << "Second item is '" << array_back[1] << "'" << std::endl; in main()
|
| /dports/editors/helix/helix-0.5.0/cargo-crates/tree-sitter-0.20.0/src/ |
| H A D | reusable_node.h | 40 StackEntry last_entry = *array_back(&self->stack); in reusable_node_advance()
52 tree = array_back(&self->stack)->tree; in reusable_node_advance()
63 StackEntry last_entry = *array_back(&self->stack); in reusable_node_descend()
|
| H A D | get_changed_ranges.c | 12 TSRange *last_range = array_back(self); in ts_range_array_add()
126 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_start_position()
135 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_end_position()
145 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_tree_is_visible()
194 if (array_back(&self->cursor.stack)->child_index > 0) self->in_padding = false; in iterator_ascend()
204 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_descend()
257 const Subtree *parent = array_back(&self->cursor.stack)->subtree; in iterator_advance()
328 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_print_state()
|
| H A D | tree_cursor.c | 19 TreeCursorEntry *last_entry = array_back(&self->stack); in ts_tree_cursor_iterate_children()
262 TreeCursorEntry *last_entry = array_back(&self->stack); in ts_tree_cursor_current_node()
|
| H A D | query.c | 823 if (subgraph->nodes.size == 0 || array_back(&subgraph->nodes)->state != state) { in ts_query__analyze_patterns()
861 *array_back(&subgraph->start_states) != state in ts_query__analyze_patterns()
1046 int comparison = analysis_state__compare_position(state, array_back(&next_states)); in ts_query__analyze_patterns()
1270 uint16_t impossible_step_index = *array_back(&final_step_indices); in ts_query__analyze_patterns()
1634 array_back(&self->step_offsets)->step_index != starting_step_index in ts_query__parse_pattern()
1775 QueryStep *step = array_back(&self->steps); in ts_query__parse_pattern()
1792 QueryStep *step = array_back(&self->steps); in ts_query__parse_pattern()
2113 QueryPattern *pattern = array_back(&self->patterns); in ts_query_new()
|
| H A D | array.h | 33 #define array_back(self) array_get(self, (self)->size - 1) macro
|
| H A D | stack.c | 338 next_iterator = array_back(&self->iterators); in stack__iter()
644 StackHead *head = array_back(&self->heads); in ts_stack_copy_version()
842 next_iterator = array_back(&self->iterators); in ts_stack_print_dot_graph()
|
| /dports/devel/tree-sitter/tree-sitter-0.20.1/lib/src/ |
| H A D | reusable_node.h | 40 StackEntry last_entry = *array_back(&self->stack); in reusable_node_advance()
52 tree = array_back(&self->stack)->tree; in reusable_node_advance()
63 StackEntry last_entry = *array_back(&self->stack); in reusable_node_descend()
|
| H A D | get_changed_ranges.c | 12 TSRange *last_range = array_back(self); in ts_range_array_add()
126 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_start_position()
135 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_end_position()
145 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_tree_is_visible()
194 if (array_back(&self->cursor.stack)->child_index > 0) self->in_padding = false; in iterator_ascend()
204 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_descend()
257 const Subtree *parent = array_back(&self->cursor.stack)->subtree; in iterator_advance()
328 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_print_state()
|
| H A D | tree_cursor.c | 19 TreeCursorEntry *last_entry = array_back(&self->stack); in ts_tree_cursor_iterate_children()
262 TreeCursorEntry *last_entry = array_back(&self->stack); in ts_tree_cursor_current_node()
|
| H A D | array.h | 33 #define array_back(self) array_get(self, (self)->size - 1) macro
|
| H A D | stack.c | 338 next_iterator = array_back(&self->iterators); in stack__iter()
644 StackHead *head = array_back(&self->heads); in ts_stack_copy_version()
842 next_iterator = array_back(&self->iterators); in ts_stack_print_dot_graph()
|
| H A D | query.c | 863 if (subgraph->nodes.size == 0 || array_back(&subgraph->nodes)->state != state) { in ts_query__analyze_patterns()
901 *array_back(&subgraph->start_states) != state in ts_query__analyze_patterns()
1086 int comparison = analysis_state__compare_position(state, array_back(&next_states)); in ts_query__analyze_patterns()
1331 uint16_t impossible_step_index = *array_back(&final_step_indices); in ts_query__analyze_patterns()
1682 array_back(&self->step_offsets)->step_index != starting_step_index in ts_query__parse_pattern()
1820 QueryStep *step = array_back(&self->steps); in ts_query__parse_pattern()
2155 QueryPattern *pattern = array_back(&self->patterns); in ts_query_new()
|
| /dports/devel/radare2/radare2-5.1.1/shlr/tree-sitter/lib/src/ |
| H A D | reusable_node.h | 40 StackEntry last_entry = *array_back(&self->stack); in reusable_node_advance()
52 tree = array_back(&self->stack)->tree; in reusable_node_advance()
63 StackEntry last_entry = *array_back(&self->stack); in reusable_node_descend()
|
| H A D | get_changed_ranges.c | 12 TSRange *last_range = array_back(self); in ts_range_array_add()
126 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_start_position()
135 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_end_position()
145 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_tree_is_visible()
194 if (array_back(&self->cursor.stack)->child_index > 0) self->in_padding = false; in iterator_ascend()
204 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_descend()
257 const Subtree *parent = array_back(&self->cursor.stack)->subtree; in iterator_advance()
328 TreeCursorEntry entry = *array_back(&self->cursor.stack); in iterator_print_state()
|
| H A D | tree_cursor.c | 19 TreeCursorEntry *last_entry = array_back(&self->stack); in ts_tree_cursor_iterate_children()
229 TreeCursorEntry *last_entry = array_back(&self->stack); in ts_tree_cursor_current_node()
|
| H A D | query.c | 772 if (subgraph->nodes.size == 0 || array_back(&subgraph->nodes)->state != state) { in ts_query__analyze_patterns()
808 *array_back(&subgraph->start_states) != state in ts_query__analyze_patterns()
989 int comparison = analysis_state__compare_position(state, array_back(&next_states)); in ts_query__analyze_patterns()
1198 uint16_t impossible_step_index = *array_back(&final_step_indices); in ts_query__analyze_patterns()
1510 array_back(&self->step_offsets)->step_index != starting_step_index in ts_query__parse_pattern()
1650 QueryStep *step = array_back(&self->steps); in ts_query__parse_pattern()
1667 QueryStep *step = array_back(&self->steps); in ts_query__parse_pattern()
1956 QueryPattern *pattern = array_back(&self->patterns); in ts_query_new()
|
| H A D | array.h | 33 #define array_back(self) array_get(self, (self)->size - 1) macro
|
| H A D | stack.c | 338 next_iterator = array_back(&self->iterators); in stack__iter()
644 StackHead *head = array_back(&self->heads); in ts_stack_copy_version()
842 next_iterator = array_back(&self->iterators); in ts_stack_print_dot_graph()
|
| /dports/science/highfive/HighFive-2.3.1/tests/unit/ |
| H A D | tests_high_five_base.cpp | 1717 FixedLenStringArray<4> array_back; in BOOST_AUTO_TEST_CASE() local
1718 ds.read(array_back); in BOOST_AUTO_TEST_CASE()
1719 BOOST_CHECK(array_back.size() == 3); in BOOST_AUTO_TEST_CASE()
1720 BOOST_CHECK(array_back[0] == std::string("000")); in BOOST_AUTO_TEST_CASE()
1721 BOOST_CHECK(array_back[1] == std::string("111")); in BOOST_AUTO_TEST_CASE()
1722 BOOST_CHECK(array_back[2] == std::string("222")); in BOOST_AUTO_TEST_CASE()
1723 BOOST_CHECK(array_back.getString(1) == "111"); in BOOST_AUTO_TEST_CASE()
1727 array_back.data()[0] = 'x'; in BOOST_AUTO_TEST_CASE()
1730 for (auto& raw_elem : array_back) { in BOOST_AUTO_TEST_CASE()
1733 BOOST_CHECK(array_back.getString(1) == "1y1"); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/games/naev/naev-0.7.0/src/ |
| H A D | array.h | 206 #define array_back(ptr_array) (*(array_end(ptr_array) - 1)) macro
|
| /dports/mail/dovecot/dovecot-2.3.17/src/lib/ |
| H A D | array.h | 267 #define array_back(array) array_idx(array, array_count(array)-1) macro
|
| /dports/mail/dovecot/dovecot-2.3.17/src/lib-mail/ |
| H A D | message-parser.c | 179 parent_next_partp = array_back(&ctx->next_part_stack); in message_part_finish()
|
| /dports/mail/dovecot/dovecot-2.3.17/src/lib-imap/ |
| H A D | imap-parser.c | 562 arg = array_back(&parser->root_list); in imap_parser_is_next_text()
|
| /dports/mail/dovecot/dovecot-2.3.17/src/lib-smtp/ |
| H A D | smtp-client-connection.c | 973 end = array_back(arr); in smtp_client_connection_record_param_extensions()
|