BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

427What Makes Functions First-Class
428Assigning Functions to Variables
429Passing Functions as Arguments
430Returning Functions from Functions
431Storing Functions in Data Structures
432Functions as Object Methods
433Anonymous Functions in Practice
434Named vs Anonymous Callbacks
435The Higher-Order Function Concept
436Composing Behavior with Functions
437Functions as Configuration
438First-Class Functions vs Other Languages
439What Makes a Function Higher-Order
440Array.prototype.map: The Basics
441Map's Callback Parameters
442Map Always Returns a New Array
443Chaining Map Operations
444Map vs ForEach
445Array.prototype.filter: The Basics
446Filter's Callback Parameters
447Filter Returns a Subset
448Combining Map and Filter
449Map and Filter with Arrow Functions
450Common Map Patterns
451Common Filter Patterns
452Performance Considerations
453What Reduce Does
454The Reducer Function Signature
455The Initial Value Argument
456Reducing Without an Initial Value
457Summing Numbers with Reduce
458Building Objects with Reduce
459Flattening Arrays with Reduce
460Implementing Map and Filter with Reduce
461Chaining Operations vs Single Reduce
462Reduce for Finding Max or Min
463Reduce with Async Operations
464ReduceRight for Right-to-Left
465When Reduce Hurts Readability
466The Every Method: Testing All Elements
467Every with Predicate Functions
468Short-Circuit Behavior in Every
469The Some Method: Testing Any Element
470Some with Predicate Functions
471Short-Circuit Behavior in Some
472The Find Method: Locating Elements
473Find vs Filter for Single Items
474The FindIndex Method
475FindLast and FindLastIndex
476Combining Every, Some, and Find
477What is Function Composition?
478Manual Composition with Nested Calls
479The compose Helper Function
480The pipe Helper Function
481Composing with Array Methods
482Point-Free Style with Composition
483Composition with Arity and Currying
484Debugging Composed Functions
485When Composition Helps vs Hurts

427What Makes Functions First-Class
428Assigning Functions to Variables
429Passing Functions as Arguments
430Returning Functions from Functions
431Storing Functions in Data Structures
432Functions as Object Methods
433Anonymous Functions in Practice
434Named vs Anonymous Callbacks
435The Higher-Order Function Concept
436Composing Behavior with Functions
437Functions as Configuration
438First-Class Functions vs Other Languages
439What Makes a Function Higher-Order
440Array.prototype.map: The Basics
441Map's Callback Parameters
442Map Always Returns a New Array
443Chaining Map Operations
444Map vs ForEach
445Array.prototype.filter: The Basics
446Filter's Callback Parameters
447Filter Returns a Subset
448Combining Map and Filter
449Map and Filter with Arrow Functions
450Common Map Patterns
451Common Filter Patterns
452Performance Considerations
453What Reduce Does
454The Reducer Function Signature
455The Initial Value Argument
456Reducing Without an Initial Value
457Summing Numbers with Reduce
458Building Objects with Reduce
459Flattening Arrays with Reduce
460Implementing Map and Filter with Reduce
461Chaining Operations vs Single Reduce
462Reduce for Finding Max or Min
463Reduce with Async Operations
464ReduceRight for Right-to-Left
465When Reduce Hurts Readability
466The Every Method: Testing All Elements
467Every with Predicate Functions
468Short-Circuit Behavior in Every
469The Some Method: Testing Any Element
470Some with Predicate Functions
471Short-Circuit Behavior in Some
472The Find Method: Locating Elements
473Find vs Filter for Single Items
474The FindIndex Method
475FindLast and FindLastIndex
476Combining Every, Some, and Find
477What is Function Composition?
478Manual Composition with Nested Calls
479The compose Helper Function
480The pipe Helper Function
481Composing with Array Methods
482Point-Free Style with Composition
483Composition with Arity and Currying
484Debugging Composed Functions
485When Composition Helps vs Hurts

Lesson 452 of 2,723·12. Higher-Order FunctionsPro lesson

Performance Considerations

When multiple passes are acceptable and when to consider a single loop for efficiency.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course