Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 | 1x 1x 2x 2x 2x 2x 2x 2x 2x 1x 184x 184x 184x 273x 20x 273x 184x 184x 18x 18x 18x 18x 18x 18x 1x 85x 85x 85x 85x 1x 84x 37x 47x 47x 84x 84x 84x 84x 93x 84x 82x 1x 81x 90x 84x 1x 8x 8x 8x 8x 3x 5x 5x 8x 8x 8x 8x 9x 8x 8x 8x 9x 8x 1x 4756x 4756x 4756x 4756x 264x 264x 264x 26x 26x 26x 26x 3x 264x 4756x 4747x 4747x 4747x 44x 4703x 120x 137x 4703x 132x 132x 137x 121x 121x 132x 11x 4692x 4756x 209x 209x 209x 221x 221x 221x 209x 209x 209x 16x 16x 209x 209x 209x 209x 82x 78x 131x 4756x 9281x 9281x 9281x 9281x 43x 43x 43x 9281x 9281x 9281x 4x 4x 9281x 9281x 32x 26x 9281x 4756x 4710x 105x 4710x 4710x 4756x 105x 105x 1x 104x 104x 77x 4678x 4678x 73x 73x 26x 4652x 4652x 12x 12x 1x 4651x 4651x 21x 4630x 4630x 5x 4625x 4625x 5270x 5270x 4593x 32x 32x 1x 1x 1x 31x 1x 528x 528x 1x | /*!
* VisualEditor ModelRegistry class.
*
* @copyright See AUTHORS.txt
*/
( function () {
/**
* Registry for models.
*
* To register a new model type, call #register.
*
* @extends OO.Registry
* @constructor
*/
ve.dm.ModelRegistry = function VeDmModelRegistry() {
// Parent constructor
OO.Registry.call( this );
// Map of func presence and tag names to model names
// [ { tagName: [modelNamesWithoutFunc] }, { tagName: [modelNamesWithFunc] } ]
this.modelsByTag = [ {}, {} ];
// Map of func presence and rdfaTypes to model names; only rdfaTypes specified as strings are in here
// { matchFunctionPresence: { rdfaType: { tagName: [modelNames] } } }
// [ { rdfaType: { tagName: [modelNamesWithoutFunc] } }, { rdfaType: { tagName: [modelNamesWithFunc] } ]
this.modelsByTypeAndTag = [];
// Map of func presence to array of model names with rdfaType regexps
// [ [modelNamesWithoutFunc], [modelNamesWithFunc] ]
this.modelsWithTypeRegExps = [ [], [] ];
// Map tracking registration order
// { nameA: 0, nameB: 1, … }
this.registrationOrder = {};
this.nextNumber = 0;
this.extSpecificTypes = [];
};
/* Inheritance */
OO.inheritClass( ve.dm.ModelRegistry, OO.Registry );
/* Private helper functions */
/**
* Helper function for register(). Adds a value to the front of an array in a nested object.
* Objects and arrays are created if needed. You can specify one or more keys and a value.
*
* Specifically:
*
* - `addType( obj, keyA, value )` does `obj[keyA].unshift( value );`
* - `addType( obj, keyA, keyB, value )` does `obj[keyA][keyB].unshift( value )`;
* - etc.
*
* @private
* @param {Object} obj Object the array resides in
* @param {...string} keys
* @param {any} value
*/
function addType( obj, ...keys ) {
const value = keys.pop();
let o = obj;
let i, len;
for ( i = 0, len = keys.length - 1; i < len; i++ ) {
if ( o[ keys[ i ] ] === undefined ) {
o[ keys[ i ] ] = {};
}
o = o[ keys[ i ] ];
}
o[ keys[ i ] ] = o[ keys[ i ] ] || [];
o[ keys[ i ] ].unshift( value );
}
/**
* Helper function for unregister().
*
* Same arguments as addType, except removes the type from the list.
*
* @private
* @param {Object} obj Object the array resides in
* @param {...string} keys
* @param {any} value to remove
*/
function removeType( obj, ...keys ) {
const value = keys.pop(),
arr = ve.getProp( obj, ...keys );
Eif ( arr ) {
const index = arr.indexOf( value );
Eif ( index !== -1 ) {
arr.splice( index, 1 );
}
// TODO: Prune empty array and empty containing objects
}
}
/* Public methods */
/**
* Register a model type.
*
* @param {ve.dm.Model} constructor Subclass of ve.dm.Model
* @throws Model names must be strings and must not be empty
* @throws Models must be subclasses of ve.dm.Model
* @throws No factory associated with this ve.dm.Model subclass
*/
ve.dm.ModelRegistry.prototype.register = function ( constructor ) {
const name = constructor.static && constructor.static.name;
Iif ( typeof name !== 'string' || name === '' ) {
throw new Error( 'Model names must be strings and must not be empty' );
}
Iif ( !( constructor.prototype instanceof ve.dm.Model ) ) {
throw new Error( 'Models must be subclasses of ve.dm.Model' );
}
if ( this.lookup( name ) === constructor ) {
// Don't allow double registration as it would create duplicate
// entries in various caches.
return;
}
// Register the model with the right factory
if ( constructor.prototype instanceof ve.dm.Annotation ) {
ve.dm.annotationFactory.register( constructor );
} else if ( constructor.prototype instanceof ve.dm.Node ) {
ve.dm.nodeFactory.register( constructor );
} else E{
throw new Error( 'No factory associated with this ve.dm.Model subclass' );
}
// Parent method
ve.dm.ModelRegistry.super.prototype.register.call( this, name, constructor );
const tags = constructor.static.matchTagNames === null ?
[ '' ] :
constructor.static.matchTagNames;
const types = constructor.static.getMatchRdfaTypes() === null ?
[ '' ] :
constructor.static.getMatchRdfaTypes();
for ( let i = 0; i < tags.length; i++ ) {
// +!!foo is a shorter equivalent of Number( Boolean( foo ) ) or foo ? 1 : 0
addType( this.modelsByTag, +!!constructor.static.matchFunction,
tags[ i ], name
);
}
for ( let i = 0; i < types.length; i++ ) {
if ( types[ i ] instanceof RegExp ) {
// TODO: Guard against running this again during subsequent
// iterations of the for loop
addType( this.modelsWithTypeRegExps, +!!constructor.static.matchFunction, name );
} else {
for ( let j = 0; j < tags.length; j++ ) {
addType( this.modelsByTypeAndTag,
+!!constructor.static.matchFunction, types[ i ], tags[ j ], name
);
}
}
}
this.registrationOrder[ name ] = this.nextNumber++;
};
/**
* Unregister a model type.
*
* @param {ve.dm.Model} constructor Subclass of ve.dm.Model
* @throws Model names must be strings and must not be empty
* @throws Models must be subclasses of ve.dm.Model
* @throws No factory associated with this ve.dm.Model subclass
*/
ve.dm.ModelRegistry.prototype.unregister = function ( constructor ) {
const name = constructor.static && constructor.static.name;
Iif ( typeof name !== 'string' || name === '' ) {
throw new Error( 'Model names must be strings and must not be empty' );
}
Iif ( !( constructor.prototype instanceof ve.dm.Model ) ) {
throw new Error( 'Models must be subclasses of ve.dm.Model' );
}
// Unregister the model from the right factory
if ( constructor.prototype instanceof ve.dm.Annotation ) {
ve.dm.annotationFactory.unregister( constructor );
} else if ( constructor.prototype instanceof ve.dm.Node ) {
ve.dm.nodeFactory.unregister( constructor );
} else E{
throw new Error( 'No factory associated with this ve.dm.Model subclass' );
}
// Parent method
ve.dm.ModelRegistry.super.prototype.unregister.call( this, name );
const tags = constructor.static.matchTagNames === null ?
[ '' ] :
constructor.static.matchTagNames;
const types = constructor.static.getMatchRdfaTypes() === null ?
[ '' ] :
constructor.static.getMatchRdfaTypes();
for ( let i = 0; i < tags.length; i++ ) {
// +!!foo is a shorter equivalent of Number( Boolean( foo ) ) or foo ? 1 : 0
removeType( this.modelsByTag, +!!constructor.static.matchFunction,
tags[ i ], name
);
}
for ( let i = 0; i < types.length; i++ ) {
Iif ( types[ i ] instanceof RegExp ) {
// TODO: Guard against running this again during subsequent
// iterations of the for loop
removeType( this.modelsWithTypeRegExps, +!!constructor.static.matchFunction, name );
} else {
for ( let j = 0; j < tags.length; j++ ) {
removeType( this.modelsByTypeAndTag,
+!!constructor.static.matchFunction, types[ i ], tags[ j ], name
);
}
}
}
delete this.registrationOrder[ name ];
};
/**
* Determine which model best matches the given node
*
* Model matching works as follows:
*
* Get all models whose tag and rdfaType rules match
*
* Rank them in order of specificity:
*
* - tag, rdfaType and func specified
* - rdfaType and func specified
* - tag and func specified
* - func specified
* - tag and rdfaType specified
* - rdfaType specified
* - tag specified
* - nothing specified
*
* If there are multiple candidates with the same specificity, exact matches of strings take precedence over
* matches of regular expressions. If there are still multiple candidates, they are ranked in reverse
* order of registration (i.e. if A was registered before B, B will rank above A).
* The highest-ranking model whose test function does not return false, wins.
*
* @param {Node} node Node to match (usually an HTMLElement but can also be a Comment node)
* @param {boolean} [forceAboutGrouping] If true, only match models with about grouping enabled
* @param {string[]} [excludeTypes] Model names to exclude when matching
* @return {string|null} Model type, or null if none found
*/
ve.dm.ModelRegistry.prototype.matchElement = function ( node, forceAboutGrouping, excludeTypes ) {
const nodeName = node.nodeName.toLowerCase();
const types = [];
const byRegistrationOrderDesc = ( a, b ) => this.registrationOrder[ b ] - this.registrationOrder[ a ];
const matchTypeRegExps = ( type, tag, withFunc ) => {
const matchedModels = [],
models = this.modelsWithTypeRegExps[ +withFunc ];
for ( let j = 0; j < models.length; j++ ) {
Iif ( excludeTypes && excludeTypes.indexOf( models[ j ] ) !== -1 ) {
continue;
}
const matchTypes = this.registry[ models[ j ] ].static.getMatchRdfaTypes();
for ( let k = 0; k < matchTypes.length; k++ ) {
if (
matchTypes[ k ] instanceof RegExp &&
matchTypes[ k ].test( type ) &&
(
( tag === '' && this.registry[ models[ j ] ].static.matchTagNames === null ) ||
( this.registry[ models[ j ] ].static.matchTagNames || [] ).indexOf( tag ) !== -1
)
) {
matchedModels.push( models[ j ] );
}
}
}
return matchedModels;
};
const allTypesAllowed = ( model ) => {
let allowedTypes = model.static.getAllowedRdfaTypes();
const matchTypes = model.static.getMatchRdfaTypes();
// All types allowed
if ( allowedTypes === null ) {
return true;
}
if ( matchTypes !== null ) {
// Don't modify allowedTypes as it is a pointer to the orignal array
allowedTypes = allowedTypes.concat( matchTypes );
}
function checkType( rule, type ) {
return rule instanceof RegExp ? rule.test( type ) : rule === type;
}
for ( let j = 0; j < types.length; j++ ) {
let typeAllowed = false;
for ( let k = 0; k < allowedTypes.length; k++ ) {
if ( checkType( allowedTypes[ k ], types[ j ] ) ) {
typeAllowed = true;
break;
}
}
if ( !typeAllowed ) {
return false;
}
}
return true;
};
const matchWithFunc = ( tag ) => {
let queue = [],
queue2 = [];
for ( let j = 0; j < types.length; j++ ) {
// Queue string matches and regexp matches separately
ve.batchPush( queue, ve.getProp( this.modelsByTypeAndTag, 1, types[ j ], tag ) || [] );
Iif ( excludeTypes ) {
queue = OO.simpleArrayDifference( queue, excludeTypes );
}
ve.batchPush( queue2, matchTypeRegExps( types[ j ], tag, true ) );
}
// Filter out matches which contain types which aren't allowed
queue = queue.filter( ( name ) => allTypesAllowed( this.lookup( name ) ) );
queue2 = queue2.filter( ( name ) => allTypesAllowed( this.lookup( name ) ) );
if ( forceAboutGrouping ) {
// Filter out matches that don't support about grouping
queue = queue.filter( ( name ) => this.registry[ name ].static.enableAboutGrouping );
queue2 = queue2.filter( ( name ) => this.registry[ name ].static.enableAboutGrouping );
}
// Try string matches first, then regexp matches
queue.sort( byRegistrationOrderDesc );
queue2.sort( byRegistrationOrderDesc );
ve.batchPush( queue, queue2 );
for ( let j = 0; j < queue.length; j++ ) {
if ( this.registry[ queue[ j ] ].static.matchFunction( node ) ) {
return queue[ j ];
}
}
return null;
};
const matchWithoutFunc = ( tag ) => {
let queue = [],
queue2 = [],
winningName = null;
for ( let j = 0; j < types.length; j++ ) {
// Queue string and regexp matches separately
ve.batchPush( queue, ve.getProp( this.modelsByTypeAndTag, 0, types[ j ], tag ) || [] );
Iif ( excludeTypes ) {
queue = OO.simpleArrayDifference( queue, excludeTypes );
}
ve.batchPush( queue2, matchTypeRegExps( types[ j ], tag, false ) );
}
// Filter out matches which contain types which aren't allowed
queue = queue.filter( ( name ) => allTypesAllowed( this.lookup( name ) ) );
queue2 = queue2.filter( ( name ) => allTypesAllowed( this.lookup( name ) ) );
if ( forceAboutGrouping ) {
// Filter out matches that don't support about grouping
queue = queue.filter( ( name ) => this.registry[ name ].static.enableAboutGrouping );
queue2 = queue2.filter( ( name ) => this.registry[ name ].static.enableAboutGrouping );
}
// Only try regexp matches if there are no string matches
queue = queue.length > 0 ? queue : queue2;
// Find most recently registered
for ( let j = 0; j < queue.length; j++ ) {
if (
winningName === null ||
this.registrationOrder[ winningName ] < this.registrationOrder[ queue[ j ] ]
) {
winningName = queue[ j ];
}
}
return winningName;
};
if ( node.getAttribute ) {
if ( node.getAttribute( 'rel' ) ) {
types.push( ...node.getAttribute( 'rel' ).trim().split( /\s+/ ) );
}
Iif ( node.getAttribute( 'typeof' ) ) {
types.push( ...node.getAttribute( 'typeof' ).trim().split( /\s+/ ) );
}
Iif ( node.getAttribute( 'property' ) ) {
types.push( ...node.getAttribute( 'property' ).trim().split( /\s+/ ) );
}
}
let winner;
if ( types.length ) {
// func+tag+type match
winner = matchWithFunc( nodeName );
if ( winner !== null ) {
return winner;
}
// func+type match
// Only look at rules with no tag specified; if a rule does specify a tag, we've
// either already processed it above, or the tag doesn't match
winner = matchWithFunc( '' );
if ( winner !== null ) {
return winner;
}
}
// func+tag match
let matches = ve.getProp( this.modelsByTag, 1, nodeName ) || [];
// No need to sort because individual arrays in modelsByTag are already sorted
// correctly
for ( let i = 0; i < matches.length; i++ ) {
const m = this.registry[ matches[ i ] ];
// Only process this one if it doesn't specify types
// If it does specify types, then we've either already processed it in the
// func+tag+type step above, or its type rule doesn't match
if ( m.static.getMatchRdfaTypes() === null && m.static.matchFunction( node ) && allTypesAllowed( m ) ) {
return matches[ i ];
}
}
// func only
// We only need to get the [''][''] array because the other arrays were either
// already processed during the steps above, or have a type or tag rule that doesn't
// match this node.
// No need to sort because individual arrays in modelsByTypeAndTag are already sorted
// correctly
matches = ve.getProp( this.modelsByTypeAndTag, 1, '', '' ) || [];
for ( let i = 0; i < matches.length; i++ ) {
const m = this.registry[ matches[ i ] ];
if ( m.static.matchFunction( node ) && allTypesAllowed( m ) ) {
return matches[ i ];
}
}
// tag+type
winner = matchWithoutFunc( nodeName );
if ( winner !== null ) {
return winner;
}
// type only
// Only look at rules with no tag specified; if a rule does specify a tag, we've
// either already processed it above, or the tag doesn't match
winner = matchWithoutFunc( '' );
if ( winner !== null ) {
return winner;
}
// tag only
matches = ve.getProp( this.modelsByTag, 0, nodeName ) || [];
// No need to track winningName because the individual arrays in modelsByTag are
// already sorted correctly
for ( let i = 0; i < matches.length; i++ ) {
const m = this.registry[ matches[ i ] ];
// Only process this one if it doesn't specify types
// If it does specify types, then we've either already processed it in the
// tag+type step above, or its type rule doesn't match
if ( m.static.getMatchRdfaTypes() === null && allTypesAllowed( m ) ) {
return matches[ i ];
}
}
// Rules with no type or tag specified
// These are the only rules that can still qualify at this point, the others we've either
// already processed or have a type or tag rule that disqualifies them
matches = ve.getProp( this.modelsByTypeAndTag, 0, '', '' ) || [];
for ( let i = 0; i < matches.length; i++ ) {
const m = this.registry[ matches[ i ] ];
Eif ( allTypesAllowed( m ) ) {
return matches[ i ];
}
}
// We didn't find anything, give up
return null;
};
/**
* Tests whether a node will be modelled as an annotation
*
* @param {Node} node The node
* @return {boolean} Whether the element will be modelled as an annotation
*/
ve.dm.ModelRegistry.prototype.isAnnotation = function ( node ) {
const modelClass = this.lookup( this.matchElement( node ) );
return ( modelClass && modelClass.prototype ) instanceof ve.dm.Annotation;
};
/* Initialization */
ve.dm.modelRegistry = new ve.dm.ModelRegistry();
}() );
|