55 lines
2.1 KiB
C++
55 lines
2.1 KiB
C++
// vim: set ts=4 sw=4 tw=99 noet :
|
|
// =============================================================================
|
|
// SourceMod
|
|
// Copyright (C) 2004-2008 AlliedModders LLC. All rights reserved.
|
|
// =============================================================================
|
|
|
|
// This program is free software; you can redistribute it and/or modify it under
|
|
// the terms of the GNU General Public License, version 3.0, as published by the
|
|
// Free Software Foundation.
|
|
//
|
|
// This program is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
// FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
|
|
// details.
|
|
|
|
// You should have received a copy of the GNU General Public License along with
|
|
// this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
// As a special exception, AlliedModders LLC gives you permission to link the
|
|
// code of this program (as well as its derivative works) to "Half-Life 2," the
|
|
// "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
|
|
// by the Valve Corporation. You must obey the GNU General Public License in
|
|
// all respects for all other code used. Additionally, AlliedModders LLC grants
|
|
// this exception to all derivative works. AlliedModders LLC defines further
|
|
// exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
|
|
// or <http://www.sourcemod.net/license.php>.
|
|
#include "frame_tasks.h"
|
|
#include <am-vector.h>
|
|
|
|
using namespace SourceMod;
|
|
|
|
ke::Vector<ke::Lambda<void()>> sNextTasks;
|
|
ke::Vector<ke::Lambda<void()>> sWorkTasks;
|
|
|
|
void
|
|
SourceMod::ScheduleTaskForNextFrame(ke::Lambda<void()>&& task)
|
|
{
|
|
sNextTasks.append(ke::Forward<decltype(task)>(task));
|
|
}
|
|
|
|
void
|
|
SourceMod::RunScheduledFrameTasks(bool simulating)
|
|
{
|
|
if (sNextTasks.empty())
|
|
return;
|
|
|
|
// Swap.
|
|
ke::Vector<ke::Lambda<void()>> temp(ke::Move(sNextTasks));
|
|
sNextTasks = ke::Move(sWorkTasks);
|
|
sWorkTasks = ke::Move(temp);
|
|
|
|
for (size_t i = 0; i < sWorkTasks.length(); i++)
|
|
sWorkTasks[i]();
|
|
sWorkTasks.clear();
|
|
} |