SYMBOL INDEX (801 symbols across 83 files)

FILE: libs/googleTest/1.7.0/include/gtest/gtest-death-test.h
  function namespace (line 43) | namespace testing {

FILE: libs/googleTest/1.7.0/include/gtest/gtest-message.h
  function namespace (line 57) | namespace testing {
  function StreamHelper (line 206) | void StreamHelper(internal::true_type /*is_pointer*/, T* pointer) {
  function StreamHelper (line 214) | void StreamHelper(internal::false_type /*is_pointer*/,
  function namespace (line 236) | namespace internal {

FILE: libs/googleTest/1.7.0/include/gtest/gtest-param-test.h
  function class (line 162) | class BaseTest : public ::testing::Test {
  function namespace (line 197) | namespace testing {
  function internal (line 1220) | inline internal::ParamGenerator<bool> Bool() {

FILE: libs/googleTest/1.7.0/include/gtest/gtest-printers.h
  function namespace (line 106) | namespace testing {
  function namespace (line 213) | namespace testing_internal {
  function namespace (line 250) | namespace testing {
  function PrintTo (line 458) | inline void PrintTo(const ::string& s, ::std::ostream* os) {
  function PrintTo (line 464) | inline void PrintTo(const ::std::string& s, ::std::ostream* os) {
  function PrintTo (line 471) | inline void PrintTo(const ::wstring& s, ::std::ostream* os) {
  function PrintTo (line 478) | inline void PrintTo(const ::std::wstring& s, ::std::ostream* os) {
  function PrintTo (line 497) | inline void PrintTo(const ::std::tr1::tuple<>& t, ::std::ostream* os) {
  function Print (line 591) | static void Print(const T& value, ::std::ostream* os) {
  function Print (line 662) | static void Print(const T& value, ::std::ostream* os) {
  function Print (line 704) | static void Print(const char* str, ::std::ostream* os) {

FILE: libs/googleTest/1.7.0/include/gtest/gtest-spi.h
  function namespace (line 40) | namespace testing {

FILE: libs/googleTest/1.7.0/include/gtest/gtest-test-part.h
  function namespace (line 41) | namespace testing {
  function class (line 126) | class GTEST_API_ TestPartResultArray {
  function class (line 146) | class TestPartResultReporterInterface {
  function namespace (line 153) | namespace internal {

FILE: libs/googleTest/1.7.0/include/gtest/gtest-typed-test.h
  type testing (line 57) | typedef testing::Types<char, int, unsigned int> MyTypes;
  type testing (line 140) | typedef testing::Types<char, int, unsigned int> MyTypes;

FILE: libs/googleTest/1.7.0/include/gtest/gtest.h
  function namespace (line 83) | namespace testing {
  function namespace (line 1676) | namespace internal {
  function class (line 1723) | class GTEST_API_ AssertHelper {
  function virtual (line 1803) | virtual ~WithParamInterface() {}

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-death-test-internal.h
  function namespace (line 44) | namespace testing {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-filepath.h
  function namespace (line 45) | namespace testing {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-internal.h
  function namespace (line 77) | namespace proto2 { class Message; }
  function namespace (line 79) | namespace testing {
  type IsContainer (line 859) | typedef int IsContainer;
  type IsNotContainer (line 867) | typedef char IsNotContainer;
  function IsContainerTest (line 869) | IsContainerTest(long /* dummy */) { return '\0'; }
  type EnableIf (line 876) | struct EnableIf
  type type (line 876) | typedef void type;
  function ArrayEq (line 889) | bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; }
  function ArrayEq (line 893) | bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) {
  function CopyArray (line 929) | void CopyArray(const T& from, U* to) { *to = from; }
  function CopyArray (line 933) | void CopyArray(const T(&from)[N], U(*to)[N]) {
  type RelationToSource (line 949) | enum RelationToSource {
  type Element (line 968) | typedef Element* iterator;
  type Element (line 969) | typedef const Element* const_iterator;

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-linked_ptr.h
  function namespace (line 76) | namespace testing {
  function T (line 172) | T* get() const { return value_; }
  function depart (line 194) | void depart() {
  function capture (line 198) | void capture(T* ptr) {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-param-util-generated.h
  function namespace (line 57) | namespace testing {
  function virtual (line 3167) | virtual ~CartesianProductGenerator2() {}
  function virtual (line 3169) | virtual ParamIteratorInterface<ParamType>* Begin() const {
  function virtual (line 3172) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 3189) | virtual ~Iterator() {}
  function virtual (line 3191) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 3196) | virtual void Advance() {
  function virtual (line 3205) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 3208) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 3209) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 3238) | void ComputeCurrentValue() {
  function virtual (line 3282) | virtual ~CartesianProductGenerator3() {}
  function virtual (line 3284) | virtual ParamIteratorInterface<ParamType>* Begin() const {
  function virtual (line 3288) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 3308) | virtual ~Iterator() {}
  function virtual (line 3310) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 3315) | virtual void Advance() {
  function virtual (line 3328) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 3331) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 3332) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 3365) | void ComputeCurrentValue() {
  function virtual (line 3415) | virtual ~CartesianProductGenerator4() {}
  function virtual (line 3417) | virtual ParamIteratorInterface<ParamType>* Begin() const {
  function virtual (line 3421) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 3445) | virtual ~Iterator() {}
  function virtual (line 3447) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 3452) | virtual void Advance() {
  function virtual (line 3469) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 3472) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 3473) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 3510) | void ComputeCurrentValue() {
  function virtual (line 3566) | virtual ~CartesianProductGenerator5() {}
  function virtual (line 3568) | virtual ParamIteratorInterface<ParamType>* Begin() const {
  function virtual (line 3572) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 3599) | virtual ~Iterator() {}
  function virtual (line 3601) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 3606) | virtual void Advance() {
  function virtual (line 3627) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 3630) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 3631) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 3672) | void ComputeCurrentValue() {
  type std (line 3729) | typedef ::std::tr1::tuple<T1, T2, T3, T4, T5, T6> ParamType;
  function virtual (line 3736) | virtual ~CartesianProductGenerator6() {}
  function virtual (line 3738) | virtual ParamIteratorInterface<ParamType>* Begin() const {
  function virtual (line 3742) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 3772) | virtual ~Iterator() {}
  function virtual (line 3774) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 3779) | virtual void Advance() {
  function virtual (line 3804) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 3807) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 3808) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 3853) | void ComputeCurrentValue() {
  type std (line 3915) | typedef ::std::tr1::tuple<T1, T2, T3, T4, T5, T6, T7> ParamType;
  function virtual (line 3922) | virtual ~CartesianProductGenerator7() {}
  function virtual (line 3924) | virtual ParamIteratorInterface<ParamType>* Begin() const {
  function virtual (line 3929) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 3962) | virtual ~Iterator() {}
  function virtual (line 3964) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 3969) | virtual void Advance() {
  function virtual (line 3998) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 4001) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 4002) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 4051) | void ComputeCurrentValue() {
  type std (line 4118) | typedef ::std::tr1::tuple<T1, T2, T3, T4, T5, T6, T7, T8> ParamType;
  function virtual (line 4134) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 4171) | virtual ~Iterator() {}
  function virtual (line 4173) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 4178) | virtual void Advance() {
  function virtual (line 4211) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 4214) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 4215) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 4268) | void ComputeCurrentValue() {
  type std (line 4340) | typedef ::std::tr1::tuple<T1, T2, T3, T4, T5, T6, T7, T8, T9> ParamType;
  function virtual (line 4356) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 4396) | virtual ~Iterator() {}
  function virtual (line 4398) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 4403) | virtual void Advance() {
  function virtual (line 4440) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 4443) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 4444) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 4501) | void ComputeCurrentValue() {
  type std (line 4579) | typedef ::std::tr1::tuple<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Param...
  function virtual (line 4596) | virtual ParamIteratorInterface<ParamType>* End() const {
  function virtual (line 4639) | virtual ~Iterator() {}
  function virtual (line 4641) | virtual const ParamGeneratorInterface<ParamType>* BaseGenerator() const {
  function virtual (line 4646) | virtual void Advance() {
  function virtual (line 4687) | virtual ParamIteratorInterface<ParamType>* Clone() const {
  function virtual (line 4690) | virtual const ParamType* Current() const { return &current_value_; }
  function virtual (line 4691) | virtual bool Equals(const ParamIteratorInterface<ParamType>& other) const {
  function ComputeCurrentValue (line 4752) | void ComputeCurrentValue() {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-param-util.h
  function namespace (line 51) | namespace testing {
  function CalculateEndIndex (line 242) | static int CalculateEndIndex(const T& begin,
  function virtual (line 273) | virtual ~ValuesInIteratorRangeGenerator() {}
  function virtual (line 275) | virtual ParamIteratorInterface<T>* Begin() const {
  function virtual (line 278) | virtual ParamIteratorInterface<T>* End() const {
  function class (line 285) | class Iterator : public ParamIteratorInterface<T> {
  function explicit (line 356) | explicit ParameterizedTestFactory(ParamType parameter) :
  function virtual (line 358) | virtual Test* CreateTest() {
  function virtual (line 397) | virtual TestFactoryBase* CreateTestFactory(ParamType parameter) {
  function class (line 415) | class ParameterizedTestCaseInfoBase {
  type ParamGenerator (line 451) | typedef ParamGenerator<ParamType>(GeneratorCreationFunc)();
  function explicit (line 453) | explicit ParameterizedTestCaseInfo(const char* name)
  function AddTestPattern (line 466) | void AddTestPattern(const char* test_case_name,
  function AddTestCaseInstantiation (line 475) | int AddTestCaseInstantiation(const string& instantiation_name,
  function virtual (line 487) | virtual void RegisterTests() {
  type TestInfo (line 525) | struct TestInfo {
  type std (line 537) | typedef ::std::vector<linked_ptr<TestInfo> > TestInfoContainer;
  type std (line 540) | typedef ::std::vector<std::pair<string, GeneratorCreationFunc*> >
  function class (line 556) | class ParameterizedTestCaseRegistry {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-port.h
  function namespace (line 553) | namespace std {
  function namespace (line 785) | namespace testing {
  function LogToStderr (line 1043) | inline void LogToStderr() {}
  function FlushInfoLog (line 1044) | inline void FlushInfoLog() { fflush(NULL); }
  function To (line 1098) | To ImplicitCast_(To x) { return x; }
  function To (line 1122) | To DownCast_(From* f) {  // so we only accept pointers
  function SleepMilliseconds (line 1188) | inline void SleepMilliseconds(int n) {
  function class (line 1202) | class Notification {
  function class (line 1244) | class ThreadWithParamBase {
  function Join (line 1292) | void Join() {
  function virtual (line 1299) | virtual void Run() {
  function class (line 1336) | class MutexBase {
  function class (line 1394) | class Mutex : public MutexBase {
  function class (line 1411) | class GTestMutexLock {
  type GTestMutexLock (line 1424) | typedef GTestMutexLock MutexLock;
  function class (line 1432) | class ThreadLocalValueHolderBase {
  function DeleteThreadLocalValue (line 1439) | inline void DeleteThreadLocalValue(void* value_holder) {
  function explicit (line 1477) | explicit ThreadLocal(const T& value) : key_(CreateKey()),
  function T (line 1489) | T* pointer() { return GetOrCreateValue(); }
  function T (line 1490) | const T* pointer() const { return GetOrCreateValue(); }
  function set (line 1492) | void set(const T& value) { *pointer() = value; }
  function T (line 1500) | T* pointer() { return &value_; }
  function pthread_key_t (line 1507) | static pthread_key_t CreateKey() {
  function T (line 1516) | T* GetOrCreateValue() const {
  function class (line 1545) | class Mutex {
  function class (line 1558) | class GTestMutexLock {
  type GTestMutexLock (line 1563) | typedef GTestMutexLock MutexLock;
  function explicit (line 1569) | explicit ThreadLocal(const T& value) : value_(value) {}
  function T (line 1570) | T* pointer() { return &value_; }
  function T (line 1571) | const T* pointer() const { return &value_; }
  function set (line 1573) | void set(const T& value) { value_ = value; }
  type bool_constant (line 1612) | typedef bool_constant<bool_value> type;
  type bool_constant (line 1617) | typedef bool_constant<false> false_type;
  type bool_constant (line 1618) | typedef bool_constant<true> true_type;
  type typename (line 1628) | typedef typename Iterator::value_type value_type;
  type T (line 1633) | typedef T value_type;
  type T (line 1638) | typedef T value_type;
  type __int64 (line 1645) | typedef __int64 BiggestInt;
  type BiggestInt (line 1649) | typedef long long BiggestInt;
  function IsAlpha (line 1659) | inline bool IsAlpha(char ch) {
  function IsAlNum (line 1662) | inline bool IsAlNum(char ch) {
  function IsDigit (line 1665) | inline bool IsDigit(char ch) {
  function IsLower (line 1668) | inline bool IsLower(char ch) {
  function IsSpace (line 1671) | inline bool IsSpace(char ch) {
  function IsUpper (line 1674) | inline bool IsUpper(char ch) {
  function IsXDigit (line 1677) | inline bool IsXDigit(char ch) {
  function IsXDigit (line 1680) | inline bool IsXDigit(wchar_t ch) {
  function ToLower (line 1685) | inline char ToLower(char ch) {
  function ToUpper (line 1688) | inline char ToUpper(char ch) {
  function namespace (line 1698) | namespace posix {
  type UInt (line 1883) | typedef unsigned int UInt;
  type __int64 (line 1891) | typedef __int64 Int;
  type UInt (line 1892) | typedef unsigned __int64 UInt;
  type Int (line 1894) | typedef long long Int;
  type UInt (line 1895) | typedef unsigned long long UInt;
  type TypeWithSize (line 1900) | typedef TypeWithSize<4>::Int Int32;
  type TypeWithSize (line 1901) | typedef TypeWithSize<4>::UInt UInt32;
  type TypeWithSize (line 1902) | typedef TypeWithSize<8>::Int Int64;
  type TypeWithSize (line 1903) | typedef TypeWithSize<8>::UInt UInt64;
  type TypeWithSize (line 1904) | typedef TypeWithSize<8>::Int TimeInMillis;

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-string.h
  function namespace (line 54) | namespace testing {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-tuple.h
  function namespace (line 104) | namespace std {
  function GTEST_1_TUPLE_ (line 205) | GTEST_1_TUPLE_(T) {
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 225) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 266) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 301) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 340) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 382) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 427) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 474) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 524) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 576) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function GTEST_DECLARE_TUPLE_AS_FRIEND_ (line 632) | GTEST_DECLARE_TUPLE_AS_FRIEND_
  function make_tuple (line 675) | GTEST_2_TUPLE_(T) make_tuple(const T0& f0, const T1& f1) {
  function make_tuple (line 680) | GTEST_3_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2) {
  function make_tuple (line 685) | GTEST_4_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  function make_tuple (line 691) | GTEST_5_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  function make_tuple (line 697) | GTEST_6_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  function make_tuple (line 703) | GTEST_7_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  function make_tuple (line 709) | GTEST_8_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  function make_tuple (line 715) | GTEST_9_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  function make_tuple (line 722) | GTEST_10_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2,
  type typename (line 789) | typedef typename gtest_internal::TupleElement<
  function namespace (line 797) | namespace gtest_internal {
  function namespace (line 937) | namespace gtest_internal {

FILE: libs/googleTest/1.7.0/include/gtest/internal/gtest-type-util.h
  function namespace (line 57) | namespace testing {
  type internal (line 754) | typedef internal::Types50<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, ...
  type Types (line 761) | struct Types
  type internal (line 790) | typedef internal::Types1<T1> type;
  type internal (line 806) | typedef internal::Types2<T1, T2> type;
  type internal (line 821) | typedef internal::Types3<T1, T2, T3> type;
  type internal (line 836) | typedef internal::Types4<T1, T2, T3, T4> type;
  type internal (line 851) | typedef internal::Types5<T1, T2, T3, T4, T5> type;
  type internal (line 867) | typedef internal::Types6<T1, T2, T3, T4, T5, T6> type;
  type internal (line 883) | typedef internal::Types7<T1, T2, T3, T4, T5, T6, T7> type;
  type internal (line 898) | typedef internal::Types8<T1, T2, T3, T4, T5, T6, T7, T8> type;
  type internal (line 913) | typedef internal::Types9<T1, T2, T3, T4, T5, T6, T7, T8, T9> type;
  function namespace (line 1620) | namespace internal {
  type Templates4 (line 1690) | typedef Templates4<T2, T3, T4, T5> Tail;
  type Templates5 (line 1697) | typedef Templates5<T2, T3, T4, T5, T6> Tail;
  type Templates6 (line 1705) | typedef Templates6<T2, T3, T4, T5, T6, T7> Tail;
  type Templates7 (line 1713) | typedef Templates7<T2, T3, T4, T5, T6, T7, T8> Tail;
  type Templates8 (line 1721) | typedef Templates8<T2, T3, T4, T5, T6, T7, T8, T9> Tail;
  type Templates9 (line 1730) | typedef Templates9<T2, T3, T4, T5, T6, T7, T8, T9, T10> Tail;
  type Templates10 (line 1739) | typedef Templates10<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Tail;
  type Templates11 (line 1748) | typedef Templates11<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Tail;
  type Templates12 (line 1758) | typedef Templates12<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> ...
  type Templates13 (line 1768) | typedef Templates13<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13,
  type Templates14 (line 1779) | typedef Templates14<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates15 (line 1791) | typedef Templates15<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates16 (line 1803) | typedef Templates16<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates17 (line 1815) | typedef Templates17<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates18 (line 1828) | typedef Templates18<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates19 (line 1841) | typedef Templates19<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates20 (line 1854) | typedef Templates20<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates21 (line 1868) | typedef Templates21<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates22 (line 1882) | typedef Templates22<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates23 (line 1896) | typedef Templates23<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates24 (line 1911) | typedef Templates24<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates25 (line 1926) | typedef Templates25<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates26 (line 1941) | typedef Templates26<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates27 (line 1957) | typedef Templates27<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates28 (line 1974) | typedef Templates28<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates29 (line 1991) | typedef Templates29<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates30 (line 2009) | typedef Templates30<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates31 (line 2027) | typedef Templates31<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates32 (line 2045) | typedef Templates32<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates33 (line 2064) | typedef Templates33<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates34 (line 2083) | typedef Templates34<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates35 (line 2102) | typedef Templates35<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates36 (line 2122) | typedef Templates36<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates37 (line 2142) | typedef Templates37<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates38 (line 2162) | typedef Templates38<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates39 (line 2183) | typedef Templates39<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates40 (line 2204) | typedef Templates40<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates41 (line 2225) | typedef Templates41<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates42 (line 2248) | typedef Templates42<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates43 (line 2271) | typedef Templates43<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates44 (line 2294) | typedef Templates44<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates45 (line 2318) | typedef Templates45<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates46 (line 2342) | typedef Templates46<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates47 (line 2366) | typedef Templates47<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates48 (line 2391) | typedef Templates48<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates49 (line 2416) | typedef Templates49<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, ...
  type Templates (line 2469) | struct Templates
  type Types1 (line 3303) | typedef Types1<T> type;

FILE: src/competitiveProgramming/headers/FileBuilderSample.hpp
  function main (line 5) | int main(int argc, char **argv) {

FILE: src/competitiveProgramming/headers/competitive/programming/gametheory/Common.hpp
  type competitive (line 15) | namespace competitive {
    type programming (line 16) | namespace programming {
      type gametheory (line 17) | namespace gametheory {
        class IGame (line 21) | class IGame {
        class IMove (line 49) | class IMove {
        class ICancellableMove (line 72) | class ICancellableMove {
        class IMoveGenerator (line 104) | class IMoveGenerator {

FILE: src/competitiveProgramming/headers/competitive/programming/gametheory/TreeNode.hpp
  type competitive (line 13) | namespace competitive {
    type programming (line 14) | namespace programming {
      type gametheory (line 15) | namespace gametheory {
        class TreeNode (line 24) | class TreeNode {
          method TreeNode (line 26) | TreeNode(const M& move, int currentPlayer, const std::vector<dou...
          method TreeNode (line 29) | TreeNode(const TreeNode<M>& other) :
          method IScoreConverter (line 56) | IScoreConverter& getConverter() const {
          method getDepth (line 60) | int getDepth() const {
          method decrementDepth (line 64) | void decrementDepth() {
          method M (line 72) | const M& getMove() const {

FILE: src/competitiveProgramming/headers/competitive/programming/gametheory/maxntree/MaxNTree.hpp
  type competitive (line 35) | namespace competitive {
    type programming (line 36) | namespace programming {
      type gametheory (line 37) | namespace gametheory {
        type maxntree (line 38) | namespace maxntree {
          class MaxNTree (line 41) | class MaxNTree {
            method MaxNTree (line 53) | MaxNTree(timemanagement::Timer& timer, IScoreConverter& conver...
            method M (line 74) | M best(G& game, IMoveGenerator<M, G>& generator, int depthStar...
            method evaluations (line 94) | int evaluations() {
            method bestInternal (line 98) | TreeNode<M> bestInternal(int depth, G& board, IMoveGenerator<M...
            method evaluatesMoves (line 110) | std::set<TreeNode<M> > evaluatesMoves(std::vector<M>& generate...

FILE: src/competitiveProgramming/headers/competitive/programming/gametheory/minimax/Minimax.hpp
  type competitive (line 29) | namespace competitive {
    type programming (line 30) | namespace programming {
      type gametheory (line 31) | namespace gametheory {
        type minimax (line 32) | namespace minimax {
          class AlphaBetaPrunningException (line 34) | class AlphaBetaPrunningException: public std::exception {
          class MinMaxEvaluatedMove (line 38) | class MinMaxEvaluatedMove {
            method M (line 51) | const M& getMove() const {
            method getBestSubMove (line 55) | std::shared_ptr<MinMaxEvaluatedMove<M> > getBestSubMove() const {
            method getValue (line 59) | double getValue() const {
          class Minimax (line 69) | class Minimax {
            method Minimax (line 78) | Minimax(const timemanagement::Timer& timer): m_depthmax(0), m_...
            method M (line 98) | M best(G& game, IMoveGenerator<M, G>& generator, int depthStar...
            method evaluateSubPossibilities (line 120) | std::set<MinMaxEvaluatedMove<M> > evaluateSubPossibilities(
            method minimax (line 178) | std::shared_ptr<MinMaxEvaluatedMove<M> > minimax (
            method finalStateEvaluation (line 196) | std::shared_ptr<MinMaxEvaluatedMove<M> > finalStateEvaluation(...
            method scoreFromEvaluatedGame (line 199) | double scoreFromEvaluatedGame(const std::vector<double>& score...

FILE: src/competitiveProgramming/headers/competitive/programming/gametheory/treeSearch/TreeSearch.hpp
  type competitive (line 45) | namespace competitive {
    type programming (line 46) | namespace programming {
      type gametheory (line 47) | namespace gametheory {
        type treeSearch (line 48) | namespace treeSearch {
          class TreeSearchNode (line 50) | class TreeSearchNode {
            method TreeSearchNode (line 52) | TreeSearchNode(const std::vector<double>& evaluation, const M&...
            method TreeSearchNode (line 62) | TreeSearchNode(const TreeSearchNode<M,G>& other) :
            method isBetter (line 82) | bool isBetter(const TreeSearchNode<M, G>& other) const {
            method backPropagate (line 87) | void backPropagate(const std::vector<double>& subNodeValue, bo...
            method decrementDepth (line 96) | void decrementDepth() {
            method getGame (line 105) | std::shared_ptr<G> getGame() const {
            method resetEvaluation (line 120) | void resetEvaluation() {
            method isBetter (line 135) | bool isBetter(const std::vector<double>& nodeValue1, int playe...
          class TreeSearchNodeSetItem (line 150) | class TreeSearchNodeSetItem {
            method TreeSearchNodeSetItem (line 152) | TreeSearchNodeSetItem(TreeSearchNode<M, G>& node): m_node(node) {
          class TreeSearch (line 165) | class TreeSearch {
            method TreeSearch (line 185) | TreeSearch(timemanagement::Timer& timer, double depthPenaltyFa...
            method M (line 206) | M best(const std::shared_ptr<G>& game, IMoveGenerator<M, G>& g...
            method print (line 241) | void print(std::iostream& out) {
            method bestGame (line 251) | std::shared_ptr<G> bestGame() const {
            method setEvaluationsMax (line 261) | void setEvaluationsMax(int evaluationsMax) {
            method evaluations (line 268) | int evaluations() const {
            method prun (line 282) | void prun(const M& executedMove, IMoveGenerator<M, G>& generat...
            method M (line 319) | M continueBest(IMoveGenerator<M, G>& generator) {
            method bestEval (line 334) | std::vector<double> bestEval() const {
            method expansion (line 339) | void expansion(std::vector<Node>&subNodes, typename TreeNodeSe...
            method pushInToBeExpanded (line 353) | void pushInToBeExpanded(Node& node) {
            method Node (line 357) | Node evaluate(std::shared_ptr<G> newNodeState, M& move, int de...
            method treeSearchLoop (line 370) | void treeSearchLoop(IMoveGenerator<M, G>& generator) {
            method M (line 385) | M returnCurrentBest(int currentPlayer) {
            method repushToBeExpandedNodes (line 398) | void repushToBeExpandedNodes(Node& node) {
            method printNode (line 410) | void printNode(const Node& node, std::iostream& out) {
            method selection (line 418) | typename TreeNodeSet::const_iterator selection() const {

FILE: src/competitiveProgramming/headers/competitive/programming/genetic/GeneticAlgorithm.hpp
  type competitive (line 22) | namespace competitive{
    type programming (line 23) | namespace programming{
      type genetic (line 24) | namespace genetic{
        class GeneticAlgorithm (line 26) | class GeneticAlgorithm {
          method GeneticAlgorithm (line 43) | GeneticAlgorithm(
          method Genotype (line 64) | Genotype best() const{
          method initialize (line 75) | void initialize(int initialPoolSize) {
          method iterate (line 98) | void iterate(int numberOfIterations, int iterationAdditionalRand...
          method addReference (line 111) | void addReference(const Genotype& reference) {
          method getEvaluations (line 117) | int getEvaluations() const{
          method computeScores (line 122) | void computeScores() {
          method dropUnselected (line 140) | void dropUnselected(int selectionNumber) {
          method addRandomCandidates (line 143) | void addRandomCandidates(int initialPoolSize) {
          method merge (line 149) | void merge(int mergedNumber) {
          method mutate (line 158) | void mutate(int mutatedNumber) {
          method runOneIteration (line 164) | double runOneIteration(int iterationAdditionalRandomGenerated, i...
          method sortByScore (line 175) | void sortByScore() {
          method shuffle (line 183) | void shuffle() {

FILE: src/competitiveProgramming/headers/competitive/programming/geometry/Point.hpp
  type competitive (line 15) | namespace competitive{
    type programming (line 16) | namespace programming{
      type geometry (line 17) | namespace geometry{
        class Point (line 20) | class Point {
          method Point (line 33) | Point(T x, T y):m_x(x), m_y(y) {
          method Point (line 42) | Point(const Point<T>& other):m_x(other.m_x), m_y(other.m_y) {
          method Point (line 52) | Point operator+(const Point& other) const{
          method T (line 60) | T getX() const {
          method T (line 67) | T getY() const {
          method Point (line 87) | Point operator-(const Point& other) const{
          method Point (line 108) | Point operator*(double factor) const {
          method T (line 129) | T distanceSquare(const Point& coord) const {
          method distance (line 140) | double distance(const Point& coord) const {
          method Point (line 149) | Point negate() {
          method Point (line 160) | Point rotateInDegree(double degree){
          method Point (line 171) | Point rotateInRadian(double radians) const {
          method angleInDegree (line 184) | double angleInDegree() const {
          method angleInRadian (line 192) | double angleInRadian() const {
          method T (line 204) | T dot(Point other) const {
          method length (line 216) | double length() const{
          method T (line 223) | T lengthSquare() const {
          method Point (line 232) | Point norm() const{
          method normInplace (line 242) | void normInplace() {
          method Point (line 259) | Point ortho() {
          method toDegrees (line 263) | static double toDegrees(double radians) {
          method toRadians (line 266) | static double toRadians(double degrees) {

FILE: src/competitiveProgramming/headers/competitive/programming/graph/Graph.hpp
  type competitive (line 29) | namespace competitive{
    type programming (line 30) | namespace programming{
      type graph (line 31) | namespace graph{
        class Graph (line 33) | class Graph {
          method Graph (line 58) | Graph(const std::vector<N>& nodes, const std::vector<int>& links...
          method breadthFirstSearch (line 94) | std::vector<T> breadthFirstSearch(
          method iterativeBreadthFirstSearch (line 113) | void iterativeBreadthFirstSearch(std::vector<T>& results, std::v...
          method createLink (line 133) | void createLink(int sourceIndex, int destinationIndex) {

FILE: src/competitiveProgramming/headers/competitive/programming/math/Complex.hpp
  type competitive (line 13) | namespace competitive {
    type programming (line 14) | namespace programming {
      type math (line 15) | namespace math {
        class Complex (line 16) | class Complex {
          method Complex (line 25) | Complex(double real, double imaginary): m_real(real), m_imaginar...
          method getReal (line 27) | double getReal() const {
          method getImaginary (line 30) | double getImaginary() const {
          method isReal (line 37) | bool isReal() {

FILE: src/competitiveProgramming/headers/competitive/programming/math/QuadraticEquation.hpp
  type competitive (line 15) | namespace competitive {
    type programming (line 16) | namespace programming {
      type math (line 17) | namespace math {
        class QuadraticEquation (line 18) | class QuadraticEquation {
          method QuadraticEquation (line 26) | QuadraticEquation(double a, double b, double c) :m_solutionsCoun...
          method getSolutionsCount (line 67) | int getSolutionsCount()const {
          method Complex (line 74) | const Complex& getFirstRoot() const {
          method Complex (line 81) | const Complex& getSecondRoot() const {

FILE: src/competitiveProgramming/headers/competitive/programming/physics/Disk.hpp
  type competitive (line 18) | namespace competitive{
    type programming (line 19) | namespace programming{
      type physics (line 20) | namespace physics{
        class Disk (line 21) | class Disk {
          method Disk (line 35) | Disk(const Vector& position, const Vector& speed, double radius)...
          method Disk (line 48) | Disk(double positionX, double positionY, double speedX, double s...
          method Vector (line 51) | const Vector& getPosition()const {
          method Vector (line 55) | const Vector& getSpeed() const {
          method getRadius (line 59) | double getRadius() const {
          method Disk (line 73) | Disk move() const {
          method moveInPlace (line 80) | void moveInPlace() {
          method Disk (line 91) | Disk accelerate(const Vector& acceleration) const {
          method accelerateInPlace (line 101) | void accelerateInPlace(const Vector& acceleration) {
          method Disk (line 112) | Disk accelerate(double factor) const {
          method accelerateInPlace (line 121) | void accelerateInPlace(double factor) {
          method willCollide (line 134) | bool willCollide(const Disk& other) const {
          method collisionTime (line 159) | double collisionTime(Disk other) const{

FILE: src/competitiveProgramming/headers/competitive/programming/timemanagement/Timer.hpp
  type competitive (line 15) | namespace competitive {
    type programming (line 16) | namespace programming {
      type timemanagement (line 17) | namespace timemanagement {
        type TimeoutException (line 19) | struct TimeoutException : public std::exception
          method TimeoutException (line 21) | TimeoutException(): std::exception()
        class Timer (line 25) | class Timer
          method Timer (line 28) | Timer() : m_startTime(), m_timeOut(), m_started(false)
          method startTimer (line 40) | void startTimer(double durationInMilliseconds)
          method timeCheck (line 52) | void timeCheck() const {
          method currentTimeTakenInNanoSeconds (line 66) | std::chrono::nanoseconds currentTimeTakenInNanoSeconds() const {

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/gametheory/TreesTest.cpp
  class StickGame (line 25) | class StickGame: public IGame {
    method StickGame (line 27) | StickGame(int currentPlayer, int sticksRemaining, bool gameStateDuplic...
    method changePlayer (line 32) | void changePlayer() {
    method currentPlayer (line 36) | virtual int currentPlayer() const override {
    method evaluate (line 40) | std::vector<double> evaluate(int depth) const override{
    method getSticksRemaining (line 59) | int getSticksRemaining() const {
    method setSticksRemaining (line 63) | void setSticksRemaining(int sticksRemaining) {
    method isGameStateDuplication (line 67) | bool isGameStateDuplication() const {
    method assignEvaluation (line 71) | void assignEvaluation(std::vector<double>& evaluation, double eval) co...
  class StickMove (line 88) | class StickMove : public ICancellableMove<StickGame> {
    method StickMove (line 90) | StickMove(int sticks): m_sticks(sticks), m_previousGame(), m_nextGame()
    method StickMove (line 94) | StickMove(): m_sticks(0), m_previousGame(), m_nextGame()
    method StickMove (line 96) | StickMove(const StickMove& other): m_sticks(other.m_sticks), m_previou...
    method StickMove (line 98) | StickMove& operator=(const StickMove& other) {
    method StickGame (line 108) | StickGame& cancel(StickGame& game) {
    method StickGame (line 117) | StickGame& execute(StickGame& game) {
    method execute (line 129) | std::shared_ptr<StickGame> execute(std::shared_ptr<StickGame>& game) {
    method getSticks (line 135) | int getSticks() const {
    method setSticks (line 139) | void setSticks(int sticks) {
  class StickGenerator (line 148) | class StickGenerator : public IMoveGenerator<StickMove, StickGame> {
    method generateMoves (line 150) | std::vector<StickMove> generateMoves(const StickGame& game) const over...
  class Tester (line 167) | class Tester {
    method testAlgo (line 169) | static void testAlgo(const std::function<StickMove (StickGame&, StickG...
  function TEST (line 201) | TEST(MaxNTree, StickGame) {
  function TEST (line 210) | TEST(Minimax, StickGame) {
  function TEST (line 218) | TEST(TreeSearch, StickGame) {

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/genetic/GeneticAlgorithmTest.cpp
  class Combination (line 14) | class Combination {
    method Combination (line 16) | Combination(int first, int second, int third, int fourth): m_first(fir...
    method Combination (line 36) | static Combination newInstance() {
    method evaluate (line 41) | double evaluate(const Combination& toBeFound) const {
    method Combination (line 59) | Combination merge(const Combination& other) const {
    method Combination (line 67) | Combination mutate() const {
    method randomBoolean (line 76) | bool randomBoolean() const {
  function TEST (line 90) | TEST(GeneticAlgorithm, Combination) {

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/geometry/PointTest.cpp
  function TEST (line 11) | TEST(Coord, Add)
  function TEST (line 23) | TEST(Coord, Distances)
  function TEST (line 32) | TEST(Coord, Minus)
  function TEST (line 42) | TEST(Coord, Multiply)
  function TEST (line 53) | TEST(Vector, BasicOperations) {

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/graph/GraphTest.cpp
  function TEST (line 10) | TEST(Graph, UndirectedGraph)
  function TEST (line 35) | TEST(Graph, DirectedGraph) {
  function TEST (line 54) | TEST(Graph, PerformancesBFS) {

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/math/QuadraticEquationTest.cpp
  function TEST (line 9) | TEST(QuadraticEquation, RealSolutions)
  function TEST (line 30) | TEST(QuadraticEquation, ImaginarySolutions)

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/physics/DiskTest.cpp
  function TEST (line 9) | TEST(Disk, Move)
  function TEST (line 18) | TEST(Disk, Accelerate)
  function TEST (line 30) | TEST(Disk, CollisionDetection)
  function TEST (line 48) | TEST(Disk, CollisionTime)

FILE: src/competitiveProgrammingTest/cpp/competitive/programming/timemanagement/TimerTest.cpp
  function sleep (line 10) | static void sleep(std::chrono::milliseconds sleep) {
  function TEST (line 14) | TEST(Timer, NonStartedTimerDoesNotTimeOut)
  function TEST (line 28) | TEST(Timer, DoesNotTimeoutBeforeTimeoutReached) {
  function TEST (line 39) | TEST(Timer, timeOutReached) {

FILE: src/competitiveProgrammingTest/cpp/test_main.cpp
  function main (line 5) | int main(int argc, char **argv) {

FILE: src/main/java/builder/FileBuilder.java
  class FileBuilder (line 31) | public class FileBuilder {
    class ClassCode (line 47) | private static class ClassCode {
      method ClassCode (line 56) | ClassCode(String classFile) {
      method className (line 60) | public String className() {
      method declaration (line 64) | public String declaration() {
      method declaration (line 68) | public void declaration(String line, String keyword) {
      method equals (line 73) | @Override
      method extractDeclaration (line 95) | private String extractDeclaration(String line, String str) {
      method hashCode (line 99) | @Override
    method main (line 108) | public static void main(String[] args) {
    method FileBuilder (line 119) | private FileBuilder(boolean javaCode) {
    method addLineToCode (line 128) | private boolean addLineToCode(final ClassCode code, boolean fileKeyWor...
    method includeToPath (line 179) | private String includeToPath(String includeStr) {
    method importToPath (line 184) | private String importToPath(String importStr) {
    method processFile (line 190) | private ClassCode processFile(String fileName) {
    method readFile (line 202) | private List<String> readFile(String fileName) {
    method readFileContent (line 211) | private ClassCode readFileContent(String fileName, List<String> fileCo...
    method readPackageClasses (line 245) | private void readPackageClasses(String fileName) {
    method toAbsolutePath (line 261) | private String toAbsolutePath(Path path) {
    method toAbsolutePath (line 265) | private String toAbsolutePath(String fileName) {
    method write (line 269) | private void write(ClassCode treated) {

FILE: src/main/java/builder/sample/Sample.java
  class Sample (line 8) | public class Sample {
    method main (line 9) | public static void main(String[] args) {

FILE: src/main/java/competitive/programming/common/Constants.java
  class Constants (line 10) | public class Constants {

FILE: src/main/java/competitive/programming/containers/Pair.java
  class Pair (line 14) | public class Pair<F, S> {
    method Pair (line 18) | public Pair(F first, S second) {
    method getSecond (line 23) | public S getSecond() {
    method getFirst (line 27) | public F getFirst() {

FILE: src/main/java/competitive/programming/gametheory/ICancellableMove.java
  type ICancellableMove (line 16) | public interface ICancellableMove<G extends IGame> extends IMove<G> {
    method cancel (line 25) | G cancel(G game);

FILE: src/main/java/competitive/programming/gametheory/IGame.java
  type IGame (line 8) | public interface IGame {
    method currentPlayer (line 15) | int currentPlayer();
    method evaluate (line 25) | double[] evaluate(int depth);

FILE: src/main/java/competitive/programming/gametheory/IMove.java
  type IMove (line 12) | public interface IMove<G extends IGame> {
    method execute (line 21) | G execute(G game);

FILE: src/main/java/competitive/programming/gametheory/IMoveGenerator.java
  type IMoveGenerator (line 17) | public interface IMoveGenerator<M extends IMove<G>, G extends IGame> {
    method generateMoves (line 29) | List<M> generateMoves(G game);

FILE: src/main/java/competitive/programming/gametheory/common/IScoreConverter.java
  type IScoreConverter (line 10) | @FunctionalInterface
    method convert (line 12) | double convert(double[] rawScores, int player);

FILE: src/main/java/competitive/programming/gametheory/common/TreeNode.java
  class TreeNode (line 5) | public class TreeNode<M, G> {
    method TreeNode (line 11) | public TreeNode(double[] evaluation, M move, G game, int depth) {
    method decrementDepth (line 18) | public void decrementDepth() {
    method getDepth (line 22) | public int getDepth() {
    method getEvaluation (line 26) | public double[] getEvaluation() {
    method getMove (line 30) | public M getMove() {
    method getGame (line 34) | public G getGame() {
    method toString (line 38) | @Override

FILE: src/main/java/competitive/programming/gametheory/common/TreeNodeSorter.java
  class TreeNodeSorter (line 6) | public class TreeNodeSorter<M, G> {
    method TreeNodeSorter (line 9) | public TreeNodeSorter(IScoreConverter converter) {
    method best (line 13) | public TreeNode<M, G> best(List<? extends TreeNode<M, G>> moves, int p...
    method compare (line 18) | private static int compare(double[] scores1, double evaluation1Factor,...
    method compare (line 30) | public int compare(double[] evaluation1, double evaluation1Factor, int...
    method isBetter (line 34) | public boolean isBetter(double[] evaluation1, double evaluation1Factor...

FILE: src/main/java/competitive/programming/gametheory/maxntree/MaxNTree.java
  class MaxNTree (line 40) | public class MaxNTree<M extends ICancellableMove<G>, G extends IGame> {
    method MaxNTree (line 62) | public MaxNTree(Timer timer, IScoreConverter converter) {
    method best (line 83) | public M best(G game, IMoveGenerator<M, G> generator, int depthStart, ...
    method bestGame (line 102) | public G bestGame() {
    method bestInternal (line 106) | private TreeNode<M, G> bestInternal(int depth, G board) throws Timeout...
    method evaluatesMoves (line 121) | private List<TreeNode<M, G>> evaluatesMoves(List<M> generatedMoves, G ...
    method evaluations (line 145) | public int evaluations() {

FILE: src/main/java/competitive/programming/gametheory/minimax/Minimax.java
  class Minimax (line 30) | public class Minimax<M extends ICancellableMove<G>, G extends IGame> {
    class AlphaBetaPrunningException (line 32) | private static class AlphaBetaPrunningException extends Exception {
    class MinMaxEvaluatedMove (line 36) | private class MinMaxEvaluatedMove implements Comparable<MinMaxEvaluate...
      method MinMaxEvaluatedMove (line 41) | public MinMaxEvaluatedMove(M move, double value, MinMaxEvaluatedMove...
      method compareTo (line 47) | @Override
      method getBestSubMove (line 57) | public MinMaxEvaluatedMove getBestSubMove() {
      method getMove (line 61) | public M getMove() {
      method getValue (line 65) | public double getValue() {
      method toString (line 69) | @Override
    method Minimax (line 98) | public Minimax(Timer timer) {
    method evaluateSubPossibilities (line 102) | private List<MinMaxEvaluatedMove> evaluateSubPossibilities(G game, IMo...
    method minimax (line 154) | private MinMaxEvaluatedMove minimax(G game, IMoveGenerator<M, G> gener...
    method best (line 189) | public M best(final G game, final IMoveGenerator<M, G> generator, int ...
    method scoreFromEvaluatedGame (line 211) | private double scoreFromEvaluatedGame(double[] scores) {

FILE: src/main/java/competitive/programming/gametheory/treesearch/TreeSearch.java
  class TreeSearch (line 48) | public class TreeSearch<M extends IMove<G>, G extends IGame> {
    class TreeSearchNode (line 58) | static class TreeSearchNode<M, G extends IGame> extends TreeNode<M, G> {
      method TreeSearchNode (line 65) | public TreeSearchNode(double[] evaluation, M move, G game, int depth...
      method toString (line 73) | @Override
      method backPropagate (line 78) | public void backPropagate(double[] subNodeValue, TreeNodeSorter<M, G...
      method decrementDepth (line 87) | @Override
      method setSubNodes (line 93) | public void setSubNodes(List<TreeSearchNode<M, G>> subNodes) {
      method resetEvaluation (line 97) | public void resetEvaluation(TreeNodeSorter<M, G> sorter) {
    method TreeSearch (line 128) | public TreeSearch(Timer timer, double depthPenaltyFactor, IScoreConver...
    method best (line 144) | public M best(final G game, final IMoveGenerator<M, G> generator) {
    method getToBeExpanded (line 164) | protected Queue<TreeSearchNode<M, G>> getToBeExpanded() {
    method print (line 175) | public void print(PrintStream out) {
    method bestGame (line 187) | public G bestGame() {
    method setEvaluationsMax (line 199) | public void setEvaluationsMax(int evaluationsMax) {
    method evaluations (line 206) | public int evaluations() {
    method prun (line 220) | public void prun(M executedMove, IMoveGenerator<M, G> generator) {
    method continueBest (line 253) | public M continueBest(IMoveGenerator<M, G> generator) {
    method bestEval (line 267) | public double[] bestEval() {
    method createToBeExpanded (line 271) | private PriorityQueue<TreeSearchNode<M, G>> createToBeExpanded() {
    method expansion (line 275) | private List<TreeSearchNode<M, G>> expansion(TreeSearchNode<M, G> toEx...
    method pushInToBeExpanded (line 289) | private void pushInToBeExpanded(TreeSearchNode<M, G> node) {
    method evaluate (line 293) | private TreeSearchNode<M, G> evaluate(G newNodeState, M move, int dept...
    method treeSearchLoop (line 306) | private void treeSearchLoop(final IMoveGenerator<M, G> generator) thro...
    method returnCurrentBest (line 319) | private M returnCurrentBest(int currentPlayer) {
    method repushToBeExpandedNodes (line 332) | private void repushToBeExpandedNodes(TreeSearchNode<M, G> node) {
    method printNode (line 344) | private void printNode(TreeSearchNode<M, G> node, PrintStream out) {

FILE: src/main/java/competitive/programming/genetic/CandidateGenerator.java
  type CandidateGenerator (line 11) | public interface CandidateGenerator<Genotype> {
    method generateRandomly (line 16) | Genotype generateRandomly();

FILE: src/main/java/competitive/programming/genetic/CandidateMerger.java
  type CandidateMerger (line 11) | public interface CandidateMerger<Genotype> {
    method merge (line 20) | Genotype merge(Genotype first, Genotype second);

FILE: src/main/java/competitive/programming/genetic/CandidateMutator.java
  type CandidateMutator (line 11) | public interface CandidateMutator<Genotype> {
    method mutate (line 18) | Genotype mutate(Genotype candidate);

FILE: src/main/java/competitive/programming/genetic/FitnessFunction.java
  type FitnessFunction (line 11) | public interface FitnessFunction<Genotype> {
    method evaluate (line 18) | double evaluate(Genotype genotype);

FILE: src/main/java/competitive/programming/genetic/GeneticAlgorithm.java
  class GeneticAlgorithm (line 23) | public class GeneticAlgorithm<Genotype> {
    type IShuffler (line 25) | protected interface IShuffler<Genotype> {
      method shuffle (line 26) | void shuffle(List<? extends Genotype> list);
    method GeneticAlgorithm (line 52) | public GeneticAlgorithm(FitnessFunction<Genotype> fitnessFunction, Can...
    method addRandomCandidates (line 60) | private void addRandomCandidates(int initialPoolSize) {
    method best (line 71) | public Genotype best() {
    method computeScores (line 75) | private Map<Genotype, Double> computeScores() {
    method dropUnselected (line 92) | private void dropUnselected(int selectionNumber) {
    method initialize (line 104) | public void initialize(int initialPoolSize) {
    method iterate (line 127) | public void iterate(int numberOfIterations, int iterationAdditionalRan...
    method merge (line 133) | private void merge(int mergedNumber) {
    method mutate (line 141) | private void mutate(int mutatedNumber) {
    method printTo (line 148) | protected void printTo(PrintStream err) {
    method removeDuplicates (line 153) | private void removeDuplicates() {
    method runOneIteration (line 159) | private double runOneIteration(int iterationAdditionalRandomGenerated,...
    method setShuffler (line 172) | protected void setShuffler(IShuffler<Genotype> shuffler) {
    method shuffle (line 176) | private void shuffle() {
    method sortByScore (line 180) | private void sortByScore(final Map<Genotype, Double> scores) {
    method addReference (line 202) | public void addReference(Genotype reference) {
    method getEvaluations (line 206) | public int getEvaluations() {

FILE: src/main/java/competitive/programming/geometry/Coord.java
  class Coord (line 11) | public class Coord {
    method Coord (line 23) | public Coord(int x, int y) {
    method Coord (line 35) | public Coord(Vector v) {
    method add (line 48) | public Coord add(Coord coord) {
    method distance (line 57) | public double distance(Coord coord) {
    method distanceSquare (line 69) | public long distanceSquare(Coord coord) {
    method minus (line 83) | public Coord minus(Coord coord) {
    method equals (line 87) | @Override
    method hashCode (line 108) | @Override
    method toString (line 117) | @Override

FILE: src/main/java/competitive/programming/geometry/Vector.java
  class Vector (line 10) | public class Vector {
    method doubleToString (line 11) | private static String doubleToString(double d) {
    method Vector (line 29) | public Vector(Coord coord) {
    method Vector (line 40) | public Vector(double x, double y) {
    method Vector (line 51) | public Vector(Vector other) {
    method add (line 62) | public Vector add(Vector other) {
    method negate (line 71) | public Vector negate() {
    method rotateInDegree (line 82) | public Vector rotateInDegree(double degree){
    method rotateInRadian (line 93) | public Vector rotateInRadian(double radians) {
    method angleInDegree (line 105) | public double angleInDegree() {
    method angleInRadian (line 113) | private double angleInRadian() {
    method dot (line 125) | public double dot(Vector other) {
    method equals (line 129) | @Override
    method hashCode (line 150) | @Override
    method length (line 166) | public double length() {
    method length2 (line 173) | public double length2() {
    method minus (line 185) | public Vector minus(Vector other) {
    method multiply (line 196) | public Vector multiply(double factor) {
    method norm (line 205) | public Vector norm() {
    method ortho (line 217) | public Vector ortho() {
    method toString (line 221) | @Override

FILE: src/main/java/competitive/programming/graph/Graph.java
  class Graph (line 28) | public class Graph<N> {
    method Graph (line 54) | public Graph(final N[] nodes, int[] linksSource, int[] linksDestinatio...
    method createLink (line 74) | private void createLink(int sourceIndex, int destinationIndex) {
    method breadthFirstSearch (line 103) | public double[] breadthFirstSearch(double intialValue, double firstVal...
    method iterativeDoubleBreadthFirstSearch (line 116) | private void iterativeDoubleBreadthFirstSearch(double[] results, boole...
    method breadthFirstSearch (line 143) | public int[] breadthFirstSearch(
    method iterativeIntegerBreadthFirstSearch (line 160) | private void iterativeIntegerBreadthFirstSearch(int[] results, boolean...

FILE: src/main/java/competitive/programming/graph/IBFSTraversable.java
  type IBFSTraversable (line 3) | public interface IBFSTraversable<N>{
    method canBeVisited (line 4) | boolean canBeVisited(N node);

FILE: src/main/java/competitive/programming/graph/IDoubleBfsNextLevelValueIterator.java
  type IDoubleBfsNextLevelValueIterator (line 3) | public interface IDoubleBfsNextLevelValueIterator<N>{
    method nextInterationValue (line 4) | double nextInterationValue(double value, int iteration);

FILE: src/main/java/competitive/programming/graph/IIntegerBfsNextValueIterator.java
  type IIntegerBfsNextValueIterator (line 3) | public interface IIntegerBfsNextValueIterator<N>{
    method nextInterationValue (line 4) | int nextInterationValue(int value, int iteration);

FILE: src/main/java/competitive/programming/math/Complex.java
  class Complex (line 9) | public class Complex {
    method Complex (line 19) | public Complex(double real, double imaginary) {
    method getReal (line 23) | public double getReal() {
    method getImaginary (line 26) | public double getImaginary() {
    method isReal (line 33) | public boolean isReal(){
    method toString (line 36) | @Override
    method hashCode (line 40) | @Override
    method equals (line 51) | @Override

FILE: src/main/java/competitive/programming/math/QuadraticEquation.java
  class QuadraticEquation (line 12) | public class QuadraticEquation {
    method solve (line 22) | public static List<Complex> solve(double a, double b, double c){

FILE: src/main/java/competitive/programming/physics/Disk.java
  class Disk (line 16) | public class Disk {
    method Disk (line 31) | public Disk(Vector position, Vector speed, double radius) {
    method hashCode (line 37) | @Override
    method equals (line 49) | @Override
    method move (line 79) | public Disk move() {
    method accelerate (line 90) | public Disk accelerate(Vector acceleration) {
    method accelerate (line 101) | public Disk accelerate(double factor) {
    method willCollide (line 114) | public boolean willCollide(Disk other) {
    method collisionTime (line 135) | public double collisionTime(Disk other) {

FILE: src/main/java/competitive/programming/timemanagement/TimeoutException.java
  class TimeoutException (line 8) | public class TimeoutException extends Exception {

FILE: src/main/java/competitive/programming/timemanagement/Timer.java
  class Timer (line 10) | public class Timer {
    method currentTimeTakenInNanoSeconds (line 19) | public long currentTimeTakenInNanoSeconds() {
    method startTimer (line 31) | public void startTimer(double durationInMilliseconds) {
    method timeCheck (line 41) | public void timeCheck() throws TimeoutException {

FILE: src/test/java/competitive/programming/gametheory/StickGame.java
  class StickGame (line 3) | public class StickGame implements IGame {
    method StickGame (line 8) | public StickGame(int currentPlayer, int sticksRemaining, boolean gameS...
    method assignEvaluation (line 14) | private void assignEvaluation(double[] evaluation, double eval) {
    method changePlayer (line 24) | public void changePlayer() {
    method currentPlayer (line 28) | @Override
    method evaluate (line 33) | @Override
    method getSticksRemaining (line 52) | public int getSticksRemaining() {
    method setSticksRemaining (line 56) | public void setSticksRemaining(int sticksRemaining) {
    method isGameStateDuplication (line 60) | public boolean isGameStateDuplication() {

FILE: src/test/java/competitive/programming/gametheory/StickGenerator.java
  class StickGenerator (line 8) | public class StickGenerator implements IMoveGenerator<StickMove, StickGa...
    method generateMoves (line 10) | @Override

FILE: src/test/java/competitive/programming/gametheory/StickMove.java
  class StickMove (line 4) | public class StickMove implements ICancellableMove<StickGame> {
    method StickMove (line 9) | public StickMove(int sticks) {
    method cancel (line 13) | @Override
    method execute (line 24) | @Override
    method getSticks (line 37) | public int getSticks() {
    method log (line 41) | private void log(StickGame game, String action) {
    method setSticks (line 45) | public void setSticks(int sticks) {
    method toString (line 49) | @Override

FILE: src/test/java/competitive/programming/gametheory/Tester.java
  class Tester (line 8) | public class Tester {
    type IBestMoveEvaluator (line 10) | public interface IBestMoveEvaluator {
      method findBestMove (line 11) | StickMove findBestMove(StickGame game, StickGenerator generator, int...
    method testAlgo (line 14) | public static void testAlgo(IBestMoveEvaluator evaluator, boolean game...

FILE: src/test/java/competitive/programming/gametheory/maxntree/MaxNTreeTest.java
  class MaxNTreeTest (line 10) | public class MaxNTreeTest {
    method testStickGame (line 12) | @Test

FILE: src/test/java/competitive/programming/gametheory/minimax/MinimaxTest.java
  class MinimaxTest (line 10) | public class MinimaxTest {
    method testStickGame (line 11) | @Test

FILE: src/test/java/competitive/programming/gametheory/treesearch/TreeSearchTest.java
  class TreeSearchTest (line 21) | public class TreeSearchTest {
    method testStickGame (line 23) | @Test
    class NegValueGame (line 32) | static class NegValueGame implements IGame{
      method NegValueGame (line 36) | public NegValueGame(int score, int depth) {
      method currentPlayer (line 41) | @Override
      method evaluate (line 46) | @Override
    class NegValueMove (line 55) | static class NegValueMove implements IMove<NegValueGame>{
      method execute (line 57) | @Override
      method toString (line 61) | @Override
      method reset (line 65) | static void reset(){
    method testExpansionResetValue (line 70) | @Test
    method testPrunning (line 90) | @Test

FILE: src/test/java/competitive/programming/genetic/GeneticAlgorithmTest.java
  class GeneticAlgorithmTest (line 12) | public class GeneticAlgorithmTest {
    class Combination (line 14) | private static class Combination {
      method newInstance (line 15) | public static Combination newInstance() {
      method Combination (line 26) | public Combination(int first, int second, int third, int fourth) {
      method equals (line 33) | @Override
      method evaluate (line 60) | public double evaluate(Combination toBeFound) {
      method hashCode (line 79) | @Override
      method merge (line 90) | public Combination merge(Combination other) {
      method mutate (line 95) | public Combination mutate() {
      method randomBoolean (line 99) | private boolean randomBoolean() {
      method toString (line 103) | @Override
    method testCombinationGuesser (line 113) | @Test

FILE: src/test/java/competitive/programming/geometry/CoordTest.java
  class CoordTest (line 7) | public class CoordTest {
    method add (line 9) | @Test
    method distances (line 16) | @Test
    method minus (line 25) | @Test
    method convertFromVector (line 32) | @Test

FILE: src/test/java/competitive/programming/geometry/VectorTest.java
  class VectorTest (line 9) | public class VectorTest {
    method vectorBasicOperations (line 11) | @Test

FILE: src/test/java/competitive/programming/graph/GraphTest.java
  class GraphTest (line 14) | public class GraphTest {
    method init (line 19) | @Before
    method bfsOnGraph (line 46) | @Test
    method performancesBFS (line 66) | @Test

FILE: src/test/java/competitive/programming/math/QuadraticEquationTest.java
  class QuadraticEquationTest (line 12) | public class QuadraticEquationTest {
    method testRealSolutions (line 14) | @Test
    method imaginarySolutions (line 23) | @Test

FILE: src/test/java/competitive/programming/physics/DiskTest.java
  class DiskTest (line 10) | public class DiskTest {
    method testMove (line 13) | @Test
    method testAccelerate (line 19) | @Test
    method testCollisionDetection (line 26) | @Test
    method collisionTime (line 43) | @Test

FILE: src/test/java/competitive/programming/timemanagement/TimerTest.java
  class TimerTest (line 7) | public class TimerTest {
    method nonStartedTimerDoesNotTimeout (line 9) | @Test
    method doesNotTimeOutBeforeTimeoutReached (line 21) | @Test
    method timeoutReached (line 36) | @Test(expected = TimeoutException.class)
    method sleep (line 44) | private void sleep(long milliseconds) {