Krzysztof Kowalczyk kjk

## client.go
package main

import (
	"io"
	"log"
	"mime/multipart"
	"net/http"
	"os"
	"path/filepath"
	"runtime"

## introrx.md

      
              7 files
            
          
              2516 forks
            
          
              468 comments
            
          
              21907 stars
            
          
                staltz
                / introrx.md
            
            
              Last active
              May 10, 2024 12:08
            
              
                The introduction to Reactive Programming you've been missing
              
          
    The introduction to Reactive Programming you've been missing

(by @andrestaltz)

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.


## vineScrape.go
package main

import (
	"errors"
	"log"
	"os"

	"github.com/PuerkitoBio/goquery"
	"github.com/robertkrimen/otto"
)

## Default (OSX).sublime-keymap
[
	// ... (existing content)

	// Find selected text, even if it spans multiple lines (unlike "find_selected_text").
	{ "keys": ["super+f"], "command": "run_multiple_commands", "args":
		{ "commands":
			[
				// Only execute slurp if there's selected text.
				{"command": "slurp_find_string", "context": "window", "condition": "selected_text"},
				{"command": "show_panel", "args": {"panel": "find", "reverse": false}, "context": "window"}

## Default (OSX).sublime-keymap
[
	// ... (existing content)

	// Add folder that contains current file to sidebar.
	{ "keys": ["f3"], "command": "add_to_project" },

	// ...
]

## Makefile
# Hello, and welcome to makefile basics.
#
# You will learn why `make` is so great, and why, despite its "weird" syntax,
# it is actually a highly expressive, efficient, and powerful way to build
# programs.
#
# Once you're done here, go to
# http://www.gnu.org/software/make/manual/make.html
# to learn SOOOO much more.

## generate-pushid.js
/**
 * Fancy ID generator that creates 20-character string identifiers with the following properties:
 *
 * 1. They're based on timestamp so that they sort *after* any existing ids.
 * 2. They contain 72-bits of random data after the timestamp so that IDs won't collide with other clients' IDs.
 * 3. They sort *lexicographically* (so the timestamp is converted to characters that will sort properly).
 * 4. They're monotonically increasing.  Even if you generate more than one in the same timestamp, the
 *    latter ones will sort after the former ones.  We do this by using the previous random bits
 *    but "incrementing" them by 1 (only in the case of a timestamp collision).
 */
	package main

	import (
	"io"
	"log"
	"mime/multipart"
	"net/http"
	"os"
	"path/filepath"
	"runtime"
	package main

	import (
	"errors"
	"log"
	"os"

	"github.com/PuerkitoBio/goquery"
	"github.com/robertkrimen/otto"
	)
	[
	// ... (existing content)

	// Find selected text, even if it spans multiple lines (unlike "find_selected_text").
	{ "keys": ["super+f"], "command": "run_multiple_commands", "args":
	{ "commands":
	[
	// Only execute slurp if there's selected text.
	{"command": "slurp_find_string", "context": "window", "condition": "selected_text"},
	{"command": "show_panel", "args": {"panel": "find", "reverse": false}, "context": "window"}
	[
	// ... (existing content)

	// Add folder that contains current file to sidebar.
	{ "keys": ["f3"], "command": "add_to_project" },

	// ...
	]
	# Hello, and welcome to makefile basics.
	#
	# You will learn why `make` is so great, and why, despite its "weird" syntax,
	# it is actually a highly expressive, efficient, and powerful way to build
	# programs.
	#
	# Once you're done here, go to
	# http://www.gnu.org/software/make/manual/make.html
	# to learn SOOOO much more.
	/**
	* Fancy ID generator that creates 20-character string identifiers with the following properties:
	*
	* 1. They're based on timestamp so that they sort after any existing ids.
	* 2. They contain 72-bits of random data after the timestamp so that IDs won't collide with other clients' IDs.
	* 3. They sort lexicographically (so the timestamp is converted to characters that will sort properly).
	* 4. They're monotonically increasing. Even if you generate more than one in the same timestamp, the
	* latter ones will sort after the former ones. We do this by using the previous random bits
	* but "incrementing" them by 1 (only in the case of a timestamp collision).
	*/