-
Notifications
You must be signed in to change notification settings - Fork 11
/
phpjs.js
executable file
·10310 lines (9388 loc) · 405 KB
/
phpjs.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* More info at: http://phpjs.org
*
* This is version: 3.17
* php.js is copyright 2010 Kevin van Zonneveld.
*
* Portions copyright Brett Zamir (http://brett-zamir.me), Kevin van Zonneveld
* (http://kevin.vanzonneveld.net), Onno Marsman, Theriault, Michael White
* (http://getsprink.com), Waldo Malqui Silva, Paulo Freitas, Jonas Raoni
* Soares Silva (http://www.jsfromhell.com), Jack, Philip Peterson, Legaev
* Andrey, Ates Goral (http://magnetiq.com), Alex, Ratheous, Martijn Wieringa,
* lmeyrick (https://sourceforge.net/projects/bcmath-js/), Nate, Philippe
* Baumann, Enrique Gonzalez, Webtoolkit.info (http://www.webtoolkit.info/),
* Jani Hartikainen, Ash Searle (http://hexmen.com/blog/), travc, Ole
* Vrijenhoek, Carlos R. L. Rodrigues (http://www.jsfromhell.com),
* http://stackoverflow.com/questions/57803/how-to-convert-decimal-to-hex-in-javascript,
* Michael Grier, Johnny Mast (http://www.phpvrouwen.nl), stag019, Rafał
* Kukawski (http://blog.kukawski.pl), pilus, T.Wild, Andrea Giammarchi
* (http://webreflection.blogspot.com), WebDevHobo
* (http://webdevhobo.blogspot.com/), GeekFG (http://geekfg.blogspot.com),
* d3x, Erkekjetter, marrtins, Steve Hilder, Martin
* (http://www.erlenwiese.de/), Robin, Oleg Eremeev, mdsjack
* (http://www.mdsjack.bo.it), majak, Mailfaker (http://www.weedem.fr/),
* David, felix, Mirek Slugen, KELAN, Paul Smith, Marc Palau, Chris, Josh
* Fraser
* (http://onlineaspect.com/2007/06/08/auto-detect-a-time-zone-with-javascript/),
* Breaking Par Consulting Inc
* (http://www.breakingpar.com/bkp/home.nsf/0/87256B280015193F87256CFB006C45F7),
* Tim de Koning (http://www.kingsquare.nl), Arpad Ray (mailto:[email protected]),
* Public Domain (http://www.json.org/json2.js), Michael White, Steven
* Levithan (http://blog.stevenlevithan.com), Joris, gettimeofday, Sakimori,
* Alfonso Jimenez (http://www.alfonsojimenez.com), Aman Gupta, Caio Ariede
* (http://caioariede.com), AJ, Diplom@t (http://difane.com/), saulius,
* Pellentesque Malesuada, Thunder.m, Tyler Akins (http://rumkin.com), Felix
* Geisendoerfer (http://www.debuggable.com/felix), gorthaur, Imgen Tata
* (http://www.myipdf.com/), Karol Kowalski, Kankrelune
* (http://www.webfaktory.info/), Lars Fischer, Subhasis Deb, josh, Frank
* Forte, Douglas Crockford (http://javascript.crockford.com), Adam Wallner
* (http://web2.bitbaro.hu/), Marco, paulo kuong, madipta, Gilbert, duncan,
* ger, mktime, Oskar Larsson Högfeldt (http://oskar-lh.name/), Arno, Nathan,
* Mateusz "loonquawl" Zalega, ReverseSyntax, Francois, Scott Cariss, Slawomir
* Kaniecki, Denny Wardhana, sankai, 0m3r, noname, john
* (http://www.jd-tech.net), Nick Kolosov (http://sammy.ru), Sanjoy Roy,
* Shingo, nobbler, Fox, marc andreu, T. Wild, class_exists, Jon Hohle,
* Pyerre, JT, Thiago Mata (http://thiagomata.blog.com), Linuxworld, Ozh,
* nord_ua, lmeyrick (https://sourceforge.net/projects/bcmath-js/this.),
* Thomas Beaucourt (http://www.webapp.fr), David Randall, merabi, T0bsn,
* Soren Hansen, Peter-Paul Koch (http://www.quirksmode.org/js/beat.html),
* MeEtc (http://yass.meetcweb.com), Bryan Elliott, Tim Wiel, Brad Touesnard,
* XoraX (http://www.xorax.info), djmix, Hyam Singer
* (http://www.impact-computing.com/), Paul, J A R, kenneth, Raphael (Ao
* RUDLER), David James, Steve Clay, Ole Vrijenhoek (http://www.nervous.nl/),
* Marc Jansen, Francesco, Der Simon (http://innerdom.sourceforge.net/), echo
* is bad, Lincoln Ramsay, Eugene Bulkin (http://doubleaw.com/), JB, Bayron
* Guevara, Stoyan Kyosev (http://www.svest.org/), LH, Matt Bradley, date,
* Kristof Coomans (SCK-CEN Belgian Nucleair Research Centre), Pierre-Luc
* Paour, Martin Pool, Brant Messenger (http://www.brantmessenger.com/), Kirk
* Strobeck, Saulo Vallory, Christoph, Wagner B. Soares, Artur Tchernychev,
* Valentina De Rosa, Jason Wong (http://carrot.org/), Daniel Esteban,
* strftime, Rick Waldron, Mick@el, Anton Ongson, Simon Willison
* (http://simonwillison.net), Gabriel Paderni, Philipp Lenssen, Marco van
* Oort, Bug?, Blues (http://tech.bluesmoon.info/), Tomasz Wesolowski, rezna,
* Eric Nagel, Bobby Drake, Luke Godfrey, Pul, uestla, Alan C, Zahlii, Ulrich,
* Yves Sucaet, hitwork, sowberry, johnrembo, Brian Tafoya
* (http://www.premasolutions.com/), Nick Callen, Steven Levithan
* (stevenlevithan.com), ejsanders, Scott Baker, Philippe Jausions
* (http://pear.php.net/user/jausions), Aidan Lister
* (http://aidanlister.com/), Norman "zEh" Fuchs, Rob, HKM, ChaosNo1, metjay,
* strcasecmp, strcmp, Taras Bogach, jpfle, Alexander Ermolaev
* (http://snippets.dzone.com/user/AlexanderErmolaev), DxGx, kilops, Orlando,
* dptr1988, Le Torbi, Pedro Tainha (http://www.pedrotainha.com), James,
* penutbutterjelly, Christian Doebler, baris ozdil, Greg Frazier, Tod
* Gentille, Alexander M Beedie, Ryan W Tenney (http://ryan.10e.us),
* FGFEmperor, gabriel paderni, Atli Þór, Maximusya, daniel airton wermann
* (http://wermann.com.br), 3D-GRAF, Yannoo, jakes, Riddler
* (http://www.frontierwebdev.com/), T.J. Leahy, stensi, Matteo, Billy, vlado
* houba, Itsacon (http://www.itsacon.net/), Jalal Berrami, Victor, fearphage
* (http://http/my.opera.com/fearphage/), Luis Salazar
* (http://www.freaky-media.com/), FremyCompany, Tim de Koning, taith, Cord,
* Manish, davook, Benjamin Lupton, Garagoth, Andrej Pavlovic, Dino, William,
* rem, Russell Walker (http://www.nbill.co.uk/), Jamie Beck
* (http://www.terabit.ca/), setcookie, Michael, YUI Library:
* http://developer.yahoo.com/yui/docs/YAHOO.util.DateLocale.html, Blues at
* http://hacks.bluesmoon.info/strftime/strftime.js, DtTvB
* (http://dt.in.th/2008-09-16.string-length-in-bytes.html), Andreas, meo,
* Greenseed, Luke Smith (http://lucassmith.name), Kheang Hok Chin
* (http://www.distantia.ca/), Rival, Diogo Resende, Allan Jensen
* (http://www.winternet.no), Howard Yeend, Jay Klehr, Amir Habibi
* (http://www.residence-mixte.com/), mk.keck, Yen-Wei Liu, Leslie Hoare, Ben
* Bryan, Cagri Ekin, booeyOH
*
* Dual licensed under the MIT (MIT-LICENSE.txt)
* and GPL (GPL-LICENSE.txt) licenses.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE 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 KEVIN VAN ZONNEVELD 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.
*/
// jslint.com configuration options. See: http://wiki.github.com/kvz/phpjs/jslint-options
/* global window */
/* jslint adsafe: false, bitwise: false, browser: false, cap: false, css: false, debug: false, devel: false, eqeqeq: true, evil: false, forin: false, fragment: false, immed: true, indent: 4, laxbreak: false, maxerr: 100, maxlen: 80, newcap: true, nomen: false, on: true, onevar: false, passfail: false, plusplus: false, regexp: false, rhino: false, safe: false, sidebar: false, strict: false, sub: false, undef: true, white: false, widget: false */
// Our idea with CommonJS is that you can do the following:
// var php = require('php');
// php.md5('test');
exports.abs = function (mixed_number) {
// Return the absolute value of the number
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/abs
// + original by: Waldo Malqui Silva
// + improved by: Karol Kowalski
// + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)
// * example 1: \php.abs(4.2);
// * returns 1: 4.2
// * example 2: \php.abs(-4.2);
// * returns 2: 4.2
// * example 3: \php.abs(-5);
// * returns 3: 5
// * example 4: \php.abs('_argos');
// * returns 4: 0
return Math.abs(mixed_number) || 0;
};
exports.acos = function (arg) {
// Return the arc cosine of the number in radians
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/acos
// + original by: Onno Marsman
// * example 1: \php.acos(0.3);
// * returns 1: 1.2661036727794992
return Math.acos(arg);
};
exports.acosh = function (arg) {
// Returns the inverse hyperbolic cosine of the number, i.e. the value whose hyperbolic cosine is number
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/acosh
// + original by: Onno Marsman
// * example 1: \php.acosh(8723321.4);
// * returns 1: 16.674657798418625
return Math.log(arg + Math.sqrt(arg*arg-1));
};
exports.addslashes = function (str) {
// Escapes single quote, double quotes and backslash characters in a string with backslashes
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/addslashes
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Ates Goral (http://magnetiq.com)
// + improved by: marrtins
// + improved by: Nate
// + improved by: Onno Marsman
// + input by: Denny Wardhana
// + improved by: Brett Zamir (http://brett-zamir.me)
// + improved by: Oskar Larsson Högfeldt (http://oskar-lh.name/)
// * example 1: \php.addslashes("kevin's birthday");
// * returns 1: 'kevin\'s birthday'
return (str+'').replace(/[\\"']/g, '\\$&').replace(/\u0000/g, '\\0');
};
exports.array_change_key_case = function (array) {
// Retuns an array with all string keys lowercased [or uppercased]
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_change_key_case
// + original by: Ates Goral (http://magnetiq.com)
// + improved by: marrtins
// * example 1: \php.array_change_key_case(42);
// * returns 1: false
// * example 2: \php.array_change_key_case([ 3, 5 ]);
// * returns 2: {0: 3, 1: 5}
// * example 3: \php.array_change_key_case({ FuBaR: 42 });
// * returns 3: {"fubar": 42}
// * example 4: \php.array_change_key_case({ FuBaR: 42 }, 'CASE_LOWER');
// * returns 4: {"fubar": 42}
// * example 5: \php.array_change_key_case({ FuBaR: 42 }, 'CASE_UPPER');
// * returns 5: {"FUBAR": 42}
// * example 6: \php.array_change_key_case({ FuBaR: 42 }, 2);
// * returns 6: {"FUBAR": 42}
var case_fn, tmp_ar = {}, argc = arguments.length, argv = arguments, key;
if (array instanceof Array) {
return array;
}
if (array instanceof Object) {
if (argc === 1 || argv[1] === 'CASE_LOWER' || argv[1] === 0){
case_fn = "toLowerCase";
} else{
case_fn = "toUpperCase";
}
for (key in array) {
tmp_ar[key[case_fn]()] = array[key];
}
return tmp_ar;
}
return false;
};
exports.array_chunk = function (input, size) {
// Split array into chunks
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_chunk
// + original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com)
// * example 1: \php.array_chunk(['Kevin', 'van', 'Zonneveld'], 2);
// * returns 1: {0 : {0: 'Kevin', 1: 'van'} , 1 : {0: 'Zonneveld'}}
for (var x, i = 0, c = -1, l = input.length, n = []; i < l; i++){
(x = i % size) ? n[c][x] = input[i] : n[++c] = [input[i]];
}
return n;
};
exports.array_combine = function (keys, values) {
// Creates an array by using the elements of the first parameter as keys and the elements of the second as the corresponding values
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_combine
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.array_combine([0,1,2], ['kevin','van','zonneveld']);
// * returns 1: {0: 'kevin', 1: 'van', 2: 'zonneveld'}
var new_array = {}, keycount = keys && keys.length, i = 0;
// input sanitation
if (typeof keys !== 'object' || typeof values !== 'object' || // Only accept arrays or array-like objects
typeof keycount !== 'number' || typeof values.length !== 'number' ||
!keycount){ // Require arrays to have a count
return false;
}
// number of elements does not match
if (keycount != values.length){
return false;
}
for ( i=0; i < keycount; i++ ){
new_array[keys[i]] = values[i];
}
return new_array;
};
exports.array_count_values = function (array) {
// Return the value as key and the frequency of that value in input as value
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_count_values
// + original by: Ates Goral (http://magnetiq.com)
// + namespaced by: Michael White (http://getsprink.com)
// + input by: sankai
// + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + input by: Shingo
// + bugfixed by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.array_count_values([ 3, 5, 3, "foo", "bar", "foo" ]);
// * returns 1: {3:2, 5:1, "foo":2, "bar":1}
// * example 2: \php.array_count_values({ p1: 3, p2: 5, p3: 3, p4: "foo", p5: "bar", p6: "foo" });
// * returns 2: {3:2, 5:1, "foo":2, "bar":1}
// * example 3: \php.array_count_values([ true, 4.2, 42, "fubar" ]);
// * returns 3: {42:1, "fubar":1}
var tmp_arr = {}, key = '', t = '';
var __getType = function (obj) {
// Objects are php associative arrays.
var t = typeof obj;
t = t.toLowerCase();
if (t === "object") {
t = "array";
}
return t;
};
var __countValue = function (value) {
switch (typeof(value)) {
case "number":
if (Math.floor(value) !== value) {
return;
}
// Fall-through
case "string":
if (value in this && this.hasOwnProperty(value)) {
++this[value];
} else {
this[value] = 1;
}
}
};
t = __getType(array);
if (t === 'array') {
for (key in array) {
if (array.hasOwnProperty(key)) {
__countValue.call(tmp_arr, array[key]);
}
}
}
return tmp_arr;
};
exports.array_diff = function () {
// Returns the entries of arr1 that have values which are not present in any of the others arguments.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_diff
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Sanjoy Roy
// + revised by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.array_diff(['Kevin', 'van', 'Zonneveld'], ['van', 'Zonneveld']);
// * returns 1: {0:'Kevin'}
var arr1 = arguments[0], retArr = {};
var k1 = '', i = 1, k = '', arr = {};
arr1keys:
for (k1 in arr1) {
for (i = 1; i < arguments.length; i++) {
arr = arguments[i];
for (k in arr) {
if (arr[k] === arr1[k1]) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
}
}
retArr[k1] = arr1[k1];
}
}
return retArr;
};
exports.array_diff_assoc = function () {
// Returns the entries of arr1 that have values which are not present in any of the others arguments but do additional checks whether the keys are equal
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_diff_assoc
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + bugfixed by: 0m3r
// + revised by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.array_diff_assoc({0: 'Kevin', 1: 'van', 2: 'Zonneveld'}, {0: 'Kevin', 4: 'van', 5: 'Zonneveld'});
// * returns 1: {1: 'van', 2: 'Zonneveld'}
var arr1 = arguments[0], retArr = {};
var k1 = '', i = 1, k = '', arr = {};
arr1keys:
for (k1 in arr1) {
for (i = 1; i < arguments.length; i++) {
arr = arguments[i];
for (k in arr) {
if (arr[k] === arr1[k1] && k === k1) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
}
}
retArr[k1] = arr1[k1];
}
}
return retArr;
};
exports.array_diff_key = function () {
// Returns the entries of arr1 that have keys which are not present in any of the others arguments. This function is like array_diff() but works on the keys instead of the values. The associativity is preserved.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_diff_key
// + original by: Ates Goral (http://magnetiq.com)
// + revised by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.array_diff_key({red: 1, green: 2, blue: 3, white: 4}, {red: 5});
// * returns 1: {"green":2, "blue":3, "white":4}
// * example 2: \php.array_diff_key({red: 1, green: 2, blue: 3, white: 4}, {red: 5}, {red: 5});
// * returns 2: {"green":2, "blue":3, "white":4}
var arr1 = arguments[0], retArr = {};
var k1 = '', i = 1, k = '', arr = {};
arr1keys:
for (k1 in arr1) {
for (i = 1; i < arguments.length; i++) {
arr = arguments[i];
for (k in arr) {
if (k === k1) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
}
}
retArr[k1] = arr1[k1];
}
}
return retArr;
};
exports.array_diff_uassoc = function () {
// Returns the entries of arr1 that have values which are not present in any of the others arguments but do additional checks whether the keys are equal. Elements are compared by user supplied function.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_diff_uassoc
// + original by: Brett Zamir (http://brett-zamir.me)
// * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'}
// * example 1: $array2 = {a: 'GREEN', B: 'brown', 0: 'yellow', 1: 'red'}
// * example 1: \php.array_diff_uassoc($array1, $array2, function (key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); });
// * returns 1: {b: 'brown', c: 'blue', 0: 'red'}
var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1];
var arr = {}, i = 1, k1 = '', k = '';
cb = (typeof cb === 'string') ? this.window[cb] : (cb instanceof Array) ? this.window[cb[0]][cb[1]] : cb;
arr1keys:
for (k1 in arr1) {
for (i=1; i < arguments.length-1; i++) {
arr = arguments[i];
for (k in arr) {
if (arr[k] === arr1[k1] && cb(k, k1) === 0) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
}
}
retArr[k1] = arr1[k1];
}
}
return retArr;
};
exports.array_diff_ukey = function () {
// Returns the entries of arr1 that have keys which are not present in any of the others arguments. User supplied function is used for comparing the keys. This function is like array_udiff() but works on the keys instead of the values. The associativity is preserved.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_diff_ukey
// + original by: Brett Zamir (http://brett-zamir.me)
// * example 1: $array1 = {blue: 1, red: 2, green: 3, purple: 4}
// * example 1: $array2 = {green: 5, blue: 6, yellow: 7, cyan: 8}
// * example 1: \php.array_diff_ukey($array1, $array2, function (key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); });
// * returns 1: {red: 2, purple: 4}
var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1];
var arr = {}, i = 1, k1 = '', k = '';
cb = (typeof cb === 'string') ? this.window[cb] : (cb instanceof Array) ? this.window[cb[0]][cb[1]] : cb;
arr1keys:
for (k1 in arr1) {
for (i=1; i < arguments.length-1; i++) {
arr = arguments[i];
for (k in arr) {
if (cb(k, k1) === 0) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
}
}
retArr[k1] = arr1[k1];
}
}
return retArr;
};
exports.array_fill = function (start_index, num, mixed_val) {
// Create an array containing num elements starting with index start_key each initialized to val
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_fill
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Waldo Malqui Silva
// * example 1: \php.array_fill(5, 6, 'banana');
// * returns 1: { 5: 'banana', 6: 'banana', 7: 'banana', 8: 'banana', 9: 'banana', 10: 'banana' }
var key, tmp_arr = {};
if ( !isNaN( start_index ) && !isNaN( num ) ) {
for (key = 0; key < num; key++) {
tmp_arr[(key+start_index)] = mixed_val;
}
}
return tmp_arr;
};
exports.array_fill_keys = function (keys, value) {
// Create an array using the elements of the first parameter as keys each initialized to val
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_fill_keys
// + original by: Brett Zamir (http://brett-zamir.me)
// + bugfixed by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.keys = {'a': 'foo', 2: 5, 3: 10, 4: 'bar'}
// * example 1: \php.array_fill_keys(keys, 'banana')
// * returns 1: {"foo": "banana", 5: "banana", 10: "banana", "bar": "banana"}
var retObj = {}, key = '';
for (key in keys) {
retObj[keys[key]] = value;
}
return retObj;
};
exports.array_filter = function (arr, func) {
// Filters elements from the array via the callback.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_filter
// + original by: Brett Zamir (http://brett-zamir.me)
// % note 1: Takes a function as an argument, not a function's name
// * example 1: \php.var odd = function (num) {return (num & 1);};
// * example 1: \php.array_filter({"a": 1, "b": 2, "c": 3, "d": 4, "e": 5}, odd);
// * returns 1: {"a": 1, "c": 3, "e": 5}
// * example 2: \php.var even = function (num) {return (!(num & 1));}
// * example 2: \php.array_filter([6, 7, 8, 9, 10, 11, 12], even);
// * returns 2: {0: 6, 2: 8, 4: 10, 6: 12}
var retObj = {}, k;
for (k in arr) {
if (func(arr[k])) {
retObj[k] = arr[k];
}
}
return retObj;
};
exports.array_flip = function (trans) {
// Return array with key <-> value flipped
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_flip
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// * example 1: \php.array_flip( {a: 1, b: 1, c: 2} );
// * returns 1: {1: 'b', 2: 'c'}
var key, tmp_ar = {};
for (key in trans) {
tmp_ar[trans[key]] = key;
}
return tmp_ar;
};
exports.array_intersect = function () {
// Returns the entries of arr1 that have values which are present in all the other arguments
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_intersect
// + original by: Brett Zamir (http://brett-zamir.me)
// % note 1: These only output associative arrays (would need to be
// % note 1: all numeric and counting from zero to be numeric)
// * example 1: $array1 = {'a' : 'green', 0:'red', 1: 'blue'};
// * example 1: $array2 = {'b' : 'green', 0:'yellow', 1:'red'};
// * example 1: $array3 = ['green', 'red'];
// * example 1: $result = array_intersect($array1, $array2, $array3);
// * returns 1: {0: 'red', a: 'green'}
var arr1 = arguments[0], retArr = {};
var k1 = '', arr = {}, i = 0, k = '';
arr1keys:
for (k1 in arr1) {
arrs:
for (i=1; i < arguments.length; i++) {
arr = arguments[i];
for (k in arr) {
if (arr[k] === arr1[k1]) {
if (i === arguments.length-1) {
retArr[k1] = arr1[k1];
}
// If the innermost loop always leads at least once to an equal value, continue the loop until done
continue arrs;
}
}
// If it reaches here, it wasn't found in at least one array, so try next value
continue arr1keys;
}
}
return retArr;
};
exports.array_intersect_assoc = function () {
// Returns the entries of arr1 that have values which are present in all the other arguments. Keys are used to do more restrictive check
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_intersect_assoc
// + original by: Brett Zamir (http://brett-zamir.me)
// % note 1: These only output associative arrays (would need to be
// % note 1: all numeric and counting from zero to be numeric)
// * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'}
// * example 1: $array2 = {a: 'green', 0: 'yellow', 1: 'red'}
// * example 1: \php.array_intersect_assoc($array1, $array2)
// * returns 1: {a: 'green'}
var arr1 = arguments[0], retArr = {};
var k1 = '', arr = {}, i = 0, k = '';
arr1keys:
for (k1 in arr1) {
arrs:
for (i=1; i < arguments.length; i++) {
arr = arguments[i];
for (k in arr) {
if (arr[k] === arr1[k1] && k === k1) {
if (i === arguments.length-1) {
retArr[k1] = arr1[k1];
}
// If the innermost loop always leads at least once to an equal value, continue the loop until done
continue arrs;
}
}
// If it reaches here, it wasn't found in at least one array, so try next value
continue arr1keys;
}
}
return retArr;
};
exports.array_intersect_key = function () {
// Returns the entries of arr1 that have keys which are present in all the other arguments. Kind of equivalent to array_diff(array_keys($arr1), array_keys($arr2)[,array_keys(...)]). Equivalent of array_intersect_assoc() but does not do compare of the data.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_intersect_key
// + original by: Brett Zamir (http://brett-zamir.me)
// % note 1: These only output associative arrays (would need to be
// % note 1: all numeric and counting from zero to be numeric)
// * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'}
// * example 1: $array2 = {a: 'green', 0: 'yellow', 1: 'red'}
// * example 1: \php.array_intersect_key($array1, $array2)
// * returns 1: {0: 'red', a: 'green'}
var arr1 = arguments[0], retArr = {};
var k1 = '', arr = {}, i = 0, k = '';
arr1keys:
for (k1 in arr1) {
arrs:
for (i=1; i < arguments.length; i++) {
arr = arguments[i];
for (k in arr) {
if (k === k1) {
if (i === arguments.length-1) {
retArr[k1] = arr1[k1];
}
// If the innermost loop always leads at least once to an equal value, continue the loop until done
continue arrs;
}
}
// If it reaches here, it wasn't found in at least one array, so try next value
continue arr1keys;
}
}
return retArr;
};
exports.array_intersect_uassoc = function () {
// Returns the entries of arr1 that have values which are present in all the other arguments. Keys are used to do more restrictive check and they are compared by using an user-supplied callback.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_intersect_uassoc
// + original by: Brett Zamir (http://brett-zamir.me)
// * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'}
// * example 1: $array2 = {a: 'GREEN', B: 'brown', 0: 'yellow', 1: 'red'}
// * example 1: \php.array_intersect_uassoc($array1, $array2, function (f_string1, f_string2){var string1 = (f_string1+'').toLowerCase(); var string2 = (f_string2+'').toLowerCase(); if (string1 > string2) return 1; if (string1 == string2) return 0; return -1;});
// * returns 1: {b: 'brown'}
var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1];
var k1 = '', i = 1, arr = {}, k = '';
cb = (typeof cb === 'string') ? this.window[cb] : (cb instanceof Array) ? this.window[cb[0]][cb[1]] : cb;
arr1keys:
for (k1 in arr1) {
arrs:
for (i = 1; i < arguments.length-1; i++) {
arr = arguments[i];
for (k in arr) {
if (arr[k] === arr1[k1] && cb(k, k1) === 0 ) {
if (i === arguments.length-2) {
retArr[k1] = arr1[k1];
}
// If the innermost loop always leads at least once to an equal value, continue the loop until done
continue arrs;
}
}
// If it reaches here, it wasn't found in at least one array, so try next value
continue arr1keys;
}
}
return retArr;
};
exports.array_intersect_ukey = function () {
// Returns the entries of arr1 that have keys which are present in all the other arguments. Kind of equivalent to array_diff(array_keys($arr1), array_keys($arr2)[,array_keys(...)]). The comparison of the keys is performed by a user supplied function. Equivalent of array_intersect_uassoc() but does not do compare of the data.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_intersect_ukey
// + original by: Brett Zamir (http://brett-zamir.me)
// * example 1: $array1 = {blue: 1, red: 2, green: 3, purple: 4}
// * example 1: $array2 = {green: 5, blue: 6, yellow: 7, cyan: 8}
// * example 1: \php.array_intersect_ukey ($array1, $array2, function (key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); });
// * returns 1: {blue: 1, green: 3}
var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1];
var k1 = '', i = 1, arr = {}, k = '';
cb = (typeof cb === 'string') ? this.window[cb] : (cb instanceof Array) ? this.window[cb[0]][cb[1]] : cb;
arr1keys:
for (k1 in arr1) {
arrs:
for (i = 1; i < arguments.length-1; i++) {
arr = arguments[i];
for (k in arr) {
if (cb(k, k1) === 0 ) {
if (i === arguments.length-2) {
retArr[k1] = arr1[k1];
}
// If the innermost loop always leads at least once to an equal value, continue the loop until done
continue arrs;
}
}
// If it reaches here, it wasn't found in at least one array, so try next value
continue arr1keys;
}
}
return retArr;
};
exports.array_key_exists = function ( key, search ) {
// Checks if the given key or index exists in the array
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_key_exists
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Felix Geisendoerfer (http://www.debuggable.com/felix)
// * example 1: \php.array_key_exists('kevin', {'kevin': 'van Zonneveld'});
// * returns 1: true
// input sanitation
if (!search || (search.constructor !== Array && search.constructor !== Object)){
return false;
}
return key in search;
};
exports.array_keys = function (input, search_value, argStrict) {
// Return just the keys from the input array, optionally only for the specified search_value
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_keys
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + input by: Brett Zamir (http://brett-zamir.me)
// + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// * example 1: \php.array_keys( {firstname: 'Kevin', surname: 'van Zonneveld'} );
// * returns 1: {0: 'firstname', 1: 'surname'}
var tmp_arr = {}, strict = !!argStrict, include = true, cnt = 0;
var key = '';
for (key in input) {
include = true;
if (search_value != undefined) {
if (strict && input[key] !== search_value){
include = false;
} else if (input[key] != search_value){
include = false;
}
}
if (include) {
tmp_arr[cnt] = key;
cnt++;
}
}
return tmp_arr;
};
exports.array_map = function (callback) {
// Applies the callback to the elements in given arrays.
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_map
// + original by: Andrea Giammarchi (http://webreflection.blogspot.com)
// + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Brett Zamir (http://brett-zamir.me)
// % note 1: Takes a function as an argument, not a function's name
// % note 2: If the callback is a string, it can only work if the function name is in the global context
// * example 1: \php.array_map( function (a){return (a * a * a)}, [1, 2, 3, 4, 5] );
// * returns 1: [ 1, 8, 27, 64, 125 ]
var argc = arguments.length, argv = arguments;
var j = argv[1].length, i = 0, k = 1, m = 0;
var tmp = [], tmp_ar = [];
while (i < j) {
while (k < argc){
tmp[m++] = argv[k++][i];
}
m = 0;
k = 1;
if (callback){
if (typeof callback === 'string') {
callback = this.window[callback];
}
tmp_ar[i++] = callback.apply(null, tmp);
} else {
tmp_ar[i++] = tmp;
}
tmp = [];
}
return tmp_ar;
};
exports.array_merge = function () {
// Merges elements from passed arrays into one array
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_merge
// + original by: Brett Zamir (http://brett-zamir.me)
// + bugfixed by: Nate
// + input by: josh
// + bugfixed by: Brett Zamir (http://brett-zamir.me)
// * example 1: \php.arr1 = {"color": "red", 0: 2, 1: 4}
// * example 1: \php.arr2 = {0: "a", 1: "b", "color": "green", "shape": "trapezoid", 2: 4}
// * example 1: \php.array_merge(arr1, arr2)
// * returns 1: {"color": "green", 0: 2, 1: 4, 2: "a", 3: "b", "shape": "trapezoid", 4: 4}
// * example 2: \php.arr1 = []
// * example 2: \php.arr2 = {1: "data"}
// * example 2: \php.array_merge(arr1, arr2)
// * returns 2: {0: "data"}
var args = Array.prototype.slice.call(arguments),
retObj = {}, k, j = 0, i = 0, retArr = true;
for (i=0; i < args.length; i++) {
if (!(args[i] instanceof Array)) {
retArr=false;
break;
}
}
if (retArr) {
retArr = [];
for (i=0; i < args.length; i++) {
retArr = retArr.concat(args[i]);
}
return retArr;
}
var ct = 0;
for (i=0, ct=0; i < args.length; i++) {
if (args[i] instanceof Array) {
for (j=0; j < args[i].length; j++) {
retObj[ct++] = args[i][j];
}
} else {
for (k in args[i]) {
if (args[i].hasOwnProperty(k)) {
if (parseInt(k, 10)+'' === k) {
retObj[ct++] = args[i][k];
} else {
retObj[k] = args[i][k];
}
}
}
}
}
return retObj;
};
exports.array_merge_recursive = function (arr1, arr2){
// Recursively merges elements from passed arrays into one array
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_merge_recursive
// + original by: Subhasis Deb
// + input by: Brett Zamir (http://brett-zamir.me)
// + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// - depends on: array_merge
// * example 1: \php.arr1 = {'color': {'favourite': 'read'}, 0: 5}
// * example 1: \php.arr2 = {0: 10, 'color': {'favorite': 'green', 0: 'blue'}}
// * example 1: \php.array_merge_recursive(arr1, arr2)
// * returns 1: {'color': {'favorite': {0: 'red', 1: 'green'}, 0: 'blue'}, 1: 5, 1: 10}
var idx = '';
if ((arr1 && (arr1 instanceof Array)) && (arr2 && (arr2 instanceof Array))) {
for (idx in arr2) {
arr1.push(arr2[idx]);
}
} else if ((arr1 && (arr1 instanceof Object)) && (arr2 && (arr2 instanceof Object))) {
for (idx in arr2) {
if (idx in arr1) {
if (typeof arr1[idx] == 'object' && typeof arr2 == 'object') {
arr1[idx] = this.array_merge(arr1[idx], arr2[idx]);
} else {
arr1[idx] = arr2[idx];
}
} else {
arr1[idx] = arr2[idx];
}
}
}
return arr1;
};
exports.array_pad = function ( input, pad_size, pad_value ) {
// Returns a copy of input array padded with pad_value to size pad_size
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_pad
// + original by: Waldo Malqui Silva
// * example 1: \php.array_pad([ 7, 8, 9 ], 2, 'a');
// * returns 1: [ 7, 8, 9]
// * example 2: \php.array_pad([ 7, 8, 9 ], 5, 'a');
// * returns 2: [ 7, 8, 9, 'a', 'a']
// * example 3: \php.array_pad([ 7, 8, 9 ], 5, 2);
// * returns 3: [ 7, 8, 9, 2, 2]
// * example 4: \php.array_pad([ 7, 8, 9 ], -5, 'a');
// * returns 4: [ 'a', 'a', 7, 8, 9 ]
var pad = [], newArray = [], newLength, i=0;
if ( input instanceof Array && !isNaN( pad_size ) ) {
newLength = ( ( pad_size < 0 ) ? ( pad_size * -1 ) : pad_size );
if ( newLength > input.length ) {
for ( i = 0; i < ( newLength - input.length ); i++ ) { newArray [ i ] = pad_value; }
pad = ( ( pad_size < 0 ) ? newArray.concat( input ) : input.concat( newArray ) );
} else {
pad = input;
}
}
return pad;
};
exports.array_pop = function (inputArr) {
// Pops an element off the end of the array
//
// version: 1006.1915
// discuss at: http://phpjs.org/functions/array_pop
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + input by: Brett Zamir (http://brett-zamir.me)
// + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + bugfixed by: Brett Zamir (http://brett-zamir.me)
// + input by: Theriault
// % note 1: While IE (and other browsers) support iterating an object's
// % note 1: own properties in order, if one attempts to add back properties
// % note 1: in IE, they may end up in their former position due to their position
// % note 1: being retained. So use of this function with "associative arrays"
// % note 1: (objects) may lead to unexpected behavior in an IE environment if
// % note 1: you add back properties with the same keys that you removed
// * example 1: \php.array_pop([0,1,2]);
// * returns 1: 2
// * example 2: \php.data = {firstName: 'Kevin', surName: 'van Zonneveld'};
// * example 2: \php.lastElem = array_pop(data);
// * returns 2: 'van Zonneveld'
// * results 2: data == {firstName: 'Kevin'}
var key = '', lastKey = '';
if (inputArr.hasOwnProperty('length')) {
// Indexed
if (!inputArr.length){
// Done popping, are we?
return null;
}
return inputArr.pop();
} else {
// Associative
for (key in inputArr) {
if (inputArr.hasOwnProperty(key)) {
lastKey = key;
}
}