/dports/www/chromium-legacy/chromium-88.0.4324.182/extensions/browser/ |
H A D | extension_icon_image_unittest.cc | 40 if (original.width() == size && original.height() == size) in EnsureBitmapSize() 44 original, skia::ImageOperations::RESIZE_LANCZOS3, size, size); in EnsureBitmapSize() 166 ASSERT_EQ(0u, image_reps.size()); in TEST_F() 179 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 196 ASSERT_EQ(2u, image.image_skia().image_reps().size()); in TEST_F() 236 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 274 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 315 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 353 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 398 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/extensions/browser/ |
H A D | extension_icon_image_unittest.cc | 40 if (original.width() == size && original.height() == size) in EnsureBitmapSize() 44 original, skia::ImageOperations::RESIZE_LANCZOS3, size, size); in EnsureBitmapSize() 166 ASSERT_EQ(0u, image_reps.size()); in TEST_F() 179 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 196 ASSERT_EQ(2u, image.image_skia().image_reps().size()); in TEST_F() 236 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 274 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 315 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 353 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() 398 ASSERT_EQ(1u, image.image_skia().image_reps().size()); in TEST_F() [all …]
|
/dports/benchmarks/vkmark/vkmark-2017.08-24-g53abc4f/src/ |
H A D | device_uuid.cpp | 25 std::array<char, 2 * VK_UUID_SIZE> representation{}; in decode_UUID() local 29 for (std::size_t i = 0; i < bytes.size(); ++i) in decode_UUID() 33 representation[2 * i] = characters[byte / 16]; in decode_UUID() 34 representation[2 * i + 1] = characters[byte % 16]; in decode_UUID() 37 return representation; in decode_UUID() 53 for (std::size_t i = 0; i < bytes.size(); ++i) in encode_UUID() 55 bytes[i] = decode_character(representation[2 * i]) * 16 in encode_UUID() 56 + decode_character(representation[2 * i + 1]); in encode_UUID() 62 DeviceUUID::DeviceUUID(std::string const& representation) in DeviceUUID() argument 65 if (representation.size() != chars.size()) in DeviceUUID() [all …]
|
/dports/math/eigen3/eigen-3.3.9/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/math/R-cran-RcppEigen/RcppEigen/inst/include/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/devel/upp/upp/uppsrc/plugin/Eigen/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/misc/opennn/opennn-5.0.5/eigen/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/eigen/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/eigen_3.3.3/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/eigen3/include/eigen3/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
H A D | DynamicSymmetry.h | 37 for (std::size_t i = 0; i < size(); i++) in apply() 52 inline std::size_t size() const { return m_elements.size(); } in size() function 72 for (std::size_t i = 0; i < representation.size(); i++) in isId() 100 result.reserve(idx.size()); in h_permute() 143 if (ee.representation == e.representation) in findElement() 181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul() 182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul() 187 int v = g2.representation[g1.representation[i]]; in mul() 215 if (m_elements.size() == 1) { in add() 225 if (m_elements.size() > 1) in add() [all …]
|
/dports/x11-toolkits/ctk/CTK-2018-10-29/Libs/Widgets/Testing/Cpp/ |
H A D | ctkTransferFunctionRepresentationTest1.cpp | 51 if(representation.transferFunction() != 0) in ctkTransferFunctionRepresentationTest1() 93 if (representation.posX(&cp) != cp.x()) in ctkTransferFunctionRepresentationTest1() 97 << representation.posX(&cp); in ctkTransferFunctionRepresentationTest1() 134 << representation.posY(&cp); in ctkTransferFunctionRepresentationTest1() 165 if (representation.color(&cp) != representation.color(cp.value())) in ctkTransferFunctionRepresentationTest1() 171 if (representation.color(point) != representation.color(point.Value)) in ctkTransferFunctionRepresentationTest1() 251 if(representation.points().size() != 0) in ctkTransferFunctionRepresentationTest1() 263 if(representation.bezierParams(&startPoint,&endPoint).size() != 4) in ctkTransferFunctionRepresentationTest1() 273 if(representation.nonLinearPoints(&startPoint,&endPoint).size() != 2) in ctkTransferFunctionRepresentationTest1() 314 representation.computeCurve(); in ctkTransferFunctionRepresentationTest1() [all …]
|
/dports/math/kfr/kfr-4.2.1/include/kfr/cometa/ |
H A D | string.hpp | 27 struct representation struct 355 if (size <= 0) in format() 411 …const int size = std::snprintf(nullptr, 0, str, details::pack_value(representation<Args>::get(args… in as_string() local 422 const size_t pad = size >= text.size() ? size - text.size() : 0; in padright() 428 const size_t pad = size >= text.size() ? size - text.size() : 0; in padleft() 434 const size_t pad = size >= text.size() ? size - text.size() : 0; in padcenter() 457 struct representation<named_arg<T>> struct 467 struct representation<std::pair<T1, T2>> struct 477 struct representation<std::unique_ptr<T1>> struct 490 struct representation<std::weak_ptr<T1>> struct [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/doc/reference/src/ |
H A D | type-layout.md | 12 All values have an alignment and size. 30 size and alignment, we refer to those shared values as the size of the type and 69 > size of the size of `usize` and have the same alignment. 163 Informally, this representation is also called the `rust` representation. 226 current_offset += field.size; 251 The union will have a size of the maximum size of all of its fields rounded to 279 For [field-less enums], the `C` representation has the size and alignment of 442 would have a size and alignment of 1 byte. 467 Using a primitive representation in addition to `repr(C)` can change the size of 489 // The size of the C representation is platform dependant [all …]
|
/dports/devel/boost-docs/boost_1_72_0/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/devel/hyperscan/boost_1_75_0/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/databases/percona57-server/boost_1_59_0/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/databases/xtrabackup/boost_1_59_0/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|
/dports/databases/percona57-client/boost_1_59_0/boost/msm/mpl_graph/ |
H A D | mpl_graph.hpp | 48 …mpl::first<typename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, t… 52 …ypename mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Grap… 56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:… 62 mpl::size<typename out_edges<Vertex, Graph>::type> 68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::… 74 mpl::size<typename in_edges<Vertex, Graph>::type> 84 …mpl::transform<typename detail::produce_out_map<typename Graph::representation, Vertex, typename G… 92 detail::produce_vertex_set<typename Graph::representation, typename Graph::data> 96 mpl::size<typename vertices<Graph>::type> 102 detail::produce_edge_set<typename Graph::representation, typename Graph::data> [all …]
|