gtkmm and codeblocks

2010-12-23 Thread bruce

Aloha,

I am using ubuntu-10.10 and have installed the mingw crosscompiler 
available with synaptics.  I can compile a simple console app with no 
problems.  But when I try to cross compile a gtkmm app with mingw I 
always get errors.  It compiles fine with g++ but not i586-mingw32msvc-g++.
My latest and most successful effort is using code::blocks.  The errors 
I am getting now are:


/usr/include/glib-2.0/gio/gcredentials.h:67: error: ‘uid_t’ does not 
name a type


'uid_t' is defined in /usr/i586-mingw32msvc/include/sys/types.h

Can anyone help?  If you need more info I can supply it.

Thanks
Bruce
___
gtk-app-devel-list mailing list
gtk-app-devel-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-app-devel-list

Re: Skip List for GLIB

2010-12-23 Thread Sebastian Dröge
On Wed, 2010-12-22 at 15:07 -0500, Eric Vander Weele wrote:
 
 
 2010/12/22 Sebastian Dröge sebastian.dro...@collabora.co.uk
 On Wed, 2010-12-22 at 11:03 -0500, Eric Vander Weele wrote:
  Hello,
 
 
  Before I started working on this, I wanted to bounce the
 idea of
  adding a skip list -- GSkipList.  It shouldn't be that more
  complicated than the balanced binary tree implementation and
 the test
  driver for a skip list would almost be the same as the the
 one for the
  balanced binary tree.
 
 
 What would be the advantage over GSequence (which internally
 uses a
 balanced binary tree)? Would you implement a deterministic
 (which of the
 many variants?) or probabilistic skip list (would you expose
 the level
 selection probability to allow slower but less memory hungry
 skiplists?)?
 
 
 Insertion/deletion/search could be done with amortized O(log n) time,
 which is similar to GSequence if insertions are done using the
 'insert_sorted()' methods.  However, the advantage over GSequence is
 that insertions are always sorted, there would be no 'prepend' or
 'append' methods and the space efficiency of skip lists is also an
 advantage over GSequence and GTree.  

Right, a GSequence can be unsorted but then it doesn't really have any
advantage over GList unless I'm missing something :)

You would only get better space efficiency (without performance penalty)
if you use a probability of 0.25 per level though (IIRC). For something
like the intuitive 0.5 there's not really a difference... other than
that GSequence offers worst-case O(log n) lookups/insertions while your
skip list would only offer this high probability.

 I was thinking about implementing a probabilistic skip list where the
 level selection probability and max level would be exposed to allow
 for tuning for space/time trade-offs depending on the application.

IMHO (not being a GLib maintainer) this would only be useful in very
specific scenarios and wouldn't be something for a general purpose
library like GLib. But maybe others disagree :)



signature.asc
Description: This is a digitally signed message part
___
gtk-devel-list mailing list
gtk-devel-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-devel-list


Re: Skip List for GLIB

2010-12-23 Thread Matthias Clasen
2010/12/23 Sebastian Dröge sebastian.dro...@collabora.co.uk:


 IMHO (not being a GLib maintainer) this would only be useful in very
 specific scenarios and wouldn't be something for a general purpose
 library like GLib. But maybe others disagree :)


No, I think you pretty much nailed it. GLib is not a data structure library.

We don't generally add new data structures unless there's a specific
need for them somewhere in the GTK+ stack. If you are interested in a
wide variety of data structure variants with different speed/space
tradeoffs, there's other libraries out there, like libavl...
___
gtk-devel-list mailing list
gtk-devel-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-devel-list