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
|
/*
Q Light Controller Plus
fillunfillsquaresfromcenter.js
Copyright (c) David Garyga
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0.txt
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
// Development tool access
var testAlgo;
(
function()
{
var algo = new Object;
algo.apiVersion = 1;
algo.name = "Fill Unfill Squares From Center";
algo.author = "David Garyga";
algo.rgbMap = function(width, height, rgb, step)
{
var widthCenter = Math.floor((parseInt(width) + 1) / 2) - 1;
var heightCenter = Math.floor((parseInt(height) + 1) / 2) - 1;
var isWidthEven = (width % 2 === 0);
var isHeightEven = (height % 2 === 0);
var centerStep = (widthCenter > heightCenter ? widthCenter : heightCenter) + 1;
var map = new Array(height);
for (var y = 0; y < height; y++)
{
map[y] = new Array();
for (var x = 0; x < width; x++)
{
if (step < centerStep)
{
if ((x <= widthCenter + step + (isWidthEven ? 1 : 0 ) && x >= widthCenter - step) &&
(y <= heightCenter + step + (isHeightEven ? 1 : 0) && y >= heightCenter - step)) {
map[y][x] = rgb;
} else {
map[y][x] = 0;
}
}
else
{
var step2 = step - centerStep;
if ((x <= widthCenter + step2 + (isWidthEven ? 1 : 0 ) && x >= widthCenter - step2) &&
(y <= heightCenter + step2 + (isHeightEven ? 1 : 0) && y >= heightCenter - step2)) {
map[y][x] = 0;
} else {
map[y][x] = rgb;
}
}
}
}
return map;
};
algo.rgbMapStepCount = function(width, height)
{
width = parseInt(width);
height = parseInt(height);
var max = width > height ? width : height;
return (Math.floor((max + 1) / 2)) * 2 - 1;
};
// Development tool access
testAlgo = algo;
return algo;
}
)();
|
