Free v software for linux

V language is a tiny concatenative language implemented for experimentation.
The source is under Public Domain (un-copyrighted.)
The full featured language is on top of JVM, A native version (in alpha state) is also there in the codebase.
To run it, extract the distribution in any directory and do #gmake run.
gmake
gmake run
V
|
The language is a close relative of postscript, forth and joy. and is stack based. ie:
|2 3 *
=6
|2 3 * 5 +
=11
See status for a tutorial and more info.
The Functions available in V are available in this page: functions
(The releases are out of date and multiple fixes have gone in. Please check out and build rather than use them.)
Example functions in V. getting the roots (with out using the stack shuffling word view)
[quad-formula
[a b c] let
[minisub 0 b -].
[radical b b * 4 a * c * - sqrt].
[divisor 2 a *].
[root1 minisub radical + divisor /].
[root2 minisub radical - divisor /].
root1 root2
].
|2 4 -30 quad-formula ??
=(-5.0 3.0)
using view
[quad-root
[a b c : [0 b - b b * 4 a * c * - sqrt + 2 a * /]] view i
].
|2 4 -30 quad-root ??
=(3)
contrast this with the definition in scheme here
(define quadratic-formula
(lambda (a b c)
(let ([minusb (- 0 b)]
[radical (sqrt (- (* b b) (* 4 ( * a c))))]
[divisor (* 2 a)] )
let ([root1 (/ (+ minusb radical) divisor)]
[root2 (/ (- minusb radical) divisor)])
(cons root1 root2)))))
Definition of Qsort.
[qsort
#definitions
[joinparts [pivot [*list1] [*list2] : [*list1 pivot *list2]] view].
[split_on_first_element uncons [>] split&].
#args starts for binrec. notice that 2 arguments (termination condition
#and its result) are on first line.
[small?] []
[split_on_first_element]
#binrec recurses on the result of split_on_first_element before applying joinparts.
[joinparts]
binrec].
Some explanations.
The first and second lines (terminated by .) are internal function definitions
(Notice how qsort is also terminated by .) . is the definition syntax in V.
The first function joinparts
============================
The function joinpart contains just an application of the operator view.
view is list translator. It takes a list of the form [template : result]
then it tries to apply the template to the current stack. If it can be applied on the
stack, then the arguments named in the template are bound to values in stack. The result is then processed, and all the bound elements in result are replaced by their values.
[pivot [*list1] [*list2] : [*list1 pivot *list2]] view expects 3 arguments on the stack,
the first a single element pivot, then two lists list1 and list2.
It returns a list that is composed of elements of list1 followed by pivot
followed by elements of list2 (as defined in result - RHS of :).
ie:
44 [1 2 3] [5 6 7] [pivot [*list1] [*list2] : [*list1 pivot *list2]] view ??
=> [1 2 3 44 5 6 7]
(The function ?? is used to print out the elements in the stack now.)
The second function split_on_first_element
==========================================
The definition is [uncons [>] split&]
The uncons splits a list into the first element and the rest of the list.
ie:
[1 2 3 4 5] uncons ??
=1 [2 3 4 5]
split& takes two arguments, the first is the function F to split a list with,
and the second the list itself. All elements in the list that passes the function F
is put into the first list, and all that do not are put into the second list.
ie:
[1 2 3 4 5 6 7] [4 >] split& ??
=[5 6 7] [1 2 3 4]
The function F can also take an argument from the stack. so this also works.
4 [1 2 3 4 5 6 7] [>] split& ??
=[5 6 7] [1 2 3 4]
Thus the split_on_first_element takes the first element of a list, and split that
list based on that element as a filter.
binrec
=======
binrec expects 4 arguments,
Arg1 is the terminating condition,
Arg2 is the result if the terminating condition is met.
Arg3 is an executable statement that returns two entities.
The entire binrec statement is performed on each of the
two entities until the terminating condition is met.
Arg4 is what to do with the result of the previous statement.
Algorithm.
Here, the small? checks if the list is empty or contains just one element.
if it is, then the result is arg2 - []
ie:
[] small? ??
=true
[1] small? ??
=true
[1 2 3 4] small? ??
=false
split_on_first_element takes is executed on all lists that are larger than size 1
and as explained above, splits them into two based on the first element.
on the resultent lists, the entire qsort is performed again due to binrec.
The last joinparts takes these elements (pivot list1 list2) which are present now
on the stack, and combines them to produce a single sorted list.
A slightly friendlier function (with out the binrec.)
[qsort
[joinparts [pivot [*list1] [*list2] : [*list1 pivot *list2]] view].
[split_on_first_element uncons [>] split&].
[small?]
[]
[split_on_first_element [list1 list2 : [list1 qsort list2 qsort joinparts]] view i]
ifte].
The binrec and friends are more powerful than the explicit recursion done above, but for people new to concatenative languages, this kind of recursion may look more intuitive.
Enhancements:
- The language has become relatively stable.
- Lots of bugfixes were made in scope handling.
- Tree operations were added.
- Generic combinators were moved out into a separate library.

