Home
last modified time | relevance | path

Searched refs:elems (Results 1 – 6 of 6) sorted by relevance

/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/
Darray.hpp62 T elems[N]; // fixed-size array of elements of type T member in boost::array
75 iterator begin() { return elems; } in begin()
76 const_iterator begin() const { return elems; } in begin()
77 const_iterator cbegin() const { return elems; } in cbegin()
79 iterator end() { return elems+N; } in end()
80 const_iterator end() const { return elems+N; } in end()
81 const_iterator cend() const { return elems+N; } in cend()
124 return elems[i]; in operator []()
130 return elems[i]; in operator []()
134 reference at(size_type i) { rangecheck(i); return elems[i]; } in at()
[all …]
/ndk/sources/host-tools/sed-4.2.1/lib/
Dregex_internal.c974 set->elems = re_malloc (Idx, size); in re_node_set_alloc()
975 if (BE (set->elems == NULL, 0)) in re_node_set_alloc()
986 set->elems = re_malloc (Idx, 1); in re_node_set_init_1()
987 if (BE (set->elems == NULL, 0)) in re_node_set_init_1()
992 set->elems[0] = elem; in re_node_set_init_1()
1001 set->elems = re_malloc (Idx, 2); in re_node_set_init_2()
1002 if (BE (set->elems == NULL, 0)) in re_node_set_init_2()
1007 set->elems[0] = elem1; in re_node_set_init_2()
1014 set->elems[0] = elem1; in re_node_set_init_2()
1015 set->elems[1] = elem2; in re_node_set_init_2()
[all …]
Dregexec.c1277 if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context)) in check_halt_state_context()
1278 return state->nodes.elems[i]; in check_halt_state_context()
1308 Idx candidate = edests->elems[i]; in proceed_next_node()
1366 dest_node = dfa->edests[node].elems[0]; in proceed_next_node()
1708 Idx prev_node = cur_src->elems[i]; in build_sifted_states()
1871 dfa->inveclosures + dest_nodes->elems[i]); in add_epsilon_src_nodes()
1889 Idx cur_node = inv_eclosure->elems[ecl_idx]; in sub_epsilon_src_nodes()
1894 Idx edst1 = dfa->edests[cur_node].elems[0]; in sub_epsilon_src_nodes()
1896 ? dfa->edests[cur_node].elems[1] : REG_MISSING); in sub_epsilon_src_nodes()
1915 Idx cur_node = inv_eclosure->elems[ecl_idx]; in sub_epsilon_src_nodes()
[all …]
Dregcomp.c318 Idx node = init_state->nodes.elems[node_cnt]; in re_compile_fastmap_iter()
999 Idx node_idx = init_nodes.elems[i]; in create_initial_state()
1008 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; in create_initial_state()
1018 Idx dest_idx = dfa->edests[node_idx].elems[0]; in create_initial_state()
1501 org_dest = dfa->edests[org_node].elems[0]; in duplicate_node_closure()
1526 org_dest = dfa->edests[org_node].elems[0]; in duplicate_node_closure()
1554 org_dest = dfa->edests[org_node].elems[1]; in duplicate_node_closure()
1615 Idx *elems = dfa->eclosures[src].elems; in calc_inveclosure() local
1618 ok = re_node_set_insert_last (dfa->inveclosures + elems[idx], src); in calc_inveclosure()
1695 && !dfa->nodes[dfa->edests[node].elems[0]].duplicated) in calc_eclosure_iter()
[all …]
Dregex_internal.h229 Idx *elems; member
712 #define re_node_set_free(set) re_free ((set)->elems)
/ndk/sources/host-tools/nawk-20071023/
DFIXES168 subtle change to split: if source is empty, number of elems