mirror of
				https://github.com/tc39/test262.git
				synced 2025-10-29 18:53:58 +01:00 
			
		
		
		
	sourceRevisionAtLastExport: 33f2fb0e53d135f0ee17cfccd9d993eb2a6f47de targetRevisionAtLastExport: 31340cbd9add103f586d501b0c3354b7b182abc0
		
			
				
	
	
		
			26 lines
		
	
	
		
			788 B
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
			
		
		
	
	
			26 lines
		
	
	
		
			788 B
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
| // Copyright 2014 the V8 project authors. All rights reserved.
 | |
| // Use of this source code is governed by a BSD-style license that can be
 | |
| // found in the LICENSE file.
 | |
| 
 | |
| var stdlib = {};
 | |
| var foreign = {};
 | |
| var heap = new ArrayBuffer(64 * 1024);
 | |
| 
 | |
| var mod = (function Module(stdlib, foreign, heap) {
 | |
|   "use asm";
 | |
|   function mod(dividend, divisor) {
 | |
|     dividend = dividend | 0;
 | |
|     divisor = divisor | 0;
 | |
|     return ((dividend >>> 0) % (divisor >>> 0)) | 0;
 | |
|   }
 | |
|   return { mod: mod };
 | |
| })(stdlib, foreign, heap).mod;
 | |
| 
 | |
| var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295];
 | |
| for (var i in divisors) {
 | |
|   var divisor = divisors[i];
 | |
|   for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
 | |
|     assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
 | |
|   }
 | |
| }
 |