Ranger-X

--- ruby-2.5.5/ext/openssl/lib/openssl/ssl.rb
+++ ruby-2.5.5-gost/ext/openssl/lib/openssl/ssl.rb
@@ -51,6 +51,8 @@ class SSLContext
            OpenSSL::OPENSSL_VERSION_NUMBER >= 0x10100000)
         DEFAULT_PARAMS.merge!(
           ciphers: %w{
+            GOST2001-GOST89-GOST89
+            GOST94-GOST89-GOST89
             ECDHE-ECDSA-AES128-GCM-SHA256
             ECDHE-RSA-AES128-GCM-SHA256

sorenvonsarvort

# make sure You have installed the infinality patches

export INFINALITY_FT_FILTER_PARAMS="8 17 50 17 8"
export INFINALITY_FT_GRAYSCALE_FILTER_STRENGTH="0"
export INFINALITY_FT_FRINGE_FILTER_STRENGTH="55"
export INFINALITY_FT_AUTOHINT_HORIZONTAL_STEM_DARKEN_STRENGTH="0"
export INFINALITY_FT_AUTOHINT_VERTICAL_STEM_DARKEN_STRENGTH="0"
export INFINALITY_FT_WINDOWS_STYLE_SHARPENING_STRENGTH="20"
export INFINALITY_FT_CHROMEOS_STYLE_SHARPENING_STRENGTH="0"
export INFINALITY_FT_STEM_ALIGNMENT_STRENGTH="0"

romainl

FOREWORDS

I don't mean the snippet at the bottom of this gist to be a generic plug-n-play solution to your search needs. It is very likely to not work for you or even break things, and it certainly is not as extensively tested and genericised as your regular third-party plugin.

My goal, here and in most of my posts, is to show how Vim's features can be leveraged to build your own high-level, low-maintenance, workflows without systematically jumping on the plugins bandwagon or twisting Vim's arm.

---

Instant grep + quickfix

fnky

ANSI Escape Sequences

Standard escape codes are prefixed with Escape:

• Ctrl-Key: ^[
• Octal: \033
• Unicode: \u001b
• Hexadecimal: \x1B
• Decimal: 27

davecheney

name                   old time/op    new time/op     delta
BinaryTree17              5.44s ± 2%      3.27s ± 2%   -39.90%  (p=0.000 n=20+19)
Fannkuch11                4.95s ± 2%      2.68s ± 2%   -45.87%  (p=0.000 n=20+20)
FmtFprintfEmpty           142ns ± 2%       49ns ± 3%   -65.39%  (p=0.000 n=20+18)
FmtFprintfFloat           765ns ± 2%      260ns ± 2%   -66.02%  (p=0.000 n=20+20)
FmtFprintfInt             341ns ± 2%       95ns ± 2%   -72.08%  (p=0.000 n=19+20)
FmtFprintfIntInt          554ns ± 2%      150ns ± 1%   -72.95%  (p=0.000 n=20+19)
FmtFprintfPrefixedInt     497ns ± 3%      178ns ± 3%   -64.12%  (p=0.000 n=20+20)
FmtFprintfString          466ns ± 2%       86ns ± 3%   -81.54%  (p=0.000 n=20+20)
FmtManyArgs              2.23µs ± 2%     0.59µs ± 1%   -73.46%  (p=0.000 n=20+17)

NikolayS

-- This function terminates all Postgres sessions which state have been changed "age" minutes ago.
-- Usage example:
--    select * from flush_connections(60);
--
-- Or just (but result will be less readable):
--    select flush_connections(60);
--
-- By default, terminates only sessions with "state = 'idle'".
-- If needed, you can terminate ALL sessions, regardless of their states:
--    select * from flush_connections(60, true);

patshaughnessy

#[macro_use]
extern crate diesel;

use diesel::prelude::*;

table! {
    users (id) {
        id -> Int4,
        first_name -> Nullable<Varchar>,
        last_name -> Nullable<Varchar>,

mrichman

#!/usr/bin/env bash
#
# Bootstrap script for setting up a new OSX machine
#
# This should be idempotent so it can be run multiple times.
#
# Some apps don't have a cask and so still need to be installed by hand. These
# include:
#
# - Twitter (app store)

tenderlove

require 'fiddle'

SIZEOF_HEAP_PAGE_HEADER_STRUCT = Fiddle::SIZEOF_VOIDP

SIZEOF_RVALUE           = 40
HEAP_PAGE_ALIGN_LOG     = 14
HEAP_PAGE_ALIGN         = 1 << HEAP_PAGE_ALIGN_LOG      # 2 ^ 14
HEAP_PAGE_ALIGN_MASK    = ~(~0 << HEAP_PAGE_ALIGN_LOG)  # Mask for getting page address
REQUIRED_SIZE_BY_MALLOC = Fiddle::SIZEOF_SIZE_T * 5     # padding needed by malloc
HEAP_PAGE_SIZE          = HEAP_PAGE_ALIGN - REQUIRED_SIZE_BY_MALLOC # Actual page size

gkaemmer

Elixir Supervision Trees Made Easy

I started with Elixir just a couple weeks after the switch from 1.4 to 1.5, so the bulk of online resources were out of date (or at least resulted in deprecation warnings). This guide is for defining Elixir 1.5 supervised modules.

It's not actually terribly complicated. It's just sometimes unclear from examples what's implemented by the language and what you actually have to implement yourself.

Say we want a supervision tree like this (where each atom is a process):

    :a

/ \