Skip to main content

Home/ Mac Attack/ Group items tagged None

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Benjamin Bandt-Horn

python - Difference between "if x" and "if x is not None" - Stack Overflow - 0 views

stackoverflow.com/...ween-if-x-and-if-x-is-not-none

python None

shared by Benjamin Bandt-Horn on 30 Dec 13 - No Cached
  • Benjamin Bandt-Horn on 30 Dec 13
     
    In the following cases: test = False test = "" test = 0 test = 0.0 test = [] test = () test = {} test = set() the if test will differ: if test:#False if test is not None:#True
Benjamin Bandt-Horn

Map. - 0 views

docs.python.org/...node81.html

python map List Comprehensions

shared by Benjamin Bandt-Horn on 14 Dec 13 - No Cached
  • Benjamin Bandt-Horn on 14 Dec 13
     
    Combining these two special cases, we see that map(None, list1, list2) is a convenient way of turning a pair of lists into a list of pairs. For example:         >>> seq = range(8)        >>> map(None, seq, map(lambda x: x*x, seq))        [(0, 0), (1, 1), (2, 4), (3, 9), (4, 16), (5, 25), (6, 36), (7, 49)]        >>>
Benjamin Bandt-Horn

python - if A vs if A is not None: - Stack Overflow - 0 views

stackoverflow.com/...if-a-vs-if-a-is-not-none

python __nonzero__ None

shared by Benjamin Bandt-Horn on 30 Dec 13 - No Cached
  • Benjamin Bandt-Horn on 30 Dec 13
     
    The statement if A: will call A.__nonzero__()
Benjamin Bandt-Horn

Binary Search Tree library in Python | Laurent Luce's Blog - 0 views

www.laurentluce.com/...-search-tree-library-in-python

binary tree python

shared by Benjamin Bandt-Horn on 27 Dec 13 - No Cached
  • This article is about a Python library I created to manage binary search trees. I will go over the following: Node class Insert method Lookup method Delete method Print method Comparing 2 trees Generator returning the tree elements one by one
  • https://laurentluce@github.com/laurentluce/python-algorithms.git
  • binary search tree
  • ...5 more annotations...
  • Delete method
  • There are 3 possibilities to handle: 1- The node to remove has no child. 2- The node to remove has 1 child. 3- The node to remove has 2 children.
  • look for its successor by going right then left until we reach a leaf
  • if node is None:
  • ‘A’ < ‘B’ is True in Python.
  • Benjamin Bandt-Horn on 27 Dec 13
     
    This article is about a Python library I created to manage binary search trees. I will go over the following: Node class Insert method Lookup method Delete method Print method Comparing 2 trees Generator returning the tree elements one by one
1 - 4 of 4
Showing 20▼ items per page