Other listings by this author |
|
Submitter 16.4 (Downloads: 1076)
Submitter will submit your PAD *.xml program descriptor file to 199 PADsites. Submitter will submit your PAD *.xml program descriptor file to 199 PADsites.
Unlike other submission programs, it submits only to PADSites
that welcome automated submissions. Compose your PAD *.xml file using a
program like PADGen, then upload it you your website. Then enter the URL
of your website directory where you upload pads and the name of the pad
itself e.g. hypotheticalprogram.xml, then hit SUBMIT. It also has a ...
|
|
Sound 1.4 (Downloads: 249)
Create/synthesize sounds mathematically in Java. Sound lets you mathematically create sounds in Java.
You define your sounds in terms of 16-bit linear code for
the waveform, -- an array of samplings. The U_Law.class will
then convert that to (or from) *.AU mu-law 8-bit encoding
format which you can then play with
AudioPlayer.player.start(bis) in an application or with
Applet.getAudioClip in an Applet.
This is just a sample program. You would insert your own m...
|
|
Align 1.6 (Downloads: 252)
Aligns data in ASCII text files into neat columns. ALIGN aligns data in ASCII text files into neat columns.
Also converts comma-delimited files to columns with 2 spaces
between each column. Input fields must be separated by
commas or white space. Fields may contain spaces if they
are enclosed in single or double quotes or C comments /* ...
*/ or //. The best way to understand this program is to try
it on a COPY of any ASCII Text file, especially one that
contains badly al...
|
|
JarCheck 1.4 (Downloads: 518)
Check that class target versions are as expected in a Java jar. Check a Java jar to make sure all the javac -target versions of
the class files are what you expect.
Java application.
Requires Java version 1.5 or later.
All Java source code is included.
to use:
java -jar jarcheck.jar jartotocheck.jar 1.1 1.7
where jartocheck.jar is the name of jar to check.
It will check all the class files in it.
In this example:
1.1 is the lo...
|
|
HeapSort 1.7 (Downloads: 250)
HeapSort is an implementation of Williams and Floyd classic HeapSort. HeapSort is an implementation of Williams and Floyd's TopDown HeapSort.
HeapSort is a fast internal sort written in Java that uses a
sorting algorithm analogous to power struggles for higher
positions in a hierarchical bureaucracy. Source provided. It
is faster than QuickSort, but slower that RadixSort. It
sorts using a comparison routine you provide to compare two
elements to be sorted.
You can test it with:
|
|
FourTidy 3.1 (Downloads: 322)
Tidies Take Command/TCC/4NT/4DOS DESCRIBE file descriptors To tidy, sort, prune and dedup a JP Software
Take Command/TCC/4NT/4DOS hidden descript.ion file. These files are used by
the DESCRIBE utility to track what your various files
are for.
First make the directory containing the usually-hidden descript.ion file
current. e.g.
C:
cd \env
Then invoke the java program with:
java.exe -jar C:\com\mindprod\fourtidy\fourtidy.jar
If you...
|
|
Holiday Calculatior 4.7 (Downloads: 745)
Calculate when 66 holidays occur in any given year. Calculates when various holidays occur in any given year BC or AD.
Designed to be cannibalised to include the calculation routines in your
own programs. You might use it to prepare paper calenders well in
advance or electronic calendars. You might also use the logic in computer
programs that compute payrolls, bus schedules, or club meetings. You
might use it in writing novels or researching historical events. It can
als...
|
|
SortedArrayList 1.3 (Downloads: 234)
Sort and Merge ArrayLists efficiently. This is a pair of library classes to include in your own
code for manipulating ArrayLists.
It consist of two classes: SortedArrayList and Merge.
SortedArrayList is an ArrayList that remembers how it is
sorted, so that if you ask it to sort, it can sometimes
bypass the work when it is already in order. You declare the
order you want and it keeps the list sorted, You just call
sort whenever you need the list to ...
|
|
Tabin 5.3 (Downloads: 252)
Converts spaces to tabs in an ASCII text file. Converts spaces to tabs in an ASCII text file
Usage:
TABIN.exe Myfile.txt
Assumes tab stops are 8 columns apart. Don't use it on word
processor files. C source included. Copyrighted by Canadian
Mind Products. May be freely distributed and used for any
purpose except military. It has been rewritten in C from
Pascal for extra speed. Users of previous versions should
take care to delete the old TABIN.COM...
|
|
Dedup 1.5 (Downloads: 230)
Java command line utility to removes duplicate lines from text files. DeDup is a Java command-line utilty for removing duplicate
lines in text files.
The dedup process compares adjacent lines only. It does not
sort first. The comparison is case sensitive. It removes
adjacent indentical lines. It replaces the original file, so
do a backup first. You can dedup 1 to N files in one
execution, just put their names on the command line.
DeDup deletes blank lines from both the beginning...
|
|
SetClock 8.5 (Downloads: 900)
Set your PC Clock from an accurate atomic clock on the web. Set PC Clock from an accurate atomic clock on the web. You
can put in on your website so that others can use it to
correct their clocks without having to install software or
without you having to install software on your server.
Java Web Start signed.
Requires Java version 1.5 or later. Native code for Windows only.
Full Java source code included, and native C JNI code....
|
|
Boyer 1.5 (Downloads: 257)
Fast string search (indexOf) using the Boyer-Moore algorithm. Fast string search (indexOf) using the Boyer-Moore
algorithm. Incorporate this class into your own Java
programs to rapidly search strings.
use:
import com.mindprod.Boyer.Boyer;
...
Boyer b = new Boyer("dogcatwombat");
int where = b.indexOf("cat");
or
int where = Boyer.indexOf("dogcatwombat","cat");
Boyer-Moore is about twice as fast as String.indexOf wh...
|
|
Tabout 2.7 (Downloads: 231)
converts tabs to spaces in an ASCII text file. converts tabs to spaces in an ASCII text file
usage : TABOUT Myfile.TXT
Don't use it on word processor files. Assumes tab stops
are 8 columns apart. Also trims ^Z and corrects any
malformed CrLf line endings. C source included.
Copyrighted, but may be distributed freely and used for
any purpose except military....
|
|
Quoter 5.1 (Downloads: 441)
Converts text with many possible cleanups and transformations. Converts text with many possible cleanups, including
preparation of HTML and Java, aligning in columns, character
set conversion, case converting, removing excess white
space, removing blank lines, preparing regex expressions....
converts raw text with the following possible cleanups:
0. Flow text by removing newline characters. Useful to prepare text to paste into web comment boxes.
1. Convert awkward chara...
|
|
HunkIO 1.7 (Downloads: 263)
Java classes to readEntireFile, create a temp file etc. Java classes to include in your own programs. They let you read or write a file in one fell swoop into RAM. It also includes createTempFile method that is more convenient to use than Sun's File.createTempFile. It also includes PrintWriterPlus that converts linefeeds to platform specific line feeds even when they are embedded in data.
Why the three linked ball logo? It symbolises processing a file in line-sized chunks....
|
|
Base64 1.9 (Downloads: 302)
Java classes to encode/decode Base64 and Base64u Base64 is a freeware way of encoding 8-bit characters using
only ASCII printable characters similar to UUENCODE.
UUENCODE embeds a filename where BASE64 does not. You will
see BASE64 used in encoding digital certificates, in
encoding user:password string in an Authorization: header
for HTTP. The spec is described in RFC 2045.
Don't confuse Base64 with x-www-form-urlencoded which
is handled by java.net.URLEncoder.encod...
|
|
RadixSort 1.6 (Downloads: 222)
RadixSort is a fast internal sort written in Java that mimics a card sorter. RadixSort is a fast internal sort written in Java that
mimics a card sorter. Source provided. It is faster than
both HeapSort and QuickSort. It sorts using a comparision
routine you provide to compare two elements to be sorted
plus a method to extract individual bytes from the keys to
be sorted. The time to sort each item unlike most sorts,
does not increase with larger sorts. It depends rather on
the key length.
|