Boot from Archlinux ISO on USB
- IF Wireless # wifi-menu
- timedatectl set-ntp true
parted /dev/sda
- mklabel gpt - YES
- mkpart efi fat32 1MiB 1025MiB
- mkpart root ext4 1025MiB 31GiB
image: node:latest | |
cache: | |
paths: | |
- node_modules/ | |
before_script: | |
- npm install | |
stages: |
def getPrimeFactors( | |
yourNumber: Int, | |
primeFactors: List[Int]): List[Int] = { | |
for (i <- 2 to yourNumber if (yourNumber % i == 0)) { | |
return getPrimeFactors(yourNumber / 2, primeFactors :+ i) | |
} | |
primeFactors | |
} | |
getPrimeFactors(36, List()) |
<body> | |
<style> | |
.more { | |
display: none; #more is at the begin hidden | |
} | |
a.less:focus ~ ul.list { | |
display: none; #by click on less, list will be hidden | |
} | |
<body> | |
<style> | |
.list { | |
margin-bottom: 0; | |
} | |
.gradient { | |
position: relative; | |
bottom: 30px; | |
height: 30px; | |
background: linear-gradient(to bottom, rgba(255,255,255,0) 0%,rgba(255,255,255,1) 100%); <!-- support for W3C, IE10+, FF16+, Chrome26+, Opera12+, Safari7+, for older browser please have a look at this page http://www.colorzilla.com/gradient-editor/ --> |
NodeList.prototype.forEach = Array.prototype.forEach; |
#!/bin/sh | |
echo "Installing IntelliJ IDEA..." | |
# We need root to install | |
[ $(id -u) != "0" ] && exec sudo "$0" "$@" | |
# Attempt to install a JDK | |
# apt-get install openjdk-8-jdk | |
add-apt-repository ppa:webupd8team/java && apt-get update && apt-get install oracle-java8-installer |
[user] | |
name = Rafal | |
email = [email protected] | |
[push] | |
default = matching | |
[ui] | |
color = auto | |
[alias] | |
st = status | |
pl = log --graph --pretty=\"%Cgreen%h%Creset – %ai – %s (%Cblueby %cn%Creset)\" |
def product(f: Int => Int)(a: Int, b: Int): Int = { | |
if (a > b) 1 | |
else f(a) * product(f)(a + 1, b) | |
} | |
product(x => x * x)(3, 4) | |
def fact(n: Int) = product(x => x)(1, n) | |
fact(5) |
import math.abs | |
val tolerance = 0.0001 | |
def isCloseEnough(x: Double, y: Double) = | |
abs((x - y) / x) / x < tolerance | |
def fixedPoint(f: Double => Double)(firstGuess: Double) = { | |
def iterate(guess: Double): Double = { | |
val next = f(guess) | |
if (isCloseEnough(guess, next)) next |