Other listings by this author |
|
 Splice 1.5 (Downloads: 460)
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...
|
|
 Untouch 2.4 (Downloads: 452)
Reverts files dates back if the files have not really changed. Documentation on the original student project outline
mindprod.com/projects/untouchproj.html
This explains how it works and some of its uses.
Untouch supports the following command line switches which appear
before the directories.
-c or -clear = clear history first and take current file times as the new revert-to point.
-f or -force = revert files back to previous dates whether they have changed or not.
-h or -help =...
|
|
 Http 2.9 (Downloads: 801)
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...
|
|
 LEDataStream 1.8 (Downloads: 253)
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...
|
|
 Wavelength 1.3 (Downloads: 297)
Wavelength creates Color objects given the light wavelength or the frequency Wavelength creates Color objects given the wavelength or
the frequency of the light rather than the usual RGB or HSB.
instead of:
Color c = new Color(255, 0, 0);
use the frequency in nanometers, and gamma 0.0. .. 1.0.
(gamma is intensity/brightness.)
Color c = Wavelength.wvColor( 400.0f, 0.80f );
The visible range of the spectrum is 380..780 nanometers.
Smaller is bluer.
or using frequency in Terahe...
|
|
 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.
...
|
|
 SiteMap 1.9 (Downloads: 324)
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...
|
|
 QuickSort 1.6 (Downloads: 307)
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...
|
|
 Sound 1.4 (Downloads: 253)
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...
|
|
 AmericanTax 3.8 (Downloads: 460)
Calculates American sales taxes state and district Calculates American sales taxes, state and district.
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 sales tax to a base price.
It also works in reverse given the total paid working
backwards to get the tax and original price. In other words
it will tell you the sticker price to make somet...
|
|
 Honk 1.5 (Downloads: 249)
Plays one or more of the Standard Windows sounds or wav files. Plays one or more of the Standard Windows sounds, triggered
purely from the command line.
use:
honk
- Plays the default system sound.
honk SystemStart SystemHand SystemQuestion
- Plays the given list of standard system sounds (usually just one).
- they are case-insensitive (you can get the case wrong and it will still work).
Possible sound names are listed in the registry...
|
|
 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...
|
|
 Tabin 5.3 (Downloads: 259)
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...
|
|
 Insult 1.9 (Downloads: 339)
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,...
|
|
 BlOut 2.6 (Downloads: 380)
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...
|
|
 FileTimes 1.9 (Downloads: 277)
Read and set Windows file/dir times from Java: Create/LastModified/LastAccessed Java class library to get/set file and directory times: Create/LastModified/LastAccessed. For Windows only.
Create time is when the file was first written. Modified
time (sometimes called lastModified) is when the file was
last written. Accessed time is when the file was last read
or written. Checking its date, looking at its attributes or
checking to see if it exists does not count as reading it.
Get/Set Windows Fil...
|
|
 HeapSort 1.7 (Downloads: 267)
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:
|
AbleFTP 11.10: AbleFtp - FTP client designed to automate and run 1000+ FTP tasks a day.
Domain Quester 6.02: Search for domains by unlimited number of keywords