Merge pull request #23 from canjs/ie-compat

fix serializer Map instantiation for IE11

Author: cherifGsoul

src/serializer.js

@@ -1,7 +1,13 @@
 var canReflect = require("can-reflect");
 
 var Serializer = function(entries){
-    this.serializers = new Map(entries || []);
+	var serializers = this.serializers = new Map();
+	if (entries) {
+		entries.forEach(function(entry) {
+			var key = entry[0], value = entry[1];
+			serializers.set(key, value);
+		});
+	}
     this.serialize = this.serialize.bind(this);
 };
 Serializer.prototype.add = function(serializers){

test/special-comparison-logic-test.js

@@ -7,13 +7,13 @@ QUnit.module("can-query-logic special comparison logic");
 QUnit.test("where to filter", function(){
 
 	var todoQueryLogic = new QueryLogic({}, {
-		toQuery(params){
+		toQuery: function(params){
 			var where = params.where;
 			delete params.where;
 			params.filter = where;
 			return params;
 		},
-		toParams(query){
+		toParams: function(query){
 			var where = query.filter;
 			delete query.filter;
 			query.where = where;
@@ -52,7 +52,7 @@ QUnit.test("Searchable string", function(){
 
 	// Specify how to do the fundamental set comparisons.
 	QueryLogic.defineComparison(SearchableStringSet,SearchableStringSet,{
-		union(searchA, searchB){
+		union: function(searchA, searchB){
 			if(searchA.value.includes(searchB.value)) {
 				return searchB;
 			}
@@ -62,7 +62,7 @@ QUnit.test("Searchable string", function(){
 			return new QueryLogic.ValuesOr([searchA, searchB]);
 		},
 		// a aa
-		intersection(searchA, searchB){
+		intersection: function(searchA, searchB){
 			if(searchA.value.includes(searchB.value)) {
 				return searchA;
 			}
@@ -71,7 +71,7 @@ QUnit.test("Searchable string", function(){
 			}
 			return QueryLogic.UNDEFINABLE;
 		},
-		difference(searchA, searchB){
+		difference: function(searchA, searchB){
 			// if a is a subset
 			if(searchA.value.includes(searchB.value)) {
 				return QueryLogic.EMPTY;