Hello Thiago,
Monday, July 3, 2006, 5:52:06 AM, you wrote:
>> can you please describe that "code assistance" means?
> You may know it as code completion, completion assistance or code
thanks
> You could try with EclipseFP, just hit Ctrl-Space.
i still downloading Eclipse in order to try your pl
Hello Duncan,
Monday, July 3, 2006, 12:50:14 AM, you wrote:
>> > instance Ord Atom -- this is where things get difficult!
> and also equal lengths.
> The nice thing about the ByteString representation is that we can use
> the length to short-cut inequality and use equality of the pointers
Bulat,
On 7/2/06, Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
can you please describe that "code assistance" means?
You may know it as code completion, completion assistance or code
suggestion. It is a much used feature on IDEs: just type your code,
hit a special key combination and the program
G'day all.
Quoting Brian Hulley <[EMAIL PROTECTED]>:
> So perhaps my original spec is impossible to implement, though it is an open
> question whether some very clever encoding (with corresponding
> implementation of <) could be found which would lead to a better average
> performance (whatever t
G'day all.
Quoting Brian Hulley <[EMAIL PROTECTED]>:
> I can see that an "unsafe" global ref to a Trie of Char with Unique as the
> "value" of a node would allow me to implement fromString, toString, and
> instance Eq Atom, but I've got no idea how to implement instance Ord Atom so
> that the ord
Brian Hulley wrote:
The comparison would then be:
compare (Atom l) (Atom r) = unsafePerformIO $ do
li <- readIORef l
ri <- readIORef r
return (compare li ri)
which is safe as long as creation of atoms is not allowed inside
unsafePerformIO (it would be nic
Brian Hulley wrote:
So perhaps my original spec is impossible to implement, though it is
an open question whether some very clever encoding (with corresponding
implementation of <) could be found which would lead to a better
average performance (whatever that means).
An alternative design for an
Hi
module somewhere (hopefully with a BSD licence), but a search on Hoogle
turned up no results so maybe I'm mistaken.
Just so people know, not finding a result in Hoogle is not a good
indicator for something not existing. Hoogle doesn't index things for
various reasons:
* Not in the standard
Bulat Ziganshin wrote:
Hello Brian,
Sunday, July 2, 2006, 10:58:29 PM, you wrote:
fromString :: String -> Atom
toString :: Atom -> String
instance Eq Atom
instance Ord Atom -- this is where things get difficult!
i think that ByteString is a very strong candidate to
On Sun, 2006-07-02 at 23:08 +0400, Bulat Ziganshin wrote:
> Hello Brian,
>
> Sunday, July 2, 2006, 10:58:29 PM, you wrote:
>
> > fromString :: String -> Atom
> > toString :: Atom -> String
>
> > instance Eq Atom
> > instance Ord Atom -- this is where things get difficult!
David House wrote:
On 02/07/06, Brian Hulley <[EMAIL PROTECTED]> wrote:
I can see that an "unsafe" global ref to a Trie of Char with Unique
as the "value" of a node would allow me to implement fromString,
toString, and instance Eq Atom, but I've got no idea how to
implement instance Ord Atom so
On 02/07/06, Brian Hulley <[EMAIL PROTECTED]> wrote:
I can see that an "unsafe" global ref to a Trie of Char with Unique as the
"value" of a node would allow me to implement fromString, toString, and
instance Eq Atom, but I've got no idea how to implement instance Ord Atom so
that the order is in
Hello Brian,
Sunday, July 2, 2006, 10:58:29 PM, you wrote:
> fromString :: String -> Atom
> toString :: Atom -> String
> instance Eq Atom
> instance Ord Atom -- this is where things get difficult!
i think that ByteString is a very strong candidate to Atom. `memicmp`
is v
Hi -
I seem to remember from some discussion long ago that there is a Data.Atom
module somewhere (hopefully with a BSD licence), but a search on Hoogle
turned up no results so maybe I'm mistaken.
What I'm looking for is an Atom type and the following operations:
fromString :: String -> At
On Sat, Jul 01, 2006 at 06:14:07PM +0400, Bulat Ziganshin wrote:
> Hello David,
>
> Saturday, July 1, 2006, 5:17:07 PM, you wrote:
>
> >> >The other important point regarding ADT's is what is a FilePath and
> >> >what is a String? If I set the extension of a FilePath, is that
>
> > My leaning (a
Hi
I have a list
>main [(1,2,3),(4,5,6),(3,4,5)]
and i want all Elements at the 1. Pos. in new List:
>[1,4,3]
You might want to take a look at list comprehensions, they fit very
nicely for this sort of problem.
Thanks
Neil
___
Haskell-Cafe maili
Jenny678 wrote:
Hello
Little Problem, hope that somebody can help me
I have a list
main [(1,2,3),(4,5,6),(3,4,5)]
and i want all Elements at the 1. Pos. in new List:
[1,4,3]
Thanks for help
Hello Jenny, and welcome to haskell-cafe.
I will hazard a guess that this resembles a homewor
Hello
Little Problem, hope that somebody can help me
I have a list
>main [(1,2,3),(4,5,6),(3,4,5)]
and i want all Elements at the 1. Pos. in new List:
>[1,4,3]
Thanks for help
--
View this message in context:
http://www.nabble.com/Simple-List-Question-tf1880239.html#a5139831
Sent from the
Hello Thiago,
Saturday, July 1, 2006, 7:56:48 PM, you wrote:
> For this new release we have been working on code assistance support,
> something that has been heavily requested, and a Cabal editor.
can you please describe that "code assistance" means?
--
Best regards,
Bulat
19 matches
Mail list logo
