mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2024-11-06 00:49:35 +00:00
5e2bf0bdca
* [chore] Remove years from all license headers Years or year ranges aren't required in license headers. Many projects have removed them in recent years and it avoids a bit of yearly toil. In many cases our copyright claim was also a bit dodgy since we added the 2021-2023 header to files created after 2021 but you can't claim copyright into the past that way. * [chore] Add license header check This ensures a license header is always added to any new file. This avoids maintainers/reviewers needing to remember to check for and ask for it in case a contribution doesn't include it. * [chore] Add missing license headers * [chore] Further updates to license header * Use the more common // indentend comment format * Remove the hack we had for the linter now that we use the // format * Add SPDX license identifier
67 lines
1.9 KiB
Go
67 lines
1.9 KiB
Go
// GoToSocial
|
|
// Copyright (C) GoToSocial Authors admin@gotosocial.org
|
|
// SPDX-License-Identifier: AGPL-3.0-or-later
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Affero General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Affero General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Affero General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package timeline
|
|
|
|
import (
|
|
"container/list"
|
|
)
|
|
|
|
const (
|
|
defaultDesiredIndexedItemsLength = 400
|
|
defaultDesiredPreparedItemsLength = 50
|
|
)
|
|
|
|
func (t *timeline) Prune(desiredPreparedItemsLength int, desiredIndexedItemsLength int) int {
|
|
t.Lock()
|
|
defer t.Unlock()
|
|
|
|
pruneList := func(pruneTo int, listToPrune *list.List) int {
|
|
if listToPrune == nil {
|
|
// no need to prune
|
|
return 0
|
|
}
|
|
|
|
unprunedLength := listToPrune.Len()
|
|
if unprunedLength <= pruneTo {
|
|
// no need to prune
|
|
return 0
|
|
}
|
|
|
|
// work from the back + assemble a slice of entries that we will prune
|
|
amountStillToPrune := unprunedLength - pruneTo
|
|
itemsToPrune := make([]*list.Element, 0, amountStillToPrune)
|
|
for e := listToPrune.Back(); amountStillToPrune > 0; e = e.Prev() {
|
|
itemsToPrune = append(itemsToPrune, e)
|
|
amountStillToPrune--
|
|
}
|
|
|
|
// remove the entries we found
|
|
var totalPruned int
|
|
for _, e := range itemsToPrune {
|
|
listToPrune.Remove(e)
|
|
totalPruned++
|
|
}
|
|
|
|
return totalPruned
|
|
}
|
|
|
|
prunedPrepared := pruneList(desiredPreparedItemsLength, t.preparedItems.data)
|
|
prunedIndexed := pruneList(desiredIndexedItemsLength, t.indexedItems.data)
|
|
|
|
return prunedPrepared + prunedIndexed
|
|
}
|