Talk:Sparkline in unicode: Difference between revisions
Content added Content deleted
| Line 107: | Line 107: | ||
That's fine until we kid ourselves that our lowest data point can be the lower boundary of the lowest bin, while the upper data point is '''also''' the upper boundary of the highest bin. |
That's fine until we kid ourselves that our lowest data point can be the lower boundary of the lowest bin, while the upper data point is '''also''' the upper boundary of the highest bin. |
||
A sparkline that has these properties and also contains all the points is a contradiction in terms. Either our lowest data point is '''not in the diagram''' (it falls '''below''' the lowest bin, by one of the possible two rules) '''or''' our highest data point is '''not in the diagram''' (it falls '''above''' the highest bin, by the other of two possible rules). |
A sparkline that has these properties and also contains all the points is a contradiction in terms. Either our '''lowest''' data point is '''not in the diagram''' (it falls '''below''' the lowest bin, by one of the possible two rules) '''or''' our '''highest''' data point is '''not in the diagram''' (it falls '''above''' the highest bin, by the other of two possible rules). |
||
The range of the diagram can be close to that of the data, but it '''can't''' be co-extensive. It '''has''' to be bigger if it is not going to exclude a minimum or maximum data point. |
The range of the diagram can be close to that of the data, but it '''can't''' be co-extensive. It '''has''' to be bigger if it is not going to exclude a minimum or maximum data point. |
||