Pinned Loading

1. napkin napkin Public

   Swift 6.2 framework for clean-architecture apps as a tree of isolated, composable units. Modeled on Uber's RIBs, rebuilt around Swift Concurrency.

   HTML 2

2. SFSymbolsKit SFSymbolsKit Public

   SFSymbolsKit makes using SFSymbols easy peasy.

   Swift 15

3. Spooky-Labs/spooktacular Spooky-Labs/spooktacular Public

   macOS virtual machine manager for Apple Silicon. Enterprise CI/CD runners, ML workloads, and remote desktop.

   Swift

4. This is an implementation of the Fis... This is an implementation of the Fisher-Yates shuffling algorithm in Swift as modernized by Richard Durstenfeld.

   1

   //# Fisher-Yates Shuffle

   2

   //## Implemented in Swift

   3

   //This is an implementation of the Fisher-Yates shuffling algorithm as modernized by Richard Durstenfeld. His version shuffles the collection in place. This implementation is based on the psuedo-code used to describe the algorithm at [Wikipedia](https://en.m.wikipedia.org/wiki/Fisher–Yates_shuffle#The_modern_algorithm). Here, we extend the Array struct with a ```shuffle()``` function. With this extension, we can quickly and uniformly shuffly any array (no matter the elements) in O(n) time.

   4

   //    From Wikipedia/n

   5

   //>The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite set—in plain terms, the algorithm shuffles the set. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces an unbiased permutation: every permutation is equally likely. The modern version of the algorithm is efficient: it takes time proportional to the number of items being shuffled and shuffles them in place.