New Code
Rapid PHP 2018 15.5
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Code Listing by Justin Shaw

Code 1-10 of 10   

Very rarely it is necessary to find the multiplicative inverse of a number in the ring of integers modulo p. Thie recipe handles those rare cases. That is, given x, an integer, and p the modulus, we seek a integer x^-1 such that x * x^-1 = 1 mod p. For example 38 is the inverse of 8 modulo 101 since 38 * 8 = 304 = 1 mod 101. The inverse only exists when a and p are relatively prime.

The new Lego Mindstorms NXT brick has an on-board Bluetooth transceiver that can
connect to a serial port service on a PC. The NXT uses a simple format to pass
raw bytes between connected Bluetooth devices. This interface allows the...

Class methods were introduced in python2.2. The following code illistrates how the same effect can be achived in python 2.1 and probably under although I haven't checked.

Since the class is itself a singleton, it makes since to utilize it as such. The solution is to make every thing in sight a classmethod.



I frequently find myself adding "just in time" (JIT) object creation to avoid wasting cycles on objects that are never used. This class enables JIT object creation by basically currying the __init__ method.

The object is...

How to kick off a slow process without waiting around for the result. The process is run in the background until the value is actually needed at which time it blocks until the value is ready.

This recipe yields each subset of size k from a super set of size n. I thought I had seen a recipe that did this before, but when I needed it I couldn't find it. There are two methods. The first operates on sets of integers of the form...

This is a simplified version of George Sakkis recipe entitled "Cache decorator in python 2.4" ( In this version, no extra classes are required and this is small enough to...

This is a simple way of expressing non-linear scales (such as decibels) in python. In stead of:
gain = 10 ** (12/10.)

gain = 12 * dB

Here is how to use the new decorator feature of python 2.4 to systematically check the argument types for type-sensitive functions.