| File: | src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Transforms/Scalar/Float2Int.cpp |
| Warning: | line 412, column 37 Called C++ object pointer is null |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | //===- Float2Int.cpp - Demote floating point ops to work on integers ------===// | ||||
| 2 | // | ||||
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | ||||
| 4 | // See https://llvm.org/LICENSE.txt for license information. | ||||
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | ||||
| 6 | // | ||||
| 7 | //===----------------------------------------------------------------------===// | ||||
| 8 | // | ||||
| 9 | // This file implements the Float2Int pass, which aims to demote floating | ||||
| 10 | // point operations to work on integers, where that is losslessly possible. | ||||
| 11 | // | ||||
| 12 | //===----------------------------------------------------------------------===// | ||||
| 13 | |||||
| 14 | #include "llvm/InitializePasses.h" | ||||
| 15 | #include "llvm/Support/CommandLine.h" | ||||
| 16 | #include "llvm/Transforms/Scalar/Float2Int.h" | ||||
| 17 | #include "llvm/ADT/APInt.h" | ||||
| 18 | #include "llvm/ADT/APSInt.h" | ||||
| 19 | #include "llvm/ADT/SmallVector.h" | ||||
| 20 | #include "llvm/Analysis/GlobalsModRef.h" | ||||
| 21 | #include "llvm/IR/Constants.h" | ||||
| 22 | #include "llvm/IR/IRBuilder.h" | ||||
| 23 | #include "llvm/IR/InstIterator.h" | ||||
| 24 | #include "llvm/IR/Instructions.h" | ||||
| 25 | #include "llvm/IR/Module.h" | ||||
| 26 | #include "llvm/Pass.h" | ||||
| 27 | #include "llvm/Support/Debug.h" | ||||
| 28 | #include "llvm/Support/raw_ostream.h" | ||||
| 29 | #include "llvm/Transforms/Scalar.h" | ||||
| 30 | #include <deque> | ||||
| 31 | #include <functional> // For std::function | ||||
| 32 | |||||
| 33 | #define DEBUG_TYPE"float2int" "float2int" | ||||
| 34 | |||||
| 35 | using namespace llvm; | ||||
| 36 | |||||
| 37 | // The algorithm is simple. Start at instructions that convert from the | ||||
| 38 | // float to the int domain: fptoui, fptosi and fcmp. Walk up the def-use | ||||
| 39 | // graph, using an equivalence datastructure to unify graphs that interfere. | ||||
| 40 | // | ||||
| 41 | // Mappable instructions are those with an integer corrollary that, given | ||||
| 42 | // integer domain inputs, produce an integer output; fadd, for example. | ||||
| 43 | // | ||||
| 44 | // If a non-mappable instruction is seen, this entire def-use graph is marked | ||||
| 45 | // as non-transformable. If we see an instruction that converts from the | ||||
| 46 | // integer domain to FP domain (uitofp,sitofp), we terminate our walk. | ||||
| 47 | |||||
| 48 | /// The largest integer type worth dealing with. | ||||
| 49 | static cl::opt<unsigned> | ||||
| 50 | MaxIntegerBW("float2int-max-integer-bw", cl::init(64), cl::Hidden, | ||||
| 51 | cl::desc("Max integer bitwidth to consider in float2int" | ||||
| 52 | "(default=64)")); | ||||
| 53 | |||||
| 54 | namespace { | ||||
| 55 | struct Float2IntLegacyPass : public FunctionPass { | ||||
| 56 | static char ID; // Pass identification, replacement for typeid | ||||
| 57 | Float2IntLegacyPass() : FunctionPass(ID) { | ||||
| 58 | initializeFloat2IntLegacyPassPass(*PassRegistry::getPassRegistry()); | ||||
| 59 | } | ||||
| 60 | |||||
| 61 | bool runOnFunction(Function &F) override { | ||||
| 62 | if (skipFunction(F)) | ||||
| 63 | return false; | ||||
| 64 | |||||
| 65 | const DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); | ||||
| 66 | return Impl.runImpl(F, DT); | ||||
| 67 | } | ||||
| 68 | |||||
| 69 | void getAnalysisUsage(AnalysisUsage &AU) const override { | ||||
| 70 | AU.setPreservesCFG(); | ||||
| 71 | AU.addRequired<DominatorTreeWrapperPass>(); | ||||
| 72 | AU.addPreserved<GlobalsAAWrapperPass>(); | ||||
| 73 | } | ||||
| 74 | |||||
| 75 | private: | ||||
| 76 | Float2IntPass Impl; | ||||
| 77 | }; | ||||
| 78 | } | ||||
| 79 | |||||
| 80 | char Float2IntLegacyPass::ID = 0; | ||||
| 81 | INITIALIZE_PASS(Float2IntLegacyPass, "float2int", "Float to int", false, false)static void *initializeFloat2IntLegacyPassPassOnce(PassRegistry &Registry) { PassInfo *PI = new PassInfo( "Float to int" , "float2int", &Float2IntLegacyPass::ID, PassInfo::NormalCtor_t (callDefaultCtor<Float2IntLegacyPass>), false, false); Registry .registerPass(*PI, true); return PI; } static llvm::once_flag InitializeFloat2IntLegacyPassPassFlag; void llvm::initializeFloat2IntLegacyPassPass (PassRegistry &Registry) { llvm::call_once(InitializeFloat2IntLegacyPassPassFlag , initializeFloat2IntLegacyPassPassOnce, std::ref(Registry)); } | ||||
| 82 | |||||
| 83 | // Given a FCmp predicate, return a matching ICmp predicate if one | ||||
| 84 | // exists, otherwise return BAD_ICMP_PREDICATE. | ||||
| 85 | static CmpInst::Predicate mapFCmpPred(CmpInst::Predicate P) { | ||||
| 86 | switch (P) { | ||||
| 87 | case CmpInst::FCMP_OEQ: | ||||
| 88 | case CmpInst::FCMP_UEQ: | ||||
| 89 | return CmpInst::ICMP_EQ; | ||||
| 90 | case CmpInst::FCMP_OGT: | ||||
| 91 | case CmpInst::FCMP_UGT: | ||||
| 92 | return CmpInst::ICMP_SGT; | ||||
| 93 | case CmpInst::FCMP_OGE: | ||||
| 94 | case CmpInst::FCMP_UGE: | ||||
| 95 | return CmpInst::ICMP_SGE; | ||||
| 96 | case CmpInst::FCMP_OLT: | ||||
| 97 | case CmpInst::FCMP_ULT: | ||||
| 98 | return CmpInst::ICMP_SLT; | ||||
| 99 | case CmpInst::FCMP_OLE: | ||||
| 100 | case CmpInst::FCMP_ULE: | ||||
| 101 | return CmpInst::ICMP_SLE; | ||||
| 102 | case CmpInst::FCMP_ONE: | ||||
| 103 | case CmpInst::FCMP_UNE: | ||||
| 104 | return CmpInst::ICMP_NE; | ||||
| 105 | default: | ||||
| 106 | return CmpInst::BAD_ICMP_PREDICATE; | ||||
| 107 | } | ||||
| 108 | } | ||||
| 109 | |||||
| 110 | // Given a floating point binary operator, return the matching | ||||
| 111 | // integer version. | ||||
| 112 | static Instruction::BinaryOps mapBinOpcode(unsigned Opcode) { | ||||
| 113 | switch (Opcode) { | ||||
| 114 | default: llvm_unreachable("Unhandled opcode!")__builtin_unreachable(); | ||||
| 115 | case Instruction::FAdd: return Instruction::Add; | ||||
| 116 | case Instruction::FSub: return Instruction::Sub; | ||||
| 117 | case Instruction::FMul: return Instruction::Mul; | ||||
| 118 | } | ||||
| 119 | } | ||||
| 120 | |||||
| 121 | // Find the roots - instructions that convert from the FP domain to | ||||
| 122 | // integer domain. | ||||
| 123 | void Float2IntPass::findRoots(Function &F, const DominatorTree &DT) { | ||||
| 124 | for (BasicBlock &BB : F) { | ||||
| 125 | // Unreachable code can take on strange forms that we are not prepared to | ||||
| 126 | // handle. For example, an instruction may have itself as an operand. | ||||
| 127 | if (!DT.isReachableFromEntry(&BB)) | ||||
| 128 | continue; | ||||
| 129 | |||||
| 130 | for (Instruction &I : BB) { | ||||
| 131 | if (isa<VectorType>(I.getType())) | ||||
| 132 | continue; | ||||
| 133 | switch (I.getOpcode()) { | ||||
| 134 | default: break; | ||||
| 135 | case Instruction::FPToUI: | ||||
| 136 | case Instruction::FPToSI: | ||||
| 137 | Roots.insert(&I); | ||||
| 138 | break; | ||||
| 139 | case Instruction::FCmp: | ||||
| 140 | if (mapFCmpPred(cast<CmpInst>(&I)->getPredicate()) != | ||||
| 141 | CmpInst::BAD_ICMP_PREDICATE) | ||||
| 142 | Roots.insert(&I); | ||||
| 143 | break; | ||||
| 144 | } | ||||
| 145 | } | ||||
| 146 | } | ||||
| 147 | } | ||||
| 148 | |||||
| 149 | // Helper - mark I as having been traversed, having range R. | ||||
| 150 | void Float2IntPass::seen(Instruction *I, ConstantRange R) { | ||||
| 151 | LLVM_DEBUG(dbgs() << "F2I: " << *I << ":" << R << "\n")do { } while (false); | ||||
| 152 | auto IT = SeenInsts.find(I); | ||||
| 153 | if (IT != SeenInsts.end()) | ||||
| 154 | IT->second = std::move(R); | ||||
| 155 | else | ||||
| 156 | SeenInsts.insert(std::make_pair(I, std::move(R))); | ||||
| 157 | } | ||||
| 158 | |||||
| 159 | // Helper - get a range representing a poison value. | ||||
| 160 | ConstantRange Float2IntPass::badRange() { | ||||
| 161 | return ConstantRange::getFull(MaxIntegerBW + 1); | ||||
| 162 | } | ||||
| 163 | ConstantRange Float2IntPass::unknownRange() { | ||||
| 164 | return ConstantRange::getEmpty(MaxIntegerBW + 1); | ||||
| 165 | } | ||||
| 166 | ConstantRange Float2IntPass::validateRange(ConstantRange R) { | ||||
| 167 | if (R.getBitWidth() > MaxIntegerBW + 1) | ||||
| 168 | return badRange(); | ||||
| 169 | return R; | ||||
| 170 | } | ||||
| 171 | |||||
| 172 | // The most obvious way to structure the search is a depth-first, eager | ||||
| 173 | // search from each root. However, that require direct recursion and so | ||||
| 174 | // can only handle small instruction sequences. Instead, we split the search | ||||
| 175 | // up into two phases: | ||||
| 176 | // - walkBackwards: A breadth-first walk of the use-def graph starting from | ||||
| 177 | // the roots. Populate "SeenInsts" with interesting | ||||
| 178 | // instructions and poison values if they're obvious and | ||||
| 179 | // cheap to compute. Calculate the equivalance set structure | ||||
| 180 | // while we're here too. | ||||
| 181 | // - walkForwards: Iterate over SeenInsts in reverse order, so we visit | ||||
| 182 | // defs before their uses. Calculate the real range info. | ||||
| 183 | |||||
| 184 | // Breadth-first walk of the use-def graph; determine the set of nodes | ||||
| 185 | // we care about and eagerly determine if some of them are poisonous. | ||||
| 186 | void Float2IntPass::walkBackwards() { | ||||
| 187 | std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); | ||||
| 188 | while (!Worklist.empty()) { | ||||
| 189 | Instruction *I = Worklist.back(); | ||||
| 190 | Worklist.pop_back(); | ||||
| 191 | |||||
| 192 | if (SeenInsts.find(I) != SeenInsts.end()) | ||||
| 193 | // Seen already. | ||||
| 194 | continue; | ||||
| 195 | |||||
| 196 | switch (I->getOpcode()) { | ||||
| 197 | // FIXME: Handle select and phi nodes. | ||||
| 198 | default: | ||||
| 199 | // Path terminated uncleanly. | ||||
| 200 | seen(I, badRange()); | ||||
| 201 | break; | ||||
| 202 | |||||
| 203 | case Instruction::UIToFP: | ||||
| 204 | case Instruction::SIToFP: { | ||||
| 205 | // Path terminated cleanly - use the type of the integer input to seed | ||||
| 206 | // the analysis. | ||||
| 207 | unsigned BW = I->getOperand(0)->getType()->getPrimitiveSizeInBits(); | ||||
| 208 | auto Input = ConstantRange::getFull(BW); | ||||
| 209 | auto CastOp = (Instruction::CastOps)I->getOpcode(); | ||||
| 210 | seen(I, validateRange(Input.castOp(CastOp, MaxIntegerBW+1))); | ||||
| 211 | continue; | ||||
| 212 | } | ||||
| 213 | |||||
| 214 | case Instruction::FNeg: | ||||
| 215 | case Instruction::FAdd: | ||||
| 216 | case Instruction::FSub: | ||||
| 217 | case Instruction::FMul: | ||||
| 218 | case Instruction::FPToUI: | ||||
| 219 | case Instruction::FPToSI: | ||||
| 220 | case Instruction::FCmp: | ||||
| 221 | seen(I, unknownRange()); | ||||
| 222 | break; | ||||
| 223 | } | ||||
| 224 | |||||
| 225 | for (Value *O : I->operands()) { | ||||
| 226 | if (Instruction *OI = dyn_cast<Instruction>(O)) { | ||||
| 227 | // Unify def-use chains if they interfere. | ||||
| 228 | ECs.unionSets(I, OI); | ||||
| 229 | if (SeenInsts.find(I)->second != badRange()) | ||||
| 230 | Worklist.push_back(OI); | ||||
| 231 | } else if (!isa<ConstantFP>(O)) { | ||||
| 232 | // Not an instruction or ConstantFP? we can't do anything. | ||||
| 233 | seen(I, badRange()); | ||||
| 234 | } | ||||
| 235 | } | ||||
| 236 | } | ||||
| 237 | } | ||||
| 238 | |||||
| 239 | // Walk forwards down the list of seen instructions, so we visit defs before | ||||
| 240 | // uses. | ||||
| 241 | void Float2IntPass::walkForwards() { | ||||
| 242 | for (auto &It : reverse(SeenInsts)) { | ||||
| 243 | if (It.second != unknownRange()) | ||||
| 244 | continue; | ||||
| 245 | |||||
| 246 | Instruction *I = It.first; | ||||
| 247 | std::function<ConstantRange(ArrayRef<ConstantRange>)> Op; | ||||
| 248 | switch (I->getOpcode()) { | ||||
| 249 | // FIXME: Handle select and phi nodes. | ||||
| 250 | default: | ||||
| 251 | case Instruction::UIToFP: | ||||
| 252 | case Instruction::SIToFP: | ||||
| 253 | llvm_unreachable("Should have been handled in walkForwards!")__builtin_unreachable(); | ||||
| 254 | |||||
| 255 | case Instruction::FNeg: | ||||
| 256 | Op = [](ArrayRef<ConstantRange> Ops) { | ||||
| 257 | assert(Ops.size() == 1 && "FNeg is a unary operator!")((void)0); | ||||
| 258 | unsigned Size = Ops[0].getBitWidth(); | ||||
| 259 | auto Zero = ConstantRange(APInt::getNullValue(Size)); | ||||
| 260 | return Zero.sub(Ops[0]); | ||||
| 261 | }; | ||||
| 262 | break; | ||||
| 263 | |||||
| 264 | case Instruction::FAdd: | ||||
| 265 | case Instruction::FSub: | ||||
| 266 | case Instruction::FMul: | ||||
| 267 | Op = [I](ArrayRef<ConstantRange> Ops) { | ||||
| 268 | assert(Ops.size() == 2 && "its a binary operator!")((void)0); | ||||
| 269 | auto BinOp = (Instruction::BinaryOps) I->getOpcode(); | ||||
| 270 | return Ops[0].binaryOp(BinOp, Ops[1]); | ||||
| 271 | }; | ||||
| 272 | break; | ||||
| 273 | |||||
| 274 | // | ||||
| 275 | // Root-only instructions - we'll only see these if they're the | ||||
| 276 | // first node in a walk. | ||||
| 277 | // | ||||
| 278 | case Instruction::FPToUI: | ||||
| 279 | case Instruction::FPToSI: | ||||
| 280 | Op = [I](ArrayRef<ConstantRange> Ops) { | ||||
| 281 | assert(Ops.size() == 1 && "FPTo[US]I is a unary operator!")((void)0); | ||||
| 282 | // Note: We're ignoring the casts output size here as that's what the | ||||
| 283 | // caller expects. | ||||
| 284 | auto CastOp = (Instruction::CastOps)I->getOpcode(); | ||||
| 285 | return Ops[0].castOp(CastOp, MaxIntegerBW+1); | ||||
| 286 | }; | ||||
| 287 | break; | ||||
| 288 | |||||
| 289 | case Instruction::FCmp: | ||||
| 290 | Op = [](ArrayRef<ConstantRange> Ops) { | ||||
| 291 | assert(Ops.size() == 2 && "FCmp is a binary operator!")((void)0); | ||||
| 292 | return Ops[0].unionWith(Ops[1]); | ||||
| 293 | }; | ||||
| 294 | break; | ||||
| 295 | } | ||||
| 296 | |||||
| 297 | bool Abort = false; | ||||
| 298 | SmallVector<ConstantRange,4> OpRanges; | ||||
| 299 | for (Value *O : I->operands()) { | ||||
| 300 | if (Instruction *OI = dyn_cast<Instruction>(O)) { | ||||
| 301 | assert(SeenInsts.find(OI) != SeenInsts.end() &&((void)0) | ||||
| 302 | "def not seen before use!")((void)0); | ||||
| 303 | OpRanges.push_back(SeenInsts.find(OI)->second); | ||||
| 304 | } else if (ConstantFP *CF = dyn_cast<ConstantFP>(O)) { | ||||
| 305 | // Work out if the floating point number can be losslessly represented | ||||
| 306 | // as an integer. | ||||
| 307 | // APFloat::convertToInteger(&Exact) purports to do what we want, but | ||||
| 308 | // the exactness can be too precise. For example, negative zero can | ||||
| 309 | // never be exactly converted to an integer. | ||||
| 310 | // | ||||
| 311 | // Instead, we ask APFloat to round itself to an integral value - this | ||||
| 312 | // preserves sign-of-zero - then compare the result with the original. | ||||
| 313 | // | ||||
| 314 | const APFloat &F = CF->getValueAPF(); | ||||
| 315 | |||||
| 316 | // First, weed out obviously incorrect values. Non-finite numbers | ||||
| 317 | // can't be represented and neither can negative zero, unless | ||||
| 318 | // we're in fast math mode. | ||||
| 319 | if (!F.isFinite() || | ||||
| 320 | (F.isZero() && F.isNegative() && isa<FPMathOperator>(I) && | ||||
| 321 | !I->hasNoSignedZeros())) { | ||||
| 322 | seen(I, badRange()); | ||||
| 323 | Abort = true; | ||||
| 324 | break; | ||||
| 325 | } | ||||
| 326 | |||||
| 327 | APFloat NewF = F; | ||||
| 328 | auto Res = NewF.roundToIntegral(APFloat::rmNearestTiesToEven); | ||||
| 329 | if (Res != APFloat::opOK || NewF != F) { | ||||
| 330 | seen(I, badRange()); | ||||
| 331 | Abort = true; | ||||
| 332 | break; | ||||
| 333 | } | ||||
| 334 | // OK, it's representable. Now get it. | ||||
| 335 | APSInt Int(MaxIntegerBW+1, false); | ||||
| 336 | bool Exact; | ||||
| 337 | CF->getValueAPF().convertToInteger(Int, | ||||
| 338 | APFloat::rmNearestTiesToEven, | ||||
| 339 | &Exact); | ||||
| 340 | OpRanges.push_back(ConstantRange(Int)); | ||||
| 341 | } else { | ||||
| 342 | llvm_unreachable("Should have already marked this as badRange!")__builtin_unreachable(); | ||||
| 343 | } | ||||
| 344 | } | ||||
| 345 | |||||
| 346 | // Reduce the operands' ranges to a single range and return. | ||||
| 347 | if (!Abort) | ||||
| 348 | seen(I, Op(OpRanges)); | ||||
| 349 | } | ||||
| 350 | } | ||||
| 351 | |||||
| 352 | // If there is a valid transform to be done, do it. | ||||
| 353 | bool Float2IntPass::validateAndTransform() { | ||||
| 354 | bool MadeChange = false; | ||||
| 355 | |||||
| 356 | // Iterate over every disjoint partition of the def-use graph. | ||||
| 357 | for (auto It = ECs.begin(), E = ECs.end(); It != E; ++It) { | ||||
| 358 | ConstantRange R(MaxIntegerBW + 1, false); | ||||
| 359 | bool Fail = false; | ||||
| 360 | Type *ConvertedToTy = nullptr; | ||||
| 361 | |||||
| 362 | // For every member of the partition, union all the ranges together. | ||||
| 363 | for (auto MI = ECs.member_begin(It), ME = ECs.member_end(); | ||||
| 364 | MI != ME; ++MI) { | ||||
| 365 | Instruction *I = *MI; | ||||
| 366 | auto SeenI = SeenInsts.find(I); | ||||
| 367 | if (SeenI == SeenInsts.end()) | ||||
| 368 | continue; | ||||
| 369 | |||||
| 370 | R = R.unionWith(SeenI->second); | ||||
| 371 | // We need to ensure I has no users that have not been seen. | ||||
| 372 | // If it does, transformation would be illegal. | ||||
| 373 | // | ||||
| 374 | // Don't count the roots, as they terminate the graphs. | ||||
| 375 | if (Roots.count(I) == 0) { | ||||
| 376 | // Set the type of the conversion while we're here. | ||||
| 377 | if (!ConvertedToTy) | ||||
| 378 | ConvertedToTy = I->getType(); | ||||
| 379 | for (User *U : I->users()) { | ||||
| 380 | Instruction *UI = dyn_cast<Instruction>(U); | ||||
| 381 | if (!UI || SeenInsts.find(UI) == SeenInsts.end()) { | ||||
| 382 | LLVM_DEBUG(dbgs() << "F2I: Failing because of " << *U << "\n")do { } while (false); | ||||
| 383 | Fail = true; | ||||
| 384 | break; | ||||
| 385 | } | ||||
| 386 | } | ||||
| 387 | } | ||||
| 388 | if (Fail) | ||||
| 389 | break; | ||||
| 390 | } | ||||
| 391 | |||||
| 392 | // If the set was empty, or we failed, or the range is poisonous, | ||||
| 393 | // bail out. | ||||
| 394 | if (ECs.member_begin(It) == ECs.member_end() || Fail
| ||||
| 395 | R.isFullSet() || R.isSignWrappedSet()) | ||||
| 396 | continue; | ||||
| 397 | assert(ConvertedToTy && "Must have set the convertedtoty by this point!")((void)0); | ||||
| 398 | |||||
| 399 | // The number of bits required is the maximum of the upper and | ||||
| 400 | // lower limits, plus one so it can be signed. | ||||
| 401 | unsigned MinBW = std::max(R.getLower().getMinSignedBits(), | ||||
| 402 | R.getUpper().getMinSignedBits()) + 1; | ||||
| 403 | LLVM_DEBUG(dbgs() << "F2I: MinBitwidth=" << MinBW << ", R: " << R << "\n")do { } while (false); | ||||
| 404 | |||||
| 405 | // If we've run off the realms of the exactly representable integers, | ||||
| 406 | // the floating point result will differ from an integer approximation. | ||||
| 407 | |||||
| 408 | // Do we need more bits than are in the mantissa of the type we converted | ||||
| 409 | // to? semanticsPrecision returns the number of mantissa bits plus one | ||||
| 410 | // for the sign bit. | ||||
| 411 | unsigned MaxRepresentableBits | ||||
| 412 | = APFloat::semanticsPrecision(ConvertedToTy->getFltSemantics()) - 1; | ||||
| |||||
| 413 | if (MinBW > MaxRepresentableBits) { | ||||
| 414 | LLVM_DEBUG(dbgs() << "F2I: Value not guaranteed to be representable!\n")do { } while (false); | ||||
| 415 | continue; | ||||
| 416 | } | ||||
| 417 | if (MinBW > 64) { | ||||
| 418 | LLVM_DEBUG(do { } while (false) | ||||
| 419 | dbgs() << "F2I: Value requires more than 64 bits to represent!\n")do { } while (false); | ||||
| 420 | continue; | ||||
| 421 | } | ||||
| 422 | |||||
| 423 | // OK, R is known to be representable. Now pick a type for it. | ||||
| 424 | // FIXME: Pick the smallest legal type that will fit. | ||||
| 425 | Type *Ty = (MinBW > 32) ? Type::getInt64Ty(*Ctx) : Type::getInt32Ty(*Ctx); | ||||
| 426 | |||||
| 427 | for (auto MI = ECs.member_begin(It), ME = ECs.member_end(); | ||||
| 428 | MI != ME; ++MI) | ||||
| 429 | convert(*MI, Ty); | ||||
| 430 | MadeChange = true; | ||||
| 431 | } | ||||
| 432 | |||||
| 433 | return MadeChange; | ||||
| 434 | } | ||||
| 435 | |||||
| 436 | Value *Float2IntPass::convert(Instruction *I, Type *ToTy) { | ||||
| 437 | if (ConvertedInsts.find(I) != ConvertedInsts.end()) | ||||
| 438 | // Already converted this instruction. | ||||
| 439 | return ConvertedInsts[I]; | ||||
| 440 | |||||
| 441 | SmallVector<Value*,4> NewOperands; | ||||
| 442 | for (Value *V : I->operands()) { | ||||
| 443 | // Don't recurse if we're an instruction that terminates the path. | ||||
| 444 | if (I->getOpcode() == Instruction::UIToFP || | ||||
| 445 | I->getOpcode() == Instruction::SIToFP) { | ||||
| 446 | NewOperands.push_back(V); | ||||
| 447 | } else if (Instruction *VI = dyn_cast<Instruction>(V)) { | ||||
| 448 | NewOperands.push_back(convert(VI, ToTy)); | ||||
| 449 | } else if (ConstantFP *CF = dyn_cast<ConstantFP>(V)) { | ||||
| 450 | APSInt Val(ToTy->getPrimitiveSizeInBits(), /*isUnsigned=*/false); | ||||
| 451 | bool Exact; | ||||
| 452 | CF->getValueAPF().convertToInteger(Val, | ||||
| 453 | APFloat::rmNearestTiesToEven, | ||||
| 454 | &Exact); | ||||
| 455 | NewOperands.push_back(ConstantInt::get(ToTy, Val)); | ||||
| 456 | } else { | ||||
| 457 | llvm_unreachable("Unhandled operand type?")__builtin_unreachable(); | ||||
| 458 | } | ||||
| 459 | } | ||||
| 460 | |||||
| 461 | // Now create a new instruction. | ||||
| 462 | IRBuilder<> IRB(I); | ||||
| 463 | Value *NewV = nullptr; | ||||
| 464 | switch (I->getOpcode()) { | ||||
| 465 | default: llvm_unreachable("Unhandled instruction!")__builtin_unreachable(); | ||||
| 466 | |||||
| 467 | case Instruction::FPToUI: | ||||
| 468 | NewV = IRB.CreateZExtOrTrunc(NewOperands[0], I->getType()); | ||||
| 469 | break; | ||||
| 470 | |||||
| 471 | case Instruction::FPToSI: | ||||
| 472 | NewV = IRB.CreateSExtOrTrunc(NewOperands[0], I->getType()); | ||||
| 473 | break; | ||||
| 474 | |||||
| 475 | case Instruction::FCmp: { | ||||
| 476 | CmpInst::Predicate P = mapFCmpPred(cast<CmpInst>(I)->getPredicate()); | ||||
| 477 | assert(P != CmpInst::BAD_ICMP_PREDICATE && "Unhandled predicate!")((void)0); | ||||
| 478 | NewV = IRB.CreateICmp(P, NewOperands[0], NewOperands[1], I->getName()); | ||||
| 479 | break; | ||||
| 480 | } | ||||
| 481 | |||||
| 482 | case Instruction::UIToFP: | ||||
| 483 | NewV = IRB.CreateZExtOrTrunc(NewOperands[0], ToTy); | ||||
| 484 | break; | ||||
| 485 | |||||
| 486 | case Instruction::SIToFP: | ||||
| 487 | NewV = IRB.CreateSExtOrTrunc(NewOperands[0], ToTy); | ||||
| 488 | break; | ||||
| 489 | |||||
| 490 | case Instruction::FNeg: | ||||
| 491 | NewV = IRB.CreateNeg(NewOperands[0], I->getName()); | ||||
| 492 | break; | ||||
| 493 | |||||
| 494 | case Instruction::FAdd: | ||||
| 495 | case Instruction::FSub: | ||||
| 496 | case Instruction::FMul: | ||||
| 497 | NewV = IRB.CreateBinOp(mapBinOpcode(I->getOpcode()), | ||||
| 498 | NewOperands[0], NewOperands[1], | ||||
| 499 | I->getName()); | ||||
| 500 | break; | ||||
| 501 | } | ||||
| 502 | |||||
| 503 | // If we're a root instruction, RAUW. | ||||
| 504 | if (Roots.count(I)) | ||||
| 505 | I->replaceAllUsesWith(NewV); | ||||
| 506 | |||||
| 507 | ConvertedInsts[I] = NewV; | ||||
| 508 | return NewV; | ||||
| 509 | } | ||||
| 510 | |||||
| 511 | // Perform dead code elimination on the instructions we just modified. | ||||
| 512 | void Float2IntPass::cleanup() { | ||||
| 513 | for (auto &I : reverse(ConvertedInsts)) | ||||
| 514 | I.first->eraseFromParent(); | ||||
| 515 | } | ||||
| 516 | |||||
| 517 | bool Float2IntPass::runImpl(Function &F, const DominatorTree &DT) { | ||||
| 518 | LLVM_DEBUG(dbgs() << "F2I: Looking at function " << F.getName() << "\n")do { } while (false); | ||||
| 519 | // Clear out all state. | ||||
| 520 | ECs = EquivalenceClasses<Instruction*>(); | ||||
| 521 | SeenInsts.clear(); | ||||
| 522 | ConvertedInsts.clear(); | ||||
| 523 | Roots.clear(); | ||||
| 524 | |||||
| 525 | Ctx = &F.getParent()->getContext(); | ||||
| 526 | |||||
| 527 | findRoots(F, DT); | ||||
| 528 | |||||
| 529 | walkBackwards(); | ||||
| 530 | walkForwards(); | ||||
| 531 | |||||
| 532 | bool Modified = validateAndTransform(); | ||||
| 533 | if (Modified) | ||||
| 534 | cleanup(); | ||||
| 535 | return Modified; | ||||
| 536 | } | ||||
| 537 | |||||
| 538 | namespace llvm { | ||||
| 539 | FunctionPass *createFloat2IntPass() { return new Float2IntLegacyPass(); } | ||||
| 540 | |||||
| 541 | PreservedAnalyses Float2IntPass::run(Function &F, FunctionAnalysisManager &AM) { | ||||
| 542 | const DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); | ||||
| 543 | if (!runImpl(F, DT)) | ||||
| |||||
| 544 | return PreservedAnalyses::all(); | ||||
| 545 | |||||
| 546 | PreservedAnalyses PA; | ||||
| 547 | PA.preserveSet<CFGAnalyses>(); | ||||
| 548 | return PA; | ||||
| 549 | } | ||||
| 550 | } // End namespace llvm |
| 1 | // -*- C++ -*- |
| 2 | //===----------------------------------------------------------------------===// |
| 3 | // |
| 4 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 5 | // See https://llvm.org/LICENSE.txt for license information. |
| 6 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | #ifndef _LIBCPP___TREE |
| 11 | #define _LIBCPP___TREE |
| 12 | |
| 13 | #include <__config> |
| 14 | #include <__utility/forward.h> |
| 15 | #include <algorithm> |
| 16 | #include <iterator> |
| 17 | #include <limits> |
| 18 | #include <memory> |
| 19 | #include <stdexcept> |
| 20 | |
| 21 | #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) |
| 22 | #pragma GCC system_header |
| 23 | #endif |
| 24 | |
| 25 | _LIBCPP_PUSH_MACROSpush_macro("min") push_macro("max") |
| 26 | #include <__undef_macros> |
| 27 | |
| 28 | |
| 29 | _LIBCPP_BEGIN_NAMESPACE_STDnamespace std { inline namespace __1 { |
| 30 | |
| 31 | #if defined(__GNUC__4) && !defined(__clang__1) // gcc.gnu.org/PR37804 |
| 32 | template <class, class, class, class> class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) map; |
| 33 | template <class, class, class, class> class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multimap; |
| 34 | template <class, class, class> class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) set; |
| 35 | template <class, class, class> class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multiset; |
| 36 | #endif |
| 37 | |
| 38 | template <class _Tp, class _Compare, class _Allocator> class __tree; |
| 39 | template <class _Tp, class _NodePtr, class _DiffType> |
| 40 | class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __tree_iterator; |
| 41 | template <class _Tp, class _ConstNodePtr, class _DiffType> |
| 42 | class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __tree_const_iterator; |
| 43 | |
| 44 | template <class _Pointer> class __tree_end_node; |
| 45 | template <class _VoidPtr> class __tree_node_base; |
| 46 | template <class _Tp, class _VoidPtr> class __tree_node; |
| 47 | |
| 48 | template <class _Key, class _Value> |
| 49 | struct __value_type; |
| 50 | |
| 51 | template <class _Allocator> class __map_node_destructor; |
| 52 | template <class _TreeIterator> class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __map_iterator; |
| 53 | template <class _TreeIterator> class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __map_const_iterator; |
| 54 | |
| 55 | /* |
| 56 | |
| 57 | _NodePtr algorithms |
| 58 | |
| 59 | The algorithms taking _NodePtr are red black tree algorithms. Those |
| 60 | algorithms taking a parameter named __root should assume that __root |
| 61 | points to a proper red black tree (unless otherwise specified). |
| 62 | |
| 63 | Each algorithm herein assumes that __root->__parent_ points to a non-null |
| 64 | structure which has a member __left_ which points back to __root. No other |
| 65 | member is read or written to at __root->__parent_. |
| 66 | |
| 67 | __root->__parent_ will be referred to below (in comments only) as end_node. |
| 68 | end_node->__left_ is an externably accessible lvalue for __root, and can be |
| 69 | changed by node insertion and removal (without explicit reference to end_node). |
| 70 | |
| 71 | All nodes (with the exception of end_node), even the node referred to as |
| 72 | __root, have a non-null __parent_ field. |
| 73 | |
| 74 | */ |
| 75 | |
| 76 | // Returns: true if __x is a left child of its parent, else false |
| 77 | // Precondition: __x != nullptr. |
| 78 | template <class _NodePtr> |
| 79 | inline _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 80 | bool |
| 81 | __tree_is_left_child(_NodePtr __x) _NOEXCEPTnoexcept |
| 82 | { |
| 83 | return __x == __x->__parent_->__left_; |
| 84 | } |
| 85 | |
| 86 | // Determines if the subtree rooted at __x is a proper red black subtree. If |
| 87 | // __x is a proper subtree, returns the black height (null counts as 1). If |
| 88 | // __x is an improper subtree, returns 0. |
| 89 | template <class _NodePtr> |
| 90 | unsigned |
| 91 | __tree_sub_invariant(_NodePtr __x) |
| 92 | { |
| 93 | if (__x == nullptr) |
| 94 | return 1; |
| 95 | // parent consistency checked by caller |
| 96 | // check __x->__left_ consistency |
| 97 | if (__x->__left_ != nullptr && __x->__left_->__parent_ != __x) |
| 98 | return 0; |
| 99 | // check __x->__right_ consistency |
| 100 | if (__x->__right_ != nullptr && __x->__right_->__parent_ != __x) |
| 101 | return 0; |
| 102 | // check __x->__left_ != __x->__right_ unless both are nullptr |
| 103 | if (__x->__left_ == __x->__right_ && __x->__left_ != nullptr) |
| 104 | return 0; |
| 105 | // If this is red, neither child can be red |
| 106 | if (!__x->__is_black_) |
| 107 | { |
| 108 | if (__x->__left_ && !__x->__left_->__is_black_) |
| 109 | return 0; |
| 110 | if (__x->__right_ && !__x->__right_->__is_black_) |
| 111 | return 0; |
| 112 | } |
| 113 | unsigned __h = _VSTDstd::__1::__tree_sub_invariant(__x->__left_); |
| 114 | if (__h == 0) |
| 115 | return 0; // invalid left subtree |
| 116 | if (__h != _VSTDstd::__1::__tree_sub_invariant(__x->__right_)) |
| 117 | return 0; // invalid or different height right subtree |
| 118 | return __h + __x->__is_black_; // return black height of this node |
| 119 | } |
| 120 | |
| 121 | // Determines if the red black tree rooted at __root is a proper red black tree. |
| 122 | // __root == nullptr is a proper tree. Returns true is __root is a proper |
| 123 | // red black tree, else returns false. |
| 124 | template <class _NodePtr> |
| 125 | bool |
| 126 | __tree_invariant(_NodePtr __root) |
| 127 | { |
| 128 | if (__root == nullptr) |
| 129 | return true; |
| 130 | // check __x->__parent_ consistency |
| 131 | if (__root->__parent_ == nullptr) |
| 132 | return false; |
| 133 | if (!_VSTDstd::__1::__tree_is_left_child(__root)) |
| 134 | return false; |
| 135 | // root must be black |
| 136 | if (!__root->__is_black_) |
| 137 | return false; |
| 138 | // do normal node checks |
| 139 | return _VSTDstd::__1::__tree_sub_invariant(__root) != 0; |
| 140 | } |
| 141 | |
| 142 | // Returns: pointer to the left-most node under __x. |
| 143 | // Precondition: __x != nullptr. |
| 144 | template <class _NodePtr> |
| 145 | inline _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 146 | _NodePtr |
| 147 | __tree_min(_NodePtr __x) _NOEXCEPTnoexcept |
| 148 | { |
| 149 | while (__x->__left_ != nullptr) |
| 150 | __x = __x->__left_; |
| 151 | return __x; |
| 152 | } |
| 153 | |
| 154 | // Returns: pointer to the right-most node under __x. |
| 155 | // Precondition: __x != nullptr. |
| 156 | template <class _NodePtr> |
| 157 | inline _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 158 | _NodePtr |
| 159 | __tree_max(_NodePtr __x) _NOEXCEPTnoexcept |
| 160 | { |
| 161 | while (__x->__right_ != nullptr) |
| 162 | __x = __x->__right_; |
| 163 | return __x; |
| 164 | } |
| 165 | |
| 166 | // Returns: pointer to the next in-order node after __x. |
| 167 | // Precondition: __x != nullptr. |
| 168 | template <class _NodePtr> |
| 169 | _NodePtr |
| 170 | __tree_next(_NodePtr __x) _NOEXCEPTnoexcept |
| 171 | { |
| 172 | if (__x->__right_ != nullptr) |
| 173 | return _VSTDstd::__1::__tree_min(__x->__right_); |
| 174 | while (!_VSTDstd::__1::__tree_is_left_child(__x)) |
| 175 | __x = __x->__parent_unsafe(); |
| 176 | return __x->__parent_unsafe(); |
| 177 | } |
| 178 | |
| 179 | template <class _EndNodePtr, class _NodePtr> |
| 180 | inline _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 181 | _EndNodePtr |
| 182 | __tree_next_iter(_NodePtr __x) _NOEXCEPTnoexcept |
| 183 | { |
| 184 | if (__x->__right_ != nullptr) |
| 185 | return static_cast<_EndNodePtr>(_VSTDstd::__1::__tree_min(__x->__right_)); |
| 186 | while (!_VSTDstd::__1::__tree_is_left_child(__x)) |
| 187 | __x = __x->__parent_unsafe(); |
| 188 | return static_cast<_EndNodePtr>(__x->__parent_); |
| 189 | } |
| 190 | |
| 191 | // Returns: pointer to the previous in-order node before __x. |
| 192 | // Precondition: __x != nullptr. |
| 193 | // Note: __x may be the end node. |
| 194 | template <class _NodePtr, class _EndNodePtr> |
| 195 | inline _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 196 | _NodePtr |
| 197 | __tree_prev_iter(_EndNodePtr __x) _NOEXCEPTnoexcept |
| 198 | { |
| 199 | if (__x->__left_ != nullptr) |
| 200 | return _VSTDstd::__1::__tree_max(__x->__left_); |
| 201 | _NodePtr __xx = static_cast<_NodePtr>(__x); |
| 202 | while (_VSTDstd::__1::__tree_is_left_child(__xx)) |
| 203 | __xx = __xx->__parent_unsafe(); |
| 204 | return __xx->__parent_unsafe(); |
| 205 | } |
| 206 | |
| 207 | // Returns: pointer to a node which has no children |
| 208 | // Precondition: __x != nullptr. |
| 209 | template <class _NodePtr> |
| 210 | _NodePtr |
| 211 | __tree_leaf(_NodePtr __x) _NOEXCEPTnoexcept |
| 212 | { |
| 213 | while (true) |
| 214 | { |
| 215 | if (__x->__left_ != nullptr) |
| 216 | { |
| 217 | __x = __x->__left_; |
| 218 | continue; |
| 219 | } |
| 220 | if (__x->__right_ != nullptr) |
| 221 | { |
| 222 | __x = __x->__right_; |
| 223 | continue; |
| 224 | } |
| 225 | break; |
| 226 | } |
| 227 | return __x; |
| 228 | } |
| 229 | |
| 230 | // Effects: Makes __x->__right_ the subtree root with __x as its left child |
| 231 | // while preserving in-order order. |
| 232 | // Precondition: __x->__right_ != nullptr |
| 233 | template <class _NodePtr> |
| 234 | void |
| 235 | __tree_left_rotate(_NodePtr __x) _NOEXCEPTnoexcept |
| 236 | { |
| 237 | _NodePtr __y = __x->__right_; |
| 238 | __x->__right_ = __y->__left_; |
| 239 | if (__x->__right_ != nullptr) |
| 240 | __x->__right_->__set_parent(__x); |
| 241 | __y->__parent_ = __x->__parent_; |
| 242 | if (_VSTDstd::__1::__tree_is_left_child(__x)) |
| 243 | __x->__parent_->__left_ = __y; |
| 244 | else |
| 245 | __x->__parent_unsafe()->__right_ = __y; |
| 246 | __y->__left_ = __x; |
| 247 | __x->__set_parent(__y); |
| 248 | } |
| 249 | |
| 250 | // Effects: Makes __x->__left_ the subtree root with __x as its right child |
| 251 | // while preserving in-order order. |
| 252 | // Precondition: __x->__left_ != nullptr |
| 253 | template <class _NodePtr> |
| 254 | void |
| 255 | __tree_right_rotate(_NodePtr __x) _NOEXCEPTnoexcept |
| 256 | { |
| 257 | _NodePtr __y = __x->__left_; |
| 258 | __x->__left_ = __y->__right_; |
| 259 | if (__x->__left_ != nullptr) |
| 260 | __x->__left_->__set_parent(__x); |
| 261 | __y->__parent_ = __x->__parent_; |
| 262 | if (_VSTDstd::__1::__tree_is_left_child(__x)) |
| 263 | __x->__parent_->__left_ = __y; |
| 264 | else |
| 265 | __x->__parent_unsafe()->__right_ = __y; |
| 266 | __y->__right_ = __x; |
| 267 | __x->__set_parent(__y); |
| 268 | } |
| 269 | |
| 270 | // Effects: Rebalances __root after attaching __x to a leaf. |
| 271 | // Precondition: __root != nulptr && __x != nullptr. |
| 272 | // __x has no children. |
| 273 | // __x == __root or == a direct or indirect child of __root. |
| 274 | // If __x were to be unlinked from __root (setting __root to |
| 275 | // nullptr if __root == __x), __tree_invariant(__root) == true. |
| 276 | // Postcondition: __tree_invariant(end_node->__left_) == true. end_node->__left_ |
| 277 | // may be different than the value passed in as __root. |
| 278 | template <class _NodePtr> |
| 279 | void |
| 280 | __tree_balance_after_insert(_NodePtr __root, _NodePtr __x) _NOEXCEPTnoexcept |
| 281 | { |
| 282 | __x->__is_black_ = __x == __root; |
| 283 | while (__x != __root && !__x->__parent_unsafe()->__is_black_) |
| 284 | { |
| 285 | // __x->__parent_ != __root because __x->__parent_->__is_black == false |
| 286 | if (_VSTDstd::__1::__tree_is_left_child(__x->__parent_unsafe())) |
| 287 | { |
| 288 | _NodePtr __y = __x->__parent_unsafe()->__parent_unsafe()->__right_; |
| 289 | if (__y != nullptr && !__y->__is_black_) |
| 290 | { |
| 291 | __x = __x->__parent_unsafe(); |
| 292 | __x->__is_black_ = true; |
| 293 | __x = __x->__parent_unsafe(); |
| 294 | __x->__is_black_ = __x == __root; |
| 295 | __y->__is_black_ = true; |
| 296 | } |
| 297 | else |
| 298 | { |
| 299 | if (!_VSTDstd::__1::__tree_is_left_child(__x)) |
| 300 | { |
| 301 | __x = __x->__parent_unsafe(); |
| 302 | _VSTDstd::__1::__tree_left_rotate(__x); |
| 303 | } |
| 304 | __x = __x->__parent_unsafe(); |
| 305 | __x->__is_black_ = true; |
| 306 | __x = __x->__parent_unsafe(); |
| 307 | __x->__is_black_ = false; |
| 308 | _VSTDstd::__1::__tree_right_rotate(__x); |
| 309 | break; |
| 310 | } |
| 311 | } |
| 312 | else |
| 313 | { |
| 314 | _NodePtr __y = __x->__parent_unsafe()->__parent_->__left_; |
| 315 | if (__y != nullptr && !__y->__is_black_) |
| 316 | { |
| 317 | __x = __x->__parent_unsafe(); |
| 318 | __x->__is_black_ = true; |
| 319 | __x = __x->__parent_unsafe(); |
| 320 | __x->__is_black_ = __x == __root; |
| 321 | __y->__is_black_ = true; |
| 322 | } |
| 323 | else |
| 324 | { |
| 325 | if (_VSTDstd::__1::__tree_is_left_child(__x)) |
| 326 | { |
| 327 | __x = __x->__parent_unsafe(); |
| 328 | _VSTDstd::__1::__tree_right_rotate(__x); |
| 329 | } |
| 330 | __x = __x->__parent_unsafe(); |
| 331 | __x->__is_black_ = true; |
| 332 | __x = __x->__parent_unsafe(); |
| 333 | __x->__is_black_ = false; |
| 334 | _VSTDstd::__1::__tree_left_rotate(__x); |
| 335 | break; |
| 336 | } |
| 337 | } |
| 338 | } |
| 339 | } |
| 340 | |
| 341 | // Precondition: __root != nullptr && __z != nullptr. |
| 342 | // __tree_invariant(__root) == true. |
| 343 | // __z == __root or == a direct or indirect child of __root. |
| 344 | // Effects: unlinks __z from the tree rooted at __root, rebalancing as needed. |
| 345 | // Postcondition: __tree_invariant(end_node->__left_) == true && end_node->__left_ |
| 346 | // nor any of its children refer to __z. end_node->__left_ |
| 347 | // may be different than the value passed in as __root. |
| 348 | template <class _NodePtr> |
| 349 | void |
| 350 | __tree_remove(_NodePtr __root, _NodePtr __z) _NOEXCEPTnoexcept |
| 351 | { |
| 352 | // __z will be removed from the tree. Client still needs to destruct/deallocate it |
| 353 | // __y is either __z, or if __z has two children, __tree_next(__z). |
| 354 | // __y will have at most one child. |
| 355 | // __y will be the initial hole in the tree (make the hole at a leaf) |
| 356 | _NodePtr __y = (__z->__left_ == nullptr || __z->__right_ == nullptr) ? |
| 357 | __z : _VSTDstd::__1::__tree_next(__z); |
| 358 | // __x is __y's possibly null single child |
| 359 | _NodePtr __x = __y->__left_ != nullptr ? __y->__left_ : __y->__right_; |
| 360 | // __w is __x's possibly null uncle (will become __x's sibling) |
| 361 | _NodePtr __w = nullptr; |
| 362 | // link __x to __y's parent, and find __w |
| 363 | if (__x != nullptr) |
| 364 | __x->__parent_ = __y->__parent_; |
| 365 | if (_VSTDstd::__1::__tree_is_left_child(__y)) |
| 366 | { |
| 367 | __y->__parent_->__left_ = __x; |
| 368 | if (__y != __root) |
| 369 | __w = __y->__parent_unsafe()->__right_; |
| 370 | else |
| 371 | __root = __x; // __w == nullptr |
| 372 | } |
| 373 | else |
| 374 | { |
| 375 | __y->__parent_unsafe()->__right_ = __x; |
| 376 | // __y can't be root if it is a right child |
| 377 | __w = __y->__parent_->__left_; |
| 378 | } |
| 379 | bool __removed_black = __y->__is_black_; |
| 380 | // If we didn't remove __z, do so now by splicing in __y for __z, |
| 381 | // but copy __z's color. This does not impact __x or __w. |
| 382 | if (__y != __z) |
| 383 | { |
| 384 | // __z->__left_ != nulptr but __z->__right_ might == __x == nullptr |
| 385 | __y->__parent_ = __z->__parent_; |
| 386 | if (_VSTDstd::__1::__tree_is_left_child(__z)) |
| 387 | __y->__parent_->__left_ = __y; |
| 388 | else |
| 389 | __y->__parent_unsafe()->__right_ = __y; |
| 390 | __y->__left_ = __z->__left_; |
| 391 | __y->__left_->__set_parent(__y); |
| 392 | __y->__right_ = __z->__right_; |
| 393 | if (__y->__right_ != nullptr) |
| 394 | __y->__right_->__set_parent(__y); |
| 395 | __y->__is_black_ = __z->__is_black_; |
| 396 | if (__root == __z) |
| 397 | __root = __y; |
| 398 | } |
| 399 | // There is no need to rebalance if we removed a red, or if we removed |
| 400 | // the last node. |
| 401 | if (__removed_black && __root != nullptr) |
| 402 | { |
| 403 | // Rebalance: |
| 404 | // __x has an implicit black color (transferred from the removed __y) |
| 405 | // associated with it, no matter what its color is. |
| 406 | // If __x is __root (in which case it can't be null), it is supposed |
| 407 | // to be black anyway, and if it is doubly black, then the double |
| 408 | // can just be ignored. |
| 409 | // If __x is red (in which case it can't be null), then it can absorb |
| 410 | // the implicit black just by setting its color to black. |
| 411 | // Since __y was black and only had one child (which __x points to), __x |
| 412 | // is either red with no children, else null, otherwise __y would have |
| 413 | // different black heights under left and right pointers. |
| 414 | // if (__x == __root || __x != nullptr && !__x->__is_black_) |
| 415 | if (__x != nullptr) |
| 416 | __x->__is_black_ = true; |
| 417 | else |
| 418 | { |
| 419 | // Else __x isn't root, and is "doubly black", even though it may |
| 420 | // be null. __w can not be null here, else the parent would |
| 421 | // see a black height >= 2 on the __x side and a black height |
| 422 | // of 1 on the __w side (__w must be a non-null black or a red |
| 423 | // with a non-null black child). |
| 424 | while (true) |
| 425 | { |
| 426 | if (!_VSTDstd::__1::__tree_is_left_child(__w)) // if x is left child |
| 427 | { |
| 428 | if (!__w->__is_black_) |
| 429 | { |
| 430 | __w->__is_black_ = true; |
| 431 | __w->__parent_unsafe()->__is_black_ = false; |
| 432 | _VSTDstd::__1::__tree_left_rotate(__w->__parent_unsafe()); |
| 433 | // __x is still valid |
| 434 | // reset __root only if necessary |
| 435 | if (__root == __w->__left_) |
| 436 | __root = __w; |
| 437 | // reset sibling, and it still can't be null |
| 438 | __w = __w->__left_->__right_; |
| 439 | } |
| 440 | // __w->__is_black_ is now true, __w may have null children |
| 441 | if ((__w->__left_ == nullptr || __w->__left_->__is_black_) && |
| 442 | (__w->__right_ == nullptr || __w->__right_->__is_black_)) |
| 443 | { |
| 444 | __w->__is_black_ = false; |
| 445 | __x = __w->__parent_unsafe(); |
| 446 | // __x can no longer be null |
| 447 | if (__x == __root || !__x->__is_black_) |
| 448 | { |
| 449 | __x->__is_black_ = true; |
| 450 | break; |
| 451 | } |
| 452 | // reset sibling, and it still can't be null |
| 453 | __w = _VSTDstd::__1::__tree_is_left_child(__x) ? |
| 454 | __x->__parent_unsafe()->__right_ : |
| 455 | __x->__parent_->__left_; |
| 456 | // continue; |
| 457 | } |
| 458 | else // __w has a red child |
| 459 | { |
| 460 | if (__w->__right_ == nullptr || __w->__right_->__is_black_) |
| 461 | { |
| 462 | // __w left child is non-null and red |
| 463 | __w->__left_->__is_black_ = true; |
| 464 | __w->__is_black_ = false; |
| 465 | _VSTDstd::__1::__tree_right_rotate(__w); |
| 466 | // __w is known not to be root, so root hasn't changed |
| 467 | // reset sibling, and it still can't be null |
| 468 | __w = __w->__parent_unsafe(); |
| 469 | } |
| 470 | // __w has a right red child, left child may be null |
| 471 | __w->__is_black_ = __w->__parent_unsafe()->__is_black_; |
| 472 | __w->__parent_unsafe()->__is_black_ = true; |
| 473 | __w->__right_->__is_black_ = true; |
| 474 | _VSTDstd::__1::__tree_left_rotate(__w->__parent_unsafe()); |
| 475 | break; |
| 476 | } |
| 477 | } |
| 478 | else |
| 479 | { |
| 480 | if (!__w->__is_black_) |
| 481 | { |
| 482 | __w->__is_black_ = true; |
| 483 | __w->__parent_unsafe()->__is_black_ = false; |
| 484 | _VSTDstd::__1::__tree_right_rotate(__w->__parent_unsafe()); |
| 485 | // __x is still valid |
| 486 | // reset __root only if necessary |
| 487 | if (__root == __w->__right_) |
| 488 | __root = __w; |
| 489 | // reset sibling, and it still can't be null |
| 490 | __w = __w->__right_->__left_; |
| 491 | } |
| 492 | // __w->__is_black_ is now true, __w may have null children |
| 493 | if ((__w->__left_ == nullptr || __w->__left_->__is_black_) && |
| 494 | (__w->__right_ == nullptr || __w->__right_->__is_black_)) |
| 495 | { |
| 496 | __w->__is_black_ = false; |
| 497 | __x = __w->__parent_unsafe(); |
| 498 | // __x can no longer be null |
| 499 | if (!__x->__is_black_ || __x == __root) |
| 500 | { |
| 501 | __x->__is_black_ = true; |
| 502 | break; |
| 503 | } |
| 504 | // reset sibling, and it still can't be null |
| 505 | __w = _VSTDstd::__1::__tree_is_left_child(__x) ? |
| 506 | __x->__parent_unsafe()->__right_ : |
| 507 | __x->__parent_->__left_; |
| 508 | // continue; |
| 509 | } |
| 510 | else // __w has a red child |
| 511 | { |
| 512 | if (__w->__left_ == nullptr || __w->__left_->__is_black_) |
| 513 | { |
| 514 | // __w right child is non-null and red |
| 515 | __w->__right_->__is_black_ = true; |
| 516 | __w->__is_black_ = false; |
| 517 | _VSTDstd::__1::__tree_left_rotate(__w); |
| 518 | // __w is known not to be root, so root hasn't changed |
| 519 | // reset sibling, and it still can't be null |
| 520 | __w = __w->__parent_unsafe(); |
| 521 | } |
| 522 | // __w has a left red child, right child may be null |
| 523 | __w->__is_black_ = __w->__parent_unsafe()->__is_black_; |
| 524 | __w->__parent_unsafe()->__is_black_ = true; |
| 525 | __w->__left_->__is_black_ = true; |
| 526 | _VSTDstd::__1::__tree_right_rotate(__w->__parent_unsafe()); |
| 527 | break; |
| 528 | } |
| 529 | } |
| 530 | } |
| 531 | } |
| 532 | } |
| 533 | } |
| 534 | |
| 535 | // node traits |
| 536 | |
| 537 | |
| 538 | template <class _Tp> |
| 539 | struct __is_tree_value_type_imp : false_type {}; |
| 540 | |
| 541 | template <class _Key, class _Value> |
| 542 | struct __is_tree_value_type_imp<__value_type<_Key, _Value> > : true_type {}; |
| 543 | |
| 544 | template <class ..._Args> |
| 545 | struct __is_tree_value_type : false_type {}; |
| 546 | |
| 547 | template <class _One> |
| 548 | struct __is_tree_value_type<_One> : __is_tree_value_type_imp<typename __uncvref<_One>::type> {}; |
| 549 | |
| 550 | template <class _Tp> |
| 551 | struct __tree_key_value_types { |
| 552 | typedef _Tp key_type; |
| 553 | typedef _Tp __node_value_type; |
| 554 | typedef _Tp __container_value_type; |
| 555 | static const bool __is_map = false; |
| 556 | |
| 557 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 558 | static key_type const& __get_key(_Tp const& __v) { |
| 559 | return __v; |
| 560 | } |
| 561 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 562 | static __container_value_type const& __get_value(__node_value_type const& __v) { |
| 563 | return __v; |
| 564 | } |
| 565 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 566 | static __container_value_type* __get_ptr(__node_value_type& __n) { |
| 567 | return _VSTDstd::__1::addressof(__n); |
| 568 | } |
| 569 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 570 | static __container_value_type&& __move(__node_value_type& __v) { |
| 571 | return _VSTDstd::__1::move(__v); |
| 572 | } |
| 573 | }; |
| 574 | |
| 575 | template <class _Key, class _Tp> |
| 576 | struct __tree_key_value_types<__value_type<_Key, _Tp> > { |
| 577 | typedef _Key key_type; |
| 578 | typedef _Tp mapped_type; |
| 579 | typedef __value_type<_Key, _Tp> __node_value_type; |
| 580 | typedef pair<const _Key, _Tp> __container_value_type; |
| 581 | typedef __container_value_type __map_value_type; |
| 582 | static const bool __is_map = true; |
| 583 | |
| 584 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 585 | static key_type const& |
| 586 | __get_key(__node_value_type const& __t) { |
| 587 | return __t.__get_value().first; |
| 588 | } |
| 589 | |
| 590 | template <class _Up> |
| 591 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 592 | static typename enable_if<__is_same_uncvref<_Up, __container_value_type>::value, |
| 593 | key_type const&>::type |
| 594 | __get_key(_Up& __t) { |
| 595 | return __t.first; |
| 596 | } |
| 597 | |
| 598 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 599 | static __container_value_type const& |
| 600 | __get_value(__node_value_type const& __t) { |
| 601 | return __t.__get_value(); |
| 602 | } |
| 603 | |
| 604 | template <class _Up> |
| 605 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 606 | static typename enable_if<__is_same_uncvref<_Up, __container_value_type>::value, |
| 607 | __container_value_type const&>::type |
| 608 | __get_value(_Up& __t) { |
| 609 | return __t; |
| 610 | } |
| 611 | |
| 612 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 613 | static __container_value_type* __get_ptr(__node_value_type& __n) { |
| 614 | return _VSTDstd::__1::addressof(__n.__get_value()); |
| 615 | } |
| 616 | |
| 617 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 618 | static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) { |
| 619 | return __v.__move(); |
| 620 | } |
| 621 | }; |
| 622 | |
| 623 | template <class _VoidPtr> |
| 624 | struct __tree_node_base_types { |
| 625 | typedef _VoidPtr __void_pointer; |
| 626 | |
| 627 | typedef __tree_node_base<__void_pointer> __node_base_type; |
| 628 | typedef typename __rebind_pointer<_VoidPtr, __node_base_type>::type |
| 629 | __node_base_pointer; |
| 630 | |
| 631 | typedef __tree_end_node<__node_base_pointer> __end_node_type; |
| 632 | typedef typename __rebind_pointer<_VoidPtr, __end_node_type>::type |
| 633 | __end_node_pointer; |
| 634 | #if defined(_LIBCPP_ABI_TREE_REMOVE_NODE_POINTER_UB) |
| 635 | typedef __end_node_pointer __parent_pointer; |
| 636 | #else |
| 637 | typedef typename conditional< |
| 638 | is_pointer<__end_node_pointer>::value, |
| 639 | __end_node_pointer, |
| 640 | __node_base_pointer>::type __parent_pointer; |
| 641 | #endif |
| 642 | |
| 643 | private: |
| 644 | static_assert((is_same<typename pointer_traits<_VoidPtr>::element_type, void>::value), |
| 645 | "_VoidPtr does not point to unqualified void type"); |
| 646 | }; |
| 647 | |
| 648 | template <class _Tp, class _AllocPtr, class _KVTypes = __tree_key_value_types<_Tp>, |
| 649 | bool = _KVTypes::__is_map> |
| 650 | struct __tree_map_pointer_types {}; |
| 651 | |
| 652 | template <class _Tp, class _AllocPtr, class _KVTypes> |
| 653 | struct __tree_map_pointer_types<_Tp, _AllocPtr, _KVTypes, true> { |
| 654 | typedef typename _KVTypes::__map_value_type _Mv; |
| 655 | typedef typename __rebind_pointer<_AllocPtr, _Mv>::type |
| 656 | __map_value_type_pointer; |
| 657 | typedef typename __rebind_pointer<_AllocPtr, const _Mv>::type |
| 658 | __const_map_value_type_pointer; |
| 659 | }; |
| 660 | |
| 661 | template <class _NodePtr, class _NodeT = typename pointer_traits<_NodePtr>::element_type> |
| 662 | struct __tree_node_types; |
| 663 | |
| 664 | template <class _NodePtr, class _Tp, class _VoidPtr> |
| 665 | struct __tree_node_types<_NodePtr, __tree_node<_Tp, _VoidPtr> > |
| 666 | : public __tree_node_base_types<_VoidPtr>, |
| 667 | __tree_key_value_types<_Tp>, |
| 668 | __tree_map_pointer_types<_Tp, _VoidPtr> |
| 669 | { |
| 670 | typedef __tree_node_base_types<_VoidPtr> __base; |
| 671 | typedef __tree_key_value_types<_Tp> __key_base; |
| 672 | typedef __tree_map_pointer_types<_Tp, _VoidPtr> __map_pointer_base; |
| 673 | public: |
| 674 | |
| 675 | typedef typename pointer_traits<_NodePtr>::element_type __node_type; |
| 676 | typedef _NodePtr __node_pointer; |
| 677 | |
| 678 | typedef _Tp __node_value_type; |
| 679 | typedef typename __rebind_pointer<_VoidPtr, __node_value_type>::type |
| 680 | __node_value_type_pointer; |
| 681 | typedef typename __rebind_pointer<_VoidPtr, const __node_value_type>::type |
| 682 | __const_node_value_type_pointer; |
| 683 | #if defined(_LIBCPP_ABI_TREE_REMOVE_NODE_POINTER_UB) |
| 684 | typedef typename __base::__end_node_pointer __iter_pointer; |
| 685 | #else |
| 686 | typedef typename conditional< |
| 687 | is_pointer<__node_pointer>::value, |
| 688 | typename __base::__end_node_pointer, |
| 689 | __node_pointer>::type __iter_pointer; |
| 690 | #endif |
| 691 | private: |
| 692 | static_assert(!is_const<__node_type>::value, |
| 693 | "_NodePtr should never be a pointer to const"); |
| 694 | static_assert((is_same<typename __rebind_pointer<_VoidPtr, __node_type>::type, |
| 695 | _NodePtr>::value), "_VoidPtr does not rebind to _NodePtr."); |
| 696 | }; |
| 697 | |
| 698 | template <class _ValueTp, class _VoidPtr> |
| 699 | struct __make_tree_node_types { |
| 700 | typedef typename __rebind_pointer<_VoidPtr, __tree_node<_ValueTp, _VoidPtr> >::type |
| 701 | _NodePtr; |
| 702 | typedef __tree_node_types<_NodePtr> type; |
| 703 | }; |
| 704 | |
| 705 | // node |
| 706 | |
| 707 | template <class _Pointer> |
| 708 | class __tree_end_node |
| 709 | { |
| 710 | public: |
| 711 | typedef _Pointer pointer; |
| 712 | pointer __left_; |
| 713 | |
| 714 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 715 | __tree_end_node() _NOEXCEPTnoexcept : __left_() {} |
| 716 | }; |
| 717 | |
| 718 | template <class _VoidPtr> |
| 719 | class _LIBCPP_STANDALONE_DEBUG__attribute__((__standalone_debug__)) __tree_node_base |
| 720 | : public __tree_node_base_types<_VoidPtr>::__end_node_type |
| 721 | { |
| 722 | typedef __tree_node_base_types<_VoidPtr> _NodeBaseTypes; |
| 723 | |
| 724 | public: |
| 725 | typedef typename _NodeBaseTypes::__node_base_pointer pointer; |
| 726 | typedef typename _NodeBaseTypes::__parent_pointer __parent_pointer; |
| 727 | |
| 728 | pointer __right_; |
| 729 | __parent_pointer __parent_; |
| 730 | bool __is_black_; |
| 731 | |
| 732 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 733 | pointer __parent_unsafe() const { return static_cast<pointer>(__parent_);} |
| 734 | |
| 735 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 736 | void __set_parent(pointer __p) { |
| 737 | __parent_ = static_cast<__parent_pointer>(__p); |
| 738 | } |
| 739 | |
| 740 | private: |
| 741 | ~__tree_node_base() _LIBCPP_EQUAL_DELETE= delete; |
| 742 | __tree_node_base(__tree_node_base const&) _LIBCPP_EQUAL_DELETE= delete; |
| 743 | __tree_node_base& operator=(__tree_node_base const&) _LIBCPP_EQUAL_DELETE= delete; |
| 744 | }; |
| 745 | |
| 746 | template <class _Tp, class _VoidPtr> |
| 747 | class _LIBCPP_STANDALONE_DEBUG__attribute__((__standalone_debug__)) __tree_node |
| 748 | : public __tree_node_base<_VoidPtr> |
| 749 | { |
| 750 | public: |
| 751 | typedef _Tp __node_value_type; |
| 752 | |
| 753 | __node_value_type __value_; |
| 754 | |
| 755 | private: |
| 756 | ~__tree_node() _LIBCPP_EQUAL_DELETE= delete; |
| 757 | __tree_node(__tree_node const&) _LIBCPP_EQUAL_DELETE= delete; |
| 758 | __tree_node& operator=(__tree_node const&) _LIBCPP_EQUAL_DELETE= delete; |
| 759 | }; |
| 760 | |
| 761 | |
| 762 | template <class _Allocator> |
| 763 | class __tree_node_destructor |
| 764 | { |
| 765 | typedef _Allocator allocator_type; |
| 766 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 767 | |
| 768 | public: |
| 769 | typedef typename __alloc_traits::pointer pointer; |
| 770 | private: |
| 771 | typedef __tree_node_types<pointer> _NodeTypes; |
| 772 | allocator_type& __na_; |
| 773 | |
| 774 | |
| 775 | public: |
| 776 | bool __value_constructed; |
| 777 | |
| 778 | |
| 779 | __tree_node_destructor(const __tree_node_destructor &) = default; |
| 780 | __tree_node_destructor& operator=(const __tree_node_destructor&) = delete; |
| 781 | |
| 782 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 783 | explicit __tree_node_destructor(allocator_type& __na, bool __val = false) _NOEXCEPTnoexcept |
| 784 | : __na_(__na), |
| 785 | __value_constructed(__val) |
| 786 | {} |
| 787 | |
| 788 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 789 | void operator()(pointer __p) _NOEXCEPTnoexcept |
| 790 | { |
| 791 | if (__value_constructed) |
| 792 | __alloc_traits::destroy(__na_, _NodeTypes::__get_ptr(__p->__value_)); |
| 793 | if (__p) |
| 794 | __alloc_traits::deallocate(__na_, __p, 1); |
| 795 | } |
| 796 | |
| 797 | template <class> friend class __map_node_destructor; |
| 798 | }; |
| 799 | |
| 800 | #if _LIBCPP_STD_VER14 > 14 |
| 801 | template <class _NodeType, class _Alloc> |
| 802 | struct __generic_container_node_destructor; |
| 803 | template <class _Tp, class _VoidPtr, class _Alloc> |
| 804 | struct __generic_container_node_destructor<__tree_node<_Tp, _VoidPtr>, _Alloc> |
| 805 | : __tree_node_destructor<_Alloc> |
| 806 | { |
| 807 | using __tree_node_destructor<_Alloc>::__tree_node_destructor; |
| 808 | }; |
| 809 | #endif |
| 810 | |
| 811 | template <class _Tp, class _NodePtr, class _DiffType> |
| 812 | class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __tree_iterator |
| 813 | { |
| 814 | typedef __tree_node_types<_NodePtr> _NodeTypes; |
| 815 | typedef _NodePtr __node_pointer; |
| 816 | typedef typename _NodeTypes::__node_base_pointer __node_base_pointer; |
| 817 | typedef typename _NodeTypes::__end_node_pointer __end_node_pointer; |
| 818 | typedef typename _NodeTypes::__iter_pointer __iter_pointer; |
| 819 | typedef pointer_traits<__node_pointer> __pointer_traits; |
| 820 | |
| 821 | __iter_pointer __ptr_; |
| 822 | |
| 823 | public: |
| 824 | typedef bidirectional_iterator_tag iterator_category; |
| 825 | typedef _Tp value_type; |
| 826 | typedef _DiffType difference_type; |
| 827 | typedef value_type& reference; |
| 828 | typedef typename _NodeTypes::__node_value_type_pointer pointer; |
| 829 | |
| 830 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) __tree_iterator() _NOEXCEPTnoexcept |
| 831 | #if _LIBCPP_STD_VER14 > 11 |
| 832 | : __ptr_(nullptr) |
| 833 | #endif |
| 834 | {} |
| 835 | |
| 836 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) reference operator*() const |
| 837 | {return __get_np()->__value_;} |
| 838 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) pointer operator->() const |
| 839 | {return pointer_traits<pointer>::pointer_to(__get_np()->__value_);} |
| 840 | |
| 841 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 842 | __tree_iterator& operator++() { |
| 843 | __ptr_ = static_cast<__iter_pointer>( |
| 844 | _VSTDstd::__1::__tree_next_iter<__end_node_pointer>(static_cast<__node_base_pointer>(__ptr_))); |
| 845 | return *this; |
| 846 | } |
| 847 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 848 | __tree_iterator operator++(int) |
| 849 | {__tree_iterator __t(*this); ++(*this); return __t;} |
| 850 | |
| 851 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 852 | __tree_iterator& operator--() { |
| 853 | __ptr_ = static_cast<__iter_pointer>(_VSTDstd::__1::__tree_prev_iter<__node_base_pointer>( |
| 854 | static_cast<__end_node_pointer>(__ptr_))); |
| 855 | return *this; |
| 856 | } |
| 857 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 858 | __tree_iterator operator--(int) |
| 859 | {__tree_iterator __t(*this); --(*this); return __t;} |
| 860 | |
| 861 | friend _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 862 | bool operator==(const __tree_iterator& __x, const __tree_iterator& __y) |
| 863 | {return __x.__ptr_ == __y.__ptr_;} |
| 864 | friend _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 865 | bool operator!=(const __tree_iterator& __x, const __tree_iterator& __y) |
| 866 | {return !(__x == __y);} |
| 867 | |
| 868 | private: |
| 869 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 870 | explicit __tree_iterator(__node_pointer __p) _NOEXCEPTnoexcept : __ptr_(__p) {} |
| 871 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 872 | explicit __tree_iterator(__end_node_pointer __p) _NOEXCEPTnoexcept : __ptr_(__p) {} |
| 873 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 874 | __node_pointer __get_np() const { return static_cast<__node_pointer>(__ptr_); } |
| 875 | template <class, class, class> friend class __tree; |
| 876 | template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __tree_const_iterator; |
| 877 | template <class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __map_iterator; |
| 878 | template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) map; |
| 879 | template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multimap; |
| 880 | template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) set; |
| 881 | template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multiset; |
| 882 | }; |
| 883 | |
| 884 | template <class _Tp, class _NodePtr, class _DiffType> |
| 885 | class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __tree_const_iterator |
| 886 | { |
| 887 | typedef __tree_node_types<_NodePtr> _NodeTypes; |
| 888 | typedef typename _NodeTypes::__node_pointer __node_pointer; |
| 889 | typedef typename _NodeTypes::__node_base_pointer __node_base_pointer; |
| 890 | typedef typename _NodeTypes::__end_node_pointer __end_node_pointer; |
| 891 | typedef typename _NodeTypes::__iter_pointer __iter_pointer; |
| 892 | typedef pointer_traits<__node_pointer> __pointer_traits; |
| 893 | |
| 894 | __iter_pointer __ptr_; |
| 895 | |
| 896 | public: |
| 897 | typedef bidirectional_iterator_tag iterator_category; |
| 898 | typedef _Tp value_type; |
| 899 | typedef _DiffType difference_type; |
| 900 | typedef const value_type& reference; |
| 901 | typedef typename _NodeTypes::__const_node_value_type_pointer pointer; |
| 902 | |
| 903 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) __tree_const_iterator() _NOEXCEPTnoexcept |
| 904 | #if _LIBCPP_STD_VER14 > 11 |
| 905 | : __ptr_(nullptr) |
| 906 | #endif |
| 907 | {} |
| 908 | |
| 909 | private: |
| 910 | typedef __tree_iterator<value_type, __node_pointer, difference_type> |
| 911 | __non_const_iterator; |
| 912 | public: |
| 913 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 914 | __tree_const_iterator(__non_const_iterator __p) _NOEXCEPTnoexcept |
| 915 | : __ptr_(__p.__ptr_) {} |
| 916 | |
| 917 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) reference operator*() const |
| 918 | {return __get_np()->__value_;} |
| 919 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) pointer operator->() const |
| 920 | {return pointer_traits<pointer>::pointer_to(__get_np()->__value_);} |
| 921 | |
| 922 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 923 | __tree_const_iterator& operator++() { |
| 924 | __ptr_ = static_cast<__iter_pointer>( |
| 925 | _VSTDstd::__1::__tree_next_iter<__end_node_pointer>(static_cast<__node_base_pointer>(__ptr_))); |
| 926 | return *this; |
| 927 | } |
| 928 | |
| 929 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 930 | __tree_const_iterator operator++(int) |
| 931 | {__tree_const_iterator __t(*this); ++(*this); return __t;} |
| 932 | |
| 933 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 934 | __tree_const_iterator& operator--() { |
| 935 | __ptr_ = static_cast<__iter_pointer>(_VSTDstd::__1::__tree_prev_iter<__node_base_pointer>( |
| 936 | static_cast<__end_node_pointer>(__ptr_))); |
| 937 | return *this; |
| 938 | } |
| 939 | |
| 940 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 941 | __tree_const_iterator operator--(int) |
| 942 | {__tree_const_iterator __t(*this); --(*this); return __t;} |
| 943 | |
| 944 | friend _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 945 | bool operator==(const __tree_const_iterator& __x, const __tree_const_iterator& __y) |
| 946 | {return __x.__ptr_ == __y.__ptr_;} |
| 947 | friend _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 948 | bool operator!=(const __tree_const_iterator& __x, const __tree_const_iterator& __y) |
| 949 | {return !(__x == __y);} |
| 950 | |
| 951 | private: |
| 952 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 953 | explicit __tree_const_iterator(__node_pointer __p) _NOEXCEPTnoexcept |
| 954 | : __ptr_(__p) {} |
| 955 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 956 | explicit __tree_const_iterator(__end_node_pointer __p) _NOEXCEPTnoexcept |
| 957 | : __ptr_(__p) {} |
| 958 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 959 | __node_pointer __get_np() const { return static_cast<__node_pointer>(__ptr_); } |
| 960 | |
| 961 | template <class, class, class> friend class __tree; |
| 962 | template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) map; |
| 963 | template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multimap; |
| 964 | template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) set; |
| 965 | template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multiset; |
| 966 | template <class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) __map_const_iterator; |
| 967 | |
| 968 | }; |
| 969 | |
| 970 | template<class _Tp, class _Compare> |
| 971 | #ifndef _LIBCPP_CXX03_LANG |
| 972 | _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Compare const&, _Tp const&, _Tp const&>::value,__attribute__((diagnose_if(!__invokable<_Compare const& , _Tp const&, _Tp const&>::value, "the specified comparator type does not provide a viable const call operator" , "warning"))) |
| 973 | "the specified comparator type does not provide a viable const call operator")__attribute__((diagnose_if(!__invokable<_Compare const& , _Tp const&, _Tp const&>::value, "the specified comparator type does not provide a viable const call operator" , "warning"))) |
| 974 | #endif |
| 975 | int __diagnose_non_const_comparator(); |
| 976 | |
| 977 | template <class _Tp, class _Compare, class _Allocator> |
| 978 | class __tree |
| 979 | { |
| 980 | public: |
| 981 | typedef _Tp value_type; |
| 982 | typedef _Compare value_compare; |
| 983 | typedef _Allocator allocator_type; |
| 984 | |
| 985 | private: |
| 986 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 987 | typedef typename __make_tree_node_types<value_type, |
| 988 | typename __alloc_traits::void_pointer>::type |
| 989 | _NodeTypes; |
| 990 | typedef typename _NodeTypes::key_type key_type; |
| 991 | public: |
| 992 | typedef typename _NodeTypes::__node_value_type __node_value_type; |
| 993 | typedef typename _NodeTypes::__container_value_type __container_value_type; |
| 994 | |
| 995 | typedef typename __alloc_traits::pointer pointer; |
| 996 | typedef typename __alloc_traits::const_pointer const_pointer; |
| 997 | typedef typename __alloc_traits::size_type size_type; |
| 998 | typedef typename __alloc_traits::difference_type difference_type; |
| 999 | |
| 1000 | public: |
| 1001 | typedef typename _NodeTypes::__void_pointer __void_pointer; |
| 1002 | |
| 1003 | typedef typename _NodeTypes::__node_type __node; |
| 1004 | typedef typename _NodeTypes::__node_pointer __node_pointer; |
| 1005 | |
| 1006 | typedef typename _NodeTypes::__node_base_type __node_base; |
| 1007 | typedef typename _NodeTypes::__node_base_pointer __node_base_pointer; |
| 1008 | |
| 1009 | typedef typename _NodeTypes::__end_node_type __end_node_t; |
| 1010 | typedef typename _NodeTypes::__end_node_pointer __end_node_ptr; |
| 1011 | |
| 1012 | typedef typename _NodeTypes::__parent_pointer __parent_pointer; |
| 1013 | typedef typename _NodeTypes::__iter_pointer __iter_pointer; |
| 1014 | |
| 1015 | typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator; |
| 1016 | typedef allocator_traits<__node_allocator> __node_traits; |
| 1017 | |
| 1018 | private: |
| 1019 | // check for sane allocator pointer rebinding semantics. Rebinding the |
| 1020 | // allocator for a new pointer type should be exactly the same as rebinding |
| 1021 | // the pointer using 'pointer_traits'. |
| 1022 | static_assert((is_same<__node_pointer, typename __node_traits::pointer>::value), |
| 1023 | "Allocator does not rebind pointers in a sane manner."); |
| 1024 | typedef typename __rebind_alloc_helper<__node_traits, __node_base>::type |
| 1025 | __node_base_allocator; |
| 1026 | typedef allocator_traits<__node_base_allocator> __node_base_traits; |
| 1027 | static_assert((is_same<__node_base_pointer, typename __node_base_traits::pointer>::value), |
| 1028 | "Allocator does not rebind pointers in a sane manner."); |
| 1029 | |
| 1030 | private: |
| 1031 | __iter_pointer __begin_node_; |
| 1032 | __compressed_pair<__end_node_t, __node_allocator> __pair1_; |
| 1033 | __compressed_pair<size_type, value_compare> __pair3_; |
| 1034 | |
| 1035 | public: |
| 1036 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1037 | __iter_pointer __end_node() _NOEXCEPTnoexcept |
| 1038 | { |
| 1039 | return static_cast<__iter_pointer>( |
| 1040 | pointer_traits<__end_node_ptr>::pointer_to(__pair1_.first()) |
| 1041 | ); |
| 1042 | } |
| 1043 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1044 | __iter_pointer __end_node() const _NOEXCEPTnoexcept |
| 1045 | { |
| 1046 | return static_cast<__iter_pointer>( |
| 1047 | pointer_traits<__end_node_ptr>::pointer_to( |
| 1048 | const_cast<__end_node_t&>(__pair1_.first()) |
| 1049 | ) |
| 1050 | ); |
| 1051 | } |
| 1052 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1053 | __node_allocator& __node_alloc() _NOEXCEPTnoexcept {return __pair1_.second();} |
| 1054 | private: |
| 1055 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1056 | const __node_allocator& __node_alloc() const _NOEXCEPTnoexcept |
| 1057 | {return __pair1_.second();} |
| 1058 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1059 | __iter_pointer& __begin_node() _NOEXCEPTnoexcept {return __begin_node_;} |
| 1060 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1061 | const __iter_pointer& __begin_node() const _NOEXCEPTnoexcept {return __begin_node_;} |
| 1062 | public: |
| 1063 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1064 | allocator_type __alloc() const _NOEXCEPTnoexcept |
| 1065 | {return allocator_type(__node_alloc());} |
| 1066 | private: |
| 1067 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1068 | size_type& size() _NOEXCEPTnoexcept {return __pair3_.first();} |
| 1069 | public: |
| 1070 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1071 | const size_type& size() const _NOEXCEPTnoexcept {return __pair3_.first();} |
| 1072 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1073 | value_compare& value_comp() _NOEXCEPTnoexcept {return __pair3_.second();} |
| 1074 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1075 | const value_compare& value_comp() const _NOEXCEPTnoexcept |
| 1076 | {return __pair3_.second();} |
| 1077 | public: |
| 1078 | |
| 1079 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1080 | __node_pointer __root() const _NOEXCEPTnoexcept |
| 1081 | {return static_cast<__node_pointer>(__end_node()->__left_);} |
| 1082 | |
| 1083 | __node_base_pointer* __root_ptr() const _NOEXCEPTnoexcept { |
| 1084 | return _VSTDstd::__1::addressof(__end_node()->__left_); |
| 1085 | } |
| 1086 | |
| 1087 | typedef __tree_iterator<value_type, __node_pointer, difference_type> iterator; |
| 1088 | typedef __tree_const_iterator<value_type, __node_pointer, difference_type> const_iterator; |
| 1089 | |
| 1090 | explicit __tree(const value_compare& __comp) |
| 1091 | _NOEXCEPT_(noexcept(is_nothrow_default_constructible<__node_allocator >::value && is_nothrow_copy_constructible<value_compare >::value) |
| 1092 | is_nothrow_default_constructible<__node_allocator>::value &&noexcept(is_nothrow_default_constructible<__node_allocator >::value && is_nothrow_copy_constructible<value_compare >::value) |
| 1093 | is_nothrow_copy_constructible<value_compare>::value)noexcept(is_nothrow_default_constructible<__node_allocator >::value && is_nothrow_copy_constructible<value_compare >::value); |
| 1094 | explicit __tree(const allocator_type& __a); |
| 1095 | __tree(const value_compare& __comp, const allocator_type& __a); |
| 1096 | __tree(const __tree& __t); |
| 1097 | __tree& operator=(const __tree& __t); |
| 1098 | template <class _ForwardIterator> |
| 1099 | void __assign_unique(_ForwardIterator __first, _ForwardIterator __last); |
| 1100 | template <class _InputIterator> |
| 1101 | void __assign_multi(_InputIterator __first, _InputIterator __last); |
| 1102 | __tree(__tree&& __t) |
| 1103 | _NOEXCEPT_(noexcept(is_nothrow_move_constructible<__node_allocator> ::value && is_nothrow_move_constructible<value_compare >::value) |
| 1104 | is_nothrow_move_constructible<__node_allocator>::value &&noexcept(is_nothrow_move_constructible<__node_allocator> ::value && is_nothrow_move_constructible<value_compare >::value) |
| 1105 | is_nothrow_move_constructible<value_compare>::value)noexcept(is_nothrow_move_constructible<__node_allocator> ::value && is_nothrow_move_constructible<value_compare >::value); |
| 1106 | __tree(__tree&& __t, const allocator_type& __a); |
| 1107 | __tree& operator=(__tree&& __t) |
| 1108 | _NOEXCEPT_(noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1109 | __node_traits::propagate_on_container_move_assignment::value &&noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1110 | is_nothrow_move_assignable<value_compare>::value &&noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1111 | is_nothrow_move_assignable<__node_allocator>::value)noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value); |
| 1112 | ~__tree(); |
| 1113 | |
| 1114 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1115 | iterator begin() _NOEXCEPTnoexcept {return iterator(__begin_node());} |
| 1116 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1117 | const_iterator begin() const _NOEXCEPTnoexcept {return const_iterator(__begin_node());} |
| 1118 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1119 | iterator end() _NOEXCEPTnoexcept {return iterator(__end_node());} |
| 1120 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1121 | const_iterator end() const _NOEXCEPTnoexcept {return const_iterator(__end_node());} |
| 1122 | |
| 1123 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1124 | size_type max_size() const _NOEXCEPTnoexcept |
| 1125 | {return _VSTDstd::__1::min<size_type>( |
| 1126 | __node_traits::max_size(__node_alloc()), |
| 1127 | numeric_limits<difference_type >::max());} |
| 1128 | |
| 1129 | void clear() _NOEXCEPTnoexcept; |
| 1130 | |
| 1131 | void swap(__tree& __t) |
| 1132 | #if _LIBCPP_STD_VER14 <= 11 |
| 1133 | _NOEXCEPT_(noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1134 | __is_nothrow_swappable<value_compare>::valuenoexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1135 | && (!__node_traits::propagate_on_container_swap::value ||noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1136 | __is_nothrow_swappable<__node_allocator>::value)noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1137 | )noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)); |
| 1138 | #else |
| 1139 | _NOEXCEPT_(__is_nothrow_swappable<value_compare>::value)noexcept(__is_nothrow_swappable<value_compare>::value); |
| 1140 | #endif |
| 1141 | |
| 1142 | template <class _Key, class ..._Args> |
| 1143 | pair<iterator, bool> |
| 1144 | __emplace_unique_key_args(_Key const&, _Args&&... __args); |
| 1145 | template <class _Key, class ..._Args> |
| 1146 | pair<iterator, bool> |
| 1147 | __emplace_hint_unique_key_args(const_iterator, _Key const&, _Args&&...); |
| 1148 | |
| 1149 | template <class... _Args> |
| 1150 | pair<iterator, bool> __emplace_unique_impl(_Args&&... __args); |
| 1151 | |
| 1152 | template <class... _Args> |
| 1153 | iterator __emplace_hint_unique_impl(const_iterator __p, _Args&&... __args); |
| 1154 | |
| 1155 | template <class... _Args> |
| 1156 | iterator __emplace_multi(_Args&&... __args); |
| 1157 | |
| 1158 | template <class... _Args> |
| 1159 | iterator __emplace_hint_multi(const_iterator __p, _Args&&... __args); |
| 1160 | |
| 1161 | template <class _Pp> |
| 1162 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1163 | pair<iterator, bool> __emplace_unique(_Pp&& __x) { |
| 1164 | return __emplace_unique_extract_key(_VSTDstd::__1::forward<_Pp>(__x), |
| 1165 | __can_extract_key<_Pp, key_type>()); |
| 1166 | } |
| 1167 | |
| 1168 | template <class _First, class _Second> |
| 1169 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1170 | typename enable_if< |
| 1171 | __can_extract_map_key<_First, key_type, __container_value_type>::value, |
| 1172 | pair<iterator, bool> |
| 1173 | >::type __emplace_unique(_First&& __f, _Second&& __s) { |
| 1174 | return __emplace_unique_key_args(__f, _VSTDstd::__1::forward<_First>(__f), |
| 1175 | _VSTDstd::__1::forward<_Second>(__s)); |
| 1176 | } |
| 1177 | |
| 1178 | template <class... _Args> |
| 1179 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1180 | pair<iterator, bool> __emplace_unique(_Args&&... __args) { |
| 1181 | return __emplace_unique_impl(_VSTDstd::__1::forward<_Args>(__args)...); |
| 1182 | } |
| 1183 | |
| 1184 | template <class _Pp> |
| 1185 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1186 | pair<iterator, bool> |
| 1187 | __emplace_unique_extract_key(_Pp&& __x, __extract_key_fail_tag) { |
| 1188 | return __emplace_unique_impl(_VSTDstd::__1::forward<_Pp>(__x)); |
| 1189 | } |
| 1190 | |
| 1191 | template <class _Pp> |
| 1192 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1193 | pair<iterator, bool> |
| 1194 | __emplace_unique_extract_key(_Pp&& __x, __extract_key_self_tag) { |
| 1195 | return __emplace_unique_key_args(__x, _VSTDstd::__1::forward<_Pp>(__x)); |
| 1196 | } |
| 1197 | |
| 1198 | template <class _Pp> |
| 1199 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1200 | pair<iterator, bool> |
| 1201 | __emplace_unique_extract_key(_Pp&& __x, __extract_key_first_tag) { |
| 1202 | return __emplace_unique_key_args(__x.first, _VSTDstd::__1::forward<_Pp>(__x)); |
| 1203 | } |
| 1204 | |
| 1205 | template <class _Pp> |
| 1206 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1207 | iterator __emplace_hint_unique(const_iterator __p, _Pp&& __x) { |
| 1208 | return __emplace_hint_unique_extract_key(__p, _VSTDstd::__1::forward<_Pp>(__x), |
| 1209 | __can_extract_key<_Pp, key_type>()); |
| 1210 | } |
| 1211 | |
| 1212 | template <class _First, class _Second> |
| 1213 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1214 | typename enable_if< |
| 1215 | __can_extract_map_key<_First, key_type, __container_value_type>::value, |
| 1216 | iterator |
| 1217 | >::type __emplace_hint_unique(const_iterator __p, _First&& __f, _Second&& __s) { |
| 1218 | return __emplace_hint_unique_key_args(__p, __f, |
| 1219 | _VSTDstd::__1::forward<_First>(__f), |
| 1220 | _VSTDstd::__1::forward<_Second>(__s)).first; |
| 1221 | } |
| 1222 | |
| 1223 | template <class... _Args> |
| 1224 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1225 | iterator __emplace_hint_unique(const_iterator __p, _Args&&... __args) { |
| 1226 | return __emplace_hint_unique_impl(__p, _VSTDstd::__1::forward<_Args>(__args)...); |
| 1227 | } |
| 1228 | |
| 1229 | template <class _Pp> |
| 1230 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1231 | iterator |
| 1232 | __emplace_hint_unique_extract_key(const_iterator __p, _Pp&& __x, __extract_key_fail_tag) { |
| 1233 | return __emplace_hint_unique_impl(__p, _VSTDstd::__1::forward<_Pp>(__x)); |
| 1234 | } |
| 1235 | |
| 1236 | template <class _Pp> |
| 1237 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1238 | iterator |
| 1239 | __emplace_hint_unique_extract_key(const_iterator __p, _Pp&& __x, __extract_key_self_tag) { |
| 1240 | return __emplace_hint_unique_key_args(__p, __x, _VSTDstd::__1::forward<_Pp>(__x)).first; |
| 1241 | } |
| 1242 | |
| 1243 | template <class _Pp> |
| 1244 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1245 | iterator |
| 1246 | __emplace_hint_unique_extract_key(const_iterator __p, _Pp&& __x, __extract_key_first_tag) { |
| 1247 | return __emplace_hint_unique_key_args(__p, __x.first, _VSTDstd::__1::forward<_Pp>(__x)).first; |
| 1248 | } |
| 1249 | |
| 1250 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1251 | pair<iterator, bool> __insert_unique(const __container_value_type& __v) { |
| 1252 | return __emplace_unique_key_args(_NodeTypes::__get_key(__v), __v); |
| 1253 | } |
| 1254 | |
| 1255 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1256 | iterator __insert_unique(const_iterator __p, const __container_value_type& __v) { |
| 1257 | return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), __v).first; |
| 1258 | } |
| 1259 | |
| 1260 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1261 | pair<iterator, bool> __insert_unique(__container_value_type&& __v) { |
| 1262 | return __emplace_unique_key_args(_NodeTypes::__get_key(__v), _VSTDstd::__1::move(__v)); |
| 1263 | } |
| 1264 | |
| 1265 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1266 | iterator __insert_unique(const_iterator __p, __container_value_type&& __v) { |
| 1267 | return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), _VSTDstd::__1::move(__v)).first; |
| 1268 | } |
| 1269 | |
| 1270 | template <class _Vp, class = typename enable_if< |
| 1271 | !is_same<typename __unconstref<_Vp>::type, |
| 1272 | __container_value_type |
| 1273 | >::value |
| 1274 | >::type> |
| 1275 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1276 | pair<iterator, bool> __insert_unique(_Vp&& __v) { |
| 1277 | return __emplace_unique(_VSTDstd::__1::forward<_Vp>(__v)); |
| 1278 | } |
| 1279 | |
| 1280 | template <class _Vp, class = typename enable_if< |
| 1281 | !is_same<typename __unconstref<_Vp>::type, |
| 1282 | __container_value_type |
| 1283 | >::value |
| 1284 | >::type> |
| 1285 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1286 | iterator __insert_unique(const_iterator __p, _Vp&& __v) { |
| 1287 | return __emplace_hint_unique(__p, _VSTDstd::__1::forward<_Vp>(__v)); |
| 1288 | } |
| 1289 | |
| 1290 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1291 | iterator __insert_multi(__container_value_type&& __v) { |
| 1292 | return __emplace_multi(_VSTDstd::__1::move(__v)); |
| 1293 | } |
| 1294 | |
| 1295 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1296 | iterator __insert_multi(const_iterator __p, __container_value_type&& __v) { |
| 1297 | return __emplace_hint_multi(__p, _VSTDstd::__1::move(__v)); |
| 1298 | } |
| 1299 | |
| 1300 | template <class _Vp> |
| 1301 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1302 | iterator __insert_multi(_Vp&& __v) { |
| 1303 | return __emplace_multi(_VSTDstd::__1::forward<_Vp>(__v)); |
| 1304 | } |
| 1305 | |
| 1306 | template <class _Vp> |
| 1307 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1308 | iterator __insert_multi(const_iterator __p, _Vp&& __v) { |
| 1309 | return __emplace_hint_multi(__p, _VSTDstd::__1::forward<_Vp>(__v)); |
| 1310 | } |
| 1311 | |
| 1312 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1313 | pair<iterator, bool> __node_assign_unique(const __container_value_type& __v, __node_pointer __dest); |
| 1314 | |
| 1315 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1316 | iterator __node_insert_multi(__node_pointer __nd); |
| 1317 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1318 | iterator __node_insert_multi(const_iterator __p, __node_pointer __nd); |
| 1319 | |
| 1320 | |
| 1321 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) iterator |
| 1322 | __remove_node_pointer(__node_pointer) _NOEXCEPTnoexcept; |
| 1323 | |
| 1324 | #if _LIBCPP_STD_VER14 > 14 |
| 1325 | template <class _NodeHandle, class _InsertReturnType> |
| 1326 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1327 | _InsertReturnType __node_handle_insert_unique(_NodeHandle&&); |
| 1328 | template <class _NodeHandle> |
| 1329 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1330 | iterator __node_handle_insert_unique(const_iterator, _NodeHandle&&); |
| 1331 | template <class _Tree> |
| 1332 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1333 | void __node_handle_merge_unique(_Tree& __source); |
| 1334 | |
| 1335 | template <class _NodeHandle> |
| 1336 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1337 | iterator __node_handle_insert_multi(_NodeHandle&&); |
| 1338 | template <class _NodeHandle> |
| 1339 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1340 | iterator __node_handle_insert_multi(const_iterator, _NodeHandle&&); |
| 1341 | template <class _Tree> |
| 1342 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1343 | void __node_handle_merge_multi(_Tree& __source); |
| 1344 | |
| 1345 | |
| 1346 | template <class _NodeHandle> |
| 1347 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1348 | _NodeHandle __node_handle_extract(key_type const&); |
| 1349 | template <class _NodeHandle> |
| 1350 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1351 | _NodeHandle __node_handle_extract(const_iterator); |
| 1352 | #endif |
| 1353 | |
| 1354 | iterator erase(const_iterator __p); |
| 1355 | iterator erase(const_iterator __f, const_iterator __l); |
| 1356 | template <class _Key> |
| 1357 | size_type __erase_unique(const _Key& __k); |
| 1358 | template <class _Key> |
| 1359 | size_type __erase_multi(const _Key& __k); |
| 1360 | |
| 1361 | void __insert_node_at(__parent_pointer __parent, |
| 1362 | __node_base_pointer& __child, |
| 1363 | __node_base_pointer __new_node) _NOEXCEPTnoexcept; |
| 1364 | |
| 1365 | template <class _Key> |
| 1366 | iterator find(const _Key& __v); |
| 1367 | template <class _Key> |
| 1368 | const_iterator find(const _Key& __v) const; |
| 1369 | |
| 1370 | template <class _Key> |
| 1371 | size_type __count_unique(const _Key& __k) const; |
| 1372 | template <class _Key> |
| 1373 | size_type __count_multi(const _Key& __k) const; |
| 1374 | |
| 1375 | template <class _Key> |
| 1376 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1377 | iterator lower_bound(const _Key& __v) |
| 1378 | {return __lower_bound(__v, __root(), __end_node());} |
| 1379 | template <class _Key> |
| 1380 | iterator __lower_bound(const _Key& __v, |
| 1381 | __node_pointer __root, |
| 1382 | __iter_pointer __result); |
| 1383 | template <class _Key> |
| 1384 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1385 | const_iterator lower_bound(const _Key& __v) const |
| 1386 | {return __lower_bound(__v, __root(), __end_node());} |
| 1387 | template <class _Key> |
| 1388 | const_iterator __lower_bound(const _Key& __v, |
| 1389 | __node_pointer __root, |
| 1390 | __iter_pointer __result) const; |
| 1391 | template <class _Key> |
| 1392 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1393 | iterator upper_bound(const _Key& __v) |
| 1394 | {return __upper_bound(__v, __root(), __end_node());} |
| 1395 | template <class _Key> |
| 1396 | iterator __upper_bound(const _Key& __v, |
| 1397 | __node_pointer __root, |
| 1398 | __iter_pointer __result); |
| 1399 | template <class _Key> |
| 1400 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1401 | const_iterator upper_bound(const _Key& __v) const |
| 1402 | {return __upper_bound(__v, __root(), __end_node());} |
| 1403 | template <class _Key> |
| 1404 | const_iterator __upper_bound(const _Key& __v, |
| 1405 | __node_pointer __root, |
| 1406 | __iter_pointer __result) const; |
| 1407 | template <class _Key> |
| 1408 | pair<iterator, iterator> |
| 1409 | __equal_range_unique(const _Key& __k); |
| 1410 | template <class _Key> |
| 1411 | pair<const_iterator, const_iterator> |
| 1412 | __equal_range_unique(const _Key& __k) const; |
| 1413 | |
| 1414 | template <class _Key> |
| 1415 | pair<iterator, iterator> |
| 1416 | __equal_range_multi(const _Key& __k); |
| 1417 | template <class _Key> |
| 1418 | pair<const_iterator, const_iterator> |
| 1419 | __equal_range_multi(const _Key& __k) const; |
| 1420 | |
| 1421 | typedef __tree_node_destructor<__node_allocator> _Dp; |
| 1422 | typedef unique_ptr<__node, _Dp> __node_holder; |
| 1423 | |
| 1424 | __node_holder remove(const_iterator __p) _NOEXCEPTnoexcept; |
| 1425 | private: |
| 1426 | __node_base_pointer& |
| 1427 | __find_leaf_low(__parent_pointer& __parent, const key_type& __v); |
| 1428 | __node_base_pointer& |
| 1429 | __find_leaf_high(__parent_pointer& __parent, const key_type& __v); |
| 1430 | __node_base_pointer& |
| 1431 | __find_leaf(const_iterator __hint, |
| 1432 | __parent_pointer& __parent, const key_type& __v); |
| 1433 | // FIXME: Make this function const qualified. Unfortunately doing so |
| 1434 | // breaks existing code which uses non-const callable comparators. |
| 1435 | template <class _Key> |
| 1436 | __node_base_pointer& |
| 1437 | __find_equal(__parent_pointer& __parent, const _Key& __v); |
| 1438 | template <class _Key> |
| 1439 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) __node_base_pointer& |
| 1440 | __find_equal(__parent_pointer& __parent, const _Key& __v) const { |
| 1441 | return const_cast<__tree*>(this)->__find_equal(__parent, __v); |
| 1442 | } |
| 1443 | template <class _Key> |
| 1444 | __node_base_pointer& |
| 1445 | __find_equal(const_iterator __hint, __parent_pointer& __parent, |
| 1446 | __node_base_pointer& __dummy, |
| 1447 | const _Key& __v); |
| 1448 | |
| 1449 | template <class ..._Args> |
| 1450 | __node_holder __construct_node(_Args&& ...__args); |
| 1451 | |
| 1452 | void destroy(__node_pointer __nd) _NOEXCEPTnoexcept; |
| 1453 | |
| 1454 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1455 | void __copy_assign_alloc(const __tree& __t) |
| 1456 | {__copy_assign_alloc(__t, integral_constant<bool, |
| 1457 | __node_traits::propagate_on_container_copy_assignment::value>());} |
| 1458 | |
| 1459 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1460 | void __copy_assign_alloc(const __tree& __t, true_type) |
| 1461 | { |
| 1462 | if (__node_alloc() != __t.__node_alloc()) |
| 1463 | clear(); |
| 1464 | __node_alloc() = __t.__node_alloc(); |
| 1465 | } |
| 1466 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1467 | void __copy_assign_alloc(const __tree&, false_type) {} |
| 1468 | |
| 1469 | void __move_assign(__tree& __t, false_type); |
| 1470 | void __move_assign(__tree& __t, true_type) |
| 1471 | _NOEXCEPT_(is_nothrow_move_assignable<value_compare>::value &&noexcept(is_nothrow_move_assignable<value_compare>::value && is_nothrow_move_assignable<__node_allocator> ::value) |
| 1472 | is_nothrow_move_assignable<__node_allocator>::value)noexcept(is_nothrow_move_assignable<value_compare>::value && is_nothrow_move_assignable<__node_allocator> ::value); |
| 1473 | |
| 1474 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1475 | void __move_assign_alloc(__tree& __t) |
| 1476 | _NOEXCEPT_(noexcept(!__node_traits::propagate_on_container_move_assignment ::value || is_nothrow_move_assignable<__node_allocator> ::value) |
| 1477 | !__node_traits::propagate_on_container_move_assignment::value ||noexcept(!__node_traits::propagate_on_container_move_assignment ::value || is_nothrow_move_assignable<__node_allocator> ::value) |
| 1478 | is_nothrow_move_assignable<__node_allocator>::value)noexcept(!__node_traits::propagate_on_container_move_assignment ::value || is_nothrow_move_assignable<__node_allocator> ::value) |
| 1479 | {__move_assign_alloc(__t, integral_constant<bool, |
| 1480 | __node_traits::propagate_on_container_move_assignment::value>());} |
| 1481 | |
| 1482 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1483 | void __move_assign_alloc(__tree& __t, true_type) |
| 1484 | _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value)noexcept(is_nothrow_move_assignable<__node_allocator>:: value) |
| 1485 | {__node_alloc() = _VSTDstd::__1::move(__t.__node_alloc());} |
| 1486 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1487 | void __move_assign_alloc(__tree&, false_type) _NOEXCEPTnoexcept {} |
| 1488 | |
| 1489 | struct _DetachedTreeCache { |
| 1490 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1491 | explicit _DetachedTreeCache(__tree *__t) _NOEXCEPTnoexcept : __t_(__t), |
| 1492 | __cache_root_(__detach_from_tree(__t)) { |
| 1493 | __advance(); |
| 1494 | } |
| 1495 | |
| 1496 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1497 | __node_pointer __get() const _NOEXCEPTnoexcept { |
| 1498 | return __cache_elem_; |
| 1499 | } |
| 1500 | |
| 1501 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1502 | void __advance() _NOEXCEPTnoexcept { |
| 1503 | __cache_elem_ = __cache_root_; |
| 1504 | if (__cache_root_) { |
| 1505 | __cache_root_ = __detach_next(__cache_root_); |
| 1506 | } |
| 1507 | } |
| 1508 | |
| 1509 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1510 | ~_DetachedTreeCache() { |
| 1511 | __t_->destroy(__cache_elem_); |
| 1512 | if (__cache_root_) { |
| 1513 | while (__cache_root_->__parent_ != nullptr) |
| 1514 | __cache_root_ = static_cast<__node_pointer>(__cache_root_->__parent_); |
| 1515 | __t_->destroy(__cache_root_); |
| 1516 | } |
| 1517 | } |
| 1518 | |
| 1519 | _DetachedTreeCache(_DetachedTreeCache const&) = delete; |
| 1520 | _DetachedTreeCache& operator=(_DetachedTreeCache const&) = delete; |
| 1521 | |
| 1522 | private: |
| 1523 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1524 | static __node_pointer __detach_from_tree(__tree *__t) _NOEXCEPTnoexcept; |
| 1525 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 1526 | static __node_pointer __detach_next(__node_pointer) _NOEXCEPTnoexcept; |
| 1527 | |
| 1528 | __tree *__t_; |
| 1529 | __node_pointer __cache_root_; |
| 1530 | __node_pointer __cache_elem_; |
| 1531 | }; |
| 1532 | |
| 1533 | |
| 1534 | template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) map; |
| 1535 | template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) multimap; |
| 1536 | }; |
| 1537 | |
| 1538 | template <class _Tp, class _Compare, class _Allocator> |
| 1539 | __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp) |
| 1540 | _NOEXCEPT_(noexcept(is_nothrow_default_constructible<__node_allocator >::value && is_nothrow_copy_constructible<value_compare >::value) |
| 1541 | is_nothrow_default_constructible<__node_allocator>::value &&noexcept(is_nothrow_default_constructible<__node_allocator >::value && is_nothrow_copy_constructible<value_compare >::value) |
| 1542 | is_nothrow_copy_constructible<value_compare>::value)noexcept(is_nothrow_default_constructible<__node_allocator >::value && is_nothrow_copy_constructible<value_compare >::value) |
| 1543 | : __pair3_(0, __comp) |
| 1544 | { |
| 1545 | __begin_node() = __end_node(); |
| 1546 | } |
| 1547 | |
| 1548 | template <class _Tp, class _Compare, class _Allocator> |
| 1549 | __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a) |
| 1550 | : __begin_node_(__iter_pointer()), |
| 1551 | __pair1_(__default_init_tag(), __node_allocator(__a)), |
| 1552 | __pair3_(0, __default_init_tag()) |
| 1553 | { |
| 1554 | __begin_node() = __end_node(); |
| 1555 | } |
| 1556 | |
| 1557 | template <class _Tp, class _Compare, class _Allocator> |
| 1558 | __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp, |
| 1559 | const allocator_type& __a) |
| 1560 | : __begin_node_(__iter_pointer()), |
| 1561 | __pair1_(__default_init_tag(), __node_allocator(__a)), |
| 1562 | __pair3_(0, __comp) |
| 1563 | { |
| 1564 | __begin_node() = __end_node(); |
| 1565 | } |
| 1566 | |
| 1567 | // Precondition: size() != 0 |
| 1568 | template <class _Tp, class _Compare, class _Allocator> |
| 1569 | typename __tree<_Tp, _Compare, _Allocator>::__node_pointer |
| 1570 | __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_from_tree(__tree *__t) _NOEXCEPTnoexcept |
| 1571 | { |
| 1572 | __node_pointer __cache = static_cast<__node_pointer>(__t->__begin_node()); |
| 1573 | __t->__begin_node() = __t->__end_node(); |
| 1574 | __t->__end_node()->__left_->__parent_ = nullptr; |
| 1575 | __t->__end_node()->__left_ = nullptr; |
| 1576 | __t->size() = 0; |
| 1577 | // __cache->__left_ == nullptr |
| 1578 | if (__cache->__right_ != nullptr) |
| 1579 | __cache = static_cast<__node_pointer>(__cache->__right_); |
| 1580 | // __cache->__left_ == nullptr |
| 1581 | // __cache->__right_ == nullptr |
| 1582 | return __cache; |
| 1583 | } |
| 1584 | |
| 1585 | // Precondition: __cache != nullptr |
| 1586 | // __cache->left_ == nullptr |
| 1587 | // __cache->right_ == nullptr |
| 1588 | // This is no longer a red-black tree |
| 1589 | template <class _Tp, class _Compare, class _Allocator> |
| 1590 | typename __tree<_Tp, _Compare, _Allocator>::__node_pointer |
| 1591 | __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_next(__node_pointer __cache) _NOEXCEPTnoexcept |
| 1592 | { |
| 1593 | if (__cache->__parent_ == nullptr) |
| 1594 | return nullptr; |
| 1595 | if (_VSTDstd::__1::__tree_is_left_child(static_cast<__node_base_pointer>(__cache))) |
| 1596 | { |
| 1597 | __cache->__parent_->__left_ = nullptr; |
| 1598 | __cache = static_cast<__node_pointer>(__cache->__parent_); |
| 1599 | if (__cache->__right_ == nullptr) |
| 1600 | return __cache; |
| 1601 | return static_cast<__node_pointer>(_VSTDstd::__1::__tree_leaf(__cache->__right_)); |
| 1602 | } |
| 1603 | // __cache is right child |
| 1604 | __cache->__parent_unsafe()->__right_ = nullptr; |
| 1605 | __cache = static_cast<__node_pointer>(__cache->__parent_); |
| 1606 | if (__cache->__left_ == nullptr) |
| 1607 | return __cache; |
| 1608 | return static_cast<__node_pointer>(_VSTDstd::__1::__tree_leaf(__cache->__left_)); |
| 1609 | } |
| 1610 | |
| 1611 | template <class _Tp, class _Compare, class _Allocator> |
| 1612 | __tree<_Tp, _Compare, _Allocator>& |
| 1613 | __tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t) |
| 1614 | { |
| 1615 | if (this != &__t) |
| 1616 | { |
| 1617 | value_comp() = __t.value_comp(); |
| 1618 | __copy_assign_alloc(__t); |
| 1619 | __assign_multi(__t.begin(), __t.end()); |
| 1620 | } |
| 1621 | return *this; |
| 1622 | } |
| 1623 | |
| 1624 | template <class _Tp, class _Compare, class _Allocator> |
| 1625 | template <class _ForwardIterator> |
| 1626 | void |
| 1627 | __tree<_Tp, _Compare, _Allocator>::__assign_unique(_ForwardIterator __first, _ForwardIterator __last) |
| 1628 | { |
| 1629 | typedef iterator_traits<_ForwardIterator> _ITraits; |
| 1630 | typedef typename _ITraits::value_type _ItValueType; |
| 1631 | static_assert((is_same<_ItValueType, __container_value_type>::value), |
| 1632 | "__assign_unique may only be called with the containers value type"); |
| 1633 | static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, |
| 1634 | "__assign_unique requires a forward iterator"); |
| 1635 | if (size() != 0) |
| 1636 | { |
| 1637 | _DetachedTreeCache __cache(this); |
| 1638 | for (; __cache.__get() != nullptr && __first != __last; ++__first) { |
| 1639 | if (__node_assign_unique(*__first, __cache.__get()).second) |
| 1640 | __cache.__advance(); |
| 1641 | } |
| 1642 | } |
| 1643 | for (; __first != __last; ++__first) |
| 1644 | __insert_unique(*__first); |
| 1645 | } |
| 1646 | |
| 1647 | template <class _Tp, class _Compare, class _Allocator> |
| 1648 | template <class _InputIterator> |
| 1649 | void |
| 1650 | __tree<_Tp, _Compare, _Allocator>::__assign_multi(_InputIterator __first, _InputIterator __last) |
| 1651 | { |
| 1652 | typedef iterator_traits<_InputIterator> _ITraits; |
| 1653 | typedef typename _ITraits::value_type _ItValueType; |
| 1654 | static_assert((is_same<_ItValueType, __container_value_type>::value || |
| 1655 | is_same<_ItValueType, __node_value_type>::value), |
| 1656 | "__assign_multi may only be called with the containers value type" |
| 1657 | " or the nodes value type"); |
| 1658 | if (size() != 0) |
| 1659 | { |
| 1660 | _DetachedTreeCache __cache(this); |
| 1661 | for (; __cache.__get() && __first != __last; ++__first) { |
| 1662 | __cache.__get()->__value_ = *__first; |
| 1663 | __node_insert_multi(__cache.__get()); |
| 1664 | __cache.__advance(); |
| 1665 | } |
| 1666 | } |
| 1667 | for (; __first != __last; ++__first) |
| 1668 | __insert_multi(_NodeTypes::__get_value(*__first)); |
| 1669 | } |
| 1670 | |
| 1671 | template <class _Tp, class _Compare, class _Allocator> |
| 1672 | __tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t) |
| 1673 | : __begin_node_(__iter_pointer()), |
| 1674 | __pair1_(__default_init_tag(), __node_traits::select_on_container_copy_construction(__t.__node_alloc())), |
| 1675 | __pair3_(0, __t.value_comp()) |
| 1676 | { |
| 1677 | __begin_node() = __end_node(); |
| 1678 | } |
| 1679 | |
| 1680 | template <class _Tp, class _Compare, class _Allocator> |
| 1681 | __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t) |
| 1682 | _NOEXCEPT_(noexcept(is_nothrow_move_constructible<__node_allocator> ::value && is_nothrow_move_constructible<value_compare >::value) |
| 1683 | is_nothrow_move_constructible<__node_allocator>::value &&noexcept(is_nothrow_move_constructible<__node_allocator> ::value && is_nothrow_move_constructible<value_compare >::value) |
| 1684 | is_nothrow_move_constructible<value_compare>::value)noexcept(is_nothrow_move_constructible<__node_allocator> ::value && is_nothrow_move_constructible<value_compare >::value) |
| 1685 | : __begin_node_(_VSTDstd::__1::move(__t.__begin_node_)), |
| 1686 | __pair1_(_VSTDstd::__1::move(__t.__pair1_)), |
| 1687 | __pair3_(_VSTDstd::__1::move(__t.__pair3_)) |
| 1688 | { |
| 1689 | if (size() == 0) |
| 1690 | __begin_node() = __end_node(); |
| 1691 | else |
| 1692 | { |
| 1693 | __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node()); |
| 1694 | __t.__begin_node() = __t.__end_node(); |
| 1695 | __t.__end_node()->__left_ = nullptr; |
| 1696 | __t.size() = 0; |
| 1697 | } |
| 1698 | } |
| 1699 | |
| 1700 | template <class _Tp, class _Compare, class _Allocator> |
| 1701 | __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a) |
| 1702 | : __pair1_(__default_init_tag(), __node_allocator(__a)), |
| 1703 | __pair3_(0, _VSTDstd::__1::move(__t.value_comp())) |
| 1704 | { |
| 1705 | if (__a == __t.__alloc()) |
| 1706 | { |
| 1707 | if (__t.size() == 0) |
| 1708 | __begin_node() = __end_node(); |
| 1709 | else |
| 1710 | { |
| 1711 | __begin_node() = __t.__begin_node(); |
| 1712 | __end_node()->__left_ = __t.__end_node()->__left_; |
| 1713 | __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node()); |
| 1714 | size() = __t.size(); |
| 1715 | __t.__begin_node() = __t.__end_node(); |
| 1716 | __t.__end_node()->__left_ = nullptr; |
| 1717 | __t.size() = 0; |
| 1718 | } |
| 1719 | } |
| 1720 | else |
| 1721 | { |
| 1722 | __begin_node() = __end_node(); |
| 1723 | } |
| 1724 | } |
| 1725 | |
| 1726 | template <class _Tp, class _Compare, class _Allocator> |
| 1727 | void |
| 1728 | __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type) |
| 1729 | _NOEXCEPT_(is_nothrow_move_assignable<value_compare>::value &&noexcept(is_nothrow_move_assignable<value_compare>::value && is_nothrow_move_assignable<__node_allocator> ::value) |
| 1730 | is_nothrow_move_assignable<__node_allocator>::value)noexcept(is_nothrow_move_assignable<value_compare>::value && is_nothrow_move_assignable<__node_allocator> ::value) |
| 1731 | { |
| 1732 | destroy(static_cast<__node_pointer>(__end_node()->__left_)); |
| 1733 | __begin_node_ = __t.__begin_node_; |
| 1734 | __pair1_.first() = __t.__pair1_.first(); |
| 1735 | __move_assign_alloc(__t); |
| 1736 | __pair3_ = _VSTDstd::__1::move(__t.__pair3_); |
| 1737 | if (size() == 0) |
| 1738 | __begin_node() = __end_node(); |
| 1739 | else |
| 1740 | { |
| 1741 | __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node()); |
| 1742 | __t.__begin_node() = __t.__end_node(); |
| 1743 | __t.__end_node()->__left_ = nullptr; |
| 1744 | __t.size() = 0; |
| 1745 | } |
| 1746 | } |
| 1747 | |
| 1748 | template <class _Tp, class _Compare, class _Allocator> |
| 1749 | void |
| 1750 | __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type) |
| 1751 | { |
| 1752 | if (__node_alloc() == __t.__node_alloc()) |
| 1753 | __move_assign(__t, true_type()); |
| 1754 | else |
| 1755 | { |
| 1756 | value_comp() = _VSTDstd::__1::move(__t.value_comp()); |
| 1757 | const_iterator __e = end(); |
| 1758 | if (size() != 0) |
| 1759 | { |
| 1760 | _DetachedTreeCache __cache(this); |
| 1761 | while (__cache.__get() != nullptr && __t.size() != 0) { |
| 1762 | __cache.__get()->__value_ = _VSTDstd::__1::move(__t.remove(__t.begin())->__value_); |
| 1763 | __node_insert_multi(__cache.__get()); |
| 1764 | __cache.__advance(); |
| 1765 | } |
| 1766 | } |
| 1767 | while (__t.size() != 0) |
| 1768 | __insert_multi(__e, _NodeTypes::__move(__t.remove(__t.begin())->__value_)); |
| 1769 | } |
| 1770 | } |
| 1771 | |
| 1772 | template <class _Tp, class _Compare, class _Allocator> |
| 1773 | __tree<_Tp, _Compare, _Allocator>& |
| 1774 | __tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t) |
| 1775 | _NOEXCEPT_(noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1776 | __node_traits::propagate_on_container_move_assignment::value &&noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1777 | is_nothrow_move_assignable<value_compare>::value &&noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1778 | is_nothrow_move_assignable<__node_allocator>::value)noexcept(__node_traits::propagate_on_container_move_assignment ::value && is_nothrow_move_assignable<value_compare >::value && is_nothrow_move_assignable<__node_allocator >::value) |
| 1779 | |
| 1780 | { |
| 1781 | __move_assign(__t, integral_constant<bool, |
| 1782 | __node_traits::propagate_on_container_move_assignment::value>()); |
| 1783 | return *this; |
| 1784 | } |
| 1785 | |
| 1786 | template <class _Tp, class _Compare, class _Allocator> |
| 1787 | __tree<_Tp, _Compare, _Allocator>::~__tree() |
| 1788 | { |
| 1789 | static_assert((is_copy_constructible<value_compare>::value), |
| 1790 | "Comparator must be copy-constructible."); |
| 1791 | destroy(__root()); |
| 1792 | } |
| 1793 | |
| 1794 | template <class _Tp, class _Compare, class _Allocator> |
| 1795 | void |
| 1796 | __tree<_Tp, _Compare, _Allocator>::destroy(__node_pointer __nd) _NOEXCEPTnoexcept |
| 1797 | { |
| 1798 | if (__nd != nullptr) |
| 1799 | { |
| 1800 | destroy(static_cast<__node_pointer>(__nd->__left_)); |
| 1801 | destroy(static_cast<__node_pointer>(__nd->__right_)); |
| 1802 | __node_allocator& __na = __node_alloc(); |
| 1803 | __node_traits::destroy(__na, _NodeTypes::__get_ptr(__nd->__value_)); |
| 1804 | __node_traits::deallocate(__na, __nd, 1); |
| 1805 | } |
| 1806 | } |
| 1807 | |
| 1808 | template <class _Tp, class _Compare, class _Allocator> |
| 1809 | void |
| 1810 | __tree<_Tp, _Compare, _Allocator>::swap(__tree& __t) |
| 1811 | #if _LIBCPP_STD_VER14 <= 11 |
| 1812 | _NOEXCEPT_(noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1813 | __is_nothrow_swappable<value_compare>::valuenoexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1814 | && (!__node_traits::propagate_on_container_swap::value ||noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1815 | __is_nothrow_swappable<__node_allocator>::value)noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1816 | )noexcept(__is_nothrow_swappable<value_compare>::value && (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable <__node_allocator>::value)) |
| 1817 | #else |
| 1818 | _NOEXCEPT_(__is_nothrow_swappable<value_compare>::value)noexcept(__is_nothrow_swappable<value_compare>::value) |
| 1819 | #endif |
| 1820 | { |
| 1821 | using _VSTDstd::__1::swap; |
| 1822 | swap(__begin_node_, __t.__begin_node_); |
| 1823 | swap(__pair1_.first(), __t.__pair1_.first()); |
| 1824 | _VSTDstd::__1::__swap_allocator(__node_alloc(), __t.__node_alloc()); |
| 1825 | __pair3_.swap(__t.__pair3_); |
| 1826 | if (size() == 0) |
| 1827 | __begin_node() = __end_node(); |
| 1828 | else |
| 1829 | __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node()); |
| 1830 | if (__t.size() == 0) |
| 1831 | __t.__begin_node() = __t.__end_node(); |
| 1832 | else |
| 1833 | __t.__end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__t.__end_node()); |
| 1834 | } |
| 1835 | |
| 1836 | template <class _Tp, class _Compare, class _Allocator> |
| 1837 | void |
| 1838 | __tree<_Tp, _Compare, _Allocator>::clear() _NOEXCEPTnoexcept |
| 1839 | { |
| 1840 | destroy(__root()); |
| 1841 | size() = 0; |
| 1842 | __begin_node() = __end_node(); |
| 1843 | __end_node()->__left_ = nullptr; |
| 1844 | } |
| 1845 | |
| 1846 | // Find lower_bound place to insert |
| 1847 | // Set __parent to parent of null leaf |
| 1848 | // Return reference to null leaf |
| 1849 | template <class _Tp, class _Compare, class _Allocator> |
| 1850 | typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer& |
| 1851 | __tree<_Tp, _Compare, _Allocator>::__find_leaf_low(__parent_pointer& __parent, |
| 1852 | const key_type& __v) |
| 1853 | { |
| 1854 | __node_pointer __nd = __root(); |
| 1855 | if (__nd != nullptr) |
| 1856 | { |
| 1857 | while (true) |
| 1858 | { |
| 1859 | if (value_comp()(__nd->__value_, __v)) |
| 1860 | { |
| 1861 | if (__nd->__right_ != nullptr) |
| 1862 | __nd = static_cast<__node_pointer>(__nd->__right_); |
| 1863 | else |
| 1864 | { |
| 1865 | __parent = static_cast<__parent_pointer>(__nd); |
| 1866 | return __nd->__right_; |
| 1867 | } |
| 1868 | } |
| 1869 | else |
| 1870 | { |
| 1871 | if (__nd->__left_ != nullptr) |
| 1872 | __nd = static_cast<__node_pointer>(__nd->__left_); |
| 1873 | else |
| 1874 | { |
| 1875 | __parent = static_cast<__parent_pointer>(__nd); |
| 1876 | return __parent->__left_; |
| 1877 | } |
| 1878 | } |
| 1879 | } |
| 1880 | } |
| 1881 | __parent = static_cast<__parent_pointer>(__end_node()); |
| 1882 | return __parent->__left_; |
| 1883 | } |
| 1884 | |
| 1885 | // Find upper_bound place to insert |
| 1886 | // Set __parent to parent of null leaf |
| 1887 | // Return reference to null leaf |
| 1888 | template <class _Tp, class _Compare, class _Allocator> |
| 1889 | typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer& |
| 1890 | __tree<_Tp, _Compare, _Allocator>::__find_leaf_high(__parent_pointer& __parent, |
| 1891 | const key_type& __v) |
| 1892 | { |
| 1893 | __node_pointer __nd = __root(); |
| 1894 | if (__nd != nullptr) |
| 1895 | { |
| 1896 | while (true) |
| 1897 | { |
| 1898 | if (value_comp()(__v, __nd->__value_)) |
| 1899 | { |
| 1900 | if (__nd->__left_ != nullptr) |
| 1901 | __nd = static_cast<__node_pointer>(__nd->__left_); |
| 1902 | else |
| 1903 | { |
| 1904 | __parent = static_cast<__parent_pointer>(__nd); |
| 1905 | return __parent->__left_; |
| 1906 | } |
| 1907 | } |
| 1908 | else |
| 1909 | { |
| 1910 | if (__nd->__right_ != nullptr) |
| 1911 | __nd = static_cast<__node_pointer>(__nd->__right_); |
| 1912 | else |
| 1913 | { |
| 1914 | __parent = static_cast<__parent_pointer>(__nd); |
| 1915 | return __nd->__right_; |
| 1916 | } |
| 1917 | } |
| 1918 | } |
| 1919 | } |
| 1920 | __parent = static_cast<__parent_pointer>(__end_node()); |
| 1921 | return __parent->__left_; |
| 1922 | } |
| 1923 | |
| 1924 | // Find leaf place to insert closest to __hint |
| 1925 | // First check prior to __hint. |
| 1926 | // Next check after __hint. |
| 1927 | // Next do O(log N) search. |
| 1928 | // Set __parent to parent of null leaf |
| 1929 | // Return reference to null leaf |
| 1930 | template <class _Tp, class _Compare, class _Allocator> |
| 1931 | typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer& |
| 1932 | __tree<_Tp, _Compare, _Allocator>::__find_leaf(const_iterator __hint, |
| 1933 | __parent_pointer& __parent, |
| 1934 | const key_type& __v) |
| 1935 | { |
| 1936 | if (__hint == end() || !value_comp()(*__hint, __v)) // check before |
| 1937 | { |
| 1938 | // __v <= *__hint |
| 1939 | const_iterator __prior = __hint; |
| 1940 | if (__prior == begin() || !value_comp()(__v, *--__prior)) |
| 1941 | { |
| 1942 | // *prev(__hint) <= __v <= *__hint |
| 1943 | if (__hint.__ptr_->__left_ == nullptr) |
| 1944 | { |
| 1945 | __parent = static_cast<__parent_pointer>(__hint.__ptr_); |
| 1946 | return __parent->__left_; |
| 1947 | } |
| 1948 | else |
| 1949 | { |
| 1950 | __parent = static_cast<__parent_pointer>(__prior.__ptr_); |
| 1951 | return static_cast<__node_base_pointer>(__prior.__ptr_)->__right_; |
| 1952 | } |
| 1953 | } |
| 1954 | // __v < *prev(__hint) |
| 1955 | return __find_leaf_high(__parent, __v); |
| 1956 | } |
| 1957 | // else __v > *__hint |
| 1958 | return __find_leaf_low(__parent, __v); |
| 1959 | } |
| 1960 | |
| 1961 | // Find place to insert if __v doesn't exist |
| 1962 | // Set __parent to parent of null leaf |
| 1963 | // Return reference to null leaf |
| 1964 | // If __v exists, set parent to node of __v and return reference to node of __v |
| 1965 | template <class _Tp, class _Compare, class _Allocator> |
| 1966 | template <class _Key> |
| 1967 | typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer& |
| 1968 | __tree<_Tp, _Compare, _Allocator>::__find_equal(__parent_pointer& __parent, |
| 1969 | const _Key& __v) |
| 1970 | { |
| 1971 | __node_pointer __nd = __root(); |
| 1972 | __node_base_pointer* __nd_ptr = __root_ptr(); |
| 1973 | if (__nd != nullptr) |
| 1974 | { |
| 1975 | while (true) |
| 1976 | { |
| 1977 | if (value_comp()(__v, __nd->__value_)) |
| 1978 | { |
| 1979 | if (__nd->__left_ != nullptr) { |
| 1980 | __nd_ptr = _VSTDstd::__1::addressof(__nd->__left_); |
| 1981 | __nd = static_cast<__node_pointer>(__nd->__left_); |
| 1982 | } else { |
| 1983 | __parent = static_cast<__parent_pointer>(__nd); |
| 1984 | return __parent->__left_; |
| 1985 | } |
| 1986 | } |
| 1987 | else if (value_comp()(__nd->__value_, __v)) |
| 1988 | { |
| 1989 | if (__nd->__right_ != nullptr) { |
| 1990 | __nd_ptr = _VSTDstd::__1::addressof(__nd->__right_); |
| 1991 | __nd = static_cast<__node_pointer>(__nd->__right_); |
| 1992 | } else { |
| 1993 | __parent = static_cast<__parent_pointer>(__nd); |
| 1994 | return __nd->__right_; |
| 1995 | } |
| 1996 | } |
| 1997 | else |
| 1998 | { |
| 1999 | __parent = static_cast<__parent_pointer>(__nd); |
| 2000 | return *__nd_ptr; |
| 2001 | } |
| 2002 | } |
| 2003 | } |
| 2004 | __parent = static_cast<__parent_pointer>(__end_node()); |
| 2005 | return __parent->__left_; |
| 2006 | } |
| 2007 | |
| 2008 | // Find place to insert if __v doesn't exist |
| 2009 | // First check prior to __hint. |
| 2010 | // Next check after __hint. |
| 2011 | // Next do O(log N) search. |
| 2012 | // Set __parent to parent of null leaf |
| 2013 | // Return reference to null leaf |
| 2014 | // If __v exists, set parent to node of __v and return reference to node of __v |
| 2015 | template <class _Tp, class _Compare, class _Allocator> |
| 2016 | template <class _Key> |
| 2017 | typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer& |
| 2018 | __tree<_Tp, _Compare, _Allocator>::__find_equal(const_iterator __hint, |
| 2019 | __parent_pointer& __parent, |
| 2020 | __node_base_pointer& __dummy, |
| 2021 | const _Key& __v) |
| 2022 | { |
| 2023 | if (__hint == end() || value_comp()(__v, *__hint)) // check before |
| 2024 | { |
| 2025 | // __v < *__hint |
| 2026 | const_iterator __prior = __hint; |
| 2027 | if (__prior == begin() || value_comp()(*--__prior, __v)) |
| 2028 | { |
| 2029 | // *prev(__hint) < __v < *__hint |
| 2030 | if (__hint.__ptr_->__left_ == nullptr) |
| 2031 | { |
| 2032 | __parent = static_cast<__parent_pointer>(__hint.__ptr_); |
| 2033 | return __parent->__left_; |
| 2034 | } |
| 2035 | else |
| 2036 | { |
| 2037 | __parent = static_cast<__parent_pointer>(__prior.__ptr_); |
| 2038 | return static_cast<__node_base_pointer>(__prior.__ptr_)->__right_; |
| 2039 | } |
| 2040 | } |
| 2041 | // __v <= *prev(__hint) |
| 2042 | return __find_equal(__parent, __v); |
| 2043 | } |
| 2044 | else if (value_comp()(*__hint, __v)) // check after |
| 2045 | { |
| 2046 | // *__hint < __v |
| 2047 | const_iterator __next = _VSTDstd::__1::next(__hint); |
| 2048 | if (__next == end() || value_comp()(__v, *__next)) |
| 2049 | { |
| 2050 | // *__hint < __v < *_VSTD::next(__hint) |
| 2051 | if (__hint.__get_np()->__right_ == nullptr) |
| 2052 | { |
| 2053 | __parent = static_cast<__parent_pointer>(__hint.__ptr_); |
| 2054 | return static_cast<__node_base_pointer>(__hint.__ptr_)->__right_; |
| 2055 | } |
| 2056 | else |
| 2057 | { |
| 2058 | __parent = static_cast<__parent_pointer>(__next.__ptr_); |
| 2059 | return __parent->__left_; |
| 2060 | } |
| 2061 | } |
| 2062 | // *next(__hint) <= __v |
| 2063 | return __find_equal(__parent, __v); |
| 2064 | } |
| 2065 | // else __v == *__hint |
| 2066 | __parent = static_cast<__parent_pointer>(__hint.__ptr_); |
| 2067 | __dummy = static_cast<__node_base_pointer>(__hint.__ptr_); |
| 2068 | return __dummy; |
| 2069 | } |
| 2070 | |
| 2071 | template <class _Tp, class _Compare, class _Allocator> |
| 2072 | void __tree<_Tp, _Compare, _Allocator>::__insert_node_at( |
| 2073 | __parent_pointer __parent, __node_base_pointer& __child, |
| 2074 | __node_base_pointer __new_node) _NOEXCEPTnoexcept |
| 2075 | { |
| 2076 | __new_node->__left_ = nullptr; |
| 2077 | __new_node->__right_ = nullptr; |
| 2078 | __new_node->__parent_ = __parent; |
| 2079 | // __new_node->__is_black_ is initialized in __tree_balance_after_insert |
| 2080 | __child = __new_node; |
| 2081 | if (__begin_node()->__left_ != nullptr) |
| 2082 | __begin_node() = static_cast<__iter_pointer>(__begin_node()->__left_); |
| 2083 | _VSTDstd::__1::__tree_balance_after_insert(__end_node()->__left_, __child); |
| 2084 | ++size(); |
| 2085 | } |
| 2086 | |
| 2087 | template <class _Tp, class _Compare, class _Allocator> |
| 2088 | template <class _Key, class... _Args> |
| 2089 | pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool> |
| 2090 | __tree<_Tp, _Compare, _Allocator>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args) |
| 2091 | { |
| 2092 | __parent_pointer __parent; |
| 2093 | __node_base_pointer& __child = __find_equal(__parent, __k); |
| 2094 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 2095 | bool __inserted = false; |
| 2096 | if (__child == nullptr) |
| 2097 | { |
| 2098 | __node_holder __h = __construct_node(_VSTDstd::__1::forward<_Args>(__args)...); |
| 2099 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
| 2100 | __r = __h.release(); |
| 2101 | __inserted = true; |
| 2102 | } |
| 2103 | return pair<iterator, bool>(iterator(__r), __inserted); |
| 2104 | } |
| 2105 | |
| 2106 | template <class _Tp, class _Compare, class _Allocator> |
| 2107 | template <class _Key, class... _Args> |
| 2108 | pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool> |
| 2109 | __tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique_key_args( |
| 2110 | const_iterator __p, _Key const& __k, _Args&&... __args) |
| 2111 | { |
| 2112 | __parent_pointer __parent; |
| 2113 | __node_base_pointer __dummy; |
| 2114 | __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k); |
| 2115 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 2116 | bool __inserted = false; |
| 2117 | if (__child == nullptr) |
| 2118 | { |
| 2119 | __node_holder __h = __construct_node(_VSTDstd::__1::forward<_Args>(__args)...); |
| 2120 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
| 2121 | __r = __h.release(); |
| 2122 | __inserted = true; |
| 2123 | } |
| 2124 | return pair<iterator, bool>(iterator(__r), __inserted); |
| 2125 | } |
| 2126 | |
| 2127 | template <class _Tp, class _Compare, class _Allocator> |
| 2128 | template <class ..._Args> |
| 2129 | typename __tree<_Tp, _Compare, _Allocator>::__node_holder |
| 2130 | __tree<_Tp, _Compare, _Allocator>::__construct_node(_Args&& ...__args) |
| 2131 | { |
| 2132 | static_assert(!__is_tree_value_type<_Args...>::value, |
| 2133 | "Cannot construct from __value_type"); |
| 2134 | __node_allocator& __na = __node_alloc(); |
| 2135 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
| 2136 | __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), _VSTDstd::__1::forward<_Args>(__args)...); |
| 2137 | __h.get_deleter().__value_constructed = true; |
| 2138 | return __h; |
| 2139 | } |
| 2140 | |
| 2141 | |
| 2142 | template <class _Tp, class _Compare, class _Allocator> |
| 2143 | template <class... _Args> |
| 2144 | pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool> |
| 2145 | __tree<_Tp, _Compare, _Allocator>::__emplace_unique_impl(_Args&&... __args) |
| 2146 | { |
| 2147 | __node_holder __h = __construct_node(_VSTDstd::__1::forward<_Args>(__args)...); |
| 2148 | __parent_pointer __parent; |
| 2149 | __node_base_pointer& __child = __find_equal(__parent, __h->__value_); |
| 2150 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 2151 | bool __inserted = false; |
| 2152 | if (__child == nullptr) |
| 2153 | { |
| 2154 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
| 2155 | __r = __h.release(); |
| 2156 | __inserted = true; |
| 2157 | } |
| 2158 | return pair<iterator, bool>(iterator(__r), __inserted); |
| 2159 | } |
| 2160 | |
| 2161 | template <class _Tp, class _Compare, class _Allocator> |
| 2162 | template <class... _Args> |
| 2163 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2164 | __tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique_impl(const_iterator __p, _Args&&... __args) |
| 2165 | { |
| 2166 | __node_holder __h = __construct_node(_VSTDstd::__1::forward<_Args>(__args)...); |
| 2167 | __parent_pointer __parent; |
| 2168 | __node_base_pointer __dummy; |
| 2169 | __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __h->__value_); |
| 2170 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 2171 | if (__child == nullptr) |
| 2172 | { |
| 2173 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
| 2174 | __r = __h.release(); |
| 2175 | } |
| 2176 | return iterator(__r); |
| 2177 | } |
| 2178 | |
| 2179 | template <class _Tp, class _Compare, class _Allocator> |
| 2180 | template <class... _Args> |
| 2181 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2182 | __tree<_Tp, _Compare, _Allocator>::__emplace_multi(_Args&&... __args) |
| 2183 | { |
| 2184 | __node_holder __h = __construct_node(_VSTDstd::__1::forward<_Args>(__args)...); |
| 2185 | __parent_pointer __parent; |
| 2186 | __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__h->__value_)); |
| 2187 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
| 2188 | return iterator(static_cast<__node_pointer>(__h.release())); |
| 2189 | } |
| 2190 | |
| 2191 | template <class _Tp, class _Compare, class _Allocator> |
| 2192 | template <class... _Args> |
| 2193 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2194 | __tree<_Tp, _Compare, _Allocator>::__emplace_hint_multi(const_iterator __p, |
| 2195 | _Args&&... __args) |
| 2196 | { |
| 2197 | __node_holder __h = __construct_node(_VSTDstd::__1::forward<_Args>(__args)...); |
| 2198 | __parent_pointer __parent; |
| 2199 | __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__h->__value_)); |
| 2200 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
| 2201 | return iterator(static_cast<__node_pointer>(__h.release())); |
| 2202 | } |
| 2203 | |
| 2204 | template <class _Tp, class _Compare, class _Allocator> |
| 2205 | pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool> |
| 2206 | __tree<_Tp, _Compare, _Allocator>::__node_assign_unique(const __container_value_type& __v, __node_pointer __nd) |
| 2207 | { |
| 2208 | __parent_pointer __parent; |
| 2209 | __node_base_pointer& __child = __find_equal(__parent, _NodeTypes::__get_key(__v)); |
| 2210 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 2211 | bool __inserted = false; |
| 2212 | if (__child == nullptr) |
| 2213 | { |
| 2214 | __nd->__value_ = __v; |
| 2215 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd)); |
| 2216 | __r = __nd; |
| 2217 | __inserted = true; |
| 2218 | } |
| 2219 | return pair<iterator, bool>(iterator(__r), __inserted); |
| 2220 | } |
| 2221 | |
| 2222 | |
| 2223 | template <class _Tp, class _Compare, class _Allocator> |
| 2224 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2225 | __tree<_Tp, _Compare, _Allocator>::__node_insert_multi(__node_pointer __nd) |
| 2226 | { |
| 2227 | __parent_pointer __parent; |
| 2228 | __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__nd->__value_)); |
| 2229 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd)); |
| 2230 | return iterator(__nd); |
| 2231 | } |
| 2232 | |
| 2233 | template <class _Tp, class _Compare, class _Allocator> |
| 2234 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2235 | __tree<_Tp, _Compare, _Allocator>::__node_insert_multi(const_iterator __p, |
| 2236 | __node_pointer __nd) |
| 2237 | { |
| 2238 | __parent_pointer __parent; |
| 2239 | __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__nd->__value_)); |
| 2240 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd)); |
| 2241 | return iterator(__nd); |
| 2242 | } |
| 2243 | |
| 2244 | template <class _Tp, class _Compare, class _Allocator> |
| 2245 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2246 | __tree<_Tp, _Compare, _Allocator>::__remove_node_pointer(__node_pointer __ptr) _NOEXCEPTnoexcept |
| 2247 | { |
| 2248 | iterator __r(__ptr); |
| 2249 | ++__r; |
| 2250 | if (__begin_node() == __ptr) |
| 2251 | __begin_node() = __r.__ptr_; |
| 2252 | --size(); |
| 2253 | _VSTDstd::__1::__tree_remove(__end_node()->__left_, |
| 2254 | static_cast<__node_base_pointer>(__ptr)); |
| 2255 | return __r; |
| 2256 | } |
| 2257 | |
| 2258 | #if _LIBCPP_STD_VER14 > 14 |
| 2259 | template <class _Tp, class _Compare, class _Allocator> |
| 2260 | template <class _NodeHandle, class _InsertReturnType> |
| 2261 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2262 | _InsertReturnType |
| 2263 | __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_unique( |
| 2264 | _NodeHandle&& __nh) |
| 2265 | { |
| 2266 | if (__nh.empty()) |
| 2267 | return _InsertReturnType{end(), false, _NodeHandle()}; |
| 2268 | |
| 2269 | __node_pointer __ptr = __nh.__ptr_; |
| 2270 | __parent_pointer __parent; |
| 2271 | __node_base_pointer& __child = __find_equal(__parent, |
| 2272 | __ptr->__value_); |
| 2273 | if (__child != nullptr) |
| 2274 | return _InsertReturnType{ |
| 2275 | iterator(static_cast<__node_pointer>(__child)), |
| 2276 | false, _VSTDstd::__1::move(__nh)}; |
| 2277 | |
| 2278 | __insert_node_at(__parent, __child, |
| 2279 | static_cast<__node_base_pointer>(__ptr)); |
| 2280 | __nh.__release_ptr(); |
| 2281 | return _InsertReturnType{iterator(__ptr), true, _NodeHandle()}; |
| 2282 | } |
| 2283 | |
| 2284 | template <class _Tp, class _Compare, class _Allocator> |
| 2285 | template <class _NodeHandle> |
| 2286 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2287 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2288 | __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_unique( |
| 2289 | const_iterator __hint, _NodeHandle&& __nh) |
| 2290 | { |
| 2291 | if (__nh.empty()) |
| 2292 | return end(); |
| 2293 | |
| 2294 | __node_pointer __ptr = __nh.__ptr_; |
| 2295 | __parent_pointer __parent; |
| 2296 | __node_base_pointer __dummy; |
| 2297 | __node_base_pointer& __child = __find_equal(__hint, __parent, __dummy, |
| 2298 | __ptr->__value_); |
| 2299 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 2300 | if (__child == nullptr) |
| 2301 | { |
| 2302 | __insert_node_at(__parent, __child, |
| 2303 | static_cast<__node_base_pointer>(__ptr)); |
| 2304 | __r = __ptr; |
| 2305 | __nh.__release_ptr(); |
| 2306 | } |
| 2307 | return iterator(__r); |
| 2308 | } |
| 2309 | |
| 2310 | template <class _Tp, class _Compare, class _Allocator> |
| 2311 | template <class _NodeHandle> |
| 2312 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2313 | _NodeHandle |
| 2314 | __tree<_Tp, _Compare, _Allocator>::__node_handle_extract(key_type const& __key) |
| 2315 | { |
| 2316 | iterator __it = find(__key); |
| 2317 | if (__it == end()) |
| 2318 | return _NodeHandle(); |
| 2319 | return __node_handle_extract<_NodeHandle>(__it); |
| 2320 | } |
| 2321 | |
| 2322 | template <class _Tp, class _Compare, class _Allocator> |
| 2323 | template <class _NodeHandle> |
| 2324 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2325 | _NodeHandle |
| 2326 | __tree<_Tp, _Compare, _Allocator>::__node_handle_extract(const_iterator __p) |
| 2327 | { |
| 2328 | __node_pointer __np = __p.__get_np(); |
| 2329 | __remove_node_pointer(__np); |
| 2330 | return _NodeHandle(__np, __alloc()); |
| 2331 | } |
| 2332 | |
| 2333 | template <class _Tp, class _Compare, class _Allocator> |
| 2334 | template <class _Tree> |
| 2335 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2336 | void |
| 2337 | __tree<_Tp, _Compare, _Allocator>::__node_handle_merge_unique(_Tree& __source) |
| 2338 | { |
| 2339 | static_assert(is_same<typename _Tree::__node_pointer, __node_pointer>::value, ""); |
| 2340 | |
| 2341 | for (typename _Tree::iterator __i = __source.begin(); |
| 2342 | __i != __source.end();) |
| 2343 | { |
| 2344 | __node_pointer __src_ptr = __i.__get_np(); |
| 2345 | __parent_pointer __parent; |
| 2346 | __node_base_pointer& __child = |
| 2347 | __find_equal(__parent, _NodeTypes::__get_key(__src_ptr->__value_)); |
| 2348 | ++__i; |
| 2349 | if (__child != nullptr) |
| 2350 | continue; |
| 2351 | __source.__remove_node_pointer(__src_ptr); |
| 2352 | __insert_node_at(__parent, __child, |
| 2353 | static_cast<__node_base_pointer>(__src_ptr)); |
| 2354 | } |
| 2355 | } |
| 2356 | |
| 2357 | template <class _Tp, class _Compare, class _Allocator> |
| 2358 | template <class _NodeHandle> |
| 2359 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2360 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2361 | __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_multi(_NodeHandle&& __nh) |
| 2362 | { |
| 2363 | if (__nh.empty()) |
| 2364 | return end(); |
| 2365 | __node_pointer __ptr = __nh.__ptr_; |
| 2366 | __parent_pointer __parent; |
| 2367 | __node_base_pointer& __child = __find_leaf_high( |
| 2368 | __parent, _NodeTypes::__get_key(__ptr->__value_)); |
| 2369 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr)); |
| 2370 | __nh.__release_ptr(); |
| 2371 | return iterator(__ptr); |
| 2372 | } |
| 2373 | |
| 2374 | template <class _Tp, class _Compare, class _Allocator> |
| 2375 | template <class _NodeHandle> |
| 2376 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2377 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2378 | __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_multi( |
| 2379 | const_iterator __hint, _NodeHandle&& __nh) |
| 2380 | { |
| 2381 | if (__nh.empty()) |
| 2382 | return end(); |
| 2383 | |
| 2384 | __node_pointer __ptr = __nh.__ptr_; |
| 2385 | __parent_pointer __parent; |
| 2386 | __node_base_pointer& __child = __find_leaf(__hint, __parent, |
| 2387 | _NodeTypes::__get_key(__ptr->__value_)); |
| 2388 | __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr)); |
| 2389 | __nh.__release_ptr(); |
| 2390 | return iterator(__ptr); |
| 2391 | } |
| 2392 | |
| 2393 | template <class _Tp, class _Compare, class _Allocator> |
| 2394 | template <class _Tree> |
| 2395 | _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2396 | void |
| 2397 | __tree<_Tp, _Compare, _Allocator>::__node_handle_merge_multi(_Tree& __source) |
| 2398 | { |
| 2399 | static_assert(is_same<typename _Tree::__node_pointer, __node_pointer>::value, ""); |
| 2400 | |
| 2401 | for (typename _Tree::iterator __i = __source.begin(); |
| 2402 | __i != __source.end();) |
| 2403 | { |
| 2404 | __node_pointer __src_ptr = __i.__get_np(); |
| 2405 | __parent_pointer __parent; |
| 2406 | __node_base_pointer& __child = __find_leaf_high( |
| 2407 | __parent, _NodeTypes::__get_key(__src_ptr->__value_)); |
| 2408 | ++__i; |
| 2409 | __source.__remove_node_pointer(__src_ptr); |
| 2410 | __insert_node_at(__parent, __child, |
| 2411 | static_cast<__node_base_pointer>(__src_ptr)); |
| 2412 | } |
| 2413 | } |
| 2414 | |
| 2415 | #endif // _LIBCPP_STD_VER > 14 |
| 2416 | |
| 2417 | template <class _Tp, class _Compare, class _Allocator> |
| 2418 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2419 | __tree<_Tp, _Compare, _Allocator>::erase(const_iterator __p) |
| 2420 | { |
| 2421 | __node_pointer __np = __p.__get_np(); |
| 2422 | iterator __r = __remove_node_pointer(__np); |
| 2423 | __node_allocator& __na = __node_alloc(); |
| 2424 | __node_traits::destroy(__na, _NodeTypes::__get_ptr( |
| 2425 | const_cast<__node_value_type&>(*__p))); |
| 2426 | __node_traits::deallocate(__na, __np, 1); |
| 2427 | return __r; |
| 2428 | } |
| 2429 | |
| 2430 | template <class _Tp, class _Compare, class _Allocator> |
| 2431 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2432 | __tree<_Tp, _Compare, _Allocator>::erase(const_iterator __f, const_iterator __l) |
| 2433 | { |
| 2434 | while (__f != __l) |
| 2435 | __f = erase(__f); |
| 2436 | return iterator(__l.__ptr_); |
| 2437 | } |
| 2438 | |
| 2439 | template <class _Tp, class _Compare, class _Allocator> |
| 2440 | template <class _Key> |
| 2441 | typename __tree<_Tp, _Compare, _Allocator>::size_type |
| 2442 | __tree<_Tp, _Compare, _Allocator>::__erase_unique(const _Key& __k) |
| 2443 | { |
| 2444 | iterator __i = find(__k); |
| 2445 | if (__i == end()) |
| 2446 | return 0; |
| 2447 | erase(__i); |
| 2448 | return 1; |
| 2449 | } |
| 2450 | |
| 2451 | template <class _Tp, class _Compare, class _Allocator> |
| 2452 | template <class _Key> |
| 2453 | typename __tree<_Tp, _Compare, _Allocator>::size_type |
| 2454 | __tree<_Tp, _Compare, _Allocator>::__erase_multi(const _Key& __k) |
| 2455 | { |
| 2456 | pair<iterator, iterator> __p = __equal_range_multi(__k); |
| 2457 | size_type __r = 0; |
| 2458 | for (; __p.first != __p.second; ++__r) |
| 2459 | __p.first = erase(__p.first); |
| 2460 | return __r; |
| 2461 | } |
| 2462 | |
| 2463 | template <class _Tp, class _Compare, class _Allocator> |
| 2464 | template <class _Key> |
| 2465 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2466 | __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) |
| 2467 | { |
| 2468 | iterator __p = __lower_bound(__v, __root(), __end_node()); |
| 2469 | if (__p != end() && !value_comp()(__v, *__p)) |
| 2470 | return __p; |
| 2471 | return end(); |
| 2472 | } |
| 2473 | |
| 2474 | template <class _Tp, class _Compare, class _Allocator> |
| 2475 | template <class _Key> |
| 2476 | typename __tree<_Tp, _Compare, _Allocator>::const_iterator |
| 2477 | __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const |
| 2478 | { |
| 2479 | const_iterator __p = __lower_bound(__v, __root(), __end_node()); |
| 2480 | if (__p != end() && !value_comp()(__v, *__p)) |
| 2481 | return __p; |
| 2482 | return end(); |
| 2483 | } |
| 2484 | |
| 2485 | template <class _Tp, class _Compare, class _Allocator> |
| 2486 | template <class _Key> |
| 2487 | typename __tree<_Tp, _Compare, _Allocator>::size_type |
| 2488 | __tree<_Tp, _Compare, _Allocator>::__count_unique(const _Key& __k) const |
| 2489 | { |
| 2490 | __node_pointer __rt = __root(); |
| 2491 | while (__rt != nullptr) |
| 2492 | { |
| 2493 | if (value_comp()(__k, __rt->__value_)) |
| 2494 | { |
| 2495 | __rt = static_cast<__node_pointer>(__rt->__left_); |
| 2496 | } |
| 2497 | else if (value_comp()(__rt->__value_, __k)) |
| 2498 | __rt = static_cast<__node_pointer>(__rt->__right_); |
| 2499 | else |
| 2500 | return 1; |
| 2501 | } |
| 2502 | return 0; |
| 2503 | } |
| 2504 | |
| 2505 | template <class _Tp, class _Compare, class _Allocator> |
| 2506 | template <class _Key> |
| 2507 | typename __tree<_Tp, _Compare, _Allocator>::size_type |
| 2508 | __tree<_Tp, _Compare, _Allocator>::__count_multi(const _Key& __k) const |
| 2509 | { |
| 2510 | __iter_pointer __result = __end_node(); |
| 2511 | __node_pointer __rt = __root(); |
| 2512 | while (__rt != nullptr) |
| 2513 | { |
| 2514 | if (value_comp()(__k, __rt->__value_)) |
| 2515 | { |
| 2516 | __result = static_cast<__iter_pointer>(__rt); |
| 2517 | __rt = static_cast<__node_pointer>(__rt->__left_); |
| 2518 | } |
| 2519 | else if (value_comp()(__rt->__value_, __k)) |
| 2520 | __rt = static_cast<__node_pointer>(__rt->__right_); |
| 2521 | else |
| 2522 | return _VSTDstd::__1::distance( |
| 2523 | __lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), static_cast<__iter_pointer>(__rt)), |
| 2524 | __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result) |
| 2525 | ); |
| 2526 | } |
| 2527 | return 0; |
| 2528 | } |
| 2529 | |
| 2530 | template <class _Tp, class _Compare, class _Allocator> |
| 2531 | template <class _Key> |
| 2532 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2533 | __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v, |
| 2534 | __node_pointer __root, |
| 2535 | __iter_pointer __result) |
| 2536 | { |
| 2537 | while (__root != nullptr) |
| 2538 | { |
| 2539 | if (!value_comp()(__root->__value_, __v)) |
| 2540 | { |
| 2541 | __result = static_cast<__iter_pointer>(__root); |
| 2542 | __root = static_cast<__node_pointer>(__root->__left_); |
| 2543 | } |
| 2544 | else |
| 2545 | __root = static_cast<__node_pointer>(__root->__right_); |
| 2546 | } |
| 2547 | return iterator(__result); |
| 2548 | } |
| 2549 | |
| 2550 | template <class _Tp, class _Compare, class _Allocator> |
| 2551 | template <class _Key> |
| 2552 | typename __tree<_Tp, _Compare, _Allocator>::const_iterator |
| 2553 | __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v, |
| 2554 | __node_pointer __root, |
| 2555 | __iter_pointer __result) const |
| 2556 | { |
| 2557 | while (__root != nullptr) |
| 2558 | { |
| 2559 | if (!value_comp()(__root->__value_, __v)) |
| 2560 | { |
| 2561 | __result = static_cast<__iter_pointer>(__root); |
| 2562 | __root = static_cast<__node_pointer>(__root->__left_); |
| 2563 | } |
| 2564 | else |
| 2565 | __root = static_cast<__node_pointer>(__root->__right_); |
| 2566 | } |
| 2567 | return const_iterator(__result); |
| 2568 | } |
| 2569 | |
| 2570 | template <class _Tp, class _Compare, class _Allocator> |
| 2571 | template <class _Key> |
| 2572 | typename __tree<_Tp, _Compare, _Allocator>::iterator |
| 2573 | __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, |
| 2574 | __node_pointer __root, |
| 2575 | __iter_pointer __result) |
| 2576 | { |
| 2577 | while (__root != nullptr) |
| 2578 | { |
| 2579 | if (value_comp()(__v, __root->__value_)) |
| 2580 | { |
| 2581 | __result = static_cast<__iter_pointer>(__root); |
| 2582 | __root = static_cast<__node_pointer>(__root->__left_); |
| 2583 | } |
| 2584 | else |
| 2585 | __root = static_cast<__node_pointer>(__root->__right_); |
| 2586 | } |
| 2587 | return iterator(__result); |
| 2588 | } |
| 2589 | |
| 2590 | template <class _Tp, class _Compare, class _Allocator> |
| 2591 | template <class _Key> |
| 2592 | typename __tree<_Tp, _Compare, _Allocator>::const_iterator |
| 2593 | __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, |
| 2594 | __node_pointer __root, |
| 2595 | __iter_pointer __result) const |
| 2596 | { |
| 2597 | while (__root != nullptr) |
| 2598 | { |
| 2599 | if (value_comp()(__v, __root->__value_)) |
| 2600 | { |
| 2601 | __result = static_cast<__iter_pointer>(__root); |
| 2602 | __root = static_cast<__node_pointer>(__root->__left_); |
| 2603 | } |
| 2604 | else |
| 2605 | __root = static_cast<__node_pointer>(__root->__right_); |
| 2606 | } |
| 2607 | return const_iterator(__result); |
| 2608 | } |
| 2609 | |
| 2610 | template <class _Tp, class _Compare, class _Allocator> |
| 2611 | template <class _Key> |
| 2612 | pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, |
| 2613 | typename __tree<_Tp, _Compare, _Allocator>::iterator> |
| 2614 | __tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k) |
| 2615 | { |
| 2616 | typedef pair<iterator, iterator> _Pp; |
| 2617 | __iter_pointer __result = __end_node(); |
| 2618 | __node_pointer __rt = __root(); |
| 2619 | while (__rt != nullptr) |
| 2620 | { |
| 2621 | if (value_comp()(__k, __rt->__value_)) |
| 2622 | { |
| 2623 | __result = static_cast<__iter_pointer>(__rt); |
| 2624 | __rt = static_cast<__node_pointer>(__rt->__left_); |
| 2625 | } |
| 2626 | else if (value_comp()(__rt->__value_, __k)) |
| 2627 | __rt = static_cast<__node_pointer>(__rt->__right_); |
| 2628 | else |
| 2629 | return _Pp(iterator(__rt), |
| 2630 | iterator( |
| 2631 | __rt->__right_ != nullptr ? |
| 2632 | static_cast<__iter_pointer>(_VSTDstd::__1::__tree_min(__rt->__right_)) |
| 2633 | : __result)); |
| 2634 | } |
| 2635 | return _Pp(iterator(__result), iterator(__result)); |
| 2636 | } |
| 2637 | |
| 2638 | template <class _Tp, class _Compare, class _Allocator> |
| 2639 | template <class _Key> |
| 2640 | pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator, |
| 2641 | typename __tree<_Tp, _Compare, _Allocator>::const_iterator> |
| 2642 | __tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k) const |
| 2643 | { |
| 2644 | typedef pair<const_iterator, const_iterator> _Pp; |
| 2645 | __iter_pointer __result = __end_node(); |
| 2646 | __node_pointer __rt = __root(); |
| 2647 | while (__rt != nullptr) |
| 2648 | { |
| 2649 | if (value_comp()(__k, __rt->__value_)) |
| 2650 | { |
| 2651 | __result = static_cast<__iter_pointer>(__rt); |
| 2652 | __rt = static_cast<__node_pointer>(__rt->__left_); |
| 2653 | } |
| 2654 | else if (value_comp()(__rt->__value_, __k)) |
| 2655 | __rt = static_cast<__node_pointer>(__rt->__right_); |
| 2656 | else |
| 2657 | return _Pp(const_iterator(__rt), |
| 2658 | const_iterator( |
| 2659 | __rt->__right_ != nullptr ? |
| 2660 | static_cast<__iter_pointer>(_VSTDstd::__1::__tree_min(__rt->__right_)) |
| 2661 | : __result)); |
| 2662 | } |
| 2663 | return _Pp(const_iterator(__result), const_iterator(__result)); |
| 2664 | } |
| 2665 | |
| 2666 | template <class _Tp, class _Compare, class _Allocator> |
| 2667 | template <class _Key> |
| 2668 | pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, |
| 2669 | typename __tree<_Tp, _Compare, _Allocator>::iterator> |
| 2670 | __tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k) |
| 2671 | { |
| 2672 | typedef pair<iterator, iterator> _Pp; |
| 2673 | __iter_pointer __result = __end_node(); |
| 2674 | __node_pointer __rt = __root(); |
| 2675 | while (__rt != nullptr) |
| 2676 | { |
| 2677 | if (value_comp()(__k, __rt->__value_)) |
| 2678 | { |
| 2679 | __result = static_cast<__iter_pointer>(__rt); |
| 2680 | __rt = static_cast<__node_pointer>(__rt->__left_); |
| 2681 | } |
| 2682 | else if (value_comp()(__rt->__value_, __k)) |
| 2683 | __rt = static_cast<__node_pointer>(__rt->__right_); |
| 2684 | else |
| 2685 | return _Pp(__lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), static_cast<__iter_pointer>(__rt)), |
| 2686 | __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result)); |
| 2687 | } |
| 2688 | return _Pp(iterator(__result), iterator(__result)); |
| 2689 | } |
| 2690 | |
| 2691 | template <class _Tp, class _Compare, class _Allocator> |
| 2692 | template <class _Key> |
| 2693 | pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator, |
| 2694 | typename __tree<_Tp, _Compare, _Allocator>::const_iterator> |
| 2695 | __tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k) const |
| 2696 | { |
| 2697 | typedef pair<const_iterator, const_iterator> _Pp; |
| 2698 | __iter_pointer __result = __end_node(); |
| 2699 | __node_pointer __rt = __root(); |
| 2700 | while (__rt != nullptr) |
| 2701 | { |
| 2702 | if (value_comp()(__k, __rt->__value_)) |
| 2703 | { |
| 2704 | __result = static_cast<__iter_pointer>(__rt); |
| 2705 | __rt = static_cast<__node_pointer>(__rt->__left_); |
| 2706 | } |
| 2707 | else if (value_comp()(__rt->__value_, __k)) |
| 2708 | __rt = static_cast<__node_pointer>(__rt->__right_); |
| 2709 | else |
| 2710 | return _Pp(__lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), static_cast<__iter_pointer>(__rt)), |
| 2711 | __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result)); |
| 2712 | } |
| 2713 | return _Pp(const_iterator(__result), const_iterator(__result)); |
| 2714 | } |
| 2715 | |
| 2716 | template <class _Tp, class _Compare, class _Allocator> |
| 2717 | typename __tree<_Tp, _Compare, _Allocator>::__node_holder |
| 2718 | __tree<_Tp, _Compare, _Allocator>::remove(const_iterator __p) _NOEXCEPTnoexcept |
| 2719 | { |
| 2720 | __node_pointer __np = __p.__get_np(); |
| 2721 | if (__begin_node() == __p.__ptr_) |
| 2722 | { |
| 2723 | if (__np->__right_ != nullptr) |
| 2724 | __begin_node() = static_cast<__iter_pointer>(__np->__right_); |
| 2725 | else |
| 2726 | __begin_node() = static_cast<__iter_pointer>(__np->__parent_); |
| 2727 | } |
| 2728 | --size(); |
| 2729 | _VSTDstd::__1::__tree_remove(__end_node()->__left_, |
| 2730 | static_cast<__node_base_pointer>(__np)); |
| 2731 | return __node_holder(__np, _Dp(__node_alloc(), true)); |
| 2732 | } |
| 2733 | |
| 2734 | template <class _Tp, class _Compare, class _Allocator> |
| 2735 | inline _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__ )) |
| 2736 | void |
| 2737 | swap(__tree<_Tp, _Compare, _Allocator>& __x, |
| 2738 | __tree<_Tp, _Compare, _Allocator>& __y) |
| 2739 | _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))noexcept(noexcept(__x.swap(__y))) |
| 2740 | { |
| 2741 | __x.swap(__y); |
| 2742 | } |
| 2743 | |
| 2744 | _LIBCPP_END_NAMESPACE_STD} } |
| 2745 | |
| 2746 | _LIBCPP_POP_MACROSpop_macro("min") pop_macro("max") |
| 2747 | |
| 2748 | #endif // _LIBCPP___TREE |