- Pick random vertex
q
- Traverse the graph breadth-first until a loop is detected, then stop traversing that branch entirely
- If loops that have the same paths are detected on the same level, count only one of those
- Delete vertex
q
and go to 1
View pfwsl.ps1
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
$remoteport = bash.exe -c "ifconfig eth0 | grep 'inet '" | |
$found = $remoteport -match '\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}'; | |
if( $found ){ | |
$remoteport = $matches[0]; | |
} else{ | |
echo "The Script Exited, the ip address of WSL 2 cannot be found"; | |
exit; | |
} |
View loopy-graph.md
View DoAuth 0.3 crypto_test.fprof
This file has been truncated, but you can view the full file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Reading trace data... | |
.................................................. | |
................................................., | |
.................................................. | |
................................................., | |
................................. | |
Finished in 5.2 seconds (0.00s async, 5.2s sync) | |
11 tests, 0 failures |
View Dockerfile
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
FROM gradle:7.3.0-jdk17 as builder | |
WORKDIR /app | |
COPY . /app/ | |
RUN gradle --no-daemon bootJar | |
FROM openjdk:17-slim | |
COPY --from=builder /app/build/libs/evaluation-task-LATEST.jar /opt/app.jar | |
EXPOSE 8080 | |
USER 65534:65534 |
View gist:313937c16c4cdebeae51e5c99778421a
Monad Stacks
Before you read this: This chapter does not attempt to introduce the concept of a monad in general, it assume this as a given and explains the monads and constructs on top of them that are essential to Lean meta programming. If you don't know what a monad is already you can read (TODO: Link to monad tutorial).
Monad Transformers
Quite often in functional programming with monads one wants to have the power of more than one monad available. Specifically in Lean meta programming it is a very common pattern that we have some sort of read only input, an
View undaunted-draft.md
Deck building
You can only have cards of factions that were in a military alliance at some point during the war:
- Allies & Soviets
- Allies & Italians
- Germans & Italians
- Germans & Soviets
View undaunted++.md
Deterministically Undaunted
Starting Hand
Starting hand every turn is 5.
Casualties
Casualties are first removed from the deck, then discard, then hand.