mirror of
https://github.com/OPM/ResInsight.git
synced 2026-11-13 09:37:29 -06:00
Magne Sjaastad
b367a65062
Insert nodes concurrently into a lock-free hash table keeping the lowest index per coordinate, then number unique nodes per fixed block, so the result is independent of thread count. Reduces removal time from 1.8 s to about 0.45 s for 78.4M nodes. Add a disabled performance test and docs/remove-duplicate-grid-nodes.md describing the algorithm.
35 lines
1.3 KiB
C++
35 lines
1.3 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) 2026- Equinor ASA
|
|
//
|
|
// ResInsight is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// ResInsight 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 General Public License at <http://www.gnu.org/licenses/gpl.html>
|
|
// for more details.
|
|
//
|
|
/////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#pragma once
|
|
|
|
#include "cvfVector3.h"
|
|
|
|
#include <cstdint>
|
|
#include <vector>
|
|
|
|
//==================================================================================================
|
|
/// Removal of grid nodes with exactly equal coordinates.
|
|
///
|
|
/// The algorithm is described in docs/remove-duplicate-grid-nodes.md
|
|
//==================================================================================================
|
|
namespace RigGridNodeDeduplication
|
|
{
|
|
std::vector<uint32_t> removeDuplicateNodes( std::vector<cvf::Vec3d>& nodes );
|
|
} // namespace RigGridNodeDeduplication
|