Listing 2 shows two different serializations of the same linked list data structure serialized according to SOAP Encoding rules.
清单2展示了根据SOAPEncoding规则对相同链表数据结构进行序列化的2种不同的序列化。
To illustrate the problem, imagine a Web service that returns a linked list data structure which we serialize to XML using the SOAP Section 5 Encoding rules.
要说明这个问题，请想象一个Web服务，它返回一个链表数据结构，我们可以使用SOAPSection5Encoding规则将次结构序列化为XML。
The solver of this software uses the linked list data structure to store the global stiffness matrix, which is efficient in storage and calculation.
本文的计算软件采用动态链表数据结构存贮总体刚度矩阵，具有很高的存贮和计算效率。
Making a basic linked-list data structure persistent is the easiest exercise; here, a list in Clojure is bound to a var named "a".
持久化基本链表数据结构是最简单的；在这里，Clojure中的一个列表绑定到一个名为“a”的变量。
Making a basic linked-list data structure persistent is the easiest exercise; here, a list in Clojure is bound to a var named "a".
持久化基本链表数据结构是最简单的；在这里，Clojure中的一个列表绑定到一个名为“a”的变量。
应用推荐