Free append software for linux

Javascript::Menu is a NumberedTree that generates HTML and Javascript code for
a menu.

SYNOPSIS

use Javascript::Menu;

# Give it something to do (example changes the menus caption):

my $action = sub {
my $self = shift;
my ($level, $unique) = @_;

my $value = $self->getValue;
return "getElementById(caption_$unique).innerHTML=$value";
};


# Build the tree:

my $menu = Javascript::Menu->convert(tree => $otherTree, action => $action);

my $menu = Javascript::Menu->readDB(source_name => $table, source => $dbh,
action => $action);

my $menu = Javascript::Menu->new(value => Please select a parrot,
action => $action);

my $blue = $menu->append(value => Norwegian Blue);
$blue->append(value => Pushing up the daisies);
$menu->append(value => A Snail);

# Or maybe you just want a navigational menu?

my $menu = Javascript::Menu->new(value => Please select a prime minister);
$menu->append(value => Ariel Sharon,
URL => www.corruption.org/ariel_sharon.htm);

$menu->append(value => Benjamin Netanyahu,
URL => www.corruption.org/bibi.htm);

$menu->append(value => Shaul Mofaz, URL => www.martial_law.org);


# Print it out as a right-to-left menu:

my $css = $menu->buildCSS($menu->reasonableCSS);
print $cgi->start_html(-script => $menu->baseJS(rtl),
-style => $css); #CSS plays an important role.
print $tree->getHTML;

Javascript::Menu is an object that helps in creating the HTML, Javascript, and some of the CSS required for a table-based menu. There are a few other modules that deal with menus, But as I browsed through them, I found that none of them exactly fitted my needs. So I designed this module, with the following goals in mind:

Flexibility

The main feature of this module is the ability to supply all nodes or any specific node with a subroutine that is activated in time of the code generation to help decide what the item will do when it is clicked. This allows customisation far beyond associating a link with every item. Multy-level selection menus become very easy to do (and this is, in fact, what I needed when I started writing this).

I18n

Working with i18n (internationalization) can be a big headache. Working with Hebrew (or Arabic) forces you not only to change your charachters, but also to change your direction of writing. I incorporated into this module the ability to produce right-to-left menus and tested it using a legacy ASCII-based encoding (iso-8859-8).

Object Hierarchy

I designed the module to work with two other modules of mine, Tree::Numbered and Tree::Numbered::DB, which simplify the task of building the menu and allow for construction of a menu from database information.

The current version adds support for highlighting the item thats hovered over. Youll find that having made some preliminary steps, like tweaking the CSS to look the way you like it to, the rest is fairly easy.

rPath Appliance Agent project is an extensible application framework for the administration of appliance devices through a web-based user interface.
The framework is comprised of individual component plugins which offer specialized functionality, such as a message log interface, user account preferences, system updates, and entitlement management capabilities.
You can also develop and add plugins to the rAA framework, extending capabilities and functionality for your specific requirements.
To set up your environment for developing rAA, untar the devel.tar.bz2 tarball in the docs directory into your development directory. It should contain the following files:
- README.devel:
this file.
- dev.cfg:
configuration for the development environment.
- raa:
symbolic link to the rAA installation, usually
/usr/lib/python2.4/site-packages/raa.
- raa-service:
used by the startup script for the rAA service daemon.
- raa_service_dev.conf:
configuration file for the rAA service daemon. This contains a pluginDirs
configuration option. Change or append to its value to add additional
directories in which you are developing plugins.
- raa-web:
startup script for the rAA web layer.
- start-raa-service.sh:
startup script for the rAA service daemon.
Enhancements:
- Enhancements to the backup plugin, and a new plugin has been added to allow users to upload new SSL certificates for rAAs Web servers HTTPS connections.

