5075. EPMO Open Source Coordination Office Redaction File Detail Report

Produced by Araxis Merge on 1/2/2018 12:00:49 PM Eastern Standard Time. See www.araxis.com for information about Merge. This report uses XHTML and CSS2, and is best viewed with a modern standards-compliant browser. For optimum results when printing this report, use landscape orientation and enable printing of background images and colours in your browser.

5075.1 Files compared

#	Location	File	Last Modified
1			Tue Jan 2 17:00:49 2018 UTC
2	HTRE_P2.zip\src.zip\output\ihta_admin.zip\register.zip\whdata	whidata.js	Mon Apr 18 16:27:58 2016 UTC

5075.2 Comparison summary

Description	Between Files 1 and 2
Description	Text Blocks	Lines
Unchanged	0	0
Changed	0	0
Inserted	1	89
Removed	0	0

5075.3 Comparison options

Whitespace
Character case	Differences in character case are significant
Line endings	Differences in line endings (`CR` and `LF` characters) are ignored
CR/LF characters	Not shown in the comparison detail

5075.4 Active regular expressions

No regular expressions were active.

5075.5 Comparison detail

				1		// We bHelp 5.10 .001
				2		// const s trings
				3		var gIEA = new Array ();
				4		function a IE()
				5		{
				6		va r len = gI EA.length;
				7		gI EA[len] = new indexE ntry(aIE.a rguments);
				8		}
				9
				10		function t opic(sName , sURL)
				11		{
				12		th is.sName = sName;
				13		th is.sURL = sURL;
				14		}
				15
				16		function i ndexEntry( fn_argumen ts)
				17		{
				18		if (fn_argum ents.lengt h && fn_ar guments.le ngth >= 3)
				19		{
				20		this .nType = f n_argument s[0];
				21		this .nPKOff = 0;
				22		this .nNKOff = fn_argumen ts[1];
				23		this .sName = f n_argument s[2];
				24		this .aTopics = null;
				25		var nLen = fn_ arguments. length;
				26		if ( Math.floor (nLen / 2) * 2 == nL en)
				27		{
				28		this.s Target = f n_argument s[3];
				29		if (nL en > 5)
				30		{
				31		this.aTo pics = new Array();
				32		for (var i = 0; i < (nLen - 5)/2; i++)
				33		{
				34		this.aTopi cs[i] = ne w topic(fn _arguments [i * 2 + 4 ], fn_argu ments[i * 2 + 5]);
				35		}
				36		}
				37
				38		}
				39		else
				40		{
				41		if (nL en > 4)
				42		{
				43		this.aTo pics = new Array();
				44		for (var i = 0; i < (nLen - 4)/2; i++)
				45		{
				46		this.aTopi cs[i] = ne w topic(fn _arguments [i * 2 + 3 ], fn_argu ments[i * 2 + 4]);
				47		}
				48		}
				49		}
				50		}
				51		}
				52
				53		function g etIndexTop icMappingL ist(nItemI ndex)
				54		{
				55		va r sTopics = "";
				56		if (gIEA.len gth > nIte mIndex)
				57		{
				58		if ( gIEA[nItem Index].aTo pics)
				59		{
				60		var i = 0;
				61		var nL en = gIEA[ nItemIndex ].aTopics. length;
				62		for (i = 0; i < nLen; i ++ )
				63		{
				64		sTopics += "," + g IEA[nItemI ndex].aTop ics[i];
				65		}
				66		}
				67		}
				68		re turn sTopi cs;
				69		}
				70
				71		function w indow_OnLo ad()
				72		{
				73		if (parent & & parent ! = this) {
				74		if ( parent.put Data)
				75		{
				76		for (v ar i = 0; i < gIEA.l ength; i + + )
				77		{
				78		if (gIEA [i].nNKOff != 0 && i + gIEA[i] .nNKOff + 1 < gIEA.l ength)
				79		{
				80
				81		gIEA[i + g IEA[i].nNK Off + 1].n PKOff = gI EA[i].nNKO ff;
				82		}
				83		}
				84		parent .putData(g IEA);
				85		}
				86		}
				87		}
				88
				89		window.onl oad = wind ow_OnLoad;