2014
Pluralsight
Kit Eason
3h 44m
English
This course describes the important data structures - especially collections - available in F#, together with the functions which F# provides for working with them.
F# and .NET provide you with a wealth of data structures and collections for storing and manipulating data. This course identifies these structures and the functions which F# provides to work with them, including arrays, lists, and sequences. By the end of the course you'll know how to write idiomatic, maintainable programs which solve complex problems with simple code.
01. Introduction 00:13:15
01. Why Functional Data Structures Matter 01:57
02. What Is a Functional Data Structure? 01:45
03. Prerequisites: F# Interactive (FSI) 01:40
04. Prerequisites: The let Keyword 02:20
05. Prerequisites: The Forward Pipe Operator |> 01:45
06. Prerequisites: Tuples 01:13
07. Prerequisites: Records 01:30
08. Summary 01:01
02. Arrays 00:41:49
01. Introduction 01:18
02. Creating an Array 06:56
03. Accessing Array Elements 02:33
04. The Array Module 01:47
05. Array.map 03:23
06. Array.mapi 02:07
07. Array.iter and Array.filter 03:42
08. Option Data Type and Array.choose 03:27
09. Array.sum, Array.sumBy, Array.sort, and Array.sortBy 04:00
10. Array.reduce 04:04
11. Array.fold 02:43
12. Array.zip 02:27
13. Multi-Dimensional and Jagged Arrays 02:12
14. Summary 01:02
03. Sequences 00:49:35
01. Introduction 00:57
02. Creating Sequences 03:52
03. Using Seq.unfold 06:54
04. Collections as Sequences 01:48
05. More on Sequence Expressions 05:54
06. Accessing Sequence Elements 03:24
07. Searching Within Sequences 08:48
08. Grouping Sequences 07:14
09. Seq.pairwise, Seq.windowed and Seq.collect 07:21
10. Sequences: The Tradeoffs 02:08
11. Summary 01:08
04. Lists 00:12:07
01. Introduction 01:30
02. Creating Lists 02:10
03. Accessing List Elements 02:29
04. The List Module 01:02
05. List Mutability 01:33
06. Combining Lists 01:10
07. Performance of List Operations 01:11
08. Summary 00:59
05. Lists, Pattern Matching, and Recursion 00:16:52
01. Introduction 00:51
02. Pattern Matching 10:15
03. Recursive List Traversal 05:02
04. Summary 00:43
06. Dictionaries 00:22:05
01. Introduction 00:36
02. Dictionary Basics 04:29
03. Using dict for Immutable Style 03:39
04. In-Depth Demo - Mutable Style 03:15
05. In-Depth Demo - Immutable Style 03:47
06. Dictionary and Concurrency 05:11
07. Summary 01:06
07. Sets and Maps 00:19:57
01. Introduction 01:16
02. Creating Sets 03:56
03. The Set Module and Set Operations 05:22
04. Hidden Mutability 03:10
05. Maps 01:57
06. Choosing Which Lookup to Use 02:30
07. Summary 01:42
08. Trees 00:15:42
01. Introduction 01:09
02. Trees Using Recursive OO Types 03:12
03. Discriminated Unions 01:07
04. Trees and Discriminated Unions 07:41
05. Choosing a Tree Representation 01:32
06. Summary 00:59
09. Choosing a Data Structure 00:33:10
01. Introduction 01:34
02. Choosing a Data Structure for Productivity 03:18
03. Type Providers 06:42
04. Choosing a Data Structure for Reliability 02:41
05. Making Illegal States Unrepresentable 07:38
06. Choosing a Data Structure for Maintainability 03:46
07. Choosing a Data Structure for Performance 01:53
08. The Array.parallel Module 02:43
09. Principles of Performance 00:54
10. Summary 01:56
http://pluralsight.com/
Download File Size:588.48 MB
|
