| 0-00.usa.cc | |
| 0-mail.com | |
| 0.pl | |
| 001.igg.biz | |
| 0039.cf | |
| 0039.ga | |
| 0039.gq | |
| 0039.ml | |
| 007addict.com | |
| 00b2bcr51qv59xst2.cf |
| -- ghcid -c'stack repl --resolver nightly --package time' haskell-time.hs --allow-eval | |
| ---- | |
| -- # Haskell Time Crib Sheet | |
| ---- | |
| -- Excellent sources for this small guide include: | |
| -- | |
| -- * https://two-wrongs.com/haskell-time-library-tutorial.html | |
| -- * https://williamyaoh.com/posts/2019-09-16-time-cheatsheet.html |
| /** | |
| * Returns a Time Sortable ID with millisecond precision. | |
| * | |
| * Time component: 42 bits (2^42 = ~69 years) | |
| * | |
| * Random component: 22 bits (2^22 = 4,194,304) | |
| * | |
| * The time component is the count of milliseconds since 2020-01-01T00:00:00Z. | |
| * | |
| * Tags: tsid ulid snowflake id-generator generator time sortable sort order id |
| # This file is an example of overriding a GHC core Haskell library (like | |
| # bytestring, containers, text, unix, etc) when building a Haskell package. | |
| let default-nixpkgs = | |
| builtins.fetchTarball { | |
| # nixpkgs haskell-updates branch as of 2019/09/15. | |
| url = "https://github.com/NixOS/nixpkgs/archive/a51b3367ab6acc72630da0bad50ce14fa86996d0.tar.gz"; | |
| sha256 = "05d3jxxk5dxzs9b3nan16lhkrjnzf0bjd4xy66az86fsafnrr9rd"; | |
| }; | |
| in |
| {-# LANGUAGE DataKinds #-} | |
| {-# LANGUAGE KindSignatures #-} | |
| {-# LANGUAGE TypeFamilies #-} | |
| {-# LANGUAGE UndecidableInstances #-} | |
| {-# LANGUAGE GADTs #-} | |
| {-# OPTIONS_GHC -Wall #-} | |
| module Main where |
| 0-mail.com | |
| 007addict.com | |
| 020.co.uk | |
| 027168.com | |
| 0815.ru | |
| 0815.su | |
| 0clickemail.com | |
| 0sg.net | |
| 0wnd.net | |
| 0wnd.org |
I used to use NERD tree for quite a while, then switched to CtrlP for something a little more lightweight. My setup now includes zero file browser or tree view, and instead uses native Vim fuzzy search and auto-directory switching.
There is a super sweet feature in Vim whereby you can fuzzy find your files using **/*, e.g.:
:vs **/*<partial file name><Tab>
Should be work with 0.18
Destructuring(or pattern matching) is a way used to extract data from a data structure(tuple, list, record) that mirros the construction. Compare to other languages, Elm support much less destructuring but let's see what it got !
myTuple = ("A", "B", "C")
myNestedTuple = ("A", "B", "C", ("X", "Y", "Z"))
| Xft.dpi: 120 | |
| Xft.antialias: true | |
| Xft.hinting: true | |
| Xft.rgba: rgb | |
| Xft.hintstyle: hintslight | |
| rofi.color-enabled: true | |
| rofi.color-window: #282828, #282828, #268bd2 | |
| rofi.color-normal: #282828, #ffffff, #282828, #268bd2, #ffffff | |
| rofi.color-active: #282828, #268bd2, #282828, #268bd2, #205171 |
| " Insert into your .vimrc after quick-scope is loaded. | |
| " Obviously depends on <https://github.com/unblevable/quick-scope> being installed. | |
| " enable quick_scope conditionally | |
| let g:qs_enable = 0 | |
| let g:qs_enable_char_list = [ 'f', 'F', 't', 'T' ] | |
| function! Quick_scope_selective(movement) | |
| let needs_disabling = 0 | |
| if !g:qs_enable |