Destroy std::vector without releasing memory

前端 未结 2 1309
-上瘾入骨i
-上瘾入骨i 2021-02-20 11:16

Lets say I have a function to get data into an std vector:

void getData(std::vector &toBeFilled) {
  // Push data into \"toBeFilled\"
}

相关标签:
2条回答
  • 2021-02-20 11:49

    No.

    The API you're using has a contract that states it takes ownership of the data you provide it, and that this data is provided through a pointer. This basically rules out using standard vectors.

    Vector will always assuredly free the memory it allocated and safely destroy the elements it contains. That is part of its guaranteed contract and you cannot turn that off.

    You have to make a copy of the data if you wish to take ownership of them... or move each element out into your own container. Or start with your own new[] in the first place (ugh) though you can at least wrap all this in some class that mimics std::vector and becomes non-owning.

    0 讨论(0)
  • 2021-02-20 12:01

    Here's a horrible hack which should allow you to do what you need, but it relies on Undefined Behaviour doing the simplest thing it can. The idea is to create your own allocator which is layout-compatible with std::allocator and type-pun the vector:

    template <class T>
    struct CheatingAllocator : std::allocator<T>
    {
      using typename std::allocator<T>::pointer;
      using typename std::allocator<T>::size_type;
    
      void deallocate(pointer p, size_type n) { /* no-op */ }
    
      // Do not add ANY data members!!
    };
    
    
    {
      std::vector<int, CheatingAllocator<int>> data;
      getData(reinterpret_cast<std::vector<int>&>(data)); // type pun, `getData()` will use std::allocator internally
      useData(data.data());
      // data actually uses your own allocator, so it will not deallocate anything
    }
    

    Note that it's as hacky and unsafe as hacks go. It relies on the memory layout not changing and it relies of std::allocator using new[] inside its allocate function. I wouldn't use this in production code myself, but I believe it is a (desperate) solution.


    @TonyD correctly pointed out in the comments that std::allocator is quite likely to not use new[] internally. Therefore, the above would most likely fail on the delete[] inside useData(). The same @TonyD also made a good point about using reserve() to (hopefully) prevent reallocation inside getData(). So the updated code would look like this:

    template <class T>
    struct CheatingAllocator : std::allocator<T>
    {
      using typename std::allocator<T>::pointer;
      using typename std::allocator<T>::size_type;
    
      pointer allocate(size_type n) { return new T[n]; }
    
      void deallocate(pointer p, size_type n) { /* no-op */ }
    
      // Do not add ANY data members!!
    };
    
    
    {
      std::vector<int, CheatingAllocator<int>> data;
      data.reserve(value_such_that_getData_will_not_need_to_reallocate);
      getData(reinterpret_cast<std::vector<int>&>(data)); // type pun, `getData()` will use std::allocator internally
      useData(data.data());
      // data actually uses your own allocator, so it will not deallocate anything
    }
    
    0 讨论(0)
提交回复
热议问题