Listing 2 shows two different serializations of the same linked list data structure serialized according to SOAP Encoding rules.
清单2展示了根据SOAPEncoding规则对相同链表数据结构进行序列化的2种不同的序列化。
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”的变量。
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。
Listing 20 shows a new version of the function that takes advantage of several list data structures and the various list-manipulation functions described earlier.
清单20显示了修改后的函数，它利用了几个列表数据结构和前面描述的各种列表操作函数的优势。
If you develop your own interface, there are several different ways to retrieve list data, each with different performance characteristics.
假设你开发自己的接口，有几种不同的检索列表数据的方式，这些不同的方式也具有不同的性能特点。
The solver of this software uses the linked list data structure to store the global stiffness matrix, which is efficient in storage and calculation.
本文的计算软件采用动态链表数据结构存贮总体刚度矩阵，具有很高的存贮和计算效率。
The returned WSDL document contains all of the necessary technical information needed to invoke the Web service (parameter list, data types, and so on).
返回的WSDL文档包含调用Web服务所需的所有必要的技术信息(参数列表、数据类型等)。
The returned WSDL document contains all of the necessary technical information needed to invoke the Web service (parameter list, data types, and so on).
返回的WSDL文档包含调用Web服务所需的所有必要的技术信息(参数列表、数据类型等)。
应用推荐