Search results

• HIDE/Design/Project management
  ...ct for the project management. Each project has a single root of its build tree. At the moment we expect there to be at most one .cabal file in that root d === Setting the build tree root ===
  9 KB (1,516 words) - 12:14, 24 January 2006
• Show and Read instance
  .../pipermail/glasgow-haskell-users/2003-August/005586.html Show instance for Tree]
  744 bytes (109 words) - 14:32, 13 November 2006
• 99 questions/54A to 60
  A binary tree is either empty or it is composed of a root element and two successors, whi data Tree a = Empty | Branch a (Tree a) (Tree a)
  9 KB (1,368 words) - 02:54, 11 June 2023
• Himerge/En
  ...]] || ''sync'' || Update our portage tree or overlay with latest available tree on the mirrors.
  2 KB (296 words) - 07:54, 18 February 2008
• GeBoP
  ...s a brain viewer which enables you to explore the computer's internal game tree. To see the game tree, select <i>Brain</i> -> <i>Open</i>.
  1 KB (231 words) - 13:25, 16 March 2018
• 99 questions/Solutions/70
  (**) Tree construction from a node string. ...of its nodes, a special character ^ has been inserted whenever, during the tree traversal, the move is a backtrack to the previous level.
  7 KB (1,025 words) - 02:14, 23 July 2021
• Benchmarks Game/Parallel/BinaryTrees
  -- an artificially strict tree. data Tree = Nil | Node !Int !Tree !Tree
  6 KB (1,055 words) - 23:27, 18 April 2020
• Yhc/Options
  --parse show syntax tree after parser (default=off) --rename show syntax tree after rename (default=off)
  6 KB (733 words) - 15:19, 6 February 2021
• HaskLS
  * <bourbaki> boegel the idea is that ... ie think of the first think of the tree the root ...branches of changeing textures like makeing the bark darker where the tree is older or so
  3 KB (482 words) - 05:24, 30 November 2006
• Haskell Quiz/TicTacToe
  ...e player which learns to play the game by observing the game (i.e. no game tree traversal to find the optimal move).
  331 bytes (51 words) - 14:20, 23 August 2012
• Action
  data Tree a = Node a [Tree a] dfs :: Graph -> [Vertex] -> [Tree Vertex]
  3 KB (428 words) - 04:08, 12 April 2024
• 99 questions/Solutions/61
  Count the leaves of a binary tree
  331 bytes (43 words) - 13:38, 25 December 2016
