docs: add time complexity to relevant primops

Author: hsjobeki

src/libexpr/primops.cc

@@ -3000,7 +3000,7 @@ static RegisterPrimOp primop_attrNames({
       alphabetically sorted list. For instance, `builtins.attrNames { y
       = 1; x = "foo"; }` evaluates to `[ "x" "y" ]`.
 
-      ## Time Complexity
+      # Time Complexity
 
       - O(n) best case (attribute set already sorted)
       - O(n log n) worst case (requires sorting), where:
@@ -3039,7 +3039,7 @@ static RegisterPrimOp primop_attrValues({
       Return the values of the attributes in the set *set* in the order
       corresponding to the sorted attribute names.
 
-      ## Time Complexity
+      # Time Complexity
 
       - O(n) best case (attribute set already sorted)
       - O(n log n) worst case (requires sorting), where:
@@ -4004,7 +4004,7 @@ static RegisterPrimOp primop_any({
       Return `true` if the function *pred* returns `true` for at least one
       element of *list*, and `false` otherwise.
 
-      ## Time Complexity
+      # Time Complexity
 
       O(n * T_f) where:
 
@@ -4028,7 +4028,7 @@ static RegisterPrimOp primop_all({
       Return `true` if the function *pred* returns `true` for all elements
       of *list*, and `false` otherwise.
 
-      ## Time Complexity
+      # Time Complexity
 
       O(n * T_f) where:
 
@@ -4311,7 +4311,7 @@ static RegisterPrimOp primop_groupBy({
       T_f = grouping function evaluation time
       k = number of unique groups
     )",
-    T_f = grouping function evaluation time k = number of unique groups.fun = prim_groupBy,
+    .fun = prim_groupBy,
 });
 
 static void prim_concatMap(EvalState & state, const PosIdx pos, Value ** args, Value & v)