fst | Represent large sets and maps

I am a total script kitty at best and am trying to use google apps scripts to automate a process for me. Here a sample table like the one I am working with(data is in google sheets spreadsheet):

Variety Category Peter Courtney DP HBC 0.00 4.5 DP MNG 2.00 0 UB THN 7.00 0 471H THN 5.00 0 471H THN 0.00 5 GRH FST 4.00 0 GRH THN 8.00 0 GRH THN 0.00 8 GRH THN 0.00 8 HM HBC 6.50 0 HM HBC 0.00 6.5 HM MNG 2.00 0 HM MNG 0.00 2 CL HBC 8.50 0 CL HBC 7.00 0 PSV HBC 2.50 0 PSV HBC 7.00 0 PSV HBC 0.00 2.5

The table shows the employees reported hours broken down by Variety and category. My goal is to compile this data so if the employees work at the same category and same variety I want all hours expressed in a single line. For instance if you look at the last two rows of the data you'll notice that the Variety and Category columns are matching which means the data should be compiled. So instead of:

Variety Category Peter Courtney PSV HBC 7.00 0 PSV HBC 0.00 2.5

I want to compile the data like this:

Variety Category Peter Courtney PSV HBC 7.00 2.5

I am trying to do this from the bottom up because I heard going from the top down can cause issues but I am open to any suggestions. I think I need to write a for loop that compares the variety box of the active row to the variety box of the above row AND compares if the category box of the active row is equal to the category box of the above row and if both are true add the hours of both the "Peter" column and "Courtney" column.

I know there is more to do on top of that but this for loop is what I really need help on, unless you can suggest a better way?

Thanks for looking at my work, JP

Stackoverflow member Ruben has asked me to elaborate more, here is where I am at:

I found a stackoverflow answer that pushed me in the direction of how to parse the data with the for loop. Here is the for loop skeleton I am working with:

...

I have wrote this Inductive predicate and part of the proof for its (strong) specification:

...

I have a asp.net application, where I wanted to use a premade bootstrap template for my frontend. I found this one. The original site from the template looks really nice with a background like this:

I copied all the css into my css folder, and also took the html and cut some parts of it out such that I could just render my own content in it. My _layout.cshtml that should be a scaffolding for other html files looks now like this:

...

I wanted to create a method, that interprets this List (The method "words" splits a String into a list of words, that are seperated by \s.) in postfix-notation. This is what I got, by I am wondering if there is a shorter way to solve this, as I am repeating myself quite often there.

...

I want to change terminal/taxa colour to blue, for specific taxa.

I'd like to change "Pomquet Lake", "Lake Ainslie", "Black River", "Pinchgut Lake", and "Blue Pond" to blue. is there a way to do this?

Code (figure below):

...

#!/bin/bash

ctime=date +%s
# returns 1618634997 to $ctime

stime=$(wget --server-response --spider http://www.server.org/news_32.mp3 2>&1 | grep -i Last-Modified)

# returns : Last-Modified: Sat, 17 Apr 2021 04:49:57 GMT # into the variable $stime

I need to convert $stime to epoch time, put it in $etime to compare them, and decide to download file, or not.

Need some code to manipulate the string.

to do date comparison

...

I'm working in Cubical agda and trying to build up some common utilities for later proofs. One of these is that for any type A it is the 'same' as the type Σ A (\_ -> Top) where Top is the type with one element. And the issue is how to best expose this 'sameness' from the utility library. I can expose it as an equivalence, a path or an isomorphism, and maybe multiple ones.

I originally exposed it as just a path: top-path : Path A (Σ A (\_ -> Top)) which is built up using glue types from an underlying top-equiv : A ≃ Σ A (\_ -> Top). But when trying to use this in later proofs I found out that transporting along this path did not compute as I expected. My expectation was that it composed with fst to the identity, but in practice I found that it sometimes left in transp and prim^unglue terms. This was not the case if I used a particular concrete type for A, or if I used a similar construction using the equivalence.

Example:

...

I'm trying to create an instance for bind operator (>>=) to the custom type ST a

I found this way to do it but I don't like that hardcoded 0.

Is there any way to implement it without having the hardcoded 0 and respecting the type of the function?

...

I'm new to haskell and I dont know why I'm getting an extra element in a list.

Here's my code:

...