How is std::forward_list emplace_after O(1)?

前端 未结 0 1862
盖世英雄少女心
盖世英雄少女心 2021-01-30 20:57

I\'m currently implementing a forward list (Singly linked list). I noticed that std::forward_list::emplace_after is O(1), so the complexity is constant: How is this

相关标签:
回答
  • 消灭零回复
提交回复
热议问题