Home
last modified time | relevance | path

Searched refs:subForest (Results 1 – 25 of 58) sorted by relevance

123

/dports/lang/purescript/purescript-0.14.5/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/games/hs-scroll/scroll-1.20180421/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-hasktags/hasktags-0.72.0/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-mueval/mueval-0.9.3/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-hlint/hlint-3.3.4/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-ormolu/ormolu-0.4.0.0/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-hoogle/hoogle-5.0.18.2/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/elm-format/elm-format-0.8.3/_cabal_deps/syb-0.7.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/misc/hs-hascard/hascard-0.3.0.1/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/stack/stack-2.7.3/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/textproc/hs-pandoc-crossref/pandoc-crossref-0.3.12.0/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/textproc/hs-pandoc/pandoc-2.14.2/_cabal_deps/syb-0.7.2.1/tests/
H A DTree.hs62subForest = [Node {rootLabel = "(:)", subForest = [Node {rootLabel = "D", subForest = [Node {rootL…
/dports/devel/hs-threadscope/threadscope-0.2.14/GUI/
H A DTraceView.hs111 subForest = [ Node { rootLabel = (TraceHEC k, Visible), function
112 subForest = [] } function
115 subForest = [ Node { rootLabel = (TraceInstantHEC k, Hidden), function
116 subForest = [] } function
119 subForest = [ Node { rootLabel = (TraceCreationHEC k, Hidden), function
120 subForest = [] } function
123 subForest = [ Node { rootLabel = (TraceConversionHEC k, Hidden), function
124 subForest = [] } function
127 subForest = [ Node { rootLabel = (TracePoolHEC k, Hidden), function
128 subForest = [] } function
/dports/misc/vxl/vxl-3.3.2/contrib/mul/clsfy/
H A Dclsfy_random_forest.cxx270 clsfy_random_forest subForest; in merge_sub_forests() local
271 vsl_b_read(bfs_in, subForest); in merge_sub_forests()
273 large_forest.trees_.reserve(large_forest.trees_.size()+subForest.trees_.size()); in merge_sub_forests()
275 subForest.trees_.begin(),subForest.trees_.end()); in merge_sub_forests()
288 const clsfy_random_forest& subForest=**subForestIter; in merge_sub_forests() local
289 large_forest.trees_.reserve(large_forest.trees_.size()+subForest.trees_.size()); in merge_sub_forests()
291 subForest.trees_.begin(),subForest.trees_.end()); in merge_sub_forests()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Data/Graph/Test/
H A DTyped.hs90 , subForest = [ Node { rootLabel = 5 function
91 , subForest = [] }]} function
93 , subForest = [ Node { rootLabel = 4 function
94 , subForest = [] }]}] function
126 … , subForest = [ Node { rootLabel = 5 function
127 … , subForest = [] }]} function
129 , subForest = [] }] function
/dports/devel/hs-threadscope/threadscope-0.2.14/_cabal_deps/gtk-0.15.5/demo/treelist/
H A DTreeDemo.hs56 Tree.subForest = [leafNode Phone { name = "Bar", number = 11, marked = True }
61 Tree.subForest = [leafNode Phone { name = "Bar", number = 21, marked = True }
66 Tree.subForest = [leafNode Phone { name = "Bar", number = 31, marked = True }
69 where leafNode a = Tree.Node { Tree.rootLabel = a, Tree.subForest = [] }
H A DTreeTest.hs103 Tree.subForest = [leafNode Phone { name = "Bar", number = 11, marked = True }
108 Tree.subForest = [leafNode Phone { name = "Bar", number = 21, marked = True }
113 Tree.subForest = [leafNode Phone { name = "Bar", number = 31, marked = True }
116 where leafNode a = Tree.Node { Tree.rootLabel = a, Tree.subForest = [] }
/dports/x11/conlecterm/conlecterm-1.4.3.0/_cabal_deps/gtk3-0.15.5/demo/treelist/
H A DTreeDemo.hs56 Tree.subForest = [leafNode Phone { name = "Bar", number = 11, marked = True }
61 Tree.subForest = [leafNode Phone { name = "Bar", number = 21, marked = True }
66 Tree.subForest = [leafNode Phone { name = "Bar", number = 31, marked = True }
69 where leafNode a = Tree.Node { Tree.rootLabel = a, Tree.subForest = [] }
H A DTreeTest.hs103 Tree.subForest = [leafNode Phone { name = "Bar", number = 11, marked = True }
108 Tree.subForest = [leafNode Phone { name = "Bar", number = 21, marked = True }
113 Tree.subForest = [leafNode Phone { name = "Bar", number = 31, marked = True }
116 where leafNode a = Tree.Node { Tree.rootLabel = a, Tree.subForest = [] }
/dports/devel/hs-threadscope/threadscope-0.2.14/_cabal_deps/gtk-0.15.5/Graphics/UI/Gtk/ModelView/
H A DTreeStore.hs289 calcTreeDepth Node { subForest = f } (d:ds) =
384 Node { subForest = children }:_ ->
452 (True, cache@((_,Node { subForest = forest}:_):_)) -> (length forest, cache)
503 paths path Node { subForest = ts } =
546 subForest = for}:next) -> function
550 subForest = for }:next, function
603 subForest = for}:next) -> function
608 subForest = for }:next, toggle) function
659 subForest = for}:next) -> function
663 subForest = for }:next)) function
[all …]

123