-
Having the `Node` abstraction it should be possible to design the query methods in a slightly different way:
``` rust
trait DataQuery {
fn query_data bool) -> SomeIterator(&'a self, recurse: |&Se…
-
Sub-typing in the constructor is suffice.
-
## Правила разметки
- **Ширина текста** - 80.
## Правила перевода
- **Текст в примерах кода** - переводится. [^0]
- **Сообщения об ошибках компилятора** - не переводятся.
- **Специальные markdown заго…
-
# Introduction
Halogen components currently suffer from a variety of drawbacks:
- **Queries**. It is not possible to extract information from components. Since components close over their state, this…
-
This seems related to: #8219
**Reproduce code:**
```scala
case class Foo[+T[_]](activity:T[Long])
type Cell[T] = T
def insertCell(u:Foo[Cell]) = ???
insertCell(Foo(5))
```
**Expected…
-
Hi Paul,
I have been also writing a library that brings many functional concepts to C#. It is called Flop (Functional Library for Object Programs) https://github.com/johtela/Flop. Like yourself I hav…
-
- checked/typed exceptions are anti-modular; try basing stuff off of MonadThrow or something to get that SML feel
- let me run the thing in IO if I please
-
This compiles without error:
``` scala
import scala.language.higherKinds
trait Base {
type Rep[T]
}
trait BaseExp extends Base {
type Rep[T] = Exp[T]
case class Exp[T](v: T)
}
```
The next t…
namin updated
10 years ago
-
This code:
``` haxe
typedef Mappable = {
public function map (f:T->B):Array;
}
class Test {
public static function main() {
function mapMappable (m:Mappable, f:A->B):Mappable {
ret…
-
This will be needed as part of unboxed closures to complete the transition.
Nominating for P-backcompat-lang as a dependency of #14798.