0178810659
Because chromium is compiled with a different version of logging macros defined in logging.h that header cannot be used in headers that can also included from chromium code. Removed LOG_F(LS_WARNING) from callback.h . That issue would block this code from being rolled in chromium. R=mallinath@webrtc.org Review URL: https://webrtc-codereview.appspot.com/8279004 git-svn-id: http://webrtc.googlecode.com/svn/trunk@5507 4adac7df-926f-26a2-2b94-8c16560cd09d
121 lines
4.5 KiB
Plaintext
121 lines
4.5 KiB
Plaintext
/*
|
|
* libjingle
|
|
* Copyright 2012 Google Inc.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
|
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
// To generate callback.h from callback.h.pump, execute:
|
|
// /home/build/google3/third_party/gtest/scripts/pump.py callback.h.pump
|
|
|
|
// Callbacks are callable object containers. They can hold a function pointer
|
|
// or a function object and behave like a value type. Internally, data is
|
|
// reference-counted, making copies and pass-by-value inexpensive.
|
|
//
|
|
// Callbacks are typed using template arguments. The format is:
|
|
// CallbackN<ReturnType, ParamType1, ..., ParamTypeN>
|
|
// where N is the number of arguments supplied to the callable object.
|
|
// Callbacks are invoked using operator(), just like a function or a function
|
|
// object. Default-constructed callbacks are "empty," and executing an empty
|
|
// callback does nothing. A callback can be made empty by assigning it from
|
|
// a default-constructed callback.
|
|
//
|
|
// Callbacks are similar in purpose to std::function (which isn't available on
|
|
// all platforms we support) and a lightweight alternative to sigslots. Since
|
|
// they effectively hide the type of the object they call, they're useful in
|
|
// breaking dependencies between objects that need to interact with one another.
|
|
// Notably, they can hold the results of Bind(), std::bind*, etc, without needing
|
|
// to know the resulting object type of those calls.
|
|
//
|
|
// Sigslots, on the other hand, provide a fuller feature set, such as multiple
|
|
// subscriptions to a signal, optional thread-safety, and lifetime tracking of
|
|
// slots. When these features are needed, choose sigslots.
|
|
//
|
|
// Example:
|
|
// int sqr(int x) { return x * x; }
|
|
// struct AddK {
|
|
// int k;
|
|
// int operator()(int x) const { return x + k; }
|
|
// } add_k = {5};
|
|
//
|
|
// Callback1<int, int> my_callback;
|
|
// cout << my_callback.empty() << endl; // true
|
|
//
|
|
// my_callback = Callback1<int, int>(&sqr);
|
|
// cout << my_callback.empty() << endl; // false
|
|
// cout << my_callback(3) << endl; // 9
|
|
//
|
|
// my_callback = Callback1<int, int>(add_k);
|
|
// cout << my_callback(10) << endl; // 15
|
|
//
|
|
// my_callback = Callback1<int, int>();
|
|
// cout << my_callback.empty() << endl; // true
|
|
|
|
#ifndef TALK_BASE_CALLBACK_H_
|
|
#define TALK_BASE_CALLBACK_H_
|
|
|
|
#include "talk/base/refcount.h"
|
|
#include "talk/base/scoped_ref_ptr.h"
|
|
|
|
namespace talk_base {
|
|
|
|
$var n = 5
|
|
$range i 0..n
|
|
$for i [[
|
|
$range j 1..i
|
|
|
|
template <class R$for j [[,
|
|
class P$j]]>
|
|
class Callback$i {
|
|
public:
|
|
// Default copy operations are appropriate for this class.
|
|
Callback$i() {}
|
|
template <class T> Callback$i(const T& functor)
|
|
: helper_(new RefCountedObject< HelperImpl<T> >(functor)) {}
|
|
R operator()($for j , [[P$j p$j]]) {
|
|
if (empty())
|
|
return R();
|
|
return helper_->Run($for j , [[p$j]]);
|
|
}
|
|
bool empty() const { return !helper_; }
|
|
|
|
private:
|
|
struct Helper : RefCountInterface {
|
|
virtual ~Helper() {}
|
|
virtual R Run($for j , [[P$j p$j]]) = 0;
|
|
};
|
|
template <class T> struct HelperImpl : Helper {
|
|
explicit HelperImpl(const T& functor) : functor_(functor) {}
|
|
virtual R Run($for j , [[P$j p$j]]) {
|
|
return functor_($for j , [[p$j]]);
|
|
}
|
|
T functor_;
|
|
};
|
|
scoped_refptr<Helper> helper_;
|
|
};
|
|
|
|
]]
|
|
} // namespace talk_base
|
|
|
|
#endif // TALK_BASE_CALLBACK_H_
|