https://github.com/grayvox/linked-lists

📋 Linked Lists, but in Ruby.
https://github.com/grayvox/linked-lists

computer-science ruby theodinproject

Last synced: about 1 month ago
JSON representation

📋 Linked Lists, but in Ruby.

• Host: GitHub
• URL: https://github.com/grayvox/linked-lists
• Owner: Grayvox
• Created: 2024-06-17T20:24:43.000Z (7 months ago)
• Default Branch: main
• Last Pushed: 2024-06-27T00:27:24.000Z (7 months ago)
• Last Synced: 2024-06-27T03:40:01.703Z (7 months ago)
• Topics: computer-science, ruby, theodinproject
• Language: Ruby
• Homepage:
• Size: 13.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Linked Lists in Ruby

Creates a functional Linked List object in Ruby!

This implementation includes the following methods to go with the object:

- [x] `#append(value)` -- adds a new node containing value to the end of the list

- [x] `#prepend(value)` -- adds a new node containing value to the start of the list

- [x] `#size` -- returns the total number of nodes in the list

- [x] `#head` -- returns the first node in the list

- [x] `#tail` -- returns the last node in the list

- [x] `#at(index)` -- returns the node at the given index

- [x] `#pop` -- removes the last element from the list

- [x] `#contains?(value)` -- returns true if the passed in value is in the list and otherwise returns false.

- [x] `#find(value)` -- returns the index of the node containing value, or nil if not found.

- [x] `#to_s` -- represent LinkedList objects as strings, so you can print them out and preview them in the console. Format is: ( value ) -> ( value ) -> ( value ) -> nil

- [x] `#insert_at(value, index)` -- inserts a new node with the provided value at the given index.

- [x] `#remove_at(index)` -- removes the node at the given index.