AFD comes from Automatic File Distributor and provides a framework for very flexible, non-stop, log and debug-able delivery of an arbitrary amount of files to multiple recipients as expressed in URLs (currently mailing and ftp supported with the mailto://user@domain and ftp://user:password@host URL conventions). AFD stands for Automatic File Distributor.
The most common technique used to distribute data is for each individual to fetch the data from one common place. This place can be a database, FTP-server or even the WWW (World Wide Web). However, this is not always the most user or customer friendly way for a company or organization to distribute its products. For this reason AFD (Automatic File Distributor) was developed, to provide a better service to users or customers in transporting the required data directly to the location where it is required.
When distributing files to a remote host it does so via the FTP or SMTP protocol. Local distribution is done by simply copying files from one directory to another. To distribute files, the AFD has one central configuration file (DIR_CONFIG), where the system administrator can specify which files are to be distributed and where they are to be sent.
Main features:
- The AFD can send/retrieve any type of file, regardless of contents and the name of the file.
- Only the files are being distributed, no other additional information is send with the file.
- The AFD has a very sophisticated and compact X11 interface to monitor and control the distribution of files (afd_ctrl). It has the ability to do extensive logging of all activities, even down to tracing each individual FTP/SMTP command.
- Files can be send to places where no AFD is installed.
- There can be more than one process distributing files to a single host. This has the advantage that when a large file is currently being distributed, other files dont have to wait until the large file is done.
- Where net capacity is limited, it is possible to distribute files with priority.
- If the transfer gets interrupted, AFD can append files. So data that has already been transmitted will not be send again.
- It is possible to setup a whole network of AFDs that can be monitored and controlled through a single interface (mon_ctrl).
Version restrictions:
- The AFD requires X11R5 and Motif 1.2.x (or higher).
Enhancements:
- Files that have been distributed or are to be distributed can now be viewed via show_olog and show_queue dialog.
- A new interface for acknowledging errors was added.
- All events are logged into a separate log file.
- The pattern matching function was enhanced so that it can also handle [] brackets.
- More syntax checks were added for options in DIR_CONFIG.

afbackup project is a client-server backup system offering several workstations a centralized backup to special backup servers.

The backup on the clients can be started automatically using cron-jobs on the clients, but the more intelligent solution is to start it remotely from a central administrative host. To be independent of tricks like rsh, rcp and so on, that are in fact security holes, this remote start option is implemented internally.

This is done because normally the backup has to be run with root authorization, otherwise files that are read protected by users would not be backed up. Any streaming device can be used for writing the data to it.

The only thing it must be able to do is to distinguish between several files on tape so that it can be positioned directly. Writing backups is normally done sequentially: The next writing to tape goes to the end of the previous write no matter from where you have restored in the meantime.

There is a special possibility for the administrator to change the next writing position, but this should be done only in emergency cases (See: PROGRAMS, "cartis"). Another way to be more flexible here is to configure variable append mode.

Tree::Numbered is a thin N-ary tree structure with a unique number for each item.

SYNOPSYS

use Tree::Numbered;
my $tree = Tree::Numbered->new(John Doe);
$tree->append(John Doe Jr.);
$tree->append(Marry-Jane Doe);

while (my $branch = $tree->nextNode) {
$branch->delete if ($branch->getValue eq Stuff I dont want);
}

my $itemId = what_the_DB_says;
print join --- , $tree->follow($itemId); # a list of items up to itemId.

$tree->allProcess( sub {
my $self = shift;
$self->getValue =~ /^(S*)/;
$self->addField(FirstName, $1);
} );

etc.

Tree::Numbered is a special N-ary tree with a number for each node. This is useful on many occasions. The first use I found for that (and wrote this for) was to store information about the selected item as a number instead of storing the whole value which is space-expensive.

Every tree also has a lucky number of his own that distinguishes it from other trees created by the same module. This module is thin on purpose and is meant to be a base class for stuff that can make use of this behaveiour. For example, I wrote Tree::Numbered::DB which ties a tree to a table in a database, and Javascript::Menu which uses this tree to build menus for websites.

One more feature that the module implements for the ease of subclassing it is an API for adding and removing fields from trees and nodes.

Splashy for Edgy project paints graphic images directly to framebuffers using libdirectfb.

Splashy is a boot splash program that doesnt require patching the Linux kernel. Splashy project paints graphic images directly to framebuffers using libdirectfb.

-----------------------------------------------------------------
VGA settings
-----------------------------------------------------------------
640x480 800x600 1024x768 1280x1024
256 colors 768 771 773 775
32K colors 784 787 790 793
64K colors 785 788 791 794
16M colors 786 789 792 795
-----------------------------------------------------------------

For 1024x768 at 16bit (64K colors or "thousands of colors") you could pass an argument to the kernel like:

vga=791

These values could be used in base16 also (hexadecimal) like:

vga=0x317

To pass arguments to the kernel, you would need to edit your boot-loader:

1. Grub /boot/grub/menu.lst
hint, in debian, look for "#kopt" and append vga=0x317 to that line. Then run update-grub. Other distros edit the kernel root= line appropriately
2. Lilo /etc/lilo.conf
hint, look for the default image= and edit append= by appending vga=0x317 to it
3. Quik /etc/quik.conf
on PPC machines. Append vga=0x317 to the kernel argument line

AI::Prolog::Introduction Perl module contains the what and the why of logic programming.

You can skip this if you already know logic programming.

Note that most of this was pulled from my write-up about logic programming in Perl at http://www.perlmonks.org/?node_id=424075.

In Perl, generally you can append one list to another with this:

my @Z = (@X, @Y);

However, thats telling the language what to do. As sentient beings, we can look at that and infer more information. Given @Z and @X, we could infer @Y. Given just @Z, we could infer all combinations of @X and @Y that can be combined to form @Z.

Perl cannot do that. In logic programming, however, by defining what append() looks like, we get all of that other information.

In Prolog, it looks like this:

append([], X, X).
append([W|X],Y,[W|Z]) :- append(X,Y,Z).

(Theres actually often something called a "cut" after the first definition, but well keep this simple.)

What the above code says is "appending an empty list to a non-empty list yields the non-empty list." This is a boundary condition. Logic programs frequently require a careful analysis of boundary conditions to avoid infinite loops (similar to how recursive functions in Perl generally should have a terminating condition defined in them.)

The second line is where the bulk of the work gets done. In Prolog, to identify the head (first element) of a list and its tail (all elements except the first), we use the syntax [head|tail]. Since ":-" is read as "if" in Prolog, what this says if we want to concatenate (a,b,c) and (d,e,f):

Given a list with a head of W and a tail of X:

@list1 = qw/a b c/; (qw/a/ is W, the head, and qw/b c/ is X, the tail)

If its appended to list Y:

@Y = qw/d e f/;

We get a list with a head of W and a tail of Z:

@list2 = qw/a b c d e f/;

Only if X appended to Y forms Z:

X is qw/b c/. Y is qw/d e f/. Z is qw/b c d e f/.