Skip to content

Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

Description

@jkalias

Summary

Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


1. set::min() / max() ignore the set's comparator (and are O(n))

Location:include/set.h:607-635

[[nodiscard]] fcpp::optional_t<TKey> min() const
{
constauto& it = std::min_element(begin(), end());
if (it != end()) {
return *it;
}
return fcpp::optional_t<TKey>();
}

std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

Consequences

  • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
  • Fails to compile for key types that provide TCompare but not operator<.
  • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

TEST(SetTest, MinCustomType)
{
const set<person, person_comparator> persons({
person(15, "Jake"), person(18, "Jannet"),
person(25, "Kate"), person(62, "Bob")
});
constauto minimum = persons.min();
#if defined(__clang__)
EXPECT_EQ(person(18, "Jannet"), minimum.value());
#elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
#endif
}

The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

Suggested fix

[[nodiscard]] fcpp::optional_t<TKey> min() const
{
if (m_set.empty()) {
return fcpp::optional_t<TKey>();
}
return *begin(); // ordered by TCompare, O(1)
}
[[nodiscard]] fcpp::optional_t<TKey> max() const
{
if (m_set.empty()) {
return fcpp::optional_t<TKey>();
}
return *std::prev(end()); // O(1)
}

This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


2. Non-const set::operator[] does not compile

Location:include/set.h:1102-1116

TKey operator[](size_t index)
{
assert_smaller_size(index);
#ifdef CPP17_AVAILABLE
auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
#else
...
#endif
}

std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

auto it = begin();
std::advance(it, index);
return *it;

Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

fcpp::set<int> s({1, 2, 3});
auto x = s[0]; // selects the non-const overload -> compile error

would fail to build under C++17.

Suggested fix: mirror the const overload:

TKey operator[](size_t index)
{
assert_smaller_size(index);
auto it = begin();
std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
}

