Other listings by this author |
|
 FourTidy 3.1 (Downloads: 324)
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...
|
|
 Http 2.9 (Downloads: 782)
HTTP GET/POST/HEAD/PROBE/CHASE java class library for http: or https: http is a small library of Java classes to let you do GET/POST/HEAD/PROBE/CHASE to a server r with http: or https. It will also encode parameter pairs for you.
It does nothing on its own. It is intended to be incorporated into your own programs.
To see a sample use have a look at the com.mindprod.submitter package, downloadable...
|
|
 Encoding Recogniser 1.2 (Downloads: 211)
Help determine a file's encoding by displaying it wth all supported encodings. Encoding Recogniser will help you determine what encoding was
used to write a file by displaying the file in hex or and
decoded characters in any of the encodings supported by
Java.
This program runs under any OS,
(e.g. Win2K/XP/Vista/OSX/Linux/Solaris/Vista64/AIX...) so long as you have
Java version 1.5 or later installed.
To install, Extract the zip download with WinZip (or similar unzip utility) into
...
|
|
 Accumulate 1.3 (Downloads: 195)
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....
|
|
 SortedArrayList 1.3 (Downloads: 237)
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 ...
|
|
 Screws 1.3 (Downloads: 243)
CMP Screws and Screwdrivers draws eight types of screw heads. CMP Screws and Screwdrivers draws eight types of screw
heads. It is a teaching example for how to use Java Canvas,
fillRect, fillOval, fillPoly and AffineTransform to draw.
Java source is included for you to cannibalise.
It draws 8 types of screw heads.
To run as an application, type:
java -jar C:\com\mindprod\screws\screws.jar
adjusting as necessary to account for where the jar file is....
|
|
 QuickSort 1.6 (Downloads: 298)
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...
|
|
 CanadianTax 4.2 (Downloads: 625)
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 ...
|
|
 RadixSort 1.6 (Downloads: 225)
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.
|
|
 SiteMap 1.9 (Downloads: 321)
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...
|
|
 Boyer 1.5 (Downloads: 259)
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...
|
|
 Unicode 1.8 (Downloads: 384)
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...
|
|
 Pws 2.0 (Downloads: 234)
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...
|
|
 ISBN 2.5 (Downloads: 345)
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....
|
|
 Mouse 1.4 (Downloads: 270)
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...
|
|
 Common13 1.3 (Downloads: 282)
common utility classes that work under Swing Java 1.3+ common utility classes that work under Swing Java 1.3+
Includes:
CMPAboutJBox: a proper about box for Swing apps/JApplets that provides useful information.
HybridJ : converts Swing Applet into an Application...
|
|
 HeapSort 1.7 (Downloads: 255)
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:
|
