Skip to content

Conversation

cmofx
Copy link
Contributor

@cmofx cmofx commented Apr 30, 2025

/claim #31

I added new function wildcardType in LightTypeTag to create bounds wildcard type tag.

Also changed the TacMacro in scala 3 and scala 2 to parse the tag type bound parameters and summon the type tags accordingly

Also fixed a bug in the scala 2 ReflectionUtil.scala that TypeBound's lower bound is not checked for strong type

@CLAassistant
Copy link

CLAassistant commented Apr 30, 2025

CLA assistant check
All committers have signed the CLA.

@neko-kai
Copy link
Member

@cmofx Great work! 👍

Could you please also tests for recursive bound case, such as x[T[_]: TagK, U: Tag] = Tag[Set[_ <: T[U]]] ?

@cmofx
Copy link
Contributor Author

cmofx commented Apr 30, 2025

@cmofx Great work! 👍

Could you please also tests for recursive bound case, such as x[T[_]: TagK, U: Tag] = Tag[Set[_ <: T[U]]] ?

Just added the support for recursive bound case, updated the SharedTagTest.scala

@pshirshov
Copy link
Member

Looks nice for me, thank you for your help.

Copy link
Member

@neko-kai neko-kai left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM, will try to merge tomorrow 👍

@cmofx
Copy link
Contributor Author

cmofx commented May 5, 2025

Updated the way to map LightTypeTag.ref to AbstractReference

Copy link
Member

@neko-kai neko-kai left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@cmofx I reviewed in detail and found a failure when TagMacro combination inside bounds is combined with covariance on Scala 2.12/2.13, could you please look at it? Thanks. The details are in the PR comments

@neko-kai neko-kai merged commit b3cf73e into zio:develop May 7, 2025
17 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants