Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Activity
  • Sep 20 21:41
    SethTisue edited #787
  • Sep 20 21:40
    SethTisue commented #789
  • Sep 20 21:40
    SethTisue demilestoned #9763
  • Sep 20 21:40
    SethTisue closed #9763
  • Sep 20 21:40
    SethTisue commented #9763
  • Sep 20 21:32
    SethTisue synchronize #9763
  • Sep 20 21:30
    SethTisue commented #9763
  • Sep 20 21:30
    scala-jenkins milestoned #9763
  • Sep 20 21:30
    SethTisue reopened #9763
  • Sep 20 21:28

    SethTisue on scala-dev

    bye bye AdoptOpenJDK hello Temu… (compare)

  • Sep 20 21:28
    SethTisue closed #789
  • Sep 20 21:28
    SethTisue closed #788
  • Sep 20 21:28
    SethTisue synchronize #789
  • Sep 20 21:28
    SethTisue edited #789
  • Sep 20 21:27
    SethTisue opened #789
  • Sep 20 21:24
    SethTisue commented #788
  • Sep 20 21:23
    SethTisue commented #788
  • Sep 20 20:43
    SethTisue synchronize #1487
  • Sep 20 20:42
    SethTisue synchronize #1486
  • Sep 20 20:06
    SethTisue synchronize #1487
Felix Bruckmeier
@felixbr
Seems like lampepfl/dotty is still used even though it's not called dotty anymore.
cmhteixeira
@cmhteixeira

Hello there fellow devs,

I want to share a small library I just published with you.
Its called delegate-macro.
Its is a small macro annotation to automatically delegate/proxy the implementation of an interface to a dependency.
It has been super helpful to me when I have to implement the "delegate pattern" for an interface with dozens of methods.
Maybe you will also find it useful.
I developed against Scala 2. If there seems to be interest, I will hack for Scala 3.

Repo: https://github.com/cmhteixeira/delegate-macro

Guillaume Martres
@smarter
scala 3 doesn't have macro annotations but it has https://dotty.epfl.ch/docs/reference/other-new-features/export.html
sinanspd
@sinanspd

Just out of curiosity, Are CASECLASS & CASEOBJECT worth stating as intro tokens ?

final val templateIntroTokens: TokenSet = BitSet(CLASS, TRAIT, OBJECT, ENUM, CASECLASS, CASEOBJECT)

It seems to me like the token that is captures is CASE which is then unified based on the next token (result of lookAhead())

sinanspd
@sinanspd
never mind. It doesn't compile if I remove them from the set so apparently it is used somewhere. I will go through the code again and try to find it
Rob Norris
@tpolecat
Can someone explain using even smaller words why the match type in this blog post doesn’t reduce? https://twitter.com/scala_lang/status/1402534271600967680?s=21
I don’t understand the error message.
There is a case for B.
I understand the irony of not understanding the error message in a blog post about improved error messages.
Tom Grigg
@griggt
I took it to mean that B cannot be shown to be disjoint from A, but I have no idea what I'm talking about.
Rob Norris
@tpolecat
That’s what it says but why not? X is exactly B which is unrelated to A other than both subtyping Any, which is true of any pair of Scala types.
Martijn
@martijnhoekstra:matrix.org
[m]
I think the point is that there may be some C extends A with B, but I don't understand what the point is anymore
Rob Norris
@tpolecat
But X is B. We know it’s not C.
Tom Grigg
@griggt
yes, it reduces if at least one of A or B is sealed
Martijn
@martijnhoekstra:matrix.org
[m]
there is more documentation on the documentation of match types: https://dotty.epfl.ch/docs/reference/new-types/match-types.html, which mentions
The compiler implements the following reduction algorithm:

If the scrutinee type `S` is an empty set of values (such as Nothing or String & Int), do not reduce.
Sequentially consider each pattern Pi
If S <: Pi reduce to Ti.
Otherwise, try constructing a proof that S and Pi are disjoint, or, in other words, that no value s of type S is also of type Pi.
If such proof is found, proceed to the next case (Pi+1), otherwise, do not reduce.
Rob Norris
@tpolecat
We know B is not a subtype of A.
Why do we care if there may some day be a value that’s both an A and a B?
Match types are absolutely baffling.
Martijn
@martijnhoekstra:matrix.org
[m]
They are covariant in some way it seems
trait Base
class Derived extends Base

