Jasper's programs


Up  |  Previous  |  Next  |  Down

Polar Gradients

Create radial, conical and spiral gradients as special cases of "polar" gradients.

DirCompare

A program that creates a file containing hashes of files in a particular directory (and all subdirectories).
dir compare.zip (4KB)
This is a Visual C++ 6.0 project, you need Crypto++, which can be downloaded from http://www.eskimo.com/~weidai/cryptlib.html, as well as Boost, which can be downloaded from .
dir compare bin.zip (137KB)
This is a compiled version of the above program.

Sorting

I once made a little program that uses several different sorting algorithms to sort an array and logs the time it takes the programs to do that.
This was made quite a long time ago, so it's probably full of little bugs, but it's quite usefull if you want to use a sorting algorithm in one of your programs and can't find one.
sorting.zip (5KB)
Contains main.cpp, several headers (one for each algorithm) and a little batch file to compile it (if you use DJGPP or something similar).
It needs a file named sortinglog.txt to be in the current directory when executed. That's where the results are stored. The file has a number of fields, the first is the size of the array, the rest are the timings of the individual algorithms.

The following algorithms are implemented: NOTE: This entire program was made in Dutch (atleast all the comments and texts), because it was made for a school project.

Sorting 2

This is kind of an update to the previous program (Sorting), it contains more code and one algorithm more.
sorting2.zip (9KB)
Contains Sort Test.cpp, several headers (one for each algorithm) and a Readme.txt with a file list.
It will store it's results in d:\sorttest.log, but this can be easily changed in the source.
The file has a number of fields, the first is the size of the array, the rest are the timings of the individual algorithms. A -1 indicates that the array wasn't sorted correctly and a -2 is used as a placeholder for the O(n^2) algorithms.

The following algorithms are implemented:

FTP Prog

This is a very small program that implements a very simple - and by no means full-featured - FTP client.
It was made as a small test program, so I could figure out how an FTP connection works.
ftp prog.zip (31KB)
This is a Visual C++ 6.0 project, consisting of a standard windows application modified to have a textbox where you can type commands and a display where the replies are shown.
All the FTP stuff is done in ftp.h
This program only implements a control connection (you can type commands and receive replies) and a data connection for the LIST command. But it could be extended with a minimum amount of effort.

Extension Cleaner

This a very simple program that cleans up the extension list in the registry, it has some safeguards and has not caused any trouble yet, but it should still be used with caution and only by people who now what they're doing. And it should NOT be used on any NT/2000 and probably XP system.
extension cleaner.zip (10KB)
This is a Visual C++ 6.0 project, consisting of a standard windows application, modified to my wishes.

Interpolator

This can be used to convert a set of n points to a polynomial of the form: cn-1xn-1 + cn-2xn-2 + ... + c0x0
interpolator.zip (43KB)
This is a Visual C++ 6.0 project with a main (console) program and two headers.
The matrix and vector stuff is done in matrixandvector.h and the actual interpolating is done in lup.h
This program asks for a degree and the asks you for the X and Y values of degree+1 points (x^2 has degree 2, but needs 3 points). Then it starts calculating stuff, each step will be printed on the screen (you could easily modify the source to put all the output in a file).

Magnetisme sim

This VB program makes nice images of field strengths, though they may not be very acurate (as I don't know what the correct function is to calculate it).
magnetisme sim.zip (4KB)
This is a Visual Basic 6.0 project containing a form with some commandbuttons (and of course the neccesary code).
This is in Dutch (atleast partially), but should not be impossible to understand (by someone who doesn't speak Dutch).
If it intrigues you, have a look at it. You can modify the number of magnets and their positions in the code.
If someone knows how this (calculating field strength) SHOULD be done, please mail me.

Up  |  Previous  |  Next  |  Down


To contact me, please mail to: th.v.d.gronde@hccnet.nl
I hope you'll enjoy my program(s).