JSON Depth Profile
Profile JSON node depths with root depth zero, counting containers and scalar leaves explicitly.
Description
Profile JSON node depths with root depth zero, counting containers and scalar leaves explicitly.
Deeply nested JSON can be harder to inspect and process than a flat document with the same number of values. A depth profile separates nesting depth from total size.
When to use this tool
Profile JSON node depths with root depth zero, counting containers and scalar leaves explicitly.
- Prepare the supplied documentJson fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter documentJson. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.maximumDepth, result.nodesPerDepth. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Walk all nodes with the root at depth zero. Count nodes at each depth, return those counts in ascending depth order, and report the maximum encountered depth. Empty containers still count as nodes.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| documentJson | JSON text, entered as one text field. The decoded structure is illustrated below; it is not a separate file. | Text |
For the JSON text fields, the following decoded structures show the example records before they are serialized into input strings. Keep field names, list nesting and value types as shown.
[
{
"field": "documentJson",
"decoded": {
"a": [
1
]
}
}
]| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.maximumDepth | The maximum depth value under the stated formula or text convention. |
| result.nodesPerDepth | The nodes per depth list in the ordering and representation described above. |
{
"input": {
"documentJson": "{\"a\":[1]}"
},
"output": {
"result": {
"maximumDepth": 2,
"nodesPerDepth": [
{
"depth": 0,
"count": 1
},
{
"depth": 1,
"count": 1
},
{
"depth": 2,
"count": 1
}
]
}
}
}Limitations and assumptions
- Depth includes containers and scalar leaves. The input parser's own nesting and size bounds apply before profiling, so this is not an unlimited-depth stress tester.
- Decoded JSON is bounded to 20,000 nodes and 32 nesting levels; record arrays have at most 128 records. Parsed number values use JavaScript floating point rather than arbitrary-precision decimal arithmetic.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Ordinary string lists have at most 128 entries of at most 128 code units each; numeric lists and matrices have separate bounded size checks. Nonfinite results and excessively large serialized outputs are rejected.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
For document-wide requirements, combine these structural inventories with an explicit JSON Schema. Preserve the distinction between missing properties and null values, and between numbers and numeric-looking strings when building joins or indexes.
References
Similar or alternative tools
- JSON Container Width Profile
Profile immediate child counts of all JSON containers, retaining empty arrays and objects.
- json all or none key presence
Check all-or-none own member presence for an explicit key group; absent versus null is preserved.