>
> What about dependency interactions? If you depend on foo and bar there
> might be versions of foo and bar that don't build together that you might
> not discover by varying their versions independently.
>
Indeed. But assuming for a moment that foo & bar have correctly specified
their own depe
Welcome to issue 207 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of October 30 to
November 05, 2011.
You can find the HTML version of this issue at:
http://contemplatecode.blogspot.com/2011/11/haskell-weekly-news-issue-207.html
New and Upd
On Wed, Nov 9, 2011 at 3:58 PM, Ryan Newton wrote:
> I don't know about you, but I personally haven't found the time to cast
> back in time for each of my package's dependencies to find a true lower
> bound version.
>
> Do we have any tools that would do the following?
>
>- ask Hackage for th
I don't know about you, but I personally haven't found the time to cast
back in time for each of my package's dependencies to find a true lower
bound version.
Do we have any tools that would do the following?
- ask Hackage for the available versions of package foo
- use cabal-dev to build y
On 9 November 2011 22:33, kaffeepause73 wrote:
> Repa is indeed very Interesting, but I have changing vector length in the
> second dimension and later on only want to generate Data on demand. If I use
> Matrices, I will use loads of space for no reason.
Even if it is possible to create an unboxe
On Thursday 10 November 2011, 00:35:07, Artyom Kazak wrote:
> Hello!
>
> The (!) operator is short and nice. Unfortunately, when doing heavy
> computing, we have to use "unsafeAt" instead. It looks ugly and it is
> ugly, also.
>
> Some compilers for imperative languages like Free Pascal have an o
Hello.
My company is looking to hire a haskell developer. South California
(San Dimas), full time job, local only (no telecommute)
We use yesod (haskell web framework) for internal web application and
web services, and compojure (clojure web framework) for customer
facing web site.
All developmen
Hi,
Am Donnerstag, den 10.11.2011, 01:35 +0200 schrieb Artyom Kazak:
> Anyway, I have to say it once again: unsafeAt is ugly and Haskell is
> beautiful. Why high-performance code should be ugly?
It does not have to be ugly. Just write
(!!) = unsafeAt
in some common module of yours, and
Hello!
The (!) operator is short and nice. Unfortunately, when doing heavy
computing, we have to use "unsafeAt" instead. It looks ugly and it is
ugly, also.
Some compilers for imperative languages like Free Pascal have an option to
turn on/off bounds checking for arrays. Wouldn't it be ni
Thanks for the replies. - Looks like there's not a straight forward way and
I'm not yet on a level
and don't have the time to make fancy wrappers or instances.
Repa is indeed very Interesting, but I have changing vector length in the
second dimension and later on only want to generate Data on dem
TCache manages persistent data trough STM references called DBRefs
that are very similar to TVars, but with added user-configurable
persistence. Very intuitive to use.
2011/11/9 Bas van Dijk :
> On 9 November 2011 19:50, dokondr wrote:
>> On Wed, Nov 9, 2011 at 8:41 PM, Bas van Dijk wrote:
>>>
On Wed, Nov 9, 2011 at 3:37 AM, dokondr wrote:
>
> In case I upgrade to the latest Haskell Platform, what will happen to
> packages already installed in my ~/.cabal folder? Some of these are quite
> old and most probably will be incompatible with GHC 7
> Does upgrade process remove old and creat
On 11/08/11 22:33, Jason Dagit wrote:
> On Tue, Nov 8, 2011 at 9:40 AM, Michael Orlitzky wrote:
>> Does anyone know what causes these? This used to work, like, a month
>> ago. It builds fine without the -fhpc.
>
> What has changed in that time? New Ghc? New updates from your OS?
> New code in y
On 11-11-09 06:37 AM, dokondr wrote:
In case I upgrade to the latest Haskell Platform, what will happen to
packages already installed in my ~/.cabal folder? Some of these are
quite old and most probably will be incompatible with GHC 7
Does upgrade process remove old and create anew ~/.cabal fol
On 9 November 2011 19:50, dokondr wrote:
> On Wed, Nov 9, 2011 at 8:41 PM, Bas van Dijk wrote:
>>
>> On 9 November 2011 11:59, dokondr wrote:
>> > What Haskell package to work with NoSQL storage is both mature and
>> > easiest
>> > to use?
>> > I need persistent storage for simple key/value lis
On Wed, Nov 9, 2011 at 8:41 PM, Bas van Dijk wrote:
> On 9 November 2011 11:59, dokondr wrote:
> > What Haskell package to work with NoSQL storage is both mature and
> easiest
> > to use?
> > I need persistent storage for simple key/value lists (not complex JSON
> > docs).
>
> If your data fits
On 9 November 2011 11:59, dokondr wrote:
> What Haskell package to work with NoSQL storage is both mature and easiest
> to use?
> I need persistent storage for simple key/value lists (not complex JSON
> docs).
If your data fits in RAM then acid-state is also an option:
http://hackage.haskell.or
On Wed, Nov 9, 2011 at 5:46 PM, Daniel Schoepe wrote:
> On Wed, 9 Nov 2011 13:59:46 +0300, dokondr wrote:
> > Hi,
> > What Haskell package to work with NoSQL storage is both mature and
> easiest
> > to use?
> > I need persistent storage for simple key/value lists (not complex JSON
> > docs).
>
Thank you David.I really liked the idea
>let vsx = dfs' g x (x : vis) in
>dfs' g v vsx
I am trying to grasp it. I wrote the stack based dfs which seems to
work.
import Data.List
import Data.Array
import Control.Monad
type Node = Int
type Graph = Array Int [ Node ]
buildGraph :: ( Int ,
On Wed, 9 Nov 2011 13:59:46 +0300, dokondr wrote:
> Hi,
> What Haskell package to work with NoSQL storage is both mature and easiest
> to use?
> I need persistent storage for simple key/value lists (not complex JSON
> docs).
> CouchDB and Cassandra seems to be overkill for my needs. What about Ri
On 9 November 2011 10:56, kaffeepause73 wrote:
> Is it possible to create an unboxed vector of unboxed vector ? :
Why do you want to do this?
If you want multi-dimensional unboxed arrays you could try out repa:
http://www.haskell.org/haskellwiki/Numeric_Haskell:_A_Repa_Tutorial
(I believe it u
Very nice initiative Giovanni, I've already subscribed to everything! :)
Let's now see how many we are, perhaps work together on some documentation... :D
João Paulo Pizani Flor
joaopiz...@gmail.com
Computer Science - UFSC
On Tue, Nov 8, 2011 at 3:06 PM, Giovanni Tirloni wrote:
> Hello,
>
>
Hi,
I don't know about Unboxed, but you can define a newtype wrapper
around Data.Vector.Storable that includes the size as a type-level
natural.
i.e.
data Z
data S n
newtype Vec n a = Vec (Vector a)
Then you can define a storable instance for Storable a => Vec n a, and
thus you can define a st
On Wed, Nov 9, 2011 at 2:11 PM, Giovanni Tirloni wrote:
> I meant install new packages through cabal under a different username. The
> cabal repo should be localized unless you specify --global
>
> Please see Rogan's suggestions.
>
>
Thanks for your help!
In case I upgrade to the latest Haskell Pl
Hi, Oleg
Thanks for your time and your brilliant code. I think this problem is
solved.
Best wishes to you
Regards
Bin
On Wed, Nov 9, 2011 at 2:05 PM, wrote:
>p2num :: Dep a b
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskel
On Wed, Nov 9, 2011 at 8:26 AM, dokondr wrote:
>
>
> On Wed, Nov 9, 2011 at 3:48 AM, Rogan Creswick wrote:
>
>> On Tue, Nov 8, 2011 at 4:30 PM, Giovanni Tirloni
>> wrote:
>> >> 3) How to install it into a separate location so it would not ruin my
>> >> current platform?
>> >
>> > You can insta
Hi,
What Haskell package to work with NoSQL storage is both mature and easiest
to use?
I need persistent storage for simple key/value lists (not complex JSON
docs).
CouchDB and Cassandra seems to be overkill for my needs. What about Riak,
MongoDB, Voldemort, etc. ?
Thanks!
Dmitri.
__
On Wed, Nov 9, 2011 at 3:48 AM, Rogan Creswick wrote:
> On Tue, Nov 8, 2011 at 4:30 PM, Giovanni Tirloni
> wrote:
> >> 3) How to install it into a separate location so it would not ruin my
> >> current platform?
> >
> > You can install it under a different username.
>
Haskell Platform (HP) is
On 9 November 2011 20:56, kaffeepause73 wrote:
> Hello,
>
> quick question about unboxed Vectors :
>
> Is it possible to create an unboxed vector of unboxed vector ? :
>
>> import qualified Data.Vector.Unboxed as V
>> type UnboxedNestedVextor = V.Vector (V.Vector Int)
Only if you can define an U
Hello,
quick question about unboxed Vectors :
Is it possible to create an unboxed vector of unboxed vector ? :
> import qualified Data.Vector.Unboxed as V
> type UnboxedNestedVextor = V.Vector (V.Vector Int)
Alternatively I would have to use:
> import qualified Data.Vector.Unboxed as V
>
30 matches
Mail list logo
