Haskell Optimization Handbook
Table of Contents
前期准备
indices and tables
Table of Contents
前期准备
indices and tables
Quick search

Table of Contents

  • Preliminaries
  • Measurement, Profiling, and Observation
  • Optimizations
  • Case Studies

前期准备

  • 如何使用本书
  • 拖慢程序运行速度的原因

indices and tables

  • Glossary
  • Docs »
  • 3. Optimizations »
  • 3.4. Library Agnostic Changes
  • ← 3.3.1. Lower Impedance with Better Data Structures
  • 3.4.1. Ordering Data Constructors →

3.4. Library Agnostic Changes¶

  • 3.4.1. Ordering Data Constructors
  • 3.4.2. Wrangling Lazy Tuples
  • 3.4.3. Appropriate Folding
  • 3.4.4. Avoid Runtime Checks with Parse Don’t Validate:
  • 3.4.5. Using GHC.Exts
  • 3.4.6. Inlining Pragma and Friends
  • 3.4.7. Specialization
  • 3.4.8. Fusion and Rules
  • 3.4.9. Unboxing
  • 3.4.10. Unpacked Product Types
  • 3.4.11. Avoiding Nested Monad Transformers
  • 3.4.12. Unroll Monad Transformer Stacks
  • 3.4.13. The OneShot Monad Trick
  • 3.4.14. Continuation Passing Style
  • 3.4.15. Using Levity Polymorphism
  • 3.4.16. Using Backpack to Unroll Data Structures
  • ← 3.3.1. Lower Impedance with Better Data Structures
  • 3.4.1. Ordering Data Constructors →
© Copyright 2022-1980, Jeffrey Young (doyougnu).
Created using Sphinx 7.2.6 with Press Theme 0.8.0.