万本电子书0元读

万本电子书0元读

顶部广告

Learning F# Functional Data Structures and Algorithms电子书

售       价:¥

4人正在读 | 0人评论 9.8

作       者:Adnan Masood

出  版  社:Packt Publishing

出版时间:2015-06-29

字       数:60.4万

所属分类: 进口书 > 外文原版书 > 电脑/网络

温馨提示:数字商品不支持退换货,不提供源文件,不支持导出打印

为你推荐

  • 读书简介
  • 目录
  • 累计评论(0条)
  • 读书简介
  • 目录
  • 累计评论(0条)
If you have just started your adventure with F#, then this book will help you take the right steps to become a successful F# coder. An intermediate knowledge of imperative programming concepts, and a basic understanding of the algorithms and data structures in .NET environments using the C# language and BCL (Base Class Library), would be helpful.
目录展开

Learning F# Functional Data Structures and Algorithms

Table of Contents

Learning F# Functional Data Structures and Algorithms

Credits

Foreword

Foreword

Foreword

About the Author

Acknowledgments

About the Reviewers

www.PacktPub.com

Support files, eBooks, discount offers, and more

Why subscribe?

Free access for Packt account holders

Preface

What this book covers

What you need for this book

Who this book is for

Conventions

Reader feedback

Customer support

Downloading the example code

Errata

Piracy

Questions

1. Embrace the Truth

Exploring the functional programming paradigm

Thinking functional – why functional programming matters

A historical primer of F#

The Hello World example

A brief F# language primer

Syntactical similarities and differences

Benefits of using F# over C#

Summary

2. Now Lazily Get Over It, Again

Setting up the IDE

Your first F# project

Talk is cheap, show me some code

To understand recursion, you must understand recursion

Memoization with Fibonacci

Towers of Hanoi

Sorting lazily

F# 4.0 – new features

Summary

3. What's in the Bag Anyway?

Exploring data structures in F#

Arrays

Lists

List comprehensions

Sequences

Tuples and records

Option types

Sets and maps

Discriminated unions

The active pattern

F# implementation of sorting algorithms

Algorithmic complexity and the Big-O notation

The bubble sort

Quicksort

The merge sort

Summary

4. Are We There Yet?

Diving deep into enumerations and sequences

Enumerating a CSV file

Query expressions

Creating sequences from collections

Usage considerations for sequences

Summary

5. Let's Stack Up

Let's build a stack

Stack with concurrency support

Testing the stack

Algorithm – parenthesis matching using stacks

Summary

6. See the Forest for the Trees

Tree as a data structure

The binary search tree

Navigating the tree

Abstract syntax trees

Summary

7. Jumping the Queue

Let's make a functional queue

The FSharpx.Collections library

The MailboxProcessor class in F#

Summary

8. Quick Boost with Graph

Graphs

Modeling graphs using F#

The shortest path algorithm

Finding the minimal path sum

Summary

9. Sets, Maps, and Vectors of Indirections

Sets and maps

Vectors

F# and the Intermediate Language

Summary

10. Where to Go Next?

References and further readings

F# language resources

Component design guidelines

Functional programming guides

F# for fun and profit

Data science with F#

Math and statistics programming with F#

Machine learning with F#

Books and interactive tutorials

Try F#

The F# programming wikibook

The F# workshop

The F# cheat sheet

Video tutorials

Community projects – development tools

Community projects – functional programming

Community projects – data science programming

Community projects – the GPU execution

General functional programming

Academic resources

Summary

Index

累计评论(0条) 0个书友正在讨论这本书 发表评论

发表评论

发表评论,分享你的想法吧!

买过这本书的人还买过

读了这本书的人还在读

回顶部