2 янв. 2016 г.
Swift Programming The Big Nerd Ranch Guide
eBook Details:
Paperback: 400 pages
Publisher: Big Nerd Ranch Guides; 1st edition
Language: English
ISBN-10: 0134398017
ISBN-13: 978-0134398013
iOS Programming: The Big Nerd Ranch Guide 5th Edition
Paperback: 416 pages
Publisher: Big Nerd Ranch Guides; 5th edition
Language: English
ISBN-10: 0134390733
ISBN-13: 978-0134390734
31 дек. 2015 г.
30 дек. 2015 г.
Advanced Swift (Prerelease-objc.io 2015)
In this book, we’ll write about advanced concepts in Swift programming. If you have read the Swift Programming Guide, and want to explore more, this book is for you.
Swift is a great language for systems programming, but also lends itself for very high-level programming. We’ll explore both high-level topics (for example, programming with generics and protocols), as well as low-level topics (for example, wrapping a C library and string internals).
Functional Swift
27 дек. 2015 г.
Learning Core Data for iOS with Swift: A Hands-On Guide to Building Core Data Applications, 2nd Edition
Details:
Paperback: 412 pages
Publisher: Addison-Wesley Professional; 2nd edition (December 7, 2015)
Language: English
ISBN-10: 0134120035
ISBN-13: 978-0134120034
Description:
Learning Core Data for iOS with Swift: A Hands-On Guide to Building Core Data Applications, 2nd Edition: Get Started Fast with Core Data App Development Using iOS 9, Swift, and Xcode 7
10 дек. 2015 г.
26 нояб. 2015 г.
Swift Algorithms & Data Structures
Author: Wayne Bishop
Length: 88 pages
Edition: 1st
Language: English
Publisher: Wayne Bishop
Publication Date: 2015
ISBN-10: 1320479243
Introduced by Apple in 2014, Swift is quickly becoming the language of choice due to its simplicity and modern syntax. See how Swift works to create solutions for everyday systems as well as mobile apps.
WHAT'S INSIDE
Based on the popular essay series, the book features Swift examples and beautiful illustrations for Linked Lists, Big O Notation, Sorting, Generics, Closures, Hash Tables, Binary Search Trees, Tree Balancing (Rotations), Tries, Stacks & Queues, Graphs Dijkstra's Shortest Path, Heaps, Depth-First Search and Breadth-First Search.
Table of Contents
- Linked Lists
- Big O Notation
- Sorting
- Generics
- Closures
- Hash Tables
- Binary Search Trees
- Tree Balancing (Rotations)
- Tries
- Stacks & Queues
- Graphs
- Dijkstra's Shortest Path
- Heaps & Heapsort Operations
- Depth-First Search
- Breadth-First Search