Skip to content

Instantly share code, notes, and snippets.

View dashed's full-sized avatar
👨‍💻
Busy transpiling ☕ into ✨

Alberto Leal dashed

👨‍💻
Busy transpiling ☕ into ✨
View GitHub Profile
// ==UserScript==
// @name fails-first
// @namespace https://asottile.dev
// @version 0.1
// @description put failed statuses first
// @author asottile
// @match https://github.com/*/*/pull/*
// @icon https://www.google.com/s2/favicons?sz=64&domain=github.com
// @grant none
// ==/UserScript==
// ==UserScript==
// @name fsso
// @namespace https://asottile.dev
// @version 0.1
// @description click a da button
// @author asottile
// @match https://github.com/*
// @icon https://www.google.com/s2/favicons?sz=64&domain=github.com
// @grant none
// ==/UserScript==
@dashed
dashed / nyan.gif
Last active April 28, 2019 20:59
🏳️‍🌈🐱 nyan cat
nyan.gif
@dashed
dashed / ordered_iterator.rs
Last active March 30, 2017 16:34 — forked from dat2/ordered_iterator.rs
Rust implementation of sorted iterator based on 2 input iterators
use std::iter::{Iterator, Peekable};
use std::collections::BinaryHeap;
use std::cmp::Ordering;
use std::cell::RefCell;
use std::iter::FromIterator;
struct WrappedIterator<T: Ord, P: Iterator<Item = T>>(RefCell<Peekable<P>>);
impl<T: Ord, P: Iterator<Item = T>> PartialEq for WrappedIterator<T, P> {
fn eq(&self, other: &Self) -> bool {

Keybase proof

I hereby claim:

  • I am dashed on github.
  • I am dashed (https://keybase.io/dashed) on keybase.
  • I have a public key whose fingerprint is 1934 42B1 BEC9 1884 50E6 CE66 DA2A 4E73 D491 CD26

To claim this, I am signing this object:

@dashed
dashed / pagination_example.sql
Created June 29, 2016 21:46 — forked from ssokolow/pagination_example.sql
Reasonably efficient pagination without OFFSET (SQLite version)
-- Reasonably efficient pagination without OFFSET
-- SQLite version (Adapted from MS SQL syntax)
-- Source: http://www.phpbuilder.com/board/showpost.php?p=10376515&postcount=6
SELECT foo, bar, baz, quux FROM table
WHERE oid NOT IN ( SELECT oid FROM table
ORDER BY title ASC LIMIT 50 )
ORDER BY title ASC LIMIT 10
@dashed
dashed / chomp_numbering_wrapper.rs
Last active April 25, 2016 19:29 — forked from m4rw3r/chomp_numbering_wrapper.rs
Just a quick implementation of line-numbering where a parser is wrapped to keep track of the number of lines it has parsed so far
use std::marker::PhantomData;
pub trait NumberingType {
type Token;
type Position;
fn update(&mut self, &[Self::Token]);
fn position(&self) -> Self::Position;
}
const Immutable = require('immutable');
const Cursor = require('immutable/contrib/cursor');
const immstruct = require('immstruct');
const Iterable = Immutable.Iterable;
/**
(work in progress)
Wrapped immutable.js cursors:
@dashed
dashed / events.js
Created February 2, 2015 23:18
immstructor - wrapper around immstruct [WIP - very experimental]
/**
* Events utility mixin for immstructor
*/
var
Promise = require('bluebird');
var
// TODO: Expose this?
/**
// custom jshint-loader reporter
// Based on https://github.com/sindresorhus/jshint-stylish
var
beeper = require('beeper'),
chalk = require('chalk'),
table = require('text-table'),
stringLength = require('string-length'),
logSymbols = require('log-symbols');
function pluralize(str, count) {