Free multiple files software for linux

IO::Multiplex is a Perl module that can manage IO on many file handles.

SYNOPSIS

use IO::Multiplex;

my $mux = new IO::Multiplex;
$mux->add($fh1);
$mux->add(*FH2);
$mux->set_callback_object(...);
$mux->listen($server_socket);
$mux->loop;

sub mux_input {
...
}
IO::Multiplex is designed to take the effort out of managing multiple file handles. It is essentially a really fancy front end to the select system call. In addition to maintaining the select loop, it buffers all input and output to/from the file handles. It can also accept incoming connections on one or more listen sockets.

It is object oriented in design, and will notify you of significant events by calling methods on an object that you supply. If you are not using objects, you can simply supply __PACKAGE__ instead of an object reference.

You may have one callback object registered for each file handle, or one global one. Possibly both -- the per-file handle callback object will be used instead of the global one.

Each file handle may also have a timer associated with it. A callback function is called when the timer expires.

Multistat is designed to be a flexible log file parser for multiple game servers.

Designed with an extensible plugin interface, it is able to process statistics for any game and output them in any format simply by the use of custom modules.

Currently modules for Halflife, Counterstrike Source, Unreal Tournament 2004, Call of Duty 1, Unreal Tournament, and HTML output are included.

AVI TV Episode File Resizer script is not for multiple MOVIE files (only TV) however it can do SINGLE MOVIE files quite nicely. The project was designed to help me fit (resize the file) multiple Xvid TV episodes (entire season) on a single DVD. Most of the time a TV series is almost exactly the same hours, mins, secs.

That enables this script to set the video bitrate the same for every file (episode) being processed to get the desired file size. The calculation is based on the hours, mins, seconds and the desired file size you want. If you correctly enter the time you will end up with a file size VERY close to the value you entered. The episodes will likley vary about 10 secs or so. Try to average that out when you select the episode time

The new files will have the EXACT same name as the old files so the input and output cannot be in the same DIRECTORY.

The "input files" selector can select multiple files so you can encode one or many files.

If you select an entire season (about 25 episodes) of files it could take quite a few hours to complete. The progress bar updates AFTER the completion of the first file and after every file there after. The current file being processed is displayed in the bottom status bar.

Transcode single pass is used to REencode the files.

Each file will be REencoded with MP3 audio bitrate of 96 kbps. The video is REencoded with the Xvid4 codec.

I used this script to go from 230MB to 175MB with good results. That saved me almost 1.4G for the season (25 episodes) and let me get it on a single DVD to play on my stand alone player.

You should try it with a single file first to check the quality and then do a batch job.

There are other tools to do this but this one can be setup and going in less than 1 min.

It takes almost 10 hours to do an entire season (25 episodes) at an episode time of 25 min 30 sec with a target file size of 171MB (ends up being about 174.8MB)

The goal of the Parallel Virtual File System (PVFS) Project is to explore the design, implementation, and uses of parallel I/O. PVFS serves as both a platform for parallel I/O research as well as a production file system for the cluster computing community. PVFS is currently targeted at clusters of workstations, or Beowulfs.
The PVFS project is conducted jointly between The Parallel Architecture Research Laboratory at Clemson University and The Mathematics and Computer Science Division at Argonne National Laboratory.
Additional funding for the PVFS project comes from NASA Goddard Space Flight Center Code 930 and The National Computational Science Alliance through the National Science Foundations Partnerships for Advanced Computational Infrastructure.
Main features:
- Compatibility with existing binaries
- Ease of installation
- User-controlled striping of files across nodes
- Multiple interfaces, including a MPI-IO interface via ROMIO
- Utilizes commodity network and storage hardware
PVFS supports the UNIX I/O interface and allows existing UNIX I/O programs to use PVFS files without recompiling. The familiar UNIX file tools (ls, cp, rm, etc.) will all operate on PVFS files and directories as well. This is accomplished via a Linux kernel module which is provided as a separate package.
PVFS is easy to install. The Quick Start page describes how to set up a simple installation. Scripts and test applications are included to help with configuration, testing for correct operation, and performance evaluation.
PVFS stripes file data across multiple disks in different nodes in a cluster. By spreading out file data in this manner, larger files can be created, potential bandwidth is increased, and network bottlenecks are minimized. A 64-bit interface is implemented as well, allowing large (more than 2GB) files to be created and accessed.
Enhancements:
- fixes to build under redhat 2.4.20-20.9 kernel
- checks for missing headers on ancient 2.4 kernels
- removal of unused fields from metadata and control messages
- updated pvfsd rc file
- handle various combinations of redhat kernel patches
- fixes to kpvfsd that had previously been fixed in user space
- fix for sftp directory reading problems
- fix to avoid oopses on clients when bad errno values returned
- adjustments to deal wiht gcc 3.4.0 issues
- fixes to work with redhat 9
- fixes to compile kernel code for xx86_64
- updated logging intrastructure
- fixes to error reporting
- update of makefile in pvfs core
- fix to bug in pvfs_open.c where pcount < 0 caused errors
- removed duplicated code in mgr
- fix for problem with bvrecv() optimization
- more unused code removal
- adjustments to keep portland group compiler happy
- removed sd_path from metadata
- new iod.rc and mgr.rc files
- fixes to chmod
- fixes to get correct fs_ino back to clients
- multiple mtime fixes
- streamlined pvfs file detection
- shared library building
- fixed closing socket bug in iod
- reordered messaging in mgr to iods to improve concurrency
- rename fix
- improved metadata file checking
- do_access permission fixes
- fix for "iod out of space" client hang
- cleaner dead socket handling, including special handling of case where mgr would close fds that clients were using
- noninteractive mkmgrconf

