Fix lint errors

pkg/applier/applyinator.go

@@ -27,7 +27,7 @@ type Options struct {
 }
 
 // Applyinator is an interface that eventually ensures that a requested action, identified by some key,
-// is applied. Any object that implements Applyinator should provide the same guarentees as the
+// is applied. Any object that implements Applyinator should provide the same guarantees as the
 // k8s.io/client-go/util/workqueue implementation, namely:
 //
 // * Fair: items processed in the order in which they are added.
@@ -44,7 +44,7 @@ type Applyinator interface {
 
 // NewApplyinator allows you to register a function that applies an action based on whether a particular
 // key is enqueued via a call to Apply. It implements k8s.io/client-go/util/workqueue under the hood, which
-// allows us to ensure that the apply function is called with the following guarentees (provided by workqueues):
+// allows us to ensure that the apply function is called with the following guarantees (provided by workqueues):
 //
 // * Fair: items processed in the order in which they are added.
 // * Stingy: a single item will not be processed multiple times concurrently,

pkg/controllers/namespace/controller.go

@@ -204,7 +204,7 @@ func (h *handler) applyProjectRegistrationNamespaceForNamespace(namespace *corev
 	// with a lot of namespaces all trying to run the exact same apply operation
 	// at the exact same time; however, the client-go workqueue implementation
 	// (which lasso controllers use under the hood as well) allow us to add the registration
-	// namespace to the queue with certain guarentees, namely this one that we need:
+	// namespace to the queue with certain guarantees, namely this one that we need:
 	//
 	// * Stingy: a single item will not be processed multiple times concurrently,
 	// and if an item is added multiple times before it can be processed, it

pkg/controllers/project/merge.go

@@ -55,11 +55,11 @@ func getMap(entry interface{}) (map[string]interface{}, bool) {
 func convertMapInterfaceInterfaceToMapStringInterface(entry map[interface{}]interface{}) (map[string]interface{}, bool) {
 	out := make(map[string]interface{}, len(entry))
 	for k, v := range entry {
-		kString, isString := k.(string)
+		key, isString := k.(string)
 		if !isString {
 			return nil, false
 		}
-		out[kString] = v
+		out[key] = v
 	}
 	return out, true
 }