Of course , in known contexts such as array subscripts , the compiler is free to optimize away the actual construction of sublists where that ' s unnecessary 当然,在像数组下标这样的已知上下文中,编译器会优化掉实际不必要的子列表结构。
We can now modify our script further to read these machine names into a list structure , and connect to the registries of each one in turn 现在我们可以进一步修改脚本以把这些机器名读取到一个列表结构中,并轮流连接到每台机器的注册表。
It may appear that the list structure can handle only linearly sequenced values , but they can also handle " inverted trees " by using shared sublists - this is not what i m discussing here 可能看起来列表结构只能处理线性排列的值,但是,通过使用共享子列表,它们也可以处理“反转树( inverted tree ) ”在这里我没有对这一内容进行讨论。
With the booming of the requirement of network management , network intrusion detection arid qos , a new fast scalable multi - dimension packet classification algorithms , based on pcbnp , rfc and regional partition algorithm , is given in this paper 该算法通过压缩、分割和索引操作,设计了压缩分割规则表和索引列表结构表这两类数据存储结构,能支持上万条多维分类规则,分类速度快、存储空间小、支持快速更新。