Popular recipes tagged "list" but not "enumerate"

Tkinter draggable list V2 (Python)

2017-03-03T14:13:14-08:00

Python recipe 580748 by Miguel Martínez López (draggable, list, tkinter). Revision 3.

This version use tkinter frame instead of ttk frame.

This next link is version 1 (It's the same code but it uses ttk frame):

https://code.activestate.com/recipes/580717-sortable-megawidget-in-tkinter-like-the-sortable-w/

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]

Sortable megawidget in tkinter (like the sortable widget in jquery UI) or draggable list (Python)

2017-03-03T14:11:42-08:00

Python recipe 580717 by Miguel Martínez López (draggable, list, megawidget, sortable, tkinter). Revision 13.

Sortable element list for tkinter using drag and drop.

This version use themed Tk. My other version doesn't use ttk:

https://code.activestate.com/recipes/580748-tkinter-draggable-list-v2/

Flattening an arbitrarily nested list in Python (Python)

2014-10-05T21:44:45-07:00

Python recipe 578948 by Vasudev Ram (algorithm, algorithms, flatten, list, lists, python).

This is a recipe to flatten a Python list which may have nested lists as items within it. It works for lists that have a maximum depth of nesting roughly equal to the recursion depth limit of Python, which is set to 1000 by default, though it can be increased with sys.setrecursionlimit().

Fixed Lengh List (Python)

2014-01-24T15:27:25-08:00

Python recipe 578813 by Hiro (length, list). Revision 2.

In some applications, it's advantageous to be able to define a fixed length list.

The class provides all features as python internal type: list

The main focus of fixed length list is only keep certain number of items. "overflow" items will be discarded.

Dynamically format a comment block (Python)

2013-08-31T08:14:10-07:00

Python recipe 578624 by Michael Swartz (comments, for_loop, list). Revision 3.

Neatly format a comment block that is surrounded by #s and takes into account right side space padding.

List comparison, difference and more using set & frozenset (Python)

2012-11-01T10:30:58-07:00

Python recipe 578310 by Scott S-Allen (compare, contain, difference, lambda, list, remove, set, union).

Python has a powerful suite of tools for comparing lists by way of sets and frozensets. Here are a few examples and conveniences that many newcomers, even a few seasoned developers, are unaware.

Geocoding Lists via Google Maps (Python)

2012-05-11T05:06:27-07:00

Python recipe 578126 by Mano Bastardo (batch, coordinates, geocode, geocoding, google, google_maps, lat, latitude, list, list_comprehension, lng, longitude, map, web). Revision 2.

A simple script written as an experiment in geocoding addresses in a database. A list of addresses in the form of "100 Any Street, Anytown, CA, 10010" is passed to a Google Maps URL, and the latitude/longitude coordinates are extracted from the returned XML.

XML methods are not used in this script, but simple string searches instead.

Flattening an arbitrarily deep list (or any iterator) (Python)

2012-04-03T17:13:35-07:00

Python recipe 578092 by Garrett (flatten, iterator, itertools, list, python, tuple). Revision 6.

What if you had a list like this: [1, -10, [1,2,[3,4]], xrange(200)], and you just wanted to go through each element in order (wanted it to return a simple list of [1,-10,1,2,3,4,1,2,3,4...199])

I've seen a couple of attempts to flatten arbitrarily deep lists. Many of them involve recursion, like this one: http://rightfootin.blogspot.com/2006/09/more-on-python-flatten.html

Recursion is generally considered non-pythonic (at least to my knowledge), so I have used one which just involves simple iterators instead. Also, recursion will fail if the list is too deep (so it wouldn't really be arbitrary, would it?).

Fast Indexing functions (greater than, less than, equal to, and not equal to) (Python)

2012-03-13T16:21:36-07:00

Python recipe 578071 by Garrett (index, list, list_comprehension, numpy, python). Revision 2.

Oftentimes you want to find the index of a list-like object. Numpy arrays, for example, do not have a index member function. These get the job done quickly.

Note: these do not raise exceptions, instead they return -1 on error. You should change that if you want different behavior.

METACLASS AND DEEPCOPY (Python)

2012-02-26T15:43:01-08:00

Python recipe 578053 by thonpy (deepcopy, equal, list, metaclass, sign).

I would like to solve this excercise: Traditionally object-oriented programming provides two different modes for cloning an instance or a structured data type: shallow and deep copy. The former has the effect to clone exclusively the external shell and not its content originating a quite fastidious aliasing effect. The latter, instead, copies the shell and its content recursively creating two completely separate copies of the instance.

As you know, Python's programs suffer of the aliasing effect when you copy an instance of a class or a structured type (e.g., a list) with the = operator. As showed in the following example:

l=[0,1,2] mylist=l mylist[2] = ’B’ mylist [1, 2, ’B’] l [1, 2, ’B’

The exercise consists of defining a meta-class which implements the deep copy on the assignment operator and binding this to the standard class list. Such that the following behavior can be yielded

Print a List of Places (ie, Rankings) (Python)

2012-02-25T05:37:41-08:00

Python recipe 578052 by Andrew Yurisich (list, listing, ranking).

Hopefully this function will save you the trip to oocalc/excel. Py3k code.

Get multiple elements from a list (Python)

2011-11-21T06:41:57-08:00

Python recipe 577953 by Alexander James Wallar (get, getvar, list, python, retrieve, retrieving).

This code lets you retrieve multiple elements from a list at one time

Random Binary List (Python)

2011-11-09T19:38:14-08:00

Python recipe 577944 by Alexander James Wallar (base, binary, list, math, numbers, python, random, random_binary_list).

This recipe returns a list of size n such that the contents of the returned list are random 0s and 1s. It returns a random binary list of size n.

Python Multidimensional List Searcher (Python)

2011-10-29T22:21:39-07:00

Python recipe 577929 by Alexander James Wallar (element, elements, find, finder, list, python, search).

This module/function lets you find a 2 dimensional list of indices for elements you are looking for in a super list. Example:

find([1,1,1,2,1,2,3,3],[1,2,3])

returns: [[0, 1, 2, 4], [3, 5], [6, 7]]

Evolutionary Algorithm (Generation of Prime Numbers) (Python)

2011-11-27T06:45:00-08:00

Python recipe 577964 by Alexander James Wallar (algorithm, example, genetic, genetic_algorithm, genetic_algorithms, list, number, of, prime, primelist, primes, theory).

This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.

Parameters:

isPrime --> n: number to check if it is prime allPrimes --> n: size of list of random primes, m: the primes in the list will be between 0 and m

primeList (Python)

2011-11-05T23:42:37-07:00

Python recipe 577935 by Alexander James Wallar (list, numbers, prime, primelist, primes, theory). Revision 3.

This module returns all the prime numbers strictly less than n. For this code to print out all of the primes n inclusive, in the range, n+1 must be substituted for n.

Simple recursive function to non-recursive function (Python)

2011-05-27T01:47:37-07:00

Python recipe 577724 by Sunjay Varma (function, list, recursive, substitute).

This recipe is a simple solution for turning a recursive function into a non-recursive function.

Get a list from a ConfigParser option (Python)

2011-05-13T13:53:56-07:00

Python recipe 577694 by Georges Martin (configparser, list, option). Revision 2.

Return a list from a ConfigParser option. By default, split on a comma and strip whitespaces.

Sublists (Python)

2010-12-21T16:28:20-08:00

Python recipe 577510 by Michael Puckett (grouping, list, sublist).

The opposite of list flattening.

Given a list and a length n return a list of sub lists of length n.