m2vmp2cut is frame accurate (currently PAL) MPEG2 video (M2V file) with accompanied MP2 audio cutter.

Frame accuracy is achieved by re-encoding video around cutpoints. Audio is cut from a separate MP2 file at positions that keep A/V sync as good as possible (maximum sync difference is around 10-15 milliseconds compared to the source).

TFTP Server is a multi-threaded TFTP server, which means any number of clients can connect simultaneously.
TFTP Server supports tsize, blksize, and interval options, supports PXE boot, and can be run standalone or as a daemon.
TESTING
This server runs in Debug Mode (with flag -v) or as Service (without any flag). Please expand the .gz file to an directory, using shell, goto that directory, edit tftpserver.ini file (just specify home dir) and give following command as root:-
tftpserver#./tftpserver -v
You will see following results:-
Ready...
Now open one more shell and give following commands:-
$tftp
tftp>connect localhost
tftp>get [some file name in home dir]
Received 13112 bytes in 0.0 seconds
and on server you may see
client 127.0.0.1:xxxxx file ...... # blocks served
INSTALLATION
This program runs in two modes:-
a) Debug Mode (using -v argument)
b) Daemon (using no argument)
This program should be setup to start automatically modifying boot scripts /etc/rc.d/rc.local file or /etc/inittab file. Never include -v (verbatim flag) while running as Daemon from these scripts.
CONFIGURATION
You need home directory to be set in tftpserver.ini file, you can comment other parameters like blksize and interval.
UNINSTALLATION
Just remove the program directory. You should also remove entries from initialize scripts of
your machine.
Enhancements:
- This release uses Thread Pool, which improves performance.
- Log file and ini file locations can now be overridden in the Unix version.

GM Invert is a collection of GIMP effects that lets you toggle any one of the effects than it gives back the original image. Cycle through all three effects in any order, and you arrive back to the original image.

The latest version adds the Solarize effect and the cool Vivid V-invert effect.

Geo::Coordinates::VandH is a Perl module that can convert and manipulate telco V and H coordinates.

SYNOPSIS To convert V: 5498 H: 2895 to lat/long coordinates:

use Geo::Coordinates::VandH;
$blah=new Geo::Coordinates::VandH;
($lat,$lon) = $blah->vh2ll(5498,2895);
printf "%lf,%lfn",$lat,$lon;

To find the mileage between 5498,2895 and 5527,2873 in miles:

use Geo::Coordinates::VandH;
$blah=new Geo::Coordinates::VandH;
printf "Distance between Pontiac, MI and Southfield, MI is approximately: %d milesn",$blah->distance(5498,2895,5527,2873);

Currently this package supports the translation of V+H to Lat/Long, and mileage calculations between two V+H coordinates.

Results are returned in decimal degrees for V+H to Lat/Long, and Miles for distance.

Future versions will convert Lat/Long to V+H coordinates.

DateTime::TimeZone::SystemV is a Perl module with System V and POSIX timezone strings.

SYNOPSIS

use DateTime::TimeZone::SystemV;

$tz = DateTime::TimeZone::SystemV->new("EST5EDT");

if($tz->is_floating) { ...
if($tz->is_utc) { ...
if($tz->is_olson) { ...
$category = $tz->category;
$tz_string = $tz->name;

if($tz->has_dst_changes) { ...
if($tz->is_dst_for_datetime($dt)) { ...
$offset = $tz->offset_for_datetime($dt);
$abbrev = $tz->short_name_for_datetime($dt);
$offset = $tz->offset_for_local_datetime($dt);

An instance of this class represents a timezone that was specified by means of a System V timezone string or the POSIX extended form of the same syntax. These can express a plain offset from Universal Time, or a system of two offsets (standard and daylight saving time) switching on a yearly cycle according to certain types of rule.

This class implements the DateTime::TimeZone interface, so that its instances can be used with DateTime objects.