Media Summary: Defining a persistent stack data structure as an Definitions of module types for the stack and queue modules developed in previous videos Textbook: ... Defining module types with signatures Textbook:
Functors Ocaml Programming Chapter 5 - Detailed Analysis & Overview
Defining a persistent stack data structure as an Definitions of module types for the stack and queue modules developed in previous videos Textbook: ... Defining module types with signatures Textbook: Comparing the difference between `open` and `include` in modules Textbook: Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... How to implement queues functionally, and how to improve efficiency by using two lists instead of one. Note that the textbook now ...
The `include` statement enables re-use of implementation and interface code as a kind of "smart copy and paste" Textbook: ... Using abstract types to achieve encapsulation in data structures Textbook: How to define modules with structures Textbook: The tradeoffs between data structure operations that raise exceptions vs. returning options, and some application operators that ... How to implement the `fold_left` and `fold_right` functionals on lists. Textbook:
