Module Assign NameStore Str Expr Str ImportFrom alias ImportFrom alias FunctionDef arguments args NameParam NameParam defaults body Assign NameStore Call NameLoad Assign NameStore Call NameLoad Assign NameStore AttributeLoad NameLoad attr While NameLoad body Assign NameStore AttributeLoad NameLoad attr If CompareLt NameLoad NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad orelse If CompareGt NameLoad NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad Assign NameStore AttributeLoad NameLoad attr Expr Call AttributeLoad NameLoad attr NameLoad Assign NameStore AttributeLoad NameLoad attr While NameLoad body Expr Call AttributeLoad NameLoad attr AttributeLoad NameLoad attr Assign NameStore AttributeLoad NameLoad attr Return NameLoad decorator_list If CompareEq NameLoad Str body Assign NameStore Call NameLoad Assign NameStore ListLoad Num Num Num Num Num Num Num Num Num For NameStore NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad Print Str Expr Call AttributeLoad NameLoad attr Print Str Assign NameStore Call NameLoad NameLoad Num Expr Call AttributeLoad NameLoad attr
N/A N/A __author__ bt3 N/A  This function divides a linked list in a value, where everything smaller than this value
    goes to the front, and everything large goes to the back: linked_list_fifo LinkedListFIFO node Node partList N/A N/A ll n N/A N/A N/A more N/A LinkedListFIFO N/A less N/A LinkedListFIFO N/A node N/A ll head N/A node N/A N/A item N/A node value N/A N/A item n N/A N/A N/A N/A less addNode item N/A N/A N/A item n N/A N/A N/A N/A more addNode item N/A node N/A node pointer N/A N/A N/A less addNode n N/A nodemore N/A more head N/A nodemore N/A N/A N/A N/A less addNode N/A nodemore value N/A nodemore N/A nodemore pointer N/A less N/A N/A N/A __name__ __main__ N/A N/A ll N/A LinkedListFIFO N/A l N/A 6 7 3 4 9 5 1 2 8 N/A i l N/A N/A N/A N/A ll addNode i N/A Before Part N/A N/A N/A ll _printList N/A After Part N/A newll N/A partList ll 6 N/A N/A N/A newll _printList