Latest recipes tagged "dictionary"

States to Regions (Python)

2016-05-09T22:24:26-07:00

Python recipe 580661 by Jackson Killian (dictionary, regions, states).

Python dictionary mapping two letter state abbreviations to their respective regions of the country (i.e. Midwest, North East, etc.) N - North East W - West M - Mid West S - South O - Other

LRU dictionary (Python)

2016-04-17T01:22:51-07:00

Python recipe 580645 by Felix (dict, dictionary, expires, expiring, lru, lru_cache, python, python3).

For most cases where you want to store a limited amount of data, functools.partial is sufficient. However, if you want or need more control over your data, especially specifying an expiration date for your entries, this can come in handy.

Read the docstrings for implementation details.

LRU dictionary (Python)

2016-04-17T01:22:01-07:00

Python recipe 580644 by Felix (dict, dictionary, expiration, expiring, lru, lru_cache, python3).

Read the docstrings for implementation details.

defdict (Python)

2015-10-15T15:45:16-07:00

Python recipe 579113 by user (abstract_base_class, datastructures, dictionary).

default dictionary with collision function to handle key collisions.

Python add/set attributes to list (Python)

2015-09-29T16:28:46-07:00

Python recipe 579103 by webby1111 (attributes, class, dictionary, list, subclass). Revision 3.

Python Attribute List

Add/set attributes to python lists.

A google search for "add attributes to python lists" yields no good stackoverflow answer, hence the need for this.

Useful for machine learning stuff where you need labeled feature vectors.

This technique can be easily adapted for other built-ins (e.g. int).

The Problem

a = [1, 2, 4, 8]
a.x = "Hey!" # AttributeError: 'list' object has no attribute 'x'

The Solution

a = L(1, 2, 4, 8)
a.x = "Hey!"
print a       # [1, 2, 4, 8]
print a.x     # "Hey!"
print len(a)  # 4

# You can also do these:
a = L( 1, 2, 4, 8 , x="Hey!" )                 # [1, 2, 4, 8]
a = L( 1, 2, 4, 8 )( x="Hey!" )                # [1, 2, 4, 8]
a = L( [1, 2, 4, 8] , x="Hey!" )               # [1, 2, 4, 8]
a = L( {1, 2, 4, 8} , x="Hey!" )               # [1, 2, 4, 8]
a = L( [2 ** b for b in range(4)] , x="Hey!" ) # [1, 2, 4, 8]
a = L( (2 ** b for b in range(4)) , x="Hey!" ) # [1, 2, 4, 8]
a = L( 2 ** b for b in range(4) )( x="Hey!" )  # [1, 2, 4, 8]
a = L( 2 )                                     # [2]

Find Duplicate Files (Python)

2014-10-12T21:14:05-07:00

Python recipe 578950 by FB36 (dictionary, directories, directory, disk, file, files, utility).

Finds duplicate files which have same size and same content in the same directory or two different directories.

wrist friendly dictionary (Python)

2013-08-18T22:54:26-07:00

Python recipe 578644 by Ariel Keselman (dictionary, interface, nested).

this dictionary allows easy manual creation of nested hierarchies, like so:

window.style.width=5

or...

window['background-color'].rgb= 255,255,255

Priority queue dictionary (Python)

2013-08-25T00:23:12-07:00

Python recipe 578643 by Nezar Abdennur (algorithms, dictionary, heap, heapq, pqdict, priority_queue). Revision 4.

An indexed priority queue implemented in pure python as a dict-like class. It is a stripped-down version of pqdict. A Priority Queue Dictionary maps dictionary keys (dkeys) to updatable priority keys (pkeys).

The priority queue is implemented as a binary heap, which supports:

O(1) access to the top priority element
O(log n) removal of the top priority element
O(log n) insertion of a new element

In addition, an internal dictionary or "index" maps dictionary keys to the position of their entry in the heap. This index is maintained as the heap is manipulated. As a result, a PQ-dict also supports:

O(1) lookup of an arbitrary element's priority key
O(log n) removal of an arbitrary element
O(log n) updating of an arbitrary element's priority key

A data structure like this can be used to drive simulations, schedulers, certain greedy algorithms, merging streams of sorted data, and other applications where priorities may need to be changed frequently.

Proof-of-concept for a more space-efficient, faster-looping dictionary (Python)

2013-01-17T09:28:24-08:00

Python recipe 578375 by Raymond Hettinger (compact, dictionary). Revision 20.

Save space and improve iteration speed by moving the hash/key/value entries to a densely packed array keeping only a sparse array of indices. This eliminates wasted space without requiring any algorithmic changes.

