Send Beginners mailing list submissions to
beginners@haskell.org
To subscribe or unsubscribe via the World Wide Web, visit
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
or, via email, send a message with subject or body 'help' to
beginners-requ...@haskell.org
You can reach the person managing the list at
beginners-ow...@haskell.org
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. Re: search function by type (David Ringo)
2. How to move nodes in Data.Tree.Zipper (martin)
----------------------------------------------------------------------
Message: 1
Date: Fri, 08 Jul 2016 22:43:23 +0000
From: David Ringo <davidmri...@gmail.com>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <beginners@haskell.org>
Subject: Re: [Haskell-beginners] search function by type
Message-ID:
<capbypx4ggy4calhqbgnluu7sdnf+vcggnynveve5qybhxc6...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
To add to what Andrew said, you can get Hoogle integration in GHCi with
some custom commands:
https://wiki.haskell.org/Hoogle#GHCi_Integration
Hoogle is not perfect, but it's the closest you'll find to what you want.
You could even define some augmenting functions to trim its (often large)
output and bind them to GHCi commands as well.
On Fri, Jul 8, 2016 at 1:37 AM Andrew Bernard <andrew.bern...@gmail.com>
wrote:
> Hi Ford,
>
> Take a look at Hoogle. Indispensable.
>
> https://www.haskell.org/hoogle/
>
> Andrew
> _______________________________________________
> Beginners mailing list
> Beginners@haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://mail.haskell.org/pipermail/beginners/attachments/20160708/14c47707/attachment-0001.html>
------------------------------
Message: 2
Date: Sat, 9 Jul 2016 12:01:12 +0200
From: martin <martin.drautzb...@web.de>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <beginners@haskell.org>
Subject: [Haskell-beginners] How to move nodes in Data.Tree.Zipper
Message-ID: <5780cb68.30...@web.de>
Content-Type: text/plain; charset=utf-8
Hello all,
I've been playing with Data.Tree.Zipper and one of the tasks I set for myself
was to move a node to another position. I
endet up in a situation, where I no longer have a clear understanding what
"moving" means.
Data.Tree.Zipper distinguishes between Nodes ("Full") and Space ("Empty"). So I
thought to move a nde I need to know the
node to be moved ("Full") and the space where it shall be moved to ("Empty")
But I need to do two things:
(1) remove the node from its original position
(2) insert the node at the empty space given.
Both operations are supported by D.T.Z, but once I removed the node, I have a
new Zipper, while the space given still
refers to the original zipper. The new Zipper has no idea where the deleted
node shall be inserted and the original
empty space doesn't have the node removed.
This is not the fault of D.T.Z, but in a way a real-world problem I had been
unaware of. With my original idea I could
have moved a node to a subspace of itself, which makes no real sense. It
appears that giving two zippers to a
tree-modifying function is utterly useless when they refer to the same tree and
both undergo modifications by the function.
What would be a correct way to think about this?
------------------------------
Subject: Digest Footer
_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
------------------------------
End of Beginners Digest, Vol 97, Issue 8
****************************************