type M[X] = X match {
  case Base => Int
  case Derived => String
}

def testit: Int = 7: M[Derived]
this compiles
Rob Norris
@tpolecat
...
ooookay
Martijn
@martijnhoekstra:matrix.org
[m]
😶
Bjorn Regnell
@bjornregnell
Would it be possible to also allow the new control syntax in 2.13.x? if then, while do, for do
Guillaume Martres
@smarter
@tpolecat, it's not very different from term match, if you write case x: Base => ...; case x: Derived => ... you're always going to hit the first case
in fact the whole point is that you can write your term match to mirror your match type
(and give your term match an expected type which is that match type, and have that infer correctly)
and the compiler prevents you from doing the reduction in situations where it cannot know at compile-time which case would be taken at runtime
Rob Norris
@tpolecat
Thanks, that’s helpful.
Guillaume Martres
@smarter
I'm glad :)
Rob Norris
@tpolecat
It seems awkward to me to have type and term-level representations of the same program, plus all the machinery to ensure that they are consistent, as opposed to the shapeless style where they are woven together. I will have to play around with it some more.
Seth Tisue
@SethTisue

Would it be possible to also allow the new control syntax in 2.13.x? if then, while do, for do

if a pull request came in adding that under -Xsource:3 I can't see why it wouldn't be accepted

Bjorn Regnell
@bjornregnell
@SethTisue That would be really cool in these times of migration.

if a pull request came in adding that under -Xsource:3 I can't see why it wouldn't be accepted

Would it be sensible if I create an issue on scala/bug for this enhancement?

Oron Port
@soronpo
There is something very annoying yet very satisfying in minimizing compiler crash issues. It can take up to several hours of mind-numbing work, but still it calls to me like a moth to a flame.
Jasper Moeys
@Jasper-M

It seems awkward to me to have type and term-level representations of the same program, plus all the machinery to ensure that they are consistent, as opposed to the shapeless style where they are woven together.

That's my biggest issue with the type-level stuff in scala 3. The main issue against shapeless style type-level programming seemed to be that you have to switch to a Prologish mindset. But at least in that style all the type-level and value-level code beautifully works together. With scala 3 match types and mirrors and all that stuff, types and implementations are separated and often you have to use casts to make them agree.

cmhteixeira
@cmhteixeira

Dear type-level masters, how is the below possible?

class Door[State <: DoorState] {
    def doorKey: Int = 1
    def open[Phatom >: State <: Closed.type]: Door[Open.type] = new Door[Open.type]
    def close[Phatom >: State <: Open.type]: Door[Closed.type] = new Door[Closed.type]
}

sealed trait DoorState
case object Closed extends DoorState
case object Open extends DoorState

println(aClosedDoor.open.close.close.doorKey == 1)  // How come this is compiling?

I am able to close a closed door. The compiler is not enforcing type bounds
Is this a bug? Am I missing something?
(also published on scala/scala gitter channel)

Rob Norris
@tpolecat
You can make Open and Closed extend some supertrait and parameterized it as [A <: DoorState] if you like but it probably doesn't matter.
Upper bounds are rarely necessary.
Guillaume Martres
@smarter
@tpolecat conversation on this issue was moved to scala/scala
Rob Norris
@tpolecat
ah
Guillaume Martres
@smarter
(spoiler: it's fixed in dotty)
cmhteixeira
@cmhteixeira
@tpolecat As smarter says, its on scala/scala. Thanks. The question was also more with the objective of understanding why that was happening. I was already aware of the implicit alternative. I appreciate it though!
For reference, we ended up opening this ticket: scala/bug#12413
Rob Norris
@tpolecat
ok
Swoorup Joshi
@Swoorup
this should ideally fail type check isn’t it?
import scala.language.implicitConversions

type Timeframe = "1m" | "2m" | "1H"
type TimeframeN = 1 | 2 | 60

def manualConvertToN(tf: Timeframe): TimeframeN = tf match
  case "1m" => 1
  case "2m" => 2
  case "1H" => 60
  case "4H" => 60 // incorrect
Rob Norris
@tpolecat
Seems like a bug to me. Looks like it's checking that the LHS is a string (case true => ... fails) but it needs to check that it's a Timeframe.
Swoorup Joshi
@Swoorup
yep logged a bug: lampepfl/dotty#12805
seems to prematurly widen