Searched refs:search (Results 1 - 25 of 102) sorted by relevance

12345

/haiku-buildtools/jam/
H A Dsearch.h8 * search.h - find a target along $(SEARCH) or $(LOCATE)
13 const char *search( const char *target, time_t *time );
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/search/requirements/explicit_instantiation/
H A D2.cc35 template iterator_type search(iterator_type, iterator_type,
38 template iterator_type search(iterator_type, iterator_type,
H A Dpod.cc34 template iterator_type search(iterator_type, iterator_type,
37 template iterator_type search(iterator_type, iterator_type,
/haiku-buildtools/legacy/gcc/texinfo/info/
H A Dsearch.c0 /* search.c -- How to search large bodies of text. */
26 #include "search.h"
29 /* The search functions take two arguments:
31 1) a string to search for, and
34 and end of the search.
77 The search is forwards if BINDING->start is greater than BINDING->end. */
79 search (string, binding)
85 /* If the search is backwards, then search backward
78 search (string, binding) function
456 SEARCH_BINDING search; local
487 SEARCH_BINDING search; local
[all...]
H A Dinfo-utils.c145 SEARCH_BINDING search;
148 search.buffer = node->contents;
149 search.start = 0;
150 search.end = node->nodelen;
151 search.flags = S_FoldCase;
154 position = search_forward (INFO_MENU_LABEL, &search);
161 search.start = position + strlen (INFO_MENU_LABEL);
162 search.start += skip_line (search.buffer + search
144 SEARCH_BINDING search; local
174 SEARCH_BINDING search; local
216 SEARCH_BINDING search; local
[all...]
H A Dsearch.h0 /* search.h -- Structure used to search large bodies of text, with bounds.
2 $Id: search.h,v 1.1 2004/10/28 18:14:09 zooey Exp $
25 /* The search functions take two arguments:
27 1) a string to search for, and
30 and end of the search.
39 char *buffer; /* The buffer of text to search. */
40 long start; /* Offset of the start of the search. */
42 int flags; /* Flags controlling the type of search. */
49 extern long search_forward (), search_backward (), search ();
[all...]
H A Dnodes.c27 #include "search.h"
199 /* Return the results of our node search. */
335 That is to say, search along INFOPATH and expand tildes, etc. */
606 SEARCH_BINDING *search;
609 search = copy_binding (buffer_binding);
612 position = find_tags_table (search);
619 search->start = position;
620 search->start += skip_node_separator (search->buffer + search
603 SEARCH_BINDING *search; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/search/
H A D1.cc18 // 25.1.5 [lib.alg.search]
27 using std::search;
40 VERIFY(search(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array1);
41 VERIFY(search(con2.begin(), con2.end(), con1.begin(), con1.end()).ptr == array1);
50 VERIFY(search(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr
60 VERIFY(search(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr
70 VERIFY(search(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr
80 VERIFY(search(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr
95 VERIFY(search(con1.begin(), con1.end(), endcon.begin(), endcon.end()).ptr
97 VERIFY(search(con
[all...]
H A Dcheck_type.cc18 // 25.1.9 [lib.alg.search]
60 { return std::search(s1, s1, s2, s2); }
64 { return std::search(s1, s1, s2, s2); }
68 { return std::search(x1, x1, x2, x2, predicate); }
72 { return std::search(x1, x1, x2, x2, predicate); }
/haiku-buildtools/gcc/libstdc++-v3/testsuite/experimental/algorithm/
H A Dsearch.cc36 auto res = std::experimental::search(i, i + 2, nocopy{});
/haiku-buildtools/gcc/gcc/config/arm/
H A Ddriver-arm.c138 const char *search[] = {NULL, "arch"}; local
143 search[0] = argv[0];
144 for (opt = 0; opt < ARRAY_SIZE (search); opt++)
146 if (strcmp (configure_default_options[i].name, search[opt]) == 0)
147 return concat ("-m", search[opt], "=",
/haiku-buildtools/legacy/binutils/opcodes/
H A Dcgen-opc.c147 /* Initialize a keyword table search.
148 SPEC is a specification of what to search for.
152 The result is an opaque data item used to record the search status.
158 CGEN_KEYWORD_SEARCH search; local
167 search.table = kt;
168 search.spec = spec;
169 search.current_hash = 0;
170 search.current_entry = NULL;
171 return search;
178 cgen_keyword_search_next (CGEN_KEYWORD_SEARCH *search) argument
[all...]
/haiku-buildtools/binutils/opcodes/
H A Dcgen-opc.c143 /* Initialize a keyword table search.
144 SPEC is a specification of what to search for.
148 The result is an opaque data item used to record the search status.
154 CGEN_KEYWORD_SEARCH search; local
163 search.table = kt;
164 search.spec = spec;
165 search.current_hash = 0;
166 search.current_entry = NULL;
167 return search;
174 cgen_keyword_search_next (CGEN_KEYWORD_SEARCH *search) argument
[all...]
/haiku-buildtools/legacy/gcc/gcc/
H A Dvmsconfig.com16 $ if f$search("config.h") .nes. "" then delete config.h.*
29 $ if f$search("tconfig.h") .nes. "" then delete tconfig.h.*
37 $ if f$search("hconfig.h") .nes. "" then delete hconfig.h.*
45 $ if f$search("tm.h") .nes. "" then delete tm.h.*
76 $ if f$search("config-''arch'.h") .nes. "" then delete config-'arch'.h;*
86 $ if f$search("''arch'.md") .nes. "" then delete 'arch'.md;*
91 $ if f$search("aux-output.c") .nes. "" then delete aux-output.c.*
99 $search version.c version_string,"="/match=and/output=t.tmp
126 $if f$search("Makefile.in").eqs."" .and. f$search("
[all...]
H A Dmake-l2.com17 $ if f$search("gcc-cc1.exe").eqs.""
25 $ if f$search("gcc-cpp.exe").eqs.""
38 $ if f$search("gcc-cc1plus.exe").eqs.""
120 $ if f$search("libgcc2-cxx.list").eqs."" then goto cxx_done
/haiku-buildtools/legacy/binutils/ld/
H A Dldfile.c97 /* Adds NAME to the library search path.
153 If we can't open the file as an object file, stop the search
303 search_dirs_type *search; local
331 for (search = search_head; search != NULL; search = search->next)
337 if (ldemul_open_dynamic_archive (arch, search, entry))
339 entry->sysrooted = search->sysrooted;
344 string = xmalloc (strlen (search
468 search_dirs_type *search; local
[all...]
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/
H A Dcancel-taskgroup-1.c10 search (struct T *tree, int val, int lvl) function
19 struct T *r = search (tree->children[i], val, lvl + 1);
38 ret = search (tree, val, 0);
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/
H A Dbug393.go8 // was trying binary search with an interface type
/haiku-buildtools/binutils/gas/testsuite/gas/arm/
H A Dthumb2_it_search.d1 #name: 32-bit Thumb conditional instructions backward search
/haiku-buildtools/gcc/libstdc++-v3/scripts/
H A Dmake_graph.py136 if self.native_re.search(cntnr):
144 if self.mask_re.search(cntnr):
146 elif self.mod_re.search(cntnr):
148 elif self.rb_tree_mmap_rb_tree_set_re.search(cntnr):
151 elif self.rb_tree_mmap_lu_mtf_set_re.search(cntnr) or cntnr == 'rc_binomial_heap':
154 elif self.splay_tree_re.search(cntnr) or cntnr == 'binomial_heap':
157 elif self.rb_tree_re.search(cntnr) or cntnr == 'binary_heap':
160 elif self.ov_tree_re.search(cntnr) or cntnr == 'thin_heap':
163 elif self.pat_trie_re.search(cntnr) or cntnr == 'pairing_heap':
174 if self.lc_1div8_1div2_re.search(cntn
[all...]
/haiku-buildtools/binutils/ld/
H A Dldfile.c94 /* Adds NAME to the library search path.
155 If we can't open the file as an object file, stop the search
333 search_dirs_type *search; local
357 for (search = search_head; search != NULL; search = search->next)
363 if (ldemul_open_dynamic_archive (arch, search, entry))
368 string = concat (search->name, slash, lib, entry->filename,
371 string = concat (search
539 search_dirs_type *search; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/experimental/functional/
H A Dsearchers.cc52 auto res = std::search(h, he, n, ne);
85 auto res = std::search(h, he, n, ne);
122 auto res = std::search(haystack, he, needle, ne, eq);
/haiku-buildtools/legacy/binutils/libiberty/
H A Dvmsbuild.com7 $ SEARCH= "search /Exact"
19 $! anything not caught by link+search of dummy.* should be added here
43 $ if f$search("dummy.obj").nes."" then DELETE dummy.obj;*
50 $ if f$search("dummy.obj").eqs."" then goto pass2_failure1
59 $ if f$search("dummy.map").eqs."" then goto pass2_failure2
109 $ if pass.eq.3 .and. f$search("''f'.c").eqs."" then gosub chk_deffunc
/haiku-buildtools/legacy/gcc/libiberty/
H A Dvmsbuild.com7 $ SEARCH= "search /Exact"
19 $! anything not caught by link+search of dummy.* should be added here
43 $ if f$search("dummy.obj").nes."" then DELETE dummy.obj;*
50 $ if f$search("dummy.obj").eqs."" then goto pass2_failure1
59 $ if f$search("dummy.map").eqs."" then goto pass2_failure2
109 $ if pass.eq.3 .and. f$search("''f'.c").eqs."" then gosub chk_deffunc
/haiku-buildtools/gcc/zlib/contrib/minizip/
H A Dmake_vms.com1 $ if f$search("ioapi.h_orig") .eqs. "" then copy ioapi.h ioapi.h_orig

Completed in 203 milliseconds

12345