@@ -756,7 +756,6 @@ |
||
756 | 756 | $groups[$row['id_group']]['num_members'] += $row['num_members']; |
757 | 757 | $smcFunc['db_free_result']($query); |
758 | 758 | } |
759 | - |
|
760 | 759 | else |
761 | 760 | { |
762 | 761 | $query = $smcFunc['db_query']('', ' |
@@ -425,7 +425,8 @@ discard block |
||
425 | 425 | if (!empty($day['events'])) |
426 | 426 | { |
427 | 427 | // Sort events by start time (all day events will be listed first) |
428 | - uasort($day['events'], function($a, $b) { |
|
428 | + uasort($day['events'], function($a, $b) |
|
429 | + { |
|
429 | 430 | if ($a['start_timestamp'] == $b['start_timestamp']) |
430 | 431 | return 0; |
431 | 432 | |
@@ -619,7 +620,8 @@ discard block |
||
619 | 620 | if (!empty($day['events'])) |
620 | 621 | { |
621 | 622 | // Sort events by start time (all day events will be listed first) |
622 | - uasort($day['events'], function($a, $b) { |
|
623 | + uasort($day['events'], function($a, $b) |
|
624 | + { |
|
623 | 625 | if ($a['start_timestamp'] == $b['start_timestamp']) |
624 | 626 | return 0; |
625 | 627 | return ($a['start_timestamp'] < $b['start_timestamp']) ? -1 : 1; |
@@ -1,204 +1,204 @@ |
||
1 | 1 | <?php |
2 | 2 | |
3 | 3 | if (!is_callable('random_int')) { |
4 | - /** |
|
5 | - * Random_* Compatibility Library |
|
6 | - * for using the new PHP 7 random_* API in PHP 5 projects |
|
7 | - * |
|
8 | - * The MIT License (MIT) |
|
9 | - * |
|
10 | - * Copyright (c) 2015 - 2018 Paragon Initiative Enterprises |
|
11 | - * |
|
12 | - * Permission is hereby granted, free of charge, to any person obtaining a copy |
|
13 | - * of this software and associated documentation files (the "Software"), to deal |
|
14 | - * in the Software without restriction, including without limitation the rights |
|
15 | - * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
16 | - * copies of the Software, and to permit persons to whom the Software is |
|
17 | - * furnished to do so, subject to the following conditions: |
|
18 | - * |
|
19 | - * The above copyright notice and this permission notice shall be included in |
|
20 | - * all copies or substantial portions of the Software. |
|
21 | - * |
|
22 | - * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
23 | - * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
24 | - * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
25 | - * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
26 | - * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|
27 | - * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
|
28 | - * SOFTWARE. |
|
29 | - */ |
|
30 | - |
|
31 | - /** |
|
32 | - * Fetch a random integer between $min and $max inclusive |
|
33 | - * |
|
34 | - * @param int $min |
|
35 | - * @param int $max |
|
36 | - * |
|
37 | - * @throws Exception |
|
38 | - * |
|
39 | - * @return int |
|
40 | - */ |
|
41 | - function random_int($min, $max) |
|
42 | - { |
|
43 | - /** |
|
44 | - * Type and input logic checks |
|
45 | - * |
|
46 | - * If you pass it a float in the range (~PHP_INT_MAX, PHP_INT_MAX) |
|
47 | - * (non-inclusive), it will sanely cast it to an int. If you it's equal to |
|
48 | - * ~PHP_INT_MAX or PHP_INT_MAX, we let it fail as not an integer. Floats |
|
49 | - * lose precision, so the <= and => operators might accidentally let a float |
|
50 | - * through. |
|
51 | - */ |
|
52 | - |
|
53 | - try { |
|
54 | - /** @var int $min */ |
|
55 | - $min = RandomCompat_intval($min); |
|
56 | - } catch (TypeError $ex) { |
|
57 | - throw new TypeError( |
|
58 | - 'random_int(): $min must be an integer' |
|
59 | - ); |
|
60 | - } |
|
61 | - |
|
62 | - try { |
|
63 | - /** @var int $max */ |
|
64 | - $max = RandomCompat_intval($max); |
|
65 | - } catch (TypeError $ex) { |
|
66 | - throw new TypeError( |
|
67 | - 'random_int(): $max must be an integer' |
|
68 | - ); |
|
69 | - } |
|
70 | - |
|
71 | - /** |
|
72 | - * Now that we've verified our weak typing system has given us an integer, |
|
73 | - * let's validate the logic then we can move forward with generating random |
|
74 | - * integers along a given range. |
|
75 | - */ |
|
76 | - if ($min > $max) { |
|
77 | - throw new Error( |
|
78 | - 'Minimum value must be less than or equal to the maximum value' |
|
79 | - ); |
|
80 | - } |
|
81 | - |
|
82 | - if ($max === $min) { |
|
83 | - return (int) $min; |
|
84 | - } |
|
85 | - |
|
86 | - /** |
|
87 | - * Initialize variables to 0 |
|
88 | - * |
|
89 | - * We want to store: |
|
90 | - * $bytes => the number of random bytes we need |
|
91 | - * $mask => an integer bitmask (for use with the &) operator |
|
92 | - * so we can minimize the number of discards |
|
93 | - */ |
|
94 | - $attempts = $bits = $bytes = $mask = $valueShift = 0; |
|
95 | - /** @var int $attempts */ |
|
96 | - /** @var int $bits */ |
|
97 | - /** @var int $bytes */ |
|
98 | - /** @var int $mask */ |
|
99 | - /** @var int $valueShift */ |
|
100 | - |
|
101 | - /** |
|
102 | - * At this point, $range is a positive number greater than 0. It might |
|
103 | - * overflow, however, if $max - $min > PHP_INT_MAX. PHP will cast it to |
|
104 | - * a float and we will lose some precision. |
|
105 | - * |
|
106 | - * @var int|float $range |
|
107 | - */ |
|
108 | - $range = $max - $min; |
|
109 | - |
|
110 | - /** |
|
111 | - * Test for integer overflow: |
|
112 | - */ |
|
113 | - if (!is_int($range)) { |
|
114 | - |
|
115 | - /** |
|
116 | - * Still safely calculate wider ranges. |
|
117 | - * Provided by @CodesInChaos, @oittaa |
|
118 | - * |
|
119 | - * @ref https://gist.github.com/CodesInChaos/03f9ea0b58e8b2b8d435 |
|
120 | - * |
|
121 | - * We use ~0 as a mask in this case because it generates all 1s |
|
122 | - * |
|
123 | - * @ref https://eval.in/400356 (32-bit) |
|
124 | - * @ref http://3v4l.org/XX9r5 (64-bit) |
|
125 | - */ |
|
126 | - $bytes = PHP_INT_SIZE; |
|
127 | - /** @var int $mask */ |
|
128 | - $mask = ~0; |
|
129 | - |
|
130 | - } else { |
|
131 | - |
|
132 | - /** |
|
133 | - * $bits is effectively ceil(log($range, 2)) without dealing with |
|
134 | - * type juggling |
|
135 | - */ |
|
136 | - while ($range > 0) { |
|
137 | - if ($bits % 8 === 0) { |
|
138 | - ++$bytes; |
|
139 | - } |
|
140 | - ++$bits; |
|
141 | - $range >>= 1; |
|
142 | - /** @var int $mask */ |
|
143 | - $mask = $mask << 1 | 1; |
|
144 | - } |
|
145 | - $valueShift = $min; |
|
146 | - } |
|
147 | - |
|
148 | - /** @var int $val */ |
|
149 | - $val = 0; |
|
150 | - /** |
|
151 | - * Now that we have our parameters set up, let's begin generating |
|
152 | - * random integers until one falls between $min and $max |
|
153 | - */ |
|
154 | - /** @psalm-suppress RedundantCondition */ |
|
155 | - do { |
|
156 | - /** |
|
157 | - * The rejection probability is at most 0.5, so this corresponds |
|
158 | - * to a failure probability of 2^-128 for a working RNG |
|
159 | - */ |
|
160 | - if ($attempts > 128) { |
|
161 | - throw new Exception( |
|
162 | - 'random_int: RNG is broken - too many rejections' |
|
163 | - ); |
|
164 | - } |
|
165 | - |
|
166 | - /** |
|
167 | - * Let's grab the necessary number of random bytes |
|
168 | - */ |
|
169 | - $randomByteString = random_bytes($bytes); |
|
170 | - |
|
171 | - /** |
|
172 | - * Let's turn $randomByteString into an integer |
|
173 | - * |
|
174 | - * This uses bitwise operators (<< and |) to build an integer |
|
175 | - * out of the values extracted from ord() |
|
176 | - * |
|
177 | - * Example: [9F] | [6D] | [32] | [0C] => |
|
178 | - * 159 + 27904 + 3276800 + 201326592 => |
|
179 | - * 204631455 |
|
180 | - */ |
|
181 | - $val &= 0; |
|
182 | - for ($i = 0; $i < $bytes; ++$i) { |
|
183 | - $val |= ord($randomByteString[$i]) << ($i * 8); |
|
184 | - } |
|
185 | - /** @var int $val */ |
|
186 | - |
|
187 | - /** |
|
188 | - * Apply mask |
|
189 | - */ |
|
190 | - $val &= $mask; |
|
191 | - $val += $valueShift; |
|
192 | - |
|
193 | - ++$attempts; |
|
194 | - /** |
|
195 | - * If $val overflows to a floating point number, |
|
196 | - * ... or is larger than $max, |
|
197 | - * ... or smaller than $min, |
|
198 | - * then try again. |
|
199 | - */ |
|
200 | - } while (!is_int($val) || $val > $max || $val < $min); |
|
201 | - |
|
202 | - return (int) $val; |
|
203 | - } |
|
4 | + /** |
|
5 | + * Random_* Compatibility Library |
|
6 | + * for using the new PHP 7 random_* API in PHP 5 projects |
|
7 | + * |
|
8 | + * The MIT License (MIT) |
|
9 | + * |
|
10 | + * Copyright (c) 2015 - 2018 Paragon Initiative Enterprises |
|
11 | + * |
|
12 | + * Permission is hereby granted, free of charge, to any person obtaining a copy |
|
13 | + * of this software and associated documentation files (the "Software"), to deal |
|
14 | + * in the Software without restriction, including without limitation the rights |
|
15 | + * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
16 | + * copies of the Software, and to permit persons to whom the Software is |
|
17 | + * furnished to do so, subject to the following conditions: |
|
18 | + * |
|
19 | + * The above copyright notice and this permission notice shall be included in |
|
20 | + * all copies or substantial portions of the Software. |
|
21 | + * |
|
22 | + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
23 | + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
24 | + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
25 | + * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
26 | + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|
27 | + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
|
28 | + * SOFTWARE. |
|
29 | + */ |
|
30 | + |
|
31 | + /** |
|
32 | + * Fetch a random integer between $min and $max inclusive |
|
33 | + * |
|
34 | + * @param int $min |
|
35 | + * @param int $max |
|
36 | + * |
|
37 | + * @throws Exception |
|
38 | + * |
|
39 | + * @return int |
|
40 | + */ |
|
41 | + function random_int($min, $max) |
|
42 | + { |
|
43 | + /** |
|
44 | + * Type and input logic checks |
|
45 | + * |
|
46 | + * If you pass it a float in the range (~PHP_INT_MAX, PHP_INT_MAX) |
|
47 | + * (non-inclusive), it will sanely cast it to an int. If you it's equal to |
|
48 | + * ~PHP_INT_MAX or PHP_INT_MAX, we let it fail as not an integer. Floats |
|
49 | + * lose precision, so the <= and => operators might accidentally let a float |
|
50 | + * through. |
|
51 | + */ |
|
52 | + |
|
53 | + try { |
|
54 | + /** @var int $min */ |
|
55 | + $min = RandomCompat_intval($min); |
|
56 | + } catch (TypeError $ex) { |
|
57 | + throw new TypeError( |
|
58 | + 'random_int(): $min must be an integer' |
|
59 | + ); |
|
60 | + } |
|
61 | + |
|
62 | + try { |
|
63 | + /** @var int $max */ |
|
64 | + $max = RandomCompat_intval($max); |
|
65 | + } catch (TypeError $ex) { |
|
66 | + throw new TypeError( |
|
67 | + 'random_int(): $max must be an integer' |
|
68 | + ); |
|
69 | + } |
|
70 | + |
|
71 | + /** |
|
72 | + * Now that we've verified our weak typing system has given us an integer, |
|
73 | + * let's validate the logic then we can move forward with generating random |
|
74 | + * integers along a given range. |
|
75 | + */ |
|
76 | + if ($min > $max) { |
|
77 | + throw new Error( |
|
78 | + 'Minimum value must be less than or equal to the maximum value' |
|
79 | + ); |
|
80 | + } |
|
81 | + |
|
82 | + if ($max === $min) { |
|
83 | + return (int) $min; |
|
84 | + } |
|
85 | + |
|
86 | + /** |
|
87 | + * Initialize variables to 0 |
|
88 | + * |
|
89 | + * We want to store: |
|
90 | + * $bytes => the number of random bytes we need |
|
91 | + * $mask => an integer bitmask (for use with the &) operator |
|
92 | + * so we can minimize the number of discards |
|
93 | + */ |
|
94 | + $attempts = $bits = $bytes = $mask = $valueShift = 0; |
|
95 | + /** @var int $attempts */ |
|
96 | + /** @var int $bits */ |
|
97 | + /** @var int $bytes */ |
|
98 | + /** @var int $mask */ |
|
99 | + /** @var int $valueShift */ |
|
100 | + |
|
101 | + /** |
|
102 | + * At this point, $range is a positive number greater than 0. It might |
|
103 | + * overflow, however, if $max - $min > PHP_INT_MAX. PHP will cast it to |
|
104 | + * a float and we will lose some precision. |
|
105 | + * |
|
106 | + * @var int|float $range |
|
107 | + */ |
|
108 | + $range = $max - $min; |
|
109 | + |
|
110 | + /** |
|
111 | + * Test for integer overflow: |
|
112 | + */ |
|
113 | + if (!is_int($range)) { |
|
114 | + |
|
115 | + /** |
|
116 | + * Still safely calculate wider ranges. |
|
117 | + * Provided by @CodesInChaos, @oittaa |
|
118 | + * |
|
119 | + * @ref https://gist.github.com/CodesInChaos/03f9ea0b58e8b2b8d435 |
|
120 | + * |
|
121 | + * We use ~0 as a mask in this case because it generates all 1s |
|
122 | + * |
|
123 | + * @ref https://eval.in/400356 (32-bit) |
|
124 | + * @ref http://3v4l.org/XX9r5 (64-bit) |
|
125 | + */ |
|
126 | + $bytes = PHP_INT_SIZE; |
|
127 | + /** @var int $mask */ |
|
128 | + $mask = ~0; |
|
129 | + |
|
130 | + } else { |
|
131 | + |
|
132 | + /** |
|
133 | + * $bits is effectively ceil(log($range, 2)) without dealing with |
|
134 | + * type juggling |
|
135 | + */ |
|
136 | + while ($range > 0) { |
|
137 | + if ($bits % 8 === 0) { |
|
138 | + ++$bytes; |
|
139 | + } |
|
140 | + ++$bits; |
|
141 | + $range >>= 1; |
|
142 | + /** @var int $mask */ |
|
143 | + $mask = $mask << 1 | 1; |
|
144 | + } |
|
145 | + $valueShift = $min; |
|
146 | + } |
|
147 | + |
|
148 | + /** @var int $val */ |
|
149 | + $val = 0; |
|
150 | + /** |
|
151 | + * Now that we have our parameters set up, let's begin generating |
|
152 | + * random integers until one falls between $min and $max |
|
153 | + */ |
|
154 | + /** @psalm-suppress RedundantCondition */ |
|
155 | + do { |
|
156 | + /** |
|
157 | + * The rejection probability is at most 0.5, so this corresponds |
|
158 | + * to a failure probability of 2^-128 for a working RNG |
|
159 | + */ |
|
160 | + if ($attempts > 128) { |
|
161 | + throw new Exception( |
|
162 | + 'random_int: RNG is broken - too many rejections' |
|
163 | + ); |
|
164 | + } |
|
165 | + |
|
166 | + /** |
|
167 | + * Let's grab the necessary number of random bytes |
|
168 | + */ |
|
169 | + $randomByteString = random_bytes($bytes); |
|
170 | + |
|
171 | + /** |
|
172 | + * Let's turn $randomByteString into an integer |
|
173 | + * |
|
174 | + * This uses bitwise operators (<< and |) to build an integer |
|
175 | + * out of the values extracted from ord() |
|
176 | + * |
|
177 | + * Example: [9F] | [6D] | [32] | [0C] => |
|
178 | + * 159 + 27904 + 3276800 + 201326592 => |
|
179 | + * 204631455 |
|
180 | + */ |
|
181 | + $val &= 0; |
|
182 | + for ($i = 0; $i < $bytes; ++$i) { |
|
183 | + $val |= ord($randomByteString[$i]) << ($i * 8); |
|
184 | + } |
|
185 | + /** @var int $val */ |
|
186 | + |
|
187 | + /** |
|
188 | + * Apply mask |
|
189 | + */ |
|
190 | + $val &= $mask; |
|
191 | + $val += $valueShift; |
|
192 | + |
|
193 | + ++$attempts; |
|
194 | + /** |
|
195 | + * If $val overflows to a floating point number, |
|
196 | + * ... or is larger than $max, |
|
197 | + * ... or smaller than $min, |
|
198 | + * then try again. |
|
199 | + */ |
|
200 | + } while (!is_int($val) || $val > $max || $val < $min); |
|
201 | + |
|
202 | + return (int) $val; |
|
203 | + } |
|
204 | 204 | } |
@@ -1,6 +1,7 @@ discard block |
||
1 | 1 | <?php |
2 | 2 | |
3 | -if (!is_callable('random_int')) { |
|
3 | +if (!is_callable('random_int')) |
|
4 | +{ |
|
4 | 5 | /** |
5 | 6 | * Random_* Compatibility Library |
6 | 7 | * for using the new PHP 7 random_* API in PHP 5 projects |
@@ -50,19 +51,25 @@ discard block |
||
50 | 51 | * through. |
51 | 52 | */ |
52 | 53 | |
53 | - try { |
|
54 | + try |
|
55 | + { |
|
54 | 56 | /** @var int $min */ |
55 | 57 | $min = RandomCompat_intval($min); |
56 | - } catch (TypeError $ex) { |
|
58 | + } |
|
59 | + catch (TypeError $ex) |
|
60 | + { |
|
57 | 61 | throw new TypeError( |
58 | 62 | 'random_int(): $min must be an integer' |
59 | 63 | ); |
60 | 64 | } |
61 | 65 | |
62 | - try { |
|
66 | + try |
|
67 | + { |
|
63 | 68 | /** @var int $max */ |
64 | 69 | $max = RandomCompat_intval($max); |
65 | - } catch (TypeError $ex) { |
|
70 | + } |
|
71 | + catch (TypeError $ex) |
|
72 | + { |
|
66 | 73 | throw new TypeError( |
67 | 74 | 'random_int(): $max must be an integer' |
68 | 75 | ); |
@@ -73,13 +80,15 @@ discard block |
||
73 | 80 | * let's validate the logic then we can move forward with generating random |
74 | 81 | * integers along a given range. |
75 | 82 | */ |
76 | - if ($min > $max) { |
|
83 | + if ($min > $max) |
|
84 | + { |
|
77 | 85 | throw new Error( |
78 | 86 | 'Minimum value must be less than or equal to the maximum value' |
79 | 87 | ); |
80 | 88 | } |
81 | 89 | |
82 | - if ($max === $min) { |
|
90 | + if ($max === $min) |
|
91 | + { |
|
83 | 92 | return (int) $min; |
84 | 93 | } |
85 | 94 | |
@@ -110,7 +119,8 @@ discard block |
||
110 | 119 | /** |
111 | 120 | * Test for integer overflow: |
112 | 121 | */ |
113 | - if (!is_int($range)) { |
|
122 | + if (!is_int($range)) |
|
123 | + { |
|
114 | 124 | |
115 | 125 | /** |
116 | 126 | * Still safely calculate wider ranges. |
@@ -127,14 +137,18 @@ discard block |
||
127 | 137 | /** @var int $mask */ |
128 | 138 | $mask = ~0; |
129 | 139 | |
130 | - } else { |
|
140 | + } |
|
141 | + else |
|
142 | + { |
|
131 | 143 | |
132 | 144 | /** |
133 | 145 | * $bits is effectively ceil(log($range, 2)) without dealing with |
134 | 146 | * type juggling |
135 | 147 | */ |
136 | - while ($range > 0) { |
|
137 | - if ($bits % 8 === 0) { |
|
148 | + while ($range > 0) |
|
149 | + { |
|
150 | + if ($bits % 8 === 0) |
|
151 | + { |
|
138 | 152 | ++$bytes; |
139 | 153 | } |
140 | 154 | ++$bits; |
@@ -157,7 +171,8 @@ discard block |
||
157 | 171 | * The rejection probability is at most 0.5, so this corresponds |
158 | 172 | * to a failure probability of 2^-128 for a working RNG |
159 | 173 | */ |
160 | - if ($attempts > 128) { |
|
174 | + if ($attempts > 128) |
|
175 | + { |
|
161 | 176 | throw new Exception( |
162 | 177 | 'random_int: RNG is broken - too many rejections' |
163 | 178 | ); |
@@ -179,7 +194,8 @@ discard block |
||
179 | 194 | * 204631455 |
180 | 195 | */ |
181 | 196 | $val &= 0; |
182 | - for ($i = 0; $i < $bytes; ++$i) { |
|
197 | + for ($i = 0; $i < $bytes; ++$i) |
|
198 | + { |
|
183 | 199 | $val |= ord($randomByteString[$i]) << ($i * 8); |
184 | 200 | } |
185 | 201 | /** @var int $val */ |
@@ -19,7 +19,7 @@ discard block |
||
19 | 19 | { |
20 | 20 | /** |
21 | 21 | * Constants for reply types. |
22 | - */ |
|
22 | + */ |
|
23 | 23 | const NOTIFY_TYPE_REPLY_AND_MODIFY = 1; |
24 | 24 | const NOTIFY_TYPE_REPLY_AND_TOPIC_START_FOLLOWING = 2; |
25 | 25 | const NOTIFY_TYPE_ONLY_REPLIES = 3; |
@@ -27,7 +27,7 @@ discard block |
||
27 | 27 | |
28 | 28 | /** |
29 | 29 | * Constants for frequencies. |
30 | - */ |
|
30 | + */ |
|
31 | 31 | const FREQUENCY_NOTHING = 0; |
32 | 32 | const FREQUENCY_EVERYTHING = 1; |
33 | 33 | const FREQUENCY_FIRST_UNREAD_MSG = 2; |
@@ -35,7 +35,7 @@ discard block |
||
35 | 35 | const FREQUENCY_WEEKLY_DIGEST = 4; |
36 | 36 | |
37 | 37 | /** |
38 | - * This handles notifications when a new post is created - new topic, reply, quotes and mentions. |
|
38 | + * This handles notifications when a new post is created - new topic, reply, quotes and mentions. |
|
39 | 39 | * @return bool Always returns true |
40 | 40 | */ |
41 | 41 | public function execute() |
@@ -281,7 +281,7 @@ |
||
281 | 281 | { |
282 | 282 | /** |
283 | 283 | * Constants for notfication types. |
284 | - */ |
|
284 | + */ |
|
285 | 285 | const RECEIVE_NOTIFY_EMAIL = 0x02; |
286 | 286 | const RECEIVE_NOTIFY_ALERT = 0x01; |
287 | 287 |
@@ -419,7 +419,7 @@ |
||
419 | 419 | $board['last_post']['last_post_message'] = sprintf($txt['last_post_message'], $board['last_post']['member']['link'], $board['last_post']['link'], $board['last_post']['time'] > 0 ? timeformat($board['last_post']['time']) : $txt['not_applicable']); |
420 | 420 | } |
421 | 421 | } |
422 | - else |
|
422 | + else |
|
423 | 423 | foreach ($this_category as &$board) |
424 | 424 | { |
425 | 425 | if (!empty($moderators[$board['id']])) |
@@ -332,7 +332,6 @@ discard block |
||
332 | 332 | $replacement .= $precedingStyle . $extra_attr . $afterStyle; |
333 | 333 | } |
334 | 334 | } |
335 | - |
|
336 | 335 | elseif (preg_match('~</([A-Za-z]+)>~', $part, $matches) === 1) |
337 | 336 | { |
338 | 337 | // Is this the element that we've been waiting for to be closed? |
@@ -592,7 +591,6 @@ discard block |
||
592 | 591 | $parts[$i + 2] = str_repeat("\t", $listDepth) . '[/list]'; |
593 | 592 | $parts[$i + 3] = ''; |
594 | 593 | } |
595 | - |
|
596 | 594 | else |
597 | 595 | { |
598 | 596 | // We're in a list item. |
@@ -631,7 +629,6 @@ discard block |
||
631 | 629 | $parts[$i + 2] = ''; |
632 | 630 | $parts[$i + 3] = ''; |
633 | 631 | } |
634 | - |
|
635 | 632 | else |
636 | 633 | { |
637 | 634 | // Remove the trailing breaks from the list item. |
@@ -2936,7 +2936,7 @@ |
||
2936 | 2936 | } |
2937 | 2937 | |
2938 | 2938 | // Set proper extensions; do this post caching so cache doesn't become extension-specific |
2939 | - foreach ($smileysto AS $ix => $file) |
|
2939 | + foreach ($smileysto as $ix => $file) |
|
2940 | 2940 | // Need to use the default if user selection is disabled |
2941 | 2941 | if (empty($modSettings['smiley_sets_enable'])) |
2942 | 2942 | $smileysto[$ix] = $file . $context['user']['smiley_set_default_ext']; |
@@ -302,7 +302,6 @@ discard block |
||
302 | 302 | $condition = 'id_member IN ({array_int:members})'; |
303 | 303 | $parameters['members'] = $members; |
304 | 304 | } |
305 | - |
|
306 | 305 | elseif ($members === null) |
307 | 306 | $condition = '1=1'; |
308 | 307 | |
@@ -3764,7 +3763,6 @@ discard block |
||
3764 | 3763 | if (!isset($minSeed) && isset($js_file['options']['seed'])) |
3765 | 3764 | $minSeed = $js_file['options']['seed']; |
3766 | 3765 | } |
3767 | - |
|
3768 | 3766 | else |
3769 | 3767 | echo ' |
3770 | 3768 | <script src="', $js_file['fileUrl'], '"', !empty($js_file['options']['async']) ? ' async' : '', !empty($js_file['options']['defer']) ? ' defer' : '', '></script>'; |
@@ -5917,7 +5915,6 @@ discard block |
||
5917 | 5915 | $isWritable = true; |
5918 | 5916 | break; |
5919 | 5917 | } |
5920 | - |
|
5921 | 5918 | else |
5922 | 5919 | @chmod($file, $val); |
5923 | 5920 | } |
@@ -391,7 +391,7 @@ discard block |
||
391 | 391 | { |
392 | 392 | $val = 'CASE '; |
393 | 393 | foreach ($members as $k => $v) |
394 | - $val .= 'WHEN id_member = ' . $v . ' THEN '. alert_count($v, false) . ' '; |
|
394 | + $val .= 'WHEN id_member = ' . $v . ' THEN ' . alert_count($v, false) . ' '; |
|
395 | 395 | $val = $val . ' END'; |
396 | 396 | $type = 'raw'; |
397 | 397 | } |
@@ -5284,15 +5284,15 @@ discard block |
||
5284 | 5284 | |
5285 | 5285 | // UTF-8 occurences of MS special characters |
5286 | 5286 | $findchars_utf8 = array( |
5287 | - "\xe2\x80\x9a", // single low-9 quotation mark |
|
5288 | - "\xe2\x80\x9e", // double low-9 quotation mark |
|
5289 | - "\xe2\x80\xa6", // horizontal ellipsis |
|
5290 | - "\xe2\x80\x98", // left single curly quote |
|
5291 | - "\xe2\x80\x99", // right single curly quote |
|
5292 | - "\xe2\x80\x9c", // left double curly quote |
|
5293 | - "\xe2\x80\x9d", // right double curly quote |
|
5294 | - "\xe2\x80\x93", // en dash |
|
5295 | - "\xe2\x80\x94", // em dash |
|
5287 | + "\xe2\x80\x9a", // single low-9 quotation mark |
|
5288 | + "\xe2\x80\x9e", // double low-9 quotation mark |
|
5289 | + "\xe2\x80\xa6", // horizontal ellipsis |
|
5290 | + "\xe2\x80\x98", // left single curly quote |
|
5291 | + "\xe2\x80\x99", // right single curly quote |
|
5292 | + "\xe2\x80\x9c", // left double curly quote |
|
5293 | + "\xe2\x80\x9d", // right double curly quote |
|
5294 | + "\xe2\x80\x93", // en dash |
|
5295 | + "\xe2\x80\x94", // em dash |
|
5296 | 5296 | ); |
5297 | 5297 | |
5298 | 5298 | // windows 1252 / iso equivalents |
@@ -5310,15 +5310,15 @@ discard block |
||
5310 | 5310 | |
5311 | 5311 | // safe replacements |
5312 | 5312 | $replacechars = array( |
5313 | - ',', // ‚ |
|
5314 | - ',,', // „ |
|
5315 | - '...', // … |
|
5316 | - "'", // ‘ |
|
5317 | - "'", // ’ |
|
5318 | - '"', // “ |
|
5319 | - '"', // ” |
|
5320 | - '-', // – |
|
5321 | - '--', // — |
|
5313 | + ',', // ‚ |
|
5314 | + ',,', // „ |
|
5315 | + '...', // … |
|
5316 | + "'", // ‘ |
|
5317 | + "'", // ’ |
|
5318 | + '"', // “ |
|
5319 | + '"', // ” |
|
5320 | + '-', // – |
|
5321 | + '--', // — |
|
5322 | 5322 | ); |
5323 | 5323 | |
5324 | 5324 | if ($context['utf8']) |
@@ -6473,10 +6473,10 @@ discard block |
||
6473 | 6473 | $query_part['query_see_board'] = '1=1'; |
6474 | 6474 | // Otherwise just the groups in $user_info['groups']. |
6475 | 6475 | else |
6476 | - $query_part['query_see_board'] = 'EXISTS (SELECT bpv.id_board FROM ' . $db_prefix . 'board_permissions_view bpv WHERE (bpv.id_group IN ( '. implode(',', $groups) .') AND bpv.deny = 0) |
|
6476 | + $query_part['query_see_board'] = 'EXISTS (SELECT bpv.id_board FROM ' . $db_prefix . 'board_permissions_view bpv WHERE (bpv.id_group IN ( ' . implode(',', $groups) . ') AND bpv.deny = 0) |
|
6477 | 6477 | AND bpv.id_board = b.id_board)' . |
6478 | - ( !empty($deny_boards_access) ? ' |
|
6479 | - AND NOT EXISTS (SELECT bpv.id_board FROM ' . $db_prefix . 'board_permissions_view bpv WHERE (bpv.id_group IN ( '. implode(',', $groups) .') and bpv.deny = 1 |
|
6478 | + (!empty($deny_boards_access) ? ' |
|
6479 | + AND NOT EXISTS (SELECT bpv.id_board FROM ' . $db_prefix . 'board_permissions_view bpv WHERE (bpv.id_group IN ( ' . implode(',', $groups) . ') and bpv.deny = 1 |
|
6480 | 6480 | AND bpv.id_board = b.id_board))' : ''); |
6481 | 6481 | |
6482 | 6482 | |
@@ -6734,8 +6734,8 @@ discard block |
||
6734 | 6734 | $i = 0; |
6735 | 6735 | while (empty($done)) |
6736 | 6736 | { |
6737 | - if (strpos($format, '{'. --$i . '}') !== false) |
|
6738 | - $replacements['{'. $i . '}'] = array_pop($list); |
|
6737 | + if (strpos($format, '{' . --$i . '}') !== false) |
|
6738 | + $replacements['{' . $i . '}'] = array_pop($list); |
|
6739 | 6739 | else |
6740 | 6740 | $done = true; |
6741 | 6741 | } |
@@ -6745,8 +6745,8 @@ discard block |
||
6745 | 6745 | $i = 0; |
6746 | 6746 | while (empty($done)) |
6747 | 6747 | { |
6748 | - if (strpos($format, '{'. ++$i . '}') !== false) |
|
6749 | - $replacements['{'. $i . '}'] = array_shift($list); |
|
6748 | + if (strpos($format, '{' . ++$i . '}') !== false) |
|
6749 | + $replacements['{' . $i . '}'] = array_shift($list); |
|
6750 | 6750 | else |
6751 | 6751 | $done = true; |
6752 | 6752 | } |
@@ -116,7 +116,8 @@ discard block |
||
116 | 116 | if (!$previewing && strpos($message, '[html]') !== false) |
117 | 117 | { |
118 | 118 | if (allowedTo('admin_forum')) |
119 | - $message = preg_replace_callback('~\[html\](.+?)\[/html\]~is', function($m) { |
|
119 | + $message = preg_replace_callback('~\[html\](.+?)\[/html\]~is', function($m) |
|
120 | + { |
|
120 | 121 | return '[html]' . strtr(un_htmlspecialchars($m[1]), array("\n" => ' ', ' ' => '  ', '[' => '[', ']' => ']')) . '[/html]'; |
121 | 122 | }, $message); |
122 | 123 | |
@@ -1242,7 +1243,6 @@ discard block |
||
1242 | 1243 | |
1243 | 1244 | return array($charset, $string, 'base64'); |
1244 | 1245 | } |
1245 | - |
|
1246 | 1246 | else |
1247 | 1247 | return array($charset, $string, '7bit'); |
1248 | 1248 | } |