(In reply to comment #25) > @@ +330,5 @@ > > + i1 = 0; > > + if (i2 >= size) > > + i2 = size-1; > > + memmove(sortbuf, data+i1, (i2-i1+1)*sizeof(int)); > > + qsort(sortbuf, i2-i1+1, sizeof(int), cmpint); > > I wonder if there's glib wrapper for that one...
https://developer.gnome.org/glib/2.34/glib-Miscellaneous-Utility-Functions.html#g-qsort-with-data
Might not be necessary to use the GLib wrapper.
(In reply to comment #25) 1)*sizeof( int));
> @@ +330,5 @@
> > + i1 = 0;
> > + if (i2 >= size)
> > + i2 = size-1;
> > + memmove(sortbuf, data+i1, (i2-i1+
> > + qsort(sortbuf, i2-i1+1, sizeof(int), cmpint);
>
> I wonder if there's glib wrapper for that one...
https:/ /developer. gnome.org/ glib/2. 34/glib- Miscellaneous- Utility- Functions. html#g- qsort-with- data
Might not be necessary to use the GLib wrapper.