Other listings by this author |
|
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...
|
|
Untouch 2.4 (Downloads: 437)
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 =...
|
|
CanadianTax 4.2 (Downloads: 618)
Calculates Canadian sales taxes: GST HST and PST today or in the past. Calculates Canadian sales taxes: GST HST and PST today or as they were in the past.
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 GST HST and PST to a base
price. It als works in reverse given the
final price working backwards to get the taxes and base
price. In other words it will tell ...
|
|
Borders 1.5 (Downloads: 234)
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....
|
|
Volser 1.2 (Downloads: 374)
Gets the 4-byte 32-bit binary volume serial number in Windows. Gets the 4-byte 32-bit binary volume serial number of a Windows
disk drive assigned when it is formatted to provide and almost unique id.
Don't confuse this with the volser(, the string name,
or the manufacturer's disk serial number assigned to a hard drive at the factory.
Uses JNI and C++ native code.
Consists of java and JNI you include in your own code.
You can test with
C:
CD \com.mindprod...
|
|
Insult 1.9 (Downloads: 333)
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,...
|
|
Honk 1.5 (Downloads: 245)
Plays one or more of the Standard Windows sounds or wav files. Plays one or more of the Standard Windows sounds, triggered
purely from the command line.
use:
honk
- Plays the default system sound.
honk SystemStart SystemHand SystemQuestion
- Plays the given list of standard system sounds (usually just one).
- they are case-insensitive (you can get the case wrong and it will still work).
Possible sound names are listed in the registry...
|
|
Quoter 5.1 (Downloads: 439)
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...
|
|
HeapSort 1.7 (Downloads: 241)
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: 318)
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...
|
|
Accumulate 1.3 (Downloads: 194)
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....
|
|
ISBN 2.5 (Downloads: 340)
Tidies, interconverts and Validates ISBN-10 and ISBN-13 book numbers. Helps you proofread, interconvert, validate and tidy ISBN-10 and ISBN-13 (International Standard Book Number) references in your HTML or other documentation. It validates the checkdigit, inserts dashes, interconverts ISBN-10 and ISBN-13. It displays them both with and without dashes....
|
|
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...
|
|
SiteMap 1.9 (Downloads: 317)
Prepare Spidering Sitemap for Google and other search engines. You use a sitemap to encourage Google or other search
engines to more frequently and efficiently index your
website.
For overview information about Google sitemaps see:
mindprod.com/jgloss/google.html#SITEMAPS
For overview information about this utility see:
mindprod.com/jgloss/google.html#SITEMAPUTILITY.
You use this sitemap utility because it is so quick you can
use it before every upload so that...
|
|
Amper 1.9 (Downloads: 419)
Safely converts ampersands to !amp; entities In the following, pretend ! is an ampersand. PAD files don't let me give literal examples. Amper converts ! to !amp; in HTML files and back, but does not convert it when the ! is already in an entity e.g. !lt; !thetasym; !eacute;
The main use for this is to pass HTMLValidator verification of your HTML, which is very picky about !, especially inside URLs.
As a side effect, it also ensures all your comment delimiters balance.
It ...
|
|
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...
|
|
RadixSort 1.6 (Downloads: 216)
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.
|