@depup/postcss 8.5.8-depup.0 → 8.5.21-depup.0

package/LICENSE

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright 2013 Andrey Sitnik <andrey@sitnik.ru>
+Copyright 2013 Andrey Sitnik <andrey@sitnik.es>
 
 Permission is hereby granted, free of charge, to any person obtaining a copy of
 this software and associated documentation files (the "Software"), to deal in

package/README.md

@@ -13,8 +13,8 @@ npm install @depup/postcss
 
 | Field | Value |
 |-------|-------|
-| Original | [postcss](https://www.npmjs.com/package/postcss) @ 8.5.8 |
-| Processed | 2026-03-09 |
+| Original | [postcss](https://www.npmjs.com/package/postcss) @ 8.5.21 |
+| Processed | 2026-07-21 |
 | Smoke test | passed |
 | Deps updated | 1 |
 
@@ -22,7 +22,7 @@ npm install @depup/postcss
 
 | Dependency | From | To |
 |------------|------|-----|
-| nanoid | ^3.3.11 | ^5.1.6 |
+| nanoid | ^3.3.16 | ^6.0.0 |
 
 ---
 

package/changes.json

@@ -1,10 +1,10 @@
 {
   "bumped": {
     "nanoid": {
-      "from": "^3.3.11",
-      "to": "^5.1.6"
+      "from": "^3.3.16",
+      "to": "^6.0.0"
     }
   },
-  "timestamp": "2026-03-09T04:19:07.402Z",
+  "timestamp": "2026-07-21T17:29:17.055Z",
   "totalUpdated": 1
 }

package/lib/at-rule.d.ts

@@ -49,7 +49,6 @@ declare namespace AtRule {
     raws?: AtRuleRaws
   }
 
-   
   export { AtRule_ as default }
 }
 

package/lib/comment.d.ts

@@ -26,7 +26,6 @@ declare namespace Comment {
     text: string
   }
 
-   
   export { Comment_ as default }
 }
 

package/lib/container.d.ts

