Other listings by this author |
|
Replicator 11.3 (Downloads: 800)
The Replicator lets you distribute large numbers of files to many people. The Replicator lets you distribute large numbers of files to
many people efficiently. The software automatically
downloads just the changed files and deletes ones no longer
part of the distribution.
Unlike other similar tools, all it requires is an ordinary
HTTP website. It requires no code to run on the server.
It can also work with CDs, and LANs.
Custom configured for each customer. Not free. Registrat...
|
|
JDisplay 4.5 (Downloads: 419)
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...
|
|
Biorhythms Calculator 2.7 (Downloads: 928)
Calculates and displays biorhythm graphs. Calculates and displays biorhythm graphs.
Enter your birthdate and this Applet and it will calculate
your biorhythms. It computes your 23-day physical, 28-day
emotional, 33-day intellectual and combined cycles. The
combined cycle is sometimes called the luck cycle. The
theory of biorhythms is when the cycles are positive/high
you will have high energy. When they are negative/low you
will have low energy. When they...
|
|
QuickSort 1.6 (Downloads: 269)
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...
|
|
Mouse 1.4 (Downloads: 267)
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...
|
|
Encoding Recogniser 1.2 (Downloads: 209)
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 ...
|
|
NetworkCam 1.6 (Downloads: 268)
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....
|
|
Accumulate 1.3 (Downloads: 193)
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....
|
|
Boyer 1.5 (Downloads: 255)
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...
|
|
CanadianTax 4.2 (Downloads: 616)
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 ...
|
|
LinkedList 1.6 (Downloads: 194)
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.
...
|
|
Screws 1.3 (Downloads: 241)
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....
|
|
Converter 5.5 (Downloads: 413)
How to Interconvert any of the Java primitives. Conversion Amanuensis. Conversion teaching tool. Shows you how to convert any of the 17 basic Java types into any of the other. Conversion Amanuensis as your side whenever you need Java code to convert anything to anything else. Runs an as Applet or application.
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 ...
|
|
Volser 1.2 (Downloads: 372)
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...
|
|
Quoter 5.1 (Downloads: 437)
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...
|
|
BlOut 2.6 (Downloads: 368)
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...
|
|
HeapSort 1.7 (Downloads: 236)
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:
|