forth implementation
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 1879
Procinfo NG 2.0.113 (C++ Implementation)
Procinfo NG is a ground-up rewrite of the procinfo program. more>>
Procinfo NG is a ground-up rewrite of the procinfo program. Procinfo NGs goal is to make the code more readable (and reusable) and to restore broken functionality of the original program.
The original program was written for Linux 1.0, and updated through 2.2. This version is for 2.6.
Enhancements:
- Updates were made to match what some Linux distributions have done to procinfo-18.
- Support for MSI and XEN interrupts were added.
- Some non-x86 architectures are handled.
- Assorted bugs and 80-character console nonsense were fixed.
<<lessThe original program was written for Linux 1.0, and updated through 2.2. This version is for 2.6.
Enhancements:
- Updates were made to match what some Linux distributions have done to procinfo-18.
- Support for MSI and XEN interrupts were added.
- Some non-x86 architectures are handled.
- Assorted bugs and 80-character console nonsense were fixed.
Download (0.041MB)
Added: 2007-08-11 License: GPL (GNU General Public License) Price:
805 downloads
Other version of Procinfo NG
License:GPL (GNU General Public License)
Fast MD5 Implementation in Java 2.6.1
Fast MD5 Implementation in Java is a heavily optimized implementation of the MD5 hashing algorithm written in Java. more>>
Fast MD5 Implementation in Java is a heavily optimized implementation of the MD5 hashing algorithm written in Java.
Fast MD5 Implementation in Java includes an optional native method for even greater speed improvements.
How Fast Is It?
Short answer:Much faster than any other Java implementation that I have tested and (surprisingly) even faster than the native, non-Java MD5 implementation on some systems.
Long answer:First of all, it is important to note that the term "fast" is used here in relative terms. The implementation of the MD5 message digest algorithm available on this page is written in Java and is fast compared with other implementations written in Java, both because it is heavily optimized by itself and because there is an optional native method that makes it even faster when the platform supports it. How it compares to a sensible implementation written in a language, such as C, that is compiled directly to machine code, is heavily dependent upon how good of a job the JIT compiler in your JVM does in compiling the code or whether you are able to use the optional native method.
Enhancements:
- Martin West contributed a bug fix and some code refactoring to make all targets work out of the box in the Ant build file. Previously, the "dist" target did not work if the "docs" directory was not present.
<<lessFast MD5 Implementation in Java includes an optional native method for even greater speed improvements.
How Fast Is It?
Short answer:Much faster than any other Java implementation that I have tested and (surprisingly) even faster than the native, non-Java MD5 implementation on some systems.
Long answer:First of all, it is important to note that the term "fast" is used here in relative terms. The implementation of the MD5 message digest algorithm available on this page is written in Java and is fast compared with other implementations written in Java, both because it is heavily optimized by itself and because there is an optional native method that makes it even faster when the platform supports it. How it compares to a sensible implementation written in a language, such as C, that is compiled directly to machine code, is heavily dependent upon how good of a job the JIT compiler in your JVM does in compiling the code or whether you are able to use the optional native method.
Enhancements:
- Martin West contributed a bug fix and some code refactoring to make all targets work out of the box in the Ant build file. Previously, the "dist" target did not work if the "docs" directory was not present.
Download (0.073MB)
Added: 2006-03-06 License: LGPL (GNU Lesser General Public License) Price:
1350 downloads
Suffix tree implementation library 1.2
Suffix tree implementation library is a C library, an implementation of the suffix trees algorithm to store/retrieve key/data pa more>>
Suffix tree implementation library is a C library, an implementation of the suffix trees algorithm to store/retrieve key/data pairs.
The main advantages are a linear indexing time, little memory usage, and very fast retrieving.
It has been developped on FreeBSD/gcc but should be fairly portable.
The source code "testsfx.c" show an example of how to use the library both for inserting, retrieving, and deleting data. There arent many functions and comments should be enough to give you an idea of how to use the library. (read the header of the source file)
You should edit sfxdisk.h to suit your needs: you can change the alphabet size and the offset type. It should be OK to use "long long" 64 bits ints instead of long, in fact I tested it succesfully but havent gone to the point of filling more than 2 GB of data (needless to say you need a 64 bits filesystem).
Two "tools" come with the library (new with version 1.2): dumpsfx and loadsfx. dumpsfx is used to dump the database: dumpsfx [-s separator] if you want to output the result as readable text or dumpsfx < file.sfx > -h to output it for reloading with loadsfx.
dumpsfx outputs on stdout and loadsfx reads from stdin. loadsfx < suffix tree file to create > < dumped_file
Enhancements:
- removed an useless offset incrementation in STwritenode
<<lessThe main advantages are a linear indexing time, little memory usage, and very fast retrieving.
It has been developped on FreeBSD/gcc but should be fairly portable.
The source code "testsfx.c" show an example of how to use the library both for inserting, retrieving, and deleting data. There arent many functions and comments should be enough to give you an idea of how to use the library. (read the header of the source file)
You should edit sfxdisk.h to suit your needs: you can change the alphabet size and the offset type. It should be OK to use "long long" 64 bits ints instead of long, in fact I tested it succesfully but havent gone to the point of filling more than 2 GB of data (needless to say you need a 64 bits filesystem).
Two "tools" come with the library (new with version 1.2): dumpsfx and loadsfx. dumpsfx is used to dump the database: dumpsfx [-s separator] if you want to output the result as readable text or dumpsfx < file.sfx > -h to output it for reloading with loadsfx.
dumpsfx outputs on stdout and loadsfx reads from stdin. loadsfx < suffix tree file to create > < dumped_file
Enhancements:
- removed an useless offset incrementation in STwritenode
Download (0.015MB)
Added: 2006-08-07 License: GPL (GNU General Public License) Price:
1189 downloads
Bellagio OpenMAX IL Implementation 0.3.1
Bellagio is a sample implementation of OpenMAX IL for Linux. more>>
Bellagio is a sample implementation of OpenMAX IL for Linux.
It enables software developers and ISVs to familiarize themselves with the OpenMAX IL API and to develop their own OpenMAX multimedia and streaming media components for mobile devices, including codecs, video I/O, and audio mixers.
Included sample components comply with the OpenMAX base and interoperability profiles and can be tunnelled together.
Main features:
- a shared library with the IL core and a "reference" OpenMAX component
- a number of OpenMAX components which pass Khronos conformance tests
- a set of GStreamer plugins that use the IL API (not available yet)
Enhancements:
New video components:
- ffmpeg based MPEG4/H.264 decoder
- color converter component YUV -> RGB
- video renderer based on devFB
New audio component:
- audio file reader based on ffmpeg audio format
- volume component
Fixed known bugs:
- FFMPEG audio decoder now works on FC6 and other distributions with the latest ffmpeg release (0.4.9-0.35.20070204)
Known pending bugs:
- some ogg streams can not be decoded properly
- the tunneling between file reader, mp3 dec based on ffmpeg - alsa sink ends in a deadlock sometimes.
- This behavior has been detected some times using FC6 and UBUNTU, not with the FC4
Full list of components:
Audio:
- ogg decoder based on libvorbis (stand alone components, and multiple roles component)
- mp3 decoder based on mad decoder
- mp3 decoder based on ffmpeg (multiple roles component)
- volume component
- alsa audio sink
- ffmpeg audio file reader (to be used with mp3 ffmpeg decoder)
Video:
- MPEG4 decoder based on ffmpeg (multiple roles component)
- H.264 decoder based on ffmpeg (multiple roles component)
- Color converter based on ffmpeg
- video renderer based on devFB
- Major additions to the 0.2
- New port classes
The components are:
- multiple formats audio decoder component that supports mp3 and ogg audio formats
- alsa sink component
- all the other components are NOT compatible with the new architecture.
- They have been removed and will be ported to the new architecture in a further delivery
<<lessIt enables software developers and ISVs to familiarize themselves with the OpenMAX IL API and to develop their own OpenMAX multimedia and streaming media components for mobile devices, including codecs, video I/O, and audio mixers.
Included sample components comply with the OpenMAX base and interoperability profiles and can be tunnelled together.
Main features:
- a shared library with the IL core and a "reference" OpenMAX component
- a number of OpenMAX components which pass Khronos conformance tests
- a set of GStreamer plugins that use the IL API (not available yet)
Enhancements:
New video components:
- ffmpeg based MPEG4/H.264 decoder
- color converter component YUV -> RGB
- video renderer based on devFB
New audio component:
- audio file reader based on ffmpeg audio format
- volume component
Fixed known bugs:
- FFMPEG audio decoder now works on FC6 and other distributions with the latest ffmpeg release (0.4.9-0.35.20070204)
Known pending bugs:
- some ogg streams can not be decoded properly
- the tunneling between file reader, mp3 dec based on ffmpeg - alsa sink ends in a deadlock sometimes.
- This behavior has been detected some times using FC6 and UBUNTU, not with the FC4
Full list of components:
Audio:
- ogg decoder based on libvorbis (stand alone components, and multiple roles component)
- mp3 decoder based on mad decoder
- mp3 decoder based on ffmpeg (multiple roles component)
- volume component
- alsa audio sink
- ffmpeg audio file reader (to be used with mp3 ffmpeg decoder)
Video:
- MPEG4 decoder based on ffmpeg (multiple roles component)
- H.264 decoder based on ffmpeg (multiple roles component)
- Color converter based on ffmpeg
- video renderer based on devFB
- Major additions to the 0.2
- New port classes
The components are:
- multiple formats audio decoder component that supports mp3 and ogg audio formats
- alsa sink component
- all the other components are NOT compatible with the new architecture.
- They have been removed and will be ported to the new architecture in a further delivery
Download (0.49MB)
Added: 2007-06-06 License: GPL (GNU General Public License) Price:
895 downloads
Objective Modula-2 1.00 (Reference Implementation)
Objective Modula-2 programming language is a hybrid between Smalltalk and Modula-2. more>>
Objective Modula-2 programming language is a hybrid between Smalltalk and Modula-2 based on the object model and runtime of Objective-C.
The design is an example how native Cocoa/GNUstep support can be added to static imperative programming languages without implementing a bridge.
Objective Modula-2s scope encompasses the design of the Objective Modula-2 programming language and the implementation of a compiler to implement it. The initial compiler will generate Objective-C source code.
Enhancements:
- This code is used to verify ideas and concepts which come up in the course of defining the language.
- It is in an early stage, incomplete and subject to frequent changes.
<<lessThe design is an example how native Cocoa/GNUstep support can be added to static imperative programming languages without implementing a bridge.
Objective Modula-2s scope encompasses the design of the Objective Modula-2 programming language and the implementation of a compiler to implement it. The initial compiler will generate Objective-C source code.
Enhancements:
- This code is used to verify ideas and concepts which come up in the course of defining the language.
- It is in an early stage, incomplete and subject to frequent changes.
Download (0.019MB)
Added: 2007-07-21 License: (FDL) GNU Free Documentation License Price:
825 downloads
Forth Foundation Library 0.5.0
Forth Foundation Library is a Forth library. more>>
Forth Foundation Library, in short FFL is a Forth library. It gives you a collection of words written in (ANS) forth which are useful in areas such as data types, collections, interfaces, development support, and compound modules.
The modules in the library are grouped in five clusters:
- Data types - char
- Collections - single linked list
- Interfaces - crc-32
- Development - struct, unit test
- Compound - nothing yet.
Enhancements:
- This release adds four new features to the library, including an n-tree with an iterator, a SHA-256 module, and a regular expressions module.
- The library will now also run on MinForth.
<<lessThe modules in the library are grouped in five clusters:
- Data types - char
- Collections - single linked list
- Interfaces - crc-32
- Development - struct, unit test
- Compound - nothing yet.
Enhancements:
- This release adds four new features to the library, including an n-tree with an iterator, a SHA-256 module, and a regular expressions module.
- The library will now also run on MinForth.
Download (0.14MB)
Added: 2007-06-11 License: GPL (GNU General Public License) Price:
865 downloads
Simple Forth Interpreter 1.0
Simple Forth Interpreter is a Java implementation of a subset of the ANS Forth language. more>>
Welcome to the SFI website. The Simple Forth Interpreter (SFI in short) is a Java implementation of a little subset of the ANS Forth language.
The goal of SFI is to develop a small interpreter to be embedded in any application and provide scripting functionality with low resources.
SFI follows the ANS Forth standard where reasonably possible, provides a simple way by inheritance to customize and integrate the interpreter in any existing application and a simple interface to play with the Forth code.
Why Forth? The interpreter its pretty simple and small, its an easy to learn language and the extend with user defined words fits quite well the idea of a language for scripting purposes.
Enhancements:
- Bug fix into TOK_NWORD parsing strings and comments.
<<lessThe goal of SFI is to develop a small interpreter to be embedded in any application and provide scripting functionality with low resources.
SFI follows the ANS Forth standard where reasonably possible, provides a simple way by inheritance to customize and integrate the interpreter in any existing application and a simple interface to play with the Forth code.
Why Forth? The interpreter its pretty simple and small, its an easy to learn language and the extend with user defined words fits quite well the idea of a language for scripting purposes.
Enhancements:
- Bug fix into TOK_NWORD parsing strings and comments.
Download (0.024MB)
Added: 2005-04-15 License: MIT/X Consortium License Price:
1659 downloads
4tH compiler 3.5b
4tH is a Forth compiler with a little difference. more>>
4tH is a Forth compiler with a little difference. Instead of the standard Forth engine it features a conventional compiler.
4tH is a very small compiler that can create bytecode, C-embeddable bytecode, standalone executables, but also works fine as a scripting language. It supports over 85% of the ANS Forth CORE wordset and features conditional compilation, pipes, files, assertions, forward declarations, recursion, include files, etc.
It comes with an RPN calculator, line editor, compiler, decompiler, C-source generators, and a virtual machine.
Enhancements:
- More CORE words and most of the DOUBLE wordset are supported.
- Output buffers can be flushed.
- An experimental multitasking environment was added.
<<less4tH is a very small compiler that can create bytecode, C-embeddable bytecode, standalone executables, but also works fine as a scripting language. It supports over 85% of the ANS Forth CORE wordset and features conditional compilation, pipes, files, assertions, forward declarations, recursion, include files, etc.
It comes with an RPN calculator, line editor, compiler, decompiler, C-source generators, and a virtual machine.
Enhancements:
- More CORE words and most of the DOUBLE wordset are supported.
- Output buffers can be flushed.
- An experimental multitasking environment was added.
Download (0.18MB)
Added: 2007-05-20 License: LGPL (GNU Lesser General Public License) Price:
889 downloads
IsForth 1.21b
IsForth is a direct threaded Linux-only x86 Forth implementation coded in pure assembly using NASM macros. more>>
IsForth is a direct threaded Linux-only x86 Forth implementation coded in pure assembly using NASM macros to create forth high-level definitions.
All I/O is done with syscalls. IsForth is almost a complete replacement for both libc and libncurses.
To use the debugger say debug xyzzy and from within the debugger..
Space - single steps
Enter - enters into words that nest
Escape - exits debugger
Cursor - move cursor within current definition
h - run to cursor location
H - auto step to current location
While auto stepping + and - change the step speed
Enhancements:
- The finishing touches were put on the keyboard handling for special keys.
<<lessAll I/O is done with syscalls. IsForth is almost a complete replacement for both libc and libncurses.
To use the debugger say debug xyzzy and from within the debugger..
Space - single steps
Enter - enters into words that nest
Escape - exits debugger
Cursor - move cursor within current definition
h - run to cursor location
H - auto step to current location
While auto stepping + and - change the step speed
Enhancements:
- The finishing touches were put on the keyboard handling for special keys.
Download (MB)
Added: 2006-07-26 License: GPL (GNU General Public License) Price:
681 downloads
FreeNAS 0.685 Beta 2
FreeNAS is a free implementation of a minimal FreeBSD distribution. more>>
FreeNAS is a free implementation of a minimal FreeBSD distribution(for run it on a Compact Flash, CD-ROM or USB key) that provide NAS (Network-Attached Storage) services, supporting: CIFS, FTP, NFS protocols, with a Full WEB configuration interface.
The minimal FreeBSD distribution, Web interface,PHP scripts and documentations are based on M0n0wall.
<<lessThe minimal FreeBSD distribution, Web interface,PHP scripts and documentations are based on M0n0wall.
Download (38.1MB)
Added: 2007-08-06 License: BSD License Price:
499 downloads
Object::Meta::Plugin::Host 0.01
Object::Meta::Plugin::Host are hosts plugins that work like Object::Meta::Plugin. more>>
Object::Meta::Plugin::Host are hosts plugins that work like Object::Meta::Plugin. Can serve as a plugin if subclassed, or contains a plugin which can help it to plug.
SYNOPSIS
# if you want working examples, read basic.t in the distribution
# i dont know what kind of a synopsis would be useful for this.
my $host = new Object::Meta::Plugin::Host;
eval { $host->method() }; # should die
$host->plug($plugin); # $plugin defines method
$host->plug($another); # $another defines method and another
# $another supplied the following, since it was plugged in later
$host->method();
$host->another($argument);
$host->unplug($another);
$host->method(); # now $plugins method is used
Object::Meta::Plugin::Host is an implementation of a plugin host, as described in Object::Meta::Plugin.
The host is not just simply a merged hash. It is designed to allow various plugins to provide similar capabilities - methods with conflicting namespace. Conflicting namespaces can coexist, and take precedence over one another. A possible scenario is to have various plugins for an image processor, which all define the method "process". They are all installed, ordered as the effect should be taken out, and finally atop them all a plugin which wraps them into a pipeline is set.
When a plugins method is entered it receives, instead of the host object, a context object, particular to itself. It allows it access to its host, its sibling plugins, and so forth explicitly, while implicitly wrapping around the host, and emulating it with reordered priority - the current plugin is first in the list.
Such a model enables a dumb plugin to work quite happily with others, even those which may take its role. The only rule it needs to keep is that it accesses its data structures using $self-self>, and not $self, because $self is the context object.
A more complex plugin, aware that it may not be peerless, could explicitly ask for the default (host defined) methods it calls, instead of its own. It can request to call a method on the plugin which succeeds it or precedes it in a certain methods stack.
Additionally, by gaining access to the host object a plugin could implement a pipeline of calls quite easily, as described above. All it must do is call $self-host->stack($method)> and iterate that omitting itself.
The interface aims to be simple enough to be flexible, trying for the minimum it needs to define to be useful, and creating workarounds for the limitations this minimum imposes.
The implementation is by no means optimized. I doubt its fast, but I dont really care. Its supposed to create a nice framework for a large application, which needs to be modular.
<<lessSYNOPSIS
# if you want working examples, read basic.t in the distribution
# i dont know what kind of a synopsis would be useful for this.
my $host = new Object::Meta::Plugin::Host;
eval { $host->method() }; # should die
$host->plug($plugin); # $plugin defines method
$host->plug($another); # $another defines method and another
# $another supplied the following, since it was plugged in later
$host->method();
$host->another($argument);
$host->unplug($another);
$host->method(); # now $plugins method is used
Object::Meta::Plugin::Host is an implementation of a plugin host, as described in Object::Meta::Plugin.
The host is not just simply a merged hash. It is designed to allow various plugins to provide similar capabilities - methods with conflicting namespace. Conflicting namespaces can coexist, and take precedence over one another. A possible scenario is to have various plugins for an image processor, which all define the method "process". They are all installed, ordered as the effect should be taken out, and finally atop them all a plugin which wraps them into a pipeline is set.
When a plugins method is entered it receives, instead of the host object, a context object, particular to itself. It allows it access to its host, its sibling plugins, and so forth explicitly, while implicitly wrapping around the host, and emulating it with reordered priority - the current plugin is first in the list.
Such a model enables a dumb plugin to work quite happily with others, even those which may take its role. The only rule it needs to keep is that it accesses its data structures using $self-self>, and not $self, because $self is the context object.
A more complex plugin, aware that it may not be peerless, could explicitly ask for the default (host defined) methods it calls, instead of its own. It can request to call a method on the plugin which succeeds it or precedes it in a certain methods stack.
Additionally, by gaining access to the host object a plugin could implement a pipeline of calls quite easily, as described above. All it must do is call $self-host->stack($method)> and iterate that omitting itself.
The interface aims to be simple enough to be flexible, trying for the minimum it needs to define to be useful, and creating workarounds for the limitations this minimum imposes.
The implementation is by no means optimized. I doubt its fast, but I dont really care. Its supposed to create a nice framework for a large application, which needs to be modular.
Download (0.017MB)
Added: 2006-11-01 License: Perl Artistic License Price:
1088 downloads
jSVR 0.5 Beta
jSVR is a java implementation of a semi-automatic process for identifying and exporting three-dimensional information. more>>
jSVR is a java implementation of a semi-automatic process for identifying and exporting three-dimensional information from a single un-calibrated image. The project is based on previous publications of A. Criminisi, A. Zisserman and others. svrIn the section "svr theory" there is a brief presentation of the principals behind single view reconstruction, using perspective information of an image.
jSVR was originally developed as my degree project in the computer science department of the university of Crete, in 2004. Most of the initial work was done in the CVRL lab of ics-forth, under the supervision of professors A. Argyros and M. Lourakis. Many documents in this site come from my report on svr, and where initially converted from latex using latex2html and then modified. If you find any broken links or other problems please let me know.
I recently decided to try and continue that work, as an open source project.
Single View reconstruction is a technique that can have various applications in different areas of interest. From acquiring metric information from low quality images, to reconstructing scenes from paintings. The process of reconstructing an image is semi-automated and can be really tricky for the user, who is requested to define and/or fine tune a set of difficult to understand parameters, (see the "svr theory" section for some examples).
Depending on the goal, the demands to the reconstruction technique differ. In the original work the goal was to test the proposed methodology in the relevant literature and to implement the techniques into an application that could reconstruct an image. The new goal of svr is to provide a user-friendly and intuitive way for reconstructing images, as well as to improve the existing implementation to produce better results. Determining the correct vanishing points with an automatic algorithm would be a great improvement to the whole process.
One step towards this direction would be an MLE estimation for the best intersection point. Also it is probable that suitable heuristics could be used to exclude intersections (false vanishing points) in areas that vanishing points are not expected (i.e. the center of the image). In order to exclude as many false VP detections as possible, appropriate filters could be applied on the image before the reconstruction (i.e. noise reduction, removing the radial distortion, and sharpen edges).
The phase of manual reconstruction could also be made semi-automatic by implementing object identification algorithms. This would help by automatically identifying the bigger structures in the image (i.e the vertical planes). In addition smaller structures can be interactively traced. This would also allow better texture extraction from the objects in the image.
<<lessjSVR was originally developed as my degree project in the computer science department of the university of Crete, in 2004. Most of the initial work was done in the CVRL lab of ics-forth, under the supervision of professors A. Argyros and M. Lourakis. Many documents in this site come from my report on svr, and where initially converted from latex using latex2html and then modified. If you find any broken links or other problems please let me know.
I recently decided to try and continue that work, as an open source project.
Single View reconstruction is a technique that can have various applications in different areas of interest. From acquiring metric information from low quality images, to reconstructing scenes from paintings. The process of reconstructing an image is semi-automated and can be really tricky for the user, who is requested to define and/or fine tune a set of difficult to understand parameters, (see the "svr theory" section for some examples).
Depending on the goal, the demands to the reconstruction technique differ. In the original work the goal was to test the proposed methodology in the relevant literature and to implement the techniques into an application that could reconstruct an image. The new goal of svr is to provide a user-friendly and intuitive way for reconstructing images, as well as to improve the existing implementation to produce better results. Determining the correct vanishing points with an automatic algorithm would be a great improvement to the whole process.
One step towards this direction would be an MLE estimation for the best intersection point. Also it is probable that suitable heuristics could be used to exclude intersections (false vanishing points) in areas that vanishing points are not expected (i.e. the center of the image). In order to exclude as many false VP detections as possible, appropriate filters could be applied on the image before the reconstruction (i.e. noise reduction, removing the radial distortion, and sharpen edges).
The phase of manual reconstruction could also be made semi-automatic by implementing object identification algorithms. This would help by automatically identifying the bigger structures in the image (i.e the vertical planes). In addition smaller structures can be interactively traced. This would also allow better texture extraction from the objects in the image.
Download (1.3MB)
Added: 2007-03-14 License: GPL (GNU General Public License) Price:
954 downloads
shwild.fnmatch 0.8.2
shwild.fnmatch is a platform-independent implementation of the UNIX function fnmatch(), implemented using the shwild, STLSoft. more>>
shwild.fnmatch project is a platform-independent implementation of the UNIX function fnmatch(), implemented using the shwild, STLSoft, and cstring libraries.
It is dependent on the shwild, STLSoft, and cstring libraries.
<<lessIt is dependent on the shwild, STLSoft, and cstring libraries.
Download (0.32MB)
Added: 2007-03-01 License: BSD License Price:
968 downloads
XML::Atom 0.19
XML::Atom is an Atom feed and API implementation. more>>
XML::Atom is an Atom feed and API implementation.
SYNOPSIS
use XML::Atom;
Atom is a syndication, API, and archiving format for weblogs and other data. XML::Atom implements the feed format as well as a client for the API.
<<lessSYNOPSIS
use XML::Atom;
Atom is a syndication, API, and archiving format for weblogs and other data. XML::Atom implements the feed format as well as a client for the API.
Download (0.058MB)
Added: 2006-06-30 License: Perl Artistic License Price:
1211 downloads
Freedaisy 0.0.1 Alpha1
Freedaisy is a free implementation of Daisy book standard for allowing MP3 files to be indexed using (X)HTML and SMIL. more>>
Freedaisy is a free implementation of Daisy book standard for allowing MP3 files to be indexed using (X)HTML and SMIL.
Daisy is frequently used by visually impaired users, so they can listen to audio books with chapters.
<<lessDaisy is frequently used by visually impaired users, so they can listen to audio books with chapters.
Download (0.38MB)
Added: 2006-06-29 License: GPL (GNU General Public License) Price:
1213 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above forth implementation search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed