|
| 1 | +'use strict'; |
| 2 | + |
| 3 | +// MODULES // |
| 4 | + |
| 5 | +var transforms = require( './transforms' ); |
| 6 | + |
| 7 | + |
| 8 | +// VARIABLES // |
| 9 | + |
| 10 | +var map = { |
| 11 | + 'namespace': 'namespaces', |
| 12 | + 'mixin': 'mixins', |
| 13 | + 'function': 'functions', |
| 14 | + 'member': 'properties', |
| 15 | + 'event': 'events', |
| 16 | + 'class': 'classes' |
| 17 | +}; |
| 18 | + |
| 19 | +var recurse = { |
| 20 | + 'namespace': true, |
| 21 | + 'mixin': true, |
| 22 | + 'function': false, |
| 23 | + 'member': true, |
| 24 | + 'event': false, |
| 25 | + 'class': true |
| 26 | +}; |
| 27 | + |
| 28 | + |
| 29 | +// TRANSFORM // |
| 30 | + |
| 31 | +/** |
| 32 | +* Recursively transforms doclet nodes. |
| 33 | +* |
| 34 | +* @param {Object} parentNode - parent doclet node |
| 35 | +* @param {Object[]} childNodes - array of child nodes |
| 36 | +* @param {String} parentLongName - long form of a parent name |
| 37 | +* @returns {Void} |
| 38 | +*/ |
| 39 | +function transform( parentNode, childNodes, parentLongname ) { |
| 40 | + var node; |
| 41 | + var tmp; |
| 42 | + var key; |
| 43 | + var out; |
| 44 | + var fcn; |
| 45 | + var i; |
| 46 | + |
| 47 | + // Filter for child nodes... |
| 48 | + tmp = []; |
| 49 | + for ( i = 0; i < childNodes.length; i++ ) { |
| 50 | + if ( childNodes[ i ].memberof === parentLongname ) { |
| 51 | + tmp.push( childNodes[ i ] ); |
| 52 | + } |
| 53 | + } |
| 54 | + childNodes = tmp; |
| 55 | + if ( childNodes.length === 0 ) { |
| 56 | + return; |
| 57 | + } |
| 58 | + // For each child node, apply a transformation... |
| 59 | + for ( i = 0; i < childNodes.length; i++ ) { |
| 60 | + node = childNodes[ i ]; |
| 61 | + |
| 62 | + // Apply a transform... |
| 63 | + fcn = transforms[ node.kind ]; |
| 64 | + if ( fcn === void 0 ) { |
| 65 | + continue; |
| 66 | + } |
| 67 | + out = fcn( node ); |
| 68 | + |
| 69 | + // Cache the transformed node... |
| 70 | + key = map[ node.kind ]; |
| 71 | + tmp = parentNode[ key ]; |
| 72 | + if ( tmp === void 0 ) { |
| 73 | + tmp = []; |
| 74 | + parentNode[ key ] = tmp; |
| 75 | + } |
| 76 | + tmp.push( out ); |
| 77 | + |
| 78 | + // Check if we need to recurse... |
| 79 | + if ( recurse[ node.kind ] ) { |
| 80 | + transform( out, childNodes, node.longname ); |
| 81 | + } |
| 82 | + } |
| 83 | +} // end FUNCTION transform() |
| 84 | + |
| 85 | + |
| 86 | +// EXPORTS // |
| 87 | + |
| 88 | +module.exports = transform; |
0 commit comments