Skip to content

Commit

Permalink
chore(collections): improve deprecation notices (denoland#3812)
Browse files Browse the repository at this point in the history
chore(collections): update deprecations
  • Loading branch information
iuioiua committed Nov 16, 2023
1 parent 46add76 commit 1f31bc7
Show file tree
Hide file tree
Showing 5 changed files with 11 additions and 11 deletions.
6 changes: 3 additions & 3 deletions collections/binary_heap.ts
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@

export {
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/binary_heap.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/binary_heap.ts} instead.
*
* A priority queue implemented with a binary heap. The heap is in descending
* order by default, using JavaScript's built-in comparison operators to sort
Expand Down Expand Up @@ -51,13 +51,13 @@ export {

export {
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/comparators.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/comparators.ts} instead.
*
* Compares its two arguments for ascending order using JavaScript's built in comparison operators.
*/
ascend,
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/comparators.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/comparators.ts} instead.
*
* Compares its two arguments for descending order using JavaScript's built in comparison operators.
*/
Expand Down
4 changes: 2 additions & 2 deletions collections/binary_search_node.ts
Original file line number Diff line number Diff line change
Expand Up @@ -3,10 +3,10 @@

export {
/**
* @deprecated (will be removed in 0.207.0) Use {@linkcode BinarySearchTree} from `data_structures/binary_search_tree.ts` instead.
* @deprecated (will be removed in 0.209.0) Use {@linkcode BinarySearchTree} from {@link https://deno.land/std/data_structures/binary_search_tree.ts} instead.
*/
BinarySearchNode,
} from "../data_structures/_binary_search_node.ts";

/** @deprecated (will be removed in 0.207.0) Use "left" | "right" union class instead */
/** @deprecated (will be removed in 0.209.0) Use `"left" | "right"` union class instead */
export type Direction = "left" | "right";
2 changes: 1 addition & 1 deletion collections/binary_search_tree.ts
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@

export {
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/binary_search_tree.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/binary_search_tree.ts} instead.
*
* An unbalanced binary search tree. The values are in ascending order by default,
* using JavaScript's built-in comparison operators to sort the values.
Expand Down
4 changes: 2 additions & 2 deletions collections/red_black_node.ts
Original file line number Diff line number Diff line change
Expand Up @@ -3,10 +3,10 @@

export {
/**
* @deprecated (will be removed in 0.207.0) Use {@linkcode RedBlackTree} from `data_structures/red_black_tree.ts` instead.
* @deprecated (will be removed in 0.209.0) Use {@linkcode RedBlackTree} from {@link https://deno.land/std/data_structures/red_black_tree.ts} instead.
*/
RedBlackNode,
} from "../data_structures/_red_black_node.ts";

/** @deprecated (will be removed in 0.207.0) Use "left" | "right" union type instead */
/** @deprecated (will be removed in 0.209.0) Use `"left" | "right"` union type instead */
export type Direction = "left" | "right";
6 changes: 3 additions & 3 deletions collections/red_black_tree.ts
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@

export {
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/red_black_tree.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/red_black_tree.ts} instead.
*
* A red-black tree. This is a kind of self-balancing binary search tree. The
* values are in ascending order by default, using JavaScript's built-in
Expand Down Expand Up @@ -91,13 +91,13 @@ export {

export {
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/comparators.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/comparators.ts} instead.
*
* Compares its two arguments for ascending order using JavaScript's built in comparison operators.
*/
ascend,
/**
* @deprecated (will be removed in 0.209.0) Import from `data_structures/comparators.ts` instead.
* @deprecated (will be removed in 0.209.0) Import from {@link https://deno.land/std/data_structures/comparators.ts} instead.
*
* Compares its two arguments for descending order using JavaScript's built in comparison operators.
*/
Expand Down

0 comments on commit 1f31bc7

Please sign in to comment.