Reference: http://fideloper.com/mac-vim-tmux
Don't forget to open a file via vim and installing bundles via :BundleInstall
import * as admin from "firebase-admin"; | |
export const getFirebaseApp = (credentialsJsonFile, appName) => { | |
let fbAdmin = admin.initializeApp({ | |
credential: admin.credential.cert(credentialsJsonFile) | |
}, appName); | |
return fbAdmin.firestore(); | |
}; | |
-module(recursive). | |
-export([minimum/1, maximum/1]). | |
minimum([]) -> io:format("can not find minimum of empty list~n"); | |
minimum([H|T]) -> | |
minimum(H, T). | |
minimum(Min, [H|T]) -> | |
case Min < H of |
-module(mathStuff). | |
-export([perimeter/1]). | |
perimeter({circle, Radius}) -> 2 * math:pi() * Radius; | |
perimeter({square, Side}) -> 4 * Side; | |
perimeter({triangle, A, B, C}) -> A + B + C. |
import java.io.*; | |
import java.util.*; | |
/* | |
* To execute Java, please define "static void main" on a class | |
* named Solution. | |
* | |
* If you need more classes, simply define them inline. | |
*/ |
Reference: http://fideloper.com/mac-vim-tmux
Don't forget to open a file via vim and installing bundles via :BundleInstall
package com.learner.s99 | |
/** | |
* P06 (*) Find out whether a list is a palindrome. | |
* Example: | |
* scala> isPalindrome(List(1, 2, 3, 2, 1)) | |
* res0: Boolean = true | |
*/ | |
object P06 { | |
def isPalindrome[T](l:List[T]):Boolean = l == l.reverse |
package com.learner.s99 | |
/** | |
* P05 (*) Reverse a list. | |
* Example: | |
* scala> reverse(List(1, 1, 2, 3, 5, 8)) | |
* res0: List[Int] = List(8, 5, 3, 2, 1, 1) | |
*/ | |
object P05 { | |
def reverse[T](l:List[T]): Option[List[T]] = reverse(l, Nil) |
package com.learner.s99 | |
/** | |
* (*) Find the number of elements of a list. | |
* Example: | |
* scala> length(List(1, 1, 2, 3, 5, 8)) | |
* res0: Int = 6 | |
*/ | |
object P04 { |
package com.learner.s99 | |
object P03 { | |
def nth(n: Int, l: List[Any]): Any = { | |
require(n >= 0, "n must be greater than or equal to zero") | |
l match { | |
case List() => None | |
case head :: tail if n == 0 => head | |
case head :: tail if n > 0 => nth(n - 1, tail) | |
} |
package com.learner.s99 | |
/** | |
* (*) Find the last but one element of a list. | |
* Example: | |
* scala> penultimate(List(1, 1, 2, 3, 5, 8)) | |
* res0: Int = 5 | |
*/ | |
object P02 { | |
def penultimate(input: List[Any]): Any = penultimate(input, None, None) |