Skip to content

Instantly share code, notes, and snippets.

View nicolasstucki's full-sized avatar
🌴
On vacation

Nicolas Stucki nicolasstucki

🌴
On vacation
124 followers · 1 following
  • LAMP / EPFL
  • Switzerland
View GitHub Profile
@nicolasstucki
nicolasstucki / patmat.md
Created October 9, 2020 08:08

Pattern Matching

Huffman coding is a compression algorithm that can be used to compress lists of characters.

In a normal, uncompressed text, each character is represented by the same number of bits (usually eight). In Huffman coding, each character can have a bit representation of a different length, depending on how common a character is: the characters that appear often in a text are represented by a shorter bit sequence than those being used more rarely. Every huffman code defines the specific bit sequences used to represent each character.

A Huffman code can be represented by a binary tree whose leaves represent the characters that should be encoded.

@nicolasstucki
nicolasstucki / contibution.md
Last active November 11, 2020 14:42

(The Scala Org aims to release Scala 3 by the end of fall 2020. We are about 15 employees (some of whom work part-time), spread in 4 organisations (+ active community members), focusing on finalising 52 essential projects in 6 months. As of today, project leads will publish the road-maps under the category “Scala 3 release projects” to share with you what is to be expected and hopefully get your advice & contributions as well. All the projects’ road-maps come after an extensive feedback gathering, rounds of discussion, and involvement of major stakeholders, we now need the community to help push this effort over the line. Your collaboration is highly appreciated, thank you in advance!)

We are starting to write the initial draft of the macro tutorial. Help improving text that has been written so far would be helpful at this point. Another extreamely valuable addition would be to update the [migration status][migration-status].

This tutorial will cover all that is needed to start writing macros. The first p

@nicolasstucki
nicolasstucki / Quote Scopes.md
Last active May 19, 2020 21:55

This is an overview/discussion on the current problems with quotes and splices and a potential solution that would also make them fully compatible with TASTy reflect (not seal/unsleal).

Current state

In this section, we will have an overview of how quotations scopes work and interact with the low level tasty API.

We have four basic concepts

  • Expr[T]: Represents an expression of type T. It is a wrapper around the AST of the expression.
  • Type[T]: Represents the type T. It is a wrapper around the AST containing the type.
  • QuoteContext: Materialization of the current scope of expression. It also contains the tasty API.
@nicolasstucki
nicolasstucki / t10387b.scala
Created August 22, 2018 15:28
object foo {
abstract sealed class num
final case class One() extends num
final case class Bit0(a: num) extends num
final case class Bit1(a: num) extends num
abstract sealed class char
final case class zero_char() extends char
final case class Char(a: num) extends char
@nicolasstucki
nicolasstucki / opaque.TASTY
Created March 15, 2018 07:48
**** pickled info of object opaquetypes
Names:
0: ASTs
1: <empty>
2: opaquetypes
3: opaquetypes[ModuleClass]
4: <init>
5: <init>[Signed Signature(List(),opaquetypes$)]
6: java
7: lang
@nicolasstucki
nicolasstucki / #2903 output
Created October 20, 2017 08:01
```
def test(x: Object): Unit =
{
case val x117: Object = x
def case378(): Unit = throw new MatchError(x117)
def case379(): Unit =
if x117.isInstanceOf[Foo29] then
{
case val x118: Foo29 = x117.asInstanceOf[Foo29]
case val x119: Foo29 = Foo29.unapply(x118)
@nicolasstucki
nicolasstucki / Unused Parameters Spec.md
Last active December 24, 2017 15:04

Unused Parameters Spec

This spec assumes the existance of implicit funtion types.

The Unused Modifier

LocalModifier   ::= ‘unused’
@nicolasstucki
nicolasstucki / Inline hot method too big
Last active October 12, 2017 14:08
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
dotty.tools.backend.jvm.DottyBackendInterface$$anon$10::toTypeKind (637 bytes) hot method too big
@nicolasstucki
nicolasstucki / Inline too deep Inlining too deep MaxInlineLevel=35 MaxRecursiveInlineLevel=2
Last active October 12, 2017 13:52
dotty.tools.backend.jvm.GenBCodePipeline::gen$1 (214 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::contains (81 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::unionPos (174 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.TreeInfo::forallResults (208 bytes) recursive inlining is too deep
@nicolasstucki
nicolasstucki / Inline too deep Inlining too deep MaxInlineLevel=35
Created October 12, 2017 13:43
dotty.tools.backend.jvm.GenBCodePipeline$$Lambda$1917/74220773::applyVoid (12 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::contains (81 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$tools$dotc$ast$Positioned$contains$$isParent$1 (61 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$tools$dotc$ast$Positioned$contains$$isParent$1 (61 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$tools$dotc$ast$Positioned$contains$$isParent$1 (61 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$tools$dotc$ast$Positioned$contains$$isParent$1 (61 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$tools$dotc$ast$Positioned$contains$$isParent$1 (61 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$tools$dotc$ast$Positioned$contains$$isParent$1 (61 bytes) recursive inlining is too deep
dotty.tools.dotc.ast.Positioned::dotty$t