Arrayc
  Home FAQ Contact Sign in
 
Advanced search
MATCHING GROUPS



more...
POPULAR GROUPS

more...

found 5 articles for 0.304 sec
My only suggestion is that the UDT should be wrapped inside a class. Saga -- "Jacquelin Hardy" <jachardyNON@SPAMMEvideotron.ca> wrote in message news:489C6F9F.6070700@videotron.ca... > Hello Larry, > > thank's for showing my French ears a new word (malapert). A polite way to avoid saying something > else... > > Regarding my post, > > the informations that are get thru AIS (info     

Group: microsoft.public.vb.general.discussion · Group Profile · Search for Arrayc in microsoft.public.vb.general.discussion
Author: Saga
Date: Aug 8, 2008 10:05

Hello Larry, thank's for showing my French ears a new word (malapert). A polite way to avoid saying something else... Regarding my post, the informations that are get thru AIS (info transmitted thru VHF and then transformed to 6bit encapsulated data are stored in my software in UDTs like so: Public Type TargetData ChronoSec As Long Delai As Long MMSI As String NavStatus
Show full article (2.59Kb) · Show article thread
While scanning my Inbox I read 'fast' and 'array' in the context of functional programming. Well, of course SaC instantly came to my mind (what a surprise ;) ). So I did some measurements myself. I used your programs, except that I increased the array size by a factor of 10. For the C++ version I had to move the array to the heap and fix the order of function applications within the fold. Here     

Group: microsoft.public.vb.general.discussion · Group Profile · Search for Arrayc in microsoft.public.vb.general.discussion
Author: Jacquelin Hardy
Date: Aug 8, 2008 09:09

Of course I know that the list version is very unfair, but I wanted to see what was the trade off between elegance and speed. Regarding whether low level programming makes sense or not, I was just curious to see what are the limits of Haskell. Moreover there is not much literature on high performance Haskell programming (tricks like unsafeWrite), at least organized in a systematic and concise
Show full article (3.26Kb) · Show article thread
I was reading an old post where Hal Daume III was analyzing Haskell performance for arrays. He proposed a test program which initializes an array, reverse it a number of times, and sums the contents. So I wrote a c++ reference program, a naive haskell version using lists and I also tweaked a little bit with the IOArray version, which should be the fastest. Unfortunately there is a huge performance     

Group: fa.haskell · Group Profile · Search for Arrayc in fa.haskell
Author: Stephan Herhut
Date: May 1, 2007 11:46

Show full article (6.39Kb) · Show article thread
    

Group: fa.haskell · Group Profile · Search for Arrayc in fa.haskell
Author: Federico Squartini
Date: May 1, 2007 07:36

Show full article (4.89Kb)
    

Group: fa.haskell · Group Profile · Search for Arrayc in fa.haskell
Author: Federico Squartini
Date: May 1, 2007 04:59

Show full article (4.22Kb)