I'm looking for a function that will convert a [Word8] byte-array to a
CString (i.e. a C byte array) for the purposes of FFI.
foreign import JVMBridge JVMBridge_FindClass rawFindClass ::
JavaVM - CString - IO JVMObjectRef;
makeCString :: [Word8] - IO CString;
It has to work
Fri, 14 Sep 2001 23:40:42 -0700, Ashley Yakeley [EMAIL PROTECTED] pisze:
I'm looking for a function that will convert a [Word8] byte-array
to a CString (i.e. a C byte array) for the purposes of FFI.
You can use newArray which allocates the C byte array using malloc
so it must be freed by
I'm writing an atom table for a compiler/interpreter, and it would be really
nice to use unsafePtrLT to implement tree-based finite maps.
For clarification, my atom table consists of these three functions:
mkAtom :: String - IO Atom
show :: Atom - String
(==) :: Atom - Atom - Bool
such
At 2001-09-15 02:15, Marcin 'Qrczak' Kowalczyk wrote:
Fri, 14 Sep 2001 23:40:42 -0700, Ashley Yakeley [EMAIL PROTECTED] pisze:
I'm looking for a function that will convert a [Word8] byte-array
to a CString (i.e. a C byte array) for the purposes of FFI.
You can use newArray which allocates
Johannes Waldmann [EMAIL PROTECTED] wrote,
Manuel:
... Functional GUIs like
Fruit are from a research perspective very interesting, but
their design is rather far from being a solved problem,
which makes them a not very likely candidate for a standard
that people seem to like to
S. Alexander Jacobson [EMAIL PROTECTED] wrote,
If the GUI is based on the IO monad, then it doesn't seem like there is
a lot of advantage to doing it in Haskell. It seems like a better
idea to use a more natural language for IO and make RPC/interproc calls
to a haskell server to get stuff
Mike - I hope you don't mind passing this to the list - but it's a great,
simple explanation of a big problem with my approach.
On 14 Sep 2001, Mike Gunter wrote:
The problem is not a loss of referential transparency but the
requirement that evaluation order must be specified. E.g.
what
On Fri, 14 Sep 2001, Mark Carroll wrote: (snip)
simplistic (but adequate for my immediate needs, which are currently
being served with lots of ifs and Maybes!).
Oh - and I should add, lots of two-tuple return values which are
basically of the form (Maybe a, error details). ):
-- Mark
Jeff has hit the nail on the head .. thanks Jeff. You said eloquentlywhat I was hinting at
or saying very implicit (because I didn't know how to say it eloquently). The "Haskell
library" seems to be contributions by individuals (who should be commended!!), butas
an "industrial" programmer who
Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] writes:
Fri, 14 Sep 2001 02:09:21 -0700, Julian Seward (Intl Vendor)
[EMAIL PROTECTED] pisze:
The lack of any way to interface to C++ is a problem, IMO.
I would love to be able to write Haskell programs using Qt
and ultimately the KDE
At 2001-09-15 08:31, Mark Carroll wrote:
AFAICS a simple way to get
out of this is to only have one exception type that carries no information
instead of different ones so we can't distinguish one exception from
another, but that's obviously not great.
Isn't that what 'bottom' is?
--
Ashley
On Sat, 15 Sep 2001, Ashley Yakeley wrote:
At 2001-09-15 08:31, Mark Carroll wrote:
AFAICS a simple way to get
out of this is to only have one exception type that carries no information
instead of different ones so we can't distinguish one exception from
another, but that's obviously not
12 matches
Mail list logo
