Frunk Alternatives

frunk reviews and mentions

• Apply generic function to every tuple element
  1 project | /r/learnrust | 22 May 2023

  So rust doesn't support variadics, but I have heard some murmurings around the topic. In the meantime, you can still do a lot with recursive tras. The frunk crate makes working with them a lot easier: In this case

• Self Referencing structs with different generic types
  1 project | /r/learnrust | 24 Feb 2023

  I think the closest possible approach is the one used in frunk where those consecutive types are nested recursively (creating a linked list on type level basically) and special type is used as the end.

• Is there a convenient way to convert a struct<T> (where all fields are of type T) into struct<U> where U: From<T>?
  2 projects | /r/rust | 16 Feb 2023

  I suggest looking into frunk. You could convert the struct into an HList, map over the values to convert and convert into the target struct. README has some relevant examples.

• Can we make useful streaming APIs that disallow deadlocks?
  3 projects | /r/rust | 20 Jan 2023

  So a while back I got interested in how rust could provide parallel/concurrent APIs that prevent deadlocking shared state. I now created a Proof-of-Concept stream processing library that attempts to do that. The library makes prodigious use of heterogeneous lists from the frunk library. The basic idea is that you can build a graph by combining source streams as source nodes and mutexes for state, then you can add nodes which subscribe to subsets of the previous nodes using various combinators. You can either

• constduck: compile-time duck typing and reflection powered by const generics
  3 projects | /r/rust | 13 Nov 2021

  Hey, #[derive(LabelledGeneric)] from frunk does something like this, but without const generics, so it has odd representations for things like type-level strings (it's represented as a tuple of chars so (a, b, c) is the type-level representation of the string "abc")

• Symbolics.jl: A Modern Computer Algebra System for a Modern Language
  6 projects | news.ycombinator.com | 5 Mar 2021

  I don't understand why you call it "trickery or "fake". Church encoding of natural numbers is the same technique used in Agda, Coq and Idris to represent the Peano numbers. It's a completely valid encoding and isomorphic to any other representation.

  You don't need to use a fixed-length array either - you can used a recursive linked list at the type-level for an unbounded encoding [1]. The Scala library is an example of that; the Github page even has an example of encoding arbitrary units like sheep and wheat.

  [1] https://github.com/lloydmeta/frunk

• Generic associated types encode higher-order functions on types
  3 projects | /r/rust | 4 Jan 2021

  I wonder if frunk can (ab)use this kind of trick to make their crate even more powerful. IIRC they have a bunch of amazing and horrible workarounds to work with type-level lists.

• A note from our sponsor - CodeRabbit
  coderabbit.ai | 17 Mar 2025

  Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR. Learn more →