This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
opkg list-installed | awk '{print $1}' | sort | xargs |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
D === WP[[write(x)]](Z) | |
=== WP[[write(x)]](x=n^2) | |
=== x=n^2 | |
WP[[b=t]](a<=b<=c)===a<=t<=c | |
WP[[a=b]](a<=t<=c)===b<=t<=c | |
WP[[t=a]](b<=t<=c)===b<=a<=c | |
WP[[a>b]](a<=b<=c, b<=a<=c)===(a<=b<=cANDa<=b)OR(b<=a<=cANDa>b) | |
===(a<=b<=c)OR(b<a<=c) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
count t | |
(count) = aux t 0 | |
To prove nodes t = count t, one can first prove acc + node t = aux t acc. | |
Generalized statement (*): acc + node t = aux t acc | |
Base Case: t = Empty | |
Statement being proven in base case: acc + node Empty = aux Empty acc | |
Proof of base case: | |
acc + node Empty |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Generalized statement (*): acc + nlen n l = fold_left (+) acc (map (fun _ -> n) l) | |
--- | |
Base Case: l = [] | |
Statement being proven in base case: acc + nlen n [] = fold_left (+) acc (map (fun _ -> n) []) | |
Proof of base case: | |
acc + nlen n [] | |
(nlen) = acc + match [] with [] -> 0 | h::t -> n + nlen n t | |
(match) = acc + 0 | |
(arith) = acc |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
to prove mul c (sum l 0) 0 = c * summa l, one can prove the generalized statement mul c (sum l acc1) acc2 = acc2 + c * (summa l + acc1) | |
Lemma 1: sum l acc1 = acc1 + summa l | |
Base Case: l = [] | |
Statement being proven in base case: sum [] acc1 = acc1 + summa [] | |
Proof of base case: | |
sum [] acc1 | |
(sum) = match [] with [] -> acc1 | h::t -> sum t (h+acc1) | |
(match) = acc1 | |
(arith) = acc1 + 0 | |
(match) = acc1 + (match [] with [] -> 0 | h::t -> h + summa t) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const fieldsLiteral = `- name: String | |
- age: int | |
- tumId: String` | |
const funcsLiteral = `+ Person(String, int, String) | |
+ say(String): Shit` | |
printAttributes(fieldsLiteral) | |
printFunctions(funcsLiteral) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public WordCount[] getWordCountArray() { | |
// step 1: remove all leading and trailing ' 's | |
// step 2: remove extra ' 's between words | |
// step 3: remove all special chars | |
// step 4: all to lowercase | |
// step 5: add a leading space for traversion | |
String processedContent = " " + content.trim() | |
.replaceAll(" +", " ") | |
.replaceAll("[.;!?()*,]", "") | |
.toLowerCase(); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
DEVICE STUCK IN A BOOTLOOP AND UNABLE TO GRAB A LOG? | |
Forcing adb authorization will help you. | |
1. Reboot to TWRP | |
2. Mount _System | |
_ 3. Execute the following commands via adb | |
`adb shell 'echo "persist.service.adb.enable=1" >> default.prop' |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[Unit] | |
Description=Start Ai-Chan on boot and never let her down! | |
StartLimitIntervalSec=0 | |
[Service] | |
Type=simple | |
Restart=always | |
WorkingDirectory=/home/misskey/ai | |
ExecStart=/usr/bin/npm start | |
RestartSec=5 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?xml version="1.0" encoding="UTF-8"?> | |
<manifest> | |
<!-- REMOTES --> | |
<remote name="kangdom" fetch="https://github.com/kangdom/" /> | |
<remote name="nazunamoe-device" fetch="https://github.com/nazunamoe-device" /> | |
<!-- MANIFESTS --> | |
<!-- device trees --> | |
<project name="android_device_xiaomi_clover" path="device/xiaomi/clover" remote="kangdom" revision="exthm-11" /> | |
<project name="android_device_xiaomi_sdm660-common" path="device/xiaomi/sdm660-common" remote="kangdom" revision="exthm-11" /> | |
<!-- vendors --> |
NewerOlder