[prev in list] [next in list] [prev in thread] [next in thread]
List: haskell-cafe
Subject: Re: [Haskell-cafe] Libraries to compare trees?
From: Rustom Mody <rustompmody () gmail ! com>
Date: 2011-10-29 3:56:32
Message-ID: CAJ+Teoe1aONsAeu8_rd8OndSRDKFah3Xeeu-feuXjQ9dbf_pxA () mail ! gmail ! com
[Download RAW message or body]
[Attachment #2 (multipart/alternative)]
On Fri, Oct 28, 2011 at 8:54 PM, Ozgur Akgun <ozgurakgun@gmail.com> wrote:
> Hi.
>
>
> On 27 October 2011 13:49, dokondr <dokondr@gmail.com> wrote:
>
>> Please advise on Haskell libraries to compare trees in textual
>> representation.
>> I need to compare both structure and node contents of two trees, find
>> similar sub-trees, and need some metric to measure distance between two
>> trees.
>>
>
> This might help: http://hackage.haskell.org/package/gdiff-1.0
>
> Best,
> Ozgur
>
>
This is interesting. Just putting some thoughts here. Please comment.
I am a user of emacs org-mode http://orgmode.org/.
Basically org imposes a tree structure onto plain text and when that is
appropriate its quite a nifty tool. Recently there was some discussion on
the org list that diffs of org files were less than useful because while
org understands hierarchical structure, diff doesn't.
I wonder what would be involved in setting up a bi-directional pipe between
emacs and haskell so that orgmode could use gdiff's findings?
[Attachment #5 (text/html)]
<div class="gmail_quote">On Fri, Oct 28, 2011 at 8:54 PM, Ozgur Akgun <span \
dir="ltr"><<a href="mailto:ozgurakgun@gmail.com">ozgurakgun@gmail.com</a>></span> \
wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; \
border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"> Hi.<div \
class="im"><br><br><div class="gmail_quote">On 27 October 2011 13:49, dokondr <span \
dir="ltr"><<a href="mailto:dokondr@gmail.com" \
target="_blank">dokondr@gmail.com</a>></span> wrote:<br><blockquote \
class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, \
204, 204); padding-left: 1ex;">
<div>Please advise on Haskell libraries to compare trees in textual \
representation.<br>I need to compare both structure and node contents of two trees, \
find similar sub-trees, and need some metric to measure distance between two \
trees.</div>
</blockquote></div><div><br></div></div>This might help: <a \
href="http://hackage.haskell.org/package/gdiff-1.0" \
target="_blank">http://hackage.haskell.org/package/gdiff-1.0</a><br><br><div>Best,</div><div>Ozgur<br>
</div><br></blockquote></div><br>This is interesting. Just putting some thoughts \
here. Please comment.<br><br>I am a user of emacs org-mode <a \
href="http://orgmode.org/">http://orgmode.org/</a>.<br>Basically org imposes a tree \
structure onto plain text and when that is appropriate its quite a nifty tool. \
Recently there was some discussion on the org list that diffs of org files were less \
than useful because while org understands hierarchical structure, diff \
doesn't.<br> <br>I wonder what would be involved in setting up a bi-directional \
pipe between emacs and haskell so that orgmode could use gdiff's findings?<br>
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
[prev in list] [next in list] [prev in thread] [next in thread]
Configure |
About |
News |
Add a list |
Sponsored by KoreLogic