Abroskin Alexander Arkweid

I hereby claim:

To claim this, I am signing this object:

Elixir + Phoenix Framework + Guardian + JWT + Comeonin

We need to generate secret key for development environment.

mix phoenix.gen.secret
# ednkXywWll1d2svDEpbA39R5kfkc9l96j0+u7A8MgKM+pbwbeDsuYB8MP2WUW1hf

Let's generate User model and controller.

-#, --progress-bar Make curl display a simple progress bar instead of the more informational standard meter.

-b, --cookie <name=data> Supply cookie with request. If no =, then specifies the cookie file to use (see -c).

-c, --cookie-jar <file name> File to save response cookies to.

	ruby '2.7.1'

	gem 'rails', github: 'rails/rails'
	gem 'tzinfo-data', '>= 1.2016.7' # Don't rely on OSX/Linux timezone data

	# Action Text
	gem 'actiontext', github: 'basecamp/actiontext', ref: 'okra'
	gem 'okra', github: 'basecamp/okra'

	# Drivers

	1) Create a branch with the tag
	git branch {tagname}-branch {tagname}
	git checkout {tagname}-branch

	2) Include the fix manually if it's just a change ....
	git add .
	git ci -m "Fix included"
	or cherry-pick the commit, whatever is easier
	git cherry-pick {num_commit}

	B-Tree - For most datatypes and queries
	GIN - For JSONB/hstore/arrays
	GiST - For full text search and geospatial datatypes
	SP-GiST - For larger datasets with natural but uneven clustering
	BRIN - For really large datasets that line up sequentially
	Hash - For equality operations, and generally B-Tree still what you want here

	IFTTT_SERVICE_KEY = "REPLACE_ME"

	require "bundler/inline"

	gemfile do
	source "https://rubygems.org"
	gem "rails", "~> 5.0"
	end

	require "action_controller/railtie"

	#########################
	# Recursive Binary Search
	#########################

	def r_binary_search(array, val, low = 0, high = (array.size - 1))
	return nil if high < low

	mid = (low + high) / 2

	case val <=> array[mid]

	############
	# QUICK SORT
	############

	def qsort(array)
	return [] if array.empty?
	left, right = array[1..-1].partition { \|y\| y <= array.first }
	qsort(left) + [array.first] + qsort(right)
	end