| MIT License | |
| Copyright (c) 2021 Daniel Ethridge | |
| Permission is hereby granted, free of charge, to any person obtaining a copy | |
| of this software and associated documentation files (the "Software"), to deal | |
| in the Software without restriction, including without limitation the rights | |
| to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| copies of the Software, and to permit persons to whom the Software is | |
| furnished to do so, subject to the following conditions: |
I bought M1 MacBook Air. It is the fastest computer I have, and I have been a GNOME/GNU/Linux user for long time. It is obvious conclusion that I need practical Linux desktop environment on Apple Silicon.
Fortunately, Linux already works on Apple Silicon/M1. But how practical is it?
Here is easy steps to try Windows 10 on ARM or Ubuntu for ARM64 on your Apple Silicon Mac. Enjoy!
NOTE: that this is current, 10/1/2021 state.
Author: Chris Lattner
| // If you want types initializable from String literals | |
| // but don't want to implement three separate initializers. | |
| extension ExpressibleByUnicodeScalarLiteral where Self: ExpressibleByStringLiteral, Self.StringLiteralType == String { | |
| public init(unicodeScalarLiteral value: String) { | |
| self.init(stringLiteral: value) | |
| } | |
| } |
| // Just spending Saturday afternoon rewriting FP examples from Backus in Swift. | |
| // http://worrydream.com/refs/Backus-CanProgrammingBeLiberated.pdf | |
| // | |
| // Surprising fact: reasonably possible with only one major problem (tuples are not collections) | |
| // Unsurprising fact: you shouldn't write Swift this way | |
| // Other unsurprising fact: Rob should probably get out more | |
| // Don't judge me | |
| // For future research: is it possible to build this without arrayFormHack and the arity 2 ∘? | |
| // Basically, can we do this entirely with tuples or entirely with arrays? Currently almost everything |
| https://speakerdeck.com/jpsim/sourcekit-and-you ("SourceKit and you" by @jpsim) | |
| https://speakerdeck.com/icanzilb/appbuilders-non-technical-ways-to-be-a-better-developer ("Non-technical ways to be a better developer" by @icanzlib) | |
| https://speakerdeck.com/cesarvaliente/refactoring-wunderlist-for-android-episode-i-the-presentation-layer ("Refactoring Wunderlist for Android" by @CesarValiente) | |
| https://speakerdeck.com/akosma/being-a-developer-after-40 ("Being a developer after 40" Medium Post:https://speakerdeck.com/akosma/being-a-developer-after-40 by @akosma) | |
| http://seriot.ch/resources/talks_papers/20160426_error_handling.pdf ("Error Handling" by @nst021) | |
| https://speakerdeck.com/vixentael/upgrading-approaches-to-the-secure-mobile-architectures ("Upgrading approaches to the secure mobile architecture" by @vixental) | |
| http://de.slideshare.net/JohnSundell/dynamic-native-backenddriven-uis-app-builders-2016 ("Dynamic, native, backend-driven UIs" by @johnsundell) | |
| https://speakerdeck.com/smashingmag/dirty-tricks-from-the |
| /** | |
| * Solves the n-Queen puzzle in O(n!) | |
| * Let p[r] be the column of the queen on the rth row (must be exactly 1 queen per row) | |
| * There also must be exactly 1 queen per column and hence p must be a permuation of (0 until n) | |
| * There must be n distinct (col + diag) and n distinct (col - diag) for each queen (else bishop attacks) | |
| * @return returns a Iterator of solutions | |
| * Each solution is an array p of length n such that p[i] is the column of the queen on the ith row | |
| */ | |
| def nQueens(n: Int): Iterator[Seq[Int]] = | |
| (0 until n) |
