Free top software for linux

Warm 1.0 is yet another nice theme for Linux users. It has sandy colors with a hint of sunset. This also includes a panel back ground for top and bottom panels and a wall paper that goes well with it.

Debmarshal is a Debian repository management system. The project is designed to manage a set of local release tracks of modified and additional packages on top of a full public repository (eg. Ubuntu/dapper, Debian/sid ...).

The local database is Berkeley DB for speed. Packaged file overlaps and undeclared dependency problems can be detected. Multiple labels and permanent numbered snapshots are a feature of debmarshal managed repositories.

File::Attributes::Recursive module contains inherit file attributes from parent directories.
SYNOPSIS
Works like File::Attributes, but will recurse up the directory tree until a matching attribute is found.
EXPORT
None, by default. Specify the functions youd like to use as arguments to the module. :all means export everything.
FUNCTIONS
get_attribute_recursively($file, [$top], $attribute)
Returns the value of attribute $attribute. If $top is specified, then the search will terminate when the path no longer contains $top. (i.e. if $file is /foo/bar/baz/quux and $top is
get_attributes_recursively($file, [$top])
Returns a hash of key value pairs for all attributes that apply to $file. Only the closest attributes are returned. Given:
/a (a = yes, foo = bar)
/a/b (b = yes, foo = baz)
/a/b/c (c = yes)
get_attributes_recursively(/a/b/c, /a) will return:
(a => yes, b => yes, c => yes, foo => baz).
The foo => bar is masked by the "closer" foo => baz.
list_attributes_recursively($file, [$top])
Returns a list of attributes that are defined and apply to $file. Like keys get_attributes_recursively($file, [$top]), but faster.
NOTABLY ABSENT FUNCTIONS
unset_attribute_recursively
There are two possible ways for this function to behave -- either recurse until the attribute is removed, or recurse to top, removing the attribute at each level. The first doesnt make sense, and the second is dangerous. If you need this function, write it for the specific needs of your application; I think thats the safest thing to do.
(Note that rm refuses to rm .., so I think theres some precedent here.)
Enhancements:
- Perl

Sort::Key::Top is a Perl module that can select and sort top n elements.

SYNOPSIS

use Sort::Key::Top (nkeytop top);

# select 5 first numbers by absolute value:
@top = nkeytop { abs $_ } 5 => 1, 2, 7, 5, 5, 1, 78, 0, -2, -8, 2;
# ==> @top = (1, 2, 1, 0, -2)

# select 5 first words by lexicographic order:
@a = qw(cat fish bird leon penguin horse rat elephant squirrel dog);
@top = top 5 => @a;
# ==> @top = qw(cat fish bird elephant dog);

The functions available from this module select the top n elements from a list using several common orderings and custom key extraction procedures.

They are all variations around

keytopsort { CALC_KEY($_) } $n => @data;

This function calculates the ordering key for every element in @data using the expression inside the block. Then it selects and orders the $n elements with the lower keys when compared lexicographically.

It is equivalent to the pure Perl expression:

(sort { CALC_KEY($a) cmp CALC_KEY($b) } @data)[0 .. $n-1];

Variations allow to:

- use the own values as the ordering keys
topsort 5 => qw(a b ab t uu g h aa aac);

==> a aa aac ab b
- return the selected values in the original order
top 5 => qw(a b ab t uu g h aa aac);

==> a b ab aa aac
- use a different ordering
For instance comparing the keys as numbers, using the locale configuration or in reverse order:
rnkeytop { length $_ } 3 => qw(a ab aa aac b t uu g h);

==> ab aa aac

rnkeytopsort { length $_ } 3 => qw(a ab aa aac b t uu g h);

==> aac ab aa

A prefix is used to indicate the required ordering:

(no prefix)

lexicographical ascending order

r

lexicographical descending order

l

lexicographical ascending order obeying locale configuration

r

lexicographical descending order obeying locale configuration

n

numerical ascending order

rn

numerical descending order

i

numerical ascending order but converting the keys to integers first

ri

numerical descending order but converting the keys to integers first

u

numerical ascending order but converting the keys to unsigned integers first

ru

numerical descending order but converting the keys to unsigned integers first

The full list of available functions is:

top ltop ntop itop utop rtop rltop rntop ritop rutop

keytop lkeytop nkeytop ikeytop ukeytop rkeytop rlkeytop rnkeytop
rikeytop rukeytop

topsort ltopsort ntopsort itopsort utopsort rtopsort rltopsort
rntopsort ritopsort rutopsort

keytopsort lkeytopsort nkeytopsort ikeytopsort ukeytopsort
rkeytopsort rlkeytopsort rnkeytopsort rikeytopsort rukeytopsort

VWM project is an extensible window manager for the console. Built on top of libpseudo and libviper, VWM is more visual alternative to Screen.
Mozilla-style plugins allow for simple expandability: follow a few simple API rules and drop your shared object into a directory to have it added to the main menu.
Enhancements:
- This release fixes a minor bug in the hotkey functionality that was causing already processed hotkeys to be propagated to the top-level (in focus) window.

SQLiteJDBC is a JDBC driver for SQLite which is written as a Java JNI layer over the SQLite 3.3.x API.

SQLiteJDBC supports the most commonly used features of JDBC that can be efficiently implemented on top of SQLite. Only a single native JNI library is required, and SQLite is compiled in.

Binaries are provided for Linux, Mac OS X, and Windows.