Hi Jordan, yes.
Sorry for not looking in detail.
Thanks.
On Tue, Jul 9, 2019 at 11:32 PM Jordan Harband wrote:
> Are you perhaps looking for https://github.com/tc39/proposal-set-methods ?
>
> On Tue, Jul 9, 2019 at 1:18 PM Oğuz Kılıç wrote:
>
>> Yes, I already consider it as an enriched
Are you perhaps looking for https://github.com/tc39/proposal-set-methods ?
On Tue, Jul 9, 2019 at 1:18 PM Oğuz Kılıç wrote:
> Yes, I already consider it as an enriched version of the current set
> method, I just like calling it superset :)
>
> On Tue, Jul 9, 2019 at 11:05 PM Григорий Карелин
>
Yes, I already consider it as an enriched version of the current set
method, I just like calling it superset :)
On Tue, Jul 9, 2019 at 11:05 PM Григорий Карелин wrote:
> Maybe add those methods into Set instead of creating new type?
>
> On Tue, 9 Jul 2019 at 23:02, Oğuz Kılıç wrote:
>
>> As
Maybe add those methods into Set instead of creating new type?
On Tue, 9 Jul 2019 at 23:02, Oğuz Kılıç wrote:
> As you know, the current Set feature is not sufficient in some aspects. We
> benefit from utility libraries or special implementations to fill this
> deficiency.
>
> For example,
As you know, the current Set feature is not sufficient in some aspects. We
benefit from utility libraries or special implementations to fill this
deficiency.
For example, wouldn’t it be better if we had the following approach?
UNION
X ∪ Y = { x | x ∈ X or x ∈ Y }
let first = new SuperSet(["a",
Lexer already sees `++` as operator, not `+` operator**s**. It can be hard to
implement something like that.
___
es-discuss mailing list
es-discuss@mozilla.org
https://mail.mozilla.org/listinfo/es-discuss
Nice,
https://github.com/tc39/proposal-slice-notation/issues/19#issuecomment-421453934
is
really awesome. I hope this idea doesn't get abandoned
I feel you can swap things easily already;
```js
let x = 1, y = 2;
[x, y] = [y, x];
```
Chunks could be written
```js
// take chunks of 4 from arr
//
7 matches
Mail list logo
