Hello Chris,
Friday, March 17, 2006, 10:31:28 PM, you wrote:
>> i tried to implement this today :) but there is one problem:
i've uploaded current version as http://freearc.narod.ru/ArrayRef.tar.gz
see the Dynamic.hs usage example and Data/Array_/Dynamic.hs
implementation module for details
--
Hello Chris,
Friday, March 17, 2006, 10:31:28 PM, you wrote:
CK> If I may make a suggestion: I think you have identified a need for certain
CK> operations which would benefit from a typeclass. The dynamic arrays need
new
CK> operations on their indices, so they need a more specific type than Ix
Hello Jared,
Friday, March 17, 2006, 9:11:43 PM, you wrote:
JU> Or just the range resize function :: (a,a) -> (a,a) telling how to
JU> grow on a resize, i.e. for enums function = id. Something like that.
yes, i implemented this, and it even works :)
--
Best regards,
Bulat
Small typo fix:
>
> expandVector (Vector s) = do
> let a = bounds s
> b = expandSize b
b = expandSize a
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Jared Updike wrote:
> (Moved to haskell-cafe)
>
> JU> General question to the list:
> JU> (Q) Are there any data structures in Haskell similar to C++/STL
> JU> vectors or C# generic Lists (i.e. strongly typed ArrayLists, e.g.
> JU> List)? These data structures grow automatically as you add
> JU>
(Moved to haskell-cafe)
JU> General question to the list:
JU> (Q) Are there any data structures in Haskell similar to C++/STL
JU> vectors or C# generic Lists (i.e. strongly typed ArrayLists, e.g.
JU> List)? These data structures grow automatically as you add
JU> elements to them (but in large chu
Matthias Fischmann wrote:
On Thu, Mar 16, 2006 at 12:40:00PM +, Chris Kuklewicz wrote:
(Why isn't it "resourceName :: String" ?)
when i am trying this, ghc complains that the type of resourceName
doesn't have any occurrance of 'a', and i feel that it must be harder
for the type engine to f
Ben Rudiak-Gould wrote:
Matthias Fischmann wrote:
now i want to create a list of a type similar to
[r1, r2, r3] :: (Resource a) => [a]
but with r1 being pizza, r2 being crude oil, and so on.
The type you actually want here is [exists a. (Resource a) && a], but
no Haskell implementation sup
Matthias Fischmann wrote:
is there any difference between these
two? if they are equivalent, why the two different ways to say it?
data X where X :: (Resource a) => a -> X
data Y = forall a . (Resource a) => Y a
There's no difference. There are two ways to say it for historical reasons.
Matthias Fischmann wrote:
now i want to create a list of a type similar to
[r1, r2, r3] :: (Resource a) => [a]
but with r1 being pizza, r2 being crude oil, and so on.
The type you actually want here is [exists a. (Resource a) && a], but no
Haskell implementation supports that.
data Rs
Neil Mitchell wrote:
#ifdef __WIN32__
(Windows code)
#else
(Linux code)
#endif
In Yhc, we use a runtime test to check between Windows and Linux.
I think the cleanest solution is to factor the OS-specific code into
separate modules with OS-independent interfaces and names, and pull in
On Thursday 16 March 2006 18:13, Frederik Eaton wrote:
> Also, in my experiments (with matrix inversion) it seems,
> subjectively, that Octave is about 5 or so times faster for operations
> on large matrices. Presumably you've tested this as well, do you have
> any comparison results?
>
Frederik,
12 matches
Mail list logo
