BOTTOM TWO PAIR 两底对
Cons (which stands for construct) takes two arguments, the node data and the list that the bottom half of the pair will point to.
cons(代表construct)获得两个参数,即节点数据以及pair的下半部分将要指向的列表。
Scheme defines a list as being either the null list or a pair whose bottom half is a list.
Scheme将一个列表定义为一个空列表,或者是一个下半部分为某个列表的pair。
They are slightly different from the node structures I showed you in c, above, because the bottom half of a pair doesn't have to be a pointer to a list node.
它们与前面我向您介绍的c中的节点结构稍有不同,因为一个pair的下半部分不必是一个指向某个列表节点的指针。
应用推荐