File::Sort is a Perl module to sort a file or merge sort multiple files.

SYNOPSIS

use File::Sort qw(sort_file);
sort_file({
I => [qw(file_1 file_2)],
o => file_new, k => 5.3,5.5rn, -t => |
});

sort_file(file1, file1.sorted);

This module sorts text files by lines (or records). Comparisons are based on one or more sort keys extracted from each line of input, and are performed lexicographically. By default, if keys are not given, sort regards each input line as a single field. The sort is a merge sort. If you dont like that, feel free to change it.

Options

The following options are available, and are passed in the hash reference passed to the function in the format:

OPTION => VALUE

Where an option can take multiple values (like I, k, and pos), values may be passed via an anonymous array:

OPTION => [VALUE1, VALUE2]

Where the OPTION is a switch, it should be passed a boolean VALUE of 1 or 0.
This interface will always be supported, though a more perlish interface may be offered in the future, as well. This interface is basically a mapping of the command-line options to the Unix sort utility.

I INPUT

Pass in the input file(s). This can be either a single string with the filename, or an array reference containing multiple filename strings.

c

Check that single input fle is ordered as specified by the arguments and the collating sequence of the current locale. No output is produced; only the exit code is affected.

m

Merge only; the input files are assumed to already be sorted.

o OUTPUT

Specify the name of an OUTPUT file to be used instead of the standard output.

u

Unique: Suppresses all but one in each set of lines having equal keys. If used with the c option check that there are no lines with consecutive lines with duplicate keys, in addition to checking that the input file is sorted.

y MAX_SORT_RECORDS

Maximum number of lines (records) read before writing to temp file. Default is 200,000. This may eventually change to be kbytes instead of lines. Lines was easier to implement. Can also specify with MAX_SORT_RECORDS environment variable.

F MAX_SORT_FILES

Maximum number of temp files to be held open at once. Default to 40, as older Windows ports had quite a small limit. Can also specify with MAX_SORT_FILES environment variable. No temp files will be used at all if MAX_SORT_RECORDS is never reached.

D

Send debugging information to STDERR. Behavior subject to change.
The following options override the default ordering rules. When ordering options appear independent of any key field specifications, the requested field ordering rules are applied globally to all sort keys. When attached to a specific key (see k), the specified ordering options override all global ordering options for that key.

d

Specify that only blank characters and alphanumeric characters, according to the current locale setting, are significant in comparisons. d overrides i.

f

Consider all lower-case characters that have upper-case equivalents, according to the current locale setting, to be the upper-case equivalent for the purposes of comparison.

i

Ignores all characters that are non-printable, according to the current locale setting.

n

Does numeric instead of string compare, using whatever perl considers to be a number in numeric comparisons.

r

Reverse the sense of the comparisons.

b

Ignore leading blank characters when determining the starting and ending positions of a restricted sort key. If the b option is specified before the first k option, it is applied to all k options. Otherwise, the b option can be attached indepently to each field_start or field_end option argument (see below).

