-
### 📜 Description
Apologies if this has been raised before, I took a search through issues and couldn't see anything/
[Pre-requisites](https://backstage.io/docs/getting-started/#prerequisites) sta…
-
```julia-repl
julia> using Flux, CUDA
julia> x = randn(5); x2 = (x, x); cx2 = gpu(x2);
julia> cx2[1] === cx2[2] # Flux v0.14.24
false
julia> cx2[1] === cx2[2] # Flux v0.14.20
true
```
…
-
This is a great crate, I've been using it extensively in [my project](https://github.com/lbfalvy/orchid) to derive partially modified trees with minimal cloning. It is easily my favourite crate so far…
-
### Minimal example
If we compile the following example using OCaml 5.2.0:
```ocaml
module S (M : sig
type t
end) =
struct
type 'a u = M.t constraint 'a = M.t
let id x : M.t u = x
…
phink updated
1 month ago
-
Take a look at the "Functor" project (yea I know, terrible name for a overload system) and compare it to Platypus' implementation of method overloading.
-
## 연관 챕터
#17
## 조사 내용
p.170 에 Functor 가 되기 위한 2 가지 조건이 나옵니다.
1. 부수효과가 없어야 한다.
2. 합성이 가능해야 한다.
이는 다른 책에서 아래와 같이 설명합니다.
1. 부수효과가 없어야 한다.
`fmap(identity()) == identity()` 즉, fmap 에 identity …
-
If we make this:
``` factor
USING: arrays assocs compiler.units eval fry interpolate
io.streams.string kernel lexer locals.parser locals.types make
multiline namespaces parser sequences vocabs.parser…
-
In general,
```haskell
ixSureDef :: (Representable f, Eq (Rep f)) => Rep f -> Lens' (f a) a
ixSureDef i f fa = (\x' -> Rep.tabulate (\k -> if k == i then x' else Rep.index fa k)) f (Rep.index …
-
```ts
interface MyFunctor {
map(project: (t: T) => U): MyFunctor
}
declare const myFunctor: MyFunctor
const result = R.map(() => 1)(myFunctor)
```
![image](https://user-images.githubuse…
-
## Reason
Functors are great and we want more of them
### Proposed updates
This is copying some of the items from https://github.com/idaholab/moose/issues/19420#issuecomment-971851106
**Pr…