MoreLINQ
aoc2021
Our great sponsors
MoreLINQ | aoc2021 | |
---|---|---|
21 | 13 | |
3,590 | 0 | |
1.0% | - | |
7.8 | 0.0 | |
26 days ago | almost 2 years ago | |
C# | Rust | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
MoreLINQ
- What your hidden nuget gems ?
-
Do you know about the DistinctBy method?
You can grab MoreLinq off of Nuget for pre-.NET6 and it has a DistinctBy implementation that you might be able to use: https://github.com/morelinq/MoreLINQ
-
Three words.,, => C# Functional Programming is awesome!!! Do you seasoned developers have any war-stories or nightmare stories regarding Functional Programming?
Install "morelinq" 3.3.2 from Nuget: https://www.nuget.org/packages/morelinq You know you got the right one if it has about 37.2 million downloads.
-
Is there a reason why a WithIndex() extension method isn't apart of the standard library?
If you don't already know about it, I highly recommend checking out the MoreLINQ open source project which adds a bunch of these less common but still occasionally useful extensions to LINQ. They also include an Index method which does exactly what your WithIndex method does, yielding out KeyValuePair entries for each iteration.
- How to remove duplicates from a list, I've tried multiple approaches but with no luck. Can You help me out or point me in the right direction, please. My attempts are in the post
-
Just had a Senior Technical Interview that was so bad and such a waste of time that I burnt that bridge and burnt it hard. If this is how your company interviews people please stop.
yield return is a significant core piece of the framework. It's the basis of which most deferred execution and LINQ is built upon and any extension one would want to add to LINQ. (for example)
-
it feels as though the LINQ queries are inferior to simply using the Enumerable extensions, is there something i'm missing?
For a time, I'd say the Query Syntax was comparatively as popular as the Method Syntax. But over the years as LINQ became ubiquitous for working with non-database queries (LINQ-to-Objects) and more users extended them (for example, MoreLinq) the Method Syntax became more popular. I'd say nowadays the Query Syntax is relatively rare to see and perhaps mostly limited to direct database queries or these scenarios like "join" that are easier.
-
Full outer join in LINQ
I suggest morelinq https://github.com/morelinq/MoreLINQ
-
Things I don't like or confused me in C#
If you don't already know about it, take a gander at the MoreLINQ extensions. I don't think it solves this particular problem, but it's a great example of extending LINQ.
-
-🎄- 2021 Day 1 Solutions -🎄-
It's part of the MoreLinq library. The Window() function code is here.
aoc2021
-
I learned a bit about Path Finding Algos today
Can confirm, I implemented Djkstra badly (I made it visit every single cell, instead of stopping once it reached the end, since that's what wikipedia did), switched to A* w/o visiting every single cell, got the answer for part 2, and returned to the non-stupid Djkstra and measured -- A* with manhattan distance is about 5ms faster than A* with euclidean distance (since it avoids the square root, and the euclidean distance is actually less appropriate in this situation), and Djkstra beats the Manhattan distance by another 5ms. You can look through all my implementations in the commit history for this file: https://github.com/ritobanrc/aoc2021/blob/main/src/day15.rs
-
-🎄- 2021 Day 11 Solutions -🎄-
Rust, not my proudest code, honestly quite messy, I couldn't decide whether to represent points as Vector2 or usizes into a vector, using both a HashSet for flashed but a Vec for to_flash feels silly, especially since it calls contains on both in the same condition, nor am I proud of the rightward drift resulting in five layers of braces, and the messy conditions on neighbor. But nonetheless, it works, and part 2 was easy enough to hack in on top of part 1, with a couple extra lines (albeit, still a bit messy, with a range 0..usize::MAX since bounded and unbounded ranges are different types, and an unreachable!() in the match statement at the end).
-
-🎄- 2021 Day 10 Solutions -🎄-
Rust. I found today surprisingly easy, much better than the last couple -- part 1 was quite simple, just keep a list of the open ones and close them as necessary. Part 2 should have been trivial to implement on top of that, but I wasn't correctly discarding the corrupted lines, and apparently sorting a list and finding the median without off-by-one errors is hard, so that took a while to debug.
-
-🎄- 2021 Day 8 Solutions -🎄-
Rust -- part 1 was fairly easy, but I had absolutely no clue how to do part 2 for a long time. I ended up just brute forcing it, trying every single possible wire re-arrangement (thanks itertools::permutations). I used a bitmask to represent which lights were on (no idea if its necessary), but it was a fun exercise trying to get the bit fiddling right -- I was pleasantly surprised when it just worked (ig that's the benefit of writing small, fairly self-contained routines). My initial answer for part 2 was also reversed (3535 instead of 5353), which is why there's a rev in there near the end. Overall, very fun challenge -- I enjoyed not knowing how to approach it initially, and I'm sure lots of people will have far more clever solutions.
-
-🎄- 2021 Day 7 Solutions -🎄-
Rust, basic bruteforce solution. Played around with trying to find an analytic solution for a couple mins, but ended up just brute forcing it, and surprisingly, its not absurdly slow.
-
-🎄- 2021 Day 6 Solutions -🎄-
Rust. Unsurprisingly, I did the naive thing for part 1 and then had to re-write for part 2. I'm happy with how clean part 2 is, I just used a Rust array for the counts -- though I'm sure there's a more clean solution for shifting an iterator.
-
Advent of Code rust nuggets
From u/ritobanrc (full solution): use nalgebra::Matrix5 and you can use column_iter() and row_iterator() on your board.
-
-🎄- 2021 Day 4 Solutions -🎄-
Rust -- Happy with how my code turned out for today. I used nalgebra's Matrix5 for storing the boards, which made checking for wins pretty easy.
-
-🎄- 2021 Day 2 Solutions -🎄-
Rust, nothing special here, not particularly fast (I initially thought aim should be a vector and lost some time because of it). The error handling could be a bit cleaner, I might fiddle with that for a bit so I don't have to put .unwraps and .expect and panic! everywhere.
-
-🎄- 2021 Day 1 Solutions -🎄-
Here's my solution without any collects: https://github.com/ritobanrc/aoc2021/blob/main/src/day01.rs -- but I don't think you could do it without itertools, since windows is only implemented for slices, and array_windows for iterators is still unstable (pending const-generics).
What are some alternatives?
language-ext - C# functional language extensions - a base class library for functional programming
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:
NetFabric.Hyperlinq - High performance LINQ implementation with minimal heap allocations. Supports enumerables, async enumerables, arrays and Span<T>.
AdventOfCode2021.jl - Advent of Code 2021 in Julia
Extensions-And-Utilities-For-Unity - A collection of Extension methods and Utility classes for the System, UnityEngine, and UnityEditor namespaces.
aoc2021
JFlepp.Maybe - A Maybe type for C#, aimed as an idiomatic port of the option type in F# to C#
advent-of-code - https://adventofcode.com/
Curryfy - Provides strongly typed extensions methods for C# delegates to take advantages of functional programming techniques, like currying and partial application.
advent-of-code-2021
Optional - A robust option type for C#
advent-of-rust-2021 - Solutions to Advent of Code 2021 in Rust