blob: 1ba11efc49a288c6baf944087c8a960d0e7bb770 (
plain)
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
|
/*
* Copyright (C) 2020 The Android Open Source Project
*
* 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
*
* 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.
*/
package com.android.systemui.qs
import android.content.Context
import android.util.AttributeSet
import com.android.systemui.R
open class SideLabelTileLayout(
context: Context,
attrs: AttributeSet?
) : TileLayout(context, attrs) {
override fun updateResources(): Boolean {
return super.updateResources().also {
mMaxAllowedRows = context.resources.getInteger(R.integer.quick_settings_max_rows)
}
}
override fun isFull(): Boolean {
return mRecords.size >= maxTiles()
}
override fun useSidePadding(): Boolean {
return false
}
/**
* Return the position from the top of the layout of the tile with this index.
*
* This will return a position even for indices that go beyond [maxTiles], continuing the rows
* beyond that.
*/
fun getPhantomTopPosition(index: Int): Int {
val row = index / mColumns
return getRowTop(row)
}
override fun updateMaxRows(allowedHeight: Int, tilesCount: Int): Boolean {
val previousRows = mRows
mRows = mMaxAllowedRows
// We want at most mMaxAllowedRows, but it could be that we don't have enough tiles to fit
// that many rows. In that case, we want
// `tilesCount = (mRows - 1) * mColumns + X`
// where X is some remainder between 1 and `mColumns - 1`
// Adding `mColumns - 1` will guarantee that the final value F will satisfy
// `mRows * mColumns <= F < (mRows + 1) * mColumns
if (mRows > (tilesCount + mColumns - 1) / mColumns) {
mRows = (tilesCount + mColumns - 1) / mColumns
}
return previousRows != mRows
}
}
|
