Skip to content

Commit 1bf311b

Browse files
committed
feat!: change Deno scope name
1 parent 2b71ca6 commit 1bf311b

File tree

3 files changed

+12
-12
lines changed

3 files changed

+12
-12
lines changed

README.md

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -28,31 +28,31 @@ This library provides a minimal yet powerful implementation of Lisp's symbolic e
2828
Deno
2929

3030
```sh
31-
deno add jsr:@ts/expression
31+
deno add jsr:@lambda/ts-expression
3232
```
3333

3434
Node.js (npx)
3535

3636
```sh
37-
npx jsr add @ts/expression
37+
npx jsr add @lambda/ts-expression
3838
```
3939

4040
Bun
4141

4242
```sh
43-
bunx jsr add @ts/expression
43+
bunx jsr add @lambda/ts-expression
4444
```
4545

4646
pnpm
4747

4848
```sh
49-
pnpm dlx jsr add @ts/expression
49+
pnpm dlx jsr add @lambda/ts-expression
5050
```
5151

5252
Yarn
5353

5454
```sh
55-
yarn dlx jsr add @ts/expression
55+
yarn dlx jsr add @lambda/ts-expression
5656
```
5757

5858
## Examples
@@ -92,7 +92,7 @@ calculateDistance(makePoint(-2, -3), makePoint(-4, 4)); // ≈ 7.28
9292
### Building a Binary Tree
9393

9494
```ts
95-
import { cons, car, cdr } from "@ts/expression";
95+
import { cons, car, cdr } from "@lambda/ts-expression";
9696

9797
const leaf = <T>(value: T) => cons(value, cons(null, null));
9898

@@ -113,7 +113,7 @@ car(car(cdr(tree))); // "left"
113113
### File System path representation
114114

115115
```ts
116-
import { cons, car, cdr } from "@ts/expression";
116+
import { cons, car, cdr } from "@lambda/ts-expression";
117117

118118
const node = <A, B>(a: A, b: B) => cons(a, b);
119119

deno.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
{
2-
"name": "@ts/expression",
2+
"name": "@lambda/ts-expression",
33
"version": "2.0.0",
44
"license": "MIT",
55
"tasks": {

mod.ts

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@ export type Cons<Car, Cdr> = {
1515
* @returns `true` if an arg is an s-expression, `false` - if it is not.
1616
*
1717
* @example
18-
* import { is_cons } from "@ts/expression";
18+
* import { is_cons } from "@lambda/ts-expression";
1919
*
2020
* is_cons(cons(42, 'hello')) // true
2121
* is_cons([42, 'hello']) // false
@@ -49,7 +49,7 @@ function assert_cons<Car, Cdr>(cons: Cons<Car, Cdr>): void {
4949
* @returns The first/left element (`car`) of the (`cons`) s-expression.
5050
*
5151
* @example
52-
* import { car } from "@ts/expression";
52+
* import { car } from "@lambda/ts-expression";
5353
*
5454
* car(cons(42, 'hello')); // 42
5555
*/
@@ -67,7 +67,7 @@ export function car<Car, Cdr>(cons: Cons<Car, Cdr>): Car {
6767
* @returns The second/right element (`car`) of the (`cons`) s-expression.
6868
*
6969
* @example
70-
* import { cdr } from "@ts/expression";
70+
* import { cdr } from "@lambda/ts-expression";
7171
*
7272
* cdr(cons(42, 'hello')); // 'hello'
7373
*/
@@ -87,7 +87,7 @@ export function cdr<Car, Cdr>(cons: Cons<Car, Cdr>): Cdr {
8787
* @returns cons - symbolic expression
8888
*
8989
* @example
90-
* import { cons } from "@ts/expression";
90+
* import { cons } from "@lambda/ts-expression";
9191
*
9292
* cons('hello', 'world')
9393
* // car -> 'hello'

0 commit comments

Comments
 (0)