Update @types/mdast and friends

Author: wooorm

package.json

@@ -38,25 +38,25 @@
     "index.js"
   ],
   "dependencies": {
-    "@types/mdast": "^3.0.0",
-    "@types/unist": "^2.0.0",
+    "@types/mdast": "^4.0.0",
+    "@types/unist": "^3.0.0",
     "longest-streak": "^3.0.0",
-    "mdast-util-phrasing": "^3.0.0",
-    "mdast-util-to-string": "^3.0.0",
-    "micromark-util-decode-string": "^1.0.0",
-    "unist-util-visit": "^4.0.0",
+    "mdast-util-phrasing": "^4.0.0",
+    "mdast-util-to-string": "^4.0.0",
+    "micromark-util-decode-string": "^2.0.0",
+    "unist-util-visit": "^5.0.0",
     "zwitch": "^2.0.0"
   },
   "devDependencies": {
     "@types/node": "^20.0.0",
     "c8": "^8.0.0",
-    "mdast-util-from-markdown": "^1.0.0",
+    "mdast-util-from-markdown": "^2.0.0",
     "prettier": "^2.0.0",
     "remark-cli": "^11.0.0",
     "remark-preset-wooorm": "^9.0.0",
     "type-coverage": "^2.0.0",
     "typescript": "^5.0.0",
-    "unist-util-remove-position": "^4.0.0",
+    "unist-util-remove-position": "^5.0.0",
     "xo": "^0.54.0"
   },
   "scripts": {

test/index.js

@@ -3579,132 +3579,146 @@ test('roundtrip', () => {
   let tree = from('* a\n- b')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther`'
   )
 
   tree = from('* ---\n- - +\n+ b')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther` and lists that could turn into thematic breaks (1)'
   )
 
   tree = from('- - +\n* ---\n+ b')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther` and lists that could turn into thematic breaks (2)'
   )
 
   tree = from('- - +\n- -')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther` and lists that could turn into thematic breaks (3)'
   )
 
   tree = from('* - +\n    *\n    -\n    +')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther` and lists that could turn into thematic breaks (4)'
   )
 
   tree = from('* - +\n  - *\n    -\n    +')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther` and lists that could turn into thematic breaks (5)'
   )
 
   tree = from('- +\n- *\n  -\n  +')
 
   assert.deepEqual(
-    removePosition(tree, true),
-    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), true),
+    removePosition(tree, {force: true}),
+    removePosition(from(to(tree, {bullet: '*', bulletOther: '-'})), {
+      force: true
+    }),
     'should roundtrip different lists w/ `bulletOther` and lists that could turn into thematic breaks (6)'
   )
 
   tree = from('1. a\n1) b')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther`'
   )
 
   tree = from('1. ---\n1) 1. 1)\n1. b')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther` and lists that could turn into thematic breaks (1)'
   )
 
   tree = from('1. 1. 1)\n1) ---\n1. b')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther` and lists that could turn into thematic breaks (2)'
   )
 
   tree = from('1. 1. 1)\n1. 1.')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther` and lists that could turn into thematic breaks (3)'
   )
 
   tree = from('1. 1) 1.\n      1.\n      1)\n    1.')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther` and lists that could turn into thematic breaks (4)'
   )
 
   tree = from('1. 1) 1.\n   1) 1.\n     1)\n     1.')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther` and lists that could turn into thematic breaks (5)'
   )
 
   tree = from('1. 1)\n1. 1.\n   1)\n   1.')
 
   assert.deepEqual(
-    removePosition(tree, true),
+    removePosition(tree, {force: true}),
     removePosition(
       from(to(tree, {bulletOrdered: '.', bulletOrderedOther: ')'})),
-      true
+      {force: true}
     ),
     'should roundtrip different lists w/ `bulletOrderedOther` and lists that could turn into thematic breaks (6)'
   )
@@ -3753,8 +3767,8 @@ a *\\** is this emphasis? *\\**`
   tree = from(doc)
 
   assert.deepEqual(
-    removePosition(from(to(tree)), true),
-    removePosition(tree, true),
+    removePosition(from(to(tree)), {force: true}),
+    removePosition(tree, {force: true}),
     'should roundtrip asterisks (tree)'
   )
 
@@ -3786,8 +3800,8 @@ a _\\__ is this emphasis? _\\__`
   tree = from(doc)
 
   assert.deepEqual(
-    removePosition(from(to(tree)), true),
-    removePosition(tree, true),
+    removePosition(from(to(tree)), {force: true}),
+    removePosition(tree, {force: true}),
     'should roundtrip underscores (tree)'
   )