@@ -8,11 +8,7 @@ import Rule from './rule.js'
 declare namespace Container {
   export type ContainerWithChildren<Child extends Node = ChildNode> = {
     nodes: Child[]
-  } & (
-    | AtRule
-    | Root
-    | Rule
-  )
+  } & (AtRule | Root | Rule)
 
   export interface ValueOptions {
     /**
@@ -43,7 +39,6 @@ declare namespace Container {
     | string
     | undefined
 
-   
   export { Container_ as default }
 }
 

package/lib/container.js

@@ -8,18 +8,25 @@ let { isClean, my } = require('./symbols')
 let AtRule, parse, Root, Rule
 
 function cleanSource(nodes) {
-  return nodes.map(i => {
-    if (i.nodes) i.nodes = cleanSource(i.nodes)
-    delete i.source
-    return i
-  })
+  let stack = nodes.slice()
+  while (stack.length > 0) {
+    let node = stack.pop()
+    delete node.source
+    if (node.nodes) {
+      node.nodes = node.nodes.slice()
+      for (let i of node.nodes) stack.push(i)
+    }
+  }
+  return nodes.slice()
 }
 
 function markTreeDirty(node) {
-  node[isClean] = false
-  if (node.proxyOf.nodes) {
-    for (let i of node.proxyOf.nodes) {
-      markTreeDirty(i)
+  let stack = [node]
+  while (stack.length > 0) {
+    let next = stack.pop()
+    next[isClean] = false
+    if (next.proxyOf.nodes) {
+      for (let i of next.proxyOf.nodes) stack.push(i)
     }
   }
 }
@@ -47,9 +54,18 @@ class Container extends Node {
   }
 
   cleanRaws(keepBetween) {
-    super.cleanRaws(keepBetween)
-    if (this.nodes) {
-      for (let node of this.nodes) node.cleanRaws(keepBetween)
+    let stack = [this]
+    while (stack.length > 0) {
+      let node = stack.pop()
+      if (node !== this && node.cleanRaws !== Container.prototype.cleanRaws) {
+        // Subclass with own logic; let it handle its subtree
+        node.cleanRaws(keepBetween)
+        continue
+      }
+      Node.prototype.cleanRaws.call(node, keepBetween)
+      if (node.nodes) {
+        for (let child of node.nodes) stack.push(child)
+      }
     }
   }
 
@@ -309,19 +325,48 @@ class Container extends Node {
   }
 
   walk(callback) {
-    return this.each((child, i) => {
+    if (!this.proxyOf.nodes) return undefined
+
+    // An explicit stack instead of recursive `each()` calls to survive
+    // deeply nested trees. Each frame keeps a live `indexes` slot, so
+    // insertion and removal during the walk behave like `each()`: the
+    // slot stays at the current child until its subtree is finished.
+    let stack = [{ iterator: this.getIterator(), node: this.proxyOf }]
+
+    while (stack.length > 0) {
+      let { iterator, node } = stack[stack.length - 1]
+      let index = node.indexes[iterator]
+
+      if (index >= node.proxyOf.nodes.length) {
+        delete node.indexes[iterator]
+        stack.pop()
+        let parent = stack[stack.length - 1]
+        // Finish the parent’s step for the child subtree we just left
+        if (parent) parent.node.indexes[parent.iterator] += 1
+        continue
+      }
+
+      let child = node.proxyOf.nodes[index]
       let result
       try {
-        result = callback(child, i)
+        result = callback(child, index)
       } catch (e) {
         throw child.addToError(e)
       }
-      if (result !== false && child.walk) {
-        result = child.walk(callback)
+      if (result === false) {
+        for (let opened of stack) {
+          delete opened.node.indexes[opened.iterator]
+        }
+        return false
+      }
+      if (child.walk && child.proxyOf.nodes) {
+        stack.push({ iterator: child.getIterator(), node: child })
+      } else {
+        node.indexes[iterator] += 1
       }
+    }
 
-      return result
-    })
+    return undefined
   }
 
   walkAtRules(name, callback) {
@@ -424,24 +469,26 @@ Container.default = Container
 
 /* c8 ignore start */
 Container.rebuild = node => {
-  if (node.type === 'atrule') {
-    Object.setPrototypeOf(node, AtRule.prototype)
-  } else if (node.type === 'rule') {
-    Object.setPrototypeOf(node, Rule.prototype)
-  } else if (node.type === 'decl') {
-    Object.setPrototypeOf(node, Declaration.prototype)
-  } else if (node.type === 'comment') {
-    Object.setPrototypeOf(node, Comment.prototype)
-  } else if (node.type === 'root') {
-    Object.setPrototypeOf(node, Root.prototype)
-  }
+  let stack = [node]
+  while (stack.length > 0) {
+    let next = stack.pop()
+    if (next.type === 'atrule') {
+      Object.setPrototypeOf(next, AtRule.prototype)
+    } else if (next.type === 'rule') {
+      Object.setPrototypeOf(next, Rule.prototype)
+    } else if (next.type === 'decl') {
+      Object.setPrototypeOf(next, Declaration.prototype)
+    } else if (next.type === 'comment') {
+      Object.setPrototypeOf(next, Comment.prototype)
+    } else if (next.type === 'root') {
+      Object.setPrototypeOf(next, Root.prototype)
+    }
 
-  node[my] = true
+    next[my] = true
 
-  if (node.nodes) {
-    node.nodes.forEach(child => {
-      Container.rebuild(child)
-    })
+    if (next.nodes) {
+      for (let child of next.nodes) stack.push(child)
+    }
   }
 }
 /* c8 ignore stop */

package/lib/css-syntax-error.d.ts

@@ -16,7 +16,6 @@ declare namespace CssSyntaxError {
     line: number
   }
 
-   
   export { CssSyntaxError_ as default }
 }
 

package/lib/declaration.d.ts

@@ -39,7 +39,6 @@ declare namespace Declaration {
     value: string
   }
 
-   
   export { Declaration_ as default }
 }
 

package/lib/document.d.ts

@@ -16,7 +16,6 @@ declare namespace Document {
     raws?: Record<string, any>
   }
 
-   
   export { Document_ as default }
 }
 

package/lib/fromJSON.d.ts

@@ -4,6 +4,6 @@ interface FromJSON extends JSONHydrator {
   default: FromJSON
 }
 
-declare const fromJSON: FromJSON
+declare let fromJSON: FromJSON
 
 export = fromJSON

package/lib/fromJSON.js

@@ -8,26 +8,24 @@ let PreviousMap = require('./previous-map')
 let Root = require('./root')
 let Rule = require('./rule')
 
