Other listings by this author |
|
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...
|
|
Rgrow 1.3 (Downloads: 211)
RGrow resizes fixed length records padding or chopping. RGrow resizes fixed length records e.g.
RGrow.exe MyFile.seq 500 600
will grow each record from 500 to 600 bytes by padding binary zeros.
Will also truncate records.
These are not the old and new sizes of the file, but of the fixed length records
in the file. If you increase the record size, each record will be padded
with nulls. The entire file will grow as a result.
This program may be freely copied and us...
|
|
SortedArrayList 1.3 (Downloads: 233)
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 ...
|
|
RadixSort 1.6 (Downloads: 217)
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.
|
|
VerCheck 4.4 (Downloads: 340)
VerCheck checks websites for new versions of the software you use. WHAT IT IS FOR
**************
I used to check over a dozen websites each day to see if new versions of the software I use had been released. This was time consuming and error prone. VerCheck automates this
process by checking the websites of the programs you use to see if the version numbers have changed. It comes preconfigured from the factory with 64 applications.
HOW IT WORKS
************
For each applica...
|
|
FileTimes 1.9 (Downloads: 263)
Read and set Windows file/dir times from Java: Create/LastModified/LastAccessed Java class library to get/set file and directory times: Create/LastModified/LastAccessed. For Windows only.
Create time is when the file was first written. Modified
time (sometimes called lastModified) is when the file was
last written. Accessed time is when the file was last read
or written. Checking its date, looking at its attributes or
checking to see if it exists does not count as reading it.
Get/Set Windows Fil...
|
|
QuickSort 1.6 (Downloads: 282)
QuickSort is an implementation of Tony Hoare's classic recursive Quicksort. QuickSort is an implementation of Tony Hoare's classic
QuickSort. QuickSort works by choosing a pivot point and
ensuring all elements below the pivot point are small all
above are big, (i.e. smaller than the pivot) Then it
recursively splites the upper and lower halves, repeating
the process. QuickSort is an internal sort written in Java.
Both RadixSort and HeapSort are quicker than QuickSort.
QuickSort can also take patholo...
|
|
Primes 1.4 (Downloads: 480)
calculates the prime numbers 1..N, tells you if N is prime etc. calculates the prime numbers 1..N, tells you if N is prime etc.
Prints tables of primes.
Computes the prime just below or above N.
It is useful in computing optimal Hashtable sizes.
Java source included....
|
|
Borders 1.5 (Downloads: 235)
Displays a variety of decorative borders. Shows off what you can do with Swing. Displays a variety of decorative borders.
Shows off what you can do with Swing.
To run as an application, type:
java -jar C:\com\mindprod\borders\borders.jar
adjusting as necessary to account for where the jar file is.
The picture frame icon represents the various decorative
borders you can put around your Swing panels....
|
|
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...
|
|
Pws 2.0 (Downloads: 232)
PWS (the pathway amanuensis) helps you with personal problems. PWS (the pathway amanuensis) helps you with personal
problems. You describe your problem and it prescribes some
sage advise based on Ken Keyes' twelve pathways from the
book Handbook To Higher Consciousness.
To install, Extract the zip download with WinZip, available from
winzip.com (or similar unzip utility) into any
directory you please, often C:\ -- ticking off the (user
folder names) option. To run as an applicat...
|
|
Wassup 2.5 (Downloads: 468)
Wassup let's you know what's up with your Java environment. Wassup let's you know what's up with your Java environment.
It will tell you the System Properties, as many as the
Security system will let you peek at. This includes such
things as which JVM is running, which version of Java, which
vendor. It may be run as either an Applet or an application.
When you run Wassup as an application it shows you
considerably more information. The Java sandbox considers it
a security risk to rev...
|
|
FontSaver 1.4 (Downloads: 248)
FontSaver shares Font objects instead of creating new ones. FontSaver shares Font objects instead of creating new ones to cut
down on the RAM and time needed to create Font and Font peer objects.
Profiling often shows the creation of too many Font objects is the
cause of poor performance.
See the source code for how to incoporate it into your own programs.
It does nothing on its own....
|
|
CSV 6.5 (Downloads: 1014)
Java to read, write, align, sort, reshape, pack... comma, tab-separated files. Java classes you can use standalone or embed in your own programs to
Read, write, align, sort and pack comma, tab and semicolon-
separated variable files, commonly known as CSV files.
It consists of a 23 Java classes/utilities CSVReader, CSVWriter, CSVAlign, CSVChangeCase, CSVCondense, CSVDeDup, CSVDeDupField, CSVDeEntify, CSVDump, CSVEntify, CSVPack, CSVPatch, CSVReshape, CSVSort, CSVSortField, CSVTabToComma, CSVTemplate, CSVToHTML, CSVToS...
|
|
Replicator 11.3 (Downloads: 803)
The Replicator lets you distribute large numbers of files to many people. The Replicator lets you distribute large numbers of files to
many people efficiently. The software automatically
downloads just the changed files and deletes ones no longer
part of the distribution.
Unlike other similar tools, all it requires is an ordinary
HTTP website. It requires no code to run on the server.
It can also work with CDs, and LANs.
Custom configured for each customer. Not free. Registrat...
|
|
Unicode 1.8 (Downloads: 381)
Used to test your computer's Unicode support Used to test your computer's Unicode support and your font's
support for particular characters, or as a learning to to
explore the Unicode character set. Displays in Courier,
TimesRoman, Symbol, Dialog and Helvetica.
copyright (c) 1996-2008 Nic Fulton nic.fulton@reuters.com of
Reuters Ltd. Modified by Roedy Green
of Canadian Mind Products with permission.
To install, Extract the zip download with WinZip, availa...
|
|
HeapSort 1.7 (Downloads: 243)
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:
|