Am 16.12.2012 20:24, schrieb Jason Dagit:
How does this compare with fgl? http://hackage.haskell.org/package/fgl
FGL is a pure Haskell library while our haskell-igraph package uses the
foreign function interface to run all graph-related calculations in C
the C library igraph (I haven't
igraph-0.6 C library)
The official igraph website: http://igraph.sourceforge.net/index.html
Until hackage generates the haddock documentation, the documentation is
also available at: http://hs.nils.cc/igraph-0.1/html/index.html
Any feedback is appreciated,
- Nils Schweinsberg
- George
Am 24.08.2012 14:47, schrieb marcmo:
* AES Encryption/Decryption (CBC-Mode)
For AES there is the SimpleAES package[1] which is super easy to use:
import qualified Data.ByteString as BS
import Data.ByteString.Lazy as BL
import Codec.Crypto.SimpleAES
key :: IO Key
key =
Hi Haskell-Cafe GHC-users!
I'm looking to apply for the GSoC and since I've worked on GHC before
I'd like to continue to do so. My proposal would be something that
tempted me (as a physics student) for a while: Units for Haskell/GHC.
This project has been suggested for a long time on the
Am 04.04.2012 13:48, schrieb Jurriën Stutterheim:
This sounds pretty cool and useful. How much of this can be implemented in a
library and how much of this would need to be supported on a compiler level?
Ideally, most of this would be solved on the library level.
The compiler would have to
Hi,
I'm having a few problems with cabals build-type configure on windows,
especially with the packages curl and pcre-light. Both fail either with:
* Missing C library: pcre
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi,
I'm having a few problems with cabals build-type configure on windows,
especially with the packages curl and pcre-light. Both fail either with:
configure: error: curl libraries not found, so curl package cannot
be built
Configuring pcre-light-0.4...
cabal: Missing
Am 11.11.2010 13:41, schrieb Stephen Tetley:
Do you have the headers installed as well as the dlls?
For headers, MSys will have a search path of at least these two directories
msys\1.0\local\include
MinGW\include
Is there an environment variable for this? As I said, I tried using
Am 11.11.2010 14:25, schrieb Stephen Tetley:
I'm not sure about an environment variable. Adding the MinGW\ prefix
looks wrong, you may have to experiment with paths and forward or back
slash separators a bit. I can't remember which convention (Windows)
cabal uses.
I tried every possible
Am 02.11.2010 01:20, schrieb Paulo Tanimoto:
http://hackage.haskell.org/package/network
You just have to remember that you need to call withSocketsDo on
windows before doing anything with the network library.
___
Haskell-Cafe mailing list
Am 02.11.2010 19:57, schrieb Michael Litchard:
got any urls with examples?
Sure, see this short server-client-ping-pong application.
By the way, I noticed that you don't need withSocketsDo on windows 7,
but I guess it's there for a reason for older windows versions. :)
import
Hi!
I'm having a really hard time to write a correct parser for a small
language I've developed. I have been trying to write a parser using
parsec, but always get a lot of error messages like unexpected \n,
expected ..., new-line or... when trying to run the parser. Then I read
about the
Am 31.10.2010 16:50, schrieb Ozgur Akgun:
I don't know if you've already used it, but Parsec includes some kind of
a lexer through the Language
http://hackage.haskell.org/packages/archive/parsec/3.1.0/doc/html/Text-Parsec-Language.html
and Token
Am 31.10.2010 16:53, schrieb Vo Minh Thu:
I can't really tell from your description, but maybe this is because
of the way Parsec works when it deals with alternatives. When you
combine several parsers with e.g. '|' or 'choice', an alternative
that can consume some input but fails will make the
Am 18.09.2010 09:51, schrieb Christopher Tauss:
I am trying to write a function that takes a list and returns the last n
elements.
last_n n = fst . foldr step ([], n)
where
step _ (xs, 0) = (xs, 0)
step x (xs, n) = (x:xs, n-1)
___
Am 17.09.2010 22:06, schrieb Nils Schweinsberg:
[1] http://hackage.haskell.org/package/happstack-auth
Hackage fails to build this package:
http://hackage.haskell.org/packages/archive/happstack-auth/0.2/logs/failure/ghc-6.12
However, Crypto == 4.* should be on hackage:
http
you enjoy it! :)
- Nils Schweinsberg / McManiaC
* You can still use the old state-query/update constructors by importing
Happstack.Auth.Internal, although you'll miss a lot of features like
session management etc. In addition, MightyBytes old repo should be
still available at [4].
[1] http
Hey,
I just wondered if you can define Applicative instances for arrows?
Basicly what I thought of is:
I have a type for my arrow which is CollectA (using HXT here):
type CollectA a = SomeArrow XmlTree a
And my datatype which I want to construct:
data Test = Test
{
Am 09.09.2010 22:55, schrieb Wanas:
Hey all,
So I have a two part question (I'm new to haskell, so you can throw all
your mugs at me).
a) I want to write a function that generates lists of lists of size $n$.
All having the property that sum lst = sum [1..n].
a-1) After that, I want to remove
On 26.07.2010 23:55, Ozgur Akgun wrote:
I think it is pretty cool as well. But I think there is a problem with
viewing it as a wildcard.
let's say we define the following:
(??) = flip
foo :: a - b - c
foo ?? x :: a - c
Perfect!
But saying ?? can be used as a wildcard might in the following
On Sun, 4 Jul 2010 15:47:21 +0200, Ertugrul Soeylemez e...@ertes.de wrote:
This requires a bunch of type system extensions, though, most notably
the UndecidableInstances extension. But it's safe to use here.
Probably a bit off topic, but whats wrong with UndecidableInstances? Where
is it safe
will asure that every thread in an evalMState/execMState
call will be finished before the final result is returned.
The library is also on github.com.[2] Please let me know what you think
of it and whether or not I should put it on hackage.
Cheers,
Nils Schweinsberg
[1] http://n-sch.de/hdocs
On 02.07.2010 20:05, Jason Dagit wrote:
In other words, don't be shy!
Ok, thanks for the reply! :) However, a question about haddock:
evalMState :: Forkable m
= MState t m a -- ^ Action to evaluate
- t -- ^ Initial state value
And here wo go. MState on hackage:
http://hackage.haskell.org/package/mstate
My first hackage library. :)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 02.07.2010 23:02, Günther Schmidt wrote:
Hi all,
I'd be interested in studying GUI (wxhaskell) code. Does anyone have
links to good gui code?
Not wxHaskell, but I just wrote a very small gtk2hs application.[1]
Should give you a quick overview of how things work with gtk. :)
[1]
On 03.07.2010 03:27, Matthew Gruen wrote:
Awesome. I needed something like that once, too, down to the same type
signature for the fork function. Here's an instance from my code:
instance MonadFork (ReaderT s IO) where
fork newT = ask= liftIO . forkIO . runReaderT newT
I've added this
On 21.06.2010 23:50, Maurício CA wrote:
Hi, all,
bitspeak is a small proof of concept application that allows
writing text using only two commands (yes/no, 1/2, top/down etc.).
Looks cool! Did you forget any dependencies tho? I get the following error:
0:16 nils` cabal update
Downloading
27 matches
Mail list logo
