Data.Map in the containers library.
vigalchin:
Hello,
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/FiniteMap
...
since this is deprecated what is the orthodox way to implement finite map??
Thanks,
Vasili
___
Does anyone have an idea how to use an instance to list all the functions of
type? Thank you!
___
好玩贺卡等你发，邮箱贺卡全新上线！
http://card.mail.cn.yahoo.com/___
Haskell-Cafe mailing list
How about hoogle?
2009/5/16 yu yang er.9...@yahoo.com.cn:
Does anyone have an idea how to use an instance to list all the functions of
type? Thank you!
好玩贺卡等你发，邮箱贺卡全新上线！
___
Haskell-Cafe mailing list
On Fri, May 15, 2009 at 11:10 PM, yu yang er.9...@yahoo.com.cn wrote:
Does anyone have an idea how to use an instance to list all the functions of
type? Thank you!
Perhaps :i sometype inside of ghci?
Jason
___
Haskell-Cafe mailing list
On 16 May 2009, at 03:54, wren ng thornton wrote:
Conor McBride wrote:
Rumblings about funny termination behaviour, equality
for functions, and the complexity of unification (which
isn't the proposal anyway)
But unification is what you get by adding non-linearity.
Hang on a minute: we're
On Friday 15 May 2009 06:52:29 David Leimbach wrote:
I actually need little endian encoding... wondering if anyone else hit this
with Data.Binary. (because I'm working with Bell Lab's 9P protocol which
does encode things on the network in little-endian order).
Anyone got some tricks for this?
Hi all,
In my app, there is one part which has a rather complicated GUI logic,
it involves n drop downs with n choices each.
Whenever the current selection in one of the drop downs changes by user
interaction, the other (n-1) drop downs need to be notified and their
item list need to
Am Montag, 11. Mai 2009 12:04:07 schrieb Neil Brown:
[...] So possible additions to your type-class list are Foldable and maybe
Traversable (no harm, although I'd have to reach further for an example
for this). I guess the tricky decision might be whether to provide a
Num instance (again,
On Thu, May 14, 2009 at 10:25 AM, Bryan O'Sullivan b...@serpentine.com wrote:
On Thu, May 14, 2009 at 10:18 AM, Bryan O'Sullivan b...@serpentine.com
wrote:
If one of you has the time to dig into this and send a patch that corrects
the problem, I'd welcome the help. As I'm sure you can tell, I
Hello, cafe visitors!
I'm trying to learn Haskell typeclasses, - about how to use them, - but
can't handle some conceptiual problems, which confuses me a lot. I took one
real problem (ErrorInfo gragual gathering), to tackle it in my studies: I
have a class of situations: there is an object, and
Hello Belka,
Saturday, May 16, 2009, 9:22:54 PM, you wrote:
I'm trying to learn Haskell typeclasses, - about how to use them, - but
am i correctly understood that you've started learning type classes
with multi-parameter ones? this may be a bit too brave, especially for
a woman :D
i suggest
Hi Deniz,
Deniz Dogan wrote:
So, basically I'd like some sort of folding functionality for these
data types, without having to hack the lexer/parser myself
(parameterising the data types), because as I said they're being
generated by BNFC.
What exactly do you mean by folding functionality?
Hey,
Besides fgl, are there any graph libraries in Haskell that are still
maintained? Are there other papers (or books) besides Erwig's that I
could use to understand how graph algorithms have been implemented in
functional languages?
Has anything even been published on the topic since
Bulat Ziganshin wrote:
Hello Belka,
Saturday, May 16, 2009, 9:22:54 PM, you wrote:
I'm trying to learn Haskell typeclasses, - about how to use them, - but
am i correctly understood that you've started learning type classes
with multi-parameter ones? this may be a bit too brave, especially
thestonetable:
Hey,
Besides fgl, are there any graph libraries in Haskell that are still
maintained? Are there other papers (or books) besides Erwig's that I
could use to understand how graph algorithms have been implemented in
functional languages?
Has anything even been published on
We don't seem to have a binding to any of the foreign language libs for
very large graphs.
Do you know of any stand-out libraries in this regard worth binding?
When I looked in to this last year, the best I could find was the boost
library. It depends very heavily on template
, I think.
Feedback welcome! You can find my darcs tree at:
http://mysite.verizon.net/vzewxzuh/sitebuildercontent/sitebuilderfiles/haskelldb-hlist-20090516.tar.gz
It also requires minor changes to HList, available at:
http://mysite.verizon.net/vzewxzuh/sitebuildercontent/sitebuilderfiles
I'd like to get the scenegraph package
(http://hackage.haskell.org/cgi-bin/hackage-scripts/package/scenegraph)
to work, but am encountering linkage errors.
I installed scenegraph 0.1.0.1 for ghc-6.10.1 on Fedora 10 Linux.
# runghc Setup configure --prefix=/opt
# runghc Setup build
# runghc Setup
Yevgeni,
I am specifying base as a Cabal dependency ... dumb question ... I
have forgotten whether I need to import Data.Map also?
Vasili
On Sat, May 16, 2009 at 1:05 AM, Eugene Kirpichov ekirpic...@gmail.comwrote:
It's Data.Map. It's in the base package.
2009/5/16 Vasili I. Galchin
You need to include the containers package in your cabal file.
Alex
On Sat, May 16, 2009 at 4:44 PM, Vasili I. Galchin vigalc...@gmail.com wrote:
Yevgeni,
I am specifying base as a Cabal dependency ... dumb question ... I
have forgotten whether I need to import Data.Map also?
Vasili
yeah I do ghc can't find the Map constructor ..
also in another module Parsec is being used ... I have parsec as a dependecy
in my cabal file and I also have an import Text.Parsec but ghc could not
find module Text.Parsec. ???
Thanks, Vasili
On Sat, May 16, 2009 at 6:57 PM,
You need to import Data.Map in any file you use Map in.
Which version of Parsec are you using? Versions before 3.0.0 do not
have a module called Text.Parsec, the module is
Text.ParserCombinators.Parsec (or something like that).
Alex
On Sat, May 16, 2009 at 5:03 PM, Vasili I. Galchin
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090516
Issue 118 - May 16, 2009
---
Welcome to issue 118 of HWN, a newsletter covering
23 matches
Mail list logo
