Re: GTK+, & GLIB Questions

[Owen Taylor]

Jim Isom wrote:
To whom it may concern,
 
We received a security issue from Hewlett Packard regarding the version 
GLIB-1.2.10, & GTK+-1.2.10 (Which we currently have installed), I went 
to your site and noticed that you now have version 2.6.2 available.  
This server that currently has the older version running is very 
important to my client.
 
My question is this can I upgrade to 2.6.2 for both GLIB, & GTK without 
any disruption to our system and still know that the product will be 
available for the users that utilize it?  And if not what version can we 
upgrade to to eliminate the security issue and where would I find the 
product at?
Doing a web search indicates that it might be:
http://www.hp.com/products1/unix/java/mozilla/HPSBUX01034.html
If so, it's just a simple packaging screwup on HP's part, and there are
instructions in the report for fixing the problem.
I can't think of any security issues inherent in the GLib/GTK+ 1.2.10
libraries (though they have been out of maintainence from the GTK+ team
for 3+ years now, and have *many* known bugs.)
You certainly won't be able to upgrade from GTK+-1.2.10 to a recent
version and keep the same binaries (probably just Mozilla) running.
Regards,
Owen
___
gtk-list mailing list
gtk-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-list

Re: GTK+, & GLIB Questions

[Pablo]

>the 1.2.x line, then you can upgrade to that version of gtk+-1.2. As Daniel
>pointed out; gtk+-2.x is a different software; so if your fix was added in
>gtk+-2.x, you'll have to port the software to gtk+-2.x.

Or patch (you make de patch) the sources and recompile.

>
>Cheers,
>-Tristan



___
gtk-list mailing list
gtk-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-list

Re: GTK+, & GLIB Questions

[Tristan Van Berkom]

On Thu, 24 Feb 2005 20:13:06 +0100, Daniel Campos
<[EMAIL PROTECTED]> wrote:
> Jim Isom escribió:
> 
> > To whom it may concern,
> >
> > We received a security issue from Hewlett Packard regarding the
> > version GLIB-1.2.10, & GTK+-1.2.10 (Which we currently have
> > installed), I went to your site and noticed that you now have version
> > 2.6.2 available.  This server that currently has the older version
> > running is very important to my client.
> >
> > My question is this can I upgrade to 2.6.2 for both GLIB, & GTK
> > without any disruption to our system and still know that the product
> > will be available for the users that utilize it?  And if not what
> > version can we upgrade to to eliminate the security issue and where
> > would I find the product at?

The question here is what specific security issue are we talking about,
after that, you want to find out which version of gtk+ that security issue
was fixed (possibly by looking through changelogs etc), if it was fixed in 
the 1.2.x line, then you can upgrade to that version of gtk+-1.2. As Daniel 
pointed out; gtk+-2.x is a different software; so if your fix was added in
gtk+-2.x, you'll have to port the software to gtk+-2.x.

Cheers,
-Tristan
___
gtk-list mailing list
gtk-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-list

Re: GTK+, & GLIB Questions

[Daniel Campos]

Jim Isom escribió:
To whom it may concern,
 
We received a security issue from Hewlett Packard regarding the 
version GLIB-1.2.10, & GTK+-1.2.10 (Which we currently have 
installed), I went to your site and noticed that you now have version 
2.6.2 available.  This server that currently has the older version 
running is very important to my client.
 
My question is this can I upgrade to 2.6.2 for both GLIB, & GTK 
without any disruption to our system and still know that the product 
will be available for the users that utilize it?  And if not what 
version can we upgrade to to eliminate the security issue and where 
would I find the product at?

In fact all major distributions use to install both 1.2 and 2.x versions 
of glib and gtk, as some old (may be unmantained) free software program 
uses gtk+-1.2. Note however, that old programs load gtk+-1.2 and new 
programs load gtk+-2.0 when executed, that is, both the old and the new 
versions of these libraries must be installed in the system, you can not 
remove gtk+-1.2 and just replace it for gtk+-2.0 in the hope that the 
old programs load and work OK with gtk+-2.x, they are not binary compatible.

Regards,
D. Campos

 
Please let me know.
 
Thanks,
 
Jim Isom


Do you Yahoo!?
Yahoo! Mail 
 
- Helps protect you from nasty viruses.


___
gtk-list mailing list
gtk-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-list
 

___
gtk-list mailing list
gtk-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-list

GTK+, & GLIB Questions

[Jim Isom]

To whom it may concern,
 
We received a security issue from Hewlett Packard regarding the version GLIB-1.2.10, & GTK+-1.2.10 (Which we currently have installed), I went to your site and noticed that you now have version 2.6.2 available.  This server that currently has the older version running is very important to my client.
 
My question is this can I upgrade to 2.6.2 for both GLIB, & GTK without any disruption to our system and still know that the product will be available for the users that utilize it?  And if not what version can we upgrade to to eliminate the security issue and where would I find the product at?
 
Please let me know.
 
Thanks,
 
Jim Isom
		Do you Yahoo!? 
Yahoo! Mail - Helps protect you from nasty viruses.___
gtk-list mailing list
gtk-list@gnome.org
http://mail.gnome.org/mailman/listinfo/gtk-list

Re: Glib questions.

[Mojo B. Nichols]

>>>>> "Sven" == Sven Neumann <[EMAIL PROTECTED]> writes:

