Searched refs:nodes (Results 101 - 125 of 153) sorted by relevance
1234567
/seL4-l4v-10.1.1/isabelle/src/Tools/jEdit/src/ |
H A D | pretty_text_area.scala | 44 val nodes0 = version0.nodes
|
H A D | plugin.scala | 145 case Some(version) => resources.undefined_blobs(version.nodes)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/PIDE/ |
H A D | query_operation.scala | 87 val removed = !snapshot.version.nodes(cmd.node_name).commands.contains(cmd)
|
H A D | protocol.scala | 182 val node = version.nodes(name)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/jEdit/src/ |
H A D | pretty_text_area.scala | 44 val nodes0 = version0.nodes
|
H A D | plugin.scala | 145 case Some(version) => resources.undefined_blobs(version.nodes)
|
/seL4-l4v-10.1.1/graph-refine/ |
H A D | search.py | 141 assert all ([p.nodes[n].kind == 'Cond' for n in poss]) 143 for n in poss for c in p.nodes[n].get_conts () 379 """get the set of nodes visited on the entry path entry 393 new_conts = [n2 for n2 in rep.p.nodes[n].get_conts () 1018 node_restrs = set (p.nodes) 1426 ns = [n for n in loop if rep.p.nodes[n].kind == 'Call'] 1550 if [n for n in body if p.nodes[n].kind == 'Call']: 1553 exit_nodes = set ([n for n in body for n2 in p.nodes[n].get_conts () 1555 assert set ([p.nodes[n].kind for n in exit_nodes]) <= set (['Cond']) 1562 rv = linear_const_comparison (p, exit_n, p.nodes[exit_ [all...] |
H A D | solver.py | 2161 if fun.nodes[n].get_conts ()[1:] == ['Err'] 2162 if fun.nodes[n].cond != syntax.false_term] 2167 vs = syntax.get_node_rvals (fun.nodes[n]) 2170 r = solv.test_hyp (syntax.mk_not (fun.nodes[n].cond), env)
|
/seL4-l4v-10.1.1/HOL4/examples/machine-code/graph/ |
H A D | GraphLangScript.sml | 61 (* The type of nodes. *) 716 ``!nodes i x. 717 MEM (i,x) nodes /\ ALL_DISTINCT (MAP FST nodes) ==> 718 (graph nodes i = SOME x)``, 1096 (list_func_trans fs name = SOME (GraphFunction x1 x2 (graph nodes) x3)) /\ 1097 ODD k /\ LIST_SUBSET (SND (next_trans i k next)) nodes /\ 1098 ALL_DISTINCT (MAP FST nodes) /\ next_ok next /\ 1309 SOME (GraphFunction x1 x2 (graph nodes) x3)) /\ ODD k /\ 1310 LIST_SUBSET (SND (next_trans i k next)) nodes /\ [all...] |
H A D | func_decompileLib.sml | 52 val msg = "The graph for `" ^ sec_name ^ "` has " ^ node_count ^ " nodes."
|
/seL4-l4v-10.1.1/HOL4/tools/Holmake/poly/ |
H A D | BuildCommand.sml | 332 diag (fn _ => "Looking for other nodes with buildscript "^script); 444 diag (fn _ => "Failed nodes: \n"^String.concatWith "\n" (map str ns));
|
/seL4-l4v-10.1.1/HOL4/tools/mlyacc/src/ |
H A D | lalr.sml | 196 val new_nodes = map map_core (nodes graph) 479 val lookahead = List.concat (map scan_core (nodes graph))
|
/seL4-l4v-10.1.1/HOL4/src/parse/ |
H A D | Preterm.sml | 204 pretypes to types. Overloaded nodes cause failure if one is 205 encountered, as Overloaded nodes should be gone by the time clean 269 if a flag is set. No "Overloaded" nodes are allowed in the preterm: 373 * replace Overloaded _ nodes with Consts where it can be shown that only *
|
/seL4-l4v-10.1.1/HOL4/examples/muddy/muddyC/ |
H A D | muddy.c | 133 EXTERNML value mlbdd_bdd_init(value nodes, value cachesize) /* ML */ argument 137 bdd_init(Int_val(nodes), Int_val(cachesize));
|
/seL4-l4v-10.1.1/isabelle/src/Tools/VSCode/src/ |
H A D | server.scala | 247 update_output(changed.nodes.toList.map(resources.node_file(_))) 298 if (change.deps_changed || undefined_blobs(change.version.nodes).nonEmpty)
|
H A D | vscode_resources.scala | 243 case Some(version) => undefined_blobs(version.nodes)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/VSCode/src/ |
H A D | server.scala | 247 update_output(changed.nodes.toList.map(resources.node_file(_))) 298 if (change.deps_changed || undefined_blobs(change.version.nodes).nonEmpty)
|
H A D | vscode_resources.scala | 243 case Some(version) => undefined_blobs(version.nodes)
|
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/MLCompiler/CodeTree/ |
H A D | BaseCodeTree.sml | 614 (* We use these functions to allow all nodes to be processed even if 615 they are not full codetree nodes. *)
|
/seL4-l4v-10.1.1/isabelle/src/Pure/PIDE/ |
H A D | protocol.scala | 182 val node = version.nodes(name)
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/ |
H A D | CFG.sml | 242 Binaryset.addList(Binaryset.empty intOrder, Graph.suc(n,cfg)))) (Graph.nodes cfg)));
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/ |
H A D | CFG.sml | 243 Binaryset.addList(Binaryset.empty intOrder, Graph.suc(n,cfg)))) (Graph.nodes cfg)));
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.2/ |
H A D | CFG.sml | 243 Binaryset.addList(Binaryset.empty intOrder, Graph.suc(n,cfg)))) (Graph.nodes cfg)));
|
/seL4-l4v-10.1.1/HOL4/src/prekernel/ |
H A D | Lib.sml | 273 deps = map from nodes to adjacency lists *)
|
/seL4-l4v-10.1.1/HOL4/src/tactictoe/src/ |
H A D | tttSearch.sml | 36 (* 100000 is the maximum number of nodes *) 630 Creating new nodes 890 debug_proof (" nodes : " ^ int_to_string (!pid_counter));
|
Completed in 129 milliseconds
1234567