• Blog articles/FFI
  * [http://therning.org/magnus/archives/238 C and Haskell sitting in a tree]
  737 bytes (93 words) - 01:56, 10 December 2020
• Circular programming
  Let us see the tree minimum problem (described above), and let us modularize the magic circular repmin :: Ord a => Tree a -> Tree a
  12 KB (1,607 words) - 10:48, 12 February 2010
• 99 questions/Solutions/83
  Write a predicate s_tree(Graph,Tree) to construct (by backtracking) all spanning trees of a given graph. ...le subgraphs, then filters out those that meet the criteria for a spanning tree:
  2 KB (281 words) - 03:49, 10 January 2017
• Humor/Hugme
  ...stating that Functional Programming was devised by a, "... load of binary tree Huggers!".
  700 bytes (109 words) - 04:19, 25 January 2006
• 99 questions/61 to 69
  An example tree: <div style="border-bottom:1px solid #eee">Count the leaves of a binary tree. <span style="float:right"><small>[[99 questions/Solutions/61|Solutions]]</
  12 KB (1,696 words) - 05:35, 11 June 2023
• Hoed
  After running the program a computation tree is constructed and displayed in a web browser. ...f your program misbehaves, you can judge the computation statements in the tree as 'right' or 'wrong' according to your intention. When enough statements a
  6 KB (896 words) - 09:12, 22 December 2015
• 99 questions/Solutions/92
  Anyway the puzzle goes like this: Given a tree with N nodes (and hence N-1 edges). Find a way to enumerate the nodes from ...s a numbering scheme for a given tree. What is the solution for the larger tree pictured below?
  3 KB (420 words) - 22:52, 7 June 2017
• Generics
  data Tree a = Leaf | Bin a (Tree a) (Tree a) ...length of a tree (or its size, if you want), by recursively traversing the tree and counting the number of elements. Generic programming allows to define a
  4 KB (598 words) - 02:44, 13 February 2021
• Zipper
  rather than the data itself. For example, consider a simple binary tree type: data Tree a = Fork (Tree a) (Tree a) | Leaf a
  10 KB (1,623 words) - 21:10, 26 June 2023
• Phone number
  -- The dictionary is stored in a denary tree. A node has sub-trees, a leaf -- Given an existing tree, create a new tree to be its parent. Put the
  12 KB (1,746 words) - 05:55, 21 February 2010
• The Monad.Reader/Issue4/On Treaps And Randomization
  We give an example implementation of treaps (tree heaps) in Haskell. The emphasis is partly on treaps, partly on the System.R One such representation is the binary search tree (In much literature,
  17 KB (2,987 words) - 01:08, 10 May 2008
• Difference list
  Consider showing a binary tree. If the tree is large, you end up with a pretty large left association for the left subt
  3 KB (421 words) - 16:40, 1 August 2018
• Extending Phooey
  treeDisplay :: Sourceable a => Source (Tree a) -> UI (TreeSources a) aTree <- title "Family Tree" $ treeDisplay (liftA asTree db)
  3 KB (480 words) - 12:31, 18 August 2007
• New monads/MonadRandomSplittable
  The following constructs a tree of infinite depth and width: import Data.Tree
  4 KB (476 words) - 22:10, 27 November 2007
• Diagrams/Dev/BuildStatus
  ...ravis-ci.org/diagrams/dual-tree https://secure.travis-ci.org/diagrams/dual-tree.png]
  4 KB (510 words) - 01:42, 10 November 2013
• Zipper monad
  ...es a tree and returns the <hask>Loc</hask> corresponding to the top of the tree. Thus a typical call to <hask>traverse</hask> might look like: getStruct = modifyStruct id -- works because modifyTree returns the 'new' tree
  5 KB (846 words) - 01:00, 9 October 2006
• Output/Input
  ...tree [...] since any number of subtrees may be extracted from an infinite tree). In practice, these values will be determined at run time (when used as ar main' :: Tree Exterior -> ...
  8 KB (1,236 words) - 12:36, 1 January 2024
• 99 questions/Solutions/58
  An efficient solution, which takes the fact that a tree with an even number of nodes can't be symmetric into consideration:
  666 bytes (91 words) - 13:37, 25 December 2016
• HIDE/Design
  * Allows plugins to be built seperately or "out of tree" * TeX typesetting (Easier if you have syntax tree available)
  4 KB (632 words) - 19:45, 22 February 2008
• HGene
  ** Tree View - View tree representation of books and chapters.
  4 KB (598 words) - 18:30, 6 February 2007
• AI/Genetic programming/GPLib
  ##Tree generators should produce only well typed trees. A) Should be able to take a GP Tree and pre-evaluate everything
  5 KB (664 words) - 05:48, 12 July 2021
• Yhc/Tutorial
  ...he location of the <tt>inst</tt> folder if you are running from the source tree.
  1 KB (178 words) - 13:19, 18 June 2007
• Cookbook/Other data structures
  == Tree ==
  4 KB (640 words) - 21:05, 6 January 2019
• Blog articles/IO
  * Directory tree printing: ** [http://blog.moertel.com/articles/2007/02/22/a-simple-directory-tree-printer-in-haskell Part 1]
  2 KB (236 words) - 07:29, 10 August 2023
• Yhc/API/Bytecode
  There are tree types of bytecode representation:
  1 KB (166 words) - 23:36, 15 January 2006
• 99 questions/Solutions/31
  -- tree-merging Eratosthenes sieve The tree-merging Eratosthenes sieve here seems to strike a good balance between effi
  3 KB (432 words) - 07:06, 11 May 2016
• Library tests
  ...work/tests/ network]. The tests "assume the package is part of a GHC build tree with the testsuite installed in ../../../testsuite." ...obably re-build all of the libraries in a separate <code>dist/test/</code> tree with -DTESTING on. If we have A.hs and B.hs where each exports some impleme
  7 KB (1,033 words) - 04:18, 1 April 2007
• WxHaskell/Contribute
  ; Create a good tree control / list /grid control abstraction ...e typed by including the value types into the phantom type variable of the tree control. Requires a good feeling for elegant and practical design with Hask
  4 KB (687 words) - 14:54, 8 October 2015
• Lojban
  ...bf{leaf}</math>, <math>\mathbf{branch}</math> are representation of binary tree concept in combinatory logic (e.g. by using catamorphism) type CL = Tree BaseSymbol
  11 KB (1,775 words) - 19:41, 3 September 2006
• Vim
  ...est-haskell neotest-haskell] A [https://tree-sitter.github.io/tree-sitter/ tree-sitter] powered framework for interacting with Haskell tests in Neovim. ...m-treesitter/nvim-treesitter-textobjects nvim-treesitter-textobjects] Uses tree-sitter to add syntax-aware textobjects (supports various languages, includi
  4 KB (508 words) - 22:01, 20 November 2022
• Opting for oracles
  data Tree a = Node { contents :: a, left :: Tree a,
  6 KB (809 words) - 07:56, 12 June 2023
• MonadFix
  ...ry tree (immutable) with numbers at internal nodes is given. Replicate the tree but replace the numbers by their sum. Example in ASCII art (4+3+5+1=13) (le Traverse the given tree just once. Moreover, as you traverse the given tree, print it out in some format (in-order format here, like ((3)4(5(1))), but
  10 KB (1,757 words) - 23:34, 24 July 2021
• Happy
  ...stage of a compiler, where it will be used to generate an abstract syntax tree.
  859 bytes (138 words) - 12:00, 19 April 2021
• Google Code Jam
  * [[Google Code Jam/Cheating a Boolean Tree]]
  2 KB (257 words) - 12:03, 4 August 2008
• Library for binary
  bits_next = reverse . work . reverse where -- Next (balanced) tree address
  2 KB (344 words) - 08:57, 13 December 2009
• 99 questions/Solutions/35
  ...ut it works, though it may have bugs in corner cases. This uses the factor tree method of finding prime factors of a number. factorPairOf picks a factor an Using the proper tree-merging sieve of Eratosthenes version from [http://www.haskell.org/haskellw
  3 KB (485 words) - 19:45, 18 January 2014
• Random Processes
  ;[http://code.haskell.org/RandProc/ Source Code Tree] :Browsable source tree
  4 KB (545 words) - 00:10, 28 June 2011
• HaRe
  * Simpler generics for tree traversals. ...a project for access to an AST and Token Stream and Strafunski for generic tree traversal.
  4 KB (645 words) - 12:53, 4 August 2014

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)