/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | decoding_net.pl | 32 %% Used to enumerate names on nodes, to use them in capabilities.
|
H A D | queries.pl | 175 % obtains the number of available nodes
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | flat.pl | 36 nodes are anything not labelled by the operator) and flatten it
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | search.tex | 126 search tree (Figure \ref{figsearchtree}). The nodes in this tree 272 In general, the nodes of a search tree represent {\em choices}. 314 which means that the search tree nodes correspond to a variable 350 nodes in the tree (but not the number of leaves). To keep the number of nodes 360 the child nodes of a node by choosing the 457 factor at the root of the search tree and the total number of internal nodes. 776 credit. This credit is split between the child nodes, their credit 777 between their child nodes, and so on. A single unit of credit cannot 816 number of leaf nodes tha [all...] |
H A D | constimpl.tex | 106 A CSP network is the graph formed by considering the variables as nodes
|
H A D | eplex.tex | 552 the non-integer value of 4.2. In the subsequent nodes of the tree, we
|
H A D | propiachr.tex | 644 This can be achieved by finding {\em cliques} in the graph whose nodes
|
H A D | hybrid.tex | 633 messages \verb0QtyP0 along each path $P$ between the two nodes.
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/grace/ |
H A D | prop.pl | 266 % Make a list of all nodes which have modified the given variable 448 setval(nodes, Length), 451 getval(nodes, X).
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/ |
H A D | req.c | 115 * -nodes - no des encryption 174 int nodes=0,kludge=0,newhdr=0,subject=0,pubkey=0; local 321 else if (strcmp(*argv,"-nodes") == 0) 322 nodes=1; 407 BIO_printf(bio_err," -nodes don't encrypt the output key\n"); 739 if (nodes) cipher=NULL;
|
H A D | apps.c | 2426 STACK_OF(X509_POLICY_NODE) *nodes) 2431 if (nodes) 2434 for (i = 0; i < sk_X509_POLICY_NODE_num(nodes); i++) 2436 node = sk_X509_POLICY_NODE_value(nodes, i); 2425 nodes_print(BIO *out, const char *name, STACK_OF(X509_POLICY_NODE) *nodes) argument
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | vbs_router.pl | 83 nodes(Nodes),
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 147 search tree (Figure \ref{figsearchtree}). The nodes in this tree 275 In general, the nodes of a search tree represent {\em choices}. 317 which means that the search tree nodes correspond to a variable 352 nodes in the tree (but not the number of leaves). To keep the number of nodes 361 the child nodes of a node by choosing the 456 factor at the root of the search tree and the total number of internal nodes. 699 credit. This credit is split between the child nodes, their credit 700 between their child nodes, and so on. A single unit of credit cannot 739 number of leaf nodes tha [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ilog/ |
H A D | fd_ilog.pl | 305 Next :: 0..NbNodes % NbNodes+1 for end nodes when MaxNbPaths=0
|
/barrelfish-2018-10-04/usr/skb/testapps/ |
H A D | apps.c | 2426 STACK_OF(X509_POLICY_NODE) *nodes) 2431 if (nodes) 2434 for (i = 0; i < sk_X509_POLICY_NODE_num(nodes); i++) 2436 node = sk_X509_POLICY_NODE_value(nodes, i); 2425 nodes_print(BIO *out, const char *name, STACK_OF(X509_POLICY_NODE) *nodes) argument
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | fdglobal.tex | 79 predecessors of nodes in a digraph.
|
H A D | gfd.tex | 850 Pred to be the predecessors of nodes in a digraph. A version with offsets
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/ |
H A D | clients.tex | 174 as connected nodes, where the textual representation of the 175 \viewable{} elements is displayed at nodes and along edges. 463 the appropriate nodes on the background image the user could more
|
H A D | annotate.tex | 306 [node_property([0->[name(nodes), label]]),
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 198 \item There can be no backbone line between two net nodes. 199 \item There is at most one direct connection between two nodes, each line is uniquely described by the pair (Node1, Node2). 200 \item If there is a connection (Node1, Node2) between two nodes, then we cannot have the inverse connection (Node2, Node1) as well. 271 It can be helpful to draw a data flow graph\index{data flow graph} of the system as a directed graph, showing the main components as nodes and links between sources and sinks of information. A graph of this form should not contain any cycles, and if many links exist between two nodes, we may have to reconsider the split of functionality between. 359 "Nodes":"a nodes data structure", 363 "CMatrix":"a matrix (indexed by nodes) of contributions to 365 "FMatrix":"a matrix (indexed by nodes) of flow variables", 490 "nodes":"list of nodes whic [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | heaps.pl | 58 The nodes of the tree are notionally numbered like this:
|
H A D | tracer_tcl.pl | 474 /* returns `position' information for the children of all inspector's nodes 475 These nodes are of different ECLiPSe types, and the `positions'
|
/barrelfish-2018-10-04/usr/eclipseclp/Mercury/ |
H A D | m_tree234.pl | 1241 % approach described in eg Sedgwick which splits 4 nodes into 1242 % two 2 nodes on the downward traversal of the tree as we 1246 % work because we already split 4 nodes into 2 nodes), or if the
|
/barrelfish-2018-10-04/doc/000-overview/ |
H A D | Overview.tex | 616 such as different NUMA nodes, or low-memory accessible to legacy DMA
|