Table of Contents - algorithmable-0.15.0 Documentation
Classes and Modules
Methods
-
::binary_heap
—
Algorithmable::Sort
-
::binary_search
—
Algorithmable::Cups::RootCubeIssue
-
::bubble
—
Algorithmable::Sort
-
::do_effect
—
Algorithmable::Sort::QuickSort
-
::find_sum_of_nodes_in
—
Algorithmable::Cups::NestedListsProblem::PuzzleSolver
-
::insertion
—
Algorithmable::Sort
-
::logger
—
Algorithmable
-
::lookup
—
Algorithmable::Searches::BinarySearch
-
::merge
—
Algorithmable::Sort::Merge
-
::merge
—
Algorithmable::Sort
-
::new
—
Algorithmable::Cache::Imp
-
::new
—
Algorithmable::Cache::PrimitiveMaxHeap
-
::new
—
Algorithmable::Cache::PrimitiveMinHeap
-
::new
—
Algorithmable::Cups::NestedListsProblem::NestedListImp
-
::new
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
::new
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
::new
—
Algorithmable::Cups::StacksAndQueues::TwoStacksQueue
-
::new
—
Algorithmable::DataStructs::Bag
-
::new
—
Algorithmable::DataStructs::Bag::Node
-
::new
—
Algorithmable::DataStructs::Deque
-
::new
—
Algorithmable::DataStructs::Heap::Imp
-
::new
—
Algorithmable::DataStructs::Heap::Max
-
::new
—
Algorithmable::DataStructs::Heap::Min
-
::new
—
Algorithmable::DataStructs::LinkedList::Base
-
::new
—
Algorithmable::DataStructs::LinkedList::Doubly::Node
-
::new
—
Algorithmable::DataStructs::LinkedList::Singly::Node
-
::new
—
Algorithmable::DataStructs::OrderedSymbolTable
-
::new
—
Algorithmable::DataStructs::Queue
-
::new
—
Algorithmable::DataStructs::Stack
-
::new
—
Algorithmable::DataStructs::Tree::BinarySearch
-
::new
—
Algorithmable::DataStructs::Tree::BinarySearch::Node
-
::new
—
Algorithmable::Graphs::Traversals::BreadthFirst
-
::new
—
Algorithmable::Graphs::Traversals::DepthFirst
-
::new
—
Algorithmable::Graphs::Undirected
-
::new
—
Algorithmable::Puzzles::DijkstrasTwoStacks
-
::new
—
Algorithmable::Puzzles::JosephusProblem
-
::new
—
Algorithmable::Searches::BinarySearchTree
-
::new
—
Algorithmable::Searches::BinarySearchTree::Node
-
::new
—
Algorithmable::Sort::BinaryHeap
-
::new
—
Algorithmable::UnionFind::Impl
-
::new
—
Algorithmable::UnionFind
-
::new_undirected_graph
—
Algorithmable::Graphs
-
::newton_approximation
—
Algorithmable::Cups::RootCubeIssue
-
::quick
—
Algorithmable::Sort
-
::selection
—
Algorithmable::Sort
-
::shell
—
Algorithmable::Sort
-
::shuffle
—
Algorithmable::Sort
-
::sort
—
Algorithmable::Cups::StacksAndQueues::StackSorter
-
::sort
—
Algorithmable::Sort::BinaryHeap
-
::sort
—
Algorithmable::Sort::Bubble
-
::sort
—
Algorithmable::Sort::Insertion
-
::sort
—
Algorithmable::Sort::Merge
-
::sort
—
Algorithmable::Sort::QuickSort
-
::sort
—
Algorithmable::Sort::Selection
-
::sort
—
Algorithmable::Sort::Shell
-
::sort
—
Algorithmable::Sort::Shuffle
-
#<<
—
Algorithmable::Cups::NestedListsProblem::NestedListImp
-
#<=>
—
Algorithmable::DataStructs::Tree::BinarySearch::Node
-
#[]
—
Algorithmable::Cache::PrimitiveMaxHeap
-
#[]
—
Algorithmable::Cache::PrimitiveMinHeap
-
#[]
—
Algorithmable::Searches::BinarySearchTree
-
#[]=
—
Algorithmable::Cache::Imp
-
#[]=
—
Algorithmable::Cache::PrimitiveMaxHeap
-
#[]=
—
Algorithmable::Cache::PrimitiveMinHeap
-
#[]=
—
Algorithmable::Searches::BinarySearchTree
-
#add
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
#add
—
Algorithmable::DataStructs::Bag
-
#add_edge
—
Algorithmable::Graphs::Undirected
-
#adjacency
—
Algorithmable::Graphs::Undirected
-
#agreed
—
Algorithmable::DataStructs::Heap::Imp
-
#anagrams?
—
Algorithmable::Cups::Primitives
-
#assert_heap_invariant
—
Algorithmable::DataStructs::Heap::Imp
-
#assert_key_type
—
Algorithmable::Searches::BinarySearchTree
-
#assert_value_type
—
Algorithmable::Searches::BinarySearchTree
-
#balanced?
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#binary_search
—
Algorithmable::Searches
-
#ceiling
—
Algorithmable::Searches::BinarySearchTree
-
#chars_is_uniq?
—
Algorithmable::Cups::Primitives
-
#check_tree_consistency
—
Algorithmable::Searches::BinarySearchTree
-
#clear
—
Algorithmable::DataStructs::Deque
-
#clear
—
Algorithmable::Cache::Methods
-
#clear!
—
Algorithmable::DataStructs::LinkedList::Base
-
#collect_items
—
Algorithmable::DataStructs::Deque
-
#collect_nodes_with_bfs
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#collect_nodes_with_dfs
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#compute
—
Algorithmable::Puzzles::DijkstrasTwoStacks
-
#computed_node_size
—
Algorithmable::Searches::BinarySearchTree
-
#connected?
—
Algorithmable::UnionFind::Impl
-
#debug
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
#degree
—
Algorithmable::Graphs::Undirected
-
#delete
—
Algorithmable::DataStructs::LinkedList::Base
-
#delete
—
Algorithmable::DataStructs::LinkedList::Doubly
-
#delete
—
Algorithmable::DataStructs::LinkedList::Singly
-
#delete
—
Algorithmable::Searches::BinarySearchTree
-
#delete_max
—
Algorithmable::Searches::BinarySearchTree
-
#delete_min
—
Algorithmable::Searches::BinarySearchTree
-
#dequeue
—
Algorithmable::Cups::StacksAndQueues::TwoStacksQueue
-
#dequeue
—
Algorithmable::DataStructs::Heap::Imp
-
#dequeue
—
Algorithmable::DataStructs::Queue
-
#dfs
—
Algorithmable::Cups::CircularDependencies
-
#dfs_impl
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#each
—
Algorithmable::Cups::NestedListsProblem::NestedListImp
-
#each
—
Algorithmable::DataStructs::Bag
-
#each
—
Algorithmable::DataStructs::Bag::Node
-
#each
—
Algorithmable::DataStructs::Deque
-
#each
—
Algorithmable::DataStructs::LinkedList::Base
-
#each
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#each_with_bfs
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#each_with_dfs
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#empty?
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
#empty?
—
Algorithmable::DataStructs::Bag
-
#empty?
—
Algorithmable::DataStructs::Deque
-
#empty?
—
Algorithmable::DataStructs::Heap::Imp
-
#empty?
—
Algorithmable::DataStructs::LinkedList::Base
-
#empty?
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#empty?
—
Algorithmable::Searches::BinarySearchTree
-
#enqueue
—
Algorithmable::Cups::StacksAndQueues::TwoStacksQueue
-
#enqueue
—
Algorithmable::DataStructs::Heap::Imp
-
#enqueue
—
Algorithmable::DataStructs::Queue
-
#exchange
—
Algorithmable::DataStructs::Heap::Imp
-
#exchange
—
Algorithmable::Sort::Utils
-
#find
—
Algorithmable::Cups::LongestCommonSubSequence
-
#find
—
Algorithmable::UnionFind::Impl
-
#find
—
Algorithmable::UnionFind::SimpleFind
-
#find_common_chars_in_words
—
Algorithmable::Cups::Primitives
-
#find_cycled_node
—
Algorithmable::Cups::Primitives
-
#find_distance_between_words
—
Algorithmable::Cups::Primitives
-
#find_first_one
—
Algorithmable::Cups::NumberOfOccurrencesInArray
-
#find_intersect
—
Algorithmable::DataStructs::LinkedList::Base
-
#find_last_one
—
Algorithmable::Cups::NumberOfOccurrencesInArray
-
#find_max_profit
—
Algorithmable::Cups::Stocks
-
#find_sum_of_nodes_in
—
Algorithmable::Cups::NestedListsProblem::PuzzleSolver
-
#flip!
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#flip_bang_imp!
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#floor
—
Algorithmable::Searches::BinarySearchTree
-
#get_best_time
—
Algorithmable::Cups::Stocks
-
#get_stack_pointer
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
#height
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#impl_ceiling
—
Algorithmable::Searches::BinarySearchTree
-
#impl_delete
—
Algorithmable::Searches::BinarySearchTree
-
#impl_delete_max
—
Algorithmable::Searches::BinarySearchTree
-
#impl_delete_min
—
Algorithmable::Searches::BinarySearchTree
-
#impl_floor
—
Algorithmable::Searches::BinarySearchTree
-
#impl_get
—
Algorithmable::Searches::BinarySearchTree
-
#impl_keys
—
Algorithmable::Searches::BinarySearchTree
-
#impl_max
—
Algorithmable::Searches::BinarySearchTree
-
#impl_min
—
Algorithmable::Searches::BinarySearchTree
-
#impl_put
—
Algorithmable::Searches::BinarySearchTree
-
#impl_rank
—
Algorithmable::Searches::BinarySearchTree
-
#impl_select
—
Algorithmable::Searches::BinarySearchTree
-
#impl_size_consistent?
—
Algorithmable::Searches::BinarySearchTree
-
#impl_symmetric_ordered?
—
Algorithmable::Searches::BinarySearchTree
-
#include?
—
Algorithmable::DataStructs::LinkedList::Base
-
#inspect
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
#inspect
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
#integer?
—
Algorithmable::Cups::NestedListsProblem::NestedListImp
-
#key?
—
Algorithmable::Searches::BinarySearchTree
-
#keys
—
Algorithmable::Searches::BinarySearchTree
-
#lib_dependencies
—
Algorithmable::Cups::CircularDependencies
-
#linear_solve
—
Algorithmable::Cups::NumberOfOccurrencesInArray
-
#logarithmic
—
Algorithmable::Cups::NumberOfOccurrencesInArray
-
#lookup
—
Algorithmable::Searches::BinarySearch
-
#maintain_heap_invariant!
—
Algorithmable::DataStructs::Heap::Imp
-
#make_list
—
Algorithmable::Cups::NestedListsProblem
-
#make_node
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#map
—
Algorithmable::DataStructs::Deque
-
#max
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#max
—
Algorithmable::Searches::BinarySearchTree
-
#max_depth
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#max_height_of
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#max_impl
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#merge
—
Algorithmable::DataStructs::LinkedList::Base
-
#merge
—
Algorithmable::DataStructs::LinkedList::Singly
-
#merge!
—
Algorithmable::DataStructs::LinkedList::Base
-
#merge_arrays
—
Algorithmable::Cups
-
#min
—
Algorithmable::Cups::StacksAndQueues::StackWithMin
-
#min
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#min
—
Algorithmable::Searches::BinarySearchTree
-
#min_depth
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#min_height_of
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#min_impl
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#move_disks
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
#move_top_to_tower
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
#new_bag
—
Algorithmable::DataStructs
-
#new_binary_search_tree
—
Algorithmable::Searches
-
#new_deque_queue
—
Algorithmable::DataStructs
-
#new_doubly_linked_list
—
Algorithmable::DataStructs::LinkedList
-
#new_fifo_queue
—
Algorithmable::DataStructs
-
#new_josephus_problem
—
Algorithmable::Puzzles
-
#new_lifo_queue
—
Algorithmable::DataStructs
-
#new_lru_cache
—
Algorithmable::Cache
-
#new_max_priority_queue
—
Algorithmable::DataStructs
-
#new_min_priority_queue
—
Algorithmable::DataStructs
-
#new_mru_cache
—
Algorithmable::Cache
-
#new_nested_list
—
Algorithmable::Cups::NestedListsProblem
-
#new_node
—
Algorithmable::DataStructs::LinkedList::Base
-
#new_node
—
Algorithmable::DataStructs::LinkedList::Doubly
-
#new_node
—
Algorithmable::DataStructs::LinkedList::Singly
-
#new_ordered_binary_tree
—
Algorithmable::DataStructs::Tree
-
#new_ordered_symbol_table
—
Algorithmable::DataStructs
-
#new_priority_queue
—
Algorithmable::DataStructs
-
#new_quadratic_solution
—
Algorithmable::Cups::TwoSum
-
#new_singly_linked_list
—
Algorithmable::DataStructs::LinkedList
-
#new_stack_with_min
—
Algorithmable::Cups::StacksAndQueues
-
#new_tower_of_hanoi
—
Algorithmable::Cups::StacksAndQueues
-
#new_triple_stack
—
Algorithmable::Cups::StacksAndQueues
-
#new_two_stacks_queue
—
Algorithmable::Cups::StacksAndQueues
-
#node_size
—
Algorithmable::Searches::BinarySearchTree
-
#nth_to_last_in_list
—
Algorithmable::Cups::Primitives
-
#parse_char
—
Algorithmable::Cups::Primitives
-
#parse_expression
—
Algorithmable::Puzzles::DijkstrasTwoStacks
-
#parse_string_with_escapes
—
Algorithmable::Cups::Primitives
-
#partition
—
Algorithmable::Sort::Utils
-
#path_to
—
Algorithmable::Graphs::Traversals::BreadthFirst
-
#path_to
—
Algorithmable::Graphs::Traversals::DepthFirst
-
#peek
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
#peek
—
Algorithmable::Cups::StacksAndQueues::TwoStacksQueue
-
#peek
—
Algorithmable::DataStructs::Heap::Imp
-
#peek
—
Algorithmable::DataStructs::Queue
-
#peek
—
Algorithmable::DataStructs::Stack
-
#peek_back
—
Algorithmable::DataStructs::Deque
-
#peek_back
—
Algorithmable::DataStructs::LinkedList::Base
-
#peek_front
—
Algorithmable::DataStructs::Deque
-
#peek_front
—
Algorithmable::DataStructs::LinkedList::Base
-
#pop
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
#pop
—
Algorithmable::DataStructs::Stack
-
#pop
—
Algorithmable::Cache::Methods
-
#pop_back
—
Algorithmable::DataStructs::Deque
-
#pop_back
—
Algorithmable::DataStructs::LinkedList::Base
-
#pop_back
—
Algorithmable::DataStructs::LinkedList::Doubly
-
#pop_back
—
Algorithmable::DataStructs::LinkedList::Singly
-
#pop_front
—
Algorithmable::DataStructs::Deque
-
#pop_front
—
Algorithmable::DataStructs::LinkedList::Base
-
#pop_front
—
Algorithmable::DataStructs::LinkedList::Doubly
-
#pop_front
—
Algorithmable::DataStructs::LinkedList::Singly
-
#push
—
Algorithmable::Cups::StacksAndQueues::StackWithMin
-
#push
—
Algorithmable::Cups::StacksAndQueues::TripleStack
-
#push
—
Algorithmable::DataStructs::Stack
-
#push_back
—
Algorithmable::DataStructs::Deque
-
#push_back
—
Algorithmable::DataStructs::LinkedList::Base
-
#push_back
—
Algorithmable::DataStructs::LinkedList::Doubly
-
#push_back
—
Algorithmable::DataStructs::LinkedList::Singly
-
#push_front
—
Algorithmable::DataStructs::Deque
-
#push_front
—
Algorithmable::DataStructs::LinkedList::Base
-
#push_front
—
Algorithmable::DataStructs::LinkedList::Doubly
-
#push_front
—
Algorithmable::DataStructs::LinkedList::Singly
-
#put
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#put_impl
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#rank
—
Algorithmable::Searches::BinarySearchTree
-
#rank_consistent?
—
Algorithmable::Searches::BinarySearchTree
-
#ransom_note
—
Algorithmable::Cups::Primitives
-
#recursive_merge_imp
—
Algorithmable::DataStructs::LinkedList::Singly
-
#recursive_sum
—
Algorithmable::Cups::NestedListsProblem::PuzzleSolver
-
#remove_duplicated_chars
—
Algorithmable::Cups::Primitives
-
#remove_duplicates_from_list
—
Algorithmable::Cups::Primitives
-
#remove_next
—
Algorithmable::DataStructs::LinkedList::Singly
-
#replace_space_chars
—
Algorithmable::Cups::Primitives
-
#reverse!
—
Algorithmable::DataStructs::LinkedList::Base
-
#reverse!
—
Algorithmable::DataStructs::LinkedList::Singly
-
#reverse!
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#reverse_bang_impl
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#reverse_each
—
Algorithmable::DataStructs::Deque
-
#reverse_imp
—
Algorithmable::DataStructs::LinkedList::Singly
-
#reverse_string
—
Algorithmable::Cups::Primitives
-
#ruby_buy_and_sell_stocks
—
Algorithmable::Cups::Stocks
-
#search
—
Algorithmable::DataStructs::LinkedList::Base
-
#select
—
Algorithmable::Searches::BinarySearchTree
-
#sink
—
Algorithmable::Cache::PrimitiveMinHeap
-
#sink
—
Algorithmable::DataStructs::Heap::Imp
-
#size
—
Algorithmable::Cups::StacksAndQueues::TwoStacksQueue
-
#size
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#size
—
Algorithmable::Searches::BinarySearchTree
-
#size_consistent?
—
Algorithmable::Searches::BinarySearchTree
-
#size_of
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#solve
—
Algorithmable::Cups::TaskScheduleWithColdTime
-
#solve
—
Algorithmable::Cups::TwoSum::Quadratic
-
#solve
—
Algorithmable::Cups::TwoSum::Logarithmic
-
#solve
—
Algorithmable::Puzzles::DijkstrasTwoStacks
-
#solve
—
Algorithmable::Puzzles::JosephusProblem
-
#solve_puzzle
—
Algorithmable::Cups::NestedListsProblem
-
#sort
—
Algorithmable::Cups::StacksAndQueues::StackSorter
-
#sort
—
Algorithmable::Sort::BinaryHeap
-
#sort!
—
Algorithmable::DataStructs::LinkedList::Base
-
#sort!
—
Algorithmable::DataStructs::LinkedList::Singly
-
#sort_linked_list
—
Algorithmable::DataStructs::LinkedList::Singly
-
#sort_linked_list
—
Algorithmable::Cups::Primitives
-
#sort_stack
—
Algorithmable::Cups::StacksAndQueues
-
#swap
—
Algorithmable::Sort::Utils
-
#swap_nodes
—
Algorithmable::DataStructs::LinkedList::Singly
-
#swap_nodes
—
Algorithmable::Cups::Primitives
-
#swim
—
Algorithmable::Cache::PrimitiveMaxHeap
-
#swim
—
Algorithmable::DataStructs::Heap::Imp
-
#symmetric_ordered?
—
Algorithmable::Searches::BinarySearchTree
-
#to_a
—
Algorithmable::Cups::StacksAndQueues::TowersOfHanoi::Tower
-
#to_a
—
Algorithmable::DataStructs::Deque
-
#to_a
—
Algorithmable::DataStructs::LinkedList::Base
-
#to_print
—
Algorithmable::DataStructs::Tree::BinarySearch
-
#to_s
—
Algorithmable::DataStructs::LinkedList::Base
-
#to_s
—
Algorithmable::DataStructs::Queue
-
#to_s
—
Algorithmable::DataStructs::Stack
-
#to_s
—
Algorithmable::Graphs::Undirected
-
#traverse
—
Algorithmable::Graphs::Traversals::BreadthFirst
-
#traverse
—
Algorithmable::Graphs::Traversals::DepthFirst
-
#traverse
—
Algorithmable::Searches::BinarySearch
-
#traverse_with_breadth_first
—
Algorithmable::Graphs::Traversals
-
#traverse_with_depth_first
—
Algorithmable::Graphs::Traversals
-
#union
—
Algorithmable::UnionFind::Impl
-
#union
—
Algorithmable::UnionFind::SimpleUnion
-
#valid_vertex?
—
Algorithmable::Graphs::Undirected
-
#visited?
—
Algorithmable::Graphs::Traversals::BreadthFirst
-
#visited?
—
Algorithmable::Graphs::Traversals::DepthFirst