 |
All Source Codes - Newest source codes first |
Search |
|
Please select a language above and then click search.
|
|
|
|
|
|
Author
|
Plain Text
|
Download
|
Screenshot
|
Views
|
Rating
|
|
|
Mouse controls Transparency
|
cccalz
|
Yes
966 Chrs
|
-
|
-
|
12
|
-
|
|
|
Okay, so this only works for the form right now. If you move your mouse in the form, it will adjust transparency depending on how far away you are from the top left corner. I'm trying to get this to work for the whole screen. Then it'll be tons of fu...
|
|
|
Chat Server
|
cccalz
|
Yes
3,202 Chrs
|
-
|
-
|
10
|
-
|
|
|
A simple chat server that allows you to send messages across a network. Should work for internet too.
|
|
|
Memory Heap Joke
|
mikeMarek
|
Yes
14,313 Chrs
|
Yes
|
-
|
49
|
8.00
out of 10
|
|
|
A program I made as a joke and placed it on my brother's computer. All this does it create about a gig's worth of text files in a directory in your C: drive under the folder "Memory Allocation" every time they run this. So eventually all their hard d...
|
|
|
CMOS killer
|
X-N2O
|
Yes
473 Chrs
|
-
|
-
|
28
|
8.00
out of 10
|
|
|
Compile this as a driver and load it up. Before you click start, say goodbye to your PC (as I did when tested this on my lappy :( ).
Got the CMOS ports from sekio's 2004 posts :p
|
|
|
SOL Language 2.1
|
mikeMarek
|
Yes
1,163 Chrs
|
Yes
|
-
|
33
|
-
|
|
|
Version 2.1 of SOL. Fixed up some errors and bugs, cleaned up the code, and optimized; as well as added a few more features. I've run out of ideas, so I probably won't continue with this.
|
|
|
Uploader Class
|
Izzmo
|
Yes
2,615 Chrs
|
Yes
|
-
|
82
|
8.50
out of 10
|
|
|
This is a simple PHP Uploader class that is very portable and customizable. Download the ZIP file for usage instructions.
|
|
|
Path Finding
|
Cinjection
|
Yes
1,697 Chrs
|
-
|
-
|
60
|
-
|
|
|
The function find allows the user to create a path to a node in the tree. The path is given as a list in the form: (start second third ... endpoint). That is to get to endpoint, you have to go from start to second to third, all of which represent nod...
|
|
|
Pre, in, post order traversal of a binary tree.
|
Cinjection
|
Yes
2,163 Chrs
|
-
|
-
|
60
|
-
|
|
|
Here's an example of traversing a binary tree in three different ways, pre-order, in-order, and post-order. I made the functions bracket the expressions so that they are easier to read. For instance, 2 * 4 + 5 * 6 is actually printed as ( (2 * 4) + (...
|
|
|
Depth-first and Breadth-first Tree Traversal
|
Cinjection
|
Yes
1,512 Chrs
|
-
|
-
|
73
|
-
|
|
|
Below are two types of tree traversal, depth-first and breadth-first. Note that I named the breadth-first algorithm dragon-search, because it reminds me of a dragons breath. :P (I have weird ways of remembering things.)
Anyway, please leave your c...
|
|
|
Solving the N-Queens-Problem Part I
|
closure
|
Yes
8,447 Chrs
|
-
|
-
|
53
|
9.00
out of 10
|
|
|
This is the source-code to a series i'm going to start here in the coding-articles part.
It implements a genetic algorithm to solve the n-queens problem. The purpose of the algorithm is to be comprehensive not fast. I did not pick the fastest implem...
|
|
|
WorkTimer
|
Fallos
|
Yes
22,242 Chrs
|
Yes
|
Yes
|
66
|
-
|
|
|
I did this program in order to take time on the programmes I worked with.
It was a long time since I left the project, and I know that it is a bit buggy when you tries to take the time to MDI-form program.
Otherwise, it's probably anyone out ther...
|
|
|
Working with lists
|
Cinjection
|
Yes
1,267 Chrs
|
-
|
-
|
91
|
-
|
|
|
Here are several functions I made to learn how lists work in Scheme. If someone can tell me how to improve this code, I'd appreciate it.
|
|
|
Make maxlength='' work on textarea tags
|
VBAssassin
|
Yes
416 Chrs
|
-
|
-
|
231
|
-
|
|
|
Browsers don't natively support mexlength on textarea tags. However this enforces maxlength='' attribute on textareas, not just input text. Also, if javascript has been disable it will simply take no effect.
|
|
|
Dynamic Transparent GIF Pixel
|
VBAssassin
|
Yes
594 Chrs
|
-
|
-
|
312
|
-
|
|
|
This image will not be cached by the browsers and will load with every page hit. Usefull for statistics etc on other websites that you do not own. Search engines will also tend not to load the image (exception to some such as google which will likely...
|
|
|
Python Polygons ("PolyPy")
|
fbalden
|
Yes
953 Chrs
|
Yes
|
Yes
|
103
|
7.00
out of 10
|
|
|
A regular polygon class, which I wrote for a physics engine I'm working on.
Define a polygon like so:
p = polygon.Polygon((xpos, ypos), radius, faces, (r,g,b), pygame_surface)
A blue hexagon with a radius of 10 at (10, 10) on 'screen':
p...
|
|
|
Line Segments in Scheme.
|
Cinjection
|
Yes
1,295 Chrs
|
-
|
-
|
109
|
-
|
|
|
This program contains functions for creating points and line segments on a Cartesian plane. Once you have line segments established, I've include functions for finding the midpoint, as well as the length of the lines.
|
|
|
Filtered Accumulator
|
Cinjection
|
Yes
1,321 Chrs
|
-
|
-
|
140
|
9.00
out of 10
|
|
|
This is the first thing I made in Scheme that really impressed me. This function is really flexible and allows me to accumulate values (add, subtract, multiply, whatever) in between a range. This function also provides a filter for accumulating only...
|
|
|
How many ways to make change
|
Cinjection
|
Yes
508 Chrs
|
-
|
-
|
118
|
-
|
|
|
This calculates the number of ways to make change for x dollars (using current Canadian coins).
Running this program yields that there are 242 different ways to change $1.00 CAD (292 if you're american and use half-cent coins)
If someone can be...
|
|
|
Project Euler #4
|
Shadow
|
Yes
657 Chrs
|
-
|
-
|
176
|
7.50
out of 10
|
|
|
Project Euler #4
A palindromic number reads the same both ways.
The largest palindrome made from the product of
two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product
of two 3-digit...
|
|
|
MD5 hash lookup
|
durge69
|
Yes
10,342 Chrs
|
-
|
-
|
200
|
-
|
|
|
no description was entered
|
