Searched refs:second (Results 1 - 25 of 112) sorted by relevance

12345

/barrelfish-2018-10-04/lib/mdb/
H A Dmdb_tree.c636 struct cte *second)
641 set_root(second);
644 N(first_parent)->left = second;
647 N(first_parent)->right = second;
656 struct cte *second, struct cte *second_parent)
661 mdb_exchange_child(first, first_parent, second);
662 mdb_exchange_child(second, second_parent, first);
665 N(first)->left = N(second)->left;
666 N(second)->left = tmp_node;
669 N(first)->right = N(second)
635 mdb_exchange_child(struct cte *first, struct cte *first_parent, struct cte *second) argument
655 mdb_exchange_nodes(struct cte *first, struct cte *first_parent, struct cte *second, struct cte *second_parent) argument
1018 mdb_choose_surrounding(genpaddr_t address, size_t size, struct cte *first, struct cte *second) argument
1043 mdb_choose_inner(genpaddr_t address, size_t size, struct cte *first, struct cte *second) argument
1068 mdb_choose_partial(genpaddr_t address, size_t size, struct cte *first, struct cte *second) argument
1317 struct cte *first, *second; local
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/
H A Dtestss72 echo second generated request is invalid
134 echo "sign second proxy certificate request with the first proxy certificate via 'x509'"
137 echo "error using 'x509' to sign a second proxy certificate request"
157 echo The second generated proxy certificate is $P2cert
158 echo The second generated proxy private key is $P2key
H A Dtests.com150 $ write sys$output "test second x509v3 certificate"
/barrelfish-2018-10-04/usr/skb/programs/
H A Dplat_VE_A15x4_A7x4.pl26 % A second cluster of four Cortex A5s
/barrelfish-2018-10-04/usr/tests/cxx/
H A Dcxx11.cpp55 for(auto val : kvp.second)
/barrelfish-2018-10-04/lib/cxx/cxxabi/
H A Dcxa_demangle.cpp61 printf("{%s#%s}\n", s.first.c_str(), s.second.c_str());
71 printf("{%s#%s}", s.first.c_str(), s.second.c_str());
87 printf("{%s#%s}", s.first.c_str(), s.second.c_str());
788 // ::= fp <top-level CV-qualifiers> <parameter-2 non-negative number> _ # L == 0, second and later parameters
790 // ::= fL <L-1 non-negative number> p <top-level CV-qualifiers> <parameter-2 non-negative number> _ # L > 0, second and later parameters
1308 db.names.back().first += db.names.back().second;
1309 db.names.back().second = typename C::String();
1648 db.names.back().second.insert(0, sig);
1675 if (func.second.front() == '(')
1678 db.names.back().second
4864 StrT second; member in struct:__cxxabiv1::__anon587::string_pair
[all...]
/barrelfish-2018-10-04/lib/libc/iconv/
H A Dbsd_iconv.c192 qsort_helper(const void *first, const void *second) argument
198 s2 = second;
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/
H A Do_time.c175 short year, month, day, hour, minute, second, member in struct:vms_vectime
198 result->tm_sec = time_values.second;
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dorder.pl45 % i.e. that the second argument is ordered if you regard the
H A Dproject.pl49 % This is second best. Doing it this way does mean that you can
H A Doccur.pl98 % Dec-10 compiler, which is why the second 'arg' call follows the replace
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dic_make_overlap_bivs.pl37 This variable will be set to the amount of resource used by the second
38 task, if the second task is in progress at the start of the first task.
100 second task.
H A Dmake_overlap_bivs.pl37 This variable will be set to the amount of resource used by the second
38 task, if the second task is in progress at the start of the first task.
100 second task.
/barrelfish-2018-10-04/lib/cxx/cxx/
H A Dthread.cpp197 i->second->unlock();
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextconjunto.tex292 In the second example an additional constraint restricts the cardinality of
487 of the set is ground and some element has been added to the second
515 exponential too. A second reason is that no specific information can
810 inclusion) in the second one \verb/check_incl/. This
812 itself in this case) is a subset of at least one element of the second
814 \item We check if the first set is ground and the second is a set
816 ground set and the upper bound of the second set. If it succeeds then
823 \item We check if the second set is ground and the first one is a set
825 the first set and the second ground set. If it succeeds then the upper
832 in the upper bound of the second on
[all...]
H A Dextpropia.tex87 The second argument of \verb0infers0 defines how much propagation
192 or else $ST2>6+5$ (to satisfy the second clause). There is no value for
313 Using the second version of \verb0sum0,
413 In the second example, by contrast, \verb0infers unique0 yields the same
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Ddatabase-sec.tex203 the second has the name `p1364r1' allocated by the system and is temporary.
286 and the second a variable. The variable then becomes instantiated to
526 the retrievals. Therefore the second solution requires only about
667 The second example inserts tuples explicitly given in a list.
717 Again, as illustrated in the second case above, the right hand side
737 the second attribute equal to `eder' will be removed,
819 tuple is viewed as a Prolog structure; in the second, as a list
844 The second argument is a list of length equal
868 The second example is an extension of the example in the previous section,
911 to {\bf retr\_tup/3} or as instantiation of the second argumen
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ms/
H A Dtestss.bat86 echo second generated request is invalid
H A Dtestssce.bat92 echo second generated request is invalid
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dlips.pl49 Measure the system's speed in logical inferences per second, using
66 list as the first and a variable as the second argument. This
H A Dmatrix_util.pl101 file may be read, in the second, the list may not be fully instantiated.
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/
H A DTOUR.tcl126 -list {{first choice} {second} {another choice} {final choice}}]
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dprogramanalysis.tex78 the profiling mode, which means that every 100th of a second the
111 currently executing goal 100 times a second.
338 second argument defining a number of flags which control (amongst
H A Dprolog.tex305 the first one is true because both conjuncts are true, the second is false:
333 The second answer will only be given after the user has explicitely
538 implies that X is an ancestor of Y. The second rule, which specifies
794 %The partially reversed list is being constructed in the second argument of
816 %second list appended to that.
832 %The situation is as shown in the figure. By setting E1 to L2, the second
971 second clause for {\tt min}. So there is a double drawback:
973 unsuccessful evaluation of the second clause costs execution time.
983 second clause will never be executed if the first clause passed the
984 cut. This effectively makes the test in the second claus
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex166 The NDI-Mapper\index{NDI mapper} in RiskWise is an example of the second application type (see figure~\ref{batchtypeapplication}). The application reads some data files (defined in a clear specification), performs some operation on the data and produces results in another set of data files. The top-level query typically just states where the data should be found and where the results should be written to. This batch command \index{batch processing}then internally calls more detailed routines to load data, etc.
169 For each required function of the interface, we should define a specific query\index{query}. The query consists of three parts. The first is the predicate name, which obviously should have a relation to the intended function. The second part consists of the input arguments\index{input arguments}, which are used to pass information from the outside to the problem solver. The structure of these arguments should be as simple as possible, easy to generate and to analyze. The third part consists of the output arguments\index{output arguments}, which are used to pass information from the problem solver back to the calling interface. When calling the query these arguments will be free variables, which are instantiated inside the solver to some result data structure.
244 The second high-level design is a data transformation\index{data transformation} structure, used for example in the NDI-Mapper\index{NDI mapper} application. It consists of three parts.
430 \item[data files] The second alternative is to use data files in a fixed format. The ECLiPSe program then has to read these files and build the internal data structures at the same time. Depending on the format, this may require parsing the input format with definite clause grammars (DCG) \index{DCG}\index{definite clause grammar}(see section \ref{howtousedcgs}), adding to the development effort\footnote{ECLiPSEe 5.4 contains a freeware XML (http://www.xml.org) parser which handles most of the detail of parsing XML files. This makes the use of XML as a data exchange format for ECLiPSe are very exiting new possibility. The parser is described in the ``Third Party Library'' section of the reference manual.}. But as the files can be read and written easily, it is quite simple to create test data sets and to analyze problems by hand. The design for the fixed format may require some extra effort if we want to use the full character set for atoms and strings. A proper quoting mechanism may be required in order to distinguish say a comma separator from a comma contained inside a data field.
504 \index{structure, nested}\index{nested structure}A very common data representation problem is how to access information about some structure from another structure, for example in RiskWise how to access the information about a router from an interface of the router. There are two main alternatives. The first is to insert the data of the first entity (router) directly in the representation of the second entity (interface) as an additional attribute, the second is to store a key which can be used to look up the entity. Although the first method has the advantage of avoiding the extra lookup, we do not recommend this approach. If we have recursive references to objects (in our example above if the router also contains a link to all its interfaces) then this direct representation becomes an infinite data structure, which causes problems for printing and debugging. If we use the second approach, we obviously need a way to find the entity belonging to a particular key without too much overhead. The choice of the key depends on the representation of our overall data structure, which we will discuss in the next sections.
671 \index{iteration, list}\index{list}This concept is used to perform some action on each element of a list. There are two implementations given here. The first uses the {\it do}\index{do loop}\index{loop} loop of ECLiPSe, the second uses recursion\index{recursion} to achieve the same purpose. In the {\it do} loop, the {\it foreach}\index{foreach} keyword describes an action for each element of a list. The first argument (here $X$) is a formal parameter\index{formal parameter} of the loop. At each iteration, it will be bound to one element of the list. The second argument is the list over which we iterate.
673 It is a matter of style whether to use the first or second varian
[all...]

Completed in 237 milliseconds

12345