t STRING

Use STRING as the field separator character; char is not considered to be part of a field (although it can be included in a sort key). Each occurrence of char is significant (for example, delimits an empty field). If t is not specified, blank characters are used as default field separators; each maximal non-empty sequence of blank characters that follows a non-blank character is a field separator.

X STRING

Same as t, but STRING is interpreted as a Perl regular expression instead. Do not escape any characters (/ characters need to be escaped internally, and will be escaped for you).

The string matched by STRING is not included in the fields themselves, unless demanded by perls regex and split semantics (e.g., regexes in parentheses will add that matched expression as an extra field). See perlre and "split" in perlfunc.

R STRING

Record separator, defaults to newline.

k pos1[,pos2]

The keydef argument is a restricted sort key field definition. The format of this definition is:

field_start[.first_char][type][,field_end[.last_char][type]]

where field_start and field_end define a key field restricted to a portion of the line, and type is a modifier from the list of characters b, d, f, i, n, r. The b modifier behaves like the b option, but applies only to the field_start or field_end to which it is attached. The other modifiers behave like the corresponding options, but apply only to the key field to which they are attached; they have this effect if specified with field_start, field_end, or both. If any modifier is attached to a field_start or a field_end, no option applies to either.

Occurrences of the k option are significant in command line order. If no k option is specified, a default sort key of the entire line is used. When there are multiple keys fields, later keys are compared only after all earlier keys compare equal.
Except when the u option is specified, lines that otherwise compare equal are ordered as if none of the options d, f, i, n or k were present (but with r still in effect, if it was specified) and with all bytes in the lines significant to the comparison. The order in which lines that still compare equal are written is unspecified.

pos +pos1 [-pos2]

Similar to k, these are mostly obsolete switches, but some people like them and want to use them. Usage is:

+field_start[.first_char][type] [-field_end[.last_char][type]]

Where field_end in k specified the last position to be included, it specifes the last position to NOT be included. Also, numbers are counted from 0 instead of 1. pos2 must immediately follow corresponding +pos1. The rest should be the same as the k option.

Mixing +pos1 pos2 with k is allowed, but will result in all of the +pos1 pos2 options being ordered AFTER the k options. It is best if you Dont Do That. Pick one and stick with it.

Here are some equivalencies:

pos => +1 -2 -> k => 2,2
pos => +1.1 -1.2 -> k => 2.2,2.2
pos => [+1 -2, +3 -5] -> k => [2,2, 4,5]
pos => [+2, +0b -1] -> k => [3, 1b,1]
pos => +2.1 -2.4 -> k => 3.2,3.4
pos => +2.0 -3.0 -> k => 3.1,4.0

Melys is a MIDI sequencer application for ALSA. It records, plays back, and saves to a MIDI file or to an XML-based format. There is a track view where you can arrange parts using drag-and-drop and a piano-roll view where the same can be done with notes. There is also a graphical tempo view where the tempo of the song can be changed. Multiple files can be open at once, and notes can be dragged between them. It is written in C language and uses the GNOME/Gtk+ widget libraries.
Main features:
- A track view with drag and drop re-arrangement and copying of track parts
- A piano roll view where notes can be freely moved and copied.
- Multiple files and multiple views of the same file can be open at once and elements moved or copied between them. All related views update when one is changed.
- Tracks can be recorded and overdubbed.
- Files can be read and saved as Midi or in a text MDML format.
Enhancements:
- README: Updated for release 0.1.17.
- Makefile: Modified fordist to remove cfiles.
- widgets/melysview.m: Removed printf

mp3cue cuts an input MP3 file according to the information stored in a .cue file (for example multiple tracks of DJ mix), and writes the output to multiple MP3 files.

poc is a mp3 and ogg streamer supporting following protocols:

HTTP (mp3 and ogg)
RTP (RFC 2250) (mp3 only)
RTP (RFC 3119) (mp3 only)
homegrown FEC protocol (mp3 only)

It should work under any POSIX platform, and does not require any additional library. You need a C99 compiler though.

poc is still beta software, ipv6 and ogg support was not tested extensively.

poc includes mp3cue, a mp3 CUE cutter, and mp3cut, a mp3 command-line editing tool.