x5lcfd

 // Mono2.6 doesn't have Enum.TryParse
 
 public static TEnum ToEnum<TEnum>(this string strEnumValue, TEnum defaultValue)
 {
     if (!Enum.IsDefined(typeof(TEnum), strEnumValue))
         return defaultValue;
 
     return (TEnum)Enum.Parse(typeof(TEnum), strEnumValue);
 }

x5lcfd

:: setvar varname cmd
:: Set VARNAME to the output of CMD
:: Triple escape pipes, eg:
:: setvar x  dir c:\ ^^^| sort 
:: -----------------------------
:: http://stackoverflow.com/a/25954264/6181205

@echo off
SETLOCAL

x5lcfd

# 替换现有上游
cd "$(brew --repo)"
git remote set-url origin https://mirrors.tuna.tsinghua.edu.cn/git/homebrew/brew.git

cd "$(brew --repo)/Library/Taps/homebrew/homebrew-core"
git remote set-url origin https://mirrors.tuna.tsinghua.edu.cn/git/homebrew/homebrew-core.git

brew update

# 使用homebrew-science或者homebrew-python

x5lcfd

// http://stackoverflow.com/questions/874134/find-if-string-ends-with-another-string-in-c
bool has_suffix(const std::string &str, const std::string &suffix)
{
    return str.size() >= suffix.size() &&
           str.compare(str.size() - suffix.size(), suffix.size(), suffix) == 0;
}

x5lcfd

-- split
string.split = function(s, p)
  local rt= {}
  string.gsub(s, '[^'..p..']+', function(w) table.insert(rt, w) end )
  return rt
end

x5lcfd

#!/usr/bin/env lua
--[[-------------------------------------------------------------------

  ChunkSpy.lua
  A Lua 5.1 binary chunk disassembler
  ChunkSpy was inspired by Nick Trout's vmmerge5.lua

  Copyright (c) 2004-2006 Kein-Hong Man <[email protected]>
  The COPYRIGHT file describes the conditions under which this
  software may be distributed (basically a Lua 5-style license.)

x5lcfd

--exclude=.git
--exclude=.svn

--regex-LUA=/^def\.method\(.*\)\.[ \t]*([a-zA-Z0-9]*)\s*=\s*function.*$/\1/t,tfunctions/
--regex-LUA=/^def\.virtual\(.*\)\.[ \t]*([a-zA-Z0-9]*)\s*=\s*function.*$/\1/t,tfunctions/
--regex-LUA=/^def\.override\(.*\)\.[ \t]*([a-zA-Z0-9]*)\s*=\s*function.*$/\1/t,tfunctions/
--regex-LUA=/^def\.static\(.*\)\.[ \t]*([a-zA-Z0-9]*)\s*=\s*function.*$/\1/t,tfunctions/
--regex-LUA=/^def\.final\(.*\)\.[ \t]*([a-zA-Z0-9]*)\s*=\s*function.*$/\1/t,tfunctions/
--regex-LUA=/^.*\s*function[ \t]*([a-zA-Z0-9_]+)\s*\(.*$/\1/l,lfunction/
--regex-LUA=/^.*local\s*[ \t]*([a-zA-Z0-9_]+)\s*=\s*function.*$/\1/l,lfunction/

x5lcfd

nnoremap h <NOP>
nnoremap j <NOP>
nnoremap k <NOP>
nnoremap l <NOP>

nmap <C-O> :vsc View.NavigateBackward<CR>
nmap <C-I> :vsc View.NavigateForward<CR>

x5lcfd

The Liang-Barsky algorithm is a cheap way to find the intersection points between a line segment and an axis-aligned rectangle. It's a simple algorithm, but the resources I was pointed to didn't have particularly good explanations, so I tried to write a better one.

Consider a rectangle defined by x_min ≤ x ≤ x_max and y_min ≤ y ≤ y_max, and a line segment from (x_0, y_0) to (x_0 + Δ_x, y_0 + Δ_y). We'll be assuming at least one of Δ_x and Δ_y is nonzero.

(I'm working with Flash, so I'll be using the convention that y increases as you go down.)

We want to distinguish between the following cases:

x5lcfd

最合理的办法是通过发号策略, 每来一个长地址, 发一个号.

https://tech.meituan.com/MT_Leaf.html

https://www.zhihu.com/question/29270034/answer/46446911