• Lists are linked lists of atoms, lists, or both.

    列表原子表,或者是列表的列表,或者两者兼备

    youdao

  • These registers point to linked lists in memory.

    这些寄存器指向内存

    youdao

  • For example, linked lists are defined in terms of themselves.

    例如就是根据本身定义出来

    youdao

  • Let's look at a few examples of recursive functions on linked lists.

    我们来看一些基于递归函数示例

    youdao

  • An abbreviation for the type of immutable singly-linked lists.

    不可变单向链接列表类型缩写词。

    youdao

  • If the two linked lists have no intersection at all, return null.

    问题描述:找出两个相交的地方。

    youdao

  • Their values are stored on singly-linked lists of overflow pages.

    它们的也会存储溢出单项链上。

    youdao

  • You are given two linked lists representing two non-negative numbers.

    给定分别代表组非负数字

    youdao

  • One advantage of linked lists is that you can use them to avoid locking situations.

    优势之一可以使用它们避免锁定状态

    youdao

  • This is a data structure algorithms, the use of linked lists of nature to a...

    数据结构算法利用一些性质实现这一现象。

    youdao

  • It is a dynamic circular chain that formed by sequent lists and linked lists alternately.

    结构顺序表交叉构造形成的一种动态循环表。

    youdao

  • Although manual memory management with linked lists is possible, it is not a very friendly task.

    尽管使用人工管理内存可行的,但那不是一件非常容易的工作

    youdao

  • Singly linked lists are a powerful abstraction that allow you to represent numerous types of data.

    单链可以描述多种类型数据一种有效抽象

    youdao

  • Now that you have a handle on linked lists, you should be aware of a few interesting properties of lists that you will exploit.

    既然已经了解了,那么您应该意识到将要使用列表一些有趣的属性

    youdao

  • Program using Pointers, linked lists, arrays, structures, and other knowledge, can be applied to a small management software.

    程序了指针数组结构体知识点运用管理软件。

    youdao

  • The most common use for generic classes is with collections like linked lists, hash tables, stacks, queues, trees, and so on.

    泛型用于集合链接列表哈希堆栈队列

    youdao

  • In theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.

    理论上一个非常简单构造就是数组集合划分有限数量的存储体中。

    youdao

  • In your computer science classes, you learned about different types of lists: arrays, hash maps, linked lists, stacks, queues, and so on.

    计算机科学课程中曾学不同类型列表数组哈希影射堆栈队列等等

    youdao

  • It is perfectly safe to use kernel linked lists in interrupt context, but but retrieving anything in interrupt handlers is a bad idea.

    绝对安全使用内核中断上下文检索任何中断处理程序一个主意。

    youdao

  • They can be expressed as ordered vectors, unordered groups, linked lists, trees, graphs or other forms that the programming language supports.

    它们可以表示有序向量无序的编程语言支持的其他形式

    youdao

  • Since a NULL pointer terminates a list, we can also use the NULL pointer condition as a base case for many of our recursive functions on linked lists.

    由于NULL指针结束一个所以我们可以使用 NULL 指针条件作为基于链表很多归程序的基线条件。

    youdao

  • I won't spend much time analyzing these operations, because my approach to linked lists will be from a different perspective (which I'll explain later).

    不会太多时间来分析这些操作因为方法是从一个角度使用链(稍后进行解释)。

    youdao

  • For example, if it's a console company and they mainly use c, be ready to answer questions on linked lists, memory usage, and other low level questions.

    举例来说,如果一家游戏主机开发公司他们主要使用C语言,那你就要准备回答内存管理之类底层的问题。

    youdao

  • Libraries of common data structures, like linked lists and grow-able arrays, can remove much of the burden of having to deal with low-level details.

    通用数据结构可增长阵列组成的减轻了由于处理低层细节负担

    youdao

  • On the basis of class and in accordance with the level structure and the inheritance relation of class, a rule base is constructed by using linked lists.

    基础根据层次结构继承关系来构造规则

    youdao

  • Package provides an implementation based on linked lists of objects (the "ll" part of the package name). There are also extensions of both the basic org.apache.axiom.om.

    有关更一般用法,or g . apache . axiom . om . impl . llom提供了一种基于对象实现(包中的ll”表示链表(linked list))。

    youdao

  • So for example, instead of concurrent linked lists, we use dual concurrent lock circular arrays, so we have the benefits of non blocking concurrency without object creation.

    因此相对并发我们采用二重并发循环数组(dual concurrent lock circular arrays),这样无需创建对象就能享受到阻塞并发带来好处

    youdao

  • The new additions to SPL add some useful functionality to PHP that is easy to use, as well as implementations of data structures, such as doubly linked lists, stacks, heaps, and queues.

    SPL中的补充php添加了一些有用的并且易于使用功能以及数据结构实现例如双重链接列表队列

    youdao

  • The new additions to SPL add some useful functionality to PHP that is easy to use, as well as implementations of data structures, such as doubly linked lists, stacks, heaps, and queues.

    SPL中的补充php添加了一些有用的并且易于使用功能以及数据结构实现例如双重链接列表队列

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定