1 /****************************************************************************
3 ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
4 ** All rights reserved.
5 ** Contact: Nokia Corporation (qt-info@nokia.com)
7 ** This file is part of the Qt Components project.
9 ** $QT_BEGIN_LICENSE:BSD$
10 ** You may use this file under the terms of the BSD license as follows:
12 ** "Redistribution and use in source and binary forms, with or without
13 ** modification, are permitted provided that the following conditions are
15 ** * Redistributions of source code must retain the above copyright
16 ** notice, this list of conditions and the following disclaimer.
17 ** * Redistributions in binary form must reproduce the above copyright
18 ** notice, this list of conditions and the following disclaimer in
19 ** the documentation and/or other materials provided with the
21 ** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
22 ** the names of its contributors may be used to endorse or promote
23 ** products derived from this software without specific prior written
26 ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
27 ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
28 ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
29 ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
30 ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
31 ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
32 ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33 ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
34 ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
35 ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
36 ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
39 ****************************************************************************/
44 function initialize(list) {
45 initSectionData(list);
48 function initSectionData(list) {
49 if (!list || !list.model) return;
53 prop = list.section.property,
56 for (var i = 0, count = list.model.count; i < count; i++) {
57 item = list.model.get(i);
58 if (item[prop] !== current) {
60 _sections.push(current);
61 sectionData.push({ index: i, header: current });
66 function getSectionPositionString(name) {
67 var val = _sections.indexOf(name);
68 return val === 0 ? "first" :
69 val === _sections.length - 1 ? "last" : false;
73 return _sections[pos] ? _sections[pos] : "";
76 function getRelativeSections(current) {
77 var val = _sections.indexOf(current),
79 sl = _sections.length;
81 val = val < 1 ? 1 : val >= sl-1 ? sl-2 : val;
82 sect = [getAt(val - 1), getAt(val), getAt(val + 1)];
87 function getClosestSection(pos, down) {
88 var tmp = (_sections.length) * pos;
89 var val = Math.ceil(tmp) // TODO: better algorithm
90 val = val < 2 ? 1 : val;
91 return _sections[val-1];
94 function getNextSection(current) {
95 var val = _sections.indexOf(current);
96 return (val > -1 ? _sections[(val < _sections.length - 1 ? val + 1 : val)] : _sections[0]) || "";
99 function getPreviousSection(current) {
100 var val = _sections.indexOf(current);
101 return (val > -1 ? _sections[(val > 0 ? val - 1 : val)] : _sections[0]) || "";
104 function getIndexFor(sectionName) {
105 var val = sectionData[_sections.indexOf(sectionName)].index;
106 return val === 0 || val > 0 ? val : -1;