Druid amrdruid

## unique_in_order.rb
def unique_in_order(iterable)
  (iterable.instance_of?(String) ? iterable.chars : iterable).chunk { |x| x }.map(&:first)
end

## flatten.rb
def flatten arr
  arr.each_with_object([]) do |element, result|
    result.push *(element.is_a? Array ? flatten(element) : element)
  end
end

## class_ancestors.rb
> a = Array.new
=> []
> a.class.ancestors
=> [Array, Enumerable, Object, Kernel, BasicObject]

## binary_search.rb
def binary_search lowest, highest, m
	mid = (lowest + highest) / 2
	if $arr[mid] == m
		mid + 1
	elsif $arr[mid] < m
		binary_search mid + 1, highest, m
	else
		binary_search lowest, mid - 1, m
	end
end

## linear_search.rb
n, m = gets.split(" ").map(&:to_i)
arr = gets.split(" ").map(&:to_i)
index = arr.rindex(m)
puts index < 0 ? index : index + 1

## gist:c5586aff9a709aaf40d9ec5c20e6c3d5
Algorithms:
https://en.wikipedia.org/wiki/Pigeonhole_principle

---

Problems I liked:

http://codeforces.com/contest/743/problem/B

---

## sort_repo_branches_by_date
git for-each-ref --sort=committerdate refs/heads/ --format='%(committerdate:short) %(refname:short)'

## angularjs-providers-explained.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                amrdruid
                / angularjs-providers-explained.md
            
            
              Created
              December 4, 2015 19:16
                — forked from demisx/angularjs-providers-explained.md
            
              
                AngularJS Providers: Constant/Value/Service/Factory/Decorator/Provider
              
          
Provider
Singleton
Instantiable
Configurable


Constant
Yes
No
No


Value
Yes
No
No


Service
Yes
No
No


Factory
Yes
Yes
No


Decorator
Yes
No?
No


Provider
Yes
Yes
Yes


Constant
	def unique_in_order(iterable)
	(iterable.instance_of?(String) ? iterable.chars : iterable).chunk { \|x\| x }.map(&:first)
	end
	def flatten arr
	arr.each_with_object([]) do \|element, result\|
	result.push *(element.is_a? Array ? flatten(element) : element)
	end
	end
	> a = Array.new
	=> []
	> a.class.ancestors
	=> [Array, Enumerable, Object, Kernel, BasicObject]
	def binary_search lowest, highest, m
	mid = (lowest + highest) / 2
	if $arr[mid] == m
	mid + 1
	elsif $arr[mid] < m
	binary_search mid + 1, highest, m
	else
	binary_search lowest, mid - 1, m
	end
	end
	n, m = gets.split(" ").map(&:to_i)
	arr = gets.split(" ").map(&:to_i)
	index = arr.rindex(m)
	puts index < 0 ? index : index + 1
	Algorithms:
	https://en.wikipedia.org/wiki/Pigeonhole_principle

	---

	Problems I liked:

	http://codeforces.com/contest/743/problem/B

	---
Provider	Singleton	Instantiable	Configurable
Constant	Yes	No	No
Value	Yes	No	No
Service	Yes	No	No
Factory	Yes	Yes	No
Decorator	Yes	No?	No
Provider	Yes	Yes	Yes