Other listings by this author |
|
Accumulate 1.3 (Downloads: 198)
Used to accumulate values by category. Used to accumulate values by category. It might be useful
for example in a billing program to accumulate hours by
various categories.
It could be used to count how many times various words
occurred in a document.
All you need is:
buckets.accumulate( "somecategory", someamount );
And Accumulate looks after creating the buckets to
accumulate new categories for you.
e....
|
|
HeapSort 1.7 (Downloads: 276)
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:
|
|
File Splitter 1.3 (Downloads: 339)
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.
|
|
FontSaver 1.4 (Downloads: 283)
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....
|
|
RadixSort 1.6 (Downloads: 243)
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.
|
|
Insult 1.9 (Downloads: 343)
Generates insults typical of those posted by Republicans in newsgroups. Generates insults typical of those posted by Republicans in
the alt.politics.bush newsgroup.
Java Applet that can also be run as an application.
You can run it without installing it at
mindprod.com/applet/insult.html
To install, Extract the zip download with WinZip, (or similar unzip utility) into
any directory you please, often C:\ -- ticking off the (user
folder names) option. To run as an application,...
|
|
LEDataStream 1.8 (Downloads: 256)
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...
|
|
Boyer 1.5 (Downloads: 265)
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...
|
|
BlOut 2.6 (Downloads: 386)
Blout removes extra or all blank lines from a file. Blout removes extra blank lines from a file, collapsing multiple blank
lines down to one, (or removing them altogether with the -compact option).
It also ensures the file has a final CrLf. It also trims any blank lines
off the beginning and end of the file. It also converts all line endings
to Windows standard CrLf form. It trims trailing tabs and spaces from
each line.
Blout is not that bright. It does not understand w...
|
|
Splice 1.5 (Downloads: 467)
SPLICE splices bits of files together SPLICE splices bits of files together e.g.
SPLICE Cut MyFile.Txt Start 99 Length 99 Insert MyFile2.txt At 99
SPLICE Copy MyFile.Txt Start 99 Length 99 Overlay MyFile2.txt At 99
Uses for SPLICE:
1. excising a section of a file.
2. replacing a section of a file.
3. inserting a section into a file.
4. extracting a section of a file.
5. appending a section onto a file.
This program may be freel...
|
|
Mouse 1.4 (Downloads: 279)
In Java, allows you to find out where the mouse in on the screen In Java, allows you to find out where the mouse in on the
screen, even when it is not over one of your apps. This has
similar function to MouseInfo.getPointerInfo in Java 1.5+.
This class will work in any version of Java.
It uses JNI and a DLL, so it only works on Windows.
You must install the nativemouse.dll somewhere on the path.
Then your programs can find out the x and y position of the
mouse, [(0,0...
|
|
Tabin 5.3 (Downloads: 263)
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...
|
|
FileTimes 1.9 (Downloads: 287)
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...
|
|
Unicode 1.8 (Downloads: 397)
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...
|
|
Holiday Calculatior 4.7 (Downloads: 780)
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...
|
|
Password 1.7 (Downloads: 578)
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....
|
|
Primes 1.4 (Downloads: 488)
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....
|