Other listings by this author |
|
Tabin 5.3 (Downloads: 257)
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...
|
|
Amper 1.9 (Downloads: 447)
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 ...
|
|
FileIO 6.1 (Downloads: 599)
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.
|
|
Entities 3.1 (Downloads: 644)
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...
|
|
SiteMap 1.9 (Downloads: 323)
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...
|
|
Sound 1.4 (Downloads: 251)
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...
|
|
LinkedList 1.6 (Downloads: 198)
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.
...
|
|
Accumulate 1.3 (Downloads: 197)
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: 262)
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...
|
|
Unicode 1.8 (Downloads: 385)
Used to test your computer's Unicode support Used to test your computer's Unicode support and your font's
support for particular characters, or as a learning to to
explore the Unicode character set. Displays in Courier,
TimesRoman, Symbol, Dialog and Helvetica.
copyright (c) 1996-2008 Nic Fulton nic.fulton@reuters.com of
Reuters Ltd. Modified by Roedy Green
of Canadian Mind Products with permission.
To install, Extract the zip download with WinZip, availa...
|
|
Replicator 11.3 (Downloads: 813)
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...
|
|
FontSaver 1.4 (Downloads: 267)
FontSaver shares Font objects instead of creating new ones. FontSaver shares Font objects instead of creating new ones to cut
down on the RAM and time needed to create Font and Font peer objects.
Profiling often shows the creation of too many Font objects is the
cause of poor performance.
See the source code for how to incoporate it into your own programs.
It does nothing on its own....
|
|
Pentium 1.5 (Downloads: 279)
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...
|
|
Submitter 16.4 (Downloads: 1084)
Submitter will submit your PAD *.xml program descriptor file to 199 PADsites. Submitter will submit your PAD *.xml program descriptor file to 199 PADsites.
Unlike other submission programs, it submits only to PADSites
that welcome automated submissions. Compose your PAD *.xml file using a
program like PADGen, then upload it you your website. Then enter the URL
of your website directory where you upload pads and the name of the pad
itself e.g. hypotheticalprogram.xml, then hit SUBMIT. It also has a ...
|
|
Pluck 1.0 (Downloads: 210)
Scans multiple files looking for a REGEX pattern, and summarised what it finds. Scans multiple files looking for a REGEX pattern, and
summarised what it finds as a CSV file.
java -jar C:\com\mindprod\pluck\pluck.jar "\.[a-z]+\." E:\temp\temp.csv E:\somedir
adjusting as necessary to account for where the jar file is.
The first parameter is the regex pattern. See regex in the java glossary
for how to compose them.
The next parameter is where the output in to go. use the
wo...
|
|
InWords 4.6 (Downloads: 363)
Java code to converts number to words in any of 24 languagues. Shows you how to count in any of the following languages:
Bahasa Indonesia
Binary
Decimal (several variants)
Dutch (modern, old and banker's)
English (British, North American, Ordinals)
Esperanto
French
German
Grams
Hexadecimal
Icelandic
Italian
Japanese
Martian
Metric Metric Prefixes (grams)
Norwegian
Octal
Polish
RAM (bytes)
Roman Numerals...
|
|
HeapSort 1.7 (Downloads: 261)
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:
|