Other listings by this author |
|
HeapSort 1.7 (Downloads: 244)
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:
|
|
SetClock 8.5 (Downloads: 891)
Set your PC Clock from an accurate atomic clock on the web. Set PC Clock from an accurate atomic clock on the web. You
can put in on your website so that others can use it to
correct their clocks without having to install software or
without you having to install software on your server.
Java Web Start signed.
Requires Java version 1.5 or later. Native code for Windows only.
Full Java source code included, and native C JNI code....
|
|
Borders 1.5 (Downloads: 236)
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....
|
|
LEDataStream 1.8 (Downloads: 247)
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...
|
|
File Splitter 1.3 (Downloads: 321)
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.
|
|
Tabout 2.7 (Downloads: 231)
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....
|
|
SortedArrayList 1.3 (Downloads: 233)
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 ...
|
|
Splice 1.5 (Downloads: 378)
SPLICE splices bits of files together SPLICE splices bits of files together e.g.
SPLICE Cut MyFile.Txt Start 99 Length 99 Insert MyFile2.txt At 99
SPLICE Copy MyFile.Txt Start 99 Length 99 Overlay MyFile2.txt At 99
Uses for SPLICE:
1. excising a section of a file.
2. replacing a section of a file.
3. inserting a section into a file.
4. extracting a section of a file.
5. appending a section onto a file.
This program may be freel...
|
|
Password 1.7 (Downloads: 552)
Generates random passwords that are hard to guess. Generates random passwords that are hard to guess. It uses a crytographic quality random number generator. The passwords are generated locally in a Java Applet. They are never transmitted over the Internet, even in encrypted form.
You can also run it as a standalone program, invoking it with
java com.mindprod.password.Password
or
password.jar
You can also run it online at the mindprod.com website without installing it....
|
|
CMOSSave 4.6 (Downloads: 338)
Check CMOS for corruption and automatically restore it. CMOSSave CMOSRest CMOSChk restore corrupted CMOS from
backup and check that CMOS has not been tampered with.
Naive users sometimes meddle with CMOS settings. We need a
fast way to put the scores of subtle CMOS configuration
settings back the way they were.
Power surges can corrupt CMOS. We need a way for a naive
user to quickly restore all the CMOS settings.
If the battery fails, the contents will be los...
|
|
FileIO 6.1 (Downloads: 589)
Generates sample Java code to do 617 types of I/O. I/O teaching tool that generates sample Java source code to read or write the console, a sequential file, a random access file, a String, an array of characters, an array of bytes, URL, HTTP CGI GET/POST, Socket, resource or Pipe. It shows you how to read or write ASCII-8 bit characters (plain or locale-encoded), Unicode 16-bit characters, raw bytes, big endian binary, little endian binary, or serialised objects, buffered, unbuffered or gzip compressed.
|
|
FourTidy 3.1 (Downloads: 320)
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...
|
|
LinkedList 1.6 (Downloads: 195)
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.
...
|
|
Compactor 3.4 (Downloads: 582)
Compresses HTML by removing unnecessary white space. Compresses HTML by removing unnecessary white space.
Compacts HTML so that web pages are 20% smaller and hence
20% faster. It does this by removing all unnecessary white
space. To fluff files up again, I suggest using SlickEdit
beautify. The file will render on browsers exactly as they
did before. Any [pre] sections are left intact. No comments
are removed.
NOTE THE COMPACTOR JUST COMPACTS YOUR HTML. IT DOES N...
|
|
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 ...
|
|
Pentium 1.5 (Downloads: 277)
Java code to tell you facts about the Pentium and AMD CPU. Pentium works on Windows and Intel Pentium class and AMD
CPUs to determine the CPUID information such as the vendor,
brand/model, step, model, instruction set family, cpu serial
number, and the RDTSC Time stamp register for high
resolution timing measured in CPU cycles since the last
boot. It is designed to be incorporated in your own Java
progams.
You can also use it as a standalone utility with:
java.ex...
|
|
RadixSort 1.6 (Downloads: 219)
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.
|