Search
New Code
Magento Australia Post eParcel Extension 1.0
Airbnb Script - Airbnb Clone 1.0.3
Hotel Restaurant Reviews and Feedback Script 1.0.3
Documenter for MySQL 1.0
ODBC Driver for xBase 1.1
ODBC Driver for FreshBooks 2.0
AnyGantt JS Gantt Charts 8.4.2
The C# Barcode Library 4.0.2.2
ConyEdit for Windows 1.1.0
wolfSSL 3.15.5
Taxi Booking App Like Uber 1.0
IP2Location Geolocation Database 2018
Food Delivery Script 1.0.3
ODBC Driver for Magento 1.3
dbForge Studio for SQL Server 5.6
Top Code
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
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
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
Code Listing by Paddy McCarthy

Code 1-7 of 7   






Given items that depend on other items, a topological sort arranges items in order that no one item precedes an item it depends on.
In this example items are strings and dependencies are expressed in a dictionary whose keys are items and whose values are a set of dependent items. Note that the dict may contain self-dependencies (which are ignored), and dependent items that are not also dict keys, such as the item 'ieee'.



Will check SEDOL numbers as well as generate a SEDOL checksum digit.



Collects statistics on different algorithms for grouping thousands of tests for execution on a compute farm where you are limited to much less job slots, (tens).



Implements the Luhn test succinctly.



Saw recipe 502194 and wondered if I could do similar.
I initially came up with function comb that enumerates all combinations. I wanted a generator however and so abandoned that approach for comb2 which is a little more complex.



From reading about amb it seems that it allows for a declaritive style of programming where the one amb "operator" can
* Set the ranges of variables
* Set a constraint function
* And iterate over all solutions...



Adds symmetric difference and cartesian product to the Counter class. I had a use case for the former and Raymond H. asked about the latter so I coded the latter from its Wikipedia description.