@wordpress/block-library 7.4.0 → 7.7.0

package/src/table-of-contents/utils.js

@@ -1,126 +0,0 @@
-/**
- * @typedef WPHeadingData
- *
- * @property {string} anchor  The anchor link to the heading, or '' if none.
- * @property {string} content The plain text content of the heading.
- * @property {number} level   The heading level.
- */
-
-/**
- * Extracts text, anchor, and level from a list of heading elements.
- *
- * @param {NodeList} headingElements The list of heading elements.
- *
- * @return {WPHeadingData[]} The list of heading parameters.
- */
-export function getHeadingsFromHeadingElements( headingElements ) {
-	return [ ...headingElements ].map( ( heading ) => ( {
-		// A little hacky, but since we know at this point that the tag will
-		// be an H1-H6, we can just grab the 2nd character of the tag name and
-		// convert it to an integer. Should be faster than conditionals.
-		level: parseInt( heading.tagName[ 1 ], 10 ),
-		anchor: heading.hasAttribute( 'id' ) ? `#${ heading.id }` : '',
-		content: heading.textContent,
-	} ) );
-}
-
-/**
- * Extracts heading data from the provided content.
- *
- * @param {string} content The content to extract heading data from.
- *
- * @return {WPHeadingData[]} The list of heading parameters.
- */
-export function getHeadingsFromContent( content ) {
-	// Create a temporary container to put the post content into, so we can
-	// use the DOM to find all the headings.
-	const tempPostContentDOM = document.createElement( 'div' );
-	tempPostContentDOM.innerHTML = content;
-
-	// Remove template elements so that headings inside them aren't counted.
-	// This is only needed for IE11, which doesn't recognize the element and
-	// treats it like a div.
-	for ( const template of tempPostContentDOM.querySelectorAll(
-		'template'
-	) ) {
-		template.remove();
-	}
-
-	const headingElements = tempPostContentDOM.querySelectorAll(
-		'h1:not(:empty), h2:not(:empty), h3:not(:empty), h4:not(:empty), h5:not(:empty), h6:not(:empty)'
-	);
-
-	return getHeadingsFromHeadingElements( headingElements );
-}
-
-/**
- * @typedef WPNestedHeadingData
- *
- * @property {WPHeadingData}              heading  The heading content, anchor,
- *                                                 and level.
- * @property {number}                     index    The index of this heading
- *                                                 node in the entire nested
- *                                                 list of heading data.
- * @property {WPNestedHeadingData[]|null} children The sub-headings of this
- *                                                 heading, if any.
- */
-
-/**
- * Takes a flat list of heading parameters and nests them based on each header's
- * immediate parent's level.
- *
- * @param {WPHeadingData[]} headingList The flat list of headings to nest.
- * @param {number}          index       The current list index.
- *
- * @return {WPNestedHeadingData[]} The nested list of headings.
- */
-export function linearToNestedHeadingList( headingList, index = 0 ) {
-	const nestedHeadingList = [];
-
-	headingList.forEach( ( heading, key ) => {
-		if ( heading.content === '' ) {
-			return;
-		}
-
-		// Make sure we are only working with the same level as the first iteration in our set.
-		if ( heading.level === headingList[ 0 ].level ) {
-			// Check that the next iteration will return a value.
-			// If it does and the next level is greater than the current level,
-			// the next iteration becomes a child of the current iteration.
-			if (
-				headingList[ key + 1 ] !== undefined &&
-				headingList[ key + 1 ].level > heading.level
-			) {
-				// We need to calculate the last index before the next iteration that has the same level (siblings).
-				// We then use this last index to slice the array for use in recursion.
-				// This prevents duplicate nodes.
-				let endOfSlice = headingList.length;
-				for ( let i = key + 1; i < headingList.length; i++ ) {
-					if ( headingList[ i ].level === heading.level ) {
-						endOfSlice = i;
-						break;
-					}
-				}
-
-				// We found a child node: Push a new node onto the return array with children.
-				nestedHeadingList.push( {
-					heading,
-					index: index + key,
-					children: linearToNestedHeadingList(
-						headingList.slice( key + 1, endOfSlice ),
-						index + key + 1
-					),
-				} );
-			} else {
-				// No child node: Push a new node onto the return array.
-				nestedHeadingList.push( {
-					heading,
-					index: index + key,
-					children: null,
-				} );
-			}
-		}
-	} );
-
-	return nestedHeadingList;
-}