Python 实现带头尾指针的单向链表

#!/usr/bin/python 
# -*- coding: utf-8 -*-

'''
Created on 2015-1-22
@author: beyondzhou
@name: test_tailsinglelinkedlist.py
'''

def test_tailsinglelinkedlist():
    
    # import linkedlist
    from tailsinglelinkedlist import tailSingleLinkedList
    
    # init a linkedlist named smith
    smith = tailSingleLinkedList()
    smith.add('CSCI-112')
    smith.add('MATH-121')
    smith.add('HIST-340')
    smith.add('ECON-101')
    
    # print smith
    print 'primary smith'
    for item in smith:
        print item
        
    # remove one item
    smith.remove('HIST-340')
    
    # print smith
    print '\ndeleted smith'
    for item in smith:
        print item
        
    # pring length
    print '\nlenght of smith'
    print len(smith)
    
    # check whether not in
    print '\ncheck whether not in'
    print 'abc' in smith
 
    # check whether in
    print '\ncheck whether in'
    print 'ECON-101' in smith       
        
if __name__ == "__main__":
    test_tailsinglelinkedlist()

# Implements the linked list
class tailSingleLinkedList:
    # constructs an empty linked list
    def __init__(self):
        self._head = None
        self._tail = None
        self._size = 0

    # Returns the number of items in the linked list
    def __len__(self):
        return self._size

    # Determines if an item is contained in the linked list
    def __contains__(self, target):
        curNode = self._head
        while curNode is not None and curNode.item != target:
            curNode = curNode.next
        return curNode is not None

    # Adds a new item to the linked list
    def add(self, item):
        newNode = _TailLinkedListNode(item)
        if  self._head is None:
            self._head = newNode
        else:
            self._tail.next = newNode
        self._tail = newNode
        self._size += 1

    # Removes an instance of the item from the linked list
    def remove(self, item):
        predNode = None
        curNode = self._head
        while curNode is not None and curNode.item != item:
            predNode = curNode
            curNode = curNode.next
        
        # The item has to be in the linked list to remove it
        assert curNode is not None, "The item must be in the linked list."
        
        # Unlink the node and return the item
        if curNode is not None:
            if curNode is self._head:
                self._head = curNode.next
            else:
                predNode.next = curNode.next
            if curNode is self._tail:
                self._tail = predNode

    # Returns an iterator for traversing the list of items
    def __iter__(self):
        return _TailLinkedListIterator(self._head)

# Defines a private storage clss for creating list nodes
class _TailLinkedListNode(object):
    def __init__(self, item):
        self.item = item
        self.next = None

# Defines a linked list iterator 
class _TailLinkedListIterator:
    def __init__(self, listHead):
        self._curNode = listHead

    def __iter__(self):
        return self

    def next(self):
        if self._curNode is None:
            raise StopIteration
        else:
            item = self._curNode.item
            self._curNode = self._curNode.next
            return item

primary smith
CSCI-112
MATH-121
HIST-340
ECON-101

deleted smith
CSCI-112
MATH-121
ECON-101

lenght of smith
4

check whether not in
False

check whether in
True