Other listings by this author |
|
HeapSort 1.7 (Downloads: 271)
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:
|
|
CMOSSave 4.6 (Downloads: 349)
Check CMOS for corruption and automatically restore it. CMOSSave CMOSRest CMOSChk restore corrupted CMOS from
backup and check that CMOS has not been tampered with.
Naive users sometimes meddle with CMOS settings. We need a
fast way to put the scores of subtle CMOS configuration
settings back the way they were.
Power surges can corrupt CMOS. We need a way for a naive
user to quickly restore all the CMOS settings.
If the battery fails, the contents will be los...
|
|
RadixSort 1.6 (Downloads: 240)
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.
|
|
AmericanTax 3.8 (Downloads: 469)
Calculates American sales taxes state and district Calculates American sales taxes, state and district.
Java Applet that can also be run as an application.
Requires Java version 1.5 or later.
Java source code and sample HTML included.
This version computes by adding sales tax to a base price.
It also works in reverse given the total paid working
backwards to get the tax and original price. In other words
it will tell you the sticker price to make somet...
|
|
LEDataStream 1.8 (Downloads: 254)
Little-endian replacements for DataInputStream, DataOutputStream and RandomAcces Little-endian replacements for DataInputStream, DataOutputStream and RandomAccessFile. They work just like DataInputStream, DataOutputStream and RandomAccessFile except they work with little-endian binary data. Normally Java binary I/O is done with big-endian data, with the most significant byte of an integer or float first. Intel and Windows 95 tend to work with little endian data in native files. LEDataInputStream, LEDataOutputstream and LERandomAccessFile will le...
|
|
QuickSort 1.6 (Downloads: 311)
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...
|
|
File Splitter 1.3 (Downloads: 338)
Split large text/html files into smaller files using embedded split commands. Split large text/html files into smaller files. I find it
much faster and more accurate than cut and paste.
You embed commands in the big file telling it which pieces
of it are to go where, then let Splitter do the work. It is
much faster and more accurate than trying to select huge
blocks of text in an editor. You don't accidentally lose or
duplicate text. Keeping files small makes the site more
responsive.
|
|
HunkIO 1.7 (Downloads: 275)
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....
|
|
Pws 2.0 (Downloads: 240)
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...
|
|
Password 1.7 (Downloads: 566)
Generates random passwords that are hard to guess. Generates random passwords that are hard to guess. It uses a crytographic quality random number generator. The passwords are generated locally in a Java Applet. They are never transmitted over the Internet, even in encrypted form.
You can also run it as a standalone program, invoking it with
java com.mindprod.password.Password
or
password.jar
You can also run it online at the mindprod.com website without installing it....
|
|
Untouch 2.4 (Downloads: 452)
Reverts files dates back if the files have not really changed. Documentation on the original student project outline
mindprod.com/projects/untouchproj.html
This explains how it works and some of its uses.
Untouch supports the following command line switches which appear
before the directories.
-c or -clear = clear history first and take current file times as the new revert-to point.
-f or -force = revert files back to previous dates whether they have changed or not.
-h or -help =...
|
|
SortedArrayList 1.3 (Downloads: 247)
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 ...
|
|
FileFilters 2.7 (Downloads: 434)
Colllecton of Java FilenameFilters. FilenameFilters you can use in your own Java programs with
File.list( FilenameFilter f ). They can also be used
standalone as fancy dir commands.
They come with Java source and include:
AllDirectoriesFilter gets all directories
AllFilesFilter gets all files
ClamFilter simple wildcard
DirListFilter gets a list of directories
EndsWithFilter gets files whose names end with a...
|
|
Pluck 1.0 (Downloads: 214)
Scans multiple files looking for a REGEX pattern, and summarised what it finds. Scans multiple files looking for a REGEX pattern, and
summarised what it finds as a CSV file.
java -jar C:\com\mindprod\pluck\pluck.jar "\.[a-z]+\." E:\temp\temp.csv E:\somedir
adjusting as necessary to account for where the jar file is.
The first parameter is the regex pattern. See regex in the java glossary
for how to compose them.
The next parameter is where the output in to go. use the
wo...
|
|
Primes 1.4 (Downloads: 486)
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....
|
|
FontShowerAWT 2.9 (Downloads: 339)
Displays all the fonts available to AWT in Java. Displays all the fonts available to AWT in Java on your
machine. Displays the fonts in a variety of styles, sizes
and colours, rendered either with a Canvas or with a TextArea.
FontShowerAwt displays the fonts available on *your* machine
to *Java*. Other people will have different fonts installed
and will see different selections available to Java on
their machines. Your browser will see a slightly different
set of fo...
|
|
Boyer 1.5 (Downloads: 264)
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...
|