Free isosurfaces explained software for linux

libports library is a simpler API for TCP sockets.

libports is a package that can be used for creating inbound and outbound sockets. It has a few functions to read, write and create new TCP sockets.

You can create and read inbound/outbound sockets with only a few lines of code. It should compile on all Linux systems.

In the "tests" directory, you will find 3 programs you may use as references. Also, in the "docs" directory is a small howto outlining the functions. The 3 test programs are explained in short in the howto. 1 and 2 do require some modification, so read the comments.

To the best of my knowledge, this compiles on:

Platform Version x86 alpha sparc

Linux All yes yes yes
NetBSD All yes yes ??

XUP is an attempt to replace static per-site user accounts, which most present dynamic web sites use in absence of an easy to use and open/shared user account system. It allows people to use a single account or profile with many sites, or one of their existing user profiles on multiple other web sites.

It is best suited to so called "community" sites, where the account serves mainly for lax identification of people among each other. It does not stipulate strong authentication (while OpenID or LID can be used) and is therefore only useful for applications with mediocre security and privacy demands.

Chat and discussion sites are the main target, but profiles in different applications can often also be enriched with them. They are meant to get used secondarily (as alternative) to static/local user accounts.

The XML format of user profiles is extremely simple, as is the associated login service API. Both are outlined and explained in the introduction (HTML). The format is basically an XMLified vCard with a few additions targetted at online/web communities. It is easy to parse and generate and therefore also suitable for profile exchange or import.

Theres also a more authoritative RFC-style text version of the current proposal, which provides further hints and explanations for implementors. Future extensions will get listed in the project Wiki however (field names in the XUP format are not regulated).

This effort is quite new, and therefore only very few actual (real-world) implementations are known so far.

Some software, like discussion boards (which mostly suffer from spaghetti code), are of course hard to extent with XML User Profiles. Even those that abstract their internal user database and UI logic reasonably well can often be difficult to adapt. It is however expected that the more professional systems will sooner than later be XUP compatible.

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.

mirrorlinks project is a small script that automatically mirrors the contents of a directory into another directory using symbolic links, so you dont waste unnecessary disk space in copies.

This is better explained by example, of course:

You have directories Music, Movies and Shared.
You want to mirror both the contents of Music and the contents of Movies into Shared. For some specific reason, you dont want to place links to Movies and Music into Shared,

With mirrorlinks, thats easy to do:

mirrorlinks Music Shared
mirrorlinks Music Movies

Now Shared has the contents of both the Music and Movies directories. To be more accurate, Shared has the directory structure of both Music and Movies merged into one single directory, with symbolic links pointing to the actual files. So if you had files into Music/ATB, Shared would contain a folder named ATB, and this folder would contain links to the files in Music/ATB.