Free top down software for linux

TopJax is essentially the “top” unix utility ported to the web via Ajax using Sack of Ajax. It provides the ability to view system processes, sort processes by various fields, pause/unpause monitoring, and hide idle processes.

TopJax is released under the GPL.

Plone Drop Down Menu is a product which allows managing multilevel drop down menus in Plone.

Plone Drop Down Menu (qPloneDropDownMenu) product allows managing multilevel drop down menus in Plone. Drop down menu implemented by qPloneDropDownMenu Plone product is search engine friendly.

Add/remove Products)
-For Plone below 2.1 to use drop_down.css add line to your portal ploneCustom.css.
-You have a list of items of your top level menu, which you can edit in drop down menu configlet form. Now, to add submenu to the certain menu item, you need to add unordered list inside of top level menu item

apache-top provides real-time display of the active processes from a remote apache server.
With apache-top you can get:
- The active apache processes with their associated PID, the status, the seconds being active, the CPU usage, the asociated VirtualHost, the accessing ip and the request (POST or GET, the file being accessed and the used protocol)
- The server uptime and the last time it was restarted
- The CPU usage
- Requests by second, Kb by second and the average Kb by request
- Number of active and inactive processes
- A graph with the inactive and active processes and their status

Watsup is a system and process monitor for CPU, memory, page faults, disk IO, network IO.
Low overhead. GUI controls. Formatted report in window. Sample interval down to 0.1 secs. Choose font size. System resources: CPU (1-4), memory (free/used/cache), page faults (hard/soft), disk IO, network IO. Process resources: same + execution file name.
Main features:
- overhead is about 1/3 as much
- sample interval as low as 0.1 seconds is supported
- overall system and top process resources are shown on one page
- disk I/O, network I/O, and page fault rates can be monitored
- font can be made small (for display in a corner) or large (whole screen)
- the top N processes are displayed with minimal jumping around between samples
- (which makes it easier to watch one or a few processes)
- process ranking is a weighted sum of CPU, hard page faults, and disk I/O

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

KnoppMyth is an attempt to make the installation of GNU/Linux and MythTV as trivial as possible.

KnoppMyth includes everything needed to get your set-top box up and running in as little time as possible.

RPN is a Perl extension for Reverse Polish Math Expression Evaluation.

SYNOPSIS

use Math::RPN;
$value=rpn(expr...);
@array=rpn(expr...);

expr... is one or more scalars or lists of scalars which contain
RPN expressions. An RPN expression is a series of numbers and/or
operators separated by commas. (commas are only required within
scalars).

The rpn function will take a scalar or list of sclars which contain an RPN expression as a set of comma delimited values and operators, and return the result or stack, depending on context. If the function is called in an array context, it will return the entire remaining stack. If it is called in a scalar context, it will return the top item of the stack. In a scalar context, if more than one value remains on the stack, a warning will be sent to STDERR.

In the event of an error, an error message will be sent to STDERR, and rpn will return undef.

The expression can contain any combination of values and operators. Any token which is not an operator is assumed to be a value to be pushed onto the stack.

An explanation of Reverse Polish Notation is beyond the scope of this document, but it I will describe it briefly as a stack-based way of writing mathematical expressions. This has the advantage of eliminating the need for parenthesis and simplifying parsing for computers vs. normal algebraic notation at a slight cost in the ability of humans to easily comprehend the expressions.
This evaluator works by cycling through the expression from left to right. As each token is encountered, it is checked against the list of operators. If it matches, then a check is performed for stack underflow.

If the stack has not underflowed, the operation is performed by removing the required number of operands from the top of the stack. The result is then pushed on to the stack. Operations for which order is significant (-,/,%,etc.) are processed such that the top item on the stack is treated as the right operand, and the next item down is treated as the left operand. Thus, "5,3,-" would yield 2, not -2. If the token does not match any of the known operators, the token is blindly pushed onto the stack. As a result, one can produce unexpected results. For example, the expression "5,3,grandma,+,*" would produce 15 because 5*(3+0) is how it would end up evaluated. That is, 5 would be pushed onto the stack, then 3, then "grandma". Next, + is evaluated, so 3+"grandma" is evaluated. PERL evaluates "grandma" to be numerically 0, so 3 is pushed back onto the stack. Next, the * multiplies the top two items of the stack [5][3], producing 15, which is pushed back onto the stack.