testing/cxxsize/unordered_set.cxx

//***************************************************************************
// apps/testing/cxxsize/unordered_set.cxx
//
// Licensed to the Apache Software Foundation (ASF) under one or more
// contributor license agreements.  See the NOTICE file distributed with
// this work for additional information regarding copyright ownership.  The
// ASF licenses this file to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance with the
// License.  You may obtain a copy of the License at
//
//   http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.  See the
// License for the specific language governing permissions and limitations
// under the License.
//
//***************************************************************************

//***************************************************************************
// Included Files
//***************************************************************************

#include <unordered_set>

//***************************************************************************
// Private Classes
//***************************************************************************

//***************************************************************************
// Private Data
//***************************************************************************

//***************************************************************************
// Public Functions
//***************************************************************************

//***************************************************************************
// Name: unordered_set_main
//***************************************************************************/

extern "C" int main(int argc, FAR char *argv[])
{
  std::unordered_set<int> s;

  s = { 1, 2, 3 };

  if (s.find(1) != s.end())
    {
      s.erase(1);
    }

  while (!s.empty())
    {
      s.erase(s.begin());
    }

  s.insert(4);
  s.clear();

  return 0;
}