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

12345

/barrelfish-2018-10-04/lib/libc/stdlib/
H A Dhsearch.h31 #include <search.h>
H A Dhdestroy_r.c29 #include <search.h>
H A Dhcreate.c29 #include <search.h>
H A Dremque.c13 #include <search.h>
H A Dtfind.c4 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
24 #include <search.h>
H A Dhcreate_r.c29 #include <search.h>
H A Dinsque.c13 #include <search.h>
H A Dtwalk.c4 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
23 #include <search.h>
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsearch.tex30 \index{alternative search methods}
37 search(Variables),
45 Once the model is set up, we go into the search phase.
49 which have to be located by search, e.g.\ in order to find the best one.
58 \item The {\em search space} is the set of all possible total assignments.
59 \index{search space}
60 The search space is usually very large because it grows exponentially
74 \resizebox{0.55\textwidth}{!}{\includegraphics{../search/search3.eps}}
76 \caption{A search space of size 16}
79 Figure \ref{figsearchspace} shows a search spac
[all...]
/barrelfish-2018-10-04/lib/vfs/
H A Dvfs_fat.c121 struct fat_dirsearch search; member in struct:fat_dirhandle
218 dirsearch_initialize(struct fat_dirsearch *search, fat_direntry_t *parent) argument
220 memset(search, 0, sizeof(*search));
221 search->parent_direntry = parent;
225 dirsearch_wipe(struct fat_dirsearch *search, struct fat_mount *mount) argument
228 if (search->data) {
229 if (!search->parent_direntry && mount->fat_type == FAT_TYPE_FAT16) {
231 err = release_block(mount, search->data_key);
234 err = release_cluster(mount, search
325 next_f16_rootdir_block(struct fat_mount *mount, struct fat_dirsearch *search, uint8_t **data) argument
379 next_subdir_block(struct fat_mount *mount, struct fat_dirsearch *search, uint8_t **data) argument
450 read_next_direntry(struct fat_mount *mount, struct fat_dirsearch *search, char dosfn[12], uint16_t lfn_data[LFN_CHAR_COUNT], bool *has_lfn, uint8_t direntry_data[fat_direntry_size]) argument
568 struct fat_dirsearch search; local
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/
H A Dtestenc.com12 $ if f$search(test) .nes. "" then delete 'test';*
17 $ if f$search(test+"-cipher") .nes. "" then delete 'test'-cipher;*
18 $ if f$search(test+"-clear") .nes. "" then delete 'test'-clear;*
41 $ if f$search(test+"-"+i+"-cipher") .nes. "" then -
43 $ if f$search(test+"-"+i+"-clear") .nes. "" then -
H A Dtestca.com13 $ if f$search("demoCA.dir") .nes. ""
45 $ if f$search("newcert.pem") .nes. "" then delete newcert.pem;*
46 $ if f$search("newcert.pem") .nes. "" then delete newreq.pem;*
H A Dtestgen.com14 $ if f$search(T+".1;*") .nes. "" then delete 'T'.1;*
15 $ if f$search(T+".2;*") .nes. "" then delete 'T'.2;*
16 $ if f$search(T+".key;*") .nes. "" then delete 'T'.key;*
H A Dtverify.com24 $ f = f$search( pems)
56 $ if (f$search( "''temp_file_name';*") .nes. "") then -
H A Dtpkcs7.com15 $ if f$search("fff.*") .nes "" then delete fff.*;*
16 $ if f$search("ff.*") .nes "" then delete ff.*;*
17 $ if f$search("f.*") .nes "" then delete f.*;*
H A Dtpkcs7d.com15 $ if f$search("fff.*") .nes "" then delete fff.*;*
16 $ if f$search("ff.*") .nes "" then delete ff.*;*
17 $ if f$search("f.*") .nes "" then delete f.*;*
H A Dtcrl.com15 $ if f$search("fff.*") .nes "" then delete fff.*;*
16 $ if f$search("ff.*") .nes "" then delete ff.*;*
17 $ if f$search("f.*") .nes "" then delete f.*;*
H A Dtreq.com15 $ if f$search("fff.*") .nes "" then delete fff.*;*
16 $ if f$search("ff.*") .nes "" then delete ff.*;*
17 $ if f$search("f.*") .nes "" then delete f.*;*
H A Dtsid.com15 $ if f$search("fff.*") .nes "" then delete fff.*;*
16 $ if f$search("ff.*") .nes "" then delete ff.*;*
17 $ if f$search("f.*") .nes "" then delete f.*;*
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/
H A Ddeltree.com15 $ _f = f$search(_fp)
21 $ if f$search(_fp) .eqs. "" then goto dt_exit
/barrelfish-2018-10-04/lib/concurrent/
H A Dlinked_list.c19 static struct ll_element *search(struct ll_element *head, function
92 struct ll_element *node = search(head, tail, &prev, key);
119 right_node = search(head, tail, &left_node, new_key);
141 right_node = search(head, tail, &left_node, key);
156 right_node = search(head, tail, &left_node, right_node->key);
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex50 %%This tutorial is an overwiew of different search methods to Prolog,
67 search(Variables),
75 Once the model is set up, we go into the search phase.
79 which have to be located by search, e.g.\ in order to find the best one.
87 \item The {\em search space} is the set of all possible total assignments.
88 The search space is usually very large because it grows exponentially
104 \caption{A search space of size 16}
107 Figure \ref{figsearchspace} shows a search space with N (here 16)
111 We can classify search methods according to different criteria:
113 \item[Complete vs incomplete exploration] complete search mean
[all...]
/barrelfish-2018-10-04/tools/harness/tests/
H A Didctest.py26 if re.search(MATCH_RE, line):
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dgfd.tex60 search is done in \eclipse, using GFD's \verb'labeling/1', which essentially
71 search to solve the problem can be done at the
73 or the whole search can be performed by Gecode itself using one of its
74 search engines.
205 a reduction in performance, as there is no reduction in search space from the
898 GFD allows search to be performed in two ways:
903 Additionally, GFD support various search facilities of Gecode that is
906 \subsection{Performing search completely inside Gecode}
908 Search can be performed in Gecode using one of its search engines.
910 case, the search t
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Ddfid.pl37 * Bounded depth-first search rule for Sepia.
38 * This library file allows to use two search rules with limited depth:
43 * the search is repeated for a depth incremented by
46 * breadth-first search. It is slightly slower than breadth
47 * first search, but it uses much less memory.
58 * 2) Depth-first search with limited depth. This is a special case
59 * of the above, where search is performed only up to a certain

Completed in 200 milliseconds

12345