 	assert(SanityCheck());
 }
 
-void CudaAllocBuckets::Compact(size_t extra) { 
+void CudaAllocBuckets::Compact(size_t extra) {
 	while(_allocated + extra > _capacity && _allocated > _committed) {
 		// Walk the priority queue from beginning to end removing nodes.
 		MemList::iterator memIt = _priorityMap.begin()->second;

/******************************************************************************
 * Copyright (c) 2013, NVIDIA CORPORATION.  All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright

	}
	if(cudaSuccess != error) return error;

	MemList::iterator memIt =
		_memLists[bucket].insert(_memLists[bucket].end(), MemNode());
	memIt->bucket = bucket;
	memIt->address = _addressMap.insert(std::make_pair(*p, memIt)).first;
