iterable

I have a bunch of context managers that I want to chain. On the first glance, contextlib.nested looked like a fitting solution. However, this method is flagged as deprecated in the documentation which also states that the latest with statement allows this directly: Deprecated since version 2.7: The with-statement now supports this functionality directly (without the confusing error prone quirks). However I could not get Python 3.4.3 to use a dynamic iterable of context managers: class Foo(): def __enter__(self): print('entering:', self.name) return self def __exit__(self, *_): pass def __init_

Hello my fellow programmers. I am a fairly new programmer, and now I am facing a great predicament. I am getting the error: can only assign an iterable Firstly I don't know what that means. Secondly I will leave my code for you professionals to critique it: def num_top(int_lis): duplic_int_lis = int_lis int_firs= duplic_int_lis [0] int_lis[:] = duplic_int_lis [int_firs] Basically I am trying to find the [0] element in the list and then using that int as an index position to find the integer at that index position. int_lis[:] = duplic_int_lis [int_firs] means assign all the items of duplic_int

Im trying to write a function that takes a list and can print the lowest integer that is within that list. Now i'm trying to figure out what to do where this works with nested lists that if the lowest number is within one of those nested lists then overall it will print that number. My code is here: def listMin(): list2 = [3,4,[2,99,8],7] for i in range (len(list2)): if type(list2[i]) == type([]): y=min(i) list2.append(y) print "hello" if len(list2)== 0: return None else: x= min(list2) print x listMin() while this seems like it should print the number 2 it doesnt and just gives me an error

A recent similar question ( isinstance(foo, types.GeneratorType) or inspect.isgenerator(foo)? ) got me curious about how to implement this generically. It seems like a generally-useful thing to have, actually, to have a generator-type object that will cache the first time through (like itertools.cycle ), report StopIteration, and then return items from the cache next time through, but if the object isn't a generator (i.e. a list or dict that inherently supports O(1) lookup), then don't cache, and have the same behaviour, but for the original list. Possibilities: 1) Modify itertools.cycle. It

Python list comprehension is really simple: >>> l = [x for x in range(1, 10) if x % 2 == 0] >>> [2, 4, 6, 8] Does Rust have an equivalent syntax like: let vector = vec![x for x in (1..10) if x % 2 == 0] // [2, 4, 6, 8] You can just use iterators: fn main() { let v1 = (0u32..9).filter(|x| x % 2 == 0).map(|x| x.pow(2)).collect::<Vec<_>>(); let v2 = (1..10).filter(|x| x % 2 == 0).collect::<Vec<u32>>(); println!("{:?}", v1); // [0, 4, 16, 36, 64] println!("{:?}", v2); // [2, 4, 6, 8] } Jacob Krall cute is a macro for Python-esque list and dictionary ( HashMap ) comprehensions in Rust. #[macro_use