Dynamically create a dictionary of ascending paths (Python)

2012-12-03T22:50:47-08:00

Python recipe 578354 by Scott S-Allen (bootstrap, dictionary, directory, dynamic, flexible, path, portable).

Ripped from a more elaborate bootstrap script. A sequential set of parent-directories were required for environment variables and subsequent, portable. auto-discovery.

DoubleDict (Python)

2012-07-24T21:24:14-07:00

Python recipe 578224 by Stephen Chappell (class, dictionary).

After seeing requests for being able to access keys in a dictionary by value, the following recipe was born. It creates the DoubleDict class and allows just that. To ensure that only one key is returned when accessing it by value, values must be unique just as keys are unique, and this rule is automatically enforced. Most dictionary methods are supported, and many more are added to allow working with the dictionary from the view of the values instead of the keys. Several optional metaclasses are also provided to enable optional features in the DoubleDict class such as data consistency checks and atomic method execution.

Recursively print (nested) dictionaries (Python)

2012-04-04T15:20:42-07:00

Python recipe 578094 by Mauricio Dada Fonseca de Freitas (dictionary, print, recursion).

Snippet of code that uses recursion to print nested dictionaries. It does not sort the entries!

Useful Unrestricted Grammar (Python)

2012-03-27T19:30:47-07:00

Python recipe 578087 by Shea Kauffman (dict, dictionary, grammar, grammer, language, thue, turing_machine, unrestricted).

This is an implementation of an easy to use unrestricted grammar. It could be used for quickly prototyping a DSL, testing a post-formal system, or parsing test in a way that requires context. It would however be extremely slow for simple substitutions.

Restricted dictionary (Python)

2012-02-16T21:39:02-08:00

Python recipe 578042 by arnoques (datastructures, dict, dictionary, record).

It's a dictionary that's restricted to a tuple of allowed keys. Any attempt to set an invalid key raises an error.

Sorting a dict's items and keys (Python)

2012-02-04T04:23:01-08:00

Python recipe 578031 by George V. Reilly (dictionary, sorting).

icalendar uses its own CaselessDict as the base of many classes. I needed to produce the keys and items in a canonical order, so that certain keys would appear first.

Create a nested dictionary from os.walk (Python)

2011-09-26T23:38:24-07:00

Python recipe 577879 by Andrew Clark (dictionary, os_walk). Revision 2.

Creates a nested dictionary that represents a folder structure. Here is an example of what the resulting dictionary might look like:

{
    "root": {
        "folder2": {
            "item2": None, 
            "item1": None
        }, 
        "folder1": {
            "subfolder1": {
                "item2": None, 
                "item1": None
            }, 
            "subfolder2": {
                "item3": None
            }
        }
    }
}

Self-contained TWL06 Dictionary Module (515 KB) (Python)

2011-08-10T20:32:03-07:00

Python recipe 577835 by Michael Fogleman (dawg, dictionary, scrabble, trie, twl06, word). Revision 4.

A convenient, self-contained, 515 KB Scrabble dictionary module, ideal for use in word games.

Functionality:

Check if a word is in the dictionary.
Enumerate all words in the dictionary.
Determine what letters may appear after a given prefix.
Determine what words can be formed by anagramming a set of letters.

Sample usage:

>>> import twl
>>> twl.check('dog')
True
>>> twl.check('dgo')
False
>>> words = set(twl.iterator())
>>> len(words)
178691
>>> twl.children('dude')
['$', 'd', 'e', 's']
>>> list(twl.anagram('top'))
['op', 'opt', 'pot', 'to', 'top']

Yet Another Ordered Dictionary (Python)

2011-08-07T12:14:56-07:00

Python recipe 577826 by Lucio Santi (dict, dictionary, linked_list, ordered).

An implementation of dictionaries preserving key insertion order. Despite using a doubly-linked list to keep track of the appropriate order, this list is actually embedded in the dictionary. As a consequence, there is little space penalty, and also every operation exhibits an efficient implementation (i.e., no need to perform lookups or deletions multiple times, as it happens with other versions of this data structure).

dict2xml (Python)

2011-07-19T12:32:57-07:00

Python recipe 577739 by nuggetier (dictionary, xml). Revision 4.

convert dictionary / list structures into xml structure

xml to python dictionary and back (Python)

2012-10-24T00:44:30-07:00

Python recipe 577722 by kris kvilekval (dictionary, mapping, xml). Revision 2.

Simple mapping of XML to python dictionary based on Perl XML::Simple