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
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
