Re: data structure problem

[graff]

Your hash of arrays idea seems like a perfectly sensible approach. Whether the structure is hard-coded or is somehow input-dependent, you can easily manage the BrowseEntry widgets:

...
# populate %hash as per the OP
# create $first_BrowseEntry, then:

$first_BrowseEntry->insert( "end", $_ ) for ( sort keys %hash );
...

sub first_browse_callback
{
    $second_BrowseEntry->delete( 0, "end" );
    my $chosen = $first_BrowseEntry->get;

    $second_BrowseEntry->insert( "end", $_ ) for ( sort @{$hash{$chose
+n}} );
}

There'll be more code than that, of course, but not a lot more. When you create the first_BrowseEntry widget, you'll include the "first_browse_callback" function as the "-browsecmd" option value.

(updated to use consistent naming on the widget variable)

[perltux]

Many thanks for your reply!

It cleared my doubt whether I was on the right track with regards to the data structure and your 'first_browse_callback' code snippet helped me greatly with implementing the callback to modify the second widget based on the user selection of the first widget.
My code is working fine now.

You saved me from hours of frustrating experimentation! :-)