UXP - Unnamed repository; edit this file 'description' to name the repository.

	Commit message (Collapse)	Author	Age	Lines
*	Avoid using memset on a not-trivial type like ServoSizes	trav90	2018-08-18	-1/+9
\|
*	Avoid using memset on a not-trivial type like TabSizes	trav90	2018-08-18	-1/+7
\|
*	Avoid doing a memset on a non-POD structure	trav90	2018-08-18	-13/+33
\| \| \| \| \| \|	\|entryCount\| tracks -- in fast-to-check manner -- the number of entries in the hashtable. But to actually enumerate entries, we have to loop through all of \|table\|, checking for entries that are actually live. A live entry is indicated by a zero \|hash\| in the entry. The \|memset\| would properly zero that; removing the memset will not. It's not entirely clear whether a memset that overwrites a lot of stuff but is maybe simpler, is faster than compiler-generated likely-SIMD code that zeroes out just \|hash\| fields in all the entries. But I am going to guess that SIMD is good enough. For now, we should just do the simple and thing: don't distinguish POD and non-POD, and know that the compiler is going to recognize that \|mem.addr()->~T()\| is a no-op when T is trivial. So with POD, the loop should degenerate to just zeroing \|hash\| at consistent offset, and SIMD will eat that up, and it can't be that different from the memset in performance (if it is at all).
*	Refactor structured clone JSAPI to prevent mismatched scopes.	wolfbeast	2018-06-07	-31/+176
\| \| \| \|	Roll-up of bugs 1442722, 1455071, 1433642, 1456604 and 1458320.
*	Bug 1411415.	wolfbeast	2018-04-29	-4/+51
\|
*	Merge branch 'html_input_datetime_1'	wolfbeast	2018-04-15	-0/+8
\|\ \| \| \| \| \| \|	This is almost everything needed for #162.
\| *	Bug 1310078 - Implement valueAsNumber and valueAsDate for <input ↵	janekptacijarabaci	2018-03-30	-0/+8
\| \| \| \| \| \| \| \|	type=datetime-local>
* \|	Fix Value::isGCThing footgun, stop returning true for NullValue	trav90	2018-04-07	-42/+26
\|/
*	Add m-esr52 at 52.6.0	Matt A. Tobin	2018-02-02	-0/+17568