fix add maxBy and max to quickref #786

quickref/quickref.tex

@@ -755,10 +755,8 @@
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \clearpage
-
-\head{Methods in trait \texttt{Iterable[A]}}\Newline
-
-{\small\renewcommand{\arraystretch}{1.16}
+\vspace*{-2.0em}\head{Methods in trait \texttt{Iterable[A]}}\Newline
+{\small\renewcommand{\arraystretch}{1.14}
 \begin{tabular}{@{}l p{3.6cm} p{6.8cm}}
 \textbf{What} & \textbf{Usage} & \textbf{Explanation} f is a function, pf is a partial funct., p is a predicate.\\ \hline
 Traverse: & \texttt{xs.foreach(f)} & Executes f for every element of xs. Return type Unit.\\ \cline{1-3}
@@ -810,7 +808,9 @@
       & \texttt{xs.reduceLeft(op) \newline xs.reduceRight(op)} & Similar to foldLeft/foldRight, but xs must be non-empty, starting with first element instead of z.\\ \cline{2-3}
       & \texttt{xss.flatten} & xss (a collection of collections) is reduced by concatenation.\\ \cline{2-3}
       & \texttt{xs.sum xs.product} & Calculates the sum/product of numeric elements.\\\cline{2-3}
-      & \texttt{xs.minOption~xs.maxOption} & ~~Finds a min/max value based on implicitly available ordering.  \\
+      & \texttt{xs.min xs.max} & Finds the minimum/maximum of numeric elements.\\
+      & \texttt{xs.minBy(f)~xs.maxBy(f)} & Finds the min/max of value after applying f to each element.\\\cline{2-3}
+      & \texttt{xs.minOption~xs.maxOption} & ~Finds a min/max value based on implicitly available ordering.  \\
       & \texttt{xs.minByOption(f)} & Finds a min/max value after applying f to each element. \\\cline{1-3}