Other listings by this author |
|
Accumulate 1.3 (Downloads: 194)
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....
|
|
Holiday Calculatior 4.7 (Downloads: 745)
Calculate when 66 holidays occur in any given year. Calculates when various holidays occur in any given year BC or AD.
Designed to be cannibalised to include the calculation routines in your
own programs. You might use it to prepare paper calenders well in
advance or electronic calendars. You might also use the logic in computer
programs that compute payrolls, bus schedules, or club meetings. You
might use it in writing novels or researching historical events. It can
als...
|
|
Rgrow 1.3 (Downloads: 212)
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...
|
|
BlOut 2.6 (Downloads: 371)
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...
|
|
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.
...
|
|
Transporter 1.4 (Downloads: 247)
Lightweight Java classes to let you encrypt/sign/armour for secure transmission. The Transporter acts like an electronic secure courier to
deliver your data and documents in encrypted form safe from
prying eyes or those who would tamper with them.
It Encrypts, digitally signs and armours to send sensitive
information over the Internet without SSL.
Typically you would embed it in your own Internet
applications....
|
|
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....
|
|
Entities 3.1 (Downloads: 626)
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...
|
|
RadixSort 1.6 (Downloads: 221)
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.
|
|
HunkIO 1.7 (Downloads: 263)
Java classes to readEntireFile, create a temp file etc. Java classes to include in your own programs. They let you read or write a file in one fell swoop into RAM. It also includes createTempFile method that is more convenient to use than Sun's File.createTempFile. It also includes PrintWriterPlus that converts linefeeds to platform specific line feeds even when they are embedded in data.
Why the three linked ball logo? It symbolises processing a file in line-sized chunks....
|
|
Http 2.9 (Downloads: 767)
HTTP GET/POST/HEAD/PROBE/CHASE java class library for http: or https: http is a small library of Java classes to let you do GET/POST/HEAD/PROBE/CHASE to a server r with http: or https. It will also encode parameter pairs for you.
It does nothing on its own. It is intended to be incorporated into your own programs.
To see a sample use have a look at the com.mindprod.submitter package, downloadable...
|
|
FontSaver 1.4 (Downloads: 250)
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....
|
|
HeapSort 1.7 (Downloads: 248)
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:
|
|
Spinner 1.1 (Downloads: 364)
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...
|
|
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.
|
|
FileFilters 2.7 (Downloads: 426)
Colllecton of Java FilenameFilters. FilenameFilters you can use in your own Java programs with
File.list( FilenameFilter f ). They can also be used
standalone as fancy dir commands.
They come with Java source and include:
AllDirectoriesFilter gets all directories
AllFilesFilter gets all files
ClamFilter simple wildcard
DirListFilter gets a list of directories
EndsWithFilter gets files whose names end with a...
|
|
QuickSort 1.6 (Downloads: 285)
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...
|