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 var allContainers = []
44 function hasContainer(content) {
45 for (var i = 0; i < allContainers.length; ++i) {
46 if (allContainers[i].children[0] == content)
52 function addContent(content) {
53 for (var i = 0; i < allContents.length; ++i) {
54 if (allContents[i] == content)
57 allContents.push(content)
61 function ensureContainers() {
62 var somethingChanged = false
64 // check if we need to create a container
65 for (var i = 0; i < root.privateContents.length; ++i) {
66 var content = root.privateContents[i]
68 if (!hasContainer(content)) {
69 var newContainer = tabContainerComponent.createObject(containerHost)
70 content.parent = newContainer
71 allContainers.push(newContainer)
72 somethingChanged = true
75 return somethingChanged
78 function addTab(content) {
79 if (addContent(content)) {
80 var newContainer = tabContainerComponent.createObject(containerHost)
81 content.parent = newContainer
82 allContainers.push(newContainer)
86 function removeTab(content) {
88 for (var i = 0; i < allContents.length && foundIndex == -1; ++i) {
89 if (allContents[i] == content)
94 allContents.splice(foundIndex, 1)
96 if (hasContainer(content))
97 content.parent = null // this causes deletion of container
100 function removeContainer(container) {
102 for (var i = 0; i < allContainers.length && foundIndex == -1; ++i) {
103 if (allContainers[i] == container)
107 if (foundIndex != -1) {
108 var deletedContainer = allContainers[foundIndex]
109 if (deletedContainer.children.length > 0)
110 removeTab(deletedContainer.children[0])
111 allContainers.splice(foundIndex, 1)
112 deletedContainer.destroy()