Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
mklist va_alist
Creating emptylist
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
mklist va_alist
Creating emptylist
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
length count = 2dump_info(v) = OpridNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = ConsNode__state
list to array count = 2 v = OpridNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
length count = 3dump_info(v) = OpridNode__state
length count = 4dump_info(v) = ConsNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 4 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
list to array count = 3 v = OpridNode__state
list to array count = 4 v = ConsNode__state
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = GuardedElementNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = UQStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
Creating emptylist
Creating emptylist
addright dump_info(e) = GuardedElementNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = GuardedListNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = GuardedListNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = GuardedListNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = GuardedListNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = FConstruction__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = FConstruction__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = FConstruction__state
mklist va_alist
Creating emptylist
addright dump_info(e) = FConstruction__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
Creating emptylist
IN SPLIT
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
Creating emptylist
IN SPLIT
is empty l.lh_first TRUE
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = QStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = QStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = QStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = QStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = LetterId__state
length count = 4dump_info(v) = ListHeaderNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 4 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = LetterId__state
list to array count = 4 v = ListHeaderNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = BlDenotationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = BlDenotationNode__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = BlDenotationNode__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = QStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = QStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = QStrNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = QStrNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
Creating emptylist
is empty l.lh_first TRUE
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
length count = 2dump_info(v) = ConsNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = GuardedElementNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = LoopDenotationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LoopDenotationNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = LoopDenotationNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = LoopDenotationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
Creating emptylist
Creating emptylist
mklist va_alist
Creating emptylist
addright dump_info(e) = BlDenotationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = BlDenotationNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = BlDenotationNode__state
mklist va_alist
Creating emptylist
addright dump_info(e) = BlDenotationNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
