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
{{FrontSide}} | |
<div class="outside"> Answer</div> | |
<div class="card-back shadow"> | |
<div class="back">{{Back}}</div> | |
{{#BackOpt}} | |
<hr /> | |
<div class="backopt">{{BackOpt}}</div> |
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
alias -jump_throw "-jump" | |
alias +jump_throw "+jump; -attack" | |
alias -smoke_throw "cl_crosshairsize 1" | |
alias +smoke_throw "cl_crosshairsize 9999" | |
alias +switch "slot3; r_cleardecals" | |
alias -switch "lastinv" | |
// First row | |
bind tab "+showscores" | |
bind q "+switch" |
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
; ---------------------------------------------------------- | |
; Find anagrams for a given word in a dictionary | |
; @authors Gustavo Leite, Bruno Souza | |
; @date October 28th 2015 | |
; | |
; Usage: (pretty-anagram "algo" dictionary) | |
; => Anagrams for algo: galo, gola, lago, olga | |
; | |
; To import it in core.clj, add the statement: | |
; (:require [lab.anagram :refer :all]) |
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
(* Cons Operator (::) - Prepend an element to an list *) | |
(* * Operator (@) - Concatenate tow lists *) | |
(* List Length #1 *) | |
let rec length l = | |
match l with | |
| [] -> 0 | |
| h::t -> 1 + length t;; (* h = head; t = tail*) | |
(* List length Optimized #2 *) |