Other listings by this author |
|
Spinner 1.1 (Downloads: 372)
DateSpinner, hex and formatted dollar input for Java JSpinner. Spinner consists of source for classes for a DateSpinner and to add hex and
formatted dollar input/output for Java JSpinner to your own
Java programs.
Spinner offers two NumberFormatter classes you can use with
a JSpinner. One is HexNumberFormatter which lets your
JSpinner range over hex values. The other is
DollarNumberFormatter which lets your JSpinner range over
dollar values. It works better than JSpinner.NumberEd...
|
|
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....
|
|
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...
|
|
Tabin 5.3 (Downloads: 255)
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...
|
|
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.
|
|
VerCheck 4.4 (Downloads: 343)
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...
|
|
KeyPlayer 1.5 (Downloads: 387)
Java Keystroke and Mouse Event Tutor / Keyboard Diagnostic. Java Keystroke and Mouse Event Tutor / Keyboard Diagnostic
Application to let you experiment to learn how mouse and
keystroke events work. Output appears on the console.
Just click the mouse or hit keystrokes and watch what details
of the events generated.
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 (...
|
|
Tabout 2.7 (Downloads: 232)
converts tabs to spaces in an ASCII text file. converts tabs to spaces in an ASCII text file
usage : TABOUT Myfile.TXT
Don't use it on word processor files. Assumes tab stops
are 8 columns apart. Also trims ^Z and corrects any
malformed CrLf line endings. C source included.
Copyrighted, but may be distributed freely and used for
any purpose except military....
|
|
File Splitter 1.3 (Downloads: 327)
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.
|
|
Sound 1.4 (Downloads: 250)
Create/synthesize sounds mathematically in Java. Sound lets you mathematically create sounds in Java.
You define your sounds in terms of 16-bit linear code for
the waveform, -- an array of samplings. The U_Law.class will
then convert that to (or from) *.AU mu-law 8-bit encoding
format which you can then play with
AudioPlayer.player.start(bis) in an application or with
Applet.getAudioClip in an Applet.
This is just a sample program. You would insert your own m...
|
|
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...
|
|
ShellSort 1.4 (Downloads: 232)
ShellSort is a simple sort suitable for 2000 or less elements. ShellSort is a simple sort suitable for 2000 or less
elements. It sorts using a comparision routine you provide
to compare two elements to be sorted.
You can test it with:
java.exe com.mindprod.shellsort.TestShellSort...
|
|
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:
|
|
Volser 1.2 (Downloads: 377)
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...
|
|
Base64 1.9 (Downloads: 303)
Java classes to encode/decode Base64 and Base64u Base64 is a freeware way of encoding 8-bit characters using
only ASCII printable characters similar to UUENCODE.
UUENCODE embeds a filename where BASE64 does not. You will
see BASE64 used in encoding digital certificates, in
encoding user:password string in an Authorization: header
for HTTP. The spec is described in RFC 2045.
Don't confuse Base64 with x-www-form-urlencoded which
is handled by java.net.URLEncoder.encod...
|
|
Untouch 2.4 (Downloads: 444)
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 =...
|
|
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...
|