4. Advanced Development

• 4.1. Advanced Types
  • 4.1.1. Single Number Types
  • 4.1.2. Vector Types
  • 4.1.3. Range
  • 4.1.4. Bounds
  • 4.1.5. Index Ranges
  • 4.1.6. Traits
  • 4.1.7. List Templates
  • 4.1.8. Pair
  • 4.1.9. Tuple
  • 4.1.10. Error Codes
• 4.2. Logging
  • 4.2.1. Initializing Logging
  • 4.2.2. Logging Levels
  • 4.2.3. Log Entries
  • 4.2.4. Helper Functions
• 4.3. Worklet Types
  • 4.3.1. Field Map
  • 4.3.2. Topology Map
  • 4.3.3. Neighborhood Mapping
  • 4.3.4. Reduce by Key
• 4.4. Extended Filter Implementations
  • 4.4.1. Deriving Fields from other Fields
  • 4.4.2. Deriving Fields from Topology
  • 4.4.3. Data Set Filters
  • 4.4.4. Data Set with Field Filters
• 4.5. Worklet Error Handling
• 4.6. Math
  • 4.6.1. Basic Math
  • 4.6.2. Vector Analysis
  • 4.6.3. Matrices
  • 4.6.4. Newton’s Method
• 4.7. Working with Cells
  • 4.7.1. Cell Shape Tags and Ids
  • 4.7.2. Parametric and World Coordinates
  • 4.7.3. Interpolation
  • 4.7.4. Derivatives
  • 4.7.5. Edges and Faces
• 4.8. Memory Layout of Array Handles
  • 4.8.1. Basic Memory Layout
  • 4.8.2. Structure of Arrays
  • 4.8.3. Strided Arrays
  • 4.8.4. Runtime Vec Arrays
  • 4.8.5. Recombined Vec Arrays of Strided Components
• 4.9. Fancy Array Handles
  • 4.9.1. Constant Arrays
  • 4.9.2. Viewing a Subset of an Array
  • 4.9.3. Counting Arrays
  • 4.9.4. Cast Arrays
  • 4.9.5. Discard Arrays
  • 4.9.6. Permuted Arrays
  • 4.9.7. Zipped Arrays
  • 4.9.8. Coordinate System Arrays
  • 4.9.9. Composite Vector Arrays
  • 4.9.10. Extract Component Arrays
  • 4.9.11. Swizzle Arrays
  • 4.9.12. Grouped Vector Arrays
  • 4.9.13. Random Arrays
• 4.10. Global Arrays and Topology
  • 4.10.1. Whole Arrays
  • 4.10.2. Atomic Arrays
  • 4.10.3. Whole Cell Sets
• 4.11. Execution Objects
  • 4.11.1. Interfaces to the Execution Environment
  • 4.11.2. Specifying Object Scope with Tokens
  • 4.11.3. Designing Execution Objects
• 4.12. Locators
  • 4.12.1. Cell Locators
  • 4.12.2. Point Locators