doc/html/boost_asio/example/timers/tick_count_timer.cpp

//
// tick_count_timer.cpp
// ~~~~~~~~~~~~~~~~~~~~
//
// Copyright (c) 2003-2010 Christopher M. Kohlhoff (chris at kohlhoff dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//

#include <boost/asio.hpp>
#include <ctime>
#include <iostream>

#if defined(WIN32)
# include <windows.h>
#else
# error This example is for Windows only!
#endif

struct tick_count_traits
{
	// The time type. This type has no constructor that takes a DWORD to ensure
	// that the timer can only be used with relative times.
	class time_type
	{
	public:
		time_type() : ticks_(0) {}
	private:
		friend struct tick_count_traits;
		DWORD ticks_;
	};

	// The duration type.
	class duration_type
	{
	public:
		duration_type() : ticks_(0) {}
		duration_type(DWORD ticks) : ticks_(ticks) {}
	private:
		friend struct tick_count_traits;
		DWORD ticks_;
	};

	// Get the current time.
	static time_type now()
	{
		time_type result;
		result.ticks_ = ::GetTickCount();
		return result;
	}

	// Add a duration to a time.
	static time_type add(const time_type& t, const duration_type& d)
	{
		time_type result;
		result.ticks_ = t.ticks_ + d.ticks_;
		return result;
	}

	// Subtract one time from another.
	static duration_type subtract(const time_type& t1, const time_type& t2)
	{
		return duration_type(t1.ticks_ - t2.ticks_);
	}

	// Test whether one time is less than another.
	static bool less_than(const time_type& t1, const time_type& t2)
	{
		// DWORD tick count values wrap periodically, so we'll use a heuristic that
		// says that if subtracting t1 from t2 yields a value smaller than 2^31,
		// then t1 is probably less than t2. This means that we can't handle
		// durations larger than 2^31, which shouldn't be a problem in practice.
		return (t2.ticks_ - t1.ticks_) < static_cast<DWORD>(1 << 31);
	}

	// Convert to POSIX duration type.
	static boost::posix_time::time_duration to_posix_duration(
		const duration_type& d)
	{
		return boost::posix_time::milliseconds(d.ticks_);
	}
};

typedef boost::asio::basic_deadline_timer<
	DWORD, tick_count_traits> tick_count_timer;

void handle_timeout(const boost::system::error_code&)
{
	std::cout << "handle_timeout\n";
}

int main()
{
	try
	{
		boost::asio::io_service io_service;

		tick_count_timer timer(io_service, 5000);
		std::cout << "Starting synchronous wait\n";
		timer.wait();
		std::cout << "Finished synchronous wait\n";

		timer.expires_from_now(5000);
		std::cout << "Starting asynchronous wait\n";
		timer.async_wait(handle_timeout);
		io_service.run();
		std::cout << "Finished asynchronous wait\n";
	}
	catch (std::exception& e)
	{
		std::cout << "Exception: " << e.what() << "\n";
	}

	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值