Fix typos

Author: IanManske

src/Extractor/Program.fs

@@ -423,7 +423,7 @@ let main args =
     |> Array.ofSeq
   items |> Array.sortInPlaceBy (snd >> _.Id)
 
-  printfn "Successfully parsed all crops and items. Proced to output the data file and images? [y/N] "
+  printfn "Successfully parsed all crops and items. Proceed to output the data file and images? [y/N] "
 
   let writeImages =
     match System.Console.ReadLine().ToLower() with

src/WebApp/Info/Info.md

@@ -257,7 +257,7 @@ Put together, a well formed solution must plant crops in the following form/orde
 
 ## Solution
 Stardew Valley Stonks uses an integer [linear programming](https://en.wikipedia.org/wiki/Linear_programming) solver to find the optimal solution.
-This is in contrast to a [dynammic programming](https://en.wikipedia.org/wiki/Dynamic_programming) approach
+This is in contrast to a [dynamic programming](https://en.wikipedia.org/wiki/Dynamic_programming) approach
 which could become more and more unwieldy as the number and types of constraints increase — a situation ripe for bugs.
 By formulating the problem in terms of a linear programming problem,
 the numerous constraints can be described in a more declarative fashion.
@@ -286,7 +286,7 @@ algorithm is used to piece together a sequence of non-overlapping subproblems th
 > - and was not a WebAssembly port of an existing solver (these tend to have large bundle sizes which is not ideal)
 >
 > While the solver linked above is wonderful, its performance, however, was lacking for this use case.
-> That is, the solver should idealy be able solve all subproblems in under 100ms to provide
+> That is, the solver should ideally be able solve all subproblems in under 100ms to provide
 > immediate, interactive feedback to the user which is constantly editing settings.
 > Because of this, I made [my own](https://github.com/IanManske/YALPS) linear programming solver based upon the one linked above.
 > I targeted any low hanging fruit for performance improvement,

src/WebApp/Optimizer.fs

@@ -54,7 +54,7 @@ Put together, the variables should model the following timeline of harvests/crop
   - harvests of a regrow crop for the remaining days/season(s)
 
 All latter seasons in the dateSpan must be covered by bridge harvests or regrow crops as to carry over the fertilizer.
-If this is not possible, then no subproblem is genereated/solved for the given dateSpan.
+If this is not possible, then no subproblem is generated/solved for the given dateSpan.
 
 Taking the sequence of non-overlapping solved subproblems that provide the maximum profit
 yields the final optimal solution for the given game data and settings.

src/WebApp/Query.fs

@@ -805,9 +805,9 @@ module private ProfitSummaryCalc =
     seedCostAndQuantity |> Array.sortInPlaceWith (compareBy _.OpportunityCostPerSeed)
     seedCostAndQuantity
 
-  let private partitionQuantitesForSeeds data settings crop seedPrice prices quantites harvests =
+  let private partitionQuantitiesForSeeds data settings crop seedPrice prices quantities harvests =
     let items = Crop.items crop
-    let seedCostAndQuantity = seedCostAndQuantityData data settings crop seedPrice items prices quantites
+    let seedCostAndQuantity = seedCostAndQuantityData data settings crop seedPrice items prices quantities
 
     let quantitiesConsumedForSeeds = items |> Array.map (fun _ -> Array.zeroCreate Quality.count)
     let mutable seedsLeft = float (if Crop.regrows crop then 1u else harvests)
@@ -820,7 +820,7 @@ module private ProfitSummaryCalc =
       i <- i + 1
 
     let quantitiesConsumedForSeeds = quantitiesConsumedForSeeds |> Array.map Qualities.wrap
-    let soldQuantities = (quantites, quantitiesConsumedForSeeds) ||> Array.map2 (Qualities.map2 (-))
+    let soldQuantities = (quantities, quantitiesConsumedForSeeds) ||> Array.map2 (Qualities.map2 (-))
     let quantitiesConsumedForSeeds =
       Array.zip items quantitiesConsumedForSeeds
       |> Array.filter (fun (_, quantities) -> quantities <> Qualities.zero)
@@ -835,7 +835,7 @@ module private ProfitSummaryCalc =
 
     let soldQuantities, quantitiesForSeeds, seedsBought =
       if makeSeeds
-      then partitionQuantitesForSeeds data settings crop seedPrice prices quantities harvests
+      then partitionQuantitiesForSeeds data settings crop seedPrice prices quantities harvests
       else quantities, [||], 0.0
 
     let profit = profitCalc prices soldQuantities