ficapy ficapy

## clash-on-alpine.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ficapy
                / clash-on-alpine.md
            
            
              Created
              February 7, 2023 09:26
            
          
      View clash-on-alpine.md
  
      
create a file /etc/init.d/clash

#!/sbin/openrc-run

command="/root/clash-linux-amd64-v3-2022.11.25"
command_args="-f /root/config.yaml"

depend() {
        need net
 after firewall

  
## fib.c
#include <Python.h>

static PyObject * fibonacci_fib(PyObject *self, PyObject *args) {
    int n;
    if (!PyArg_ParseTuple(args, "i", &n)) {
        return NULL;
    }
    int i;
    int a = 0;
    int b = 1;

## UTF8_BOM.go
package main

import (
	"fmt"
	"io/ioutil"
	"os"
)

func checkBOM(filepath string) bool {
	file, err := os.Open(filepath)

## index.html
<!doctype html>
<html lang="en">
<head>
  <title>Document</title>
  <script src="https://unpkg.com/@babel/standalone/babel.min.js"></script>
  <script src="https://unpkg.com/react@17/umd/react.development.js" crossorigin></script>
  <script src="https://unpkg.com/react-dom@17/umd/react-dom.development.js" crossorigin></script>
  <script src="https://cdnjs.cloudflare.com/ajax/libs/moment.js/2.29.1/moment.min.js" referrerpolicy="no-referrer"></script>
  <script src="https://cdnjs.cloudflare.com/ajax/libs/antd/4.17.0-alpha.3/antd.min.js" integrity="sha512-EvRn+ZDd7rBIodR8NJL+HrBvocKo2JIEkTURw3FFc2RdCDa68cqGDEgpCeE4fVM3SEeY06oO7T7xHxG/tb4hKw==" crossorigin="anonymous" referrerpolicy="no-referrer"></script>
  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/antd/4.17.0-alpha.3/antd.min.css" integrity="sha512-7FnaoVW3bqm5s1R5RRW/rUkIWBXv8HNRIAvLJiw90aiyAVn2Ma9T3D1TR4zSQAkV154ItnMT1Q/5i6jBWXKAbQ==" crossorigin="anonymous" referrerpolicy="no-referrer" />

## myocr.go
package main

import (
	"fmt"
	"io/ioutil"
	"os"
	"os/exec"
	"runtime"

	"github.com/go-vgo/robotgo"

## leetcode.go
package main

import (
	"fmt"
	"os"
	"os/exec"
	"strconv"
	"strings"
)

## analysis.py
# var a = new Array()
# document.querySelectorAll('.text-ellipsis').forEach(items=>{a.push(items.title)})
# console.log(a.join('\n'))

# git clone https://github.com/intellij-rust/intellij-rust --depth=1 || true
# ...

# ls -1 | xargs -I{} scc -f json {}  | jq '.[] | select(.Name == "Kotlin") | .Code' | pbcopy
# ls -1 | pbcopy

## interface_count.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ficapy
                / interface_count.md
            
            
              Last active
              April 3, 2021 09:22
            
          
      View interface_count.md
  
      
language
line
count
avg
repo
query


Go
1580380
690
2290
https://github.com/golang/go.git
rg -c -t go '^type.+interface {' | cut -d: -f2 | awk '{sum += $1}; END {print sum}'


Java
5370734
7269
739
https://github.com/openjdk/jdk.git
rg -c -t java 'interface .+{$'


Rust
895020
3495
256
https://github.com/rust-lang/rust
rg -c -t rust 'trait .+{$'


TypeScript
1461415
7376
198
https://github.com/microsoft/TypeScript.git
rg -c -t ts 'interface .+{$'


## cps.py
# CPS +  高阶函数可以将递归改写成尾调用，使用Trampoline即可避免爆栈

def cpsF(x,count):
    if x == 0:
        count(1)
    else:
        cpsF(x-1,lambda y:count(x*y))

cpsF(257,print)

## readme.txt
一个纯函数，输出只取决于输入
使用最简单的情况举例，一个递归函数只存在一个递归调用
该递归调用讲函数分成三个部分，
1. 递归基 + 准备部分
2. 递归调用部分
3. 递归调用之后的部分

其中第一部分的 准备部分 可以影响递归调用的参数值
第三可以使用递归返回的值(写的时候可以认为这个值来自未来，或者有些更简单的情况，明显能感受到它就是从后往前在处理)
	#include <Python.h>

	static PyObject * fibonacci_fib(PyObject self, PyObject args) {
	int n;
	if (!PyArg_ParseTuple(args, "i", &n)) {
	return NULL;
	}
	int i;
	int a = 0;
	int b = 1;
	package main

	import (
	"fmt"
	"io/ioutil"
	"os"
	)

	func checkBOM(filepath string) bool {
	file, err := os.Open(filepath)
	<!doctype html>
	<html lang="en">
	<head>
	<title>Document</title>
	<script src="https://unpkg.com/@babel/standalone/babel.min.js"></script>
	<script src="https://unpkg.com/react@17/umd/react.development.js" crossorigin></script>
	<script src="https://unpkg.com/react-dom@17/umd/react-dom.development.js" crossorigin></script>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/moment.js/2.29.1/moment.min.js" referrerpolicy="no-referrer"></script>
	<script src="https://cdnjs.cloudflare.com/ajax/libs/antd/4.17.0-alpha.3/antd.min.js" integrity="sha512-EvRn+ZDd7rBIodR8NJL+HrBvocKo2JIEkTURw3FFc2RdCDa68cqGDEgpCeE4fVM3SEeY06oO7T7xHxG/tb4hKw==" crossorigin="anonymous" referrerpolicy="no-referrer"></script>
	<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/antd/4.17.0-alpha.3/antd.min.css" integrity="sha512-7FnaoVW3bqm5s1R5RRW/rUkIWBXv8HNRIAvLJiw90aiyAVn2Ma9T3D1TR4zSQAkV154ItnMT1Q/5i6jBWXKAbQ==" crossorigin="anonymous" referrerpolicy="no-referrer" />
	# var a = new Array()
	# document.querySelectorAll('.text-ellipsis').forEach(items=>{a.push(items.title)})
	# console.log(a.join('\n'))

	# git clone https://github.com/intellij-rust/intellij-rust --depth=1 \|\| true
	# ...

	# ls -1 \| xargs -I{} scc -f json {} \| jq '.[] \| select(.Name == "Kotlin") \| .Code' \| pbcopy
	# ls -1 \| pbcopy
language	line	count	avg	repo	query
Go	1580380	690	2290	https://github.com/golang/go.git	rg -c -t go '^type.+interface {' \| cut -d: -f2 \| awk '{sum += $1}; END {print sum}'
Java	5370734	7269	739	https://github.com/openjdk/jdk.git	rg -c -t java 'interface .+{$'
Rust	895020	3495	256	https://github.com/rust-lang/rust	rg -c -t rust 'trait .+{$'
TypeScript	1461415	7376	198	https://github.com/microsoft/TypeScript.git	rg -c -t ts 'interface .+{$'
	# CPS + 高阶函数可以将递归改写成尾调用，使用Trampoline即可避免爆栈

	def cpsF(x,count):
	if x == 0:
	count(1)
	else:
	cpsF(x-1,lambda y:count(x*y))

	cpsF(257,print)
	一个纯函数，输出只取决于输入
	使用最简单的情况举例，一个递归函数只存在一个递归调用
	该递归调用讲函数分成三个部分，
	1. 递归基 + 准备部分
	2. 递归调用部分
	3. 递归调用之后的部分

	其中第一部分的准备部分可以影响递归调用的参数值
	第三可以使用递归返回的值(写的时候可以认为这个值来自未来，或者有些更简单的情况，明显能感受到它就是从后往前在处理)