Kotlin Language Documentation 1.3
Transformations Filtering plus and minus Operators Grouping Retrieving Collection Parts Retrieving Single Elements Collection Ordering Collection Aggregate Operations 121 126 128 129 136 137 139 144 149 Interacting with DOM elements. Kotlin provides a series of statically typed interfaces to interact with the Document Object Model, allowing creation and update of DOM elements. Interacting with graphics graphics such as WebGL. You can use Kotlin to create graphical elements on a web page using WebGL. Creating Kotlin code that targets server-side JavaScript Working with server-side technology. You can0 码力 | 597 页 | 3.61 MB | 1 年前3Go 101 (Golang 101) v1.21.0
to compile and run Go programs. Become Familiar With Go Code §4. Introduction of Source Code Elements §5. Keywords and Identifiers §6. Basic Types and Their Value Literals §7. Constants and Variables you enjoy them.) Introduction to Source Code Elements Go is known for its simple and clean syntax. This article introduces the common source code elements in programming through a simple example. This This will help new gophers (Go programmers) get a basic idea of the usage of Go elements. Programming and Source Code Elements Programming can be viewed as manipulating operations in all kinds of ways to0 码力 | 610 页 | 945.17 KB | 1 年前3Data Structures That Make Video Games Go Round
high. 2 High variance. Elements are widely distributed between buckets.Open Addressing Hash Maps ● Simplest implementation only require a contiguous block of memory. ● Elements are more densely packed Addressing Hash Maps ● Simplest implementation only require a contiguous block of memory. ● Elements are more densely packed. ● Better cache performance. ● Collisions are resolved via probing. metadata about it’s probe sequence length, PSL and is defaulted to some value. 2. On insert, elements start with a PSL value of 0. 3. PSL of the inserted element is compared to the PSL of the bucket0 码力 | 196 页 | 3.03 MB | 5 月前3Go 101 (Golang 101) v1.21.0
how to compile and run Go programs. Become Familiar With Go Code §4. Introduction of Source Code Elements §5. Keywords and Identifiers §6. Basic Types and Their Value Literals §7. Constants and Variables enjoy them.) Introduction to Source Code Elements Go is known for its simple and clean syntax. This article introduces the common source code elements in programming through a simple example. This This will help new gophers (Go programmers) get a basic idea of the usage of Go elements. Programming and Source Code Elements Programming can be viewed as manipulating operations in all kinds of ways to0 码力 | 880 页 | 833.34 KB | 1 年前3Go 101 (Golang 101) v1.21.0
how to compile and run Go programs. Become Familiar With Go Code §4. Introduction of Source Code Elements §5. Keywords and Identifiers §6. Basic Types and Their Value Literals §7. Constants and Variables Introduction to Source Code Elements 16 Introduction to Source Code Elements Go is known for its simple and clean syntax. This article introduces the common source code elements in programming through This will help new gophers (Go programmers) get a basic idea of the usage of Go elements. Programming and Source Code Elements Programming can be viewed as manipulating operations in all kinds of ways to0 码力 | 630 页 | 3.77 MB | 1 年前3Back to Basics: Classic 9STL
Steagall Rationale • Data is almost always collections of elements • A virtually infinite number of data element types • Each collection of elements has some representation • A large number of possible O(1) Independent of number of elements Logarithmic O(log(n)) Increases logarithmically with the number of elements Linear O(n) Increases linearly with the number of elements N-log-N O(n*log(n)) Increases 2021 Bob Steagall Key Principles • Containers store collections of elements • Algorithms perform operations upon collections of elements • Containers and algorithms are entirely independent • Iterators0 码力 | 75 页 | 603.36 KB | 5 月前3Computer Programming with the Nim Programming Language
units encased in black plastic with some electrical contacts. The devices can contain all necessary elements, i.e., the CPU, some RAM, and persistent storage that can store programs and data when no electric data type is not only crucial for arithmetic operations, but it is also used as an index to access elements in data structures such as arrays. Furthermore, integer numbers are often interpreted as bit vectors frequently seen and often works, but not always. Imagine you write a program that processes chemical elements, and you work with atomic mass and radii. Consequently, the result of the above test could imply0 码力 | 865 页 | 7.45 MB | 1 年前3Computer Programming with the Nim Programming Language
units encased in black plastic with some electrical contacts. The devices can contain all necessary elements, i.e., the CPU, some RAM, and persistent storage that can store programs and data when no electric data type is not only crucial for arithmetic operations, but it is also used as an index to access elements in data structures such as arrays. Furthermore, integer numbers are often interpreted as bit vectors frequently seen and often works, but not always. Imagine you write a program that processes chemical elements, and you work with atomic mass and radii. Consequently, the result of the above test could imply0 码力 | 784 页 | 2.13 MB | 1 年前3Kotlin Language Documentation 1.9.20
String literals String templates Arrays When to use arrays Create arrays Access and modify elements Work with arrays Primitive-type arrays What's next? Type checks and casts is and !is operators Sequences Removal of elements from a list Traverse a map Get the first and the last items of a possibly empty collection Create a set from a list Group elements Filter elements Collection transformation What's next? Collections overview Collection types Constructing collections Construct from elements Create with collection builder functions Empty collections Initializer functions for lists Concrete0 码力 | 1299 页 | 32.44 MB | 1 年前3Modern C++ Iterators
Loop Over Arrays • Two ways to iterate over the elements of an array – Using indexes – Using pointers int arr[] = {10, 20, 30, 40}; // iterate over elements with index: for (int i = 0; i < 4; ++i) { std::cout std::cout << arr[i] << '\n'; } // iterate over elements with pointer: for (int* p = arr; p < arr + 4; ++p) { std::cout << *p << '\n'; } Output: 10 20 30 40 10 20 30 40 30 40 10 20 arr: arr arr+2 josuttis.com 5 C++ Iterators: Generalization of Pointers that Iterate • Iterate like a pointer over elements – From begin() til end() std::vectorv{10, 20, 30, 40, 50, 60, 70}; for (std::vector ::iterator 0 码力 | 24 页 | 1.93 MB | 5 月前3
共 1000 条
- 1
- 2
- 3
- 4
- 5
- 6
- 100