Other listings by this author |
|
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...
|
|
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,...
|
|
BOOTSave 2.8 (Downloads: 286)
BootSave saves/restores the master boot sector BootSave saves/restores the master boot sector on the
hard disk. Suite of three utilities BootSave, BootRest and
BootChk. Protects against damage to the partition table or
boot sector done by rogue programs, viruses or accidents
with tools like Norton NU.
The BootSave suite will work under DOS, Windows 3.x, Windows
95/98/ME, OS/2, but not NT, Windows 2000, XP, Vista or Windows 7.
These OSes block low level disk I/O as...
|
|
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...
|
|
Rgrow 1.3 (Downloads: 213)
RGrow resizes fixed length records padding or chopping. RGrow resizes fixed length records e.g.
RGrow.exe MyFile.seq 500 600
will grow each record from 500 to 600 bytes by padding binary zeros.
Will also truncate records.
These are not the old and new sizes of the file, but of the fixed length records
in the file. If you increase the record size, each record will be padded
with nulls. The entire file will grow as a result.
This program may be freely copied and us...
|
|
Align 1.6 (Downloads: 255)
Aligns data in ASCII text files into neat columns. ALIGN aligns data in ASCII text files into neat columns.
Also converts comma-delimited files to columns with 2 spaces
between each column. Input fields must be separated by
commas or white space. Fields may contain spaces if they
are enclosed in single or double quotes or C comments /* ...
*/ or //. The best way to understand this program is to try
it on a COPY of any ASCII Text file, especially one that
contains badly al...
|
|
Splice 1.5 (Downloads: 447)
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...
|
|
LinkedList 1.6 (Downloads: 196)
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.
...
|
|
HeapSort 1.7 (Downloads: 254)
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:
|
|
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.
|
|
Echoserver 1.3 (Downloads: 242)
See what browsers and programs are sending to an HTTP Server. See what browsers and programs are sending to an HTTP Server.
Simple server just dumps whatever it receives on the console.
Echoserver is misnamed because it does not actually echo what it receives
back to the browser....
|
|
Bulk Emailer 1.7 (Downloads: 284)
The bulk emailer program sends the same email to many people. The bulk emailer program allows you to send the same email
to a long list of people. Unlike competing products, it does
not require you to run any code on your ISP's server.
The price includes customising the program to your needs.
For more detail see the manual at
mindprod.com/application/bulk.manual.html
To install, Extract the zip download with WinZip, available from
winzip.com (or similar unzip utili...
|
|
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...
|
|
Amper 1.9 (Downloads: 440)
Safely converts ampersands to !amp; entities In the following, pretend ! is an ampersand. PAD files don't let me give literal examples. Amper converts ! to !amp; in HTML files and back, but does not convert it when the ! is already in an entity e.g. !lt; !thetasym; !eacute;
The main use for this is to pass HTMLValidator verification of your HTML, which is very picky about !, especially inside URLs.
As a side effect, it also ensures all your comment delimiters balance.
It ...
|
|
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...
|
|
SetClock 8.5 (Downloads: 907)
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....
|
|
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.
|