> Hi, [EMAIL PROTECTED] (Mojo B. Nichols) writes:

>> I don't know if this an appropriate forum for posting Glib
>> questions or not.  I have a problem in which I was going to use a
>> hash table to solve, but am know having doubts, or wondering if
>> there is a better approach.  Basically I need to store a string
>> followed by an integer, (although for now I'm just storing the int
>> as a string and converting as necessary).  Each time a string comes
>> along I basically increment the integer.  Eventually I dump the
>> list sorted on the integer. So I've worked through doing the look
>> up in the hash table and have that working appropriately, but it
>> looks like the only way to sort is to dump out of the hash, and
>> either sort myself or say strcat(value and the key) into a list and
>> sort that list  Which brings me to why not just use a list in
>> the first place, except of course then I can't only search on the
>> first string...  The data_relation seems to also get me almost
>> there, but then not allow me to sort.  Intuition tells me to just
>> manipulate the GHash directly, but the manual suggests that I
>> shouldn't.  A couple of functions, one that returns a list of
>> values sorted by key and another that returns a list of keys sorted
>> by values seem like they would be useful... Any way it seems like a
>> somewhat common piece of code and I'm lazy as a sack of potatoes so
>> if someone know a better way please let me know Using Glib...

> looks like you want to use a GTree, which is a balanced binary tree.
> Lookups on balanced binary trees are reasonably fast as long as the
> amount of data isn't too large and in contrast to a hash table, the
> data is sorted.


Hmmm, well I could certainly try it, but (and my apologies for not
being clear earlier) it needs to be sorted by value not key.  I assume
that the order of a GTree is by key and has nothing to do with value.
The lists aren't that big (I can't imagine more then 2 rows), so
the ability to sort by value is more important.

I think that the reality is that whether, Gtree, Hash, or list I need
to have go through the rigors of sorting the value by "hand".  I was
kind of thinking tying two hash's together, or hash and a list to make
the code easy and although maybe not so efficient.  Use the look up on
one and the order on another... Or perhaps write everything myself.


Thanks for your help I will play with the GTree.

Mojo


-- 

___

 "I've finally learned what `upward compatible' means.  It means we
  get to keep all our old mistakes."
 -- Dennie van Tassel
___
gtk-list mailing list
[EMAIL PROTECTED]
http://mail.gnome.org/mailman/listinfo/gtk-list

Re: Glib questions.

[Sven Neumann]

Hi,

[EMAIL PROTECTED] (Mojo B. Nichols) writes:

> I don't know if this an appropriate forum for posting Glib questions
> or not.  I have a problem in which I was going to use a hash table to
> solve, but am know having doubts, or wondering if there is a better
> approach.  Basically I need to store a string followed by an integer,
> (although for now I'm just storing the int as a string and converting
> as necessary).  Each time a string comes along I basically increment
> the integer.  Eventually I dump the list sorted on the integer. So
> I've worked through doing the look up in the hash table and have that
> working appropriately, but it looks like the only way to sort is to
> dump out of the hash, and either sort myself or say strcat(value and
> the key) into a list and sort that list  Which brings me to why
> not just use a list in the first place, except of course then I can't
> only search on the first string...  The data_relation seems to also
> get me almost there, but then not allow me to sort.   Intuition tells
> me to just manipulate the GHash directly, but the manual suggests that
> I shouldn't.   A couple of functions, one that returns a list of
> values sorted by key and another that returns a list of keys sorted by
> values seem like they would be useful... Any way it seems like a
> somewhat common piece of code and I'm lazy as a sack of potatoes so if
> someone know a better way please let me know Using Glib...  

looks like you want to use a GTree, which is a balanced binary tree.
Lookups on balanced binary trees are reasonably fast as long as the
amount of data isn't too large and in contrast to a hash table, the
data is sorted.


Salut, Svem

___
gtk-list mailing list
[EMAIL PROTECTED]
http://mail.gnome.org/mailman/listinfo/gtk-list

Glib questions.

[Mojo B. Nichols]

I don't know if this an appropriate forum for posting Glib questions
or not.  I have a problem in which I was going to use a hash table to
solve, but am know having doubts, or wondering if there is a better
approach.  Basically I need to store a string followed by an integer,
(although for now I'm just storing the int as a string and converting
as necessary).  Each time a string comes along I basically increment
the integer.  Eventually I dump the list sorted on the integer. So
I've worked through doing the look up in the hash table and have that
working appropriately, but it looks like the only way to sort is to
dump out of the hash, and either sort myself or say strcat(value and
the key) into a list and sort that list  Which brings me to why
not just use a list in the first place, except of course then I can't
only search on the first string...  The data_relation seems to also
get me almost there, but then not allow me to sort.   Intuition tells
me to just manipulate the GHash directly, but the manual suggests that
I shouldn't.   A couple of functions, one that returns a list of
values sorted by key and another that returns a list of keys sorted by
values seem like they would be useful... Any way it seems like a
somewhat common piece of code and I'm lazy as a sack of potatoes so if
someone know a better way please let me know Using Glib...  

Again my apologies if this is the wrong list... please feel free to
slap me and send me to the right one. 


Thanks in advance


Mojo
-- 

___

You are not a fool just because you have done something foolish --
only if the folly of it escapes you.
___
gtk-list mailing list
[EMAIL PROTECTED]
http://mail.gnome.org/mailman/listinfo/gtk-list