Lines Matching refs:MARK
102 MARK = '(' # push special markobject on stack
541 write(MARK + TUPLE)
560 write(MARK)
597 write(MARK + LIST)
631 write(MARK)
646 write(MARK + DICT)
678 write(MARK)
704 write(MARK)
850 self.mark = object() # any new unique object
862 # Return largest index k such that self.stack[k] is self.mark.
863 # If the stack doesn't contain a mark, eventually raises IndexError.
865 # the mark appears. For that matter, the latter stack would suffice,
866 # and we wouldn't need to push mark objects on self.stack at all.
868 # corrupt (or hostile) we may get a clue from finding self.mark embedded
872 mark = self.mark
874 while stack[k] is not mark: k = k-1
1041 # klass is the class to instantiate, and k points to the topmost mark
1187 mark = self.marker()
1188 list = stack[mark - 1]
1189 list.extend(stack[mark + 1:])
1190 del stack[mark:]
1203 mark = self.marker()
1204 dict = stack[mark - 1]
1205 for i in range(mark + 1, len(stack), 2):
1208 del stack[mark:]
1251 self.append(self.mark)
1252 dispatch[MARK] = load_mark