-function fromJSON(json, inputs) {
-  if (Array.isArray(json)) return json.map(n => fromJSON(n))
-
-  let { inputs: ownInputs, ...defaults } = json
-  if (ownInputs) {
-    inputs = []
-    for (let input of ownInputs) {
-      let inputHydrated = { ...input, __proto__: Input.prototype }
-      if (inputHydrated.map) {
-        inputHydrated.map = {
-          ...inputHydrated.map,
-          __proto__: PreviousMap.prototype
-        }
+function hydrateInputs(json, inputs) {
+  if (!json.inputs) return inputs
+  return json.inputs.map(input => {
+    let inputHydrated = { ...input, __proto__: Input.prototype }
+    if (inputHydrated.map) {
+      inputHydrated.map = {
+        ...inputHydrated.map,
+        __proto__: PreviousMap.prototype
       }
-      inputs.push(inputHydrated)
     }
-  }
-  if (defaults.nodes) {
-    defaults.nodes = json.nodes.map(n => fromJSON(n, inputs))
-  }
+    return inputHydrated
+  })
+}
+
+function constructNode(json, inputs, children) {
+  let defaults = { ...json }
+  delete defaults.inputs
+  delete defaults.nodes
   if (defaults.source) {
     let { inputId, ...source } = defaults.source
     defaults.source = source
@@ -35,19 +33,74 @@ function fromJSON(json, inputs) {
       defaults.source.input = inputs[inputId]
     }
   }
+
+  let node
   if (defaults.type === 'root') {
-    return new Root(defaults)
+    node = new Root(defaults)
   } else if (defaults.type === 'decl') {
-    return new Declaration(defaults)
+    node = new Declaration(defaults)
   } else if (defaults.type === 'rule') {
-    return new Rule(defaults)
+    node = new Rule(defaults)
   } else if (defaults.type === 'comment') {
-    return new Comment(defaults)
+    node = new Comment(defaults)
   } else if (defaults.type === 'atrule') {
-    return new AtRule(defaults)
+    node = new AtRule(defaults)
   } else {
     throw new Error('Unknown node type: ' + json.type)
   }
+
+  // Rehydrated children are attached after construction. Passing them
+  // through the container constructor would re-run insertion spacing
+  // normalization and overwrite each child's own `raws.before`.
+  if (children) {
+    node.nodes = children
+    for (let child of children) child.parent = node
+  }
+
+  return node
+}
+
+function fromJSON(json, inputs) {
+  if (Array.isArray(json)) return json.map(n => fromJSON(n))
+
+  // An explicit stack instead of recursive calls to survive deeply
+  // nested trees. Children are rehydrated before their parent node
+  // is constructed.
+  let result
+  let stack = [
+    { childIndex: 0, children: [], inputs: hydrateInputs(json, inputs), json }
+  ]
+
+  while (stack.length > 0) {
+    let frame = stack[stack.length - 1]
+    let jsonNodes = frame.json.nodes
+
+    if (jsonNodes && frame.childIndex < jsonNodes.length) {
+      let childJson = jsonNodes[frame.childIndex]
+      frame.childIndex += 1
+      stack.push({
+        childIndex: 0,
+        children: [],
+        inputs: hydrateInputs(childJson, frame.inputs),
+        json: childJson
+      })
+      continue
+    }
+
+    stack.pop()
+    let node = constructNode(
+      frame.json,
+      frame.inputs,
+      jsonNodes ? frame.children : undefined
+    )
+    if (stack.length > 0) {
+      stack[stack.length - 1].children.push(node)
+    } else {
+      result = node
+    }
+  }
+
+  return result
 }
 
 module.exports = fromJSON

package/lib/input.d.ts

@@ -49,7 +49,6 @@ declare namespace Input {
     url: string
   }
 
-   
   export { Input_ as default }
 }
 

package/lib/input.js

@@ -142,7 +142,15 @@ class Input {
       )
     }
 
-    result.input = { column, endColumn, endLine, endOffset, line, offset, source: this.css }
+    result.input = {
+      column,
+      endColumn,
+      endLine,
+      endOffset,
+      line,
+      offset,
+      source: this.css
+    }
     if (this.file) {
       if (pathToFileURL) {
         result.input.url = pathToFileURL(this.file).toString()
@@ -198,12 +206,21 @@ class Input {
     if (!this.map) return false
     let consumer = this.map.consumer()
 
-    let from = consumer.originalPositionFor({ column, line })
+    let from = consumer.originalPositionFor({ column: column - 1, line })
     if (!from.source) return false
 
     let to
     if (typeof endLine === 'number') {
-      to = consumer.originalPositionFor({ column: endColumn, line: endLine })
+      let toPosition = consumer.originalPositionFor({
+        column: endColumn - 1,
+        line: endLine
+      })
+      // The source map may not have a mapping that covers the end position
+      // (`originalPositionFor()` then returns `null` for `line`/`column`
+      // instead of omitting them). Treat that the same as not requesting
+      // an end position at all, so `endLine`/`endColumn` stay a consistent
+      // `undefined` pair instead of a mix of `null` and a bogus number.
+      if (toPosition.source) to = toPosition
     }
 
     let fromUrl
@@ -218,8 +235,8 @@ class Input {
     }
 
     let result = {
-      column: from.column,
-      endColumn: to && to.column,
+      column: from.column + 1,
+      endColumn: to && to.column + 1,
       endLine: to && to.line,
       line: from.line,
       url: fromUrl.toString()

package/lib/lazy-result.d.ts

@@ -6,7 +6,6 @@ import Root from './root.js'
 import Warning from './warning.js'
 
 declare namespace LazyResult {
-   
   export { LazyResult_ as default }
 }
 
@@ -19,9 +18,9 @@ declare namespace LazyResult {
  * const lazy = postcss([autoprefixer]).process(css)
  * ```
  */
-declare class LazyResult_<RootNode = Document | Root>
-  implements PromiseLike<Result<RootNode>>
-{
+declare class LazyResult_<RootNode = Document | Root> implements PromiseLike<
+  Result<RootNode>
+> {
   /**
    * Processes input CSS through synchronous and asynchronous plugins
    * and calls onRejected for each error thrown in any plugin.

package/lib/lazy-result.js

@@ -97,8 +97,14 @@ function toStack(node) {
 }
 
 function cleanMarks(node) {
-  node[isClean] = false
-  if (node.nodes) node.nodes.forEach(i => cleanMarks(i))
+  let stack = [node]
+  while (stack.length > 0) {
+    let next = stack.pop()
+    next[isClean] = false
+    if (next.nodes) {
+      for (let i of next.nodes) stack.push(i)
+    }
+  }
   return node
 }
 
@@ -378,6 +384,19 @@ class LazyResult {
     if (opts.stringifier) str = opts.stringifier
     if (str.stringify) str = str.stringify
 
+    let rootSource = this.result.root.source
+    if (
+      opts.map === undefined &&
+      !(rootSource && rootSource.input && rootSource.input.map)
+    ) {
+      let result = ''
+      str(this.result.root, i => {
+        result += i
+      })
+      this.result.css = result
+      return this.result
+    }
+
     let map = new MapGenerator(str, this.result.root, this.result.opts)
     let data = map.generate()
     this.result.css = data[0]
@@ -516,21 +535,57 @@ class LazyResult {
   }
 
   walkSync(node) {
+    // An explicit stack like in async `visitTick()` to survive deeply
+    // nested trees. Unlike `visitTick()`, nodes are marked clean only
+    // on entering, so a node dirtied by its own visitors is revisited
+    // on the next pass.
     node[isClean] = true
-    let events = getEvents(node)
-    for (let event of events) {
-      if (event === CHILDREN) {
-        if (node.nodes) {
-          node.each(child => {
-            if (!child[isClean]) this.walkSync(child)
-          })
+    let stack = [{ eventIndex: 0, events: getEvents(node), iterator: 0, node }]
+
+    while (stack.length > 0) {
+      let visit = stack[stack.length - 1]
+      let visitNode = visit.node
+
+      if (visit.iterator !== 0) {
+        let iterator = visit.iterator
+        let child
+        let descended = false
+        while ((child = visitNode.nodes[visitNode.indexes[iterator]])) {
+          visitNode.indexes[iterator] += 1
+          if (!child[isClean]) {
+            child[isClean] = true
+            stack.push({
+              eventIndex: 0,
+              events: getEvents(child),
+              iterator: 0,
+              node: child
+            })
+            descended = true
+            break
+          }
         }
-      } else {
-        let visitors = this.listeners[event]
-        if (visitors) {
-          if (this.visitSync(visitors, node.toProxy())) return
+        if (descended) continue
+        visit.iterator = 0
+        delete visitNode.indexes[iterator]
+      }
+
+      if (visit.eventIndex < visit.events.length) {
+        let event = visit.events[visit.eventIndex]
+        visit.eventIndex += 1
+        if (event === CHILDREN) {
+          if (visitNode.nodes && visitNode.nodes.length) {
+            visit.iterator = visitNode.getIterator()
+          }
+        } else {
+          let visitors = this.listeners[event]
+          if (visitors) {
+            if (this.visitSync(visitors, visitNode.toProxy())) stack.pop()
+          }
         }
+        continue
       }
+
+      stack.pop()
     }
   }
 

package/lib/list.d.ts

@@ -55,6 +55,6 @@ declare namespace list {
   }
 }
 
-declare const list: list.List
+declare let list: list.List
 
 export = list

package/lib/no-work-result.d.ts

@@ -6,7 +6,6 @@ import Root from './root.js'
 import Warning from './warning.js'
 
 declare namespace NoWorkResult {
-   
   export { NoWorkResult_ as default }
 }
 

package/lib/no-work-result.js

@@ -2,7 +2,7 @@
 
 let MapGenerator = require('./map-generator')
 let parse = require('./parse')
-const Result = require('./result')
+let Result = require('./result')
 let stringify = require('./stringify')
 let warnOnce = require('./warn-once')
 

package/lib/node.d.ts

@@ -31,12 +31,12 @@ declare namespace Node {
 
   export interface Position {
     /**
-     * Source line in file. In contrast to `offset` it starts from 1.
+     * Source column in file. It starts from 1.
      */
     column: number
 
     /**
-     * Source column in file.
+     * Source line in file. It starts from 1.
      */
     line: number
 
@@ -126,7 +126,6 @@ declare namespace Node {
     word?: string
   }
 
-   
   class Node extends Node_ {}
   export { Node as default }
 }