Searched defs:tree (Results 1 - 15 of 15) sorted by relevance

/seL4-l4v-10.1.1/HOL4/src/patricia/
H A Dpatricia_castsLib.sml77 val tree = mk_some_ptree(fcpLib.index_type n, lhs (concl thm1)) value
/seL4-l4v-10.1.1/HOL4/polyml/samplecode/Foreign/
H A DForeignTest.c41 } *tree; typedef in typeref:struct:_tree
/seL4-l4v-10.1.1/HOL4/examples/HolCheck/
H A DstringBinTree.sml151 val tree = mk_let(mk_abs(mk_var("x",``:char list``), value
/seL4-l4v-10.1.1/HOL4/examples/formal-languages/regular/
H A DRegexp_Type.sig55 datatype tree type
H A DRegexp_Type.sml687 datatype tree = Ident of Char.char type
/seL4-l4v-10.1.1/HOL4/examples/separationLogic/src/
H A DtreeScript.sml22 val tree = Hol_datatype `tree = value
[all...]
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/
H A Dmemmgr.h64 SpaceTree *tree[256]; member in class:SpaceTreeTree
H A Dsavestate.cpp828 SpaceBTree *tree[256]; member in class:SpaceBTreeTree
[all...]
/seL4-l4v-10.1.1/HOL4/src/1/
H A DPmatch.sml407 val tree = List.foldl (fn (a,tm) => beta_conv (mk_comb(tm,a))) value
433 val tree = value
445 val tree = list_mk_comb(case_const', u::case_functions) value
[all...]
/seL4-l4v-10.1.1/isabelle/src/Tools/Metis/src/
H A DKeyMap.sml379 val tree = treeCombine left node right value
1033 val tree = treeNew () value
1040 val tree = treeSingleton key_value value
1086 val tree = treeInsert key_value tree value
1110 val tree = treeDelete dkey tree value
1169 val tree = treeMerge first second both tree1 tree2 value
1186 val tree = treeUnion f f2 tree1 tree2 value
1201 val tree = treeIntersect f tree1 tree2 value
1228 val tree = treeMapPartial f tree value
1241 val tree = treeMap f tree value
1341 val tree = treeUnionDomain tree1 tree2 value
1365 val tree = treeIntersectDomain tree1 tree2 value
1389 val tree = treeDifferenceDomain tree1 tree2 value
[all...]
H A DMap.sml371 val tree = treeCombine left node right value
1025 val tree = treeNew () value
1032 val tree = treeSingleton key_value value
1078 val tree = treeInsert compareKey key_value tree value
1102 val tree = treeDelete compareKey dkey tree value
1161 val tree = treeMerge compareKey first second both tree1 tree2 value
1178 val tree = treeUnion compareKey f f2 tree1 tree2 value
1193 val tree = treeIntersect compareKey f tree1 tree2 value
1220 val tree = treeMapPartial f tree value
1233 val tree = treeMap f tree value
1333 val tree = treeUnionDomain compareKey tree1 tree2 value
1357 val tree = treeIntersectDomain compareKey tree1 tree2 value
1381 val tree = treeDifferenceDomain compareKey tree1 tree2 value
[all...]
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/Metis/src/
H A DKeyMap.sml379 val tree = treeCombine left node right value
1033 val tree = treeNew () value
1040 val tree = treeSingleton key_value value
1086 val tree = treeInsert key_value tree value
1110 val tree = treeDelete dkey tree value
1169 val tree = treeMerge first second both tree1 tree2 value
1186 val tree = treeUnion f f2 tree1 tree2 value
1201 val tree = treeIntersect f tree1 tree2 value
1228 val tree = treeMapPartial f tree value
1241 val tree = treeMap f tree value
1341 val tree = treeUnionDomain tree1 tree2 value
1365 val tree = treeIntersectDomain tree1 tree2 value
1389 val tree = treeDifferenceDomain tree1 tree2 value
[all...]
H A DMap.sml371 val tree = treeCombine left node right value
1025 val tree = treeNew () value
1032 val tree = treeSingleton key_value value
1078 val tree = treeInsert compareKey key_value tree value
1102 val tree = treeDelete compareKey dkey tree value
1161 val tree = treeMerge compareKey first second both tree1 tree2 value
1178 val tree = treeUnion compareKey f f2 tree1 tree2 value
1193 val tree = treeIntersect compareKey f tree1 tree2 value
1220 val tree = treeMapPartial f tree value
1233 val tree = treeMap f tree value
1333 val tree = treeUnionDomain compareKey tree1 tree2 value
1357 val tree = treeIntersectDomain compareKey tree1 tree2 value
1381 val tree = treeDifferenceDomain compareKey tree1 tree2 value
[all...]
/seL4-l4v-10.1.1/HOL4/tools/mllex/
H A Dmllex.sml170 sig type tree type
180 datatype tree = empty | tree of key * color * tree * tree type
[all...]
/seL4-l4v-10.1.1/HOL4/src/n-bit/
H A DwordsLib.sml92 val tree = DB.theorems "words" value

Completed in 199 milliseconds