Simon Marlow | 1 Aug 2006 14:52
Picon

Re: subject prefix for Haskell libraries mailing list

Henning Thielemann wrote:
> Just a stupid question: I get mails from Haskell-Cafe with the
> [Haskell-Cafe] prefix, but mails from the library list aren't prefixed. I
> didn't found a possibility to configure that for me personally.

haskell-cafe is the exception here, I'm not sure at what point it was changed. 
Unfortunately it can't be set per-user.  IIRC, not everyone likes the prefix 
(I'd prefer not to have it, but I'll go with the concensus).

Cheers,
	Simon
David House | 1 Aug 2006 16:25
Picon
Gravatar

Re: subject prefix for Haskell libraries mailing list

On 01/08/06, Simon Marlow <simonmarhaskell <at> gmail.com> wrote:
> haskell-cafe is the exception here

Looks to me like haskell <at> haskell.org has a '[Haskell]' prefix too. But
indeed, none of the other mailing lists I'm subscribed to on
haskell.org have a prefix.

--

-- 
-David House, dmhouse <at> gmail.com
Chris Kuklewicz | 2 Aug 2006 13:16

ANN: TextRegexLazy-0.56, (=~) and (=~~) are here

Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
        darcs get --partial [--tag=0.56] http://evenmere.org/~chrisk/trl/stable/
License : BSD, except for DFAEngine.hs which is LGPL (derived from CTK light)

Development/unstable version is at:
        darcs get [--partial] http://evenmere.org/~chrisk/trl/devel/

This is the version that has eaten John Meacham's JRegex library and survived to 
become strong.  Thanks John!

It now compiles against the posix regexp provided by the c library and the pcre 
library, in addition to the "full lazy" and the "DFA" backends.

All 4 backends can accept regular expressions given as String and as ByteString.

All 4 backends can run regular expressions against String and ByteString.

In particular, the PosixRE and PCRE can run very efficiently against ByteString. 
(Though the input for the PosixRE needs to end in a \NUL character for efficiency).

So there are 4*2*2 = 16 ways to use to provide input to this library.  And the 
RegexContext class has at least 11 instances that both (=~) and (=~~) can 
target.  So that is 4*2*2*11*2 = 352 things you can do with this library!  Get 
your copy today!

To run with cabal before 1.1.4 you will need to comment out the 
"Extra-Source-Files:" line in the TextRegexLazy.cabal file.

The Example.hs file:
(Continue reading)

Chris Kuklewicz | 2 Aug 2006 13:33

Re: ANN: TextRegexLazy-0.56, (=~) and (=~~) are here

Ooops.

I just patched the efficiency of ByteStringPCRE to agree with the original 
announcement.

Use
darcs get --partial http://evenmere.org/~chrisk/trl/stable/
to get the fixed version.

A new 0.57 tarball will go to sourceforge soon.

Chris Kuklewicz wrote:
> Announcing: TextRegexLazy version 0.56
> Where: Tarball from http://sourceforge.net/projects/lazy-regex
>        darcs get --partial [--tag=0.56] 
> http://evenmere.org/~chrisk/trl/stable/
> License : BSD, except for DFAEngine.hs which is LGPL (derived from CTK 
> light)
> 
> Development/unstable version is at:
>        darcs get [--partial] http://evenmere.org/~chrisk/trl/devel/
> 
> This is the version that has eaten John Meacham's JRegex library and 
> survived to become strong.  Thanks John!
> 
> It now compiles against the posix regexp provided by the c library and 
> the pcre library, in addition to the "full lazy" and the "DFA" backends.
> 
> All 4 backends can accept regular expressions given as String and as 
> ByteString.
(Continue reading)

Bulat Ziganshin | 2 Aug 2006 15:49
Picon

Re: [Haskell-cafe] ANN: TextRegexLazy-0.56, (=~) and (=~~) are here

Hello Chris,

Wednesday, August 2, 2006, 3:16:58 PM, you wrote:

> Announcing: TextRegexLazy version 0.56

your feature list is really strong! it will be great now to make it
a part of GHC standard distribution

afaiu, selection of regex engine implemented via import statements?

as long-standing goals i can point to support of lazy bytestrings,
UTF-8, filename wildcards. but that is really more the details than
essentials and now testing/bundling with GHC is most important
(of course, imho)

--

