[Vala] Coroutine examples?

2009-04-23 Thread Yu Feng
Dear list, Are there any example/productive code written in VALA for co-routines? I am getting interested into it but have very little idea about how to take it in to real world usage. Regards, Yu ___ Vala-list mailing list Vala-list@gnome.org http:/

[Vala] new signal syntax

2009-04-23 Thread Adam Dingle
I, for one, would like to express my preference for the old signal syntax (+= and -=) over the new syntax (connect and disconnect). I prefer the old syntax because 1) I find it more readable, especially when a lambda expression is involved. 2) Signals are special: they are part of the languag

Re: [Vala] preprocessor rules

2009-04-23 Thread Jürg Billeter
On Thu, 2009-04-23 at 12:47 +0200, pancake wrote: > In vala 0.7 we have some preprocessor rules '#if','#else','#endif'...But > looks that it can only work with > variables, so if i do: > > [...] > Are there plans to support numeric values in preprocessing conditionals? There are no plans for num

[Vala] preprocessor rules

2009-04-23 Thread pancake
In vala 0.7 we have some preprocessor rules '#if','#else','#endif'...But looks that it can only work with variables, so if i do: #if 0 commented code #else code that will be compiled #endif works, because it handles 0 as a variable and it is not defined, so the conditional will not match, b

Re: [Vala] Autocasting for lambdas

2009-04-23 Thread pancake
Sam Liddicott wrote: * pancake wrote, On 23/04/09 10:33: It is possible to reduce this code? gw.graph.nodes.sort( (a,b) => { Grava.Node *na = a; Grava.Node *nb = b; return (int)(na->y - nb->y); } ); I don't think you can do this, but try it - it would be nice if it would work: gw.gra

Re: [Vala] Autocasting for lambdas

2009-04-23 Thread Sam Liddicott
* pancake wrote, On 23/04/09 10:33: > It is possible to reduce this code? > > gw.graph.nodes.sort( > (a,b) => { > Grava.Node *na = a; > Grava.Node *nb = b; > return (int)(na->y - nb->y); > } > ); > I don't think you can do this, but try it - it would be nice if it would work: gw.graph.nodes.sort(

[Vala] Autocasting for lambdas

2009-04-23 Thread pancake
It is possible to reduce this code? gw.graph.nodes.sort( (a,b) => { Grava.Node *na = a; Grava.Node *nb = b; return (int)(na->y - nb->y); } ); I would like to be able to drop or move the (Grava.Node *) definition so

[Vala] libpcl - was Re: shortcut: Better co-routine support with fibers

2009-04-23 Thread Sam Liddicott
libpcl is partly based on earlier coroutine work and the GNU Pthread library and seems complete and up to date (although libcoro seems to have some work-arounds for Irix that libpcl doesn't have) So I'm doing some experiments with libpcl For anyone who wants to play, the source is available from: