lol

lib: trivial spelling fixes

+16 -16
+3 -3
lib/attrsets.nix
··· 116 116 listToAttrs (concatMap (name: let v = set.${name}; in if pred name v then [(nameValuePair name v)] else []) (attrNames set)); 117 117 118 118 119 - /* Filter an attribute set recursivelly by removing all attributes for 119 + /* Filter an attribute set recursively by removing all attributes for 120 120 which the given predicate return false. 121 121 122 122 Example: ··· 334 334 value = f name (catAttrs name sets); 335 335 }) names); 336 336 337 - /* Implentation note: Common names appear multiple times in the list of 337 + /* Implementation note: Common names appear multiple times in the list of 338 338 names, hopefully this does not affect the system because the maximal 339 339 laziness avoid computing twice the same expression and listToAttrs does 340 340 not care about duplicated attribute names. ··· 353 353 zipAttrs = zipAttrsWith (name: values: values); 354 354 355 355 /* Does the same as the update operator '//' except that attributes are 356 - merged until the given pedicate is verified. The predicate should 356 + merged until the given predicate is verified. The predicate should 357 357 accept 3 arguments which are the path to reach the attribute, a part of 358 358 the first attribute set and a part of the second attribute set. When 359 359 the predicate is verified, the value of the first attribute set is
+2 -2
lib/composable-derivation.nix
··· 39 39 # 40 40 # issues: 41 41 # * its complicated to understand 42 - # * some "features" such as exact merge behaviour are burried in mergeAttrBy 42 + # * some "features" such as exact merge behaviour are buried in mergeAttrBy 43 43 # and defaultOverridableDelayableArgs assuming the default behaviour does 44 44 # the right thing in the common case 45 45 # * Eelco once said using such fix style functions are slow to evaluate ··· 48 48 # / add patches the way you want without having to declare function arguments 49 49 # 50 50 # nice features: 51 - # declaring "optional featuers" is modular. For instance: 51 + # declaring "optional features" is modular. For instance: 52 52 # flags.curl = { 53 53 # configureFlags = ["--with-curl=${curl.dev}" "--with-curlwrappers"]; 54 54 # buildInputs = [curl openssl];
+1 -1
lib/customisation.nix
··· 10 10 11 11 /* `overrideDerivation drv f' takes a derivation (i.e., the result 12 12 of a call to the builtin function `derivation') and returns a new 13 - derivation in which the attributes of the original are overriden 13 + derivation in which the attributes of the original are overridden 14 14 according to the function `f'. The function `f' is called with 15 15 the original derivation attributes. 16 16
+2 -2
lib/deprecated.nix
··· 253 253 # eg { a = 7; } { a = [ 2 3 ]; } becomes { a = [ 7 2 3 ]; } 254 254 mergeAttrsConcatenateValues = mergeAttrsWithFunc ( a: b: (toList a) ++ (toList b) ); 255 255 256 - # merges attributes using //, if a name exisits in both attributes 256 + # merges attributes using //, if a name exists in both attributes 257 257 # an error will be triggered unless its listed in mergeLists 258 258 # so you can mergeAttrsNoOverride { buildInputs = [a]; } { buildInputs = [a]; } {} to get 259 259 # { buildInputs = [a b]; } 260 - # merging buildPhase does'nt really make sense. The cases will be rare where appending /prefixing will fit your needs? 260 + # merging buildPhase doesn't really make sense. The cases will be rare where appending /prefixing will fit your needs? 261 261 # in these cases the first buildPhase will override the second one 262 262 # ! deprecated, use mergeAttrByFunc instead 263 263 mergeAttrsNoOverride = { mergeLists ? ["buildInputs" "propagatedBuildInputs"],
+1 -1
lib/fetchers.nix
··· 1 - # snippets that can be shared by mutliple fetchers (pkgs/build-support) 1 + # snippets that can be shared by multiple fetchers (pkgs/build-support) 2 2 { 3 3 4 4 proxyImpureEnvVars = [
+1 -1
lib/lists.nix
··· 191 191 */ 192 192 optional = cond: elem: if cond then [elem] else []; 193 193 194 - /* Return a list or an empty list, dependening on a boolean value. 194 + /* Return a list or an empty list, depending on a boolean value. 195 195 196 196 Example: 197 197 optionals true [ 2 3 ]
+1 -1
lib/modules.nix
··· 423 423 in concatMap (def: if getPrio def == highestPrio then [(strip def)] else []) defs; 424 424 425 425 /* Sort a list of properties. The sort priority of a property is 426 - 1000 by default, but can be overriden by wrapping the property 426 + 1000 by default, but can be overridden by wrapping the property 427 427 using mkOrder. */ 428 428 sortProperties = defs: 429 429 let
+2 -2
lib/strings.nix
··· 126 126 */ 127 127 makePerlPath = makeSearchPathOutput "lib" "lib/perl5/site_perl"; 128 128 129 - /* Dependening on the boolean `cond', return either the given string 130 - or the empty string. Useful to contatenate against a bigger string. 129 + /* Depending on the boolean `cond', return either the given string 130 + or the empty string. Useful to concatenate against a bigger string. 131 131 132 132 Example: 133 133 optionalString true "some-string"
+2 -2
lib/tests.nix
··· 231 231 }; 232 232 in { 233 233 expr = generators.toJSON {} val; 234 - # trival implementation 234 + # trivial implementation 235 235 expected = builtins.toJSON val; 236 236 }; 237 237 ··· 243 243 }; 244 244 in { 245 245 expr = generators.toYAML {} val; 246 - # trival implementation 246 + # trivial implementation 247 247 expected = builtins.toJSON val; 248 248 }; 249 249
+1 -1
lib/types.nix
··· 52 52 { # Human-readable representation of the type, should be equivalent to 53 53 # the type function name. 54 54 name 55 - , # Description of the type, defined recursively by embedding the the wrapped type if any. 55 + , # Description of the type, defined recursively by embedding the wrapped type if any. 56 56 description ? null 57 57 , # Function applied to each definition that should return true if 58 58 # its type-correct, false otherwise.