-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin <at> gmail.com
Chris Kuklewicz | 2 Aug 2006 17:12

Re: [Haskell-cafe] ANN: TextRegexLazy-0.56, (=~) and (=~~) are here

Bulat Ziganshin wrote:
> Hello Chris,
> 
> Wednesday, August 2, 2006, 3:16:58 PM, you wrote:
> 
>> Announcing: TextRegexLazy version 0.56
> 
> your feature list is really strong! it will be great now to make it
> a part of GHC standard distribution
> 
> afaiu, selection of regex engine implemented via import statements?
> 

Well, yes.  The "makeRegex" is provided by each of the 4 backends to create its 
own Regex type. So there are 4 different data types:

Text.Regex.Full.Regex
Text.Regex.DFA.Regex
Text.Regex.PCRE.Regex
Text.Regex.PosixRE.Regex

I might be able to make a "framework" polymorphic type:

data Regex backend = ....

hmmm....

> as long-standing goals i can point to support of lazy bytestrings,

Lazy bytestrings are very specialized.  You could probable "unpack" them and 
(Continue reading)

Chris Kuklewicz | 2 Aug 2006 20:15

Re: ANN: TextRegexLazy-0.56, (=~) and (=~~) are here

Bulat Ziganshin wrote:
> Hello Chris,
> 
> Wednesday, August 2, 2006, 3:16:58 PM, you wrote:
> 
>> Announcing: TextRegexLazy version 0.56
> 
> your feature list is really strong! it will be great now to make it
> a part of GHC standard distribution
> 
> afaiu, selection of regex engine implemented via import statements?
> 

You can actually choose which backend (=~) uses at runtime:

> {-# OPTIONS_GHC -fglasgow-exts #-}
> import Text.Regex.Lazy
> 
> import qualified Text.Regex.PCRE as R
> import qualified Text.Regex.PosixRE as S
> import qualified Text.Regex.Full as F
> 
> -- Choose which library to use depending on presence of PCRE library
> 
> (=~) :: (RegexMaker R.Regex R.CompOption R.ExecOption a,RegexContext R.Regex b t
>         ,RegexMaker F.Regex F.CompOption F.ExecOption a,RegexContext F.Regex b t
>         ,RegexMaker S.Regex S.CompOption S.ExecOption a,RegexContext S.Regex b t)
 >      => b -> a -> t
> (=~) = case R.getVersion of
>          Just _ -> (R.=~)
(Continue reading)

John Meacham | 3 Aug 2006 04:42
Favicon

perhaps

does anyone else think this would be useful to provide?

> module Data.Perhaps where
> 
> data Perhaps = No | Maybe | Yes
>         deriving(Eq,Ord,Show,Read,Enum,Bounded)
> 
> instance Monoid Perhaps ...
> ...

I only ask because it has come up as useful several times in projects I
work on.

        John

--

-- 
John Meacham - ⑆repetae.net⑆john⑈
Josef Svenningsson | 3 Aug 2006 14:41
Picon
Gravatar

Re: perhaps

On 8/3/06, John Meacham <john <at> repetae.net> wrote:
> does anyone else think this would be useful to provide?
>
> > module Data.Perhaps where
> >
> > data Perhaps = No | Maybe | Yes
> >         deriving(Eq,Ord,Show,Read,Enum,Bounded)
> >
> > instance Monoid Perhaps ...
> > ...
>
Reminds me of Donald Knuth's type declaration:

type enum {
  false, true, wow
} bool;

/Josef
Iavor Diatchki | 3 Aug 2006 20:58
Picon
Gravatar

Re: perhaps

On 8/2/06, John Meacham <john <at> repetae.net> wrote:
> does anyone else think this would be useful to provide?
Maybe

(sorry, couldn't resist :-)
-iavor

>
> > module Data.Perhaps where
> >
> > data Perhaps = No | Maybe | Yes
> >         deriving(Eq,Ord,Show,Read,Enum,Bounded)
> >
> > instance Monoid Perhaps ...
> > ...
>
> I only ask because it has come up as useful several times in projects I
> work on.
>
>         John
>
>
>
> --
> John Meacham - ⑆repetae.net⑆john⑈
> _______________________________________________
> Libraries mailing list
> Libraries <at> haskell.org
> http://www.haskell.org/mailman/listinfo/libraries
>
(Continue reading)


Gmane