Other listings by this author |
|
Spinner 1.1 (Downloads: 373)
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...
|
|
NetworkCam 1.6 (Downloads: 271)
Java Applet to view a Webcam stream of JPG images a Java Applet that lets you a view
video stream from web cameras that servers
present as a series of still jpg images....
|
|
Insult 1.9 (Downloads: 335)
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,...
|
|
Masker 1.9 (Downloads: 296)
Hides email addresses from spammers as PNG image files. Produces PNG files (image files similar to GIFs, but
smaller) that contain your email address. When you post them
on your website, it is harder for spammer to harvest them.
You can include the generated image files in the HTML on
your website with: code like this:
[a href="../image/mailto/roedy.png"]email me[/a]
(pretend [] are angle brackets)
or
[mg src="image/mailto/r...
|
|
LEDataStream 1.8 (Downloads: 250)
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...
|
|
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...
|
|
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 ...
|
|
Encodings 1.6 (Downloads: 250)
Applet to list all supported encodings (character sets) supported by Java. Applet to list all supported encodings (character sets)
supported by your browser/java.
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, type:
java -jar C:\com\mindprod\encodings\encodings.jar
adjusting as necessary to account for where the jar file is....
|
|
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:
|
|
Entities 3.1 (Downloads: 640)
Utilities to convert/strip/insert HTML/XML/XHTML entities Consists of a pair of utilities that let you
convert/strip/insert HTML/XML/XHTML entities such as _amp;- and _quot;
from files converting them back and forth to their
equivalent single characters !amp; and !quot;. It handles the HTML 4
entities such as _hearts; as well as decimal _#123; and
hexadecimal _x#123; entities.
You may us this package as standalone
utilities, or use the classes in your own programs
to...
|
|
Untouch 2.4 (Downloads: 445)
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 =...
|
|
VerCheck 4.4 (Downloads: 344)
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...
|
|
LinkedList 1.6 (Downloads: 197)
LinkedList is replacement for Java Vector class. Classical doubly linked list. LinkedList is replacement for Java Vector class. Classical
doubly linked list. Faster that Vector for insert/delete, but slower
for indexed access. The interface is modeled on java.util.Vector, so
you can try it both ways and pick which is faster for your needs.
Heavily commented Java source included. copyright (c) 1997-2008 Canadian Mind
Products. May be freely distributed and and used for any purpose
except military.
...
|
|
Common11 2.8 (Downloads: 403)
common utility classes that work under Java 1.1+ common utility classes that work under Java 1.1 without using Arraylists or Swing.
Class library.
Requires Java version 1.1 or later.
BigDate: simplified date handling when you want dates without times.
CMPAboutBox: a proper about box that provides useful information.
ImageInfo: information about a GIF, png, jpg.
ImageViewer: component to display an image
Limiter: cap, corral and h...
|
|
CreditCard Validator 1.8 (Downloads: 408)
Verifies that credit card number is valid. The CreditCard Validator will help you tell:
1. if a credit card number is valid,
2. which credit card vendor handles that number.
It is a simple Applet to demonstrate the use of the ValidateCreditCard class.
It validates the prefix and the checkdigit. It does *not* contact the credit card company to ensure that number has actually been issued and that the account is in good standing.
It will also tell you which of ...
|
|
JDisplay 4.5 (Downloads: 424)
JDisplay displays colorised program listings in web pages. JDisplay displays Java, HTML, bat, SQL, ini, csv, xml, mft
properties... files a variety of colours, fonts, sizes
and weights to help make them more presentable and readable.
Why would you use it? For the same sorts of reasons you use
colours and fonts in an IDE like IntelliJ or Eclipse. They
make the code much easier to understand.
There is no server-side code used. Java utilities parse the
code snippets i...
|
|
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.
|