/* * Copyright (c) 2000-2001,2003-2004 Apple Computer, Inc. All Rights Reserved. * * @APPLE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this * file. * * The 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. * * @APPLE_LICENSE_HEADER_END@ */ // // walkers - facilities for traversing and manipulating recursive data structures // #include <security_cdsa_utilities/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