You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@turbine.apache.org by pa...@apache.org on 2019/05/20 14:36:27 UTC
svn commit: r1045234 [11/23] - in
/websites/production/turbine/content/fulcrum/fulcrum-crypto: ./
announcements/ apidocs/ apidocs/org/apache/fulcrum/crypto/
apidocs/org/apache/fulcrum/crypto/class-use/
apidocs/org/apache/fulcrum/crypto/impl/ apidocs/or...
Modified: websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/js/sortabletable.js
==============================================================================
--- websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/js/sortabletable.js (original)
+++ websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/js/sortabletable.js Mon May 20 14:36:24 2019
@@ -1,455 +1,455 @@
-
-/*----------------------------------------------------------------------------\
-| Sortable Table 1.12 |
-|-----------------------------------------------------------------------------|
-| Created by Erik Arvidsson |
-| (http://webfx.eae.net/contact.html#erik) |
-| For WebFX (http://webfx.eae.net/) |
-|-----------------------------------------------------------------------------|
-| A DOM 1 based script that allows an ordinary HTML table to be sortable. |
-|-----------------------------------------------------------------------------|
-| Copyright (c) 1998 - 2004 Erik Arvidsson |
-|-----------------------------------------------------------------------------|
-| This software is provided "as is", without warranty of any kind, express or |
-| implied, including but not limited to the warranties of merchantability, |
-| fitness for a particular purpose and noninfringement. In no event shall the |
-| authors or copyright holders be liable for any claim, damages or other |
-| liability, whether in an action of contract, tort or otherwise, arising |
-| from, out of or in connection with the software or the use or other |
-| dealings in the software. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| This software is available under the three different licenses mentioned |
-| below. To use this software you must chose, and qualify, for one of those. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| The WebFX Non-Commercial License http://webfx.eae.net/license.html |
-| Permits anyone the right to use the software in a non-commercial context |
-| free of charge. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| The WebFX Commercial license http://webfx.eae.net/commercial.html |
-| Permits the license holder the right to use the software in a commercial |
-| context. Such license must be specifically obtained, however it's valid for |
-| any number of implementations of the licensed software. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| GPL - The GNU General Public License http://www.gnu.org/licenses/gpl.txt |
-| Permits anyone the right to use and modify the software without limitations |
-| as long as proper credits are given and the original and modified source |
-| code are included. Requires that the final product, software derivate from |
-| the original source or any software utilizing a GPL component, such as |
-| this, is also licensed under the GPL license. |
-|-----------------------------------------------------------------------------|
-| 2003-01-10 | First version |
-| 2003-01-19 | Minor changes to the date parsing |
-| 2003-01-28 | JScript 5.0 fixes (no support for 'in' operator) |
-| 2003-02-01 | Sloppy typo like error fixed in getInnerText |
-| 2003-07-04 | Added workaround for IE cellIndex bug. |
-| 2003-11-09 | The bDescending argument to sort was not correctly working |
-| | Using onclick DOM0 event if no support for addEventListener |
-| | or attachEvent |
-| 2004-01-13 | Adding addSortType and removeSortType which makes it a lot |
-| | easier to add new, custom sort types. |
-| 2004-01-27 | Switch to use descending = false as the default sort order. |
-| | Change defaultDescending to suit your needs. |
-| 2004-03-14 | Improved sort type None look and feel a bit |
-| 2004-08-26 | Made the handling of tBody and tHead more flexible. Now you |
-| | can use another tHead or no tHead, and you can chose some |
-| | other tBody. |
-|-----------------------------------------------------------------------------|
-| Created 2003-01-10 | All changes are in the log above. | Updated 2004-08-26 |
-\----------------------------------------------------------------------------*/
-
-
-function SortableTable(oTable, oSortTypes) {
-
- this.sortTypes = oSortTypes || [];
-
- this.sortColumn = null;
- this.descending = null;
-
- var oThis = this;
- this._headerOnclick = function (e) {
- oThis.headerOnclick(e);
- };
-
- if (oTable) {
- this.setTable( oTable );
- this.document = oTable.ownerDocument || oTable.document;
- }
- else {
- this.document = document;
- }
-
-
- // only IE needs this
- var win = this.document.defaultView || this.document.parentWindow;
- this._onunload = function () {
- oThis.destroy();
- };
- if (win && typeof win.attachEvent != "undefined") {
- win.attachEvent("onunload", this._onunload);
- }
-}
-
-SortableTable.gecko = navigator.product == "Gecko";
-SortableTable.msie = /msie/i.test(navigator.userAgent);
-// Mozilla is faster when doing the DOM manipulations on
-// an orphaned element. MSIE is not
-SortableTable.removeBeforeSort = SortableTable.gecko;
-
-SortableTable.prototype.onsort = function () {};
-
-// default sort order. true -> descending, false -> ascending
-SortableTable.prototype.defaultDescending = false;
-
-// shared between all instances. This is intentional to allow external files
-// to modify the prototype
-SortableTable.prototype._sortTypeInfo = {};
-
-SortableTable.prototype.setTable = function (oTable) {
- if ( this.tHead )
- this.uninitHeader();
- this.element = oTable;
- this.setTHead( oTable.tHead );
- this.setTBody( oTable.tBodies[0] );
-};
-
-SortableTable.prototype.setTHead = function (oTHead) {
- if (this.tHead && this.tHead != oTHead )
- this.uninitHeader();
- this.tHead = oTHead;
- this.initHeader( this.sortTypes );
-};
-
-SortableTable.prototype.setTBody = function (oTBody) {
- this.tBody = oTBody;
-};
-
-SortableTable.prototype.setSortTypes = function ( oSortTypes ) {
- if ( this.tHead )
- this.uninitHeader();
- this.sortTypes = oSortTypes || [];
- if ( this.tHead )
- this.initHeader( this.sortTypes );
-};
-
-// adds arrow containers and events
-// also binds sort type to the header cells so that reordering columns does
-// not break the sort types
-SortableTable.prototype.initHeader = function (oSortTypes) {
- if (!this.tHead) return;
- var cells = this.tHead.rows[0].cells;
- var doc = this.tHead.ownerDocument || this.tHead.document;
- this.sortTypes = oSortTypes || [];
- var l = cells.length;
- var img, c;
- for (var i = 0; i < l; i++) {
- c = cells[i];
- if (this.sortTypes[i] != null && this.sortTypes[i] != "None") {
- img = doc.createElement("IMG");
- img.src = "images/blank.png";
- c.appendChild(img);
- if (this.sortTypes[i] != null)
- c._sortType = this.sortTypes[i];
- if (typeof c.addEventListener != "undefined")
- c.addEventListener("click", this._headerOnclick, false);
- else if (typeof c.attachEvent != "undefined")
- c.attachEvent("onclick", this._headerOnclick);
- else
- c.onclick = this._headerOnclick;
- }
- else
- {
- c.setAttribute( "_sortType", oSortTypes[i] );
- c._sortType = "None";
- }
- }
- this.updateHeaderArrows();
-};
-
-// remove arrows and events
-SortableTable.prototype.uninitHeader = function () {
- if (!this.tHead) return;
- var cells = this.tHead.rows[0].cells;
- var l = cells.length;
- var c;
- for (var i = 0; i < l; i++) {
- c = cells[i];
- if (c._sortType != null && c._sortType != "None") {
- c.removeChild(c.lastChild);
- if (typeof c.removeEventListener != "undefined")
- c.removeEventListener("click", this._headerOnclick, false);
- else if (typeof c.detachEvent != "undefined")
- c.detachEvent("onclick", this._headerOnclick);
- c._sortType = null;
- c.removeAttribute( "_sortType" );
- }
- }
-};
-
-SortableTable.prototype.updateHeaderArrows = function () {
- if (!this.tHead) return;
- var cells = this.tHead.rows[0].cells;
- var l = cells.length;
- var img;
- for (var i = 0; i < l; i++) {
- if (cells[i]._sortType != null && cells[i]._sortType != "None") {
- img = cells[i].lastChild;
- if (i == this.sortColumn)
- img.className = "sort-arrow " + (this.descending ? "descending" : "ascending");
- else
- img.className = "sort-arrow";
- }
- }
-};
-
-SortableTable.prototype.headerOnclick = function (e) {
- // find TD element
- var el = e.target || e.srcElement;
- while (el.tagName != "TD")
- el = el.parentNode;
-
- this.sort(SortableTable.msie ? SortableTable.getCellIndex(el) : el.cellIndex);
-};
-
-// IE returns wrong cellIndex when columns are hidden
-SortableTable.getCellIndex = function (oTd) {
- var cells = oTd.parentNode.childNodes
- var l = cells.length;
- var i;
- for (i = 0; cells[i] != oTd && i < l; i++)
- ;
- return i;
-};
-
-SortableTable.prototype.getSortType = function (nColumn) {
- return this.sortTypes[nColumn] || "String";
-};
-
-// only nColumn is required
-// if bDescending is left out the old value is taken into account
-// if sSortType is left out the sort type is found from the sortTypes array
-
-SortableTable.prototype.sort = function (nColumn, bDescending, sSortType) {
- if (!this.tBody) return;
- if (sSortType == null)
- sSortType = this.getSortType(nColumn);
-
- // exit if None
- if (sSortType == "None")
- return;
-
- if (bDescending == null) {
- if (this.sortColumn != nColumn)
- this.descending = this.defaultDescending;
- else
- this.descending = !this.descending;
- }
- else
- this.descending = bDescending;
-
- this.sortColumn = nColumn;
-
- if (typeof this.onbeforesort == "function")
- this.onbeforesort();
-
- var f = this.getSortFunction(sSortType, nColumn);
- var a = this.getCache(sSortType, nColumn);
- var tBody = this.tBody;
-
- a.sort(f);
-
- if (this.descending)
- a.reverse();
-
- if (SortableTable.removeBeforeSort) {
- // remove from doc
- var nextSibling = tBody.nextSibling;
- var p = tBody.parentNode;
- p.removeChild(tBody);
- }
-
- // insert in the new order
- var l = a.length;
- for (var i = 0; i < l; i++)
- tBody.appendChild(a[i].element);
-
- if (SortableTable.removeBeforeSort) {
- // insert into doc
- p.insertBefore(tBody, nextSibling);
- }
-
- this.updateHeaderArrows();
-
- this.destroyCache(a);
-
- if (typeof this.onsort == "function")
- this.onsort();
-};
-
-SortableTable.prototype.asyncSort = function (nColumn, bDescending, sSortType) {
- var oThis = this;
- this._asyncsort = function () {
- oThis.sort(nColumn, bDescending, sSortType);
- };
- window.setTimeout(this._asyncsort, 1);
-};
-
-SortableTable.prototype.getCache = function (sType, nColumn) {
- if (!this.tBody) return [];
- var rows = this.tBody.rows;
- var l = rows.length;
- var a = new Array(l);
- var r;
- for (var i = 0; i < l; i++) {
- r = rows[i];
- a[i] = {
- value: this.getRowValue(r, sType, nColumn),
- element: r
- };
- };
- return a;
-};
-
-SortableTable.prototype.destroyCache = function (oArray) {
- var l = oArray.length;
- for (var i = 0; i < l; i++) {
- oArray[i].value = null;
- oArray[i].element = null;
- oArray[i] = null;
- }
-};
-
-SortableTable.prototype.getRowValue = function (oRow, sType, nColumn) {
- // if we have defined a custom getRowValue use that
- if (this._sortTypeInfo[sType] && this._sortTypeInfo[sType].getRowValue)
- return this._sortTypeInfo[sType].getRowValue(oRow, nColumn);
-
- var s;
- var c = oRow.cells[nColumn];
- if (typeof c.innerText != "undefined")
- s = c.innerText;
- else
- s = SortableTable.getInnerText(c);
- return this.getValueFromString(s, sType);
-};
-
-SortableTable.getInnerText = function (oNode) {
- var s = "";
- var cs = oNode.childNodes;
- var l = cs.length;
- for (var i = 0; i < l; i++) {
- switch (cs[i].nodeType) {
- case 1: //ELEMENT_NODE
- s += SortableTable.getInnerText(cs[i]);
- break;
- case 3: //TEXT_NODE
- s += cs[i].nodeValue;
- break;
- }
- }
- return s;
-};
-
-SortableTable.prototype.getValueFromString = function (sText, sType) {
- if (this._sortTypeInfo[sType])
- return this._sortTypeInfo[sType].getValueFromString( sText );
- return sText;
- /*
- switch (sType) {
- case "Number":
- return Number(sText);
- case "CaseInsensitiveString":
- return sText.toUpperCase();
- case "Date":
- var parts = sText.split("-");
- var d = new Date(0);
- d.setFullYear(parts[0]);
- d.setDate(parts[2]);
- d.setMonth(parts[1] - 1);
- return d.valueOf();
- }
- return sText;
- */
- };
-
-SortableTable.prototype.getSortFunction = function (sType, nColumn) {
- if (this._sortTypeInfo[sType])
- return this._sortTypeInfo[sType].compare;
- return SortableTable.basicCompare;
-};
-
-SortableTable.prototype.destroy = function () {
- this.uninitHeader();
- var win = this.document.parentWindow;
- if (win && typeof win.detachEvent != "undefined") { // only IE needs this
- win.detachEvent("onunload", this._onunload);
- }
- this._onunload = null;
- this.element = null;
- this.tHead = null;
- this.tBody = null;
- this.document = null;
- this._headerOnclick = null;
- this.sortTypes = null;
- this._asyncsort = null;
- this.onsort = null;
-};
-
-// Adds a sort type to all instance of SortableTable
-// sType : String - the identifier of the sort type
-// fGetValueFromString : function ( s : string ) : T - A function that takes a
-// string and casts it to a desired format. If left out the string is just
-// returned
-// fCompareFunction : function ( n1 : T, n2 : T ) : Number - A normal JS sort
-// compare function. Takes two values and compares them. If left out less than,
-// <, compare is used
-// fGetRowValue : function( oRow : HTMLTRElement, nColumn : int ) : T - A function
-// that takes the row and the column index and returns the value used to compare.
-// If left out then the innerText is first taken for the cell and then the
-// fGetValueFromString is used to convert that string the desired value and type
-
-SortableTable.prototype.addSortType = function (sType, fGetValueFromString, fCompareFunction, fGetRowValue) {
- this._sortTypeInfo[sType] = {
- type: sType,
- getValueFromString: fGetValueFromString || SortableTable.idFunction,
- compare: fCompareFunction || SortableTable.basicCompare,
- getRowValue: fGetRowValue
- };
-};
-
-// this removes the sort type from all instances of SortableTable
-SortableTable.prototype.removeSortType = function (sType) {
- delete this._sortTypeInfo[sType];
-};
-
-SortableTable.basicCompare = function compare(n1, n2) {
- if (n1.value < n2.value)
- return -1;
- if (n2.value < n1.value)
- return 1;
- return 0;
-};
-
-SortableTable.idFunction = function (x) {
- return x;
-};
-
-SortableTable.toUpperCase = function (s) {
- return s.toUpperCase();
-};
-
-SortableTable.toDate = function (s) {
- var parts = s.split("-");
- var d = new Date(0);
- d.setFullYear(parts[0]);
- d.setDate(parts[2]);
- d.setMonth(parts[1] - 1);
- return d.valueOf();
-};
-
-
-// add sort types
-SortableTable.prototype.addSortType("Number", Number);
-SortableTable.prototype.addSortType("CaseInsensitiveString", SortableTable.toUpperCase);
-SortableTable.prototype.addSortType("Date", SortableTable.toDate);
-SortableTable.prototype.addSortType("String");
-// None is a special case
+
+/*----------------------------------------------------------------------------\
+| Sortable Table 1.12 |
+|-----------------------------------------------------------------------------|
+| Created by Erik Arvidsson |
+| (http://webfx.eae.net/contact.html#erik) |
+| For WebFX (http://webfx.eae.net/) |
+|-----------------------------------------------------------------------------|
+| A DOM 1 based script that allows an ordinary HTML table to be sortable. |
+|-----------------------------------------------------------------------------|
+| Copyright (c) 1998 - 2004 Erik Arvidsson |
+|-----------------------------------------------------------------------------|
+| This software is provided "as is", without warranty of any kind, express or |
+| implied, including but not limited to the warranties of merchantability, |
+| fitness for a particular purpose and noninfringement. In no event shall the |
+| authors or copyright holders be liable for any claim, damages or other |
+| liability, whether in an action of contract, tort or otherwise, arising |
+| from, out of or in connection with the software or the use or other |
+| dealings in the software. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| This software is available under the three different licenses mentioned |
+| below. To use this software you must chose, and qualify, for one of those. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| The WebFX Non-Commercial License http://webfx.eae.net/license.html |
+| Permits anyone the right to use the software in a non-commercial context |
+| free of charge. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| The WebFX Commercial license http://webfx.eae.net/commercial.html |
+| Permits the license holder the right to use the software in a commercial |
+| context. Such license must be specifically obtained, however it's valid for |
+| any number of implementations of the licensed software. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| GPL - The GNU General Public License http://www.gnu.org/licenses/gpl.txt |
+| Permits anyone the right to use and modify the software without limitations |
+| as long as proper credits are given and the original and modified source |
+| code are included. Requires that the final product, software derivate from |
+| the original source or any software utilizing a GPL component, such as |
+| this, is also licensed under the GPL license. |
+|-----------------------------------------------------------------------------|
+| 2003-01-10 | First version |
+| 2003-01-19 | Minor changes to the date parsing |
+| 2003-01-28 | JScript 5.0 fixes (no support for 'in' operator) |
+| 2003-02-01 | Sloppy typo like error fixed in getInnerText |
+| 2003-07-04 | Added workaround for IE cellIndex bug. |
+| 2003-11-09 | The bDescending argument to sort was not correctly working |
+| | Using onclick DOM0 event if no support for addEventListener |
+| | or attachEvent |
+| 2004-01-13 | Adding addSortType and removeSortType which makes it a lot |
+| | easier to add new, custom sort types. |
+| 2004-01-27 | Switch to use descending = false as the default sort order. |
+| | Change defaultDescending to suit your needs. |
+| 2004-03-14 | Improved sort type None look and feel a bit |
+| 2004-08-26 | Made the handling of tBody and tHead more flexible. Now you |
+| | can use another tHead or no tHead, and you can chose some |
+| | other tBody. |
+|-----------------------------------------------------------------------------|
+| Created 2003-01-10 | All changes are in the log above. | Updated 2004-08-26 |
+\----------------------------------------------------------------------------*/
+
+
+function SortableTable(oTable, oSortTypes) {
+
+ this.sortTypes = oSortTypes || [];
+
+ this.sortColumn = null;
+ this.descending = null;
+
+ var oThis = this;
+ this._headerOnclick = function (e) {
+ oThis.headerOnclick(e);
+ };
+
+ if (oTable) {
+ this.setTable( oTable );
+ this.document = oTable.ownerDocument || oTable.document;
+ }
+ else {
+ this.document = document;
+ }
+
+
+ // only IE needs this
+ var win = this.document.defaultView || this.document.parentWindow;
+ this._onunload = function () {
+ oThis.destroy();
+ };
+ if (win && typeof win.attachEvent != "undefined") {
+ win.attachEvent("onunload", this._onunload);
+ }
+}
+
+SortableTable.gecko = navigator.product == "Gecko";
+SortableTable.msie = /msie/i.test(navigator.userAgent);
+// Mozilla is faster when doing the DOM manipulations on
+// an orphaned element. MSIE is not
+SortableTable.removeBeforeSort = SortableTable.gecko;
+
+SortableTable.prototype.onsort = function () {};
+
+// default sort order. true -> descending, false -> ascending
+SortableTable.prototype.defaultDescending = false;
+
+// shared between all instances. This is intentional to allow external files
+// to modify the prototype
+SortableTable.prototype._sortTypeInfo = {};
+
+SortableTable.prototype.setTable = function (oTable) {
+ if ( this.tHead )
+ this.uninitHeader();
+ this.element = oTable;
+ this.setTHead( oTable.tHead );
+ this.setTBody( oTable.tBodies[0] );
+};
+
+SortableTable.prototype.setTHead = function (oTHead) {
+ if (this.tHead && this.tHead != oTHead )
+ this.uninitHeader();
+ this.tHead = oTHead;
+ this.initHeader( this.sortTypes );
+};
+
+SortableTable.prototype.setTBody = function (oTBody) {
+ this.tBody = oTBody;
+};
+
+SortableTable.prototype.setSortTypes = function ( oSortTypes ) {
+ if ( this.tHead )
+ this.uninitHeader();
+ this.sortTypes = oSortTypes || [];
+ if ( this.tHead )
+ this.initHeader( this.sortTypes );
+};
+
+// adds arrow containers and events
+// also binds sort type to the header cells so that reordering columns does
+// not break the sort types
+SortableTable.prototype.initHeader = function (oSortTypes) {
+ if (!this.tHead) return;
+ var cells = this.tHead.rows[0].cells;
+ var doc = this.tHead.ownerDocument || this.tHead.document;
+ this.sortTypes = oSortTypes || [];
+ var l = cells.length;
+ var img, c;
+ for (var i = 0; i < l; i++) {
+ c = cells[i];
+ if (this.sortTypes[i] != null && this.sortTypes[i] != "None") {
+ img = doc.createElement("IMG");
+ img.src = "images/blank.png";
+ c.appendChild(img);
+ if (this.sortTypes[i] != null)
+ c._sortType = this.sortTypes[i];
+ if (typeof c.addEventListener != "undefined")
+ c.addEventListener("click", this._headerOnclick, false);
+ else if (typeof c.attachEvent != "undefined")
+ c.attachEvent("onclick", this._headerOnclick);
+ else
+ c.onclick = this._headerOnclick;
+ }
+ else
+ {
+ c.setAttribute( "_sortType", oSortTypes[i] );
+ c._sortType = "None";
+ }
+ }
+ this.updateHeaderArrows();
+};
+
+// remove arrows and events
+SortableTable.prototype.uninitHeader = function () {
+ if (!this.tHead) return;
+ var cells = this.tHead.rows[0].cells;
+ var l = cells.length;
+ var c;
+ for (var i = 0; i < l; i++) {
+ c = cells[i];
+ if (c._sortType != null && c._sortType != "None") {
+ c.removeChild(c.lastChild);
+ if (typeof c.removeEventListener != "undefined")
+ c.removeEventListener("click", this._headerOnclick, false);
+ else if (typeof c.detachEvent != "undefined")
+ c.detachEvent("onclick", this._headerOnclick);
+ c._sortType = null;
+ c.removeAttribute( "_sortType" );
+ }
+ }
+};
+
+SortableTable.prototype.updateHeaderArrows = function () {
+ if (!this.tHead) return;
+ var cells = this.tHead.rows[0].cells;
+ var l = cells.length;
+ var img;
+ for (var i = 0; i < l; i++) {
+ if (cells[i]._sortType != null && cells[i]._sortType != "None") {
+ img = cells[i].lastChild;
+ if (i == this.sortColumn)
+ img.className = "sort-arrow " + (this.descending ? "descending" : "ascending");
+ else
+ img.className = "sort-arrow";
+ }
+ }
+};
+
+SortableTable.prototype.headerOnclick = function (e) {
+ // find TD element
+ var el = e.target || e.srcElement;
+ while (el.tagName != "TD")
+ el = el.parentNode;
+
+ this.sort(SortableTable.msie ? SortableTable.getCellIndex(el) : el.cellIndex);
+};
+
+// IE returns wrong cellIndex when columns are hidden
+SortableTable.getCellIndex = function (oTd) {
+ var cells = oTd.parentNode.childNodes
+ var l = cells.length;
+ var i;
+ for (i = 0; cells[i] != oTd && i < l; i++)
+ ;
+ return i;
+};
+
+SortableTable.prototype.getSortType = function (nColumn) {
+ return this.sortTypes[nColumn] || "String";
+};
+
+// only nColumn is required
+// if bDescending is left out the old value is taken into account
+// if sSortType is left out the sort type is found from the sortTypes array
+
+SortableTable.prototype.sort = function (nColumn, bDescending, sSortType) {
+ if (!this.tBody) return;
+ if (sSortType == null)
+ sSortType = this.getSortType(nColumn);
+
+ // exit if None
+ if (sSortType == "None")
+ return;
+
+ if (bDescending == null) {
+ if (this.sortColumn != nColumn)
+ this.descending = this.defaultDescending;
+ else
+ this.descending = !this.descending;
+ }
+ else
+ this.descending = bDescending;
+
+ this.sortColumn = nColumn;
+
+ if (typeof this.onbeforesort == "function")
+ this.onbeforesort();
+
+ var f = this.getSortFunction(sSortType, nColumn);
+ var a = this.getCache(sSortType, nColumn);
+ var tBody = this.tBody;
+
+ a.sort(f);
+
+ if (this.descending)
+ a.reverse();
+
+ if (SortableTable.removeBeforeSort) {
+ // remove from doc
+ var nextSibling = tBody.nextSibling;
+ var p = tBody.parentNode;
+ p.removeChild(tBody);
+ }
+
+ // insert in the new order
+ var l = a.length;
+ for (var i = 0; i < l; i++)
+ tBody.appendChild(a[i].element);
+
+ if (SortableTable.removeBeforeSort) {
+ // insert into doc
+ p.insertBefore(tBody, nextSibling);
+ }
+
+ this.updateHeaderArrows();
+
+ this.destroyCache(a);
+
+ if (typeof this.onsort == "function")
+ this.onsort();
+};
+
+SortableTable.prototype.asyncSort = function (nColumn, bDescending, sSortType) {
+ var oThis = this;
+ this._asyncsort = function () {
+ oThis.sort(nColumn, bDescending, sSortType);
+ };
+ window.setTimeout(this._asyncsort, 1);
+};
+
+SortableTable.prototype.getCache = function (sType, nColumn) {
+ if (!this.tBody) return [];
+ var rows = this.tBody.rows;
+ var l = rows.length;
+ var a = new Array(l);
+ var r;
+ for (var i = 0; i < l; i++) {
+ r = rows[i];
+ a[i] = {
+ value: this.getRowValue(r, sType, nColumn),
+ element: r
+ };
+ };
+ return a;
+};
+
+SortableTable.prototype.destroyCache = function (oArray) {
+ var l = oArray.length;
+ for (var i = 0; i < l; i++) {
+ oArray[i].value = null;
+ oArray[i].element = null;
+ oArray[i] = null;
+ }
+};
+
+SortableTable.prototype.getRowValue = function (oRow, sType, nColumn) {
+ // if we have defined a custom getRowValue use that
+ if (this._sortTypeInfo[sType] && this._sortTypeInfo[sType].getRowValue)
+ return this._sortTypeInfo[sType].getRowValue(oRow, nColumn);
+
+ var s;
+ var c = oRow.cells[nColumn];
+ if (typeof c.innerText != "undefined")
+ s = c.innerText;
+ else
+ s = SortableTable.getInnerText(c);
+ return this.getValueFromString(s, sType);
+};
+
+SortableTable.getInnerText = function (oNode) {
+ var s = "";
+ var cs = oNode.childNodes;
+ var l = cs.length;
+ for (var i = 0; i < l; i++) {
+ switch (cs[i].nodeType) {
+ case 1: //ELEMENT_NODE
+ s += SortableTable.getInnerText(cs[i]);
+ break;
+ case 3: //TEXT_NODE
+ s += cs[i].nodeValue;
+ break;
+ }
+ }
+ return s;
+};
+
+SortableTable.prototype.getValueFromString = function (sText, sType) {
+ if (this._sortTypeInfo[sType])
+ return this._sortTypeInfo[sType].getValueFromString( sText );
+ return sText;
+ /*
+ switch (sType) {
+ case "Number":
+ return Number(sText);
+ case "CaseInsensitiveString":
+ return sText.toUpperCase();
+ case "Date":
+ var parts = sText.split("-");
+ var d = new Date(0);
+ d.setFullYear(parts[0]);
+ d.setDate(parts[2]);
+ d.setMonth(parts[1] - 1);
+ return d.valueOf();
+ }
+ return sText;
+ */
+ };
+
+SortableTable.prototype.getSortFunction = function (sType, nColumn) {
+ if (this._sortTypeInfo[sType])
+ return this._sortTypeInfo[sType].compare;
+ return SortableTable.basicCompare;
+};
+
+SortableTable.prototype.destroy = function () {
+ this.uninitHeader();
+ var win = this.document.parentWindow;
+ if (win && typeof win.detachEvent != "undefined") { // only IE needs this
+ win.detachEvent("onunload", this._onunload);
+ }
+ this._onunload = null;
+ this.element = null;
+ this.tHead = null;
+ this.tBody = null;
+ this.document = null;
+ this._headerOnclick = null;
+ this.sortTypes = null;
+ this._asyncsort = null;
+ this.onsort = null;
+};
+
+// Adds a sort type to all instance of SortableTable
+// sType : String - the identifier of the sort type
+// fGetValueFromString : function ( s : string ) : T - A function that takes a
+// string and casts it to a desired format. If left out the string is just
+// returned
+// fCompareFunction : function ( n1 : T, n2 : T ) : Number - A normal JS sort
+// compare function. Takes two values and compares them. If left out less than,
+// <, compare is used
+// fGetRowValue : function( oRow : HTMLTRElement, nColumn : int ) : T - A function
+// that takes the row and the column index and returns the value used to compare.
+// If left out then the innerText is first taken for the cell and then the
+// fGetValueFromString is used to convert that string the desired value and type
+
+SortableTable.prototype.addSortType = function (sType, fGetValueFromString, fCompareFunction, fGetRowValue) {
+ this._sortTypeInfo[sType] = {
+ type: sType,
+ getValueFromString: fGetValueFromString || SortableTable.idFunction,
+ compare: fCompareFunction || SortableTable.basicCompare,
+ getRowValue: fGetRowValue
+ };
+};
+
+// this removes the sort type from all instances of SortableTable
+SortableTable.prototype.removeSortType = function (sType) {
+ delete this._sortTypeInfo[sType];
+};
+
+SortableTable.basicCompare = function compare(n1, n2) {
+ if (n1.value < n2.value)
+ return -1;
+ if (n2.value < n1.value)
+ return 1;
+ return 0;
+};
+
+SortableTable.idFunction = function (x) {
+ return x;
+};
+
+SortableTable.toUpperCase = function (s) {
+ return s.toUpperCase();
+};
+
+SortableTable.toDate = function (s) {
+ var parts = s.split("-");
+ var d = new Date(0);
+ d.setFullYear(parts[0]);
+ d.setDate(parts[2]);
+ d.setMonth(parts[1] - 1);
+ return d.valueOf();
+};
+
+
+// add sort types
+SortableTable.prototype.addSortType("Number", Number);
+SortableTable.prototype.addSortType("CaseInsensitiveString", SortableTable.toUpperCase);
+SortableTable.prototype.addSortType("Date", SortableTable.toDate);
+SortableTable.prototype.addSortType("String");
+// None is a special case
\ No newline at end of file
Modified: websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/js/stringbuilder.js
==============================================================================
--- websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/js/stringbuilder.js (original)
+++ websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/js/stringbuilder.js Mon May 20 14:36:24 2019
@@ -1,79 +1,79 @@
-/*----------------------------------------------------------------------------\
-| String Builder 1.02 |
-|-----------------------------------------------------------------------------|
-| Created by Erik Arvidsson |
-| (http://webfx.eae.net/contact.html#erik) |
-| For WebFX (http://webfx.eae.net/) |
-|-----------------------------------------------------------------------------|
-| A class that allows more efficient building of strings than concatenation. |
-|-----------------------------------------------------------------------------|
-| Copyright (c) 1999 - 2002 Erik Arvidsson |
-|-----------------------------------------------------------------------------|
-| This software is provided "as is", without warranty of any kind, express or |
-| implied, including but not limited to the warranties of merchantability, |
-| fitness for a particular purpose and noninfringement. In no event shall the |
-| authors or copyright holders be liable for any claim, damages or other |
-| liability, whether in an action of contract, tort or otherwise, arising |
-| from, out of or in connection with the software or the use or other |
-| dealings in the software. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| This software is available under the three different licenses mentioned |
-| below. To use this software you must chose, and qualify, for one of those. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| The WebFX Non-Commercial License http://webfx.eae.net/license.html |
-| Permits anyone the right to use the software in a non-commercial context |
-| free of charge. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| The WebFX Commercial license http://webfx.eae.net/commercial.html |
-| Permits the license holder the right to use the software in a commercial |
-| context. Such license must be specifically obtained, however it's valid for |
-| any number of implementations of the licensed software. |
-| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
-| GPL - The GNU General Public License http://www.gnu.org/licenses/gpl.txt |
-| Permits anyone the right to use and modify the software without limitations |
-| as long as proper credits are given and the original and modified source |
-| code are included. Requires that the final product, software derivate from |
-| the original source or any software utilizing a GPL component, such as |
-| this, is also licensed under the GPL license. |
-|-----------------------------------------------------------------------------|
-| 2000-10-02 | First version |
-| 2000-10-05 | Added a cache of the string so that it does not need to be |
-| | regenerated every time in toString |
-| 2002-10-03 | Added minor improvement in the toString method |
-|-----------------------------------------------------------------------------|
-| Created 2000-10-02 | All changes are in the log above. | Updated 2002-10-03 |
-\----------------------------------------------------------------------------*/ function StringBuilder(sString) {
-
- // public
- this.length = 0;
-
- this.append = function (sString) {
- // append argument
- this.length += (this._parts[this._current++] = String(sString)).length;
-
- // reset cache
- this._string = null;
- return this;
- };
-
- this.toString = function () {
- if (this._string != null)
- return this._string;
-
- var s = this._parts.join("");
- this._parts = [s];
- this._current = 1;
- this.length = s.length;
-
- return this._string = s;
- };
-
- // private
- this._current = 0;
- this._parts = [];
- this._string = null; // used to cache the string
-
- // init
- if (sString != null)
- this.append(sString);
-}
+/*----------------------------------------------------------------------------\
+| String Builder 1.02 |
+|-----------------------------------------------------------------------------|
+| Created by Erik Arvidsson |
+| (http://webfx.eae.net/contact.html#erik) |
+| For WebFX (http://webfx.eae.net/) |
+|-----------------------------------------------------------------------------|
+| A class that allows more efficient building of strings than concatenation. |
+|-----------------------------------------------------------------------------|
+| Copyright (c) 1999 - 2002 Erik Arvidsson |
+|-----------------------------------------------------------------------------|
+| This software is provided "as is", without warranty of any kind, express or |
+| implied, including but not limited to the warranties of merchantability, |
+| fitness for a particular purpose and noninfringement. In no event shall the |
+| authors or copyright holders be liable for any claim, damages or other |
+| liability, whether in an action of contract, tort or otherwise, arising |
+| from, out of or in connection with the software or the use or other |
+| dealings in the software. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| This software is available under the three different licenses mentioned |
+| below. To use this software you must chose, and qualify, for one of those. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| The WebFX Non-Commercial License http://webfx.eae.net/license.html |
+| Permits anyone the right to use the software in a non-commercial context |
+| free of charge. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| The WebFX Commercial license http://webfx.eae.net/commercial.html |
+| Permits the license holder the right to use the software in a commercial |
+| context. Such license must be specifically obtained, however it's valid for |
+| any number of implementations of the licensed software. |
+| - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - |
+| GPL - The GNU General Public License http://www.gnu.org/licenses/gpl.txt |
+| Permits anyone the right to use and modify the software without limitations |
+| as long as proper credits are given and the original and modified source |
+| code are included. Requires that the final product, software derivate from |
+| the original source or any software utilizing a GPL component, such as |
+| this, is also licensed under the GPL license. |
+|-----------------------------------------------------------------------------|
+| 2000-10-02 | First version |
+| 2000-10-05 | Added a cache of the string so that it does not need to be |
+| | regenerated every time in toString |
+| 2002-10-03 | Added minor improvement in the toString method |
+|-----------------------------------------------------------------------------|
+| Created 2000-10-02 | All changes are in the log above. | Updated 2002-10-03 |
+\----------------------------------------------------------------------------*/ function StringBuilder(sString) {
+
+ // public
+ this.length = 0;
+
+ this.append = function (sString) {
+ // append argument
+ this.length += (this._parts[this._current++] = String(sString)).length;
+
+ // reset cache
+ this._string = null;
+ return this;
+ };
+
+ this.toString = function () {
+ if (this._string != null)
+ return this._string;
+
+ var s = this._parts.join("");
+ this._parts = [s];
+ this._current = 1;
+ this.length = s.length;
+
+ return this._string = s;
+ };
+
+ // private
+ this._current = 0;
+ this._parts = [];
+ this._string = null; // used to cache the string
+
+ // init
+ if (sString != null)
+ this.append(sString);
+}
\ No newline at end of file
Modified: websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/org.apache.fulcrum.crypto.CryptoAlgorithm.html
==============================================================================
--- websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/org.apache.fulcrum.crypto.CryptoAlgorithm.html (original)
+++ websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/org.apache.fulcrum.crypto.CryptoAlgorithm.html Mon May 20 14:36:24 2019
@@ -74,119 +74,117 @@
<tr> <td class="numLine"> 28</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @author <a href="mailto:hps@intermeta.de">Henning P. Schmiedehausen</a></span></pre></td></tr>
<tr> <td class="numLine"> 29</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * @version $Id: CryptoAlgorithm.java 535465 2007-05-05 06:58:06Z tv $</span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * @version $Id: CryptoAlgorithm.java 1852158 2019-01-25 18:19:46Z painter $</span></pre></td></tr>
<tr> <td class="numLine"> 30</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
<tr> <td class="numLine"> 31</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 32</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="keyword">public</span> <span class="keyword">interface</span> CryptoAlgorithm</pre></td></tr>
-<tr> <td class="numLine"> 33</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 32</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> {</pre></td></tr>
-<tr> <td class="numLine"> 34</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 33</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment">/**</span></pre></td></tr>
-<tr> <td class="numLine"> 35</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 34</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Allows the user to set a salt value whenever the</span></pre></td></tr>
-<tr> <td class="numLine"> 36</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 35</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * algorithm is used. Setting a new salt should invalidate</span></pre></td></tr>
-<tr> <td class="numLine"> 37</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 36</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * all internal state of this object.</span></pre></td></tr>
-<tr> <td class="numLine"> 38</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 37</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * <p></span></pre></td></tr>
-<tr> <td class="numLine"> 39</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 38</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Algorithms that do not use a salt are allowed to ignore</span></pre></td></tr>
-<tr> <td class="numLine"> 40</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 39</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * this parameter.</span></pre></td></tr>
-<tr> <td class="numLine"> 41</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 40</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * <p></span></pre></td></tr>
-<tr> <td class="numLine"> 42</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 41</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Algorithms must be able to deal with the null value as salt.</span></pre></td></tr>
-<tr> <td class="numLine"> 43</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 42</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * They should treat it as "use a random salt".</span></pre></td></tr>
-<tr> <td class="numLine"> 44</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 43</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 45</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 44</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @param salt The salt value</span></pre></td></tr>
-<tr> <td class="numLine"> 46</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 45</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 47</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 46</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
-<tr> <td class="numLine"> 48</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 47</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 49</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 48</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="keyword">void</span> setSeed(String salt);</pre></td></tr>
-<tr> <td class="numLine"> 50</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 49</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 51</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 50</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment">/**</span></pre></td></tr>
-<tr> <td class="numLine"> 52</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 51</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Performs the actual encryption.</span></pre></td></tr>
-<tr> <td class="numLine"> 53</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 52</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 54</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 53</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @param value The value to be encrypted</span></pre></td></tr>
-<tr> <td class="numLine"> 55</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 54</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 56</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 55</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @return The encrypted value</span></pre></td></tr>
-<tr> <td class="numLine"> 57</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 56</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 58</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 57</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @throws Exception various errors from the underlying ciphers.</span></pre></td></tr>
-<tr> <td class="numLine"> 59</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 58</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * The caller should catch them and report accordingly.</span></pre></td></tr>
-<tr> <td class="numLine"> 60</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 59</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 61</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 60</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
-<tr> <td class="numLine"> 62</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 61</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 63</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 62</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> String encrypt(String value)</pre></td></tr>
-<tr> <td class="numLine"> 64</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 63</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="keyword">throws</span> Exception;</pre></td></tr>
-<tr> <td class="numLine"> 65</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 64</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 66</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 65</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment">/**</span></pre></td></tr>
-<tr> <td class="numLine"> 67</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 66</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Algorithms that perform multiple ciphers get told</span></pre></td></tr>
-<tr> <td class="numLine"> 68</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 67</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * with setCipher, which cipher to use. This should be</span></pre></td></tr>
-<tr> <td class="numLine"> 69</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 68</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * called before any other method call.</span></pre></td></tr>
-<tr> <td class="numLine"> 70</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 69</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 71</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 70</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * If called after any call to encrypt or setSeed, the</span></pre></td></tr>
-<tr> <td class="numLine"> 72</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 71</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * CryptoAlgorithm may choose to ignore this or to reset</span></pre></td></tr>
-<tr> <td class="numLine"> 73</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 72</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * and use the new cipher.</span></pre></td></tr>
-<tr> <td class="numLine"> 74</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 73</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 75</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 74</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * If any other call is used before this, the algorithm</span></pre></td></tr>
-<tr> <td class="numLine"> 76</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 75</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * should use a default cipher and not throw an error.</span></pre></td></tr>
-<tr> <td class="numLine"> 77</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 76</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 78</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 77</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @param cipher The cipher to use.</span></pre></td></tr>
-<tr> <td class="numLine"> 79</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 78</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 80</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 79</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
-<tr> <td class="numLine"> 81</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 80</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 82</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 81</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="keyword">void</span> setCipher(String cipher);</pre></td></tr>
-<tr> <td class="numLine"> 83</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 82</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 84</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 83</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> }</pre></td></tr>
</table>
-<div class="footer">Report generated by <a href="http://cobertura.sourceforge.net/" target="_top">Cobertura</a> 1.9 on 10.09.09 09:16.</div>
+<div class="footer">Report generated by <a href="http://cobertura.sourceforge.net/" target="_top">Cobertura</a> 2.1.1 on 5/20/19 10:35 AM.</div>
</body>
-</html>
+</html>
\ No newline at end of file
Modified: websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/org.apache.fulcrum.crypto.CryptoService.html
==============================================================================
--- websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/org.apache.fulcrum.crypto.CryptoService.html (original)
+++ websites/production/turbine/content/fulcrum/fulcrum-crypto/cobertura/org.apache.fulcrum.crypto.CryptoService.html Mon May 20 14:36:24 2019
@@ -13,7 +13,6 @@
<table class="report">
<thead><tr> <td class="heading">Classes in this File</td> <td class="heading"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">Line Coverage</a></td> <td class="heading"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">Branch Coverage</a></td> <td class="heading"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">Complexity</a></td></tr></thead>
<tr><td><a href="org.apache.fulcrum.crypto.CryptoService.html">CryptoService</a></td><td><table cellpadding="0px" cellspacing="0px" class="percentgraph"><tr class="percentgraph"><td align="right" class="percentgraph" width="40"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">N/A</a></td><td class="percentgraph"><div class="percentgraph"><div class="na" style="width:100px"><span class="text"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">N/A</a></span></div></div></td></tr></table></td><td><table cellpadding="0px" cellspacing="0px" class="percentgraph"><tr class="percentgraph"><td align="right" class="percentgraph" width="40"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">N/A</a></td><td class="percentgraph"><div class="percentgraph"><div class="na" style="width:100px"><span class="text"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">N/A</a></sp
an></div></div></td></tr></table></td><td class="value"><span class="hidden">1.0;</span>1</td></tr>
- <tr><td><a href="org.apache.fulcrum.crypto.CryptoService.html">CryptoService$1</a></td><td><table cellpadding="0px" cellspacing="0px" class="percentgraph"><tr class="percentgraph"><td align="right" class="percentgraph" width="40">100%</td><td class="percentgraph"><div class="percentgraph"><div class="greenbar" style="width:100px"><span class="text">1/1</span></div></div></td></tr></table></td><td><table cellpadding="0px" cellspacing="0px" class="percentgraph"><tr class="percentgraph"><td align="right" class="percentgraph" width="40"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">N/A</a></td><td class="percentgraph"><div class="percentgraph"><div class="na" style="width:100px"><span class="text"><a class="dfn" href="help.html" onclick="popupwindow('help.html'); return false;">N/A</a></span></div></div></td></tr></table></td><td class="value"><span class="hidden">1.0;</span>1</td></tr>
</table>
<div class="separator"> </div>
@@ -23,102 +22,97 @@
<tr> <td class="numLine"> 2</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
<tr> <td class="numLine"> 3</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 4</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment">/*</span></pre></td></tr>
-<tr> <td class="numLine"> 5</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 4</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one</span></pre></td></tr>
-<tr> <td class="numLine"> 6</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 5</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * or more contributor license agreements. See the NOTICE file</span></pre></td></tr>
-<tr> <td class="numLine"> 7</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 6</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * distributed with this work for additional information</span></pre></td></tr>
-<tr> <td class="numLine"> 8</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 7</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span></pre></td></tr>
-<tr> <td class="numLine"> 9</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 8</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * to you under the Apache License, Version 2.0 (the</span></pre></td></tr>
-<tr> <td class="numLine"> 10</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 9</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * "License"); you may not use this file except in compliance</span></pre></td></tr>
-<tr> <td class="numLine"> 11</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 10</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * with the License. You may obtain a copy of the License at</span></pre></td></tr>
-<tr> <td class="numLine"> 12</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 11</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 13</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 12</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></pre></td></tr>
-<tr> <td class="numLine"> 14</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 13</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 15</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 14</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Unless required by applicable law or agreed to in writing,</span></pre></td></tr>
-<tr> <td class="numLine"> 16</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 15</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * software distributed under the License is distributed on an</span></pre></td></tr>
-<tr> <td class="numLine"> 17</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 16</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></pre></td></tr>
-<tr> <td class="numLine"> 18</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 17</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * KIND, either express or implied. See the License for the</span></pre></td></tr>
-<tr> <td class="numLine"> 19</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 18</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * specific language governing permissions and limitations</span></pre></td></tr>
-<tr> <td class="numLine"> 20</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 19</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * under the License.</span></pre></td></tr>
-<tr> <td class="numLine"> 21</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 20</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
-<tr> <td class="numLine"> 22</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 21</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
+<tr> <td class="numLine"> 22</td> <td class="nbHits"> </td>
+ <td class="src"><pre class="src"> <span class="keyword">import</span> java.security.NoSuchAlgorithmException;</pre></td></tr>
<tr> <td class="numLine"> 23</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
<tr> <td class="numLine"> 24</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="keyword">import</span> java.security.NoSuchAlgorithmException;</pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment">/**</span></pre></td></tr>
<tr> <td class="numLine"> 25</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> </pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * An implementation of CryptoService that uses either supplied crypto</span></pre></td></tr>
<tr> <td class="numLine"> 26</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment">/**</span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * Algorithms (provided in Fulcrum.properties) or tries to get them via</span></pre></td></tr>
<tr> <td class="numLine"> 27</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * An implementation of CryptoService that uses either supplied crypto</span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * the normal java mechanisms if this fails.</span></pre></td></tr>
<tr> <td class="numLine"> 28</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * Algorithms (provided in Fulcrum.properties) or tries to get them via</span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
<tr> <td class="numLine"> 29</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * the normal java mechanisms if this fails.</span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * @author <a href="mailto:epugh@upstate.com">Eric Pugh</a></span></pre></td></tr>
<tr> <td class="numLine"> 30</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * @author <a href="mailto:mcconnell@apache.org">Stephen McConnell</a></span></pre></td></tr>
<tr> <td class="numLine"> 31</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * @author <a href="mailto:epugh@upstate.com">Eric Pugh</a></span></pre></td></tr>
+ <td class="src"><pre class="src"> <span class="comment"> * @version $Id: CryptoService.java 1852158 2019-01-25 18:19:46Z painter $ </span></pre></td></tr>
<tr> <td class="numLine"> 32</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * @author <a href="mailto:mcconnell@apache.org">Stephen McConnell</a></span></pre></td></tr>
-<tr> <td class="numLine"> 33</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
-<tr> <td class="numLine"> 34</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 33</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="keyword">public</span> <span class="keyword">interface</span> CryptoService</pre></td></tr>
-<tr> <td class="numLine"> 35</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 34</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> {</pre></td></tr>
-<tr> <td class="numLineCover"> 36</td> <td class="nbHitsCovered"> 2</td> <td class="src"><pre class="src"> String ROLE = CryptoService.<span class="keyword">class</span>.getName();</pre></td></tr>
-<tr> <td class="numLine"> 37</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 35</td> <td class="nbHits"> </td>
+ <td class="src"><pre class="src"> String ROLE = CryptoService.<span class="keyword">class</span>.getName();</pre></td></tr>
+<tr> <td class="numLine"> 36</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> </pre></td></tr>
-<tr> <td class="numLine"> 38</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 37</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment">/**</span></pre></td></tr>
-<tr> <td class="numLine"> 39</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 38</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * Returns a CryptoAlgorithm Object which represents the requested</span></pre></td></tr>
-<tr> <td class="numLine"> 40</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 39</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * crypto algorithm.</span></pre></td></tr>
-<tr> <td class="numLine"> 41</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 40</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
+<tr> <td class="numLine"> 41</td> <td class="nbHits"> </td>
+ <td class="src"><pre class="src"> <span class="comment"> * @param algo Name of the requested algorithm</span></pre></td></tr>
<tr> <td class="numLine"> 42</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> * @param algo Name of the requested algorithm</span></pre></td></tr>
-<tr> <td class="numLine"> 43</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 44</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @return An Object representing the algorithm</span></pre></td></tr>
-<tr> <td class="numLine"> 45</td> <td class="nbHits"> </td>
- <td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 46</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 43</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> * @throws NoSuchAlgorithmException Requested algorithm is not available</span></pre></td></tr>
-<tr> <td class="numLine"> 47</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 44</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> *</span></pre></td></tr>
-<tr> <td class="numLine"> 48</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 45</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="comment"> */</span></pre></td></tr>
-<tr> <td class="numLine"> 49</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 46</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> <span class="keyword">public</span> CryptoAlgorithm getCryptoAlgorithm(String algo) <span class="keyword">throws</span> NoSuchAlgorithmException;</pre></td></tr>
-<tr> <td class="numLine"> 50</td> <td class="nbHits"> </td>
+<tr> <td class="numLine"> 47</td> <td class="nbHits"> </td>
<td class="src"><pre class="src"> }</pre></td></tr>
</table>
-<div class="footer">Report generated by <a href="http://cobertura.sourceforge.net/" target="_top">Cobertura</a> 1.9 on 10.09.09 09:16.</div>
+<div class="footer">Report generated by <a href="http://cobertura.sourceforge.net/" target="_top">Cobertura</a> 2.1.1 on 5/20/19 10:35 AM.</div>
</body>
-</html>
+</html>
\ No newline at end of file