A regression test that subscripts a non-const set would prevent this from regressing.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions

    , 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
     blocks
    (function() {
    function addCopyButtons() {
    document.querySelectorAll('pre code').forEach(function(codeBlock) {
    if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
    codeBlock.parentElement.setAttribute('data-copy-added', 'true');
    var btn = document.createElement('button');
    btn.textContent = 'Copy';
    btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
    btn.onmouseover = function() { this.style.opacity = '1'; };
    btn.onmouseout = function() { this.style.opacity = '0.7'; };
    btn.onclick = function() {
    navigator.clipboard.writeText(codeBlock.textContent).then(function() {
    btn.textContent = 'Copied!';
    setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
    });
    };
    codeBlock.parentElement.style.position = 'relative';
    codeBlock.parentElement.appendChild(btn);
    });
    }
    addCopyButtons();
    // Re-run on dynamic content
    var observer = new MutationObserver(addCopyButtons);
    observer.observe(document.body, { childList: true, subtree: true });
    })();
    }
    } catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
    })();
    (function(){
    try {
    var __m = "github.com";
    var __re = new RegExp('^' + "github\\.com" + '
    Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile · Issue #28 · jkalias/functional_cpp · GitHub
    Skip to content

    Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

    Description

    @jkalias

    Summary

    Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


    1. set::min() / max() ignore the set's comparator (and are O(n))

    Location:include/set.h:607-635

    [[nodiscard]] fcpp::optional_t<TKey> min() const
    {
    constauto& it = std::min_element(begin(), end());
    if (it != end()) {
    return *it;
    }
    return fcpp::optional_t<TKey>();
    }

    std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

    Consequences

    • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
    • Fails to compile for key types that provide TCompare but not operator<.
    • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

    Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

    TEST(SetTest, MinCustomType)
    {
    const set<person, person_comparator> persons({
    person(15, "Jake"), person(18, "Jannet"),
    person(25, "Kate"), person(62, "Bob")
    });
    constauto minimum = persons.min();
    #if defined(__clang__)
    EXPECT_EQ(person(18, "Jannet"), minimum.value());
    #elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
    #endif
    }

    The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

    Suggested fix

    [[nodiscard]] fcpp::optional_t<TKey> min() const
    {
    if (m_set.empty()) {
    return fcpp::optional_t<TKey>();
    }
    return *begin(); // ordered by TCompare, O(1)
    }
    [[nodiscard]] fcpp::optional_t<TKey> max() const
    {
    if (m_set.empty()) {
    return fcpp::optional_t<TKey>();
    }
    return *std::prev(end()); // O(1)
    }

    This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


    2. Non-const set::operator[] does not compile

    Location:include/set.h:1102-1116

    TKey operator[](size_t index)
    {
    assert_smaller_size(index);
    #ifdef CPP17_AVAILABLE
    auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
    #else
    ...
    #endif
    }

    std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

    auto it = begin();
    std::advance(it, index);
    return *it;

    Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

    fcpp::set<int> s({1, 2, 3});
    auto x = s[0]; // selects the non-const overload -> compile error

    would fail to build under C++17.

    Suggested fix: mirror the const overload:

    TKey operator[](size_t index)
    {
    assert_smaller_size(index);
    auto it = begin();
    std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
    }

    A regression test that subscripts a non-const set would prevent this from regressing.

    Metadata

    Metadata

    Assignees

    No one assigned

      Labels

      No labels
      No labels

      Projects

      No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions

      , 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile · Issue #28 · jkalias/functional_cpp · GitHub
      Skip to content

      Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

      Description

      @jkalias

      Summary

      Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


      1. set::min() / max() ignore the set's comparator (and are O(n))

      Location:include/set.h:607-635

      [[nodiscard]] fcpp::optional_t<TKey> min() const
      {
      constauto& it = std::min_element(begin(), end());
      if (it != end()) {
      return *it;
      }
      return fcpp::optional_t<TKey>();
      }

      std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

      Consequences

      • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
      • Fails to compile for key types that provide TCompare but not operator<.
      • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

      Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

      TEST(SetTest, MinCustomType)
      {
      const set<person, person_comparator> persons({
      person(15, "Jake"), person(18, "Jannet"),
      person(25, "Kate"), person(62, "Bob")
      });
      constauto minimum = persons.min();
      #if defined(__clang__)
      EXPECT_EQ(person(18, "Jannet"), minimum.value());
      #elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
      #endif
      }

      The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

      Suggested fix

      [[nodiscard]] fcpp::optional_t<TKey> min() const
      {
      if (m_set.empty()) {
      return fcpp::optional_t<TKey>();
      }
      return *begin(); // ordered by TCompare, O(1)
      }
      [[nodiscard]] fcpp::optional_t<TKey> max() const
      {
      if (m_set.empty()) {
      return fcpp::optional_t<TKey>();
      }
      return *std::prev(end()); // O(1)
      }

      This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


      2. Non-const set::operator[] does not compile

      Location:include/set.h:1102-1116

      TKey operator[](size_t index)
      {
      assert_smaller_size(index);
      #ifdef CPP17_AVAILABLE
      auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
      #else
      ...
      #endif
      }

      std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

      auto it = begin();
      std::advance(it, index);
      return *it;

      Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

      fcpp::set<int> s({1, 2, 3});
      auto x = s[0]; // selects the non-const overload -> compile error

      would fail to build under C++17.

      Suggested fix: mirror the const overload:

      TKey operator[](size_t index)
      {
      assert_smaller_size(index);
      auto it = begin();
      std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
      }

      A regression test that subscripts a non-const set would prevent this from regressing.

      Metadata

      Metadata

      Assignees

      No one assigned

        Labels

        No labels
        No labels

        Projects

        No projects

        Milestone

        No milestone

        Relationships

        None yet

        Development

        No branches or pull requests

        Issue actions

        , 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile · Issue #28 · jkalias/functional_cpp · GitHub
        Skip to content

        Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

        Description

        @jkalias

        Summary

        Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


        1. set::min() / max() ignore the set's comparator (and are O(n))

        Location:include/set.h:607-635

        [[nodiscard]] fcpp::optional_t<TKey> min() const
        {
        constauto& it = std::min_element(begin(), end());
        if (it != end()) {
        return *it;
        }
        return fcpp::optional_t<TKey>();
        }

        std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

        Consequences

        • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
        • Fails to compile for key types that provide TCompare but not operator<.
        • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

        Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

        TEST(SetTest, MinCustomType)
        {
        const set<person, person_comparator> persons({
        person(15, "Jake"), person(18, "Jannet"),
        person(25, "Kate"), person(62, "Bob")
        });
        constauto minimum = persons.min();
        #if defined(__clang__)
        EXPECT_EQ(person(18, "Jannet"), minimum.value());
        #elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
        #endif
        }

        The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

        Suggested fix

        [[nodiscard]] fcpp::optional_t<TKey> min() const
        {
        if (m_set.empty()) {
        return fcpp::optional_t<TKey>();
        }
        return *begin(); // ordered by TCompare, O(1)
        }
        [[nodiscard]] fcpp::optional_t<TKey> max() const
        {
        if (m_set.empty()) {
        return fcpp::optional_t<TKey>();
        }
        return *std::prev(end()); // O(1)
        }

        This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


        2. Non-const set::operator[] does not compile

        Location:include/set.h:1102-1116

        TKey operator[](size_t index)
        {
        assert_smaller_size(index);
        #ifdef CPP17_AVAILABLE
        auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
        #else
        ...
        #endif
        }

        std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

        auto it = begin();
        std::advance(it, index);
        return *it;

        Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

        fcpp::set<int> s({1, 2, 3});
        auto x = s[0]; // selects the non-const overload -> compile error

        would fail to build under C++17.

        Suggested fix: mirror the const overload:

        TKey operator[](size_t index)
        {
        assert_smaller_size(index);
        auto it = begin();
        std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
        }

        A regression test that subscripts a non-const set would prevent this from regressing.

        Metadata

        Metadata

        Assignees

        No one assigned

          Labels

          No labels
          No labels

          Projects

          No projects

          Milestone

          No milestone

          Relationships

          None yet

          Development

          No branches or pull requests

          Issue actions

          , 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile · Issue #28 · jkalias/functional_cpp · GitHub
          Skip to content

          Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

          Description

          @jkalias

          Summary

          Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


          1. set::min() / max() ignore the set's comparator (and are O(n))

          Location:include/set.h:607-635

          [[nodiscard]] fcpp::optional_t<TKey> min() const
          {
          constauto& it = std::min_element(begin(), end());
          if (it != end()) {
          return *it;
          }
          return fcpp::optional_t<TKey>();
          }

          std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

          Consequences

          • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
          • Fails to compile for key types that provide TCompare but not operator<.
          • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

          Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

          TEST(SetTest, MinCustomType)
          {
          const set<person, person_comparator> persons({
          person(15, "Jake"), person(18, "Jannet"),
          person(25, "Kate"), person(62, "Bob")
          });
          constauto minimum = persons.min();
          #if defined(__clang__)
          EXPECT_EQ(person(18, "Jannet"), minimum.value());
          #elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
          #endif
          }

          The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

          Suggested fix

          [[nodiscard]] fcpp::optional_t<TKey> min() const
          {
          if (m_set.empty()) {
          return fcpp::optional_t<TKey>();
          }
          return *begin(); // ordered by TCompare, O(1)
          }
          [[nodiscard]] fcpp::optional_t<TKey> max() const
          {
          if (m_set.empty()) {
          return fcpp::optional_t<TKey>();
          }
          return *std::prev(end()); // O(1)
          }

          This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


          2. Non-const set::operator[] does not compile

          Location:include/set.h:1102-1116

          TKey operator[](size_t index)
          {
          assert_smaller_size(index);
          #ifdef CPP17_AVAILABLE
          auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
          #else
          ...
          #endif
          }

          std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

          auto it = begin();
          std::advance(it, index);
          return *it;

          Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

          fcpp::set<int> s({1, 2, 3});
          auto x = s[0]; // selects the non-const overload -> compile error

          would fail to build under C++17.

          Suggested fix: mirror the const overload:

          TKey operator[](size_t index)
          {
          assert_smaller_size(index);
          auto it = begin();
          std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
          }

          A regression test that subscripts a non-const set would prevent this from regressing.

          Metadata

          Metadata

          Assignees

          No one assigned

            Labels

            No labels
            No labels

            Projects

            No projects

            Milestone

            No milestone

            Relationships

            None yet

            Development

            No branches or pull requests

            Issue actions

            , 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile · Issue #28 · jkalias/functional_cpp · GitHub
            Skip to content

            Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

            Description

            @jkalias

            Summary

            Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


            1. set::min() / max() ignore the set's comparator (and are O(n))

            Location:include/set.h:607-635

            [[nodiscard]] fcpp::optional_t<TKey> min() const
            {
            constauto& it = std::min_element(begin(), end());
            if (it != end()) {
            return *it;
            }
            return fcpp::optional_t<TKey>();
            }

            std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

            Consequences

            • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
            • Fails to compile for key types that provide TCompare but not operator<.
            • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

            Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

            TEST(SetTest, MinCustomType)
            {
            const set<person, person_comparator> persons({
            person(15, "Jake"), person(18, "Jannet"),
            person(25, "Kate"), person(62, "Bob")
            });
            constauto minimum = persons.min();
            #if defined(__clang__)
            EXPECT_EQ(person(18, "Jannet"), minimum.value());
            #elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
            #endif
            }

            The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

            Suggested fix

            [[nodiscard]] fcpp::optional_t<TKey> min() const
            {
            if (m_set.empty()) {
            return fcpp::optional_t<TKey>();
            }
            return *begin(); // ordered by TCompare, O(1)
            }
            [[nodiscard]] fcpp::optional_t<TKey> max() const
            {
            if (m_set.empty()) {
            return fcpp::optional_t<TKey>();
            }
            return *std::prev(end()); // O(1)
            }

            This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


            2. Non-const set::operator[] does not compile

            Location:include/set.h:1102-1116

            TKey operator[](size_t index)
            {
            assert_smaller_size(index);
            #ifdef CPP17_AVAILABLE
            auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
            #else
            ...
            #endif
            }

            std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

            auto it = begin();
            std::advance(it, index);
            return *it;

            Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

            fcpp::set<int> s({1, 2, 3});
            auto x = s[0]; // selects the non-const overload -> compile error

            would fail to build under C++17.

            Suggested fix: mirror the const overload:

            TKey operator[](size_t index)
            {
            assert_smaller_size(index);
            auto it = begin();
            std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
            }

            A regression test that subscripts a non-const set would prevent this from regressing.

            Metadata

            Metadata

            Assignees

            No one assigned

              Labels

              No labels
              No labels

              Projects

              No projects

              Milestone

              No milestone

              Relationships

              None yet

              Development

              No branches or pull requests

              Issue actions

              , 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); })(); Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile · Issue #28 · jkalias/functional_cpp · GitHub
              Skip to content

              Correctness bugs: set::min()/max() ignore comparator; non-const set::operator[] does not compile #28

              Description

              @jkalias

              Summary

              Two correctness defects in include/set.h. Both are currently masked by the test suite (one via a compiler-conditional expectation, one because the buggy overload is never instantiated) rather than fixed.


              1. set::min() / max() ignore the set's comparator (and are O(n))

              Location:include/set.h:607-635

              [[nodiscard]] fcpp::optional_t<TKey> min() const
              {
              constauto& it = std::min_element(begin(), end());
              if (it != end()) {
              return *it;
              }
              return fcpp::optional_t<TKey>();
              }

              std::min_element / std::max_element compare elements with operator< on TKey, not with the set's TCompare.

              Consequences

              • Wrong result for any set instantiated with a custom comparator. The set is stored ordered by TCompare, but min()/max() re-rank by operator<, so they can return the wrong element.
              • Fails to compile for key types that provide TCompare but not operator<.
              • O(n) where it should be O(1): a std::set is already ordered, so the minimum is *begin() and the maximum is *std::prev(end()).

              Evidence — the test papers over this instead of fixing it (tests/set_test.cc:289):

              TEST(SetTest, MinCustomType)
              {
              const set<person, person_comparator> persons({
              person(15, "Jake"), person(18, "Jannet"),
              person(25, "Kate"), person(62, "Bob")
              });
              constauto minimum = persons.min();
              #if defined(__clang__)
              EXPECT_EQ(person(18, "Jannet"), minimum.value());
              #elseEXPECT_EQ(person(62, "Bob"), minimum.value()); // different answer per compiler
              #endif
              }

              The fact that the expected value differs between clang and gcc is a direct symptom of the bug: the answer depends on operator< and iteration order rather than the set's actual ordering.

              Suggested fix

              [[nodiscard]] fcpp::optional_t<TKey> min() const
              {
              if (m_set.empty()) {
              return fcpp::optional_t<TKey>();
              }
              return *begin(); // ordered by TCompare, O(1)
              }
              [[nodiscard]] fcpp::optional_t<TKey> max() const
              {
              if (m_set.empty()) {
              return fcpp::optional_t<TKey>();
              }
              return *std::prev(end()); // O(1)
              }

              This is deterministic, respects the custom comparator, is O(1), and allows the #if defined(__clang__) branch in SetTest.MinCustomType (and the analogous max test) to be removed.


              2. Non-const set::operator[] does not compile

              Location:include/set.h:1102-1116

              TKey operator[](size_t index)
              {
              assert_smaller_size(index);
              #ifdef CPP17_AVAILABLE
              auto it = std::advance(begin(), index); // std::advance returns voidreturn *it;
              #else
              ...
              #endif
              }

              std::advance returns void, so auto it = std::advance(...) is ill-formed. The const overload (set.h:1121-1136) does it correctly:

              auto it = begin();
              std::advance(it, index);
              return *it;

              Why it's currently hidden: every call site in the tests uses operator[] on a const set& (e.g. test_contents(const set<int>& set) at tests/set_test.cc:37), so the non-const overload is never instantiated. Any use such as:

              fcpp::set<int> s({1, 2, 3});
              auto x = s[0]; // selects the non-const overload -> compile error

              would fail to build under C++17.

              Suggested fix: mirror the const overload:

              TKey operator[](size_t index)
              {
              assert_smaller_size(index);
              auto it = begin();
              std::advance(it, index); // works for both C++11 and C++17 pathsreturn *it;
              }

              A regression test that subscripts a non-const set would prevent this from regressing.

              Metadata

              Metadata

              Assignees

              No one assigned

                Labels

                No labels
                No labels

                Projects

                No projects

                Milestone

                No milestone

                Relationships

                None yet

                Development

                No branches or pull requests

                Issue actions