From 20a1f414eaa1d51cf66c6100e5b3b41e8745cf53 Mon Sep 17 00:00:00 2001
From: Vipul A M <vipulnsward@gmail.com>
Date: Sat, 22 Jun 2013 13:49:43 +0530
Subject: [PATCH] Fix some typos

---
 lib/rake/linked_list.rb    | 2 +-
 lib/rake/task_arguments.rb | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/lib/rake/linked_list.rb b/lib/rake/linked_list.rb
index 26483703f..7369e83ac 100644
--- a/lib/rake/linked_list.rb
+++ b/lib/rake/linked_list.rb
@@ -80,7 +80,7 @@ def self.empty
     #
     # When inheriting from the LinkedList class, you should implement
     # a type specific Empty class as well. Make sure you set the class
-    # instance variable @parent to the assocated list class (this
+    # instance variable @parent to the associated list class (this
     # allows conj, cons and make to work polymorphically).
     class EmptyLinkedList < LinkedList
       @parent = LinkedList
diff --git a/lib/rake/task_arguments.rb b/lib/rake/task_arguments.rb
index 009468257..1e40b3bbe 100644
--- a/lib/rake/task_arguments.rb
+++ b/lib/rake/task_arguments.rb
@@ -21,12 +21,12 @@ def initialize(names, values, parent=nil)
       }
     end
 
-    # Retrive the complete array of sequential values
+    # Retrieve the complete array of sequential values
     def to_a
       @values.dup
     end
 
-    # Retrive the list of values not associated with named arguments
+    # Retrieve the list of values not associated with named arguments
     def extras
       @values[@names.length..-1] || []
     end