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
68
69
70
71
72
73
74
75
76
77
78
79
|
// Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/views/view_model_utils.h"
#include <algorithm>
#include <iterator>
#include "ui/views/view.h"
#include "ui/views/view_model.h"
namespace views {
namespace {
// Used in calculating ideal bounds.
int primary_axis_coordinate(bool is_horizontal, const gfx::Point& point) {
return is_horizontal ? point.x() : point.y();
}
} // namespace
// static
void ViewModelUtils::SetViewBoundsToIdealBounds(const ViewModelBase& model) {
for (auto& entry : model.entries()) {
entry.view->SetBoundsRect(entry.ideal_bounds);
}
}
// static
bool ViewModelUtils::IsAtIdealBounds(const ViewModelBase& model) {
return std::ranges::all_of(
model.entries(), [](const ViewModelBase::Entry& entry) {
return entry.view->bounds() == entry.ideal_bounds;
});
}
// static
size_t ViewModelUtils::DetermineMoveIndex(const ViewModelBase& model,
View* view,
bool is_horizontal,
int x,
int y) {
const auto& entries = model.entries();
const int value = primary_axis_coordinate(is_horizontal, gfx::Point(x, y));
DCHECK(model.GetIndexOfView(view).has_value());
auto iter = entries.begin();
for (; iter->view != view; ++iter) {
const int mid_point = primary_axis_coordinate(
is_horizontal, iter->ideal_bounds.CenterPoint());
if (value < mid_point) {
return static_cast<size_t>(std::distance(entries.begin(), iter));
}
}
if (std::next(iter) == entries.end()) {
return static_cast<size_t>(std::distance(entries.begin(), iter));
}
// For indices after the current index ignore the bounds of the view being
// dragged. This keeps the view from bouncing around as moved.
const int delta = primary_axis_coordinate(
is_horizontal, std::next(iter)->ideal_bounds.origin() -
iter->ideal_bounds.origin().OffsetFromOrigin());
for (++iter; iter != entries.end(); ++iter) {
const int mid_point = primary_axis_coordinate(
is_horizontal, iter->ideal_bounds.CenterPoint()) -
delta;
if (value < mid_point) {
return static_cast<size_t>(std::distance(entries.begin(), iter)) - 1;
}
}
return entries.size() - 1;
}
} // namespace views
|
