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 ****************************************************************************/
41 function __isSelected( index ){
42 return __selectedIndexesHash[index]==true;
45 function __syncHash(){
46 var selectedIndexesHash = new Array()
47 var il = selectedIndexes.length;
48 for( var it = 0; it < il; ++it ){
49 selectedIndexesHash[selectedIndexes[it]]=true;
51 __selectedIndexesHash = selectedIndexesHash
54 function __toggleIndex( index ){
55 // A QML list can not be modified, so let's create a new array
56 var selectedArray = new Array;
58 var il = selectedIndexes.length;
60 // If selectedIndexes is empty then add the index and return.
62 selectedArray.push(index);
63 selectedIndexes = selectedArray;
67 // Check whether the list is sorted.
69 var previousIndex = -1;
71 for( var it = 0; it < il; ++it ){
72 if ( previousIndex > selectedIndexes[it] ){
76 previousIndex = selectedIndexes[it];
80 // For unsorted selectedIndexes just append the index if it's not present yet.
81 var indexAvailable = false;
82 for( var it = 0; it < il; ++it ) {
83 if ( index == selectedIndexes[it] ){
84 indexAvailable = true;
87 selectedArray.push(selectedIndexes[it]);
91 selectedArray.push(index);
96 // insert the index in a sorted way in between the existing indexes
97 for( var it = 0; it < il; ++it ) {
98 if ( previousIndex < index && index < selectedIndexes[it] ) {
99 selectedArray.push(index);
101 if ( index != selectedIndexes[it] ) {
102 selectedArray.push(selectedIndexes[it]);
105 previousIndex = selectedIndexes[it];
107 // If the index is the highest one append it
108 if (index > selectedIndexes[selectedIndexes.length - 1]){
109 selectedArray.push(index);
112 // Assign the new built array to selectedIndexes
113 selectedIndexes = selectedArray;