Search
New Code
ODBC Driver for NetSuite 1.2
Rapid CSS 2018 15.0
ByteScout PDF Extractor SDK 9.0.0.3079
TeeGrid for .NET 2018
HotelDruid 2.2.3
Metamill 8.2.2022
EXE Stealth Protector 4.23
EXE Bundle - The file joiner 3.14
WeBuilder 2018 15.0
SuiteCRM Customer Portal 1.0
Magento Admin Mobile App 1.0
AnyStock Stock and Financial JS Charts 8.2.0
Kijiji Script 1.0.3
SSIS Data Flow Components 1.7
ODBC Driver for Amazon Redshift 1.0
Top Code
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
Readymade MLM Products 2.01
ADO.NET Provider for ExactTarget 1.0
Code Listing by Matteo Dell'Amico

Code 1-4 of 4   






This structure is a kind of dictionary which allows you to map data intervals to values. You can then query the structure for a given point, and it returns the value associated to the interval which contains the point. Boundary values don't need to be an integer.

In this version, the excellent blist library by Daniel Stutzbach is used for efficiency. By using the collections.MutableMapping abstract base class, the whole signature of...



This generator will sort only the requested part of a list. Useful for getting just the first few elements of a list and avoiding the overhead of sorting the whole thing.



You may have needed a priority queue with the ability to change the priorities of elements that were in the queue. This recipe solves this problem in an efficient way.



The kd-tree can be used to organize efficient search for nearest neighbors in a k-dimensional space.