Lewin Kelly Heliodex

Array Iteration

https://gist.github.com/ljharb/58faf1cfcb4e6808f74aae4ef7944cff

While attempting to explain JavaScript's reduce method on arrays, conceptually, I came up with the following - hopefully it's helpful; happy to tweak it if anyone has suggestions.

Intro

JavaScript Arrays have lots of built in methods on their prototype. Some of them mutate - ie, they change the underlying array in-place. Luckily, most of them do not - they instead return an entirely distinct array. Since arrays are conceptually a contiguous list of items, it helps code clarity and maintainability a lot to be able to operate on them in a "functional" way. (I'll also insist on referring to an array as a "list" - although in some languages, List is a native data type, in JS and this post, I'm referring to the concept. Everywhere I use the word "list" you can assume I'm talking about a JS Array) This means, to perform a single operation on the list as a whole ("atomically"), and to return a new list - thus making it mu

libuv 和 libev ，两个名字相当相近的 I/O Library，最近有幸用两个 Library 都写了一些东西，下面就来说一说我本人对两者共同与不同点的主观表述。

高性能网络编程这个话题已经被讨论烂了。异步，异步，还是异步。不管是 epoll 也好，kqueue 也罢，总是免不了异步这个话题。

libuv是异步的，libev是同步的多路IO复用。

libev 是系统I/O复用的简单封装，基本上来说，它解决了 epoll ，kqueuq 与 select 之间 API 不同的问题。保证使用 livev 的 API 编写出的程序可以在大多数 *nix 平台上运行。但是 libev 的缺点也是显而易见，由于基本只是封装了 Event Library，用起来有诸多不便。比如 accept(3) 连接以后需要手动 setnonblocking。从 socket 读写时需要检测 EAGAIN 、EWOULDBLOCK 和 EINTER 。这也是大多数人认为异步程序难写的根本原因。

libuv 则显得更为高层。libuv 是 joyent 给 Node 做的一套 I/O Library 。而这也导致了 libuv 最大的特点就是处处回调。基本上只要有可能阻塞的地方，libuv 都使用回调处理。这样做实际上大大减轻了程序员的工作量。因为当回调被 call 的时候，libuv 保证你有事可做，这样 EAGAIN 和 EWOULDBLOCK 之类的 handle 就不是程序员的工作了，libuv 会默默的帮你搞定。

Go (Golang) GOOS and GOARCH

All of the following information is based on go version go1.17.1 darwin/amd64.

GOOS Values

GOOS	Out of the Box
`aix`	✅
`android`	✅

	package main

	import (
	"net"
	"sort"
	"strconv"
	"strings"
	)

	func rfc1918private(ip net.IP) bool {

	--[[
	Most pure lua print table functions I've seen have a problem with deep recursion and tend to cause a stack overflow when
	going too deep. This print table function that I've written does not have this problem. It should also be capable of handling
	really large tables due to the way it handles concatenation. In my personal usage of this function, it outputted 63k lines to
	file in about a second.

	The output also keeps lua syntax and the script can easily be modified for simple persistent storage by writing the output to
	file if modified to allow only number, boolean, string and table data types to be formatted.

	author: Alundaio (aka Revolucas)

	# LVDB - LLOOGG Memory DB
	# Copyriht (C) 2009 Salvatore Sanfilippo <[email protected]>
	# All Rights Reserved

	# TODO
	# - cron with cleanup of timedout clients, automatic dump
	# - the dump should use array startsearch to write it line by line
	# and may just use gets to read element by element and load the whole state.
	# - 'help','stopserver','saveandstopserver','save','load','reset','keys' commands.
	# - ttl with milliseconds resolution 'ttl a 1000'. Check ttl in dump!

	package main
	import (
	"fmt"
	"io/ioutil"
	"net/http"
	)
	func main() {
	url := "https://api.ipify.org?format=text" // we are using a pulib IP API, we're using ipify here, below are some others
	// https://www.ipify.org
	// http://myexternalip.com


	>>>
	Registering an Application to a URI Scheme
	https://msdn.microsoft.com/en-us/library/aa767914(v=vs.85).aspx

	To register an application to handle a particular URI scheme, add a new key, along with the appropriate subkeys and values, to HKEY_CLASSES_ROOT. The root key must match the URI scheme that is being added. For instance, to add an "alert:" scheme, add an alert key to HKEY_CLASSES_ROOT, as follows:

	HKEY_CLASSES_ROOT
	alert
	URL Protocol = ""

	-- Turns out, string.gsub does string replacements globally.
	-- For example:
	print(string.gsub("Hello there! You are on GitHub.", "GitHub", "Gist"))