/* * Copyright (c) 2000-2001 Apple Computer, Inc. All Rights Reserved. * * The contents of this file constitute Original Code as defined in and are * subject to the Apple Public Source License Version 1.2 (the 'License'). * You may not use this file except in compliance with the License. Please obtain * a copy of the License at http://www.apple.com/publicsource and read it before * using this file. * * This Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the * specific language governing rights and limitations under the License. */ // // walkers - facilities for traversing and manipulating recursive data structures // // Theory of operation: // @@@ TBA // #ifdef __MWERKS__ #define _CPP_WALKERS #endif #include <Security/walkers.h> namespace Security { namespace DataWalkers { // // Free all recorded storage nodes for a ChunkFreeWalker // void ChunkFreeWalker::free() { for (set<void *>::iterator it = freeSet.begin(); it != freeSet.end(); it++) allocator.free(*it); freeSet.erase(freeSet.begin(), freeSet.end()); } } // end namespace DataWalkers } // end namespace Security