#pragma once #include #include #include #include namespace geode::cocos { /** * Get child at index. Checks bounds. A negative * index will get the child starting from the end * @returns Child at index cast to the given type, * or nullptr if index exceeds bounds */ template static T* getChild(cocos2d::CCNode* x, int i) { // start from end for negative index if (i < 0) i = x->getChildrenCount() + i; // check if backwards index is out of bounds if (i < 0) return nullptr; // check if forwards index is out of bounds if (static_cast(x->getChildrenCount()) <= i) return nullptr; return reinterpret_cast(x->getChildren()->objectAtIndex(i)); } /** * Get nth child that is a given type. Checks bounds. * @returns Child at index cast to the given type, * or nullptr if index exceeds bounds */ template static Type* getChildOfType(cocos2d::CCNode* node, size_t index) { size_t indexCounter = 0; for (size_t i = 0; i < node->getChildrenCount(); ++i) { auto obj = cast::typeinfo_cast( node->getChildren()->objectAtIndex(i) ); if (obj != nullptr) { if (indexCounter == index) { return obj; } ++indexCounter; } } return nullptr; } /** * Return a node, or create a default one if it's * nullptr. Syntactic sugar function */ template static T* nodeOrDefault(T* node, Args... args) { return node ? node : T::create(args...); } template struct SafeCreate final { T* result; SafeCreate& with(T* node) { result = node; return *this; } template T* orMakeUsing(O*(*func)(Args...), Args... args) { if (result) return result; return func(args...); } template T* orMake(Args... args) { if (result) return result; return O::create(args...); } }; /** * Get bounds for a set of nodes. Based on content * size * @param nodes Nodes to calculate coverage of * @returns Rectangle fitting all nodes. Origin * will be <= 0 and size will be >= 0 */ GEODE_DLL cocos2d::CCRect calculateNodeCoverage(std::vector const& nodes); /** * Get bounds for a set of nodes. Based on content * size * @param nodes Nodes to calculate coverage of * @returns Rectangle fitting all nodes. Origin * will be <= 0 and size will be >= 0 */ GEODE_DLL cocos2d::CCRect calculateNodeCoverage(cocos2d::CCArray* nodes); /** * Get bounds for a set of nodes. Based on content * size * @param parent Parent whose children to calculate * coverage of * @returns Rectangle fitting all the parent's children. * Origin will be <= 0 and size will be >= 0 */ GEODE_DLL cocos2d::CCRect calculateChildCoverage(cocos2d::CCNode* parent); /** * Rescale node to fit inside given size * @param node Node to rescale * @param size Size to fit inside * @param def Default size * @param min Minimum size */ GEODE_DLL void limitNodeSize( cocos2d::CCNode* node, cocos2d::CCSize const& size, float def, float min ); /** * Checks if a node is visible (recursively * checks parent visibility) * @param node Node to check if visible * @returns True if node is visibile. Does * not take into account if node is off-screen */ GEODE_DLL bool nodeIsVisible(cocos2d::CCNode* node); /** * Gets a node by tag by traversing * children recursively * * @param node Parent node * @param tag Target tag * @return Child node with specified tag, or * null if there is none */ GEODE_DLL cocos2d::CCNode* getChildByTagRecursive(cocos2d::CCNode* node, int tag); /** * Checks if a given file exists in CCFileUtils * search paths. * @param filename File to check * @returns True if file exists * @example if (fileExistsInSearchPaths("mySprite.png"_spr)) { * CCSprite::create("mySprite.png"_spr); * } else { * CCSprite::create("fallback.png"); * } */ GEODE_DLL bool fileExistsInSearchPaths(const char* filename); template struct GEODE_DLL CCArrayIterator { public: CCArrayIterator(T* p) : m_ptr(p) {} T* m_ptr; T& operator*() { return *m_ptr; } T* operator->() { return m_ptr; } auto& operator++() { ++m_ptr; return *this; } friend bool operator== (const CCArrayIterator& a, const CCArrayIterator& b) { return a.m_ptr == b.m_ptr; }; friend bool operator!= (const CCArrayIterator& a, const CCArrayIterator& b) { return a.m_ptr != b.m_ptr; }; }; template class CCArrayExt { protected: cocos2d::CCArray* m_arr; using T = std::remove_pointer_t<_Type>; public: CCArrayExt() : m_arr(cocos2d::CCArray::create()) { m_arr->retain(); } CCArrayExt(cocos2d::CCArray* arr) : m_arr(arr) { m_arr->retain(); } CCArrayExt(CCArrayExt const& a) : m_arr(a.m_arr) { m_arr->retain(); } CCArrayExt(CCArrayExt&& a) : m_arr(a.m_arr) { a.m_arr = nullptr; } ~CCArrayExt() { if (m_arr) m_arr->release(); } auto begin() { return CCArrayIterator(reinterpret_cast(m_arr->data->arr)); } auto end() { return CCArrayIterator(reinterpret_cast(m_arr->data->arr) + m_arr->count()); } auto size() const { return m_arr->count(); } T operator[](size_t index) { return reinterpret_cast(m_arr->objectAtIndex(index)); } void push_back(T* item) { m_arr->addObject(item); } T* pop_back() { T ret = m_arr->lastObject(); m_arr->removeLastObject(); return ret; } cocos2d::CCArray* inner() { return m_arr; } }; template struct CCDictIterator { public: CCDictIterator(cocos2d::CCDictElement* p) : m_ptr(p) {} cocos2d::CCDictElement* m_ptr; std::pair operator*() { if constexpr (std::is_same::value) { return { m_ptr->getStrKey(), reinterpret_cast(m_ptr->getObject()) }; } else { return { m_ptr->getIntKey(), reinterpret_cast(m_ptr->getObject()) }; } } auto& operator++() { m_ptr = reinterpret_cast(m_ptr->hh.next); return *this; } friend bool operator== (const CCDictIterator& a, const CCDictIterator& b) { return a.m_ptr == b.m_ptr; }; friend bool operator!= (const CCDictIterator& a, const CCDictIterator& b) { return a.m_ptr != b.m_ptr; }; bool operator!= (int b) { return m_ptr != nullptr; } }; template struct CCDictEntry { K m_key; cocos2d::CCDictionary* m_dict; CCDictEntry(K key, cocos2d::CCDictionary* dict) : m_key(key), m_dict(dict) {} T operator->() { return reinterpret_cast(m_dict->objectForKey(m_key)); } operator T() { return reinterpret_cast(m_dict->objectForKey(m_key)); } CCDictEntry& operator=(T f) { m_dict->setObject(f, m_key); return *this; } }; template struct CCDictionaryExt { protected: cocos2d::CCDictionary* m_dict; public: CCDictionaryExt() : m_dict(cocos2d::CCDictionary::create()) { m_dict->retain(); } CCDictionaryExt(cocos2d::CCDictionary* dict) : m_dict(dict) { m_dict->retain(); } CCDictionaryExt(CCDictionaryExt const& d) : m_dict(d.m_dict) { m_dict->retain(); } CCDictionaryExt(CCDictionaryExt&& d) : m_dict(d.m_dict) { d.m_dict = nullptr; } ~CCDictionaryExt() { if (m_dict) m_dict->release(); } CCDictionaryExt const& operator=(cocos2d::CCDictionary* d) { m_dict->release(); m_dict = d; m_dict->retain(); } auto begin() { return CCDictIterator(m_dict->m_pElements); } // do not use this auto end() { return nullptr; } size_t size() { return m_dict->count(); } auto operator[](K key) { auto ret = reinterpret_cast(m_dict->objectForKey(key)); if (!ret) m_dict->setObject(cocos2d::CCNode::create(), key); return CCDictEntry(key, m_dict); } size_t count(K key) { return m_dict->allKeys(key)->count(); } }; template class SelectorWrapperImpl : public cocos2d::CCObject { protected: std::function m_inner; public: static SelectorWrapperImpl* create(std::function fn) { auto ret = new SelectorWrapperImpl(); ret->m_inner = fn; ret->autorelease(); return ret; } R invoke(Args... args) { return m_inner(args...); } }; template class SelectorWrapper { protected: using Target = SelectorWrapperImpl; bool m_tied; Target* m_impl; public: SelectorWrapper(std::function fn) { m_impl = Target::create(fn); m_impl->retain(); } ~SelectorWrapper() { if (!m_tied) m_impl->release(); } Target* target() { return m_impl; } auto selector() { return reinterpret_cast(&Target::invoke); } SelectorWrapper& leak() { m_impl->retain(); return *this; } SelectorWrapper tieToNode(cocos2d::CCNode* node) { if (!m_tied) { node->addChild(m_impl); m_impl->release(); m_tied = true; } return *this; } }; template auto selectorFromFn(std::function fn) { return SelectorWrapper(fn); } // namespace for storing implementation stuff for // inline member functions namespace { // class that holds the lambda (probably should've just used // std::function but hey, this one's heap-free!) template struct LambdaHolder { bool m_assigned = false; // lambdas don't implement operator= so we // gotta do this wacky union stuff union { F m_lambda; }; LambdaHolder() {} ~LambdaHolder() { if (m_assigned) { m_lambda.~F(); } } Ret operator()(Args... args) { if (m_assigned) { return m_lambda(std::forward(args)...); } else { if constexpr (!std::is_void_v) { return Ret(); } } } void assign(F&& func) { if (!m_assigned) { new (&m_lambda) F(func); m_assigned = true; } } }; // Extract parameters and return type from a lambda template struct ExtractLambda : public ExtractLambda {}; template struct ExtractLambda { using Ret = R; using Params = std::tuple; }; // Class for storing the member function template struct InlineMemberFunction; template struct InlineMemberFunction> : public Base { // this class isn't instantiated anywhere, and is // just used as a proxy to redirect the member function // to the lambda static inline LambdaHolder::Ret, Args...> s_selector {}; typename ExtractLambda::Ret onSelector(Args... args) { return s_selector(std::forward(args)...); } }; } /** * Wrap a lambda into a member function pointer. Useful for creating * callbacks that have to be members of a class without having to deal * with all of the boilerplate associated with defining a new class * member function. */ template static auto makeMemberFunction(Func&& function) { InlineMemberFunction::Params>::s_selector.assign(std::move(function)); return &InlineMemberFunction::Params>::onSelector; } /** * Create a SEL_MenuHandler out of a lambda with optional captures. Useful * for adding callbacks to CCMenuItemSpriteExtras without needing to add * the callback as a member to a class. Use the GEODE_MENU_SELECTOR class * for even more concise code. */ template static cocos2d::SEL_MenuHandler makeMenuSelector(Func&& selector) { return (cocos2d::SEL_MenuHandler)(makeMemberFunction(std::move(selector))); } #define GEODE_MENU_SELECTOR(senderArg, ...) \ makeMenuSelector([=](senderArg) { __VA_ARGS__; }) }