PHP's max in JavaScript

Here’s what our current JavaScript equivalent to PHP's max looks like.

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
module.exports = function max () {
// discuss at: http://locutus.io/php/max/
// original by: Onno Marsman (https://twitter.com/onnomarsman)
// revised by: Onno Marsman (https://twitter.com/onnomarsman)
// improved by: Jack
// note 1: Long code cause we're aiming for maximum PHP compatibility
// example 1: max(1, 3, 5, 6, 7)
// returns 1: 7
// example 2: max([2, 4, 5])
// returns 2: 5
// example 3: max(0, 'hello')
// returns 3: 0
// example 4: max('hello', 0)
// returns 4: 'hello'
// example 5: max(-1, 'hello')
// returns 5: 'hello'
// example 6: max([2, 4, 8], [2, 5, 7])
// returns 6: [2, 5, 7]

var ar
var retVal
var i = 0
var n = 0
var argv = arguments
var argc = argv.length
var _obj2Array = function (obj) {
if (Object.prototype.toString.call(obj) === '[object Array]') {
return obj
} else {
var ar = []
for (var i in obj) {
if (obj.hasOwnProperty(i)) {
ar.push(obj[i])
}
}
return ar
}
}
var _compare = function (current, next) {
var i = 0
var n = 0
var tmp = 0
var nl = 0
var cl = 0

if (current === next) {
return 0
} else if (typeof current === 'object') {
if (typeof next === 'object') {
current = _obj2Array(current)
next = _obj2Array(next)
cl = current.length
nl = next.length
if (nl > cl) {
return 1
} else if (nl < cl) {
return -1
}
for (i = 0, n = cl; i < n; ++i) {
tmp = _compare(current[i], next[i])
if (tmp === 1) {
return 1
} else if (tmp === -1) {
return -1
}
}
return 0
}
return -1
} else if (typeof next === 'object') {
return 1
} else if (isNaN(next) && !isNaN(current)) {
if (current === 0) {
return 0
}
return (current < 0 ? 1 : -1)
} else if (isNaN(current) && !isNaN(next)) {
if (next === 0) {
return 0
}
return (next > 0 ? 1 : -1)
}

if (next === current) {
return 0
}

return (next > current ? 1 : -1)
}

if (argc === 0) {
throw new Error('At least one value should be passed to max()')
} else if (argc === 1) {
if (typeof argv[0] === 'object') {
ar = _obj2Array(argv[0])
} else {
throw new Error('Wrong parameter count for max()')
}
if (ar.length === 0) {
throw new Error('Array must contain at least one element for max()')
}
} else {
ar = argv
}

retVal = ar[0]
for (i = 1, n = ar.length; i < n; ++i) {
if (_compare(retVal, ar[i]) === 1) {
retVal = ar[i]
}
}

return retVal
}
[ View on GitHub | Edit on GitHub | Source on GitHub ]

How to use

You you can install via npm install locutus and require it via require('locutus/php/math/max'). You could also require the math module in full so that you could access math.max instead.

If you intend to target the browser, you can then use a module bundler such as Browserify, webpack or rollup.js.

ES5/ES6

This function targets ES5, but as of Locutus 2.0.2 we also support ES6 functions. Locutus transpiles to ES5 before publishing to npm.

A community effort

Not unlike Wikipedia, Locutus is an ongoing community effort. Our philosophy follows The McDonald’s Theory. This means that we don't consider it to be a bad thing that many of our functions are first iterations, which may still have their fair share of issues. We hope that these flaws will inspire others to come up with better ideas.

This way of working also means that we don't offer any production guarantees, and recommend to use Locutus inspiration and learning purposes only.

Notes

  • Long code cause we’re aiming for maximum PHP compatibility

Examples

Please note that these examples are distilled from test cases that automatically verify our functions still work correctly. This could explain some quirky ones.

#codeexpected result
1max(1, 3, 5, 6, 7)7
2max([2, 4, 5])5
3max(0, 'hello')0
4max('hello', 0)'hello'
5max(-1, 'hello')'hello'
6max([2, 4, 8], [2, 5, 7])[2, 5, 7]

« More PHP math functions