convertFromContainingWindow(IntPoint(e.x, e.y));\n m_globalPosition = IntPoint(e.global_x, e.global_y);\n m_deltaX = static_cast<float>(e.delta_x);\n m_deltaY = static_cast<float>(e.delta_y);\n m_charsToScrollPerDelta = 1;\n m_linesToScrollPerDelta = 1;\n m_pageXScrollMode = false;\n m_pageYScrollMode = false;\n m_isAccepted = false;\n m_shiftKey = (e.modifiers & WebInputEvent::SHIFT_KEY) != 0;\n m_ctrlKey = (e.modifiers & WebInputEvent::CTRL_KEY) != 0;\n m_altKey = (e.modifiers & WebInputEvent::ALT_KEY) != 0;\n m_metaKey = (e.modifiers & WebInputEvent::META_KEY) != 0;\n m_isContinuous = false;\n m_continuousDeltaX = 0;\n m_continuousDeltaY = 0;\n}\n\nstatic inline const PlatformKeyboardEvent::Type ToPlatformKeyboardEventType(\n WebInputEvent::Type type) {\n switch (type) {\n case WebInputEvent::KEY_UP:\n return PlatformKeyboardEvent::KeyUp;\n case WebInputEvent::KEY_DOWN:\n "},"suffix":{"kind":"string","value":"\n\nstatic inline String ToSingleCharacterString(UChar c) {\n return String(&c, 1);\n}\n\nstatic String GetKeyIdentifierForWindowsKeyCode(unsigned short keyCode) {\n switch (keyCode) {\n case VK_MENU:\n return \"Alt\";\n case VK_CONTROL:\n return \"Control\";\n case VK_SHIFT:\n return \"Shift\";\n case VK_CAPITAL:\n return \"CapsLock\";\n case VK_LWIN:\n case VK_RWIN:\n return \"Win\";\n case VK_CLEAR:\n return \"Clear\";\n case VK_DOWN:\n return \"Down\";\n \n case VK_END:\n return \"End\";\n \n case VK_RETURN:\n return \"Enter\";\n case VK_EXECUTE:\n return \"Execute\";\n case VK_F1:\n return \"F1\";\n case VK_F2:\n return \"F2\";\n case VK_F3:\n return \"F3\";\n case VK_F4:\n return \"F4\";\n case VK_F5:\n return \"F5\";\n case VK_F6:\n return \"F6\";\n case VK_F7:\n return \"F7\";\n case VK_F8:\n return \"F8\";\n case VK_F9:\n return \"F9\";\n case VK_F10:\n return \"F11\";\n case VK_F12:\n return \"F12\";\n case VK_F13:\n return \"F13\";\n case VK_F14:\n return \"F14\";\n case VK_F15:\n return \"F15\";\n case VK_F16:\n return \"F16\";\n case VK_F17:\n return \"F17\";\n case VK_F18:\n return \"F18\";\n case VK_F19:\n return \"F19\";\n case VK_F20:\n return \"F20\";\n case VK_F21:\n return \"F21\";\n case VK_F22:\n return \"F22\";\n case VK_F23:\n return \"F23\";\n case VK_F24:\n return \"F24\";\n case VK_HELP:\n return \"Help\";\n case VK_HOME:\n return \"Home\";\n case VK_INSERT:\n return \"Insert\";\n case VK_LEFT:\n return \"Left\";\n case VK_NEXT:\n return \"PageDown\";\n case VK_PRIOR:\n return \"PageUp\";\n case VK_PAUSE:\n return \"Pause\";\n case VK_SNAPSHOT:\n return \"PrintScreen\";\n case VK_RIGHT:\n return \"Right\";\n case VK_SCROLL:\n return \"Scroll\";\n case VK_SELECT:\n return \"Select\";\n case VK_UP:\n return \"Up\";\n \n case VK_DELETE:\n return \"U+007F\";\n default:\n return String::format(\"U+%04X\", toupper(keyCode));\n }\n}\n\nMakePlatformKeyboardEvent::MakePlatformKeyboardEvent(const WebKeyboardEvent& e)\n {\n#if defined(OS_WIN) || defined(OS_LINUX)\n m_type = ToPlatformKeyboardEventType(e.type);\n if (m_type == Char || m_type == KeyDown)\n m_text = m_unmodifiedText = ToSingleCharacterString(e.key_code);\n if (m_type != Char)\n m_keyIdentifier = GetKeyIdentifierForWindowsKeyCode(e.key_code);\n if (m_type == Char || m_type == KeyDown || m_type == KeyUp ||\n m_type == RawKeyDown) {\n m_windowsVirtualKeyCode = e.key_code;\n } else {\n m_windowsVirtualKeyCode = 0;\n }\n#endif\n m_autoRepeat = (e.modifiers & WebInputEvent::IS_AUTO_REPEAT) != 0;\n m_isKeypad = (e.modifiers & WebInputEvent::IS_KEYPAD) != 0;\n m_shiftKey = (e.modifiers & WebInputEvent::SHIFT_KEY) != 0;\n m_ctrlKey = (e.modifiers & WebInputEvent::CTRL_KEY) != 0;\n m_altKey = (e.modifiers & WebInputEvent::ALT_KEY) != 0;\n m_metaKey = (e.modifiers & WebInputEvent::META_KEY) != 0;\n#if defined(OS_WIN)\n m_isSystemKey = e.system_key;\n#endif\n} \n\nvoid MakePlatformKeyboardEvent::SetKeyType(Type type) {\n \n \n \n ASSERT(m_type == KeyDown);\n ASSERT(type == RawKeyDown || type == Char);\n m_type = type;\n\n if (type == RawKeyDown) {\n m_text = String();\n m_unmodifiedText = String();\n } else {\n m_keyIdentifier = String();\n m_windowsVirtualKeyCode = 0;\n }\n}\n\nbool MakePlatformKeyboardEvent::IsCharacterKey() const {\n switch (windowsVirtualKeyCode()) {\n#if defined(OS_WIN)\n case VK_BACK:\n case VK_ESCAPE:\n#endif\n return false;\n\n default:\n break;\n }\n return true;\n}\n"},"middle":{"kind":"string","value":"return PlatformKeyboardEvent::KeyDown;\n case WebInputEvent::CHAR:\n return PlatformKeyboardEvent::Char;\n default:\n ASSERT_NOT_REACHED();\n }\n return PlatformKeyboardEvent::KeyDown;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"class SkEvent;\n\n\n","file_path":"skia/include/SkWidget.h","rank":0,"score":202538.54512832483},{"content":"class WebMouseEvent;\n","file_path":"chrome/browser/render_widget_host.h","rank":1,"score":191707.1018699238},{"content":"class WebMouseWheelEvent;\n","file_path":"chrome/browser/render_widget_host.h","rank":2,"score":186523.81193697584},{"content":"enum nsPluginEventType {\n\n#if defined(XP_MAC) || defined(XP_MACOSX)\n\n nsPluginEventType_GetFocusEvent = (osEvt + 16),\n\n nsPluginEventType_LoseFocusEvent,\n\n nsPluginEventType_AdjustCursorEvent,\n\n nsPluginEventType_MenuCommandEvent,\n\n nsPluginEventType_ClippingChangedEvent,\n\n nsPluginEventType_ScrollingBeginsEvent,\n\n nsPluginEventType_ScrollingEndsEvent,\n\n#endif /* XP_MAC || XP_MACOSX */\n\n nsPluginEventType_Idle = 0\n\n};\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\n\n","file_path":"third_party/mozilla/include/nsplugindefs.h","rank":3,"score":186078.27485863943},{"content":" friend bool operator>=(const Sk64& a, const Sk64& b) {\n","file_path":"skia/include/corecg/Sk64.h","rank":4,"score":185721.0476966447},{"content":"struct Sk64 {\n\n int32_t fHi; //!< the high 32 bits of the number (including sign)\n\n uint32_t fLo; //!< the low 32 bits of the number\n\n\n\n /** Returns non-zero if the Sk64 can be represented as a signed 32 bit integer\n\n */\n\n SkBool is32() const { return fHi == ((int32_t)fLo >> 31); }\n\n\n\n /** Returns non-zero if the Sk64 cannot be represented as a signed 32 bit integer\n\n */\n","file_path":"skia/include/corecg/Sk64.h","rank":5,"score":185716.89055185643},{"content":" class Widget;\n\n}\n\n\n","file_path":"webkit/glue/event_conversion.h","rank":6,"score":185355.38280090346},{"content":" u8 type; /* One of the SQLITE_COLL_... values below */\n","file_path":"third_party/sqlite/sqliteInt.h","rank":7,"score":182519.84629426096},{"content":" u8 type; /* One of SQLITE_NULL, SQLITE_TEXT, SQLITE_INTEGER, etc */\n","file_path":"third_party/sqlite/vdbeInt.h","rank":8,"score":182519.84629426096},{"content":" friend bool operator!=(const SkPoint& a, const SkPoint& b) {\n","file_path":"skia/include/corecg/SkPoint.h","rank":9,"score":182275.2633378561},{"content":"struct SkIPoint {\n\n int32_t fX, fY;\n\n\n\n /** Set the x and y values of the point. */\n\n void set(int32_t x, int32_t y) { fX = x; fY = y; }\n\n\n\n /** Rotate the point clockwise, writing the new point into dst\n\n It is legal for dst == this\n\n */\n","file_path":"skia/include/corecg/SkPoint.h","rank":10,"score":182271.23326263446},{"content":"struct SkRect {\n\n SkScalar fLeft, fTop, fRight, fBottom;\n\n\n\n /** Return true if the rectangle's width or height are <= 0\n\n */\n\n bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }\n","file_path":"skia/include/corecg/SkRect.h","rank":11,"score":182271.23326263446},{"content":" const T& top() const { return (*this)[fCount - 1]; }\n","file_path":"skia/include/SkTDArray.h","rank":12,"score":182271.23326263446},{"content":" friend int operator!=(const SkRect& a, const SkRect& b)\n","file_path":"skia/include/corecg/SkRect.h","rank":13,"score":182171.04427318225},{"content":"class WebMouseEvent;\n","file_path":"chrome/browser/render_widget_host_view_win.h","rank":14,"score":181613.4301361413},{"content":" def Type(self):\n","file_path":"third_party/libevent/event_rpcgen.py","rank":15,"score":179276.15155344678},{"content":" unsigned int use;\t\t/* The buffer size used */\n","file_path":"third_party/libxml/include/libxml/tree.h","rank":16,"score":179007.80452410717},{"content":" int type;\n","file_path":"third_party/libxml/include/libxml/tree.h","rank":17,"score":178948.07145318962},{"content":" xmlElementType type; /* XML_ENTITY_DECL, must be second ! */\n","file_path":"third_party/libxml/include/libxml/entities.h","rank":18,"score":178933.2806086113},{"content":" xmlXPathObjectType type;\n","file_path":"third_party/libxml/include/libxml/xpath.h","rank":19,"score":178933.2806086113},{"content":"class SkStaticTextView : public SkView {\n\npublic:\n\n SkStaticTextView(uint32_t flags = 0);\n\n virtual ~SkStaticTextView();\n\n\n\n enum Mode {\n\n kFixedSize_Mode,\n\n kAutoWidth_Mode,\n\n kAutoHeight_Mode,\n\n\n\n kModeCount\n\n };\n\n Mode getMode() const { return (Mode)fMode; }\n\n void setMode(Mode);\n\n\n\n SkTextBox::SpacingAlign getSpacingAlign() const { return (SkTextBox::SpacingAlign)fSpacingAlign; }\n\n void setSpacingAlign(SkTextBox::SpacingAlign);\n\n\n\n void getMargin(SkPoint* margin) const;\n\n void setMargin(SkScalar dx, SkScalar dy);\n","file_path":"skia/include/SkWidget.h","rank":20,"score":176620.30676807562},{"content":"class SkListSource : public SkEventSink {\n\npublic:\n\n virtual int countRows() = 0;\n\n virtual void getRow(int index, SkString* left, SkString* right) = 0;\n\n virtual SkEvent* getEvent(int index);\n\n\n\n static SkListSource* CreateFromDir(const char path[], const char suffix[],\n\n const char targetPrefix[]);\n\n static SkListSource* CreateFromDOM(const SkDOM& dom, const SkDOM::Node* node);\n\n};\n\n\n","file_path":"skia/include/SkWidget.h","rank":21,"score":176562.47558330497},{"content":" xmlSchemaTypePtr type;/* the linked type */\n","file_path":"third_party/libxml/include/libxml/schemasInternals.h","rank":22,"score":175845.87841256196},{"content":"class SkStaticTextView : public SkView {\n\npublic:\n\n SkStaticTextView();\n\n virtual ~SkStaticTextView();\n\n\n\n enum Mode {\n\n kFixedSize_Mode,\n\n kAutoWidth_Mode,\n\n kAutoHeight_Mode,\n\n\n\n kModeCount\n\n };\n\n Mode getMode() const { return (Mode)fMode; }\n\n void setMode(Mode);\n\n\n\n SkTextBox::SpacingAlign getSpacingAlign() const { return (SkTextBox::SpacingAlign)fSpacingAlign; }\n\n void setSpacingAlign(SkTextBox::SpacingAlign);\n\n\n\n void getMargin(SkPoint* margin) const;\n\n void setMargin(SkScalar dx, SkScalar dy);\n","file_path":"skia/include/SkWidgetViews.h","rank":23,"score":172203.20923618547},{"content":"class nsIEventHandler; // event handler interface\n","file_path":"third_party/mozilla/include/nsplugindefs.h","rank":24,"score":163693.41752403794},{"content":"struct DefaultSingletonObjCTraits : public DefaultSingletonTraits<Type> {\n\n static Type* New() {\n\n return [[Type alloc] init];\n\n }\n\n\n\n static void Delete(Type* object) {\n\n [object release];\n\n }\n\n};\n\n\n\n// Exactly like Singleton, but without the DefaultSingletonObjCTraits as the\n\n// default trait class. This makes it straightforward for Objective-C++ code\n\n// to hold Objective-C objects as singletons.\n\ntemplate<typename Type,\n\n typename Traits = DefaultSingletonObjCTraits<Type>,\n\n typename DifferentiatingType = Type>\n","file_path":"base/singleton_objc.h","rank":25,"score":158684.92974225993},{"content":"class MakePlatformMouseEvent : public WebCore::PlatformMouseEvent {\n\n public:\n\n MakePlatformMouseEvent(WebCore::Widget* widget, const WebMouseEvent& e);\n\n\n\n static void ResetLastClick() {\n\n last_click_time_ = last_click_count_ = 0;\n\n }\n\n\n\n private:\n\n static int last_click_count_;\n\n static uint32 last_click_time_;\n\n};\n\n\n","file_path":"webkit/glue/event_conversion.h","rank":26,"score":155914.11477717437},{"content":"class WebMouseWheelEvent : public WebMouseEvent {\n\n public:\n\n int delta_x;\n\n int delta_y;\n\n\n\n WebMouseWheelEvent() {}\n\n#if defined(OS_WIN)\n\n WebMouseWheelEvent(HWND hwnd, UINT message, WPARAM wparam, LPARAM lparam);\n\n#elif defined(OS_MACOSX)\n\n WebMouseWheelEvent(NSEvent *event, NSView* view);\n\n#elif defined(OS_LINUX)\n\n explicit WebMouseWheelEvent(const GdkEventScroll* event);\n\n#endif\n\n};\n\n\n\n// WebKeyboardEvent -----------------------------------------------------------\n\n\n","file_path":"webkit/glue/webinputevent.h","rank":27,"score":153963.16087182373},{"content":"////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// MouseEvent class\n\n//\n\n// A mouse event is used for any input event related to the mouse.\n\n//\n\n////////////////////////////////////////////////////////////////////////////////\n\nclass MouseEvent : public LocatedEvent {\n\n public:\n\n // Flags specific to mouse events\n\n enum MouseEventFlags { EF_IS_DOUBLE_CLICK = 1 << 16 };\n\n\n\n // Create a new mouse event\n\n MouseEvent(EventType type, int x, int y, int flags)\n\n : LocatedEvent(type, gfx::Point(x, y), flags) {\n\n }\n\n\n\n // Create a new mouse event from a type and a point. If from / to views\n\n // are provided, the point will be converted from 'from' coordinate system to\n\n // 'to' coordinate system.\n\n MouseEvent(EventType type,\n\n View* from,\n\n View* to,\n\n const gfx::Point &l,\n\n int flags);\n\n\n\n // Create a new MouseEvent which is identical to the provided model.\n","file_path":"chrome/views/event.h","rank":28,"score":152930.06817280495},{"content":"class SkEvent {\n\npublic:\n\n /** Default construct, creating an empty event.\n\n */\n\n SkEvent();\n\n /** Construct a new event with the specified type.\n\n */\n\n explicit SkEvent(const SkString& type);\n\n /** Construct a new event with the specified type.\n\n */\n\n explicit SkEvent(const char type[]);\n\n /** Construct a new event by copying the fields from the src event.\n\n */\n\n SkEvent(const SkEvent& src);\n\n ~SkEvent();\n\n\n\n// /** Return the event's type (will never be null) */\n\n// const char* getType() const;\n\n /** Copy the event's type into the specified SkString parameter */\n\n void getType(SkString* str) const;\n","file_path":"skia/include/SkEvent.h","rank":29,"score":151217.83670894802},{"content":"////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// MouseWheelEvent class\n\n//\n\n// A MouseWheelEvent is used to propagate mouse wheel user events\n\n//\n\n////////////////////////////////////////////////////////////////////////////////\n\nclass MouseWheelEvent : public LocatedEvent {\n\n public:\n\n // Create a new key event\n\n MouseWheelEvent(int offset, int x, int y, int flags)\n\n : LocatedEvent(ET_MOUSEWHEEL, gfx::Point(x, y), flags),\n\n offset_(offset) {\n\n }\n\n\n\n int GetOffset() const {\n\n return offset_;\n\n }\n\n\n\n private:\n\n int offset_;\n\n\n\n DISALLOW_EVIL_CONSTRUCTORS(MouseWheelEvent);\n\n};\n\n\n","file_path":"chrome/views/event.h","rank":30,"score":150067.56099565374},{"content":"class WebMouseEvent;\n","file_path":"webkit/glue/event_conversion.h","rank":31,"score":148226.6872130068},{"content":"class MouseEvent;\n\n}\n\n\n\nnamespace event_utils {\n\n\n\n// Translates event flags into what kind of disposition they represents.\n\n// For example, a middle click would mean to open a background tab.\n\n// event_flags are the flags as understood by views::MouseEvent.\n\nWindowOpenDisposition DispositionFromEventFlags(int event_flags);\n\n\n\n// Returns true if the specified mouse event may have a\n\n// WindowOptionDisposition.\n\nbool IsPossibleDispositionEvent(const views::MouseEvent& event);\n\n\n\n}\n\n\n\n#endif // CHROME_BROWSER_VIEWS_BOOKMARK_BAR_VIEW_H__\n\n\n","file_path":"chrome/browser/views/event_utils.h","rank":32,"score":148226.6872130068},{"content":"class SkHasLabelWidget : public SkWidget {\n\npublic:\n\n SkHasLabelWidget(uint32_t flags = 0) : SkWidget(flags) {}\n\n\n\n size_t getLabel(SkString* label = NULL) const;\n\n size_t getLabel(char lable[] = NULL) const;\n\n void setLabel(const SkString&);\n\n void setLabel(const char label[]);\n\n void setLabel(const char label[], size_t len);\n\n\n\nprotected:\n\n // called when the label changes\n\n virtual void onLabelChange();\n\n\n\n // overrides\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\n\n\n\nprivate:\n\n SkString fLabel;\n\n typedef SkWidget INHERITED;\n\n};\n\n\n","file_path":"skia/include/SkWidget.h","rank":33,"score":146937.9764744974},{"content":"struct LockTrait : public DefaultSingletonTraits<Type> {\n\n};\n\n\n","file_path":"base/singleton_unittest.cc","rank":34,"score":146059.49856765842},{"content":"struct Init5Trait : public DefaultSingletonTraits<int> {\n\n static int* New() {\n\n return new int(5);\n\n }\n\n};\n\n\n\ntypedef void (*CallbackFunc)();\n\n\n","file_path":"base/singleton_unittest.cc","rank":35,"score":146035.5467868311},{"content":"class V8SVGStaticPODTypeWrapperWithPODTypeParent : public V8SVGStaticPODTypeWrapper<PODType> { \n\npublic: \n\n typedef V8SVGPODTypeWrapper<ParentTypeArg> ParentType; \n\n \n\n V8SVGStaticPODTypeWrapperWithPODTypeParent(PODType type, ParentType* parent) \n\n : V8SVGStaticPODTypeWrapper<PODType>(type) \n\n , m_parentType(parent) \n\n { \n\n } \n\n\n\n virtual void commitChange(PODType type, SVGElement* context) \n\n { \n\n V8SVGStaticPODTypeWrapper<PODType>::commitChange(type, context); \n\n m_parentType->commitChange(ParentTypeArg(type), context); \n\n } \n\n \n\nprivate: \n\n RefPtr<ParentType> m_parentType; \n\n}; \n\n \n\ntemplate<typename PODType, typename ParentType> \n","file_path":"webkit/port/bindings/v8/V8SVGPODTypeWrapper.h","rank":36,"score":145432.54897729194},{"content":"class WebMouseWheelEvent;\n","file_path":"webkit/glue/event_conversion.h","rank":37,"score":144945.9521450423},{"content":"enum SkWidgetEnum {\n\n kBorder_WidgetEnum, //!< <sk-border>\n\n kButton_WidgetEnum, //!< <sk-button>\n\n kImage_WidgetEnum, //!< <sk-image>\n\n kList_WidgetEnum, //!< <sk-list>\n\n kProgress_WidgetEnum, //!< <sk-progress>\n\n kScroll_WidgetEnum, //!< <sk-scroll>\n\n kText_WidgetEnum, //!< <sk-text>\n\n \n\n kWidgetEnumCount\n\n};\n\n\n","file_path":"skia/include/SkWidgetViews.h","rank":38,"score":144558.83996627058},{"content":"class SkButtonWidget : public SkHasLabelWidget {\n\npublic:\n\n SkButtonWidget(uint32_t flags = 0) : SkHasLabelWidget(flags), fState(kOff_State) {}\n\n\n\n enum State {\n\n kOff_State, //!< XML: buttonState=\"off\"\n\n kOn_State, //!< XML: buttonState=\"on\"\n\n kUnknown_State //!< XML: buttonState=\"unknown\"\n\n };\n\n State getButtonState() const { return fState; }\n\n void setButtonState(State);\n\n\n\nprotected:\n\n /** called when the label changes. default behavior is to inval the widget */\n\n virtual void onButtonStateChange();\n\n\n\n // overrides\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\n\n\n\nprivate:\n\n State fState;\n\n typedef SkHasLabelWidget INHERITED;\n\n};\n\n\n","file_path":"skia/include/SkWidget.h","rank":39,"score":144316.80861774163},{"content":" void ensureStrCache(int visibleCount);\n\n\n\n int logicalToVisualIndex(int index) const { return index - fScrollIndex; }\n\n void invalSelection();\n\n bool getRowRect(int index, SkRect*) const;\n\n void ensureSelectionIsVisible();\n\n\n\n typedef SkWidgetView INHERITED;\n\n};\n\n\n\n//////////////////////////////////////////////////////////\n\n\n","file_path":"skia/include/SkWidget.h","rank":40,"score":143363.6027154187},{"content":" */\n\n void setActionEvent(Action, SkEvent* event);\n\n#endif\n\n\n\nprotected:\n\n virtual void onDraw(SkCanvas*);\n\n virtual void onSizeChange();\n\n virtual bool onEvent(const SkEvent&);\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\n\n\n\nprivate:\n\n SkPaint fPaint[kAttrCount];\n\n SkListSource* fSource;\n\n SkScalar fRowHeight;\n\n int fCurrIndex; // logical index\n\n int fScrollIndex; // logical index of top-most visible row\n\n int fVisibleRowCount;\n\n SkString* fStrCache;\n\n\n\n void dirtyStrCache();\n","file_path":"skia/include/SkWidget.h","rank":41,"score":143363.46163550302},{"content":"/* include/graphics/SkWidget.h\n\n**\n\n** Copyright 2006, Google Inc.\n\n**\n\n** Licensed under the Apache License, Version 2.0 (the \"License\"); \n\n** you may not use this file except in compliance with the License. \n\n** You may obtain a copy of the License at \n\n**\n\n** http://www.apache.org/licenses/LICENSE-2.0 \n\n**\n\n** Unless required by applicable law or agreed to in writing, software \n\n** distributed under the License is distributed on an \"AS IS\" BASIS, \n\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \n\n** See the License for the specific language governing permissions and \n\n** limitations under the License.\n\n*/\n\n\n\n#ifndef SkWidget_DEFINED\n\n#define SkWidget_DEFINED\n\n\n\n#include \"SkView.h\"\n\n#include \"SkBitmap.h\"\n\n#include \"SkDOM.h\"\n\n#include \"SkPaint.h\"\n\n#include \"SkString.h\"\n\n#include \"SkTDArray.h\"\n\n\n\n//////////////////////////////////////////////////////////////////////////////\n\n\n","file_path":"skia/include/SkWidget.h","rank":42,"score":143363.315885711},{"content":" SkPoint fCellSize;\n\n SkIPoint fVisibleCount;\n\n\n\n int logicalToVisualIndex(int index) const { return index; }\n\n void invalSelection();\n\n bool getCellRect(int index, SkRect*) const;\n\n void ensureSelectionIsVisible();\n\n\n\n typedef SkWidgetView INHERITED;\n\n};\n\n\n\n#endif\n\n\n","file_path":"skia/include/SkWidget.h","rank":43,"score":143363.2339731987},{"content":" /** Returns true if the event's type matches exactly the specified type (case sensitive) */\n\n bool isType(const SkString& str) const;\n\n /** Returns true if the event's type matches exactly the specified type (case sensitive) */\n\n bool isType(const char type[], size_t len = 0) const;\n\n /** Set the event's type to the specified string.\n\n In XML, use the \"type\" attribute.\n\n */\n\n void setType(const SkString&);\n\n /** Set the event's type to the specified string.\n\n In XML, use the \"type\" attribute.\n\n */\n\n void setType(const char type[], size_t len = 0);\n\n\n\n /** Return the event's unnamed 32bit field. Default value is 0 */\n\n uint32_t getFast32() const { return f32; }\n\n /** Set the event's unnamed 32bit field. In XML, use\n\n the subelement <data fast32=... />\n\n */\n\n void setFast32(uint32_t x) { f32 = x; }\n\n\n","file_path":"skia/include/SkEvent.h","rank":44,"score":143361.30595656464},{"content":" kHiliteCell_Attr,\n\n kAttrCount\n\n };\n\n SkPaint& paint(Attr);\n\n\n\n SkListSource* getListSource() const { return fSource; }\n\n SkListSource* setListSource(SkListSource*);\n\n\n\nprotected:\n\n virtual void onDraw(SkCanvas*);\n\n virtual void onSizeChange();\n\n virtual bool onEvent(const SkEvent&);\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\n\n\n\nprivate:\n\n SkView* fScrollBar;\n\n SkPaint fPaint[kAttrCount];\n\n SkListSource* fSource;\n\n int fCurrIndex; // logical index\n\n\n","file_path":"skia/include/SkWidget.h","rank":45,"score":143358.80508252245},{"content":" kNormalText_Attr,\n\n kHiliteText_Attr,\n\n kHiliteCell_Attr,\n\n kAttrCount\n\n };\n\n SkPaint& paint(Attr);\n\n\n\n SkListSource* getListSource() const { return fSource; }\n\n SkListSource* setListSource(SkListSource*);\n\n\n\n#if 0\n\n enum Action {\n\n kSelectionChange_Action,\n\n kSelectionPicked_Action,\n\n kActionCount\n\n };\n\n /** If event is not null, it is retained by the view, and a copy\n\n of the event will be posted to its listeners when the specified\n\n action occurs. If event is null, then no event will be posted for\n\n the specified action.\n","file_path":"skia/include/SkWidget.h","rank":46,"score":143352.13978522262},{"content":"\n\n ////////////////////////////////////////////////////\n\n /** Porting layer must implement these functions **/\n\n ////////////////////////////////////////////////////\n\n\n\n /** Called whenever an SkEvent is posted to an empty queue, so that the OS\n\n can be told to later call Dequeue().\n\n */\n\n static void SignalNonEmptyQueue();\n\n /** Called whenever the delay until the next delayed event changes. If zero is\n\n passed, then there are no more queued delay events.\n\n */\n\n static void SignalQueueTimer(SkMSec delay);\n\n\n\n#ifndef SK_USE_WXWIDGETS\n\n#ifdef SK_BUILD_FOR_WIN\n\n static bool WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam);\n\n#elif defined(SK_BUILD_FOR_UNIXx)\n\n static uint32_t HandleTimer(uint32_t, void*);\n\n static bool WndProc(Display*, Window, XEvent&);\n","file_path":"skia/include/SkEvent.h","rank":47,"score":143344.27097085555},{"content":"\n\n size_t getText(SkString* text = NULL) const;\n\n size_t getText(char text[] = NULL) const;\n\n void setText(const SkString&);\n\n void setText(const char text[]);\n\n void setText(const char text[], size_t len);\n\n\n\n void getPaint(SkPaint*) const;\n\n void setPaint(const SkPaint&);\n\n\n\nprotected:\n\n // overrides\n\n virtual void onDraw(SkCanvas*);\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\n\n\n\nprivate:\n\n SkPoint fMargin;\n\n SkString fText;\n\n SkPaint fPaint;\n\n uint8_t fMode;\n\n uint8_t fSpacingAlign;\n\n\n\n void computeSize();\n\n\n\n typedef SkView INHERITED;\n\n};\n\n\n","file_path":"skia/include/SkWidget.h","rank":48,"score":143344.13356008072},{"content":" SkPaint& paint() { return fPaint; }\n\n\n\nprotected:\n\n virtual void onDraw(SkCanvas*);\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\n\n\n\nprivate:\n\n SkString fText;\n\n SkPaint fPaint;\n\n SkPoint fMargin;\n\n\n","file_path":"skia/include/SkWidget.h","rank":49,"score":143344.13356008072},{"content":"#endif\n\n#else\n\n // Don't know yet what this will be\n\n //static bool CustomEvent();\n\n#endif\n\n\n\nprivate:\n\n SkMetaData fMeta;\n\n mutable char* fType; // may be characters with low bit set to know that it is not a pointer\n\n uint32_t f32;\n\n SkDEBUGCODE(bool fDebugTrace;)\n\n\n\n // these are for our implementation of the event queue\n\n SkEventSinkID fTargetID;\n\n SkMSec fTime;\n\n SkEvent* fNextEvent; // either in the delay or normal event queue\n\n void initialize(const char* type, size_t typeLen);\n\n\n\n static bool Enqueue(SkEvent* evt);\n\n static SkMSec EnqueueTime(SkEvent* evt, SkMSec time);\n\n static SkEvent* Dequeue(SkEventSinkID* targetID);\n\n static bool QHasEvents();\n\n};\n\n\n\n#endif\n\n\n","file_path":"skia/include/SkEvent.h","rank":50,"score":143341.8130039583},{"content":"#include \"SkDOM.h\"\n\n#include \"SkMetaData.h\"\n\n#include \"SkString.h\"\n\n\n\n//class SkOSWindow;\n\n\n\n/** Unique 32bit id used to identify an instance of SkEventSink. When events are\n\n posted, they are posted to a specific sinkID. When it is time to dispatch the\n\n event, the sinkID is used to find the specific SkEventSink object. If it is found,\n\n its doEvent() method is called with the event.\n\n*/\n\ntypedef uint32_t SkEventSinkID;\n\n\n\n/** \\class SkEvent\n\n\n\n SkEvents are used to communicate type-safe information to SkEventSinks.\n\n SkEventSinks (including SkViews) each have a unique ID, which is stored\n\n in an event. This ID is used to target the event once it has been \"posted\".\n\n*/\n","file_path":"skia/include/SkEvent.h","rank":51,"score":143338.89713279513},{"content":" and ignore the value parameter.\n\n */\n\n bool findPtr(const char name[], void** value) const { return fMeta.findPtr(name, value); }\n\n bool findBool(const char name[], bool* value) const { return fMeta.findBool(name, value); }\n\n\n\n /** Returns true if ethe event contains the named 32bit field, and if it equals the specified value */\n\n bool hasS32(const char name[], int32_t value) const { return fMeta.hasS32(name, value); }\n\n /** Returns true if ethe event contains the named SkScalar field, and if it equals the specified value */\n\n bool hasScalar(const char name[], SkScalar value) const { return fMeta.hasScalar(name, value); }\n\n /** Returns true if ethe event contains the named string field, and if it equals (using strcmp) the specified value */\n\n bool hasString(const char name[], const char value[]) const { return fMeta.hasString(name, value); }\n\n /** Returns true if ethe event contains the named pointer field, and if it equals the specified value */\n\n bool hasPtr(const char name[], void* value) const { return fMeta.hasPtr(name, value); }\n\n bool hasBool(const char name[], bool value) const { return fMeta.hasBool(name, value); }\n\n\n\n /** Add/replace the named 32bit field to the event. In XML use the subelement <data name=... s32=... /> */\n\n void setS32(const char name[], int32_t value) { fMeta.setS32(name, value); }\n\n /** Add/replace the named SkScalar field to the event. In XML use the subelement <data name=... scalar=... /> */\n\n void setScalar(const char name[], SkScalar value) { fMeta.setScalar(name, value); }\n\n /** Add/replace the named SkScalar[] field to the event. */\n","file_path":"skia/include/SkEvent.h","rank":52,"score":143336.24266477034},{"content":" SkScalar* setScalars(const char name[], int count, const SkScalar values[] = NULL) { return fMeta.setScalars(name, count, values); }\n\n /** Add/replace the named string field to the event. In XML use the subelement <data name=... string=... */\n\n void setString(const char name[], const SkString& value) { fMeta.setString(name, value.c_str()); }\n\n /** Add/replace the named string field to the event. In XML use the subelement <data name=... string=... */\n\n void setString(const char name[], const char value[]) { fMeta.setString(name, value); }\n\n /** Add/replace the named pointer field to the event. There is no XML equivalent for this call */\n\n void setPtr(const char name[], void* value) { fMeta.setPtr(name, value); }\n\n void setBool(const char name[], bool value) { fMeta.setBool(name, value); }\n\n\n\n /** Return the underlying metadata object */\n\n SkMetaData& getMetaData() { return fMeta; }\n\n /** Return the underlying metadata object */\n\n const SkMetaData& getMetaData() const { return fMeta; }\n\n\n\n void tron() { SkDEBUGCODE(fDebugTrace = true;) }\n\n void troff() { SkDEBUGCODE(fDebugTrace = false;) }\n\n bool isDebugTrace() const\n\n {\n\n#ifdef SK_DEBUG\n\n return fDebugTrace;\n","file_path":"skia/include/SkEvent.h","rank":53,"score":143333.49647983554},{"content":"#else\n\n return false;\n\n#endif\n\n }\n\n\n\n /** Call this to initialize the event from the specified XML node */\n\n void inflate(const SkDOM&, const SkDOM::Node*);\n\n\n\n SkDEBUGCODE(void dump(const char title[] = NULL);)\n\n\n\n /** Post the specified event to the event queue, targeting the specified eventsink, with an optional\n\n delay. The event must be dynamically allocated for this. It cannot be a global or on the stack.\n\n After this call, ownership is transfered to the system, so the caller must not retain\n\n the event's ptr. Returns false if the event could not be posted (which means it will have been deleted).\n\n */\n\n static bool Post(SkEvent* evt, SkEventSinkID targetID, SkMSec delay = 0);\n\n /** Post the specified event to the event queue, targeting the specified eventsink, to be delivered on/after the\n\n specified millisecond time. The event must be dynamically allocated for this. It cannot be a global or on the stack.\n\n After this call, ownership is transfered to the system, so the caller must not retain\n\n the event's ptr. Returns false if the event could not be posted (which means it will have been deleted).\n","file_path":"skia/include/SkEvent.h","rank":54,"score":143331.47257250478},{"content":"\n\n /** Global initialization function for the SkEvent system. Should be called exactly\n\n once before any other event method is called, and should be called after the\n\n call to SkGraphics::Init().\n\n */\n\n static void Init();\n\n /** Global cleanup function for the SkEvent system. Should be called exactly once after\n\n all event methods have been called, and should be called before calling SkGraphics::Term().\n\n */\n\n static void Term();\n\n\n\n /** Call this to process one event from the queue. If it returns true, there are more events\n\n to process.\n\n */\n\n static bool ProcessEvent();\n\n /** Call this whenever the requested timer has expired (requested by a call to SetQueueTimer).\n\n It will post any delayed events whose time as \"expired\" onto the event queue.\n\n It may also call SignalQueueTimer() and SignalNonEmptyQueue().\n\n */\n\n static void ServiceQueueTimer();\n","file_path":"skia/include/SkEvent.h","rank":55,"score":143330.33260070928},{"content":" /** Return true if the event contains the named 32bit field, and return the field\n\n in value (if value is non-null). If there is no matching named field, return false\n\n and ignore the value parameter.\n\n */\n\n bool findS32(const char name[], int32_t* value = NULL) const { return fMeta.findS32(name, value); }\n\n /** Return true if the event contains the named SkScalar field, and return the field\n\n in value (if value is non-null). If there is no matching named field, return false\n\n and ignore the value parameter.\n\n */\n\n bool findScalar(const char name[], SkScalar* value = NULL) const { return fMeta.findScalar(name, value); }\n\n /** Return true if the event contains the named SkScalar field, and return the fields\n\n in value[] (if value is non-null), and return the number of SkScalars in count (if count is non-null).\n\n If there is no matching named field, return false and ignore the value and count parameters.\n\n */\n\n const SkScalar* findScalars(const char name[], int* count, SkScalar values[] = NULL) const { return fMeta.findScalars(name, count, values); }\n\n /** Return the value of the named string field, or if no matching named field exists, return null.\n\n */\n\n const char* findString(const char name[]) const { return fMeta.findString(name); }\n\n /** Return true if the event contains the named pointer field, and return the field\n\n in value (if value is non-null). If there is no matching named field, return false\n","file_path":"skia/include/SkEvent.h","rank":56,"score":143330.2531670084},{"content":" */\n\n static bool PostTime(SkEvent* evt, SkEventSinkID targetID, SkMSec time);\n\n\n\n /** Helper method for calling SkEvent::PostTime(this, ...), where the caller specifies a delay.\n\n The real \"time\" will be computed automatically by sampling the clock and adding its value\n\n to delay.\n\n */\n\n bool post(SkEventSinkID sinkID, SkMSec delay = 0)\n\n {\n\n return SkEvent::Post(this, sinkID, delay);\n\n }\n\n\n\n void postTime(SkEventSinkID sinkID, SkMSec time)\n\n {\n\n SkEvent::PostTime(this, sinkID, time);\n\n }\n\n\n\n ///////////////////////////////////////////////\n\n /** Porting layer must call these functions **/\n\n ///////////////////////////////////////////////\n","file_path":"skia/include/SkEvent.h","rank":57,"score":143328.5134040907},{"content":"/* include/graphics/SkEvent.h\n\n**\n\n** Copyright 2006, Google Inc.\n\n**\n\n** Licensed under the Apache License, Version 2.0 (the \"License\"); \n\n** you may not use this file except in compliance with the License. \n\n** You may obtain a copy of the License at \n\n**\n\n** http://www.apache.org/licenses/LICENSE-2.0 \n\n**\n\n** Unless required by applicable law or agreed to in writing, software \n\n** distributed under the License is distributed on an \"AS IS\" BASIS, \n\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \n\n** See the License for the specific language governing permissions and \n\n** limitations under the License.\n\n*/\n\n\n\n#ifndef SkEvent_DEFINED\n\n#define SkEvent_DEFINED\n\n\n","file_path":"skia/include/SkEvent.h","rank":58,"score":143326.4670670559},{"content":"static void event_log(int severity, const char *msg);\n","file_path":"third_party/libevent/log.c","rank":59,"score":141809.9876749245},{"content":"class SkCheckBoxWidget : public SkButtonWidget {\n\npublic:\n\n SkCheckBoxWidget(uint32_t flags = 0);\n\n\n\nprotected:\n\n virtual bool onEvent(const SkEvent&);\n\n virtual void onDraw(SkCanvas*);\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\n\n\n\nprivate:\n\n typedef SkButtonWidget INHERITED;\n\n};\n\n\n\n#include \"SkTextBox.h\"\n\n\n","file_path":"skia/include/SkWidget.h","rank":60,"score":141799.2830122883},{"content":"class SkPushButtonWidget : public SkButtonWidget {\n\npublic:\n\n SkPushButtonWidget(uint32_t flags = 0) : SkButtonWidget(flags) {}\n\n\n\nprotected:\n\n virtual bool onEvent(const SkEvent&);\n\n virtual void onDraw(SkCanvas*);\n\n virtual Click* onFindClickHandler(SkScalar x, SkScalar y);\n\n virtual bool onClick(Click* click);\n\n\n\nprivate:\n\n typedef SkButtonWidget INHERITED;\n\n};\n\n\n","file_path":"skia/include/SkWidget.h","rank":61,"score":141799.2830122883},{"content":"class SkWidget : public SkView {\n\npublic:\n\n SkWidget(uint32_t flags = 0) : SkView(flags | kFocusable_Mask | kEnabled_Mask) {}\n\n\n\n /** Call this to post the widget's event to its listeners */\n\n void postWidgetEvent();\n\n\n\n static void Init();\n\n static void Term();\n\nprotected:\n\n // override to add slots to an event before posting\n\n virtual void prepareWidgetEvent(SkEvent*);\n\n virtual void onEnabledChange();\n\n\n\n // <event ...> to initialize the event from XML\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\n\n\n\nprivate:\n\n SkEvent fEvent;\n\n typedef SkView INHERITED;\n\n};\n\n\n","file_path":"skia/include/SkWidget.h","rank":62,"score":141438.0969106585},{"content":"class MouseEvent;\n\n\n","file_path":"chrome/views/button.h","rank":63,"score":139429.58696200512},{"content":"// Copyright (c) 2008 The Chromium Authors. All rights reserved.\n\n// Use of this source code is governed by a BSD-style license that can be\n\n// found in the LICENSE file.\n\n\n\n#ifndef BASE_GFX_NATIVE_WIDGET_TYPES_H_\n\n#define BASE_GFX_NATIVE_WIDGET_TYPES_H_\n\n\n\n#include \"build/build_config.h\"\n\n\n\n#if defined(OS_WIN)\n\n#include <windows.h>\n\n#elif defined(OS_MACOSX)\n\n#ifdef __OBJC__\n\n@class NSView;\n\n@class NSWindow;\n\n@class NSTextField;\n\n#else\n","file_path":"base/gfx/native_widget_types.h","rank":64,"score":139419.84772068344},{"content":"class TraceLog {\n\n public:\n\n enum EventType {\n\n EVENT_BEGIN,\n\n EVENT_END,\n\n EVENT_INSTANT\n\n };\n\n\n\n // Is tracing currently enabled.\n\n static bool IsTracing();\n\n // Start logging trace events.\n\n static bool StartTracing();\n\n // Stop logging trace events.\n\n static void StopTracing();\n\n\n\n // Log a trace event of (name, type, id) with the optional extra string.\n\n void Trace(const std::string& name, \n\n EventType type,\n\n const void* id,\n\n const std::wstring& extra,\n","file_path":"base/trace_event.h","rank":65,"score":139410.60618695582},{"content":" */\n\n bool moveSelectionUp();\n\n /** If possible, move the selection down and return true,\n\n else do nothing and return false.\n\n If nothing is selected, select the first item (unless there are no items).\n\n */\n\n bool moveSelectionDown();\n\n\n\n SkListSource* getListSource() const { return fSource; }\n\n SkListSource* setListSource(SkListSource*);\n\n\n\n /** Call this in your event handler. If the specified event is from a SkListView,\n\n then it returns the index of the selected item in this list, otherwise it\n\n returns -1\n\n */\n\n static int GetWidgetEventListIndex(const SkEvent&);\n\n\n\nprotected:\n\n // overrides\n\n virtual void onDraw(SkCanvas*);\n","file_path":"skia/include/SkWidgetViews.h","rank":66,"score":139025.56319613222},{"content":" virtual void onSizeChange();\n\n virtual bool onEvent(const SkEvent&);\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\n\n virtual bool onPrepareWidgetEvent(SkEvent*);\n\n\n\nprivate:\n\n enum DirtyFlags {\n\n kAnimCount_DirtyFlag = 0x01,\n\n kAnimContent_DirtyFlag = 0x02\n\n };\n\n void dirtyCache(unsigned dirtyFlags);\n\n bool ensureCache();\n\n\n\n int logicalToVisualIndex(int index) const { return index - fScrollIndex; }\n\n void invalSelection();\n\n SkScalar getContentWidth() const;\n\n bool getRowRect(int index, SkRect*) const;\n\n void ensureSelectionIsVisible();\n\n void ensureVisibleRowCount();\n\n\n","file_path":"skia/include/SkWidgetViews.h","rank":67,"score":139023.94407867506},{"content":" static SkEventSinkID GetWidgetEventSinkID(const SkEvent&);\n\n\n\nprotected:\n\n /** called when the label changes. override in subclasses. default action invals the view's bounds.\n\n called with the old and new labels, before the label has actually changed.\n\n */\n\n virtual void onLabelChange(const char oldLabel[], const char newLabel[]);\n\n /** called before posting the event to our listeners. Override to add slots to the event\n\n before posting. Return true to proceed with posting, or false to not post the event to any\n\n listener. Note: the event passed in may not be the same as calling this->event().\n\n Be sure to call your INHERITED method as well, so that all classes in the hierarchy get a shot\n\n at modifying the event (and possibly returning false to abort).\n\n */\n\n virtual bool onPrepareWidgetEvent(SkEvent* evt);\n\n\n\n // overrides\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\n\n \n\nprivate:\n\n SkString fLabel;\n\n SkEvent fEvent;\n\n \n\n typedef SkView INHERITED;\n\n};\n\n\n\n////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n","file_path":"skia/include/SkWidgetViews.h","rank":68,"score":139022.95838303943},{"content":"\n\nprotected:\n\n // called when the check-state is about to change, but before it actually has\n\n virtual void onCheckStateChange(CheckState oldState, CheckState newState);\n\n\n\n // overrides\n\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\n\n virtual bool onPrepareWidgetEvent(SkEvent* evt);\n\n \n\nprivate:\n\n uint8_t fCheckState;\n\n \n\n typedef SkWidgetView INHERITED;\n\n};\n\n\n\n////////////////////////////////////////////////////////////////////////////////////////////////\n\n#include \"SkTextBox.h\"\n\n\n","file_path":"skia/include/SkWidgetViews.h","rank":69,"score":139022.08940994955},{"content":"/* include/graphics/SkWidgetViews.h\n\n**\n\n** Copyright 2006, Google Inc.\n\n**\n\n** Licensed under the Apache License, Version 2.0 (the \"License\"); \n\n** you may not use this file except in compliance with the License. \n\n** You may obtain a copy of the License at \n\n**\n\n** http://www.apache.org/licenses/LICENSE-2.0 \n\n**\n\n** Unless required by applicable law or agreed to in writing, software \n\n** distributed under the License is distributed on an \"AS IS\" BASIS, \n\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \n\n** See the License for the specific language governing permissions and \n\n** limitations under the License.\n\n*/\n\n\n\n#ifndef SkWidgetViews_DEFINED\n\n#define SkWidgetViews_DEFINED\n\n\n\n#include \"SkView.h\"\n\n\n\n\n","file_path":"skia/include/SkWidgetViews.h","rank":70,"score":139015.90094757258},{"content":" struct BindingRec;\n\n\n\n enum Heights {\n\n kNormal_Height,\n\n kSelected_Height\n\n };\n\n SkListSource* fSource;\n\n SkScrollBarView* fScrollBar;\n\n SkAnimator* fAnims;\n\n BindingRec* fBindings;\n\n SkString fSkinName;\n\n SkScalar fHeights[2];\n\n int16_t fScrollIndex, fCurrIndex;\n\n uint16_t fVisibleRowCount, fBindingCount;\n\n SkBool8 fAnimContentDirty;\n\n SkBool8 fAnimFocusDirty;\n\n\n\n typedef SkWidgetView INHERITED;\n\n};\n\n\n","file_path":"skia/include/SkWidgetViews.h","rank":71,"score":139003.15932553128},{"content":"\n\nWebMouseEvent::WebMouseEvent(const GdkEventButton* event) {\n\n timestamp_sec = GdkEventTimeToWebEventTime(event->time);\n\n modifiers = GdkStateToWebEventModifiers(event->state);\n\n x = static_cast<int>(event->x);\n\n y = static_cast<int>(event->y);\n\n global_x = static_cast<int>(event->x_root);\n\n global_y = static_cast<int>(event->y_root);\n\n\n\n switch (event->type) {\n\n case GDK_BUTTON_PRESS:\n\n case GDK_2BUTTON_PRESS:\n\n case GDK_3BUTTON_PRESS:\n\n type = MOUSE_DOWN;\n\n break;\n\n case GDK_BUTTON_RELEASE:\n\n type = MOUSE_UP;\n\n break;\n\n\n\n default:\n","file_path":"webkit/glue/webinputevent_linux.cc","rank":73,"score":50.43103617750297},{"content":"\n\n// static\n\nconst char* MetricsLog::WindowEventTypeToString(WindowEventType type) {\n\n switch (type) {\n\n case WINDOW_CREATE:\n\n return \"create\";\n\n\n\n case WINDOW_OPEN:\n\n return \"open\";\n\n\n\n case WINDOW_CLOSE:\n\n return \"close\";\n\n\n\n case WINDOW_DESTROY:\n\n return \"destroy\";\n\n\n\n default:\n\n NOTREACHED();\n\n return \"unknown\";\n\n }\n","file_path":"chrome/browser/metrics_log.cc","rank":74,"score":46.930149693073844},{"content":"// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\n// Use of this source code is governed by a BSD-style license that can be\n\n// found in the LICENSE file.\n\n\n\n#include \"chrome/views/accelerator.h\"\n\n\n\n#include \"base/logging.h\"\n\n#include \"base/string_util.h\"\n\n#include \"chrome/common/l10n_util.h\"\n\n#include \"generated_resources.h\"\n\n\n\nnamespace views {\n\n\n\nstd::wstring Accelerator::GetShortcutText() const {\n\n int string_id = 0;\n\n switch(key_code_) {\n\n case VK_TAB:\n\n string_id = IDS_TAB_KEY;\n\n break;\n\n case VK_RETURN:\n","file_path":"chrome/views/accelerator.cc","rank":75,"score":45.92841153781899},{"content":"// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\n// Use of this source code is governed by a BSD-style license that can be\n\n// found in the LICENSE file.\n\n\n\n#include \"config.h\"\n\n\n\n#include \"webkit/glue/webinputevent.h\"\n\n\n\n#include \"webkit/glue/event_conversion.h\"\n\n\n\n#undef LOG\n\n#include \"base/logging.h\"\n\n\n\nstatic const unsigned long kDefaultScrollLinesPerWheelDelta = 3;\n\n\n\n// WebMouseEvent --------------------------------------------------------------\n\n\n\nstatic LPARAM GetRelativeCursorPos(HWND hwnd) {\n\n POINT pos = {-1, -1};\n\n GetCursorPos(&pos);\n","file_path":"webkit/glue/webinputevent_win.cc","rank":76,"score":45.59659036933811},{"content":" // server, ORed together into one value.\n\n int collectors() { return collectors_; }\n\n\n\n // Returns true if the given CollectorType is desired by the server.\n\n bool collector_active(CollectorType type) { return !!(collectors_ & type); }\n\n\n\n // Returns the maximum number of event that the server wants in each\n\n // metrics log sent. (If 0, no value was provided.)\n\n int events() { return events_; }\n\n\n\n // Returns the size of the time interval that the server wants us to include\n\n // in each log (in seconds). (If 0, no value was provided.)\n\n int interval() { return interval_; }\n\n\n\nprivate:\n\n bool valid_;\n\n int collectors_;\n\n int events_;\n\n int interval_;\n\n\n\n DISALLOW_EVIL_CONSTRUCTORS(MetricsResponse);\n\n};\n\n\n\n#endif // CHROME_BROWSER_METRICS_RESPONSE_H__\n\n\n","file_path":"chrome/browser/metrics_response.h","rank":77,"score":45.50250638750256},{"content":"// Copyright (c) 2008 The Chromium Authors. All rights reserved.\n\n// Use of this source code is governed by a BSD-style license that can be\n\n// found in the LICENSE file.\n\n\n\n#include \"base/system_monitor.h\"\n\n\n\nnamespace base {\n\n\n\nvoid SystemMonitor::ProcessWmPowerBroadcastMessage(int event_id) {\n\n PowerEvent power_event;\n\n switch (event_id) {\n\n case PBT_APMPOWERSTATUSCHANGE:\n\n power_event = PowerStateEvent;\n\n break;\n\n case PBT_APMRESUMEAUTOMATIC:\n\n power_event = ResumeEvent;\n\n break;\n\n case PBT_APMSUSPEND:\n\n power_event = SuspendEvent;\n\n break;\n","file_path":"base/system_monitor_win.cc","rank":78,"score":45.382325301466366},{"content":" }\n\n}\n\n\n\nbool WebWidgetImpl::HandleInputEvent(const WebInputEvent* input_event) {\n\n if (!widget_)\n\n return false;\n\n\n\n // TODO (jcampan): WebKit seems to always return false on mouse events\n\n // methods. For now we'll assume it has processed them (as we are only\n\n // interested in whether keyboard events are processed).\n\n switch (input_event->type) {\n\n case WebInputEvent::MOUSE_MOVE:\n\n MouseMove(*static_cast<const WebMouseEvent*>(input_event));\n\n return true;\n\n\n\n case WebInputEvent::MOUSE_LEAVE:\n\n MouseLeave(*static_cast<const WebMouseEvent*>(input_event));\n\n return true;\n\n\n\n case WebInputEvent::MOUSE_WHEEL:\n","file_path":"webkit/glue/webwidget_impl.cc","rank":79,"score":45.362609327732926},{"content":" timestamp_sec = GdkEventTimeToWebEventTime(event->time);\n\n modifiers = GdkStateToWebEventModifiers(event->state);\n\n x = static_cast<int>(event->x);\n\n y = static_cast<int>(event->y);\n\n global_x = static_cast<int>(event->x_root);\n\n global_y = static_cast<int>(event->y_root);\n\n\n\n type = MOUSE_WHEEL;\n\n\n\n // TODO(tc): Figure out what the right value for this is.\n\n static const int kWheelDelta = 1;\n\n\n\n delta_x = 0;\n\n delta_y = 0;\n\n\n\n switch (event->direction) {\n\n case GDK_SCROLL_UP:\n\n delta_y = kWheelDelta;\n\n break;\n\n case GDK_SCROLL_DOWN:\n","file_path":"webkit/glue/webinputevent_linux.cc","rank":80,"score":45.18544378200373},{"content":"\n\n // The type used for the bitfield.\n\n typedef int Type;\n\n\n\n static bool ValidType(int32 type) {\n\n int32 t = StripQualifier(static_cast<Type>(type));\n\n return (t >= 0 && t <= LAST_CORE &&\n\n (type & ~(QUALIFIER_MASK | CORE_MASK)) == 0);\n\n }\n\n\n\n static Type FromInt(int32 type) {\n\n if (!ValidType(type)) {\n\n NOTREACHED() << \"Invalid transition type \" << type;\n\n\n\n // Return a safe default so we don't have corrupt data in release mode.\n\n return LINK;\n\n }\n\n return static_cast<Type>(type);\n\n }\n\n\n","file_path":"chrome/common/page_transition_types.h","rank":81,"score":45.144195918272445},{"content":" switch (type_) {\n\n case views::Event::ET_MOUSE_PRESSED:\n\n view_->OnMousePressed(event);\n\n break;\n\n\n\n case views::Event::ET_MOUSE_DRAGGED:\n\n view_->OnMouseDragged(event);\n\n break;\n\n\n\n case views::Event::ET_MOUSE_RELEASED:\n\n view_->OnMouseReleased(event, false);\n\n break;\n\n\n\n default:\n\n NOTREACHED();\n\n }\n\n }\n\n\n\n private:\n\n views::View* view_;\n","file_path":"chrome/browser/automation/automation_provider.cc","rank":82,"score":45.02807749225797},{"content":" break;\n\n case AutocompleteMatch::SEARCH:\n\n str_type = L\"SEARCH\";\n\n break;\n\n case AutocompleteMatch::HISTORY_SEARCH:\n\n str_type = L\"HISTORY\";\n\n break;\n\n default:\n\n NOTREACHED();\n\n }\n\n }\n\n std::wstring contents;\n\n bool deletable;\n\n std::wstring description;\n\n std::wstring destination_url;\n\n std::wstring fill_into_edit;\n\n size_t inline_autocomplete_offset;\n\n bool is_history_what_you_typed_match;\n\n std::string provider_name;\n\n int relevance;\n\n bool starred;\n\n std::wstring str_type;\n\n};\n\ntypedef std::vector<AutocompleteMatchData> Matches;\n\n\n\nnamespace IPC {\n\n\n\ntemplate <>\n","file_path":"chrome/test/automation/autocomplete_edit_proxy.h","rank":83,"score":44.985094757139876},{"content":"#include \"V8SVGUnitTypes.h\"\n\n#include \"V8SVGURIReference.h\"\n\n#include \"V8SVGZoomEvent.h\"\n\n#endif\n\n\n\nnamespace WebCore {\n\n\n\nFunctionTemplateFactory V8ClassIndex::GetFactory(V8WrapperType type) {\n\n switch (type) {\n\n#define MAKE_CASE(type, name)\\\n\n case V8ClassIndex::type: return V8##name::GetTemplate;\n\n WRAPPER_TYPES(MAKE_CASE)\n\n#undef MAKE_CASE\n\n default: return NULL;\n\n }\n\n}\n\n\n\n\n\n#define MAKE_CACHE(type, name)\\\n\n static v8::Persistent<v8::FunctionTemplate> name##_cache_;\n","file_path":"webkit/port/bindings/v8/v8_index.cpp","rank":84,"score":44.72113098901854},{"content":"\n\nvoid NPVariantWrap::Copy(const NPVariant& v) {\n\n if (this == &v)\n\n return;\n\n Release();\n\n switch(v.type) {\n\n case NPVariantType_Void:\n\n break;\n\n case NPVariantType_Null:\n\n break;\n\n case NPVariantType_Bool:\n\n value.boolValue = v.value.boolValue;\n\n break;\n\n case NPVariantType_Int32:\n\n value.intValue = v.value.intValue;\n\n break;\n\n case NPVariantType_Double:\n\n value.doubleValue = v.value.doubleValue;\n\n break;\n\n case NPVariantType_String:\n","file_path":"webkit/activex_shim/npn_scripting.cc","rank":86,"score":43.48048745288154},{"content":" // coordinates.\n\n\n\n // NOTE: These may be called after we've been removed from the widget/\n\n // window hierarchy, for example because the EventHandler keeps a reference\n\n // around and tries to feed us MouseOut events. In this case, doing\n\n // something would be not only pointless but dangerous, as without a\n\n // parent() we will end up failing an ASSERT(). So bail early if we get to\n\n // any of these with no parent().\n\n virtual bool handleMouseMoveEvent(const PlatformMouseEvent&);\n\n virtual bool handleMouseOutEvent(const PlatformMouseEvent&);\n\n virtual bool handleMousePressEvent(const PlatformMouseEvent&);\n\n virtual bool handleMouseReleaseEvent(const PlatformMouseEvent&);\n\n\n\n virtual IntRect windowClipRect() const;\n\n\n\n static void themeChanged();\n\n static int horizontalScrollbarHeight(ScrollbarControlSize size = RegularScrollbar);\n\n static int verticalScrollbarWidth(ScrollbarControlSize size = RegularScrollbar);\n\n\n\n // Scrolls the page when auto-repeat scrolling.\n","file_path":"webkit/port/platform/chromium/PlatformScrollBar.h","rank":87,"score":43.2041336662783},{"content":" // Safari must perform a similar hack, ours is in our WebKit glue layer\n\n // theirs is in the application. This should go when WebCore can be fixed\n\n // to pass more event information to ChromeClient::show()\n\n g_current_input_event = input_event;\n\n\n\n bool handled = true;\n\n\n\n // TODO(jcampan): WebKit seems to always return false on mouse events\n\n // processing methods. For now we'll assume it has processed them (as we are\n\n // only interested in whether keyboard events are processed).\n\n switch (input_event->type) {\n\n case WebInputEvent::MOUSE_MOVE:\n\n MouseMove(*static_cast<const WebMouseEvent*>(input_event));\n\n break;\n\n\n\n case WebInputEvent::MOUSE_LEAVE:\n\n MouseLeave(*static_cast<const WebMouseEvent*>(input_event));\n\n break;\n\n\n\n case WebInputEvent::MOUSE_WHEEL:\n","file_path":"webkit/glue/webview_impl.cc","rank":88,"score":42.84501284398694},{"content":" MouseWheel(*static_cast<const WebMouseWheelEvent*>(input_event));\n\n break;\n\n\n\n case WebInputEvent::MOUSE_DOWN:\n\n case WebInputEvent::MOUSE_DOUBLE_CLICK:\n\n MouseDown(*static_cast<const WebMouseEvent*>(input_event));\n\n break;\n\n\n\n case WebInputEvent::MOUSE_UP:\n\n MouseUp(*static_cast<const WebMouseEvent*>(input_event));\n\n break;\n\n\n\n case WebInputEvent::KEY_DOWN:\n\n case WebInputEvent::KEY_UP:\n\n handled = KeyEvent(*static_cast<const WebKeyboardEvent*>(input_event));\n\n break;\n\n\n\n case WebInputEvent::CHAR:\n\n handled = CharEvent(*static_cast<const WebKeyboardEvent*>(input_event));\n\n break;\n","file_path":"webkit/glue/webview_impl.cc","rank":89,"score":42.70572604809186},{"content":"// Copyright (c) 2008 The Chromium Authors. All rights reserved.\n\n// Use of this source code is governed by a BSD-style license that can be\n\n// found in the LICENSE file.\n\n\n\n#include \"base/message_pump_libevent.h\"\n\n\n\n#include <fcntl.h>\n\n\n\n#include \"base/logging.h\"\n\n#include \"base/scoped_nsautorelease_pool.h\"\n\n#include \"base/time.h\"\n\n#include \"third_party/libevent/event.h\"\n\n\n\nnamespace base {\n\n\n\n// Return 0 on success\n\n// Too small a function to bother putting in a library?\n\nstatic int SetNonBlocking(int fd)\n\n{\n\n int flags = fcntl(fd, F_GETFL, 0);\n","file_path":"base/message_pump_libevent.cc","rank":90,"score":42.66530300772644},{"content":"void WebWidgetHost::MouseEvent(UINT message, WPARAM wparam, LPARAM lparam) {\n\n WebMouseEvent event(view_, message, wparam, lparam);\n\n switch (event.type) {\n\n case WebInputEvent::MOUSE_MOVE:\n\n TrackMouseLeave(true);\n\n break;\n\n case WebInputEvent::MOUSE_LEAVE:\n\n TrackMouseLeave(false);\n\n break;\n\n case WebInputEvent::MOUSE_DOWN:\n\n SetCapture(view_);\n\n break;\n\n case WebInputEvent::MOUSE_UP:\n\n if (GetCapture() == view_)\n\n ReleaseCapture();\n\n break;\n\n }\n\n webwidget_->HandleInputEvent(&event);\n\n}\n\n\n","file_path":"webkit/tools/test_shell/webwidget_host.cc","rank":92,"score":42.29184258976745},{"content":"// Windows callback for the playback mode.\n\nLRESULT EventRecorder::PlaybackWndProc(int nCode, WPARAM wParam,\n\n LPARAM lParam) {\n\n static bool playback_enabled = true;\n\n int delay = 0;\n\n\n\n switch(nCode) {\n\n // A system modal dialog box is being displayed. Stop playing back\n\n // messages.\n\n case HC_SYSMODALON:\n\n playback_enabled = false;\n\n break;\n\n\n\n // A system modal dialog box is destroyed. We can start playing back\n\n // messages again.\n\n case HC_SYSMODALOFF:\n\n playback_enabled = true;\n\n break;\n\n\n\n // Prepare to copy the next mouse or keyboard event to playback.\n","file_path":"base/event_recorder.cc","rank":93,"score":42.02522569292091},{"content":" if (!obj->eventLogging)\n\n return 0;\n\n \n\n#ifdef WIN32\n\n // Below is the event handling code. Per the NPAPI spec, the events don't\n\n // map directly between operating systems:\n\n // http://devedge-temp.mozilla.org/library/manuals/2002/plugin/1.0/structures5.html#1000000\n\n NPEvent* evt = static_cast<NPEvent*>(event);\n\n short x = static_cast<short>(evt->lParam & 0xffff);\n\n short y = static_cast<short>(evt->lParam >> 16);\n\n switch (evt->event) {\n\n case WM_PAINT:\n\n printf(\"PLUGIN: updateEvt\\n\");\n\n break;\n\n case WM_LBUTTONDOWN:\n\n case WM_MBUTTONDOWN:\n\n case WM_RBUTTONDOWN:\n\n printf(\"PLUGIN: mouseDown at (%d, %d)\\n\", x, y);\n\n break;\n\n case WM_LBUTTONUP:\n","file_path":"webkit/tools/npapi_layout_test_plugin/main.cpp","rank":94,"score":41.92162782752543},{"content":"#include \"FrameView.h\"\n\n#include \"GraphicsContext.h\"\n\n#include \"HTMLNames.h\"\n\n#include \"HTMLPlugInElement.h\"\n\n#include \"IntRect.h\"\n\n#include \"KURL.h\"\n\n#include \"KeyboardEvent.h\"\n\n#include \"MouseEvent.h\"\n\n#include \"Page.h\"\n\n#include \"PlatformContextSkia.h\"\n\n#include \"PlatformMouseEvent.h\"\n\n#include \"PlatformString.h\"\n\n#include \"ResourceHandle.h\"\n\n#include \"ResourceHandleClient.h\"\n\n#include \"ResourceResponse.h\"\n\n#include \"ScriptController.h\"\n\n#include \"ScrollView.h\"\n\n#include \"Widget.h\"\n\nMSVC_POP_WARNING();\n\n#undef LOG\n","file_path":"webkit/glue/webplugin_impl.cc","rank":95,"score":41.69659196478847},{"content":" return m_hWnd;\n\n}\n\n\n\nvoid RenderWidgetHostViewWin::ForwardMouseEventToRenderer(UINT message,\n\n WPARAM wparam,\n\n LPARAM lparam) {\n\n WebMouseEvent event(m_hWnd, message, wparam, lparam);\n\n switch (event.type) {\n\n case WebInputEvent::MOUSE_MOVE:\n\n TrackMouseLeave(true);\n\n break;\n\n case WebInputEvent::MOUSE_LEAVE:\n\n TrackMouseLeave(false);\n\n break;\n\n case WebInputEvent::MOUSE_DOWN:\n\n SetCapture();\n\n break;\n\n case WebInputEvent::MOUSE_UP:\n\n if (GetCapture() == m_hWnd)\n\n ReleaseCapture();\n","file_path":"chrome/browser/render_widget_host_view_win.cc","rank":96,"score":41.6357766139031},{"content":" virtual void OnMouseReleased(const MouseEvent& event, bool canceled);\n\n\n\n private:\n\n // Returns true if |x| is over the divider.\n\n bool IsPointInDivider(int x);\n\n\n\n // Used to track drag info.\n\n struct DragInfo {\n\n // The initial coordinate of the mouse when the user started the drag.\n\n int initial_mouse_x;\n\n // The initial position of the divider when the user started the drag.\n\n int initial_divider_x;\n\n };\n\n\n\n DragInfo drag_info_;\n\n\n\n // Position of the divider.\n\n int divider_x_;\n\n\n\n DISALLOW_COPY_AND_ASSIGN(SingleSplitView);\n\n};\n\n\n\n} // namespace views\n\n\n\n#endif // CHROME_VIEWS_SINGLE_SPLIT_VIEW_H_\n","file_path":"chrome/views/single_split_view.h","rank":97,"score":41.49019051063204},{"content":" break;\n\n\n\n case NOTIFY_PLUGIN_INSTANCE_CREATED:\n\n stats.instances++;\n\n break;\n\n\n\n case NOTIFY_PLUGIN_PROCESS_CRASHED:\n\n stats.process_crashes++;\n\n break;\n\n\n\n default:\n\n NOTREACHED() << \"Unexpected notification type \" << type;\n\n return;\n\n }\n\n}\n\n\n\n// Recursively counts the number of bookmarks and folders in node.\n\nstatic void CountBookmarks(BookmarkNode* node, int* bookmarks, int* folders) {\n\n if (node->GetType() == history::StarredEntry::URL)\n\n (*bookmarks)++;\n","file_path":"chrome/browser/metrics_service.cc","rank":98,"score":41.31496168846098},{"content":"#include \"chrome/common/os_exchange_data.h\"\n\n#include \"chrome/common/pref_names.h\"\n\n#include \"chrome/common/resource_bundle.h\"\n\n#include \"chrome/common/slide_animation.h\"\n\n#include \"chrome/common/stl_util-inl.h\"\n\n#include \"chrome/common/win_util.h\"\n\n#include \"chrome/views/image_view.h\"\n\n#include \"chrome/views/painter.h\"\n\n\n\n#include \"generated_resources.h\"\n\n\n\n#undef min\n\n#undef max\n\n\n\nusing views::DropTargetEvent;\n\n\n\nstatic const int kDefaultAnimationDurationMs = 100;\n\nstatic const int kResizeLayoutAnimationDurationMs = 166;\n\nstatic const int kReorderAnimationDurationMs = 166;\n\n\n","file_path":"chrome/browser/views/tabs/tab_strip.cc","rank":99,"score":41.306240120690724}],"string":"[\n {\n \"content\": \"class SkEvent;\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 0,\n \"score\": 202538.54512832483\n },\n {\n \"content\": \"class WebMouseEvent;\\n\",\n \"file_path\": \"chrome/browser/render_widget_host.h\",\n \"rank\": 1,\n \"score\": 191707.1018699238\n },\n {\n \"content\": \"class WebMouseWheelEvent;\\n\",\n \"file_path\": \"chrome/browser/render_widget_host.h\",\n \"rank\": 2,\n \"score\": 186523.81193697584\n },\n {\n \"content\": \"enum nsPluginEventType {\\n\\n#if defined(XP_MAC) || defined(XP_MACOSX)\\n\\n nsPluginEventType_GetFocusEvent = (osEvt + 16),\\n\\n nsPluginEventType_LoseFocusEvent,\\n\\n nsPluginEventType_AdjustCursorEvent,\\n\\n nsPluginEventType_MenuCommandEvent,\\n\\n nsPluginEventType_ClippingChangedEvent,\\n\\n nsPluginEventType_ScrollingBeginsEvent,\\n\\n nsPluginEventType_ScrollingEndsEvent,\\n\\n#endif /* XP_MAC || XP_MACOSX */\\n\\n nsPluginEventType_Idle = 0\\n\\n};\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\",\n \"file_path\": \"third_party/mozilla/include/nsplugindefs.h\",\n \"rank\": 3,\n \"score\": 186078.27485863943\n },\n {\n \"content\": \" friend bool operator>=(const Sk64& a, const Sk64& b) {\\n\",\n \"file_path\": \"skia/include/corecg/Sk64.h\",\n \"rank\": 4,\n \"score\": 185721.0476966447\n },\n {\n \"content\": \"struct Sk64 {\\n\\n int32_t fHi; //!< the high 32 bits of the number (including sign)\\n\\n uint32_t fLo; //!< the low 32 bits of the number\\n\\n\\n\\n /** Returns non-zero if the Sk64 can be represented as a signed 32 bit integer\\n\\n */\\n\\n SkBool is32() const { return fHi == ((int32_t)fLo >> 31); }\\n\\n\\n\\n /** Returns non-zero if the Sk64 cannot be represented as a signed 32 bit integer\\n\\n */\\n\",\n \"file_path\": \"skia/include/corecg/Sk64.h\",\n \"rank\": 5,\n \"score\": 185716.89055185643\n },\n {\n \"content\": \" class Widget;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"webkit/glue/event_conversion.h\",\n \"rank\": 6,\n \"score\": 185355.38280090346\n },\n {\n \"content\": \" u8 type; /* One of the SQLITE_COLL_... values below */\\n\",\n \"file_path\": \"third_party/sqlite/sqliteInt.h\",\n \"rank\": 7,\n \"score\": 182519.84629426096\n },\n {\n \"content\": \" u8 type; /* One of SQLITE_NULL, SQLITE_TEXT, SQLITE_INTEGER, etc */\\n\",\n \"file_path\": \"third_party/sqlite/vdbeInt.h\",\n \"rank\": 8,\n \"score\": 182519.84629426096\n },\n {\n \"content\": \" friend bool operator!=(const SkPoint& a, const SkPoint& b) {\\n\",\n \"file_path\": \"skia/include/corecg/SkPoint.h\",\n \"rank\": 9,\n \"score\": 182275.2633378561\n },\n {\n \"content\": \"struct SkIPoint {\\n\\n int32_t fX, fY;\\n\\n\\n\\n /** Set the x and y values of the point. */\\n\\n void set(int32_t x, int32_t y) { fX = x; fY = y; }\\n\\n\\n\\n /** Rotate the point clockwise, writing the new point into dst\\n\\n It is legal for dst == this\\n\\n */\\n\",\n \"file_path\": \"skia/include/corecg/SkPoint.h\",\n \"rank\": 10,\n \"score\": 182271.23326263446\n },\n {\n \"content\": \"struct SkRect {\\n\\n SkScalar fLeft, fTop, fRight, fBottom;\\n\\n\\n\\n /** Return true if the rectangle's width or height are <= 0\\n\\n */\\n\\n bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }\\n\",\n \"file_path\": \"skia/include/corecg/SkRect.h\",\n \"rank\": 11,\n \"score\": 182271.23326263446\n },\n {\n \"content\": \" const T& top() const { return (*this)[fCount - 1]; }\\n\",\n \"file_path\": \"skia/include/SkTDArray.h\",\n \"rank\": 12,\n \"score\": 182271.23326263446\n },\n {\n \"content\": \" friend int operator!=(const SkRect& a, const SkRect& b)\\n\",\n \"file_path\": \"skia/include/corecg/SkRect.h\",\n \"rank\": 13,\n \"score\": 182171.04427318225\n },\n {\n \"content\": \"class WebMouseEvent;\\n\",\n \"file_path\": \"chrome/browser/render_widget_host_view_win.h\",\n \"rank\": 14,\n \"score\": 181613.4301361413\n },\n {\n \"content\": \" def Type(self):\\n\",\n \"file_path\": \"third_party/libevent/event_rpcgen.py\",\n \"rank\": 15,\n \"score\": 179276.15155344678\n },\n {\n \"content\": \" unsigned int use;\\t\\t/* The buffer size used */\\n\",\n \"file_path\": \"third_party/libxml/include/libxml/tree.h\",\n \"rank\": 16,\n \"score\": 179007.80452410717\n },\n {\n \"content\": \" int type;\\n\",\n \"file_path\": \"third_party/libxml/include/libxml/tree.h\",\n \"rank\": 17,\n \"score\": 178948.07145318962\n },\n {\n \"content\": \" xmlElementType type; /* XML_ENTITY_DECL, must be second ! */\\n\",\n \"file_path\": \"third_party/libxml/include/libxml/entities.h\",\n \"rank\": 18,\n \"score\": 178933.2806086113\n },\n {\n \"content\": \" xmlXPathObjectType type;\\n\",\n \"file_path\": \"third_party/libxml/include/libxml/xpath.h\",\n \"rank\": 19,\n \"score\": 178933.2806086113\n },\n {\n \"content\": \"class SkStaticTextView : public SkView {\\n\\npublic:\\n\\n SkStaticTextView(uint32_t flags = 0);\\n\\n virtual ~SkStaticTextView();\\n\\n\\n\\n enum Mode {\\n\\n kFixedSize_Mode,\\n\\n kAutoWidth_Mode,\\n\\n kAutoHeight_Mode,\\n\\n\\n\\n kModeCount\\n\\n };\\n\\n Mode getMode() const { return (Mode)fMode; }\\n\\n void setMode(Mode);\\n\\n\\n\\n SkTextBox::SpacingAlign getSpacingAlign() const { return (SkTextBox::SpacingAlign)fSpacingAlign; }\\n\\n void setSpacingAlign(SkTextBox::SpacingAlign);\\n\\n\\n\\n void getMargin(SkPoint* margin) const;\\n\\n void setMargin(SkScalar dx, SkScalar dy);\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 20,\n \"score\": 176620.30676807562\n },\n {\n \"content\": \"class SkListSource : public SkEventSink {\\n\\npublic:\\n\\n virtual int countRows() = 0;\\n\\n virtual void getRow(int index, SkString* left, SkString* right) = 0;\\n\\n virtual SkEvent* getEvent(int index);\\n\\n\\n\\n static SkListSource* CreateFromDir(const char path[], const char suffix[],\\n\\n const char targetPrefix[]);\\n\\n static SkListSource* CreateFromDOM(const SkDOM& dom, const SkDOM::Node* node);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 21,\n \"score\": 176562.47558330497\n },\n {\n \"content\": \" xmlSchemaTypePtr type;/* the linked type */\\n\",\n \"file_path\": \"third_party/libxml/include/libxml/schemasInternals.h\",\n \"rank\": 22,\n \"score\": 175845.87841256196\n },\n {\n \"content\": \"class SkStaticTextView : public SkView {\\n\\npublic:\\n\\n SkStaticTextView();\\n\\n virtual ~SkStaticTextView();\\n\\n\\n\\n enum Mode {\\n\\n kFixedSize_Mode,\\n\\n kAutoWidth_Mode,\\n\\n kAutoHeight_Mode,\\n\\n\\n\\n kModeCount\\n\\n };\\n\\n Mode getMode() const { return (Mode)fMode; }\\n\\n void setMode(Mode);\\n\\n\\n\\n SkTextBox::SpacingAlign getSpacingAlign() const { return (SkTextBox::SpacingAlign)fSpacingAlign; }\\n\\n void setSpacingAlign(SkTextBox::SpacingAlign);\\n\\n\\n\\n void getMargin(SkPoint* margin) const;\\n\\n void setMargin(SkScalar dx, SkScalar dy);\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 23,\n \"score\": 172203.20923618547\n },\n {\n \"content\": \"class nsIEventHandler; // event handler interface\\n\",\n \"file_path\": \"third_party/mozilla/include/nsplugindefs.h\",\n \"rank\": 24,\n \"score\": 163693.41752403794\n },\n {\n \"content\": \"struct DefaultSingletonObjCTraits : public DefaultSingletonTraits<Type> {\\n\\n static Type* New() {\\n\\n return [[Type alloc] init];\\n\\n }\\n\\n\\n\\n static void Delete(Type* object) {\\n\\n [object release];\\n\\n }\\n\\n};\\n\\n\\n\\n// Exactly like Singleton, but without the DefaultSingletonObjCTraits as the\\n\\n// default trait class. This makes it straightforward for Objective-C++ code\\n\\n// to hold Objective-C objects as singletons.\\n\\ntemplate<typename Type,\\n\\n typename Traits = DefaultSingletonObjCTraits<Type>,\\n\\n typename DifferentiatingType = Type>\\n\",\n \"file_path\": \"base/singleton_objc.h\",\n \"rank\": 25,\n \"score\": 158684.92974225993\n },\n {\n \"content\": \"class MakePlatformMouseEvent : public WebCore::PlatformMouseEvent {\\n\\n public:\\n\\n MakePlatformMouseEvent(WebCore::Widget* widget, const WebMouseEvent& e);\\n\\n\\n\\n static void ResetLastClick() {\\n\\n last_click_time_ = last_click_count_ = 0;\\n\\n }\\n\\n\\n\\n private:\\n\\n static int last_click_count_;\\n\\n static uint32 last_click_time_;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"webkit/glue/event_conversion.h\",\n \"rank\": 26,\n \"score\": 155914.11477717437\n },\n {\n \"content\": \"class WebMouseWheelEvent : public WebMouseEvent {\\n\\n public:\\n\\n int delta_x;\\n\\n int delta_y;\\n\\n\\n\\n WebMouseWheelEvent() {}\\n\\n#if defined(OS_WIN)\\n\\n WebMouseWheelEvent(HWND hwnd, UINT message, WPARAM wparam, LPARAM lparam);\\n\\n#elif defined(OS_MACOSX)\\n\\n WebMouseWheelEvent(NSEvent *event, NSView* view);\\n\\n#elif defined(OS_LINUX)\\n\\n explicit WebMouseWheelEvent(const GdkEventScroll* event);\\n\\n#endif\\n\\n};\\n\\n\\n\\n// WebKeyboardEvent -----------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"webkit/glue/webinputevent.h\",\n \"rank\": 27,\n \"score\": 153963.16087182373\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// MouseEvent class\\n\\n//\\n\\n// A mouse event is used for any input event related to the mouse.\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nclass MouseEvent : public LocatedEvent {\\n\\n public:\\n\\n // Flags specific to mouse events\\n\\n enum MouseEventFlags { EF_IS_DOUBLE_CLICK = 1 << 16 };\\n\\n\\n\\n // Create a new mouse event\\n\\n MouseEvent(EventType type, int x, int y, int flags)\\n\\n : LocatedEvent(type, gfx::Point(x, y), flags) {\\n\\n }\\n\\n\\n\\n // Create a new mouse event from a type and a point. If from / to views\\n\\n // are provided, the point will be converted from 'from' coordinate system to\\n\\n // 'to' coordinate system.\\n\\n MouseEvent(EventType type,\\n\\n View* from,\\n\\n View* to,\\n\\n const gfx::Point &l,\\n\\n int flags);\\n\\n\\n\\n // Create a new MouseEvent which is identical to the provided model.\\n\",\n \"file_path\": \"chrome/views/event.h\",\n \"rank\": 28,\n \"score\": 152930.06817280495\n },\n {\n \"content\": \"class SkEvent {\\n\\npublic:\\n\\n /** Default construct, creating an empty event.\\n\\n */\\n\\n SkEvent();\\n\\n /** Construct a new event with the specified type.\\n\\n */\\n\\n explicit SkEvent(const SkString& type);\\n\\n /** Construct a new event with the specified type.\\n\\n */\\n\\n explicit SkEvent(const char type[]);\\n\\n /** Construct a new event by copying the fields from the src event.\\n\\n */\\n\\n SkEvent(const SkEvent& src);\\n\\n ~SkEvent();\\n\\n\\n\\n// /** Return the event's type (will never be null) */\\n\\n// const char* getType() const;\\n\\n /** Copy the event's type into the specified SkString parameter */\\n\\n void getType(SkString* str) const;\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 29,\n \"score\": 151217.83670894802\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// MouseWheelEvent class\\n\\n//\\n\\n// A MouseWheelEvent is used to propagate mouse wheel user events\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nclass MouseWheelEvent : public LocatedEvent {\\n\\n public:\\n\\n // Create a new key event\\n\\n MouseWheelEvent(int offset, int x, int y, int flags)\\n\\n : LocatedEvent(ET_MOUSEWHEEL, gfx::Point(x, y), flags),\\n\\n offset_(offset) {\\n\\n }\\n\\n\\n\\n int GetOffset() const {\\n\\n return offset_;\\n\\n }\\n\\n\\n\\n private:\\n\\n int offset_;\\n\\n\\n\\n DISALLOW_EVIL_CONSTRUCTORS(MouseWheelEvent);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"chrome/views/event.h\",\n \"rank\": 30,\n \"score\": 150067.56099565374\n },\n {\n \"content\": \"class WebMouseEvent;\\n\",\n \"file_path\": \"webkit/glue/event_conversion.h\",\n \"rank\": 31,\n \"score\": 148226.6872130068\n },\n {\n \"content\": \"class MouseEvent;\\n\\n}\\n\\n\\n\\nnamespace event_utils {\\n\\n\\n\\n// Translates event flags into what kind of disposition they represents.\\n\\n// For example, a middle click would mean to open a background tab.\\n\\n// event_flags are the flags as understood by views::MouseEvent.\\n\\nWindowOpenDisposition DispositionFromEventFlags(int event_flags);\\n\\n\\n\\n// Returns true if the specified mouse event may have a\\n\\n// WindowOptionDisposition.\\n\\nbool IsPossibleDispositionEvent(const views::MouseEvent& event);\\n\\n\\n\\n}\\n\\n\\n\\n#endif // CHROME_BROWSER_VIEWS_BOOKMARK_BAR_VIEW_H__\\n\\n\\n\",\n \"file_path\": \"chrome/browser/views/event_utils.h\",\n \"rank\": 32,\n \"score\": 148226.6872130068\n },\n {\n \"content\": \"class SkHasLabelWidget : public SkWidget {\\n\\npublic:\\n\\n SkHasLabelWidget(uint32_t flags = 0) : SkWidget(flags) {}\\n\\n\\n\\n size_t getLabel(SkString* label = NULL) const;\\n\\n size_t getLabel(char lable[] = NULL) const;\\n\\n void setLabel(const SkString&);\\n\\n void setLabel(const char label[]);\\n\\n void setLabel(const char label[], size_t len);\\n\\n\\n\\nprotected:\\n\\n // called when the label changes\\n\\n virtual void onLabelChange();\\n\\n\\n\\n // overrides\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\\n\\n\\n\\nprivate:\\n\\n SkString fLabel;\\n\\n typedef SkWidget INHERITED;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 33,\n \"score\": 146937.9764744974\n },\n {\n \"content\": \"struct LockTrait : public DefaultSingletonTraits<Type> {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"base/singleton_unittest.cc\",\n \"rank\": 34,\n \"score\": 146059.49856765842\n },\n {\n \"content\": \"struct Init5Trait : public DefaultSingletonTraits<int> {\\n\\n static int* New() {\\n\\n return new int(5);\\n\\n }\\n\\n};\\n\\n\\n\\ntypedef void (*CallbackFunc)();\\n\\n\\n\",\n \"file_path\": \"base/singleton_unittest.cc\",\n \"rank\": 35,\n \"score\": 146035.5467868311\n },\n {\n \"content\": \"class V8SVGStaticPODTypeWrapperWithPODTypeParent : public V8SVGStaticPODTypeWrapper<PODType> { \\n\\npublic: \\n\\n typedef V8SVGPODTypeWrapper<ParentTypeArg> ParentType; \\n\\n \\n\\n V8SVGStaticPODTypeWrapperWithPODTypeParent(PODType type, ParentType* parent) \\n\\n : V8SVGStaticPODTypeWrapper<PODType>(type) \\n\\n , m_parentType(parent) \\n\\n { \\n\\n } \\n\\n\\n\\n virtual void commitChange(PODType type, SVGElement* context) \\n\\n { \\n\\n V8SVGStaticPODTypeWrapper<PODType>::commitChange(type, context); \\n\\n m_parentType->commitChange(ParentTypeArg(type), context); \\n\\n } \\n\\n \\n\\nprivate: \\n\\n RefPtr<ParentType> m_parentType; \\n\\n}; \\n\\n \\n\\ntemplate<typename PODType, typename ParentType> \\n\",\n \"file_path\": \"webkit/port/bindings/v8/V8SVGPODTypeWrapper.h\",\n \"rank\": 36,\n \"score\": 145432.54897729194\n },\n {\n \"content\": \"class WebMouseWheelEvent;\\n\",\n \"file_path\": \"webkit/glue/event_conversion.h\",\n \"rank\": 37,\n \"score\": 144945.9521450423\n },\n {\n \"content\": \"enum SkWidgetEnum {\\n\\n kBorder_WidgetEnum, //!< <sk-border>\\n\\n kButton_WidgetEnum, //!< <sk-button>\\n\\n kImage_WidgetEnum, //!< <sk-image>\\n\\n kList_WidgetEnum, //!< <sk-list>\\n\\n kProgress_WidgetEnum, //!< <sk-progress>\\n\\n kScroll_WidgetEnum, //!< <sk-scroll>\\n\\n kText_WidgetEnum, //!< <sk-text>\\n\\n \\n\\n kWidgetEnumCount\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 38,\n \"score\": 144558.83996627058\n },\n {\n \"content\": \"class SkButtonWidget : public SkHasLabelWidget {\\n\\npublic:\\n\\n SkButtonWidget(uint32_t flags = 0) : SkHasLabelWidget(flags), fState(kOff_State) {}\\n\\n\\n\\n enum State {\\n\\n kOff_State, //!< XML: buttonState=\\\"off\\\"\\n\\n kOn_State, //!< XML: buttonState=\\\"on\\\"\\n\\n kUnknown_State //!< XML: buttonState=\\\"unknown\\\"\\n\\n };\\n\\n State getButtonState() const { return fState; }\\n\\n void setButtonState(State);\\n\\n\\n\\nprotected:\\n\\n /** called when the label changes. default behavior is to inval the widget */\\n\\n virtual void onButtonStateChange();\\n\\n\\n\\n // overrides\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\\n\\n\\n\\nprivate:\\n\\n State fState;\\n\\n typedef SkHasLabelWidget INHERITED;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 39,\n \"score\": 144316.80861774163\n },\n {\n \"content\": \" void ensureStrCache(int visibleCount);\\n\\n\\n\\n int logicalToVisualIndex(int index) const { return index - fScrollIndex; }\\n\\n void invalSelection();\\n\\n bool getRowRect(int index, SkRect*) const;\\n\\n void ensureSelectionIsVisible();\\n\\n\\n\\n typedef SkWidgetView INHERITED;\\n\\n};\\n\\n\\n\\n//////////////////////////////////////////////////////////\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 40,\n \"score\": 143363.6027154187\n },\n {\n \"content\": \" */\\n\\n void setActionEvent(Action, SkEvent* event);\\n\\n#endif\\n\\n\\n\\nprotected:\\n\\n virtual void onDraw(SkCanvas*);\\n\\n virtual void onSizeChange();\\n\\n virtual bool onEvent(const SkEvent&);\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\\n\\n\\n\\nprivate:\\n\\n SkPaint fPaint[kAttrCount];\\n\\n SkListSource* fSource;\\n\\n SkScalar fRowHeight;\\n\\n int fCurrIndex; // logical index\\n\\n int fScrollIndex; // logical index of top-most visible row\\n\\n int fVisibleRowCount;\\n\\n SkString* fStrCache;\\n\\n\\n\\n void dirtyStrCache();\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 41,\n \"score\": 143363.46163550302\n },\n {\n \"content\": \"/* include/graphics/SkWidget.h\\n\\n**\\n\\n** Copyright 2006, Google Inc.\\n\\n**\\n\\n** Licensed under the Apache License, Version 2.0 (the \\\"License\\\"); \\n\\n** you may not use this file except in compliance with the License. \\n\\n** You may obtain a copy of the License at \\n\\n**\\n\\n** http://www.apache.org/licenses/LICENSE-2.0 \\n\\n**\\n\\n** Unless required by applicable law or agreed to in writing, software \\n\\n** distributed under the License is distributed on an \\\"AS IS\\\" BASIS, \\n\\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \\n\\n** See the License for the specific language governing permissions and \\n\\n** limitations under the License.\\n\\n*/\\n\\n\\n\\n#ifndef SkWidget_DEFINED\\n\\n#define SkWidget_DEFINED\\n\\n\\n\\n#include \\\"SkView.h\\\"\\n\\n#include \\\"SkBitmap.h\\\"\\n\\n#include \\\"SkDOM.h\\\"\\n\\n#include \\\"SkPaint.h\\\"\\n\\n#include \\\"SkString.h\\\"\\n\\n#include \\\"SkTDArray.h\\\"\\n\\n\\n\\n//////////////////////////////////////////////////////////////////////////////\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 42,\n \"score\": 143363.315885711\n },\n {\n \"content\": \" SkPoint fCellSize;\\n\\n SkIPoint fVisibleCount;\\n\\n\\n\\n int logicalToVisualIndex(int index) const { return index; }\\n\\n void invalSelection();\\n\\n bool getCellRect(int index, SkRect*) const;\\n\\n void ensureSelectionIsVisible();\\n\\n\\n\\n typedef SkWidgetView INHERITED;\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 43,\n \"score\": 143363.2339731987\n },\n {\n \"content\": \" /** Returns true if the event's type matches exactly the specified type (case sensitive) */\\n\\n bool isType(const SkString& str) const;\\n\\n /** Returns true if the event's type matches exactly the specified type (case sensitive) */\\n\\n bool isType(const char type[], size_t len = 0) const;\\n\\n /** Set the event's type to the specified string.\\n\\n In XML, use the \\\"type\\\" attribute.\\n\\n */\\n\\n void setType(const SkString&);\\n\\n /** Set the event's type to the specified string.\\n\\n In XML, use the \\\"type\\\" attribute.\\n\\n */\\n\\n void setType(const char type[], size_t len = 0);\\n\\n\\n\\n /** Return the event's unnamed 32bit field. Default value is 0 */\\n\\n uint32_t getFast32() const { return f32; }\\n\\n /** Set the event's unnamed 32bit field. In XML, use\\n\\n the subelement <data fast32=... />\\n\\n */\\n\\n void setFast32(uint32_t x) { f32 = x; }\\n\\n\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 44,\n \"score\": 143361.30595656464\n },\n {\n \"content\": \" kHiliteCell_Attr,\\n\\n kAttrCount\\n\\n };\\n\\n SkPaint& paint(Attr);\\n\\n\\n\\n SkListSource* getListSource() const { return fSource; }\\n\\n SkListSource* setListSource(SkListSource*);\\n\\n\\n\\nprotected:\\n\\n virtual void onDraw(SkCanvas*);\\n\\n virtual void onSizeChange();\\n\\n virtual bool onEvent(const SkEvent&);\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\\n\\n\\n\\nprivate:\\n\\n SkView* fScrollBar;\\n\\n SkPaint fPaint[kAttrCount];\\n\\n SkListSource* fSource;\\n\\n int fCurrIndex; // logical index\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 45,\n \"score\": 143358.80508252245\n },\n {\n \"content\": \" kNormalText_Attr,\\n\\n kHiliteText_Attr,\\n\\n kHiliteCell_Attr,\\n\\n kAttrCount\\n\\n };\\n\\n SkPaint& paint(Attr);\\n\\n\\n\\n SkListSource* getListSource() const { return fSource; }\\n\\n SkListSource* setListSource(SkListSource*);\\n\\n\\n\\n#if 0\\n\\n enum Action {\\n\\n kSelectionChange_Action,\\n\\n kSelectionPicked_Action,\\n\\n kActionCount\\n\\n };\\n\\n /** If event is not null, it is retained by the view, and a copy\\n\\n of the event will be posted to its listeners when the specified\\n\\n action occurs. If event is null, then no event will be posted for\\n\\n the specified action.\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 46,\n \"score\": 143352.13978522262\n },\n {\n \"content\": \"\\n\\n ////////////////////////////////////////////////////\\n\\n /** Porting layer must implement these functions **/\\n\\n ////////////////////////////////////////////////////\\n\\n\\n\\n /** Called whenever an SkEvent is posted to an empty queue, so that the OS\\n\\n can be told to later call Dequeue().\\n\\n */\\n\\n static void SignalNonEmptyQueue();\\n\\n /** Called whenever the delay until the next delayed event changes. If zero is\\n\\n passed, then there are no more queued delay events.\\n\\n */\\n\\n static void SignalQueueTimer(SkMSec delay);\\n\\n\\n\\n#ifndef SK_USE_WXWIDGETS\\n\\n#ifdef SK_BUILD_FOR_WIN\\n\\n static bool WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam);\\n\\n#elif defined(SK_BUILD_FOR_UNIXx)\\n\\n static uint32_t HandleTimer(uint32_t, void*);\\n\\n static bool WndProc(Display*, Window, XEvent&);\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 47,\n \"score\": 143344.27097085555\n },\n {\n \"content\": \"\\n\\n size_t getText(SkString* text = NULL) const;\\n\\n size_t getText(char text[] = NULL) const;\\n\\n void setText(const SkString&);\\n\\n void setText(const char text[]);\\n\\n void setText(const char text[], size_t len);\\n\\n\\n\\n void getPaint(SkPaint*) const;\\n\\n void setPaint(const SkPaint&);\\n\\n\\n\\nprotected:\\n\\n // overrides\\n\\n virtual void onDraw(SkCanvas*);\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\\n\\n\\n\\nprivate:\\n\\n SkPoint fMargin;\\n\\n SkString fText;\\n\\n SkPaint fPaint;\\n\\n uint8_t fMode;\\n\\n uint8_t fSpacingAlign;\\n\\n\\n\\n void computeSize();\\n\\n\\n\\n typedef SkView INHERITED;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 48,\n \"score\": 143344.13356008072\n },\n {\n \"content\": \" SkPaint& paint() { return fPaint; }\\n\\n\\n\\nprotected:\\n\\n virtual void onDraw(SkCanvas*);\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\\n\\n\\n\\nprivate:\\n\\n SkString fText;\\n\\n SkPaint fPaint;\\n\\n SkPoint fMargin;\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 49,\n \"score\": 143344.13356008072\n },\n {\n \"content\": \"#endif\\n\\n#else\\n\\n // Don't know yet what this will be\\n\\n //static bool CustomEvent();\\n\\n#endif\\n\\n\\n\\nprivate:\\n\\n SkMetaData fMeta;\\n\\n mutable char* fType; // may be characters with low bit set to know that it is not a pointer\\n\\n uint32_t f32;\\n\\n SkDEBUGCODE(bool fDebugTrace;)\\n\\n\\n\\n // these are for our implementation of the event queue\\n\\n SkEventSinkID fTargetID;\\n\\n SkMSec fTime;\\n\\n SkEvent* fNextEvent; // either in the delay or normal event queue\\n\\n void initialize(const char* type, size_t typeLen);\\n\\n\\n\\n static bool Enqueue(SkEvent* evt);\\n\\n static SkMSec EnqueueTime(SkEvent* evt, SkMSec time);\\n\\n static SkEvent* Dequeue(SkEventSinkID* targetID);\\n\\n static bool QHasEvents();\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 50,\n \"score\": 143341.8130039583\n },\n {\n \"content\": \"#include \\\"SkDOM.h\\\"\\n\\n#include \\\"SkMetaData.h\\\"\\n\\n#include \\\"SkString.h\\\"\\n\\n\\n\\n//class SkOSWindow;\\n\\n\\n\\n/** Unique 32bit id used to identify an instance of SkEventSink. When events are\\n\\n posted, they are posted to a specific sinkID. When it is time to dispatch the\\n\\n event, the sinkID is used to find the specific SkEventSink object. If it is found,\\n\\n its doEvent() method is called with the event.\\n\\n*/\\n\\ntypedef uint32_t SkEventSinkID;\\n\\n\\n\\n/** \\\\class SkEvent\\n\\n\\n\\n SkEvents are used to communicate type-safe information to SkEventSinks.\\n\\n SkEventSinks (including SkViews) each have a unique ID, which is stored\\n\\n in an event. This ID is used to target the event once it has been \\\"posted\\\".\\n\\n*/\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 51,\n \"score\": 143338.89713279513\n },\n {\n \"content\": \" and ignore the value parameter.\\n\\n */\\n\\n bool findPtr(const char name[], void** value) const { return fMeta.findPtr(name, value); }\\n\\n bool findBool(const char name[], bool* value) const { return fMeta.findBool(name, value); }\\n\\n\\n\\n /** Returns true if ethe event contains the named 32bit field, and if it equals the specified value */\\n\\n bool hasS32(const char name[], int32_t value) const { return fMeta.hasS32(name, value); }\\n\\n /** Returns true if ethe event contains the named SkScalar field, and if it equals the specified value */\\n\\n bool hasScalar(const char name[], SkScalar value) const { return fMeta.hasScalar(name, value); }\\n\\n /** Returns true if ethe event contains the named string field, and if it equals (using strcmp) the specified value */\\n\\n bool hasString(const char name[], const char value[]) const { return fMeta.hasString(name, value); }\\n\\n /** Returns true if ethe event contains the named pointer field, and if it equals the specified value */\\n\\n bool hasPtr(const char name[], void* value) const { return fMeta.hasPtr(name, value); }\\n\\n bool hasBool(const char name[], bool value) const { return fMeta.hasBool(name, value); }\\n\\n\\n\\n /** Add/replace the named 32bit field to the event. In XML use the subelement <data name=... s32=... /> */\\n\\n void setS32(const char name[], int32_t value) { fMeta.setS32(name, value); }\\n\\n /** Add/replace the named SkScalar field to the event. In XML use the subelement <data name=... scalar=... /> */\\n\\n void setScalar(const char name[], SkScalar value) { fMeta.setScalar(name, value); }\\n\\n /** Add/replace the named SkScalar[] field to the event. */\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 52,\n \"score\": 143336.24266477034\n },\n {\n \"content\": \" SkScalar* setScalars(const char name[], int count, const SkScalar values[] = NULL) { return fMeta.setScalars(name, count, values); }\\n\\n /** Add/replace the named string field to the event. In XML use the subelement <data name=... string=... */\\n\\n void setString(const char name[], const SkString& value) { fMeta.setString(name, value.c_str()); }\\n\\n /** Add/replace the named string field to the event. In XML use the subelement <data name=... string=... */\\n\\n void setString(const char name[], const char value[]) { fMeta.setString(name, value); }\\n\\n /** Add/replace the named pointer field to the event. There is no XML equivalent for this call */\\n\\n void setPtr(const char name[], void* value) { fMeta.setPtr(name, value); }\\n\\n void setBool(const char name[], bool value) { fMeta.setBool(name, value); }\\n\\n\\n\\n /** Return the underlying metadata object */\\n\\n SkMetaData& getMetaData() { return fMeta; }\\n\\n /** Return the underlying metadata object */\\n\\n const SkMetaData& getMetaData() const { return fMeta; }\\n\\n\\n\\n void tron() { SkDEBUGCODE(fDebugTrace = true;) }\\n\\n void troff() { SkDEBUGCODE(fDebugTrace = false;) }\\n\\n bool isDebugTrace() const\\n\\n {\\n\\n#ifdef SK_DEBUG\\n\\n return fDebugTrace;\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 53,\n \"score\": 143333.49647983554\n },\n {\n \"content\": \"#else\\n\\n return false;\\n\\n#endif\\n\\n }\\n\\n\\n\\n /** Call this to initialize the event from the specified XML node */\\n\\n void inflate(const SkDOM&, const SkDOM::Node*);\\n\\n\\n\\n SkDEBUGCODE(void dump(const char title[] = NULL);)\\n\\n\\n\\n /** Post the specified event to the event queue, targeting the specified eventsink, with an optional\\n\\n delay. The event must be dynamically allocated for this. It cannot be a global or on the stack.\\n\\n After this call, ownership is transfered to the system, so the caller must not retain\\n\\n the event's ptr. Returns false if the event could not be posted (which means it will have been deleted).\\n\\n */\\n\\n static bool Post(SkEvent* evt, SkEventSinkID targetID, SkMSec delay = 0);\\n\\n /** Post the specified event to the event queue, targeting the specified eventsink, to be delivered on/after the\\n\\n specified millisecond time. The event must be dynamically allocated for this. It cannot be a global or on the stack.\\n\\n After this call, ownership is transfered to the system, so the caller must not retain\\n\\n the event's ptr. Returns false if the event could not be posted (which means it will have been deleted).\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 54,\n \"score\": 143331.47257250478\n },\n {\n \"content\": \"\\n\\n /** Global initialization function for the SkEvent system. Should be called exactly\\n\\n once before any other event method is called, and should be called after the\\n\\n call to SkGraphics::Init().\\n\\n */\\n\\n static void Init();\\n\\n /** Global cleanup function for the SkEvent system. Should be called exactly once after\\n\\n all event methods have been called, and should be called before calling SkGraphics::Term().\\n\\n */\\n\\n static void Term();\\n\\n\\n\\n /** Call this to process one event from the queue. If it returns true, there are more events\\n\\n to process.\\n\\n */\\n\\n static bool ProcessEvent();\\n\\n /** Call this whenever the requested timer has expired (requested by a call to SetQueueTimer).\\n\\n It will post any delayed events whose time as \\\"expired\\\" onto the event queue.\\n\\n It may also call SignalQueueTimer() and SignalNonEmptyQueue().\\n\\n */\\n\\n static void ServiceQueueTimer();\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 55,\n \"score\": 143330.33260070928\n },\n {\n \"content\": \" /** Return true if the event contains the named 32bit field, and return the field\\n\\n in value (if value is non-null). If there is no matching named field, return false\\n\\n and ignore the value parameter.\\n\\n */\\n\\n bool findS32(const char name[], int32_t* value = NULL) const { return fMeta.findS32(name, value); }\\n\\n /** Return true if the event contains the named SkScalar field, and return the field\\n\\n in value (if value is non-null). If there is no matching named field, return false\\n\\n and ignore the value parameter.\\n\\n */\\n\\n bool findScalar(const char name[], SkScalar* value = NULL) const { return fMeta.findScalar(name, value); }\\n\\n /** Return true if the event contains the named SkScalar field, and return the fields\\n\\n in value[] (if value is non-null), and return the number of SkScalars in count (if count is non-null).\\n\\n If there is no matching named field, return false and ignore the value and count parameters.\\n\\n */\\n\\n const SkScalar* findScalars(const char name[], int* count, SkScalar values[] = NULL) const { return fMeta.findScalars(name, count, values); }\\n\\n /** Return the value of the named string field, or if no matching named field exists, return null.\\n\\n */\\n\\n const char* findString(const char name[]) const { return fMeta.findString(name); }\\n\\n /** Return true if the event contains the named pointer field, and return the field\\n\\n in value (if value is non-null). If there is no matching named field, return false\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 56,\n \"score\": 143330.2531670084\n },\n {\n \"content\": \" */\\n\\n static bool PostTime(SkEvent* evt, SkEventSinkID targetID, SkMSec time);\\n\\n\\n\\n /** Helper method for calling SkEvent::PostTime(this, ...), where the caller specifies a delay.\\n\\n The real \\\"time\\\" will be computed automatically by sampling the clock and adding its value\\n\\n to delay.\\n\\n */\\n\\n bool post(SkEventSinkID sinkID, SkMSec delay = 0)\\n\\n {\\n\\n return SkEvent::Post(this, sinkID, delay);\\n\\n }\\n\\n\\n\\n void postTime(SkEventSinkID sinkID, SkMSec time)\\n\\n {\\n\\n SkEvent::PostTime(this, sinkID, time);\\n\\n }\\n\\n\\n\\n ///////////////////////////////////////////////\\n\\n /** Porting layer must call these functions **/\\n\\n ///////////////////////////////////////////////\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 57,\n \"score\": 143328.5134040907\n },\n {\n \"content\": \"/* include/graphics/SkEvent.h\\n\\n**\\n\\n** Copyright 2006, Google Inc.\\n\\n**\\n\\n** Licensed under the Apache License, Version 2.0 (the \\\"License\\\"); \\n\\n** you may not use this file except in compliance with the License. \\n\\n** You may obtain a copy of the License at \\n\\n**\\n\\n** http://www.apache.org/licenses/LICENSE-2.0 \\n\\n**\\n\\n** Unless required by applicable law or agreed to in writing, software \\n\\n** distributed under the License is distributed on an \\\"AS IS\\\" BASIS, \\n\\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \\n\\n** See the License for the specific language governing permissions and \\n\\n** limitations under the License.\\n\\n*/\\n\\n\\n\\n#ifndef SkEvent_DEFINED\\n\\n#define SkEvent_DEFINED\\n\\n\\n\",\n \"file_path\": \"skia/include/SkEvent.h\",\n \"rank\": 58,\n \"score\": 143326.4670670559\n },\n {\n \"content\": \"static void event_log(int severity, const char *msg);\\n\",\n \"file_path\": \"third_party/libevent/log.c\",\n \"rank\": 59,\n \"score\": 141809.9876749245\n },\n {\n \"content\": \"class SkCheckBoxWidget : public SkButtonWidget {\\n\\npublic:\\n\\n SkCheckBoxWidget(uint32_t flags = 0);\\n\\n\\n\\nprotected:\\n\\n virtual bool onEvent(const SkEvent&);\\n\\n virtual void onDraw(SkCanvas*);\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\\n\\n\\n\\nprivate:\\n\\n typedef SkButtonWidget INHERITED;\\n\\n};\\n\\n\\n\\n#include \\\"SkTextBox.h\\\"\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 60,\n \"score\": 141799.2830122883\n },\n {\n \"content\": \"class SkPushButtonWidget : public SkButtonWidget {\\n\\npublic:\\n\\n SkPushButtonWidget(uint32_t flags = 0) : SkButtonWidget(flags) {}\\n\\n\\n\\nprotected:\\n\\n virtual bool onEvent(const SkEvent&);\\n\\n virtual void onDraw(SkCanvas*);\\n\\n virtual Click* onFindClickHandler(SkScalar x, SkScalar y);\\n\\n virtual bool onClick(Click* click);\\n\\n\\n\\nprivate:\\n\\n typedef SkButtonWidget INHERITED;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 61,\n \"score\": 141799.2830122883\n },\n {\n \"content\": \"class SkWidget : public SkView {\\n\\npublic:\\n\\n SkWidget(uint32_t flags = 0) : SkView(flags | kFocusable_Mask | kEnabled_Mask) {}\\n\\n\\n\\n /** Call this to post the widget's event to its listeners */\\n\\n void postWidgetEvent();\\n\\n\\n\\n static void Init();\\n\\n static void Term();\\n\\nprotected:\\n\\n // override to add slots to an event before posting\\n\\n virtual void prepareWidgetEvent(SkEvent*);\\n\\n virtual void onEnabledChange();\\n\\n\\n\\n // <event ...> to initialize the event from XML\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\\n\\n\\n\\nprivate:\\n\\n SkEvent fEvent;\\n\\n typedef SkView INHERITED;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidget.h\",\n \"rank\": 62,\n \"score\": 141438.0969106585\n },\n {\n \"content\": \"class MouseEvent;\\n\\n\\n\",\n \"file_path\": \"chrome/views/button.h\",\n \"rank\": 63,\n \"score\": 139429.58696200512\n },\n {\n \"content\": \"// Copyright (c) 2008 The Chromium Authors. All rights reserved.\\n\\n// Use of this source code is governed by a BSD-style license that can be\\n\\n// found in the LICENSE file.\\n\\n\\n\\n#ifndef BASE_GFX_NATIVE_WIDGET_TYPES_H_\\n\\n#define BASE_GFX_NATIVE_WIDGET_TYPES_H_\\n\\n\\n\\n#include \\\"build/build_config.h\\\"\\n\\n\\n\\n#if defined(OS_WIN)\\n\\n#include <windows.h>\\n\\n#elif defined(OS_MACOSX)\\n\\n#ifdef __OBJC__\\n\\n@class NSView;\\n\\n@class NSWindow;\\n\\n@class NSTextField;\\n\\n#else\\n\",\n \"file_path\": \"base/gfx/native_widget_types.h\",\n \"rank\": 64,\n \"score\": 139419.84772068344\n },\n {\n \"content\": \"class TraceLog {\\n\\n public:\\n\\n enum EventType {\\n\\n EVENT_BEGIN,\\n\\n EVENT_END,\\n\\n EVENT_INSTANT\\n\\n };\\n\\n\\n\\n // Is tracing currently enabled.\\n\\n static bool IsTracing();\\n\\n // Start logging trace events.\\n\\n static bool StartTracing();\\n\\n // Stop logging trace events.\\n\\n static void StopTracing();\\n\\n\\n\\n // Log a trace event of (name, type, id) with the optional extra string.\\n\\n void Trace(const std::string& name, \\n\\n EventType type,\\n\\n const void* id,\\n\\n const std::wstring& extra,\\n\",\n \"file_path\": \"base/trace_event.h\",\n \"rank\": 65,\n \"score\": 139410.60618695582\n },\n {\n \"content\": \" */\\n\\n bool moveSelectionUp();\\n\\n /** If possible, move the selection down and return true,\\n\\n else do nothing and return false.\\n\\n If nothing is selected, select the first item (unless there are no items).\\n\\n */\\n\\n bool moveSelectionDown();\\n\\n\\n\\n SkListSource* getListSource() const { return fSource; }\\n\\n SkListSource* setListSource(SkListSource*);\\n\\n\\n\\n /** Call this in your event handler. If the specified event is from a SkListView,\\n\\n then it returns the index of the selected item in this list, otherwise it\\n\\n returns -1\\n\\n */\\n\\n static int GetWidgetEventListIndex(const SkEvent&);\\n\\n\\n\\nprotected:\\n\\n // overrides\\n\\n virtual void onDraw(SkCanvas*);\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 66,\n \"score\": 139025.56319613222\n },\n {\n \"content\": \" virtual void onSizeChange();\\n\\n virtual bool onEvent(const SkEvent&);\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node* node);\\n\\n virtual bool onPrepareWidgetEvent(SkEvent*);\\n\\n\\n\\nprivate:\\n\\n enum DirtyFlags {\\n\\n kAnimCount_DirtyFlag = 0x01,\\n\\n kAnimContent_DirtyFlag = 0x02\\n\\n };\\n\\n void dirtyCache(unsigned dirtyFlags);\\n\\n bool ensureCache();\\n\\n\\n\\n int logicalToVisualIndex(int index) const { return index - fScrollIndex; }\\n\\n void invalSelection();\\n\\n SkScalar getContentWidth() const;\\n\\n bool getRowRect(int index, SkRect*) const;\\n\\n void ensureSelectionIsVisible();\\n\\n void ensureVisibleRowCount();\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 67,\n \"score\": 139023.94407867506\n },\n {\n \"content\": \" static SkEventSinkID GetWidgetEventSinkID(const SkEvent&);\\n\\n\\n\\nprotected:\\n\\n /** called when the label changes. override in subclasses. default action invals the view's bounds.\\n\\n called with the old and new labels, before the label has actually changed.\\n\\n */\\n\\n virtual void onLabelChange(const char oldLabel[], const char newLabel[]);\\n\\n /** called before posting the event to our listeners. Override to add slots to the event\\n\\n before posting. Return true to proceed with posting, or false to not post the event to any\\n\\n listener. Note: the event passed in may not be the same as calling this->event().\\n\\n Be sure to call your INHERITED method as well, so that all classes in the hierarchy get a shot\\n\\n at modifying the event (and possibly returning false to abort).\\n\\n */\\n\\n virtual bool onPrepareWidgetEvent(SkEvent* evt);\\n\\n\\n\\n // overrides\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\\n\\n \\n\\nprivate:\\n\\n SkString fLabel;\\n\\n SkEvent fEvent;\\n\\n \\n\\n typedef SkView INHERITED;\\n\\n};\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 68,\n \"score\": 139022.95838303943\n },\n {\n \"content\": \"\\n\\nprotected:\\n\\n // called when the check-state is about to change, but before it actually has\\n\\n virtual void onCheckStateChange(CheckState oldState, CheckState newState);\\n\\n\\n\\n // overrides\\n\\n virtual void onInflate(const SkDOM& dom, const SkDOM::Node*);\\n\\n virtual bool onPrepareWidgetEvent(SkEvent* evt);\\n\\n \\n\\nprivate:\\n\\n uint8_t fCheckState;\\n\\n \\n\\n typedef SkWidgetView INHERITED;\\n\\n};\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n#include \\\"SkTextBox.h\\\"\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 69,\n \"score\": 139022.08940994955\n },\n {\n \"content\": \"/* include/graphics/SkWidgetViews.h\\n\\n**\\n\\n** Copyright 2006, Google Inc.\\n\\n**\\n\\n** Licensed under the Apache License, Version 2.0 (the \\\"License\\\"); \\n\\n** you may not use this file except in compliance with the License. \\n\\n** You may obtain a copy of the License at \\n\\n**\\n\\n** http://www.apache.org/licenses/LICENSE-2.0 \\n\\n**\\n\\n** Unless required by applicable law or agreed to in writing, software \\n\\n** distributed under the License is distributed on an \\\"AS IS\\\" BASIS, \\n\\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \\n\\n** See the License for the specific language governing permissions and \\n\\n** limitations under the License.\\n\\n*/\\n\\n\\n\\n#ifndef SkWidgetViews_DEFINED\\n\\n#define SkWidgetViews_DEFINED\\n\\n\\n\\n#include \\\"SkView.h\\\"\\n\\n\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 70,\n \"score\": 139015.90094757258\n },\n {\n \"content\": \" struct BindingRec;\\n\\n\\n\\n enum Heights {\\n\\n kNormal_Height,\\n\\n kSelected_Height\\n\\n };\\n\\n SkListSource* fSource;\\n\\n SkScrollBarView* fScrollBar;\\n\\n SkAnimator* fAnims;\\n\\n BindingRec* fBindings;\\n\\n SkString fSkinName;\\n\\n SkScalar fHeights[2];\\n\\n int16_t fScrollIndex, fCurrIndex;\\n\\n uint16_t fVisibleRowCount, fBindingCount;\\n\\n SkBool8 fAnimContentDirty;\\n\\n SkBool8 fAnimFocusDirty;\\n\\n\\n\\n typedef SkWidgetView INHERITED;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"skia/include/SkWidgetViews.h\",\n \"rank\": 71,\n \"score\": 139003.15932553128\n },\n {\n \"content\": \"\\n\\nWebMouseEvent::WebMouseEvent(const GdkEventButton* event) {\\n\\n timestamp_sec = GdkEventTimeToWebEventTime(event->time);\\n\\n modifiers = GdkStateToWebEventModifiers(event->state);\\n\\n x = static_cast<int>(event->x);\\n\\n y = static_cast<int>(event->y);\\n\\n global_x = static_cast<int>(event->x_root);\\n\\n global_y = static_cast<int>(event->y_root);\\n\\n\\n\\n switch (event->type) {\\n\\n case GDK_BUTTON_PRESS:\\n\\n case GDK_2BUTTON_PRESS:\\n\\n case GDK_3BUTTON_PRESS:\\n\\n type = MOUSE_DOWN;\\n\\n break;\\n\\n case GDK_BUTTON_RELEASE:\\n\\n type = MOUSE_UP;\\n\\n break;\\n\\n\\n\\n default:\\n\",\n \"file_path\": \"webkit/glue/webinputevent_linux.cc\",\n \"rank\": 73,\n \"score\": 50.43103617750297\n },\n {\n \"content\": \"\\n\\n// static\\n\\nconst char* MetricsLog::WindowEventTypeToString(WindowEventType type) {\\n\\n switch (type) {\\n\\n case WINDOW_CREATE:\\n\\n return \\\"create\\\";\\n\\n\\n\\n case WINDOW_OPEN:\\n\\n return \\\"open\\\";\\n\\n\\n\\n case WINDOW_CLOSE:\\n\\n return \\\"close\\\";\\n\\n\\n\\n case WINDOW_DESTROY:\\n\\n return \\\"destroy\\\";\\n\\n\\n\\n default:\\n\\n NOTREACHED();\\n\\n return \\\"unknown\\\";\\n\\n }\\n\",\n \"file_path\": \"chrome/browser/metrics_log.cc\",\n \"rank\": 74,\n \"score\": 46.930149693073844\n },\n {\n \"content\": \"// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\\n\\n// Use of this source code is governed by a BSD-style license that can be\\n\\n// found in the LICENSE file.\\n\\n\\n\\n#include \\\"chrome/views/accelerator.h\\\"\\n\\n\\n\\n#include \\\"base/logging.h\\\"\\n\\n#include \\\"base/string_util.h\\\"\\n\\n#include \\\"chrome/common/l10n_util.h\\\"\\n\\n#include \\\"generated_resources.h\\\"\\n\\n\\n\\nnamespace views {\\n\\n\\n\\nstd::wstring Accelerator::GetShortcutText() const {\\n\\n int string_id = 0;\\n\\n switch(key_code_) {\\n\\n case VK_TAB:\\n\\n string_id = IDS_TAB_KEY;\\n\\n break;\\n\\n case VK_RETURN:\\n\",\n \"file_path\": \"chrome/views/accelerator.cc\",\n \"rank\": 75,\n \"score\": 45.92841153781899\n },\n {\n \"content\": \"// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\\n\\n// Use of this source code is governed by a BSD-style license that can be\\n\\n// found in the LICENSE file.\\n\\n\\n\\n#include \\\"config.h\\\"\\n\\n\\n\\n#include \\\"webkit/glue/webinputevent.h\\\"\\n\\n\\n\\n#include \\\"webkit/glue/event_conversion.h\\\"\\n\\n\\n\\n#undef LOG\\n\\n#include \\\"base/logging.h\\\"\\n\\n\\n\\nstatic const unsigned long kDefaultScrollLinesPerWheelDelta = 3;\\n\\n\\n\\n// WebMouseEvent --------------------------------------------------------------\\n\\n\\n\\nstatic LPARAM GetRelativeCursorPos(HWND hwnd) {\\n\\n POINT pos = {-1, -1};\\n\\n GetCursorPos(&pos);\\n\",\n \"file_path\": \"webkit/glue/webinputevent_win.cc\",\n \"rank\": 76,\n \"score\": 45.59659036933811\n },\n {\n \"content\": \" // server, ORed together into one value.\\n\\n int collectors() { return collectors_; }\\n\\n\\n\\n // Returns true if the given CollectorType is desired by the server.\\n\\n bool collector_active(CollectorType type) { return !!(collectors_ & type); }\\n\\n\\n\\n // Returns the maximum number of event that the server wants in each\\n\\n // metrics log sent. (If 0, no value was provided.)\\n\\n int events() { return events_; }\\n\\n\\n\\n // Returns the size of the time interval that the server wants us to include\\n\\n // in each log (in seconds). (If 0, no value was provided.)\\n\\n int interval() { return interval_; }\\n\\n\\n\\nprivate:\\n\\n bool valid_;\\n\\n int collectors_;\\n\\n int events_;\\n\\n int interval_;\\n\\n\\n\\n DISALLOW_EVIL_CONSTRUCTORS(MetricsResponse);\\n\\n};\\n\\n\\n\\n#endif // CHROME_BROWSER_METRICS_RESPONSE_H__\\n\\n\\n\",\n \"file_path\": \"chrome/browser/metrics_response.h\",\n \"rank\": 77,\n \"score\": 45.50250638750256\n },\n {\n \"content\": \"// Copyright (c) 2008 The Chromium Authors. All rights reserved.\\n\\n// Use of this source code is governed by a BSD-style license that can be\\n\\n// found in the LICENSE file.\\n\\n\\n\\n#include \\\"base/system_monitor.h\\\"\\n\\n\\n\\nnamespace base {\\n\\n\\n\\nvoid SystemMonitor::ProcessWmPowerBroadcastMessage(int event_id) {\\n\\n PowerEvent power_event;\\n\\n switch (event_id) {\\n\\n case PBT_APMPOWERSTATUSCHANGE:\\n\\n power_event = PowerStateEvent;\\n\\n break;\\n\\n case PBT_APMRESUMEAUTOMATIC:\\n\\n power_event = ResumeEvent;\\n\\n break;\\n\\n case PBT_APMSUSPEND:\\n\\n power_event = SuspendEvent;\\n\\n break;\\n\",\n \"file_path\": \"base/system_monitor_win.cc\",\n \"rank\": 78,\n \"score\": 45.382325301466366\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nbool WebWidgetImpl::HandleInputEvent(const WebInputEvent* input_event) {\\n\\n if (!widget_)\\n\\n return false;\\n\\n\\n\\n // TODO (jcampan): WebKit seems to always return false on mouse events\\n\\n // methods. For now we'll assume it has processed them (as we are only\\n\\n // interested in whether keyboard events are processed).\\n\\n switch (input_event->type) {\\n\\n case WebInputEvent::MOUSE_MOVE:\\n\\n MouseMove(*static_cast<const WebMouseEvent*>(input_event));\\n\\n return true;\\n\\n\\n\\n case WebInputEvent::MOUSE_LEAVE:\\n\\n MouseLeave(*static_cast<const WebMouseEvent*>(input_event));\\n\\n return true;\\n\\n\\n\\n case WebInputEvent::MOUSE_WHEEL:\\n\",\n \"file_path\": \"webkit/glue/webwidget_impl.cc\",\n \"rank\": 79,\n \"score\": 45.362609327732926\n },\n {\n \"content\": \" timestamp_sec = GdkEventTimeToWebEventTime(event->time);\\n\\n modifiers = GdkStateToWebEventModifiers(event->state);\\n\\n x = static_cast<int>(event->x);\\n\\n y = static_cast<int>(event->y);\\n\\n global_x = static_cast<int>(event->x_root);\\n\\n global_y = static_cast<int>(event->y_root);\\n\\n\\n\\n type = MOUSE_WHEEL;\\n\\n\\n\\n // TODO(tc): Figure out what the right value for this is.\\n\\n static const int kWheelDelta = 1;\\n\\n\\n\\n delta_x = 0;\\n\\n delta_y = 0;\\n\\n\\n\\n switch (event->direction) {\\n\\n case GDK_SCROLL_UP:\\n\\n delta_y = kWheelDelta;\\n\\n break;\\n\\n case GDK_SCROLL_DOWN:\\n\",\n \"file_path\": \"webkit/glue/webinputevent_linux.cc\",\n \"rank\": 80,\n \"score\": 45.18544378200373\n },\n {\n \"content\": \"\\n\\n // The type used for the bitfield.\\n\\n typedef int Type;\\n\\n\\n\\n static bool ValidType(int32 type) {\\n\\n int32 t = StripQualifier(static_cast<Type>(type));\\n\\n return (t >= 0 && t <= LAST_CORE &&\\n\\n (type & ~(QUALIFIER_MASK | CORE_MASK)) == 0);\\n\\n }\\n\\n\\n\\n static Type FromInt(int32 type) {\\n\\n if (!ValidType(type)) {\\n\\n NOTREACHED() << \\\"Invalid transition type \\\" << type;\\n\\n\\n\\n // Return a safe default so we don't have corrupt data in release mode.\\n\\n return LINK;\\n\\n }\\n\\n return static_cast<Type>(type);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"chrome/common/page_transition_types.h\",\n \"rank\": 81,\n \"score\": 45.144195918272445\n },\n {\n \"content\": \" switch (type_) {\\n\\n case views::Event::ET_MOUSE_PRESSED:\\n\\n view_->OnMousePressed(event);\\n\\n break;\\n\\n\\n\\n case views::Event::ET_MOUSE_DRAGGED:\\n\\n view_->OnMouseDragged(event);\\n\\n break;\\n\\n\\n\\n case views::Event::ET_MOUSE_RELEASED:\\n\\n view_->OnMouseReleased(event, false);\\n\\n break;\\n\\n\\n\\n default:\\n\\n NOTREACHED();\\n\\n }\\n\\n }\\n\\n\\n\\n private:\\n\\n views::View* view_;\\n\",\n \"file_path\": \"chrome/browser/automation/automation_provider.cc\",\n \"rank\": 82,\n \"score\": 45.02807749225797\n },\n {\n \"content\": \" break;\\n\\n case AutocompleteMatch::SEARCH:\\n\\n str_type = L\\\"SEARCH\\\";\\n\\n break;\\n\\n case AutocompleteMatch::HISTORY_SEARCH:\\n\\n str_type = L\\\"HISTORY\\\";\\n\\n break;\\n\\n default:\\n\\n NOTREACHED();\\n\\n }\\n\\n }\\n\\n std::wstring contents;\\n\\n bool deletable;\\n\\n std::wstring description;\\n\\n std::wstring destination_url;\\n\\n std::wstring fill_into_edit;\\n\\n size_t inline_autocomplete_offset;\\n\\n bool is_history_what_you_typed_match;\\n\\n std::string provider_name;\\n\\n int relevance;\\n\\n bool starred;\\n\\n std::wstring str_type;\\n\\n};\\n\\ntypedef std::vector<AutocompleteMatchData> Matches;\\n\\n\\n\\nnamespace IPC {\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"chrome/test/automation/autocomplete_edit_proxy.h\",\n \"rank\": 83,\n \"score\": 44.985094757139876\n },\n {\n \"content\": \"#include \\\"V8SVGUnitTypes.h\\\"\\n\\n#include \\\"V8SVGURIReference.h\\\"\\n\\n#include \\\"V8SVGZoomEvent.h\\\"\\n\\n#endif\\n\\n\\n\\nnamespace WebCore {\\n\\n\\n\\nFunctionTemplateFactory V8ClassIndex::GetFactory(V8WrapperType type) {\\n\\n switch (type) {\\n\\n#define MAKE_CASE(type, name)\\\\\\n\\n case V8ClassIndex::type: return V8##name::GetTemplate;\\n\\n WRAPPER_TYPES(MAKE_CASE)\\n\\n#undef MAKE_CASE\\n\\n default: return NULL;\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#define MAKE_CACHE(type, name)\\\\\\n\\n static v8::Persistent<v8::FunctionTemplate> name##_cache_;\\n\",\n \"file_path\": \"webkit/port/bindings/v8/v8_index.cpp\",\n \"rank\": 84,\n \"score\": 44.72113098901854\n },\n {\n \"content\": \"\\n\\nvoid NPVariantWrap::Copy(const NPVariant& v) {\\n\\n if (this == &v)\\n\\n return;\\n\\n Release();\\n\\n switch(v.type) {\\n\\n case NPVariantType_Void:\\n\\n break;\\n\\n case NPVariantType_Null:\\n\\n break;\\n\\n case NPVariantType_Bool:\\n\\n value.boolValue = v.value.boolValue;\\n\\n break;\\n\\n case NPVariantType_Int32:\\n\\n value.intValue = v.value.intValue;\\n\\n break;\\n\\n case NPVariantType_Double:\\n\\n value.doubleValue = v.value.doubleValue;\\n\\n break;\\n\\n case NPVariantType_String:\\n\",\n \"file_path\": \"webkit/activex_shim/npn_scripting.cc\",\n \"rank\": 86,\n \"score\": 43.48048745288154\n },\n {\n \"content\": \" // coordinates.\\n\\n\\n\\n // NOTE: These may be called after we've been removed from the widget/\\n\\n // window hierarchy, for example because the EventHandler keeps a reference\\n\\n // around and tries to feed us MouseOut events. In this case, doing\\n\\n // something would be not only pointless but dangerous, as without a\\n\\n // parent() we will end up failing an ASSERT(). So bail early if we get to\\n\\n // any of these with no parent().\\n\\n virtual bool handleMouseMoveEvent(const PlatformMouseEvent&);\\n\\n virtual bool handleMouseOutEvent(const PlatformMouseEvent&);\\n\\n virtual bool handleMousePressEvent(const PlatformMouseEvent&);\\n\\n virtual bool handleMouseReleaseEvent(const PlatformMouseEvent&);\\n\\n\\n\\n virtual IntRect windowClipRect() const;\\n\\n\\n\\n static void themeChanged();\\n\\n static int horizontalScrollbarHeight(ScrollbarControlSize size = RegularScrollbar);\\n\\n static int verticalScrollbarWidth(ScrollbarControlSize size = RegularScrollbar);\\n\\n\\n\\n // Scrolls the page when auto-repeat scrolling.\\n\",\n \"file_path\": \"webkit/port/platform/chromium/PlatformScrollBar.h\",\n \"rank\": 87,\n \"score\": 43.2041336662783\n },\n {\n \"content\": \" // Safari must perform a similar hack, ours is in our WebKit glue layer\\n\\n // theirs is in the application. This should go when WebCore can be fixed\\n\\n // to pass more event information to ChromeClient::show()\\n\\n g_current_input_event = input_event;\\n\\n\\n\\n bool handled = true;\\n\\n\\n\\n // TODO(jcampan): WebKit seems to always return false on mouse events\\n\\n // processing methods. For now we'll assume it has processed them (as we are\\n\\n // only interested in whether keyboard events are processed).\\n\\n switch (input_event->type) {\\n\\n case WebInputEvent::MOUSE_MOVE:\\n\\n MouseMove(*static_cast<const WebMouseEvent*>(input_event));\\n\\n break;\\n\\n\\n\\n case WebInputEvent::MOUSE_LEAVE:\\n\\n MouseLeave(*static_cast<const WebMouseEvent*>(input_event));\\n\\n break;\\n\\n\\n\\n case WebInputEvent::MOUSE_WHEEL:\\n\",\n \"file_path\": \"webkit/glue/webview_impl.cc\",\n \"rank\": 88,\n \"score\": 42.84501284398694\n },\n {\n \"content\": \" MouseWheel(*static_cast<const WebMouseWheelEvent*>(input_event));\\n\\n break;\\n\\n\\n\\n case WebInputEvent::MOUSE_DOWN:\\n\\n case WebInputEvent::MOUSE_DOUBLE_CLICK:\\n\\n MouseDown(*static_cast<const WebMouseEvent*>(input_event));\\n\\n break;\\n\\n\\n\\n case WebInputEvent::MOUSE_UP:\\n\\n MouseUp(*static_cast<const WebMouseEvent*>(input_event));\\n\\n break;\\n\\n\\n\\n case WebInputEvent::KEY_DOWN:\\n\\n case WebInputEvent::KEY_UP:\\n\\n handled = KeyEvent(*static_cast<const WebKeyboardEvent*>(input_event));\\n\\n break;\\n\\n\\n\\n case WebInputEvent::CHAR:\\n\\n handled = CharEvent(*static_cast<const WebKeyboardEvent*>(input_event));\\n\\n break;\\n\",\n \"file_path\": \"webkit/glue/webview_impl.cc\",\n \"rank\": 89,\n \"score\": 42.70572604809186\n },\n {\n \"content\": \"// Copyright (c) 2008 The Chromium Authors. All rights reserved.\\n\\n// Use of this source code is governed by a BSD-style license that can be\\n\\n// found in the LICENSE file.\\n\\n\\n\\n#include \\\"base/message_pump_libevent.h\\\"\\n\\n\\n\\n#include <fcntl.h>\\n\\n\\n\\n#include \\\"base/logging.h\\\"\\n\\n#include \\\"base/scoped_nsautorelease_pool.h\\\"\\n\\n#include \\\"base/time.h\\\"\\n\\n#include \\\"third_party/libevent/event.h\\\"\\n\\n\\n\\nnamespace base {\\n\\n\\n\\n// Return 0 on success\\n\\n// Too small a function to bother putting in a library?\\n\\nstatic int SetNonBlocking(int fd)\\n\\n{\\n\\n int flags = fcntl(fd, F_GETFL, 0);\\n\",\n \"file_path\": \"base/message_pump_libevent.cc\",\n \"rank\": 90,\n \"score\": 42.66530300772644\n },\n {\n \"content\": \"void WebWidgetHost::MouseEvent(UINT message, WPARAM wparam, LPARAM lparam) {\\n\\n WebMouseEvent event(view_, message, wparam, lparam);\\n\\n switch (event.type) {\\n\\n case WebInputEvent::MOUSE_MOVE:\\n\\n TrackMouseLeave(true);\\n\\n break;\\n\\n case WebInputEvent::MOUSE_LEAVE:\\n\\n TrackMouseLeave(false);\\n\\n break;\\n\\n case WebInputEvent::MOUSE_DOWN:\\n\\n SetCapture(view_);\\n\\n break;\\n\\n case WebInputEvent::MOUSE_UP:\\n\\n if (GetCapture() == view_)\\n\\n ReleaseCapture();\\n\\n break;\\n\\n }\\n\\n webwidget_->HandleInputEvent(&event);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"webkit/tools/test_shell/webwidget_host.cc\",\n \"rank\": 92,\n \"score\": 42.29184258976745\n },\n {\n \"content\": \"// Windows callback for the playback mode.\\n\\nLRESULT EventRecorder::PlaybackWndProc(int nCode, WPARAM wParam,\\n\\n LPARAM lParam) {\\n\\n static bool playback_enabled = true;\\n\\n int delay = 0;\\n\\n\\n\\n switch(nCode) {\\n\\n // A system modal dialog box is being displayed. Stop playing back\\n\\n // messages.\\n\\n case HC_SYSMODALON:\\n\\n playback_enabled = false;\\n\\n break;\\n\\n\\n\\n // A system modal dialog box is destroyed. We can start playing back\\n\\n // messages again.\\n\\n case HC_SYSMODALOFF:\\n\\n playback_enabled = true;\\n\\n break;\\n\\n\\n\\n // Prepare to copy the next mouse or keyboard event to playback.\\n\",\n \"file_path\": \"base/event_recorder.cc\",\n \"rank\": 93,\n \"score\": 42.02522569292091\n },\n {\n \"content\": \" if (!obj->eventLogging)\\n\\n return 0;\\n\\n \\n\\n#ifdef WIN32\\n\\n // Below is the event handling code. Per the NPAPI spec, the events don't\\n\\n // map directly between operating systems:\\n\\n // http://devedge-temp.mozilla.org/library/manuals/2002/plugin/1.0/structures5.html#1000000\\n\\n NPEvent* evt = static_cast<NPEvent*>(event);\\n\\n short x = static_cast<short>(evt->lParam & 0xffff);\\n\\n short y = static_cast<short>(evt->lParam >> 16);\\n\\n switch (evt->event) {\\n\\n case WM_PAINT:\\n\\n printf(\\\"PLUGIN: updateEvt\\\\n\\\");\\n\\n break;\\n\\n case WM_LBUTTONDOWN:\\n\\n case WM_MBUTTONDOWN:\\n\\n case WM_RBUTTONDOWN:\\n\\n printf(\\\"PLUGIN: mouseDown at (%d, %d)\\\\n\\\", x, y);\\n\\n break;\\n\\n case WM_LBUTTONUP:\\n\",\n \"file_path\": \"webkit/tools/npapi_layout_test_plugin/main.cpp\",\n \"rank\": 94,\n \"score\": 41.92162782752543\n },\n {\n \"content\": \"#include \\\"FrameView.h\\\"\\n\\n#include \\\"GraphicsContext.h\\\"\\n\\n#include \\\"HTMLNames.h\\\"\\n\\n#include \\\"HTMLPlugInElement.h\\\"\\n\\n#include \\\"IntRect.h\\\"\\n\\n#include \\\"KURL.h\\\"\\n\\n#include \\\"KeyboardEvent.h\\\"\\n\\n#include \\\"MouseEvent.h\\\"\\n\\n#include \\\"Page.h\\\"\\n\\n#include \\\"PlatformContextSkia.h\\\"\\n\\n#include \\\"PlatformMouseEvent.h\\\"\\n\\n#include \\\"PlatformString.h\\\"\\n\\n#include \\\"ResourceHandle.h\\\"\\n\\n#include \\\"ResourceHandleClient.h\\\"\\n\\n#include \\\"ResourceResponse.h\\\"\\n\\n#include \\\"ScriptController.h\\\"\\n\\n#include \\\"ScrollView.h\\\"\\n\\n#include \\\"Widget.h\\\"\\n\\nMSVC_POP_WARNING();\\n\\n#undef LOG\\n\",\n \"file_path\": \"webkit/glue/webplugin_impl.cc\",\n \"rank\": 95,\n \"score\": 41.69659196478847\n },\n {\n \"content\": \" return m_hWnd;\\n\\n}\\n\\n\\n\\nvoid RenderWidgetHostViewWin::ForwardMouseEventToRenderer(UINT message,\\n\\n WPARAM wparam,\\n\\n LPARAM lparam) {\\n\\n WebMouseEvent event(m_hWnd, message, wparam, lparam);\\n\\n switch (event.type) {\\n\\n case WebInputEvent::MOUSE_MOVE:\\n\\n TrackMouseLeave(true);\\n\\n break;\\n\\n case WebInputEvent::MOUSE_LEAVE:\\n\\n TrackMouseLeave(false);\\n\\n break;\\n\\n case WebInputEvent::MOUSE_DOWN:\\n\\n SetCapture();\\n\\n break;\\n\\n case WebInputEvent::MOUSE_UP:\\n\\n if (GetCapture() == m_hWnd)\\n\\n ReleaseCapture();\\n\",\n \"file_path\": \"chrome/browser/render_widget_host_view_win.cc\",\n \"rank\": 96,\n \"score\": 41.6357766139031\n },\n {\n \"content\": \" virtual void OnMouseReleased(const MouseEvent& event, bool canceled);\\n\\n\\n\\n private:\\n\\n // Returns true if |x| is over the divider.\\n\\n bool IsPointInDivider(int x);\\n\\n\\n\\n // Used to track drag info.\\n\\n struct DragInfo {\\n\\n // The initial coordinate of the mouse when the user started the drag.\\n\\n int initial_mouse_x;\\n\\n // The initial position of the divider when the user started the drag.\\n\\n int initial_divider_x;\\n\\n };\\n\\n\\n\\n DragInfo drag_info_;\\n\\n\\n\\n // Position of the divider.\\n\\n int divider_x_;\\n\\n\\n\\n DISALLOW_COPY_AND_ASSIGN(SingleSplitView);\\n\\n};\\n\\n\\n\\n} // namespace views\\n\\n\\n\\n#endif // CHROME_VIEWS_SINGLE_SPLIT_VIEW_H_\\n\",\n \"file_path\": \"chrome/views/single_split_view.h\",\n \"rank\": 97,\n \"score\": 41.49019051063204\n },\n {\n \"content\": \" break;\\n\\n\\n\\n case NOTIFY_PLUGIN_INSTANCE_CREATED:\\n\\n stats.instances++;\\n\\n break;\\n\\n\\n\\n case NOTIFY_PLUGIN_PROCESS_CRASHED:\\n\\n stats.process_crashes++;\\n\\n break;\\n\\n\\n\\n default:\\n\\n NOTREACHED() << \\\"Unexpected notification type \\\" << type;\\n\\n return;\\n\\n }\\n\\n}\\n\\n\\n\\n// Recursively counts the number of bookmarks and folders in node.\\n\\nstatic void CountBookmarks(BookmarkNode* node, int* bookmarks, int* folders) {\\n\\n if (node->GetType() == history::StarredEntry::URL)\\n\\n (*bookmarks)++;\\n\",\n \"file_path\": \"chrome/browser/metrics_service.cc\",\n \"rank\": 98,\n \"score\": 41.31496168846098\n },\n {\n \"content\": \"#include \\\"chrome/common/os_exchange_data.h\\\"\\n\\n#include \\\"chrome/common/pref_names.h\\\"\\n\\n#include \\\"chrome/common/resource_bundle.h\\\"\\n\\n#include \\\"chrome/common/slide_animation.h\\\"\\n\\n#include \\\"chrome/common/stl_util-inl.h\\\"\\n\\n#include \\\"chrome/common/win_util.h\\\"\\n\\n#include \\\"chrome/views/image_view.h\\\"\\n\\n#include \\\"chrome/views/painter.h\\\"\\n\\n\\n\\n#include \\\"generated_resources.h\\\"\\n\\n\\n\\n#undef min\\n\\n#undef max\\n\\n\\n\\nusing views::DropTargetEvent;\\n\\n\\n\\nstatic const int kDefaultAnimationDurationMs = 100;\\n\\nstatic const int kResizeLayoutAnimationDurationMs = 166;\\n\\nstatic const int kReorderAnimationDurationMs = 166;\\n\\n\\n\",\n \"file_path\": \"chrome/browser/views/tabs/tab_strip.cc\",\n \"rank\": 99,\n \"score\": 41.306240120690724\n }\n]","isConversational":false}}},{"rowIdx":67,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"sync/internal_api/public/base/unique_position.cc"},"repo_name":{"kind":"string","value":"pozdnyakov/chromium-crosswalk"},"commit":{"kind":"string","value":"0fb25c7278bf1d93e53a3b0bcb75aa8b99d4b26e"},"file_code":{"kind":"string","value":"\n\n#include \"sync/internal_api/public/base/unique_position.h\"\n\n#include \"base/logging.h\"\n#include \"base/stl_util.h\"\n#include \"base/strings/string_number_conversions.h\"\n#include \"sync/protocol/unique_position.pb.h\"\n#include \"third_party/zlib/zlib.h\"\n\nnamespace syncer {\n\nconst size_t UniquePosition::kSuffixLength = 28;\nconst size_t UniquePosition::kCompressBytesThreshold = 128;\n\nbool UniquePosition::IsValidSuffix(const std::string& suffix) {\n \n \n \n return suffix.length() == kSuffixLength;\n}\n\nbool UniquePosition::IsValidBytes(const std::string& bytes) {\n \n \n \n \n \n return bytes.length() >= kSuffixLength\n && bytes[bytes.length()-1] != 0;\n}\n\nUniquePosition UniquePosition::CreateInvalid() {\n UniquePosition pos;\n DCHECK(!pos.IsValid());\n return pos;\n}\n\nUniquePosition UniquePosition::FromProto(const sync_pb::UniquePosition& proto) {\n if (proto.has_value()) {\n return UniquePosition(proto.value());\n } else if (proto.has_compressed_value() && proto.has_uncompressed_length()) {\n uLongf uncompressed_len = proto.uncompressed_length();\n std::string uncompressed;\n\n uncompressed.resize(uncompressed_len);\n int result = uncompress(\n reinterpret_cast<Bytef*>(string_as_array(&uncompressed)),\n &uncompressed_len,\n reinterpret_cast<const Bytef*>(proto.compressed_value().data()),\n proto.compressed_value().size());\n if (result != Z_OK) {\n DLOG(ERROR) << \"Unzip failed \" << result;\n return UniquePosition::CreateInvalid();\n }\n if (uncompressed_len != proto.uncompressed_length()) {\n DLOG(ERROR)\n << \"Uncompressed length \" << uncompressed_len\n << \" did not match specified length \" << proto.uncompressed_length();\n return UniquePosition::CreateInvalid();\n }\n return UniquePosition(uncompressed);\n } else {\n return UniquePosition::CreateInvalid();\n }\n}\n\nUniquePosition UniquePosition::FromInt64(\n int64 x, const std::string& suffix) {\n uint64 y = static_cast<uint64>(x);\n y ^= 0x8000000000000000ULL; \n std::string bytes(8, 0);\n for (int i = 7; i >= 0; --i) {\n bytes[i] = static_cast<uint8>(y);\n y >>= 8;\n }\n return UniquePosition(bytes, suffix);\n}\n\nUniquePosition UniquePosition::InitialPosition(\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n return UniquePosition(std::string(), suffix);\n}\n\nUniquePosition UniquePosition::Before(\n const UniquePosition& x,\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK(x.IsValid());\n const std::string& before = FindSmallerWithSuffix(x.bytes_, suffix);\n return UniquePosition(before, suffix);\n}\n\nUniquePosition UniquePosition::After(\n const UniquePosition& x,\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK(x.IsValid());\n const std::string& after = FindGreaterWithSuffix(x.bytes_, suffix);\n return UniquePosition(after, suffix);\n}\n\nUniquePosition UniquePosition::Between(\n const UniquePosition& before,\n const UniquePosition& after,\n const std::string& suffix) {\n DCHECK(before.IsValid());\n DCHECK(after.IsValid());\n DCHECK(before.LessThan(after));\n DCHECK(IsValidSuffix(suffix));\n const std::string& mid =\n FindBetweenWithSuffix(before.bytes_, after.bytes_, suffix);\n return UniquePosition(mid, suffix);\n}\n\nUniquePosition::UniquePosition() : is_valid_(false) {}\n\nbool UniquePosition::LessThan(const UniquePosition& other) const {\n DCHECK(this->IsValid());\n DCHECK(other.IsValid());\n return bytes_ < other.bytes_;\n}\n\nbool UniquePosition::Equals(const UniquePosition& other) const {\n if (!this->IsValid() && !other.IsValid())\n return true;\n\n return bytes_ == other.bytes_;\n}\n\nvoid UniquePosition::ToProto(sync_pb::UniquePosition* proto) const {\n proto->Clear();\n if (bytes_.size() < kCompressBytesThreshold) {\n \n proto->set_value(bytes_);\n } else {\n \n proto->set_uncompressed_length(bytes_.size());\n std::string* compressed = proto->mutable_compressed_value();\n\n uLongf compressed_len = compressBound(bytes_.size());\n compressed->resize(compressed_len);\n int result = compress(reinterpret_cast<Bytef*>(string_as_array(compressed)),\n &compressed_len,\n reinterpret_cast<const Bytef*>(bytes_.data()),\n bytes_.size());\n if (result != Z_OK) {\n NOTREACHED() << \"Failed to compress position: \" << result;\n \n proto->Clear();\n proto->set_value(bytes_);\n } else if (compressed_len >= bytes_.size()) {\n \n proto->Clear();\n proto->set_value(bytes_);\n } else {\n \n compressed->resize(compressed_len);\n }\n }\n}\n\nvoid UniquePosition::SerializeToString(std::string* blob) const {\n DCHECK(blob);\n sync_pb::UniquePosition proto;\n ToProto(&proto);\n proto.SerializeToString(blob);\n}\n\nint64 UniquePosition::ToInt64() const {\n uint64 y = 0;\n const std::string& s = bytes_;\n size_t l = sizeof(int64);\n if (s.length() < l) {\n NOTREACHED();\n l = s.length();\n }\n for (size_t i = 0; i < l; ++i) {\n const uint8 byte = s[l - i - 1];\n y |= static_cast<uint64>(byte) << (i * 8);\n }\n y ^= 0x8000000000000000ULL;\n \n \n return static_cast<int64>(y);\n}\n\nbool UniquePosition::IsValid() const {\n return is_valid_;\n}\n\nstd::string UniquePosition::ToDebugString() const {\n if (bytes_.empty())\n return std::string(\"INVALID[]\");\n\n std::string debug_string = base::HexEncode(bytes_.data(), bytes_.length());\n if (!IsValid()) {\n debug_string = \"INVALID[\" + debug_string + \"]\";\n }\n return debug_string;;\n}\n\nstd::string UniquePosition::GetSuffixForTest() const {\n const size_t prefix_len = bytes_.length() - kSuffixLength;\n return bytes_.substr(prefix_len, std::string::npos);\n}\n\nstd::string UniquePosition::FindSmallerWithSuffix(\n const std::string& reference,\n const std::string& suffix) {\n size_t ref_zeroes = reference.find_first_not_of('\\0');\n size_t suffix_zeroes = suffix.find_first_not_of('\\0');\n\n \n \n DCHECK_NE(ref_zeroes, std::string::npos);\n DCHECK_NE(suffix_zeroes, std::string::npos);\n\n if (suffix_zeroes > ref_zeroes) {\n \n return std::string();\n }\n\n if (suffix.substr(suffix_zeroes) < reference.substr(ref_zeroes)) {\n \n return std::string(ref_zeroes - suffix_zeroes, '\\0');\n } else if (suffix_zeroes > 1) {\n \n \n \n return std::string(ref_zeroes - suffix_zeroes + 1, '\\0');\n } else {\n \n \n char lt_digit = static_cast<uint8>(reference[ref_zeroes])/2;\n return std::string(ref_zeroes, '\\0') + lt_digit;\n }\n}\n\nstd::string UniquePosition::FindGreaterWithSuffix(\n const std::string& reference,\n const std::string& suffix) {\n size_t ref_FFs = reference.find_first_not_of(kuint8max);\n size_t suffix_FFs = suffix.find_first_not_of(kuint8max);\n\n if (ref_FFs == std::string::npos) {\n ref_FFs = reference.length();\n }\n if (suffix_FFs == std::string::npos) {\n suffix_FFs = suffix.length();\n }\n\n if (suffix_FFs > ref_FFs) {\n \n return std::string();\n }\n\n if (suffix.substr(suffix_FFs) > reference.substr(ref_FFs)) {\n \n return std::string(ref_FFs - suffix_FFs, kuint8max);\n } else if (suffix_FFs > 1) {\n \n \n \n return std::string(ref_FFs - suffix_FFs + 1, kuint8max);\n } else {\n \n \n char gt_digit = static_cast<uint8>(reference[ref_FFs]) +\n (kuint8max - static_cast<uint8>(reference[ref_FFs]) + 1) / 2;\n return std::string(ref_FFs, kuint8max) + gt_digit;\n }\n}\n\nstd::string UniquePosition::FindBetweenWithSuffix(\n const std::string& before,\n const std::string& after,\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK_NE(before, after);\n DCHECK_LT(before, after);\n\n std::string mid;\n\n \n if (before < suffix && suffix < after) {\n return std::string();\n }\n\n size_t i = 0;\n for ( ; i < std::min(before.length(), after.length()); ++i) {\n uint8 a_digit = before[i];\n uint8 b_digit = after[i];\n\n if (b_digit - a_digit >= 2) {\n mid.push_back(a_digit + (b_digit - a_digit)/2);\n return mid;\n } else if (a_digit == b_digit) {\n mid.push_back(a_digit);\n\n \n \n if (before.substr(i+1) < suffix && suffix < after.substr(i+1)) {\n return mid;\n }\n } else {\n DCHECK_EQ(b_digit - a_digit, 1); \n\n \n \n \n \n\n \n \n \n std::string mid_a = mid;\n mid_a.push_back(a_digit);\n mid_a.append(FindGreaterWithSuffix(before.substr(i+1), suffix));\n\n \n \n \n \n \n if (after.length() > i+1) {\n std::string mid_b = mid;\n mid_b.push_back(b_digit);\n mid_b.append(FindSmallerWithSuffix(after.substr(i+1), suffix));\n\n \n if (mid_b.length() < mid_a.length()) {\n return mid_b;\n }\n }\n return mid_a;\n }\n }\n\n \n DCHECK_EQ(before.substr(0, i), after.substr(0, i));\n DCHECK_EQ(before, mid);\n DCHECK_LT(before.length(), after.length());\n\n \n \n \n \n\n mid.append(FindSmallerWithSuffix(after.substr(i), suffix));\n return mid;\n}\n\nUniquePosition::UniquePosition(const std::string& internal_rep)\n : bytes_(internal_rep),\n is_valid_(IsValidBytes(bytes_)) {\n}\n\nUniquePosition::UniquePosition(\n const std::string& prefix,\n const std::string& suffix)\n : bytes_(prefix + suffix),\n is_valid_(IsValidBytes(bytes_)) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK(IsValid());\n}\n\n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"sync/internal_api/public/base/unique_position.h\"\n\n#include \"base/logging.h\"\n#include \"base/stl_util.h\"\n#include \"base/strings/string_number_conversions.h\"\n#include \"sync/protocol/unique_position.pb.h\"\n#include \"third_party/zlib/zlib.h\"\n\nnamespace syncer {\n\nconst size_t UniquePosition::kSuffixLength = 28;\nconst size_t UniquePosition::kCompressBytesThreshold = 128;\n\nbool UniquePosition::IsValidSuffix(const std::string& suffix) {\n \n \n \n return suffix.length() == kSuffixLength;\n}\n\nbool UniquePosition::IsValidBytes(const std::string& bytes) {\n \n \n \n \n \n return bytes.length() >= kSuffixLength\n && bytes[bytes.length()-1] != 0;\n}\n\nUniquePosition UniquePosition::CreateInvalid() {\n UniquePosition pos;\n DCHECK(!pos.IsValid());\n return pos;\n}\n\nUniquePosition UniquePosition::FromProto(const sync_pb::UniquePosition& proto) {\n if (proto.has_value()) {\n return UniquePosition(proto.value());\n } else if (proto.has_compressed_value() && proto.has_uncompressed_length()) {\n uLongf uncompressed_len = proto.uncompressed_length();\n std::string uncompressed;\n\n uncompressed.resize(uncompressed_len);\n int result = uncompress(\n reinterpret_cast<Bytef*>(string_as_array(&uncompressed)),\n &uncompressed_len,\n reinterpret_cast<const Bytef*>(proto.compressed_value().data()),\n proto.compressed_value().size());\n if (result != Z_OK) {\n DLOG(ERROR) << \"Unzip failed \" << result;\n return UniquePosition::CreateInvalid();\n }\n if (uncompressed_len != proto.uncompressed_length()) {\n DLOG(ERROR)\n << \"Uncompressed length \" << uncompressed_len\n << \" did not match specified length \" << proto.uncompressed_length();\n return UniquePosition::CreateInvalid();\n }\n return UniquePosition(uncompressed);\n } else {\n return UniquePosition::CreateInvalid();\n }\n}\n\nUniquePosition UniquePosition::FromInt64(\n int64 x, const std::string& suffix) {\n uint64 y = static_cast<uint64>(x);\n y ^= 0x8000000000000000ULL; \n std::string bytes(8, 0);\n for (int i = 7; i >= 0; --i) {\n bytes[i] = static_cast<uint8>(y);\n y >>= 8;\n }\n return UniquePosition(bytes, suffix);\n}\n\nUniquePosition UniquePosition::InitialPosition(\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n return UniquePosition(std::string(), suffix);\n}\n\nUniquePosition UniquePosition::Before(\n const UniquePosition& x,\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK(x.IsValid());\n const std::string& before = FindSmallerWithSuffix(x.bytes_, suffix);\n return UniquePosition(before, suffix);\n}\n\n"},"suffix":{"kind":"string","value":"\n\nUniquePosition UniquePosition::Between(\n const UniquePosition& before,\n const UniquePosition& after,\n const std::string& suffix) {\n DCHECK(before.IsValid());\n DCHECK(after.IsValid());\n DCHECK(before.LessThan(after));\n DCHECK(IsValidSuffix(suffix));\n const std::string& mid =\n FindBetweenWithSuffix(before.bytes_, after.bytes_, suffix);\n return UniquePosition(mid, suffix);\n}\n\nUniquePosition::UniquePosition() : is_valid_(false) {}\n\nbool UniquePosition::LessThan(const UniquePosition& other) const {\n DCHECK(this->IsValid());\n DCHECK(other.IsValid());\n return bytes_ < other.bytes_;\n}\n\nbool UniquePosition::Equals(const UniquePosition& other) const {\n if (!this->IsValid() && !other.IsValid())\n return true;\n\n return bytes_ == other.bytes_;\n}\n\nvoid UniquePosition::ToProto(sync_pb::UniquePosition* proto) const {\n proto->Clear();\n if (bytes_.size() < kCompressBytesThreshold) {\n \n proto->set_value(bytes_);\n } else {\n \n proto->set_uncompressed_length(bytes_.size());\n std::string* compressed = proto->mutable_compressed_value();\n\n uLongf compressed_len = compressBound(bytes_.size());\n compressed->resize(compressed_len);\n int result = compress(reinterpret_cast<Bytef*>(string_as_array(compressed)),\n &compressed_len,\n reinterpret_cast<const Bytef*>(bytes_.data()),\n bytes_.size());\n if (result != Z_OK) {\n NOTREACHED() << \"Failed to compress position: \" << result;\n \n proto->Clear();\n proto->set_value(bytes_);\n } else if (compressed_len >= bytes_.size()) {\n \n proto->Clear();\n proto->set_value(bytes_);\n } else {\n \n compressed->resize(compressed_len);\n }\n }\n}\n\nvoid UniquePosition::SerializeToString(std::string* blob) const {\n DCHECK(blob);\n sync_pb::UniquePosition proto;\n ToProto(&proto);\n proto.SerializeToString(blob);\n}\n\nint64 UniquePosition::ToInt64() const {\n uint64 y = 0;\n const std::string& s = bytes_;\n size_t l = sizeof(int64);\n if (s.length() < l) {\n NOTREACHED();\n l = s.length();\n }\n for (size_t i = 0; i < l; ++i) {\n const uint8 byte = s[l - i - 1];\n y |= static_cast<uint64>(byte) << (i * 8);\n }\n y ^= 0x8000000000000000ULL;\n \n \n return static_cast<int64>(y);\n}\n\nbool UniquePosition::IsValid() const {\n return is_valid_;\n}\n\nstd::string UniquePosition::ToDebugString() const {\n if (bytes_.empty())\n return std::string(\"INVALID[]\");\n\n std::string debug_string = base::HexEncode(bytes_.data(), bytes_.length());\n if (!IsValid()) {\n debug_string = \"INVALID[\" + debug_string + \"]\";\n }\n return debug_string;;\n}\n\nstd::string UniquePosition::GetSuffixForTest() const {\n const size_t prefix_len = bytes_.length() - kSuffixLength;\n return bytes_.substr(prefix_len, std::string::npos);\n}\n\nstd::string UniquePosition::FindSmallerWithSuffix(\n const std::string& reference,\n const std::string& suffix) {\n size_t ref_zeroes = reference.find_first_not_of('\\0');\n size_t suffix_zeroes = suffix.find_first_not_of('\\0');\n\n \n \n DCHECK_NE(ref_zeroes, std::string::npos);\n DCHECK_NE(suffix_zeroes, std::string::npos);\n\n if (suffix_zeroes > ref_zeroes) {\n \n return std::string();\n }\n\n if (suffix.substr(suffix_zeroes) < reference.substr(ref_zeroes)) {\n \n return std::string(ref_zeroes - suffix_zeroes, '\\0');\n } else if (suffix_zeroes > 1) {\n \n \n \n return std::string(ref_zeroes - suffix_zeroes + 1, '\\0');\n } else {\n \n \n char lt_digit = static_cast<uint8>(reference[ref_zeroes])/2;\n return std::string(ref_zeroes, '\\0') + lt_digit;\n }\n}\n\nstd::string UniquePosition::FindGreaterWithSuffix(\n const std::string& reference,\n const std::string& suffix) {\n size_t ref_FFs = reference.find_first_not_of(kuint8max);\n size_t suffix_FFs = suffix.find_first_not_of(kuint8max);\n\n if (ref_FFs == std::string::npos) {\n ref_FFs = reference.length();\n }\n if (suffix_FFs == std::string::npos) {\n suffix_FFs = suffix.length();\n }\n\n if (suffix_FFs > ref_FFs) {\n \n return std::string();\n }\n\n if (suffix.substr(suffix_FFs) > reference.substr(ref_FFs)) {\n \n return std::string(ref_FFs - suffix_FFs, kuint8max);\n } else if (suffix_FFs > 1) {\n \n \n \n return std::string(ref_FFs - suffix_FFs + 1, kuint8max);\n } else {\n \n \n char gt_digit = static_cast<uint8>(reference[ref_FFs]) +\n (kuint8max - static_cast<uint8>(reference[ref_FFs]) + 1) / 2;\n return std::string(ref_FFs, kuint8max) + gt_digit;\n }\n}\n\nstd::string UniquePosition::FindBetweenWithSuffix(\n const std::string& before,\n const std::string& after,\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK_NE(before, after);\n DCHECK_LT(before, after);\n\n std::string mid;\n\n \n if (before < suffix && suffix < after) {\n return std::string();\n }\n\n size_t i = 0;\n for ( ; i < std::min(before.length(), after.length()); ++i) {\n uint8 a_digit = before[i];\n uint8 b_digit = after[i];\n\n if (b_digit - a_digit >= 2) {\n mid.push_back(a_digit + (b_digit - a_digit)/2);\n return mid;\n } else if (a_digit == b_digit) {\n mid.push_back(a_digit);\n\n \n \n if (before.substr(i+1) < suffix && suffix < after.substr(i+1)) {\n return mid;\n }\n } else {\n DCHECK_EQ(b_digit - a_digit, 1); \n\n \n \n \n \n\n \n \n \n std::string mid_a = mid;\n mid_a.push_back(a_digit);\n mid_a.append(FindGreaterWithSuffix(before.substr(i+1), suffix));\n\n \n \n \n \n \n if (after.length() > i+1) {\n std::string mid_b = mid;\n mid_b.push_back(b_digit);\n mid_b.append(FindSmallerWithSuffix(after.substr(i+1), suffix));\n\n \n if (mid_b.length() < mid_a.length()) {\n return mid_b;\n }\n }\n return mid_a;\n }\n }\n\n \n DCHECK_EQ(before.substr(0, i), after.substr(0, i));\n DCHECK_EQ(before, mid);\n DCHECK_LT(before.length(), after.length());\n\n \n \n \n \n\n mid.append(FindSmallerWithSuffix(after.substr(i), suffix));\n return mid;\n}\n\nUniquePosition::UniquePosition(const std::string& internal_rep)\n : bytes_(internal_rep),\n is_valid_(IsValidBytes(bytes_)) {\n}\n\nUniquePosition::UniquePosition(\n const std::string& prefix,\n const std::string& suffix)\n : bytes_(prefix + suffix),\n is_valid_(IsValidBytes(bytes_)) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK(IsValid());\n}\n\n} \n"},"middle":{"kind":"string","value":"UniquePosition UniquePosition::After(\n const UniquePosition& x,\n const std::string& suffix) {\n DCHECK(IsValidSuffix(suffix));\n DCHECK(x.IsValid());\n const std::string& after = FindGreaterWithSuffix(x.bytes_, suffix);\n return UniquePosition(after, suffix);\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":68,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/main.cpp"},"repo_name":{"kind":"string","value":"chhsgithub/PolygonExpand"},"commit":{"kind":"string","value":"36e42bcd9a5dee09e028cf7024e49dd7f67517b4"},"file_code":{"kind":"string","value":"#include <iostream>\n#include <Windows.h>\n#include <vector>\n#include <opencv2/opencv.hpp>\n\n#define CVUI_IMPLEMENTATION\n#include \"cvui.h\"\n\nusing namespace std;\nusing namespace cv;\n\n#define WINDOW_NAME \"Show\"\n\nbool clockwise(vector<Point> contour);\n\nvoid expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, float range);\n\nvoid on_Trackbar(int, void*)\n{\n\n}\n\nint main()\n{\n\tMat show(800, 800, CV_8UC3, Scalar(255,255,255));\n\tnamedWindow(WINDOW_NAME);\n\tcvui::init(WINDOW_NAME);\n\tint range=0;\n\t\n\t\n\tvector<Point> contours;\n\tcontours.push_back(Point(400, 650));\n\tcontours.push_back(Point(450, 600));\n\tcontours.push_back(Point(450, 450));\n\tcontours.push_back(Point(500, 450));\n\tcontours.push_back(Point(500, 400));\n\tcontours.push_back(Point(400, 400));\n\t\n\twhile (true)\n\t{\n\t\tshow= Mat(800, 800, CV_8UC3, Scalar(255, 255, 255));\n\t\t\n\t\tcvui::window(show, 200, 20, 400, 70, \"Setting\");\n\t\tcvui::trackbar(show, 250, 40, 300, &range, -100, 100);\n\t\tcvui::update();\n\t\tvector<Point> points_expand;\n\n\t\t\n\t\texpand_polygon(contours, points_expand, range);\n\n\t\t\n\t\tPoint vertex;\n\t\tfor (int i = 0; i < contours.size(); i++) {\n\t\t\tvertex.x = contours[i].x;\n\t\t\tvertex.y = contours[i].y;\n\t\t\tcircle(show, vertex, 2, Scalar(0, 255, 0), 1);\n\t\t\tostringstream indexText;\n\t\t\tindexText << i;\n\t\t\tputText(show, indexText.str(), vertex, cv::FONT_HERSHEY_DUPLEX, 0.5, cv::Scalar(0, 0, 255), 1);\n\t\t\tint next = (i == (contours.size() - 1) ? 0 : (i + 1));\n\t\t\tline(show, contours[i], contours[next], Scalar(0, 0, 255), 1);\n\t\t}\n\n\t\t\n\t\tfor (int i = 0; i < points_expand.size(); i++) {\n\t\t\tvertex.x = points_expand[i].x;\n\t\t\tvertex.y = points_expand[i].y;\n\t\t\tcircle(show, vertex, 2, Scalar(0, 255, 0), 1);\n\t\t\tostringstream indexText;\n\t\t\tindexText << i;\n\t\t\tputText(show, indexText.str(), vertex, cv::FONT_HERSHEY_DUPLEX, 0.5, cv::Scalar(0, 0, 255), 1);\n\t\t\tint next = (i == (points_expand.size() - 1) ? 0 : (i + 1));\n\t\t\tline(show, points_expand[i], points_expand[next], Scalar(0, 255, 0), 1);\n\t\t}\n\n\t\timshow(WINDOW_NAME, show);\n\t\twaitKey(1);\n\t}\n\t\n\treturn 0;\n}\n\nbool clockwise(vector<Point> contour)\n{\n\tint x_max = contour[0].x;\n\tint index = 0;\n\tfor (int i = 1; i < contour.size(); i++) {\n\t\tif (contour[i].x > x_max) {\n\t\t\tx_max = contour[i].x;\n\t\t\tindex = i;\n\t\t}\n\t}\n\tPoint a, b, c;\n\tif (index == 0) {\n\t\ta = contour.back();\n\t\tb = contour[0];\n\t\tc = contour[1];\n\t}\n\telse if (index == contour.size() - 1)\n\t{\n\t\ta = contour[contour.size() - 2];\n\t\tb = contour.back();\n\t\tc = contour[0];\n\t}\n\telse {\n\t\ta = contour[index - 1];\n\t\tb = contour[index];\n\t\tc = contour[index + 1];\n\t}\n\n\treturn ((b.x - a.x) * (c.y - b.y) - (b.y - a.y) * (c.x - b.x)) > 0 ? TRUE : FALSE;\n}\n\nvoid expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, float range) {\n\n\t\n\tif (clockwise(contour)) {\n\t\trange = -range;\n\t}\n\n\t\n\tvector<Point2f> dpList, ndpList;\n\tint count = contour.size();\n\tfor (int i = 0; i < count; i++) {\n\t\tint next = (i == (count - 1) ? 0 : (i + 1));\n\t\tdpList.push_back(contour.at(next) - contour.at(i));\n\t\tfloat unitLen = 1.0f / sqrt(dpList.at(i).dot(dpList.at(i)));\n\t\tndpList.push_back(dpList.at(i) * unitLen);\n\t\tcout << \"i=\" << i << \",pList:\" << contour.at(next) << \",\" << contour.at(i) << \",dpList:\" << dpList.at(i) << \",ndpList:\" << ndpList.at(i) << endl;\n\t}\n\n\t\n\tfor (int i = 0; i < count; i++) {\n\t\tint startIndex = (i == 0 ? (count - 1) : (i - 1));\n\t\tint endIndex = i;\n\t\tfloat sinTheta = ndpList.at(startIndex).cross(ndpList.at(endIndex));\n\t\tPoint2f orientVector = ndpList.at(endIndex) - ndpList.at(startIndex);\n\t\tPoint2f temp_out;\n\t\ttemp_out.x = contour.at(i).x + range / sinTheta * orientVector.x;\n\t\ttemp_out.y = contour.at(i).y + range / sinTheta * orientVector.y;\n\t\tcontour_exp.push_back(temp_out);\n\t}\n}\n"},"prefix":{"kind":"string","value":"#include <iostream>\n#include <Windows.h>\n#include <vector>\n#include <opencv2/opencv.hpp>\n\n#define CVUI_IMPLEMENTATION\n#include \"cvui.h\"\n\nusing namespace std;\nusing namespace cv;\n\n#define WINDOW_NAME \"Show\"\n\nbool clockwise(vector<Point> contour);\n\nvoid expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, float range);\n\nvoid on_Trackbar(int, void*)\n{\n\n}\n\nint main()\n{\n\tMat show(800, 800, CV_8UC3, Scalar(255,255,255));\n\tnamedWindow(WINDOW_NAME);\n\tcvui::init(WINDOW_NAME);\n\tint range=0;\n\t\n\t\n\tvector<Point> contours;\n\tcontours.push_back(Point(400, 650));\n\tcontours.push_back(Point(450, 600));\n\tcontours.push_back(Point(450, 450));\n\tcontours.push_back(Point(500, 450));\n\tcontours.push_back(Point(500, 400));\n\tcontours.push_back(Point(400, 400));\n\t\n\twhile (true)\n\t{\n\t\tshow= Mat(800, 800, CV_8UC3, Scalar(255, 255, 255));\n\t\t\n\t\tcvui::window(show, 200, 20, 400, 70, \"Setting\");\n\t\tcvui::trackbar(show, 250, 40, 300, &range, -100, 100);\n\t\tcvui::update();\n\t\tvector<Point> points_expand;\n\n\t\t\n\t\texpand_polygon(contours, points_expand, range);\n\n\t\t\n\t\tPoint vertex;\n\t\tfor (int i = 0; i < contours.size(); i++) {\n\t\t\tvertex.x = contours[i].x;\n\t\t\tvertex.y = contours[i].y;\n\t\t\tcircle(show, vertex, 2, Scalar(0, 255, 0), 1);\n\t\t\tostringstream indexText;\n\t\t\tindexText << i;\n\t\t\tputText(show, indexText.str(), vertex, cv::FONT_HERSHEY_DUPLEX, 0.5, cv::Scalar(0, 0, 255), 1);\n\t\t\tint next = (i == (contours.size() - 1) ? 0 : (i + 1));\n\t\t\tline(show, contours[i], contours[next], Scalar(0, 0, 255), 1);\n\t\t}\n\n\t\t\n\t\tfor (int i = 0; i < points_expand.size(); i++) {\n\t\t\tvertex.x = points_expand[i].x;\n\t\t\tvertex.y = points_expand[i].y;\n\t\t\tcircle(show, vertex, 2, Scalar(0, 255, 0), 1);\n\t\t\tostringstream indexText;\n\t\t\tindexText << i;\n\t\t\tputText(show, indexText.str(), vertex, cv::FONT_HERSHEY_DUPLEX, 0.5, cv::Scalar(0, 0, 255), 1);\n\t\t\tint next = (i == (points_expand.size() - 1) ? 0 : (i + 1));\n\t\t\tline(show, points_expand[i], points_expand[next], Scalar(0, 255, 0), 1);\n\t\t}\n\n\t\timshow(WINDOW_NAME, show);\n\t\twaitKey(1);\n\t}\n\t\n\treturn 0;\n}\n\n"},"suffix":{"kind":"string","value":"\n\nvoid expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, float range) {\n\n\t\n\tif (clockwise(contour)) {\n\t\trange = -range;\n\t}\n\n\t\n\tvector<Point2f> dpList, ndpList;\n\tint count = contour.size();\n\tfor (int i = 0; i < count; i++) {\n\t\tint next = (i == (count - 1) ? 0 : (i + 1));\n\t\tdpList.push_back(contour.at(next) - contour.at(i));\n\t\tfloat unitLen = 1.0f / sqrt(dpList.at(i).dot(dpList.at(i)));\n\t\tndpList.push_back(dpList.at(i) * unitLen);\n\t\tcout << \"i=\" << i << \",pList:\" << contour.at(next) << \",\" << contour.at(i) << \",dpList:\" << dpList.at(i) << \",ndpList:\" << ndpList.at(i) << endl;\n\t}\n\n\t\n\tfor (int i = 0; i < count; i++) {\n\t\tint startIndex = (i == 0 ? (count - 1) : (i - 1));\n\t\tint endIndex = i;\n\t\tfloat sinTheta = ndpList.at(startIndex).cross(ndpList.at(endIndex));\n\t\tPoint2f orientVector = ndpList.at(endIndex) - ndpList.at(startIndex);\n\t\tPoint2f temp_out;\n\t\ttemp_out.x = contour.at(i).x + range / sinTheta * orientVector.x;\n\t\ttemp_out.y = contour.at(i).y + range / sinTheta * orientVector.y;\n\t\tcontour_exp.push_back(temp_out);\n\t}\n}\n"},"middle":{"kind":"string","value":"bool clockwise(vector<Point> contour)\n{\n\tint x_max = contour[0].x;\n\tint index = 0;\n\tfor (int i = 1; i < contour.size(); i++) {\n\t\tif (contour[i].x > x_max) {\n\t\t\tx_max = contour[i].x;\n\t\t\tindex = i;\n\t\t}\n\t}\n\tPoint a, b, c;\n\tif (index == 0) {\n\t\ta = contour.back();\n\t\tb = contour[0];\n\t\tc = contour[1];\n\t}\n\telse if (index == contour.size() - 1)\n\t{\n\t\ta = contour[contour.size() - 2];\n\t\tb = contour.back();\n\t\tc = contour[0];\n\t}\n\telse {\n\t\ta = contour[index - 1];\n\t\tb = contour[index];\n\t\tc = contour[index + 1];\n\t}\n\n\treturn ((b.x - a.x) * (c.y - b.y) - (b.y - a.y) * (c.x - b.x)) > 0 ? TRUE : FALSE;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"# PolygonExpand\n\nEnlarging or reducing the polygon with trackbar\n\n\n\n\n\n****\n\n\t\n\n|Author|chh|\n\n|---|---\n\n|E-mail|chhsemail@gmail.com\n\n\n\n\n\n****\n\n# Requirements\n\n- Cmake\n\n- OpenCV\n\n- CVUI\n","file_path":"README.md","rank":7,"score":1.3153820310662991}],"string":"[\n {\n \"content\": \"# PolygonExpand\\n\\nEnlarging or reducing the polygon with trackbar\\n\\n\\n\\n\\n\\n****\\n\\n\\t\\n\\n|Author|chh|\\n\\n|---|---\\n\\n|E-mail|chhsemail@gmail.com\\n\\n\\n\\n\\n\\n****\\n\\n# Requirements\\n\\n- Cmake\\n\\n- OpenCV\\n\\n- CVUI\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 7,\n \"score\": 1.3153820310662991\n }\n]","isConversational":false}}},{"rowIdx":69,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"sources/cpp/ecs/src/game/main.cpp"},"repo_name":{"kind":"string","value":"xunilrj/sandbox"},"commit":{"kind":"string","value":"f92c12f83433cac01a885585e41c02bb5826a01f"},"file_code":{"kind":"string","value":"#include <deltaTime/deltaTime.h>\n#include <TaskSystem/TaskSystem.h>\n#include \"../ecs/ecs.h\"\n\nstruct PositionComponent\n{\n\tCOMPONENTID(1, DenseStore<PositionComponent>);\n\tfloat x, y, z;\n};\n\nstruct RigidBodyComponent\n{\n\tCOMPONENTID(2, DenseStore<RigidBodyComponent>);\n\tfloat vx, vy, vz;\n\tfloat ax, ay, az;\n};\n\nstruct EulerIntegratorSystem : System<DeltaTimeComponent, PositionComponent, RigidBodyComponent>\n{\n virtual void update() override\n {\n\t\tforeach([](DeltaTimeComponent& time, PositionComponent& pos, RigidBodyComponent& rb) {\n\t\t\tpos.x += rb.vx * time.dt;\n\t\t\tpos.y += rb.vy;\n\t\t\tpos.z += rb.vz;\n\n\t\t\trb.vx += rb.ax;\n\t\t\trb.vy += rb.ay;\n\t\t\trb.vz += rb.az;\n\t\t});\n }\n};\n\n#include <iostream>\n#include <iomanip>\n\nbool input_enabled = true;\nvoid enable_input(Scene& s) { input_enabled = true; }\nvoid disable_input(Scene& s) { input_enabled = false; }\n\nvoid animA(Scene& scene, EntityRef ref)\n{\n\tscene.call(0);\n\tauto anim1 = scene.build_anim()\n\t\t.then(AnimManager::lerp(1, 0, 1))\n\t\t.then(AnimManager::lerp(2, 1, 0.5));\n\tauto anim2 = scene.build_anim()\n\t\t.then(AnimManager::lerp(1, 0, 1));\n\n\tauto& anim_i1 = scene.start(anim1, ref, &PositionComponent::x);\n\tauto& anim_i2 = scene.start_after(anim2, ref, &PositionComponent::y, &anim_i1);\n\tscene.call(1, &anim_i2);\n}\n\nint main()\n{\n auto scene = Scene{};\n\tscene.add(0, disable_input);\n\tscene.add(1, enable_input);\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\t\n\t\n\t\n\t\n\tscene\n\t\t.add<EulerIntegratorSystem>();\n\t\n\n\t\n\tauto e1 = scene.build_entity()\n\t\t.set(PositionComponent{ 0, 0, 0 })\n\t\t.set(RigidBodyComponent{ 1, 0, 0, 0, 0, 0})\n\t\t.build();\n\n\tauto e2 = scene.build_entity()\n\t\t.set(PositionComponent{ 0, 0, 0 })\n\t\t.build();\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\tauto hStdout = GetStdHandle(STD_OUTPUT_HANDLE);\n\t\n\tdeltaTime<double> dt{ 16, true };\n\twhile (true)\n\t{\n\t\tauto elapsed = dt.step();\n\t\tif (elapsed > 0) {\n\t\t\t\n\t\t\tauto& int2 = scene.get<PositionComponent>(e2);\n\n\t\t\t\n\t\t\tif (input_enabled && (GetKeyState('A') & 0x8000))\n\t\t\t{\n\t\t\t\tanimA(scene, e2);\n\t\t\t}\n\n\t\t\tscene.set<DeltaTimeComponent>({ (float)(elapsed / 1000.0) });\n\t\t\tscene.update();\n\n\t\t\tstd::cout.precision(4);\n\t\t\tstd::cout << std::setw(4) << int2.x << \" \" << std::setw(4) << int2.y << std::endl;\n\t\t}\n\t}\n return 0;\n}"},"prefix":{"kind":"string","value":"#include <deltaTime/deltaTime.h>\n#include <TaskSystem/TaskSystem.h>\n#include \"../ecs/ecs.h\"\n\nstruct PositionComponent\n{\n\tCOMPONENTID(1, DenseStore<PositionComponent>);\n\tfloat x, y, z;\n};\n\nstruct RigidBodyComponent\n{\n\tCOMPONENTID(2, DenseStore<RigidBodyComponent>);\n\tfloat vx, vy, vz;\n\tfloat ax, ay, az;\n};\n\nstruct EulerIntegratorSystem : System<DeltaTimeComponent, PositionComponent, RigidBodyComponent>\n{\n virtua"},"suffix":{"kind":"string","value":"\n};\n\n#include <iostream>\n#include <iomanip>\n\nbool input_enabled = true;\nvoid enable_input(Scene& s) { input_enabled = true; }\nvoid disable_input(Scene& s) { input_enabled = false; }\n\nvoid animA(Scene& scene, EntityRef ref)\n{\n\tscene.call(0);\n\tauto anim1 = scene.build_anim()\n\t\t.then(AnimManager::lerp(1, 0, 1))\n\t\t.then(AnimManager::lerp(2, 1, 0.5));\n\tauto anim2 = scene.build_anim()\n\t\t.then(AnimManager::lerp(1, 0, 1));\n\n\tauto& anim_i1 = scene.start(anim1, ref, &PositionComponent::x);\n\tauto& anim_i2 = scene.start_after(anim2, ref, &PositionComponent::y, &anim_i1);\n\tscene.call(1, &anim_i2);\n}\n\nint main()\n{\n auto scene = Scene{};\n\tscene.add(0, disable_input);\n\tscene.add(1, enable_input);\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\t\n\t\n\t\n\t\n\tscene\n\t\t.add<EulerIntegratorSystem>();\n\t\n\n\t\n\tauto e1 = scene.build_entity()\n\t\t.set(PositionComponent{ 0, 0, 0 })\n\t\t.set(RigidBodyComponent{ 1, 0, 0, 0, 0, 0})\n\t\t.build();\n\n\tauto e2 = scene.build_entity()\n\t\t.set(PositionComponent{ 0, 0, 0 })\n\t\t.build();\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\tauto hStdout = GetStdHandle(STD_OUTPUT_HANDLE);\n\t\n\tdeltaTime<double> dt{ 16, true };\n\twhile (true)\n\t{\n\t\tauto elapsed = dt.step();\n\t\tif (elapsed > 0) {\n\t\t\t\n\t\t\tauto& int2 = scene.get<PositionComponent>(e2);\n\n\t\t\t\n\t\t\tif (input_enabled && (GetKeyState('A') & 0x8000))\n\t\t\t{\n\t\t\t\tanimA(scene, e2);\n\t\t\t}\n\n\t\t\tscene.set<DeltaTimeComponent>({ (float)(elapsed / 1000.0) });\n\t\t\tscene.update();\n\n\t\t\tstd::cout.precision(4);\n\t\t\tstd::cout << std::setw(4) << int2.x << \" \" << std::setw(4) << int2.y << std::endl;\n\t\t}\n\t}\n return 0;\n}"},"middle":{"kind":"string","value":"l void update() override\n {\n\t\tforeach([](DeltaTimeComponent& time, PositionComponent& pos, RigidBodyComponent& rb) {\n\t\t\tpos.x += rb.vx * time.dt;\n\t\t\tpos.y += rb.vy;\n\t\t\tpos.z += rb.vz;\n\n\t\t\trb.vx += rb.ax;\n\t\t\trb.vy += rb.ay;\n\t\t\trb.vz += rb.az;\n\t\t});\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"struct some_non_vectorizable_type { float x; };\n\n\n\nvoid test_first_aligned()\n\n{\n\n EIGEN_ALIGN16 float array_float[100];\n\n test_first_aligned_helper(array_float, 50);\n\n test_first_aligned_helper(array_float+1, 50);\n\n test_first_aligned_helper(array_float+2, 50);\n\n test_first_aligned_helper(array_float+3, 50);\n\n test_first_aligned_helper(array_float+4, 50);\n\n test_first_aligned_helper(array_float+5, 50);\n\n \n\n EIGEN_ALIGN16 double array_double[100];\n\n test_first_aligned_helper(array_double, 50);\n\n test_first_aligned_helper(array_double+1, 50);\n\n test_first_aligned_helper(array_double+2, 50);\n\n \n\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\n\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\n\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\n\n \n\n some_non_vectorizable_type array_nonvec[100];\n\n test_first_aligned_helper(array_nonvec, 100);\n\n test_none_aligned_helper(array_nonvec, 100);\n\n}\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/first_aligned.cpp","rank":0,"score":295447.3182155107},{"content":"struct some_non_vectorizable_type { float x; };\n\n\n\nvoid test_first_aligned()\n\n{\n\n EIGEN_ALIGN16 float array_float[100];\n\n test_first_aligned_helper(array_float, 50);\n\n test_first_aligned_helper(array_float+1, 50);\n\n test_first_aligned_helper(array_float+2, 50);\n\n test_first_aligned_helper(array_float+3, 50);\n\n test_first_aligned_helper(array_float+4, 50);\n\n test_first_aligned_helper(array_float+5, 50);\n\n \n\n EIGEN_ALIGN16 double array_double[100];\n\n test_first_aligned_helper(array_double, 50);\n\n test_first_aligned_helper(array_double+1, 50);\n\n test_first_aligned_helper(array_double+2, 50);\n\n \n\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\n\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\n\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\n\n \n\n some_non_vectorizable_type array_nonvec[100];\n\n test_first_aligned_helper(array_nonvec, 100);\n\n test_none_aligned_helper(array_nonvec, 100);\n\n}\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/first_aligned.cpp","rank":1,"score":295447.3182155107},{"content":"struct some_non_vectorizable_type { float x; };\n\n\n\nvoid test_first_aligned()\n\n{\n\n EIGEN_ALIGN16 float array_float[100];\n\n test_first_aligned_helper(array_float, 50);\n\n test_first_aligned_helper(array_float+1, 50);\n\n test_first_aligned_helper(array_float+2, 50);\n\n test_first_aligned_helper(array_float+3, 50);\n\n test_first_aligned_helper(array_float+4, 50);\n\n test_first_aligned_helper(array_float+5, 50);\n\n \n\n EIGEN_ALIGN16 double array_double[100];\n\n test_first_aligned_helper(array_double, 50);\n\n test_first_aligned_helper(array_double+1, 50);\n\n test_first_aligned_helper(array_double+2, 50);\n\n \n\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\n\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\n\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\n\n \n\n some_non_vectorizable_type array_nonvec[100];\n\n test_first_aligned_helper(array_nonvec, 100);\n\n test_none_aligned_helper(array_nonvec, 100);\n\n}\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/first_aligned.cpp","rank":2,"score":295447.3182155107},{"content":"struct some_non_vectorizable_type { float x; };\n\n\n\nvoid test_first_aligned()\n\n{\n\n EIGEN_ALIGN16 float array_float[100];\n\n test_first_aligned_helper(array_float, 50);\n\n test_first_aligned_helper(array_float+1, 50);\n\n test_first_aligned_helper(array_float+2, 50);\n\n test_first_aligned_helper(array_float+3, 50);\n\n test_first_aligned_helper(array_float+4, 50);\n\n test_first_aligned_helper(array_float+5, 50);\n\n \n\n EIGEN_ALIGN16 double array_double[100];\n\n test_first_aligned_helper(array_double, 50);\n\n test_first_aligned_helper(array_double+1, 50);\n\n test_first_aligned_helper(array_double+2, 50);\n\n \n\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\n\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\n\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\n\n \n\n some_non_vectorizable_type array_nonvec[100];\n\n test_first_aligned_helper(array_nonvec, 100);\n\n test_none_aligned_helper(array_nonvec, 100);\n\n}\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/first_aligned.cpp","rank":3,"score":295447.3182155107},{"content":"struct Converter<float> {\n\n static_assert(sizeof(float) == sizeof(int32_t), \"Important ULP matcher assumption violated\");\n\n Converter(float f) {\n\n std::memcpy(&i, &f, sizeof(f));\n\n }\n\n int32_t i;\n\n};\n\n\n\ntemplate <>\n","file_path":"sources/cpp/timer/sources/catch.hpp","rank":4,"score":226727.9206946654},{"content":"struct Converter<float> {\n\n static_assert(sizeof(float) == sizeof(int32_t), \"Important ULP matcher assumption violated\");\n\n Converter(float f) {\n\n std::memcpy(&i, &f, sizeof(f));\n\n }\n\n int32_t i;\n\n};\n\n\n\ntemplate <>\n","file_path":"sources/cpp/memory/tests/catch.hpp","rank":5,"score":226727.9206946654},{"content":"struct solve_retval<PastixBase<_MatrixType>, Rhs>\n\n : solve_retval_base<PastixBase<_MatrixType>, Rhs>\n\n{\n\n typedef PastixBase<_MatrixType> Dec;\n\n EIGEN_MAKE_SOLVE_HELPERS(Dec,Rhs)\n\n\n\n template<typename Dest> void evalTo(Dest& dst) const\n\n {\n\n dec()._solve(rhs(),dst);\n\n }\n\n};\n\n\n\ntemplate<typename _MatrixType, typename Rhs>\n","file_path":"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/PaStiXSupport/PaStiXSupport.h","rank":6,"score":204489.05083944715},{"content":"struct sparse_solve_retval<PastixBase<_MatrixType>, Rhs>\n\n : sparse_solve_retval_base<PastixBase<_MatrixType>, Rhs>\n\n{\n\n typedef PastixBase<_MatrixType> Dec;\n\n EIGEN_MAKE_SPARSE_SOLVE_HELPERS(Dec,Rhs)\n\n\n\n template<typename Dest> void evalTo(Dest& dst) const\n\n {\n\n this->defaultEvalTo(dst);\n\n }\n\n};\n\n\n\n} // end namespace internal\n\n\n\n} // end namespace Eigen\n\n\n\n#endif\n","file_path":"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/PaStiXSupport/PaStiXSupport.h","rank":7,"score":202256.72946800056},{"content":"// test compilation with both a struct and a class...\n\nstruct MyStruct\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n char dummychar;\n\n Vector4f avec;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/dynalloc.cpp","rank":8,"score":192538.42205712644},{"content":"// test compilation with both a struct and a class...\n\nstruct MyStruct\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n char dummychar;\n\n Vector4f avec;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/dynalloc.cpp","rank":9,"score":192538.42205712644},{"content":"// test compilation with both a struct and a class...\n\nstruct MyStruct\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n char dummychar;\n\n Vector4f avec;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/dynalloc.cpp","rank":10,"score":192538.42205712644},{"content":"// test compilation with both a struct and a class...\n\nstruct MyStruct\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n char dummychar;\n\n Vector4f avec;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/dynalloc.cpp","rank":11,"score":192538.42205712644},{"content":"struct ratio_string {\n\n static std::string symbol();\n\n};\n\n\n\ntemplate <class Ratio>\n\nstd::string ratio_string<Ratio>::symbol() {\n\n Catch::ReusableStringStream rss;\n\n rss << '[' << Ratio::num << '/'\n\n << Ratio::den << ']';\n\n return rss.str();\n\n}\n\ntemplate <>\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":12,"score":181092.24493297638},{"content":"struct NameAndTags {\n\n NameAndTags( StringRef const& name_ = StringRef(), StringRef const& tags_ = StringRef() ) noexcept;\n\n StringRef name;\n\n StringRef tags;\n\n};\n\n\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":13,"score":181092.24493297638},{"content":"struct SummaryColumn {\n\n\n\n SummaryColumn( std::string _label, Colour::Code _colour )\n\n : label( std::move( _label ) ),\n\n colour( _colour ) {}\n\n SummaryColumn addRow( std::size_t count ) {\n\n ReusableStringStream rss;\n\n rss << count;\n\n std::string row = rss.str();\n\n for (auto& oldRow : rows) {\n\n while (oldRow.size() < row.size())\n\n oldRow = ' ' + oldRow;\n\n while (oldRow.size() > row.size())\n\n row = ' ' + row;\n\n }\n\n rows.push_back(row);\n\n return *this;\n\n }\n\n\n\n std::string label;\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":14,"score":181092.24493297638},{"content":"struct ColumnInfo {\n\n enum Justification { Left, Right };\n\n std::string name;\n\n int width;\n\n Justification justification;\n\n};\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":15,"score":181092.24493297638},{"content":"struct ColumnBreak {};\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":16,"score":181092.24493297638},{"content":"struct RowBreak {};\n\n\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":17,"score":181092.24493297638},{"content":"// We need a dummy global operator<< so we can bring it into Catch namespace later\n\nstruct Catch_global_namespace_dummy {};\n\nstd::ostream& operator<<(std::ostream&, Catch_global_namespace_dummy);\n\n\n\nnamespace Catch {\n\n\n\n struct CaseSensitive { enum Choice {\n\n Yes,\n\n No\n\n }; };\n\n\n","file_path":"books/NumericalRecipesInC/include/catch.hpp","rank":18,"score":176097.12433691317},{"content":"struct TestNew2\n\n{\n\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\n\n // 8-byte alignment is good enough here, which we'll get automatically\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp","rank":19,"score":173741.78103820296},{"content":"struct loop_on_n\n\n{\n\n static void run()\n\n {\n\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\n\n \n\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int K, typename Scalar, int Mode>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/bench/product_threshold.cpp","rank":20,"score":173741.78103820296},{"content":"struct TestNew5\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\n\n Matrix4f m;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp","rank":21,"score":173741.78103820296},{"content":"struct TestNew6\n\n{\n\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\n\n float f;\n\n};\n\n\n\ntemplate<bool Align> struct Depends\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\n\n Vector2d m;\n\n float f;\n\n};\n\n\n\ntemplate<typename T>\n\nvoid check_unalignedassert_good()\n\n{\n\n T *x, *y;\n\n x = new T;\n\n delete x;\n\n y = new T[2];\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp","rank":22,"score":173741.78103820296},{"content":"struct TestNew6\n\n{\n\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\n\n float f;\n\n};\n\n\n\ntemplate<bool Align> struct Depends\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\n\n Vector2d m;\n\n float f;\n\n};\n\n\n\ntemplate<typename T>\n\nvoid check_unalignedassert_good()\n\n{\n\n T *x, *y;\n\n x = new T;\n\n delete x;\n\n y = new T[2];\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp","rank":23,"score":173741.78103820296},{"content":"struct TestNew4\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n Vector2d m;\n\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp","rank":24,"score":173741.78103820296},{"content":"struct other_matrix_type\n\n{\n\n typedef int type;\n\n};\n\n\n\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/swap.cpp","rank":25,"score":173741.78103820296},{"content":"struct TestNew1\n\n{\n\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\n\n TestNew1() : m(20,20) {}\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp","rank":26,"score":173741.78103820296},{"content":"struct Ball\n\n{\n\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\n\n\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n\n\n Ball() {}\n\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\n\n\n\n VectorType center;\n\n double radius;\n\n};\n\n\n\n\n\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\n\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\n\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\n\n\n\n\n\ntemplate<int Dim>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/BVH.cpp","rank":27,"score":173741.78103820296},{"content":"struct TestNew2\n\n{\n\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\n\n // 8-byte alignment is good enough here, which we'll get automatically\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp","rank":28,"score":173741.78103820296},{"content":"struct TestNew4\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n Vector2d m;\n\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp","rank":29,"score":173741.78103820296},{"content":"struct TestNew2\n\n{\n\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\n\n // 8-byte alignment is good enough here, which we'll get automatically\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp","rank":30,"score":173741.78103820296},{"content":"struct loop_on_m\n\n{\n\n static void run()\n\n {\n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\n\n std::cout << \"\\n\";\n\n \n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,-1>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M+1,N,K>::run();\n\n }\n\n};\n\n\n\ntemplate<int N, int K>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/bench/product_threshold.cpp","rank":31,"score":173741.78103820296},{"content":"struct loop_on_k\n\n{\n\n static void run()\n\n {\n\n std::cout << \"K=\" << K << \"\\t\";\n\n print_n<N>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M,N,K>::run();\n\n std::cout << \"\\n\\n\";\n\n\n\n loop_on_k<M,N,K+1>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int N>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/bench/product_threshold.cpp","rank":32,"score":173741.78103820296},{"content":"struct TestNew3\n\n{\n\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp","rank":33,"score":173741.78103820296},{"content":"struct TestNew3\n\n{\n\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp","rank":34,"score":173741.78103820296},{"content":"struct other_matrix_type\n\n{\n\n typedef int type;\n\n};\n\n\n\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/swap.cpp","rank":35,"score":173741.78103820296},{"content":"struct TestNew4\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n Vector2d m;\n\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp","rank":36,"score":173741.78103820296},{"content":"struct packet_helper\n\n{\n\n template<typename T>\n\n inline Packet load(const T* from) const { return ei_pload(from); }\n\n\n\n template<typename T>\n\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\n\n};\n\n\n\ntemplate<typename Packet>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/packetmath.cpp","rank":37,"score":173741.78103820296},{"content":"struct TestNew5\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\n\n Matrix4f m;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp","rank":38,"score":173741.78103820296},{"content":"struct other_matrix_type\n\n{\n\n typedef int type;\n\n};\n\n\n\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/swap.cpp","rank":39,"score":173741.78103820296},{"content":"struct loop_on_m\n\n{\n\n static void run()\n\n {\n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\n\n std::cout << \"\\n\";\n\n \n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,-1>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M+1,N,K>::run();\n\n }\n\n};\n\n\n\ntemplate<int N, int K>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/bench/product_threshold.cpp","rank":40,"score":173741.78103820296},{"content":"struct TestNew1\n\n{\n\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\n\n TestNew1() : m(20,20) {}\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp","rank":41,"score":173741.78103820296},{"content":"struct loop_on_n\n\n{\n\n static void run()\n\n {\n\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\n\n \n\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int K, typename Scalar, int Mode>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/bench/product_threshold.cpp","rank":42,"score":173741.78103820296},{"content":"struct TestNew4\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n Vector2d m;\n\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp","rank":43,"score":173741.78103820296},{"content":"struct TestNew6\n\n{\n\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\n\n float f;\n\n};\n\n\n\ntemplate<bool Align> struct Depends\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\n\n Vector2d m;\n\n float f;\n\n};\n\n\n\ntemplate<typename T>\n\nvoid check_unalignedassert_good()\n\n{\n\n T *x, *y;\n\n x = new T;\n\n delete x;\n\n y = new T[2];\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp","rank":44,"score":173741.78103820296},{"content":"struct TestNew3\n\n{\n\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp","rank":45,"score":173741.78103820296},{"content":"struct other_matrix_type\n\n{\n\n typedef int type;\n\n};\n\n\n\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/swap.cpp","rank":46,"score":173741.78103820296},{"content":"struct TestNew6\n\n{\n\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\n\n float f;\n\n};\n\n\n\ntemplate<bool Align> struct Depends\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\n\n Vector2d m;\n\n float f;\n\n};\n\n\n\ntemplate<typename T>\n\nvoid check_unalignedassert_good()\n\n{\n\n T *x, *y;\n\n x = new T;\n\n delete x;\n\n y = new T[2];\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp","rank":47,"score":173741.78103820296},{"content":"struct loop_on_k\n\n{\n\n static void run()\n\n {\n\n std::cout << \"K=\" << K << \"\\t\";\n\n print_n<N>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M,N,K>::run();\n\n std::cout << \"\\n\\n\";\n\n\n\n loop_on_k<M,N,K+1>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int N>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/bench/product_threshold.cpp","rank":48,"score":173741.78103820296},{"content":"struct loop_on_n\n\n{\n\n static void run()\n\n {\n\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\n\n \n\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int K, typename Scalar, int Mode>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/bench/product_threshold.cpp","rank":49,"score":173741.78103820296},{"content":"struct packet_helper\n\n{\n\n template<typename T>\n\n inline Packet load(const T* from) const { return ei_pload(from); }\n\n\n\n template<typename T>\n\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\n\n};\n\n\n\ntemplate<typename Packet>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/packetmath.cpp","rank":50,"score":173741.78103820296},{"content":"struct loop_on_m\n\n{\n\n static void run()\n\n {\n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\n\n std::cout << \"\\n\";\n\n \n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,-1>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M+1,N,K>::run();\n\n }\n\n};\n\n\n\ntemplate<int N, int K>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/bench/product_threshold.cpp","rank":51,"score":173741.78103820296},{"content":"struct packet_helper\n\n{\n\n template<typename T>\n\n inline Packet load(const T* from) const { return ei_pload(from); }\n\n\n\n template<typename T>\n\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\n\n};\n\n\n\ntemplate<typename Packet>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/packetmath.cpp","rank":52,"score":173741.78103820296},{"content":"struct loop_on_m\n\n{\n\n static void run()\n\n {\n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\n\n std::cout << \"\\n\";\n\n \n\n std::cout << M << \"f\\t\";\n\n loop_on_n<M,N,K,float,-1>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M+1,N,K>::run();\n\n }\n\n};\n\n\n\ntemplate<int N, int K>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/bench/product_threshold.cpp","rank":53,"score":173741.78103820296},{"content":"struct TestNew5\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\n\n Matrix4f m;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp","rank":54,"score":173741.78103820296},{"content":"struct loop_on_k\n\n{\n\n static void run()\n\n {\n\n std::cout << \"K=\" << K << \"\\t\";\n\n print_n<N>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M,N,K>::run();\n\n std::cout << \"\\n\\n\";\n\n\n\n loop_on_k<M,N,K+1>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int N>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/bench/product_threshold.cpp","rank":55,"score":173741.78103820296},{"content":"struct Ball\n\n{\n\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\n\n\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n\n\n Ball() {}\n\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\n\n\n\n VectorType center;\n\n double radius;\n\n};\n\n\n\n\n\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\n\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\n\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\n\n\n\n\n\ntemplate<int Dim>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/BVH.cpp","rank":56,"score":173741.78103820296},{"content":"struct TestNew1\n\n{\n\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\n\n TestNew1() : m(20,20) {}\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp","rank":57,"score":173741.78103820296},{"content":"struct TestNew1\n\n{\n\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\n\n TestNew1() : m(20,20) {}\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp","rank":58,"score":173741.78103820296},{"content":"struct loop_on_n\n\n{\n\n static void run()\n\n {\n\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\n\n \n\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int K, typename Scalar, int Mode>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/bench/product_threshold.cpp","rank":59,"score":173741.78103820296},{"content":"struct loop_on_k\n\n{\n\n static void run()\n\n {\n\n std::cout << \"K=\" << K << \"\\t\";\n\n print_n<N>::run();\n\n std::cout << \"\\n\";\n\n\n\n loop_on_m<M,N,K>::run();\n\n std::cout << \"\\n\\n\";\n\n\n\n loop_on_k<M,N,K+1>::run();\n\n }\n\n};\n\n\n\ntemplate<int M, int N>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/bench/product_threshold.cpp","rank":60,"score":173741.78103820296},{"content":"struct TestNew2\n\n{\n\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\n\n // 8-byte alignment is good enough here, which we'll get automatically\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp","rank":61,"score":173741.78103820296},{"content":"struct packet_helper\n\n{\n\n template<typename T>\n\n inline Packet load(const T* from) const { return ei_pload(from); }\n\n\n\n template<typename T>\n\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\n\n};\n\n\n\ntemplate<typename Packet>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/test/packetmath.cpp","rank":62,"score":173741.78103820296},{"content":"struct TestNew5\n\n{\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\n\n Matrix4f m;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp","rank":63,"score":173741.78103820296},{"content":"struct Ball\n\n{\n\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\n\n\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n\n\n Ball() {}\n\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\n\n\n\n VectorType center;\n\n double radius;\n\n};\n\n\n\n\n\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\n\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\n\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\n\n\n\n\n\ntemplate<int Dim>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/BVH.cpp","rank":64,"score":173741.78103820296},{"content":"struct TestNew3\n\n{\n\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp","rank":65,"score":173741.78103820296},{"content":"struct Ball\n\n{\n\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\n\n\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n\n\n Ball() {}\n\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\n\n\n\n VectorType center;\n\n double radius;\n\n};\n\n\n\n\n\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\n\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\n\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\n\n\n\n\n\ntemplate<int Dim>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/BVH.cpp","rank":66,"score":173741.78103820296},{"content":"struct TreeTest\n\n{\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\n\n typedef Ball<Dim> BallType;\n\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\n\n typedef AlignedBox<double, Dim> BoxType;\n\n\n\n void testIntersect1()\n\n {\n\n BallTypeList b;\n\n for(int i = 0; i < 500; ++i) {\n\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\n\n }\n\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\n\n\n\n VectorType pt = VectorType::Random();\n\n BallPointStuff<Dim> i1(pt), i2(pt);\n\n\n\n for(int i = 0; i < (int)b.size(); ++i)\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/BVH.cpp","rank":67,"score":171474.18478234523},{"content":"struct TestFunc1\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n int m_inputs, m_values;\n\n\n\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n template<typename T>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/autodiff.cpp","rank":68,"score":171474.18478234523},{"content":"struct Functor\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n \n\n int m_inputs, m_values;\n\n \n\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n \n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/NumericalDiff.cpp","rank":69,"score":171474.18478234523},{"content":"struct transform_traits\n\n{\n\n enum\n\n {\n\n Dim = Transform::Dim,\n\n HDim = Transform::HDim,\n\n Mode = Transform::Mode,\n\n IsProjective = (int(Mode)==int(Projective))\n\n };\n\n};\n\n\n\ntemplate< typename TransformType,\n\n typename MatrixType,\n\n int Case = transform_traits<TransformType>::IsProjective ? 0\n\n : int(MatrixType::RowsAtCompileTime) == int(transform_traits<TransformType>::HDim) ? 1\n\n : 2>\n","file_path":"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Geometry/Transform.h","rank":70,"score":171474.18478234523},{"content":"struct IOFormat\n\n{\n\n /** Default contructor, see class IOFormat for the meaning of the parameters */\n\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\n\n const std::string& _coeffSeparator = \" \",\n\n const std::string& _rowSeparator = \"\\n\", const std::string& _rowPrefix=\"\", const std::string& _rowSuffix=\"\",\n\n const std::string& _matPrefix=\"\", const std::string& _matSuffix=\"\")\n\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\n\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\n\n {\n\n rowSpacer = \"\";\n\n int i = int(matSuffix.length())-1;\n\n while (i>=0 && matSuffix[i]!='\\n')\n\n {\n\n rowSpacer += ' ';\n\n i--;\n\n }\n\n }\n\n std::string matPrefix, matSuffix;\n\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/Eigen/src/Core/IO.h","rank":71,"score":171474.18478234523},{"content":"struct IOFormat\n\n{\n\n /** Default contructor, see class IOFormat for the meaning of the parameters */\n\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\n\n const std::string& _coeffSeparator = \" \",\n\n const std::string& _rowSeparator = \"\\n\", const std::string& _rowPrefix=\"\", const std::string& _rowSuffix=\"\",\n\n const std::string& _matPrefix=\"\", const std::string& _matSuffix=\"\")\n\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\n\n rowSpacer(\"\"), coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\n\n {\n\n int i = int(matSuffix.length())-1;\n\n while (i>=0 && matSuffix[i]!='\\n')\n\n {\n\n rowSpacer += ' ';\n\n i--;\n\n }\n\n }\n\n std::string matPrefix, matSuffix;\n\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\n\n std::string coeffSeparator;\n","file_path":"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Core/IO.h","rank":72,"score":171474.18478234523},{"content":"struct TestFunc1\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n int m_inputs, m_values;\n\n\n\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n template<typename T>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/autodiff.cpp","rank":73,"score":171474.18478234523},{"content":"struct TestFunc1\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n int m_inputs, m_values;\n\n\n\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n template<typename T>\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/autodiff.cpp","rank":74,"score":171474.18478234523},{"content":"struct contributor\n\n{\n\n string name;\n\n int changedlines;\n\n int changesets;\n\n string url;\n\n string misc;\n\n \n\n contributor() : changedlines(0), changesets(0) {}\n\n \n\n bool operator < (const contributor& other)\n\n {\n\n return lastname(name).compare(lastname(other.name)) < 0;\n\n }\n\n};\n\n\n\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\n\n{\n\n string line;\n\n ifstream online_info;\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/scripts/eigen_gen_credits.cpp","rank":75,"score":171474.18478234523},{"content":"struct TreeTest\n\n{\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\n\n typedef Ball<Dim> BallType;\n\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\n\n typedef AlignedBox<double, Dim> BoxType;\n\n\n\n void testIntersect1()\n\n {\n\n BallTypeList b;\n\n for(int i = 0; i < 500; ++i) {\n\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\n\n }\n\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\n\n\n\n VectorType pt = VectorType::Random();\n\n BallPointStuff<Dim> i1(pt), i2(pt);\n\n\n\n for(int i = 0; i < (int)b.size(); ++i)\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/BVH.cpp","rank":76,"score":171474.18478234523},{"content":"struct IOFormat\n\n{\n\n /** Default contructor, see class IOFormat for the meaning of the parameters */\n\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\n\n const std::string& _coeffSeparator = \" \",\n\n const std::string& _rowSeparator = \"\\n\", const std::string& _rowPrefix=\"\", const std::string& _rowSuffix=\"\",\n\n const std::string& _matPrefix=\"\", const std::string& _matSuffix=\"\")\n\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\n\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\n\n {\n\n rowSpacer = \"\";\n\n int i = int(matSuffix.length())-1;\n\n while (i>=0 && matSuffix[i]!='\\n')\n\n {\n\n rowSpacer += ' ';\n\n i--;\n\n }\n\n }\n\n std::string matPrefix, matSuffix;\n\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/Eigen/src/Core/IO.h","rank":77,"score":171474.18478234523},{"content":"struct contributor\n\n{\n\n string name;\n\n int changedlines;\n\n int changesets;\n\n string url;\n\n string misc;\n\n \n\n contributor() : changedlines(0), changesets(0) {}\n\n \n\n bool operator < (const contributor& other)\n\n {\n\n return lastname(name).compare(lastname(other.name)) < 0;\n\n }\n\n};\n\n\n\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\n\n{\n\n string line;\n\n ifstream online_info;\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/scripts/eigen_gen_credits.cpp","rank":78,"score":171474.18478234523},{"content":"struct Functor\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n \n\n int m_inputs, m_values;\n\n \n\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n \n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/NumericalDiff.cpp","rank":79,"score":171474.18478234523},{"content":"struct IOFormat\n\n{\n\n /** Default contructor, see class IOFormat for the meaning of the parameters */\n\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\n\n const std::string& _coeffSeparator = \" \",\n\n const std::string& _rowSeparator = \"\\n\", const std::string& _rowPrefix=\"\", const std::string& _rowSuffix=\"\",\n\n const std::string& _matPrefix=\"\", const std::string& _matSuffix=\"\")\n\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\n\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\n\n {\n\n rowSpacer = \"\";\n\n int i = int(matSuffix.length())-1;\n\n while (i>=0 && matSuffix[i]!='\\n')\n\n {\n\n rowSpacer += ' ';\n\n i--;\n\n }\n\n }\n\n std::string matPrefix, matSuffix;\n\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/Eigen/src/Core/IO.h","rank":80,"score":171474.18478234523},{"content":"struct TreeTest\n\n{\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\n\n typedef Ball<Dim> BallType;\n\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\n\n typedef AlignedBox<double, Dim> BoxType;\n\n\n\n void testIntersect1()\n\n {\n\n BallTypeList b;\n\n for(int i = 0; i < 500; ++i) {\n\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\n\n }\n\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\n\n\n\n VectorType pt = VectorType::Random();\n\n BallPointStuff<Dim> i1(pt), i2(pt);\n\n\n\n for(int i = 0; i < (int)b.size(); ++i)\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/BVH.cpp","rank":81,"score":171474.18478234523},{"content":"struct Functor\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n \n\n int m_inputs, m_values;\n\n \n\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n \n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/NumericalDiff.cpp","rank":82,"score":171474.18478234523},{"content":"struct IOFormat\n\n{\n\n /** Default contructor, see class IOFormat for the meaning of the parameters */\n\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\n\n const std::string& _coeffSeparator = \" \",\n\n const std::string& _rowSeparator = \"\\n\", const std::string& _rowPrefix=\"\", const std::string& _rowSuffix=\"\",\n\n const std::string& _matPrefix=\"\", const std::string& _matSuffix=\"\")\n\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\n\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\n\n {\n\n rowSpacer = \"\";\n\n int i = int(matSuffix.length())-1;\n\n while (i>=0 && matSuffix[i]!='\\n')\n\n {\n\n rowSpacer += ' ';\n\n i--;\n\n }\n\n }\n\n std::string matPrefix, matSuffix;\n\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/Eigen/src/Core/IO.h","rank":83,"score":171474.18478234523},{"content":"struct TreeTest\n\n{\n\n typedef Matrix<double, Dim, 1> VectorType;\n\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\n\n typedef Ball<Dim> BallType;\n\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\n\n typedef AlignedBox<double, Dim> BoxType;\n\n\n\n void testIntersect1()\n\n {\n\n BallTypeList b;\n\n for(int i = 0; i < 500; ++i) {\n\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\n\n }\n\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\n\n\n\n VectorType pt = VectorType::Random();\n\n BallPointStuff<Dim> i1(pt), i2(pt);\n\n\n\n for(int i = 0; i < (int)b.size(); ++i)\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/BVH.cpp","rank":84,"score":171474.18478234523},{"content":"struct contributor\n\n{\n\n string name;\n\n int changedlines;\n\n int changesets;\n\n string url;\n\n string misc;\n\n \n\n contributor() : changedlines(0), changesets(0) {}\n\n \n\n bool operator < (const contributor& other)\n\n {\n\n return lastname(name).compare(lastname(other.name)) < 0;\n\n }\n\n};\n\n\n\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\n\n{\n\n string line;\n\n ifstream online_info;\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/scripts/eigen_gen_credits.cpp","rank":85,"score":171474.18478234523},{"content":"struct TestFunc1\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n int m_inputs, m_values;\n\n\n\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n template<typename T>\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/autodiff.cpp","rank":86,"score":171474.18478234523},{"content":"struct Functor\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n \n\n int m_inputs, m_values;\n\n \n\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n \n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/NumericalDiff.cpp","rank":87,"score":171474.18478234523},{"content":"struct contributor\n\n{\n\n string name;\n\n int changedlines;\n\n int changesets;\n\n string url;\n\n string misc;\n\n \n\n contributor() : changedlines(0), changesets(0) {}\n\n \n\n bool operator < (const contributor& other)\n\n {\n\n return lastname(name).compare(lastname(other.name)) < 0;\n\n }\n\n};\n\n\n\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\n\n{\n\n string line;\n\n ifstream online_info;\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/scripts/eigen_gen_credits.cpp","rank":88,"score":171474.18478234523},{"content":"class f77_interface<float> : public f77_interface_base<float>\n\n{\n\npublic :\n\n\n\n static inline std::string name( void )\n\n {\n\n return \"F77\";\n\n }\n\n\n\n\n\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\n\n {\n\n smxv_(A,&N,B,&N,X);\n\n }\n\n\n\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\n\n {\n\n smxm_(A,&N,B,&N,X,&N);\n\n }\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/bench/btl/libs/f77/f77_interface.hh","rank":89,"score":169895.97645125183},{"content":"class f77_interface<float> : public f77_interface_base<float>\n\n{\n\npublic :\n\n\n\n static inline std::string name( void )\n\n {\n\n return \"F77\";\n\n }\n\n\n\n\n\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\n\n {\n\n smxv_(A,&N,B,&N,X);\n\n }\n\n\n\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\n\n {\n\n smxm_(A,&N,B,&N,X,&N);\n\n }\n\n\n","file_path":"courses/columbia-cg-animation/week01/include/eigen/bench/btl/libs/f77/f77_interface.hh","rank":90,"score":169895.97645125183},{"content":"class f77_interface<float> : public f77_interface_base<float>\n\n{\n\npublic :\n\n\n\n static inline std::string name( void )\n\n {\n\n return \"F77\";\n\n }\n\n\n\n\n\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\n\n {\n\n smxv_(A,&N,B,&N,X);\n\n }\n\n\n\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\n\n {\n\n smxm_(A,&N,B,&N,X,&N);\n\n }\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/bench/btl/libs/f77/f77_interface.hh","rank":91,"score":169895.97645125183},{"content":"class f77_interface<float> : public f77_interface_base<float>\n\n{\n\npublic :\n\n\n\n static inline std::string name( void )\n\n {\n\n return \"F77\";\n\n }\n\n\n\n\n\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\n\n {\n\n smxv_(A,&N,B,&N,X);\n\n }\n\n\n\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\n\n {\n\n smxm_(A,&N,B,&N,X,&N);\n\n }\n\n\n","file_path":"courses/columbia-cg-animation/week02/include/eigen/bench/btl/libs/f77/f77_interface.hh","rank":92,"score":169895.97645125183},{"content":"struct Functor\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n const int m_inputs, m_values;\n\n\n\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n // you should define that in the subclass :\n\n// void operator() (const InputType& x, ValueType* v, JacobianType* _j=0) const;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/NonLinearOptimization.cpp","rank":93,"score":169289.52178377594},{"content":"struct TestFunc1\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n int m_inputs, m_values;\n\n\n\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n template<typename T>\n","file_path":"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/forward_adolc.cpp","rank":94,"score":169289.52178377594},{"content":"struct significant_decimals_impl\n\n : significant_decimals_default_impl<Scalar, NumTraits<Scalar>::IsInteger>\n\n{};\n\n\n\n/** \\internal\n\n * print the matrix \\a _m to the output stream \\a s using the output format \\a fmt */\n\ntemplate<typename Derived>\n\nstd::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat& fmt)\n\n{\n\n if(_m.size() == 0)\n\n {\n\n s << fmt.matPrefix << fmt.matSuffix;\n\n return s;\n\n }\n\n \n\n typename Derived::Nested m = _m;\n\n typedef typename Derived::Scalar Scalar;\n\n typedef typename Derived::Index Index;\n\n\n\n Index width = 0;\n","file_path":"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Core/IO.h","rank":95,"score":169289.52178377594},{"content":"struct ProductReturnType\n\n{\n\n // TODO use the nested type to reduce instanciations ????\n\n// typedef typename ei_nested<Lhs,Rhs::ColsAtCompileTime>::type LhsNested;\n\n// typedef typename ei_nested<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;\n\n\n\n typedef GeneralProduct<Lhs/*Nested*/, Rhs/*Nested*/, ProductType> Type;\n\n};\n\n\n\ntemplate<typename Lhs, typename Rhs>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/Eigen/src/Core/Product.h","rank":96,"score":169289.52178377594},{"content":"struct member_redux {\n\n typedef typename result_of<\n\n BinaryOp(Scalar)\n\n >::type result_type;\n\n template<typename _Scalar, int Size> struct Cost\n\n { enum { value = (Size-1) * functor_traits<BinaryOp>::Cost }; };\n\n member_redux(const BinaryOp func) : m_functor(func) {}\n\n template<typename Derived>\n\n inline result_type operator()(const DenseBase<Derived>& mat) const\n\n { return mat.redux(m_functor); }\n\n const BinaryOp m_functor;\n\n};\n\n}\n\n\n\n/** \\class VectorwiseOp\n\n * \\ingroup Core_Module\n\n *\n\n * \\brief Pseudo expression providing partial reduction operations\n\n *\n\n * \\param ExpressionType the type of the object on which to do partial reductions\n","file_path":"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Core/VectorwiseOp.h","rank":97,"score":169289.52178377594},{"content":"struct ei_gemv_selector;\n\n\n\ntemplate<typename Lhs, typename Rhs>\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/Eigen/src/Core/Product.h","rank":98,"score":169289.52178377594},{"content":"struct Functor\n\n{\n\n typedef _Scalar Scalar;\n\n enum {\n\n InputsAtCompileTime = NX,\n\n ValuesAtCompileTime = NY\n\n };\n\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\n\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\n\n\n\n const int m_inputs, m_values;\n\n\n\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\n\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\n\n\n\n int inputs() const { return m_inputs; }\n\n int values() const { return m_values; }\n\n\n\n // you should define that in the subclass :\n\n// void operator() (const InputType& x, ValueType* v, JacobianType* _j=0) const;\n\n};\n\n\n","file_path":"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/NonLinearOptimization.cpp","rank":99,"score":169289.52178377594}],"string":"[\n {\n \"content\": \"struct some_non_vectorizable_type { float x; };\\n\\n\\n\\nvoid test_first_aligned()\\n\\n{\\n\\n EIGEN_ALIGN16 float array_float[100];\\n\\n test_first_aligned_helper(array_float, 50);\\n\\n test_first_aligned_helper(array_float+1, 50);\\n\\n test_first_aligned_helper(array_float+2, 50);\\n\\n test_first_aligned_helper(array_float+3, 50);\\n\\n test_first_aligned_helper(array_float+4, 50);\\n\\n test_first_aligned_helper(array_float+5, 50);\\n\\n \\n\\n EIGEN_ALIGN16 double array_double[100];\\n\\n test_first_aligned_helper(array_double, 50);\\n\\n test_first_aligned_helper(array_double+1, 50);\\n\\n test_first_aligned_helper(array_double+2, 50);\\n\\n \\n\\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\\n\\n \\n\\n some_non_vectorizable_type array_nonvec[100];\\n\\n test_first_aligned_helper(array_nonvec, 100);\\n\\n test_none_aligned_helper(array_nonvec, 100);\\n\\n}\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/first_aligned.cpp\",\n \"rank\": 0,\n \"score\": 295447.3182155107\n },\n {\n \"content\": \"struct some_non_vectorizable_type { float x; };\\n\\n\\n\\nvoid test_first_aligned()\\n\\n{\\n\\n EIGEN_ALIGN16 float array_float[100];\\n\\n test_first_aligned_helper(array_float, 50);\\n\\n test_first_aligned_helper(array_float+1, 50);\\n\\n test_first_aligned_helper(array_float+2, 50);\\n\\n test_first_aligned_helper(array_float+3, 50);\\n\\n test_first_aligned_helper(array_float+4, 50);\\n\\n test_first_aligned_helper(array_float+5, 50);\\n\\n \\n\\n EIGEN_ALIGN16 double array_double[100];\\n\\n test_first_aligned_helper(array_double, 50);\\n\\n test_first_aligned_helper(array_double+1, 50);\\n\\n test_first_aligned_helper(array_double+2, 50);\\n\\n \\n\\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\\n\\n \\n\\n some_non_vectorizable_type array_nonvec[100];\\n\\n test_first_aligned_helper(array_nonvec, 100);\\n\\n test_none_aligned_helper(array_nonvec, 100);\\n\\n}\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/first_aligned.cpp\",\n \"rank\": 1,\n \"score\": 295447.3182155107\n },\n {\n \"content\": \"struct some_non_vectorizable_type { float x; };\\n\\n\\n\\nvoid test_first_aligned()\\n\\n{\\n\\n EIGEN_ALIGN16 float array_float[100];\\n\\n test_first_aligned_helper(array_float, 50);\\n\\n test_first_aligned_helper(array_float+1, 50);\\n\\n test_first_aligned_helper(array_float+2, 50);\\n\\n test_first_aligned_helper(array_float+3, 50);\\n\\n test_first_aligned_helper(array_float+4, 50);\\n\\n test_first_aligned_helper(array_float+5, 50);\\n\\n \\n\\n EIGEN_ALIGN16 double array_double[100];\\n\\n test_first_aligned_helper(array_double, 50);\\n\\n test_first_aligned_helper(array_double+1, 50);\\n\\n test_first_aligned_helper(array_double+2, 50);\\n\\n \\n\\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\\n\\n \\n\\n some_non_vectorizable_type array_nonvec[100];\\n\\n test_first_aligned_helper(array_nonvec, 100);\\n\\n test_none_aligned_helper(array_nonvec, 100);\\n\\n}\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/first_aligned.cpp\",\n \"rank\": 2,\n \"score\": 295447.3182155107\n },\n {\n \"content\": \"struct some_non_vectorizable_type { float x; };\\n\\n\\n\\nvoid test_first_aligned()\\n\\n{\\n\\n EIGEN_ALIGN16 float array_float[100];\\n\\n test_first_aligned_helper(array_float, 50);\\n\\n test_first_aligned_helper(array_float+1, 50);\\n\\n test_first_aligned_helper(array_float+2, 50);\\n\\n test_first_aligned_helper(array_float+3, 50);\\n\\n test_first_aligned_helper(array_float+4, 50);\\n\\n test_first_aligned_helper(array_float+5, 50);\\n\\n \\n\\n EIGEN_ALIGN16 double array_double[100];\\n\\n test_first_aligned_helper(array_double, 50);\\n\\n test_first_aligned_helper(array_double+1, 50);\\n\\n test_first_aligned_helper(array_double+2, 50);\\n\\n \\n\\n double *array_double_plus_4_bytes = (double*)(size_t(array_double)+4);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes, 50);\\n\\n test_none_aligned_helper(array_double_plus_4_bytes+1, 50);\\n\\n \\n\\n some_non_vectorizable_type array_nonvec[100];\\n\\n test_first_aligned_helper(array_nonvec, 100);\\n\\n test_none_aligned_helper(array_nonvec, 100);\\n\\n}\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/first_aligned.cpp\",\n \"rank\": 3,\n \"score\": 295447.3182155107\n },\n {\n \"content\": \"struct Converter<float> {\\n\\n static_assert(sizeof(float) == sizeof(int32_t), \\\"Important ULP matcher assumption violated\\\");\\n\\n Converter(float f) {\\n\\n std::memcpy(&i, &f, sizeof(f));\\n\\n }\\n\\n int32_t i;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"sources/cpp/timer/sources/catch.hpp\",\n \"rank\": 4,\n \"score\": 226727.9206946654\n },\n {\n \"content\": \"struct Converter<float> {\\n\\n static_assert(sizeof(float) == sizeof(int32_t), \\\"Important ULP matcher assumption violated\\\");\\n\\n Converter(float f) {\\n\\n std::memcpy(&i, &f, sizeof(f));\\n\\n }\\n\\n int32_t i;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"sources/cpp/memory/tests/catch.hpp\",\n \"rank\": 5,\n \"score\": 226727.9206946654\n },\n {\n \"content\": \"struct solve_retval<PastixBase<_MatrixType>, Rhs>\\n\\n : solve_retval_base<PastixBase<_MatrixType>, Rhs>\\n\\n{\\n\\n typedef PastixBase<_MatrixType> Dec;\\n\\n EIGEN_MAKE_SOLVE_HELPERS(Dec,Rhs)\\n\\n\\n\\n template<typename Dest> void evalTo(Dest& dst) const\\n\\n {\\n\\n dec()._solve(rhs(),dst);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<typename _MatrixType, typename Rhs>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/PaStiXSupport/PaStiXSupport.h\",\n \"rank\": 6,\n \"score\": 204489.05083944715\n },\n {\n \"content\": \"struct sparse_solve_retval<PastixBase<_MatrixType>, Rhs>\\n\\n : sparse_solve_retval_base<PastixBase<_MatrixType>, Rhs>\\n\\n{\\n\\n typedef PastixBase<_MatrixType> Dec;\\n\\n EIGEN_MAKE_SPARSE_SOLVE_HELPERS(Dec,Rhs)\\n\\n\\n\\n template<typename Dest> void evalTo(Dest& dst) const\\n\\n {\\n\\n this->defaultEvalTo(dst);\\n\\n }\\n\\n};\\n\\n\\n\\n} // end namespace internal\\n\\n\\n\\n} // end namespace Eigen\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/PaStiXSupport/PaStiXSupport.h\",\n \"rank\": 7,\n \"score\": 202256.72946800056\n },\n {\n \"content\": \"// test compilation with both a struct and a class...\\n\\nstruct MyStruct\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n char dummychar;\\n\\n Vector4f avec;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/dynalloc.cpp\",\n \"rank\": 8,\n \"score\": 192538.42205712644\n },\n {\n \"content\": \"// test compilation with both a struct and a class...\\n\\nstruct MyStruct\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n char dummychar;\\n\\n Vector4f avec;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/dynalloc.cpp\",\n \"rank\": 9,\n \"score\": 192538.42205712644\n },\n {\n \"content\": \"// test compilation with both a struct and a class...\\n\\nstruct MyStruct\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n char dummychar;\\n\\n Vector4f avec;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/dynalloc.cpp\",\n \"rank\": 10,\n \"score\": 192538.42205712644\n },\n {\n \"content\": \"// test compilation with both a struct and a class...\\n\\nstruct MyStruct\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n char dummychar;\\n\\n Vector4f avec;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/dynalloc.cpp\",\n \"rank\": 11,\n \"score\": 192538.42205712644\n },\n {\n \"content\": \"struct ratio_string {\\n\\n static std::string symbol();\\n\\n};\\n\\n\\n\\ntemplate <class Ratio>\\n\\nstd::string ratio_string<Ratio>::symbol() {\\n\\n Catch::ReusableStringStream rss;\\n\\n rss << '[' << Ratio::num << '/'\\n\\n << Ratio::den << ']';\\n\\n return rss.str();\\n\\n}\\n\\ntemplate <>\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 12,\n \"score\": 181092.24493297638\n },\n {\n \"content\": \"struct NameAndTags {\\n\\n NameAndTags( StringRef const& name_ = StringRef(), StringRef const& tags_ = StringRef() ) noexcept;\\n\\n StringRef name;\\n\\n StringRef tags;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 13,\n \"score\": 181092.24493297638\n },\n {\n \"content\": \"struct SummaryColumn {\\n\\n\\n\\n SummaryColumn( std::string _label, Colour::Code _colour )\\n\\n : label( std::move( _label ) ),\\n\\n colour( _colour ) {}\\n\\n SummaryColumn addRow( std::size_t count ) {\\n\\n ReusableStringStream rss;\\n\\n rss << count;\\n\\n std::string row = rss.str();\\n\\n for (auto& oldRow : rows) {\\n\\n while (oldRow.size() < row.size())\\n\\n oldRow = ' ' + oldRow;\\n\\n while (oldRow.size() > row.size())\\n\\n row = ' ' + row;\\n\\n }\\n\\n rows.push_back(row);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n std::string label;\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 14,\n \"score\": 181092.24493297638\n },\n {\n \"content\": \"struct ColumnInfo {\\n\\n enum Justification { Left, Right };\\n\\n std::string name;\\n\\n int width;\\n\\n Justification justification;\\n\\n};\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 15,\n \"score\": 181092.24493297638\n },\n {\n \"content\": \"struct ColumnBreak {};\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 16,\n \"score\": 181092.24493297638\n },\n {\n \"content\": \"struct RowBreak {};\\n\\n\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 17,\n \"score\": 181092.24493297638\n },\n {\n \"content\": \"// We need a dummy global operator<< so we can bring it into Catch namespace later\\n\\nstruct Catch_global_namespace_dummy {};\\n\\nstd::ostream& operator<<(std::ostream&, Catch_global_namespace_dummy);\\n\\n\\n\\nnamespace Catch {\\n\\n\\n\\n struct CaseSensitive { enum Choice {\\n\\n Yes,\\n\\n No\\n\\n }; };\\n\\n\\n\",\n \"file_path\": \"books/NumericalRecipesInC/include/catch.hpp\",\n \"rank\": 18,\n \"score\": 176097.12433691317\n },\n {\n \"content\": \"struct TestNew2\\n\\n{\\n\\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\\n\\n // 8-byte alignment is good enough here, which we'll get automatically\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 19,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_n\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\\n\\n \\n\\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int K, typename Scalar, int Mode>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 20,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew5\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\\n\\n Matrix4f m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 21,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew6\\n\\n{\\n\\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<bool Align> struct Depends\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\\n\\n Vector2d m;\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nvoid check_unalignedassert_good()\\n\\n{\\n\\n T *x, *y;\\n\\n x = new T;\\n\\n delete x;\\n\\n y = new T[2];\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 22,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew6\\n\\n{\\n\\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<bool Align> struct Depends\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\\n\\n Vector2d m;\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nvoid check_unalignedassert_good()\\n\\n{\\n\\n T *x, *y;\\n\\n x = new T;\\n\\n delete x;\\n\\n y = new T[2];\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 23,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew4\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n Vector2d m;\\n\\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 24,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct other_matrix_type\\n\\n{\\n\\n typedef int type;\\n\\n};\\n\\n\\n\\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/swap.cpp\",\n \"rank\": 25,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew1\\n\\n{\\n\\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\\n\\n TestNew1() : m(20,20) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 26,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct Ball\\n\\n{\\n\\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\\n\\n\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n\\n\\n Ball() {}\\n\\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\\n\\n\\n\\n VectorType center;\\n\\n double radius;\\n\\n};\\n\\n\\n\\n\\n\\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\\n\\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\\n\\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\\n\\n\\n\\n\\n\\ntemplate<int Dim>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 27,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew2\\n\\n{\\n\\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\\n\\n // 8-byte alignment is good enough here, which we'll get automatically\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 28,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew4\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n Vector2d m;\\n\\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 29,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew2\\n\\n{\\n\\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\\n\\n // 8-byte alignment is good enough here, which we'll get automatically\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 30,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_m\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n \\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,-1>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M+1,N,K>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int N, int K>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 31,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_k\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << \\\"K=\\\" << K << \\\"\\\\t\\\";\\n\\n print_n<N>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M,N,K>::run();\\n\\n std::cout << \\\"\\\\n\\\\n\\\";\\n\\n\\n\\n loop_on_k<M,N,K+1>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int N>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 32,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew3\\n\\n{\\n\\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 33,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew3\\n\\n{\\n\\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 34,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct other_matrix_type\\n\\n{\\n\\n typedef int type;\\n\\n};\\n\\n\\n\\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/swap.cpp\",\n \"rank\": 35,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew4\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n Vector2d m;\\n\\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 36,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct packet_helper\\n\\n{\\n\\n template<typename T>\\n\\n inline Packet load(const T* from) const { return ei_pload(from); }\\n\\n\\n\\n template<typename T>\\n\\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\\n\\n};\\n\\n\\n\\ntemplate<typename Packet>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/packetmath.cpp\",\n \"rank\": 37,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew5\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\\n\\n Matrix4f m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 38,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct other_matrix_type\\n\\n{\\n\\n typedef int type;\\n\\n};\\n\\n\\n\\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/swap.cpp\",\n \"rank\": 39,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_m\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n \\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,-1>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M+1,N,K>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int N, int K>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 40,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew1\\n\\n{\\n\\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\\n\\n TestNew1() : m(20,20) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 41,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_n\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\\n\\n \\n\\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int K, typename Scalar, int Mode>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 42,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew4\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n Vector2d m;\\n\\n float f; // make the struct have sizeof%16!=0 to make it a little more tricky when we allow an array of 2 such objects\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 43,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew6\\n\\n{\\n\\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<bool Align> struct Depends\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\\n\\n Vector2d m;\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nvoid check_unalignedassert_good()\\n\\n{\\n\\n T *x, *y;\\n\\n x = new T;\\n\\n delete x;\\n\\n y = new T[2];\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 44,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew3\\n\\n{\\n\\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 45,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct other_matrix_type\\n\\n{\\n\\n typedef int type;\\n\\n};\\n\\n\\n\\ntemplate<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/swap.cpp\",\n \"rank\": 46,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew6\\n\\n{\\n\\n Matrix<float,2,2,DontAlign> m; // good: no alignment requested\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<bool Align> struct Depends\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(Align)\\n\\n Vector2d m;\\n\\n float f;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nvoid check_unalignedassert_good()\\n\\n{\\n\\n T *x, *y;\\n\\n x = new T;\\n\\n delete x;\\n\\n y = new T[2];\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 47,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_k\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << \\\"K=\\\" << K << \\\"\\\\t\\\";\\n\\n print_n<N>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M,N,K>::run();\\n\\n std::cout << \\\"\\\\n\\\\n\\\";\\n\\n\\n\\n loop_on_k<M,N,K+1>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int N>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 48,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_n\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\\n\\n \\n\\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int K, typename Scalar, int Mode>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 49,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct packet_helper\\n\\n{\\n\\n template<typename T>\\n\\n inline Packet load(const T* from) const { return ei_pload(from); }\\n\\n\\n\\n template<typename T>\\n\\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\\n\\n};\\n\\n\\n\\ntemplate<typename Packet>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/packetmath.cpp\",\n \"rank\": 50,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_m\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n \\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,-1>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M+1,N,K>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int N, int K>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 51,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct packet_helper\\n\\n{\\n\\n template<typename T>\\n\\n inline Packet load(const T* from) const { return ei_pload(from); }\\n\\n\\n\\n template<typename T>\\n\\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\\n\\n};\\n\\n\\n\\ntemplate<typename Packet>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/packetmath.cpp\",\n \"rank\": 52,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_m\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,CoeffBasedProductMode>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n \\n\\n std::cout << M << \\\"f\\\\t\\\";\\n\\n loop_on_n<M,N,K,float,-1>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M+1,N,K>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int N, int K>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 53,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew5\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\\n\\n Matrix4f m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 54,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_k\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << \\\"K=\\\" << K << \\\"\\\\t\\\";\\n\\n print_n<N>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M,N,K>::run();\\n\\n std::cout << \\\"\\\\n\\\\n\\\";\\n\\n\\n\\n loop_on_k<M,N,K+1>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int N>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 55,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct Ball\\n\\n{\\n\\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\\n\\n\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n\\n\\n Ball() {}\\n\\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\\n\\n\\n\\n VectorType center;\\n\\n double radius;\\n\\n};\\n\\n\\n\\n\\n\\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\\n\\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\\n\\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\\n\\n\\n\\n\\n\\ntemplate<int Dim>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 56,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew1\\n\\n{\\n\\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\\n\\n TestNew1() : m(20,20) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 57,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew1\\n\\n{\\n\\n MatrixXd m; // good: m will allocate its own array, taking care of alignment.\\n\\n TestNew1() : m(20,20) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 58,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_n\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();\\n\\n \\n\\n loop_on_n<M,N+1,K,Scalar,Mode>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int K, typename Scalar, int Mode>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 59,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct loop_on_k\\n\\n{\\n\\n static void run()\\n\\n {\\n\\n std::cout << \\\"K=\\\" << K << \\\"\\\\t\\\";\\n\\n print_n<N>::run();\\n\\n std::cout << \\\"\\\\n\\\";\\n\\n\\n\\n loop_on_m<M,N,K>::run();\\n\\n std::cout << \\\"\\\\n\\\\n\\\";\\n\\n\\n\\n loop_on_k<M,N,K+1>::run();\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<int M, int N>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/bench/product_threshold.cpp\",\n \"rank\": 60,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew2\\n\\n{\\n\\n Matrix3d m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned,\\n\\n // 8-byte alignment is good enough here, which we'll get automatically\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 61,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct packet_helper\\n\\n{\\n\\n template<typename T>\\n\\n inline Packet load(const T* from) const { return ei_pload(from); }\\n\\n\\n\\n template<typename T>\\n\\n inline void store(T* to, const Packet& x) const { ei_pstore(to,x); }\\n\\n};\\n\\n\\n\\ntemplate<typename Packet>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/test/packetmath.cpp\",\n \"rank\": 62,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew5\\n\\n{\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n float f; // try the f at first -- the EIGEN_ALIGN16 attribute of m should make that still work\\n\\n Matrix4f m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 63,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct Ball\\n\\n{\\n\\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\\n\\n\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n\\n\\n Ball() {}\\n\\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\\n\\n\\n\\n VectorType center;\\n\\n double radius;\\n\\n};\\n\\n\\n\\n\\n\\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\\n\\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\\n\\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\\n\\n\\n\\n\\n\\ntemplate<int Dim>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 64,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TestNew3\\n\\n{\\n\\n Vector2f m; // good: m's size isn't a multiple of 16 bytes, so m doesn't have to be 16-byte aligned\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/test/unalignedassert.cpp\",\n \"rank\": 65,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct Ball\\n\\n{\\n\\nEIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(double, Dim)\\n\\n\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n\\n\\n Ball() {}\\n\\n Ball(const VectorType &c, double r) : center(c), radius(r) {}\\n\\n\\n\\n VectorType center;\\n\\n double radius;\\n\\n};\\n\\n\\n\\n\\n\\ntemplate<typename Scalar, int Dim> AlignedBox<Scalar, Dim> ei_bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }\\n\\ntemplate<int Dim> AlignedBox<double, Dim> ei_bounding_box(const Ball<Dim> &b)\\n\\n{ return AlignedBox<double, Dim>(b.center.array() - b.radius, b.center.array() + b.radius); }\\n\\n\\n\\n\\n\\ntemplate<int Dim>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 66,\n \"score\": 173741.78103820296\n },\n {\n \"content\": \"struct TreeTest\\n\\n{\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\\n\\n typedef Ball<Dim> BallType;\\n\\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\\n\\n typedef AlignedBox<double, Dim> BoxType;\\n\\n\\n\\n void testIntersect1()\\n\\n {\\n\\n BallTypeList b;\\n\\n for(int i = 0; i < 500; ++i) {\\n\\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\\n\\n }\\n\\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\\n\\n\\n\\n VectorType pt = VectorType::Random();\\n\\n BallPointStuff<Dim> i1(pt), i2(pt);\\n\\n\\n\\n for(int i = 0; i < (int)b.size(); ++i)\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 67,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TestFunc1\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n int m_inputs, m_values;\\n\\n\\n\\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/autodiff.cpp\",\n \"rank\": 68,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct Functor\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n \\n\\n int m_inputs, m_values;\\n\\n \\n\\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n \\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/NumericalDiff.cpp\",\n \"rank\": 69,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct transform_traits\\n\\n{\\n\\n enum\\n\\n {\\n\\n Dim = Transform::Dim,\\n\\n HDim = Transform::HDim,\\n\\n Mode = Transform::Mode,\\n\\n IsProjective = (int(Mode)==int(Projective))\\n\\n };\\n\\n};\\n\\n\\n\\ntemplate< typename TransformType,\\n\\n typename MatrixType,\\n\\n int Case = transform_traits<TransformType>::IsProjective ? 0\\n\\n : int(MatrixType::RowsAtCompileTime) == int(transform_traits<TransformType>::HDim) ? 1\\n\\n : 2>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Geometry/Transform.h\",\n \"rank\": 70,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct IOFormat\\n\\n{\\n\\n /** Default contructor, see class IOFormat for the meaning of the parameters */\\n\\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\\n\\n const std::string& _coeffSeparator = \\\" \\\",\\n\\n const std::string& _rowSeparator = \\\"\\\\n\\\", const std::string& _rowPrefix=\\\"\\\", const std::string& _rowSuffix=\\\"\\\",\\n\\n const std::string& _matPrefix=\\\"\\\", const std::string& _matSuffix=\\\"\\\")\\n\\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\\n\\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\\n\\n {\\n\\n rowSpacer = \\\"\\\";\\n\\n int i = int(matSuffix.length())-1;\\n\\n while (i>=0 && matSuffix[i]!='\\\\n')\\n\\n {\\n\\n rowSpacer += ' ';\\n\\n i--;\\n\\n }\\n\\n }\\n\\n std::string matPrefix, matSuffix;\\n\\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/Eigen/src/Core/IO.h\",\n \"rank\": 71,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct IOFormat\\n\\n{\\n\\n /** Default contructor, see class IOFormat for the meaning of the parameters */\\n\\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\\n\\n const std::string& _coeffSeparator = \\\" \\\",\\n\\n const std::string& _rowSeparator = \\\"\\\\n\\\", const std::string& _rowPrefix=\\\"\\\", const std::string& _rowSuffix=\\\"\\\",\\n\\n const std::string& _matPrefix=\\\"\\\", const std::string& _matSuffix=\\\"\\\")\\n\\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\\n\\n rowSpacer(\\\"\\\"), coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\\n\\n {\\n\\n int i = int(matSuffix.length())-1;\\n\\n while (i>=0 && matSuffix[i]!='\\\\n')\\n\\n {\\n\\n rowSpacer += ' ';\\n\\n i--;\\n\\n }\\n\\n }\\n\\n std::string matPrefix, matSuffix;\\n\\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\\n\\n std::string coeffSeparator;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Core/IO.h\",\n \"rank\": 72,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TestFunc1\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n int m_inputs, m_values;\\n\\n\\n\\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/autodiff.cpp\",\n \"rank\": 73,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TestFunc1\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n int m_inputs, m_values;\\n\\n\\n\\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/autodiff.cpp\",\n \"rank\": 74,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct contributor\\n\\n{\\n\\n string name;\\n\\n int changedlines;\\n\\n int changesets;\\n\\n string url;\\n\\n string misc;\\n\\n \\n\\n contributor() : changedlines(0), changesets(0) {}\\n\\n \\n\\n bool operator < (const contributor& other)\\n\\n {\\n\\n return lastname(name).compare(lastname(other.name)) < 0;\\n\\n }\\n\\n};\\n\\n\\n\\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\\n\\n{\\n\\n string line;\\n\\n ifstream online_info;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/scripts/eigen_gen_credits.cpp\",\n \"rank\": 75,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TreeTest\\n\\n{\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\\n\\n typedef Ball<Dim> BallType;\\n\\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\\n\\n typedef AlignedBox<double, Dim> BoxType;\\n\\n\\n\\n void testIntersect1()\\n\\n {\\n\\n BallTypeList b;\\n\\n for(int i = 0; i < 500; ++i) {\\n\\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\\n\\n }\\n\\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\\n\\n\\n\\n VectorType pt = VectorType::Random();\\n\\n BallPointStuff<Dim> i1(pt), i2(pt);\\n\\n\\n\\n for(int i = 0; i < (int)b.size(); ++i)\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 76,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct IOFormat\\n\\n{\\n\\n /** Default contructor, see class IOFormat for the meaning of the parameters */\\n\\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\\n\\n const std::string& _coeffSeparator = \\\" \\\",\\n\\n const std::string& _rowSeparator = \\\"\\\\n\\\", const std::string& _rowPrefix=\\\"\\\", const std::string& _rowSuffix=\\\"\\\",\\n\\n const std::string& _matPrefix=\\\"\\\", const std::string& _matSuffix=\\\"\\\")\\n\\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\\n\\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\\n\\n {\\n\\n rowSpacer = \\\"\\\";\\n\\n int i = int(matSuffix.length())-1;\\n\\n while (i>=0 && matSuffix[i]!='\\\\n')\\n\\n {\\n\\n rowSpacer += ' ';\\n\\n i--;\\n\\n }\\n\\n }\\n\\n std::string matPrefix, matSuffix;\\n\\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/Eigen/src/Core/IO.h\",\n \"rank\": 77,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct contributor\\n\\n{\\n\\n string name;\\n\\n int changedlines;\\n\\n int changesets;\\n\\n string url;\\n\\n string misc;\\n\\n \\n\\n contributor() : changedlines(0), changesets(0) {}\\n\\n \\n\\n bool operator < (const contributor& other)\\n\\n {\\n\\n return lastname(name).compare(lastname(other.name)) < 0;\\n\\n }\\n\\n};\\n\\n\\n\\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\\n\\n{\\n\\n string line;\\n\\n ifstream online_info;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/scripts/eigen_gen_credits.cpp\",\n \"rank\": 78,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct Functor\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n \\n\\n int m_inputs, m_values;\\n\\n \\n\\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n \\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/NumericalDiff.cpp\",\n \"rank\": 79,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct IOFormat\\n\\n{\\n\\n /** Default contructor, see class IOFormat for the meaning of the parameters */\\n\\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\\n\\n const std::string& _coeffSeparator = \\\" \\\",\\n\\n const std::string& _rowSeparator = \\\"\\\\n\\\", const std::string& _rowPrefix=\\\"\\\", const std::string& _rowSuffix=\\\"\\\",\\n\\n const std::string& _matPrefix=\\\"\\\", const std::string& _matSuffix=\\\"\\\")\\n\\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\\n\\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\\n\\n {\\n\\n rowSpacer = \\\"\\\";\\n\\n int i = int(matSuffix.length())-1;\\n\\n while (i>=0 && matSuffix[i]!='\\\\n')\\n\\n {\\n\\n rowSpacer += ' ';\\n\\n i--;\\n\\n }\\n\\n }\\n\\n std::string matPrefix, matSuffix;\\n\\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/Eigen/src/Core/IO.h\",\n \"rank\": 80,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TreeTest\\n\\n{\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\\n\\n typedef Ball<Dim> BallType;\\n\\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\\n\\n typedef AlignedBox<double, Dim> BoxType;\\n\\n\\n\\n void testIntersect1()\\n\\n {\\n\\n BallTypeList b;\\n\\n for(int i = 0; i < 500; ++i) {\\n\\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\\n\\n }\\n\\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\\n\\n\\n\\n VectorType pt = VectorType::Random();\\n\\n BallPointStuff<Dim> i1(pt), i2(pt);\\n\\n\\n\\n for(int i = 0; i < (int)b.size(); ++i)\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 81,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct Functor\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n \\n\\n int m_inputs, m_values;\\n\\n \\n\\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n \\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/NumericalDiff.cpp\",\n \"rank\": 82,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct IOFormat\\n\\n{\\n\\n /** Default contructor, see class IOFormat for the meaning of the parameters */\\n\\n IOFormat(int _precision = StreamPrecision, int _flags = 0,\\n\\n const std::string& _coeffSeparator = \\\" \\\",\\n\\n const std::string& _rowSeparator = \\\"\\\\n\\\", const std::string& _rowPrefix=\\\"\\\", const std::string& _rowSuffix=\\\"\\\",\\n\\n const std::string& _matPrefix=\\\"\\\", const std::string& _matSuffix=\\\"\\\")\\n\\n : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator),\\n\\n coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags)\\n\\n {\\n\\n rowSpacer = \\\"\\\";\\n\\n int i = int(matSuffix.length())-1;\\n\\n while (i>=0 && matSuffix[i]!='\\\\n')\\n\\n {\\n\\n rowSpacer += ' ';\\n\\n i--;\\n\\n }\\n\\n }\\n\\n std::string matPrefix, matSuffix;\\n\\n std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/Eigen/src/Core/IO.h\",\n \"rank\": 83,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TreeTest\\n\\n{\\n\\n typedef Matrix<double, Dim, 1> VectorType;\\n\\n typedef std::vector<VectorType, aligned_allocator<VectorType> > VectorTypeList;\\n\\n typedef Ball<Dim> BallType;\\n\\n typedef std::vector<BallType, aligned_allocator<BallType> > BallTypeList;\\n\\n typedef AlignedBox<double, Dim> BoxType;\\n\\n\\n\\n void testIntersect1()\\n\\n {\\n\\n BallTypeList b;\\n\\n for(int i = 0; i < 500; ++i) {\\n\\n b.push_back(BallType(VectorType::Random(), 0.5 * ei_random(0., 1.)));\\n\\n }\\n\\n KdBVH<double, Dim, BallType> tree(b.begin(), b.end());\\n\\n\\n\\n VectorType pt = VectorType::Random();\\n\\n BallPointStuff<Dim> i1(pt), i2(pt);\\n\\n\\n\\n for(int i = 0; i < (int)b.size(); ++i)\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/unsupported/test/BVH.cpp\",\n \"rank\": 84,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct contributor\\n\\n{\\n\\n string name;\\n\\n int changedlines;\\n\\n int changesets;\\n\\n string url;\\n\\n string misc;\\n\\n \\n\\n contributor() : changedlines(0), changesets(0) {}\\n\\n \\n\\n bool operator < (const contributor& other)\\n\\n {\\n\\n return lastname(name).compare(lastname(other.name)) < 0;\\n\\n }\\n\\n};\\n\\n\\n\\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\\n\\n{\\n\\n string line;\\n\\n ifstream online_info;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/scripts/eigen_gen_credits.cpp\",\n \"rank\": 85,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct TestFunc1\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n int m_inputs, m_values;\\n\\n\\n\\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/unsupported/test/autodiff.cpp\",\n \"rank\": 86,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct Functor\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n \\n\\n int m_inputs, m_values;\\n\\n \\n\\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n \\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/NumericalDiff.cpp\",\n \"rank\": 87,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"struct contributor\\n\\n{\\n\\n string name;\\n\\n int changedlines;\\n\\n int changesets;\\n\\n string url;\\n\\n string misc;\\n\\n \\n\\n contributor() : changedlines(0), changesets(0) {}\\n\\n \\n\\n bool operator < (const contributor& other)\\n\\n {\\n\\n return lastname(name).compare(lastname(other.name)) < 0;\\n\\n }\\n\\n};\\n\\n\\n\\nvoid add_online_info_into_contributors_list(list<contributor>& contributors_list, const char *filename)\\n\\n{\\n\\n string line;\\n\\n ifstream online_info;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/scripts/eigen_gen_credits.cpp\",\n \"rank\": 88,\n \"score\": 171474.18478234523\n },\n {\n \"content\": \"class f77_interface<float> : public f77_interface_base<float>\\n\\n{\\n\\npublic :\\n\\n\\n\\n static inline std::string name( void )\\n\\n {\\n\\n return \\\"F77\\\";\\n\\n }\\n\\n\\n\\n\\n\\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\\n\\n {\\n\\n smxv_(A,&N,B,&N,X);\\n\\n }\\n\\n\\n\\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\\n\\n {\\n\\n smxm_(A,&N,B,&N,X,&N);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/bench/btl/libs/f77/f77_interface.hh\",\n \"rank\": 89,\n \"score\": 169895.97645125183\n },\n {\n \"content\": \"class f77_interface<float> : public f77_interface_base<float>\\n\\n{\\n\\npublic :\\n\\n\\n\\n static inline std::string name( void )\\n\\n {\\n\\n return \\\"F77\\\";\\n\\n }\\n\\n\\n\\n\\n\\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\\n\\n {\\n\\n smxv_(A,&N,B,&N,X);\\n\\n }\\n\\n\\n\\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\\n\\n {\\n\\n smxm_(A,&N,B,&N,X,&N);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week01/include/eigen/bench/btl/libs/f77/f77_interface.hh\",\n \"rank\": 90,\n \"score\": 169895.97645125183\n },\n {\n \"content\": \"class f77_interface<float> : public f77_interface_base<float>\\n\\n{\\n\\npublic :\\n\\n\\n\\n static inline std::string name( void )\\n\\n {\\n\\n return \\\"F77\\\";\\n\\n }\\n\\n\\n\\n\\n\\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\\n\\n {\\n\\n smxv_(A,&N,B,&N,X);\\n\\n }\\n\\n\\n\\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\\n\\n {\\n\\n smxm_(A,&N,B,&N,X,&N);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/bench/btl/libs/f77/f77_interface.hh\",\n \"rank\": 91,\n \"score\": 169895.97645125183\n },\n {\n \"content\": \"class f77_interface<float> : public f77_interface_base<float>\\n\\n{\\n\\npublic :\\n\\n\\n\\n static inline std::string name( void )\\n\\n {\\n\\n return \\\"F77\\\";\\n\\n }\\n\\n\\n\\n\\n\\n static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)\\n\\n {\\n\\n smxv_(A,&N,B,&N,X);\\n\\n }\\n\\n\\n\\n static inline void matrix_matrix_product(gene_matrix & A, gene_matrix & B, gene_matrix & X, int N)\\n\\n {\\n\\n smxm_(A,&N,B,&N,X,&N);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week02/include/eigen/bench/btl/libs/f77/f77_interface.hh\",\n \"rank\": 92,\n \"score\": 169895.97645125183\n },\n {\n \"content\": \"struct Functor\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n const int m_inputs, m_values;\\n\\n\\n\\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n // you should define that in the subclass :\\n\\n// void operator() (const InputType& x, ValueType* v, JacobianType* _j=0) const;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/NonLinearOptimization.cpp\",\n \"rank\": 93,\n \"score\": 169289.52178377594\n },\n {\n \"content\": \"struct TestFunc1\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n int m_inputs, m_values;\\n\\n\\n\\n TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week04/include/eigen/unsupported/test/forward_adolc.cpp\",\n \"rank\": 94,\n \"score\": 169289.52178377594\n },\n {\n \"content\": \"struct significant_decimals_impl\\n\\n : significant_decimals_default_impl<Scalar, NumTraits<Scalar>::IsInteger>\\n\\n{};\\n\\n\\n\\n/** \\\\internal\\n\\n * print the matrix \\\\a _m to the output stream \\\\a s using the output format \\\\a fmt */\\n\\ntemplate<typename Derived>\\n\\nstd::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat& fmt)\\n\\n{\\n\\n if(_m.size() == 0)\\n\\n {\\n\\n s << fmt.matPrefix << fmt.matSuffix;\\n\\n return s;\\n\\n }\\n\\n \\n\\n typename Derived::Nested m = _m;\\n\\n typedef typename Derived::Scalar Scalar;\\n\\n typedef typename Derived::Index Index;\\n\\n\\n\\n Index width = 0;\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Core/IO.h\",\n \"rank\": 95,\n \"score\": 169289.52178377594\n },\n {\n \"content\": \"struct ProductReturnType\\n\\n{\\n\\n // TODO use the nested type to reduce instanciations ????\\n\\n// typedef typename ei_nested<Lhs,Rhs::ColsAtCompileTime>::type LhsNested;\\n\\n// typedef typename ei_nested<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;\\n\\n\\n\\n typedef GeneralProduct<Lhs/*Nested*/, Rhs/*Nested*/, ProductType> Type;\\n\\n};\\n\\n\\n\\ntemplate<typename Lhs, typename Rhs>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/Eigen/src/Core/Product.h\",\n \"rank\": 96,\n \"score\": 169289.52178377594\n },\n {\n \"content\": \"struct member_redux {\\n\\n typedef typename result_of<\\n\\n BinaryOp(Scalar)\\n\\n >::type result_type;\\n\\n template<typename _Scalar, int Size> struct Cost\\n\\n { enum { value = (Size-1) * functor_traits<BinaryOp>::Cost }; };\\n\\n member_redux(const BinaryOp func) : m_functor(func) {}\\n\\n template<typename Derived>\\n\\n inline result_type operator()(const DenseBase<Derived>& mat) const\\n\\n { return mat.redux(m_functor); }\\n\\n const BinaryOp m_functor;\\n\\n};\\n\\n}\\n\\n\\n\\n/** \\\\class VectorwiseOp\\n\\n * \\\\ingroup Core_Module\\n\\n *\\n\\n * \\\\brief Pseudo expression providing partial reduction operations\\n\\n *\\n\\n * \\\\param ExpressionType the type of the object on which to do partial reductions\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week03/include/eigen/Eigen/src/Core/VectorwiseOp.h\",\n \"rank\": 97,\n \"score\": 169289.52178377594\n },\n {\n \"content\": \"struct ei_gemv_selector;\\n\\n\\n\\ntemplate<typename Lhs, typename Rhs>\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/Eigen/src/Core/Product.h\",\n \"rank\": 98,\n \"score\": 169289.52178377594\n },\n {\n \"content\": \"struct Functor\\n\\n{\\n\\n typedef _Scalar Scalar;\\n\\n enum {\\n\\n InputsAtCompileTime = NX,\\n\\n ValuesAtCompileTime = NY\\n\\n };\\n\\n typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;\\n\\n typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;\\n\\n\\n\\n const int m_inputs, m_values;\\n\\n\\n\\n Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {}\\n\\n Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {}\\n\\n\\n\\n int inputs() const { return m_inputs; }\\n\\n int values() const { return m_values; }\\n\\n\\n\\n // you should define that in the subclass :\\n\\n// void operator() (const InputType& x, ValueType* v, JacobianType* _j=0) const;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"courses/columbia-cg-animation/week05/include/eigen/unsupported/test/NonLinearOptimization.cpp\",\n \"rank\": 99,\n \"score\": 169289.52178377594\n }\n]","isConversational":false}}},{"rowIdx":70,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"uarm/src/swiftpro_rviz_node2.cpp"},"repo_name":{"kind":"string","value":"iamrajee/ROS"},"commit":{"kind":"string","value":"c8b0f09db9624f4d06e86a0b0e12df4f0471ca86"},"file_code":{"kind":"string","value":"#include <string>\n#include <ros/ros.h>\n#include <std_msgs/String.h>\n#include <swiftpro/SwiftproState.h>\n#include <sensor_msgs/JointState.h>\n#include <tf/transform_broadcaster.h>\n\n#define MATH_PI \t\t\t\t3.141592653589793238463\n#define MATH_TRANS \t\t\t57.2958 \n#define MATH_L1 \t\t\t\t106.6\n#define MATH_L2 \t\t\t\t13.2\n#define MATH_LOWER_ARM \t\t\t142.07\n#define MATH_UPPER_ARM \t\t\t158.81\t\n#define MATH_UPPER_LOWER \t\t(MATH_UPPER_ARM / MATH_LOWER_ARM)\n\n#define LOWER_ARM_MAX_ANGLE 135.6\n#define LOWER_ARM_MIN_ANGLE 0\n#define UPPER_ARM_MAX_ANGLE 100.7\n#define UPPER_ARM_MIN_ANGLE 0\n#define LOWER_UPPER_MAX_ANGLE 151\n#define LOWER_UPPER_MIN_ANGLE 10\n\nfloat joint_angle[9] = {0.0};\t\t\n\nvoid all_joints_state(float angle[3])\n{\n\tdouble alpha2;\n\tdouble alpha3;\n\t\n\talpha2 = angle[1];\n\talpha3 = angle[2] - 3.8;\n\t\n\t\n\tjoint_angle[0] = angle[0] - 90;\n\tjoint_angle[1] = 90 - alpha2;\n\tjoint_angle[5] = alpha3;\n\n\t\n\tjoint_angle[2] = (alpha2 + alpha3) - 176.11 + 90;\n\tjoint_angle[3] = -90 + alpha2;\n\tjoint_angle[4] = joint_angle[1];\n\tjoint_angle[6] = 90 - (alpha2 + alpha3);\n\tjoint_angle[7] = 176.11 - 180 - alpha3;\n\tjoint_angle[8] = 48.39 + alpha3 - 44.55;\n}\n\nbool swiftpro_ik(float position[3], float angle[3])\n{\n\tfloat x = position[0];\n\tfloat y = position[1];\n\tfloat z = position[2];\n\tfloat xIn, zIn, phi, rightAll, sqrtZX = 0.0;\n\tfloat angleRot, angleLeft, angleRight = 0.0;\n\t\n\tz += 74.55;\n\tzIn = (z - MATH_L1) / MATH_LOWER_ARM;\n\t\n\tif (x < 0.1)\n\t\tx = 0.1;\n\n\t\n\tif (y == 0)\n\t\tangleRot = 90;\n\telse if (y < 0)\n\t\tangleRot = -atan(x / y) * MATH_TRANS;\n\telse if (y > 0)\n\t\tangleRot = 180 - atan(x / y) * MATH_TRANS;\n\n\txIn \t= (x / sin(angleRot / MATH_TRANS) - MATH_L2 - 56.55) / MATH_LOWER_ARM;\n\tphi \t= atan(zIn / xIn) * MATH_TRANS;\n\tsqrtZX \t= sqrt(zIn * zIn + xIn * xIn);\n\trightAll = (sqrtZX * sqrtZX + MATH_UPPER_LOWER * MATH_UPPER_LOWER - 1) \n\t\t\t / (2 * MATH_UPPER_LOWER * sqrtZX);\n\tangleRight = acos(rightAll) * MATH_TRANS;\n\n\t\n\trightAll = (sqrtZX * sqrtZX + 1 - MATH_UPPER_LOWER * MATH_UPPER_LOWER ) / (2 * sqrtZX);\n\tangleLeft = acos(rightAll) * MATH_TRANS;\n\tangleLeft = angleLeft + phi;\n\tangleRight = angleRight - phi;\n\n\tif (isnan(angleRot) || isnan(angleLeft) || isnan(angleRight))\n\t\treturn false;\n\n\tangle[0] = angleRot;\n\tangle[1] = angleLeft;\n\tangle[2] = angleRight;\n\treturn true;\n}\n\nvoid SwiftproState_Callback(const swiftpro::SwiftproState& msg)\n{\n\tfloat position[3];\n\tfloat angle[3];\n\t\n\tposition[0] = msg.x;\n\tposition[1] = msg.y;\n\tposition[2] = msg.z;\n\t\n\tif ( swiftpro_ik(position, angle) )\n\t\tall_joints_state(angle);\n\telse\n\t\tROS_ERROR(\"Inverse kinematic is wrong\");\n}\n\nint main(int argc, char **argv)\n{\t\n\tros::init(argc, argv, \"swiftpro_rviz_node\");\n\tros::NodeHandle n;\n\t\n\tros::Subscriber sub = n.subscribe(\"SwiftproState_topic\", 1, SwiftproState_Callback);\n\tros::Publisher \tpub = n.advertise<sensor_msgs::JointState>(\"joint_states\", 1);\n\tros::Rate loop_rate(20);\n\n\ttf::TransformBroadcaster \t\tbroadcaster;\n\tsensor_msgs::JointState \t\tjoint_state;\n\tgeometry_msgs::TransformStamped odom_trans;\n\t\n\todom_trans.header.frame_id = \"odom\";\n\todom_trans.child_frame_id = \"Base\";\n\t\n\twhile (ros::ok())\n\t{\n\t\tjoint_state.header.stamp = ros::Time::now();\n\t\tjoint_state.name.resize(9);\n\t\tjoint_state.position.resize(9);\n\t\tjoint_state.name[0] = \"Joint1\";\n\t\tjoint_state.position[0] = joint_angle[0] / 57.2958;\n\t joint_state.name[1] = \"Joint2\";\n\t\tjoint_state.position[1] = joint_angle[1] / 57.2958;\n\t\tjoint_state.name[2] = \"Joint3\";\n\t\tjoint_state.position[2] = joint_angle[2] / 57.2958;\n\t\tjoint_state.name[3] = \"Joint4\";\n\t\tjoint_state.position[3] = joint_angle[3] / 57.2958;\n\t\tjoint_state.name[4] = \"Joint5\";\n\t\tjoint_state.position[4] = joint_angle[4] / 57.2958;\n\t\tjoint_state.name[5] = \"Joint6\";\n\t\tjoint_state.position[5] = joint_angle[5] / 57.2958;\n\t\tjoint_state.name[6] = \"Joint7\";\n\t\tjoint_state.position[6] = joint_angle[6] / 57.2958;\n\t\tjoint_state.name[7] = \"Joint8\";\n\t\tjoint_state.position[7] = joint_angle[7] / 57.2958;\n\t\tjoint_state.name[8] = \"Joint9\";\n\t\tjoint_state.position[8] = joint_angle[8] / 57.2958;\n\n\t\todom_trans.header.stamp = ros::Time::now();\n\t\todom_trans.transform.translation.x = 0;\n\t\todom_trans.transform.translation.y = 0;\n\t\todom_trans.transform.translation.z = 0.0;\n\t\todom_trans.transform.rotation = tf::createQuaternionMsgFromYaw(10);\n\t\t\n\t\tpub.publish(joint_state);\n\t\tbroadcaster.sendTransform(odom_trans);\n\t\t\n\t\tros::spinOnce();\n\t\tloop_rate.sleep();\n\t}\t\t\n\treturn 0;\n}\n\n"},"prefix":{"kind":"string","value":"#include <string>\n#include <ros/ros.h>\n#include <std_msgs/String.h>\n#include <swiftpro/SwiftproState.h>\n#include <sensor_msgs/JointState.h>\n#include <tf/transform_broadcaster.h>\n\n#define MATH_PI \t\t\t\t3.141592653589793238463\n#define MATH_TRANS \t\t\t57.2958 \n#define MATH_L1 \t\t\t\t106.6\n#define MATH_L2 \t\t\t\t13.2\n#define MATH_LOWER_ARM \t\t\t142.07\n#define MATH_UPPER_ARM \t\t\t158.81\t\n#define MATH_UPPER_LOWER \t\t(MATH_UPPER_ARM / MATH_LOWER_ARM)\n\n#define LOWER_ARM_MAX_ANGLE 135.6\n#define LOWER_ARM_MIN_ANGLE 0\n#define UPPER_ARM_MAX_ANGLE 100.7\n#define UPPER_ARM_MIN_ANGLE 0\n#define LOWER_UPPER_MAX_ANGLE 151\n#define LOWER_UPPER_MIN_ANGLE 10\n\nfloat joint_angle[9] = {0.0};\t\t\n\nvoid all_joints_state(float angle[3])\n{\n\tdouble alpha2;\n\tdouble alpha3;\n\t\n\talpha2 = angle[1];\n\talpha3 = angle[2] - 3.8;\n\t\n\t\n\tjoint_angle[0] = angle[0] - 90;\n\tjoint_angle[1] = 90 - alpha2;\n\tjoint_angle[5] = alpha3;\n\n\t\n\tjoint_angle[2] = (alpha2 + alpha3) - 176.11 + 90;\n\tjoint_angle[3] = -90 + alpha2;\n\tjoint_angle[4] = joint_angle[1];\n\tjoint_angle[6] = 90 - (alpha2 + alpha3);\n\tjoint_angle[7] = 176.11 - 180 - alpha3;\n\tjoint_angle[8] = 48.39 + alpha3 - 44.55;\n}\n\nbool swiftpro_ik(float position[3], float angle[3])\n{\n\tfloat x = position[0];\n\tfloat y = position[1];\n\tfloat z = position[2];\n\tfloat xIn, zIn, phi, rightAll, sqrtZX = 0.0;\n\tfloat angleRot, angleLeft, angleRight = 0.0;\n\t\n\tz += 74.55;\n\tzIn = (z - MATH_L1) / MATH_LOWER_ARM;\n\t\n\tif (x < 0.1)\n\t\tx = 0.1;\n\n\t\n\tif (y == 0)\n\t\tangleRot = 90;\n\telse if (y < 0)\n\t\tangleRot = -atan(x / y) * MATH_TRANS;\n\telse if (y > 0)\n\t\tangleRot = 180 - atan(x / y) * MATH_TRANS;\n\n\txIn \t= (x / sin(angleRot / MATH_TRANS) - "},"suffix":{"kind":"string","value":" sqrtZX + 1 - MATH_UPPER_LOWER * MATH_UPPER_LOWER ) / (2 * sqrtZX);\n\tangleLeft = acos(rightAll) * MATH_TRANS;\n\tangleLeft = angleLeft + phi;\n\tangleRight = angleRight - phi;\n\n\tif (isnan(angleRot) || isnan(angleLeft) || isnan(angleRight))\n\t\treturn false;\n\n\tangle[0] = angleRot;\n\tangle[1] = angleLeft;\n\tangle[2] = angleRight;\n\treturn true;\n}\n\nvoid SwiftproState_Callback(const swiftpro::SwiftproState& msg)\n{\n\tfloat position[3];\n\tfloat angle[3];\n\t\n\tposition[0] = msg.x;\n\tposition[1] = msg.y;\n\tposition[2] = msg.z;\n\t\n\tif ( swiftpro_ik(position, angle) )\n\t\tall_joints_state(angle);\n\telse\n\t\tROS_ERROR(\"Inverse kinematic is wrong\");\n}\n\nint main(int argc, char **argv)\n{\t\n\tros::init(argc, argv, \"swiftpro_rviz_node\");\n\tros::NodeHandle n;\n\t\n\tros::Subscriber sub = n.subscribe(\"SwiftproState_topic\", 1, SwiftproState_Callback);\n\tros::Publisher \tpub = n.advertise<sensor_msgs::JointState>(\"joint_states\", 1);\n\tros::Rate loop_rate(20);\n\n\ttf::TransformBroadcaster \t\tbroadcaster;\n\tsensor_msgs::JointState \t\tjoint_state;\n\tgeometry_msgs::TransformStamped odom_trans;\n\t\n\todom_trans.header.frame_id = \"odom\";\n\todom_trans.child_frame_id = \"Base\";\n\t\n\twhile (ros::ok())\n\t{\n\t\tjoint_state.header.stamp = ros::Time::now();\n\t\tjoint_state.name.resize(9);\n\t\tjoint_state.position.resize(9);\n\t\tjoint_state.name[0] = \"Joint1\";\n\t\tjoint_state.position[0] = joint_angle[0] / 57.2958;\n\t joint_state.name[1] = \"Joint2\";\n\t\tjoint_state.position[1] = joint_angle[1] / 57.2958;\n\t\tjoint_state.name[2] = \"Joint3\";\n\t\tjoint_state.position[2] = joint_angle[2] / 57.2958;\n\t\tjoint_state.name[3] = \"Joint4\";\n\t\tjoint_state.position[3] = joint_angle[3] / 57.2958;\n\t\tjoint_state.name[4] = \"Joint5\";\n\t\tjoint_state.position[4] = joint_angle[4] / 57.2958;\n\t\tjoint_state.name[5] = \"Joint6\";\n\t\tjoint_state.position[5] = joint_angle[5] / 57.2958;\n\t\tjoint_state.name[6] = \"Joint7\";\n\t\tjoint_state.position[6] = joint_angle[6] / 57.2958;\n\t\tjoint_state.name[7] = \"Joint8\";\n\t\tjoint_state.position[7] = joint_angle[7] / 57.2958;\n\t\tjoint_state.name[8] = \"Joint9\";\n\t\tjoint_state.position[8] = joint_angle[8] / 57.2958;\n\n\t\todom_trans.header.stamp = ros::Time::now();\n\t\todom_trans.transform.translation.x = 0;\n\t\todom_trans.transform.translation.y = 0;\n\t\todom_trans.transform.translation.z = 0.0;\n\t\todom_trans.transform.rotation = tf::createQuaternionMsgFromYaw(10);\n\t\t\n\t\tpub.publish(joint_state);\n\t\tbroadcaster.sendTransform(odom_trans);\n\t\t\n\t\tros::spinOnce();\n\t\tloop_rate.sleep();\n\t}\t\t\n\treturn 0;\n}\n\n"},"middle":{"kind":"string","value":"MATH_L2 - 56.55) / MATH_LOWER_ARM;\n\tphi \t= atan(zIn / xIn) * MATH_TRANS;\n\tsqrtZX \t= sqrt(zIn * zIn + xIn * xIn);\n\trightAll = (sqrtZX * sqrtZX + MATH_UPPER_LOWER * MATH_UPPER_LOWER - 1) \n\t\t\t / (2 * MATH_UPPER_LOWER * sqrtZX);\n\tangleRight = acos(rightAll) * MATH_TRANS;\n\n\t\n\trightAll = (sqrtZX *"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":" class DDDouble : virtual public DDParam {\n\n public:\n\n string getName() const;\n\n\n\n void prepGroup(Group &group);\n\n\n\n void prepConfig(Config &conf);\n\n\n\n void prepConfigDescription(ConfigDescription &conf_desc);\n\n\n\n int getLevel() const;\n\n\n\n bool sameType(Value val);\n\n\n\n bool sameValue(Value val);\n\n\n\n void setValue(Value val);\n\n\n\n Value getValue() const;\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h","rank":0,"score":79677.44074427793},{"content":" class DDBool : virtual public DDParam {\n\n public:\n\n string getName() const;\n\n\n\n void prepGroup(Group &group);\n\n\n\n void prepConfig(Config &conf);\n\n\n\n void prepConfigDescription(ConfigDescription &conf_desc);\n\n\n\n int getLevel() const;\n\n\n\n bool sameType(Value val);\n\n\n\n bool sameValue(Value val);\n\n\n\n void setValue(Value val);\n\n\n\n Value getValue() const;\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h","rank":1,"score":79677.44074427793},{"content":" class DDString : virtual public DDParam {\n\n public:\n\n string getName() const;\n\n\n\n void prepGroup(Group &group);\n\n\n\n void prepConfig(Config &conf);\n\n\n\n void prepConfigDescription(ConfigDescription &conf_desc);\n\n\n\n int getLevel() const;\n\n\n\n bool sameType(Value val);\n\n\n\n bool sameValue(Value val);\n\n\n\n void setValue(Value val);\n\n\n\n Value getValue() const;\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h","rank":2,"score":79677.44074427793},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_DOUBLE_PARAM_H\n\n#define DDYNAMIC_RECONFIGURE_DD_DOUBLE_PARAM_H\n\n\n\n#include \"ddynamic_reconfigure/dd_param.h\"\n\n\n\n\n\nnamespace ddynamic_reconfigure {\n\n typedef numeric_limits<double> d_limit;\n\n /**\n\n * @brief a double implementation of the parameter.\n\n * This is used to handle double-precision floating point numbers,\n\n * though it can handle single precision as well.\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h","rank":3,"score":77108.39162659523},{"content":" /**\n\n * @brief creates a new bool param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param description details about the parameter\n\n * @param def the default value\n\n */\n\n DDBool(const string &name, unsigned int level, const string &description, bool def) {\n\n name_ = name;\n\n level_ = level;\n\n desc_ = description;\n\n def_ = def;\n\n val_ = def;\n\n }\n\n protected:\n\n /**\n\n * @brief the level of the parameter:\n\n * the degree in which things need to be shut down if this param changes\n\n */\n\n unsigned int level_;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h","rank":4,"score":77106.21933363154},{"content":" /**\n\n * @brief the default value (def_),\n\n * and the current value (val_)\n\n */\n\n bool def_,val_;\n\n /**\n\n * @brief the name of the parameter (name_),\n\n * and its description (desc_)\n\n */\n\n string name_, desc_;\n\n };\n\n}\n\n\n\n\n\n#endif //DDYNAMIC_RECONFIGURE_DD_BOOL_PARAM_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h","rank":5,"score":77105.95734924369},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_STRING_PARAM_H\n\n#define DDYNAMIC_RECONFIGURE_DD_STRING_PARAM_H\n\n\n\n#include \"ddynamic_reconfigure/dd_param.h\"\n\n\n\nnamespace ddynamic_reconfigure {\n\n /**\n\n * @brief a string implementation of the parameter.\n\n * This is used to handle strings of characters of variable length.\n\n * Like string, each param value can hold up to 2^32-1 characters.\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h","rank":6,"score":77105.9616865491},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_BOOL_PARAM_H\n\n#define DDYNAMIC_RECONFIGURE_DD_BOOL_PARAM_H\n\n\n\n#include \"ddynamic_reconfigure/dd_param.h\"\n\n\n\nnamespace ddynamic_reconfigure {\n\n /**\n\n * @brief a boolean implementation of the parameter.\n\n * These are used to handle true/false values, or bit quantities if needed.\n\n * In ROS, booleans are handled as u-bytes (u-int8), so be careful with these!\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h","rank":7,"score":77105.19595149056},{"content":" /**\n\n * creates a new double param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param def the default value\n\n * @param description details about the parameter\n\n * @param max the maximum allowed value. Defaults to DBL_MAX\n\n * @param min the minimum allowed value. Defaults to -DBL_MAX\n\n */\n\n DDDouble(const string &name, unsigned int level, const string &description, double def,\n\n double min = -d_limit::infinity(), double max = d_limit::infinity())\n\n : max_(), min_() {\n\n name_ = name;\n\n level_ = level;\n\n desc_ = description;\n\n def_ = def;\n\n val_ = def;\n\n max_ = max;\n\n min_ = min;\n\n }\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h","rank":8,"score":77104.24240649953},{"content":" protected:\n\n /**\n\n * @brief the level of the parameter:\n\n * the degree in which things need to be shut down if this param changes\n\n */\n\n unsigned int level_;\n\n /**\n\n * @brief the default value (def_),\n\n * the current value (val_),\n\n * the minimum allowed value (min_),\n\n * and the maximum allowed value (max_)\n\n */\n\n double def_,max_,min_,val_;\n\n /**\n\n * @brief the name of the parameter (name_),\n\n * and its description (desc_)\n\n */\n\n string name_, desc_;\n\n };\n\n}\n\n\n\n\n\n#endif //DDYNAMIC_RECONFIGURE_DD_DOUBLE_PARAM_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h","rank":9,"score":77104.00753056731},{"content":" /**\n\n * creates a new string param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param description details about the parameter\n\n * @param def the default value\n\n */\n\n DDString(const string &name, unsigned int level, const string &description, const string &def) {\n\n name_ = name;\n\n level_ = level;\n\n desc_ = description;\n\n def_ = def;\n\n val_ = def;\n\n }\n\n protected:\n\n /**\n\n * @brief the level of the parameter:\n\n * the degree in which things need to be shut down if this param changes\n\n */\n\n unsigned int level_;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h","rank":10,"score":77102.53449879441},{"content":" /**\n\n * @brief the default value (def_),\n\n * and the current value (val_)\n\n */\n\n string def_,val_;\n\n /**\n\n * @brief the name of the parameter (name_),\n\n * and its description (desc_)\n\n */\n\n string name_, desc_;\n\n };\n\n}\n\n\n\n\n\n#endif //DDYNAMIC_RECONFIGURE_DD_STRING_PARAM_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h","rank":11,"score":77102.47950733577},{"content":" };\n\n\n\n std::string _base_frame_id;\n\n std::string _odom_frame_id;\n\n std::map<stream_index_pair, std::string> _frame_id;\n\n std::map<stream_index_pair, std::string> _optical_frame_id;\n\n std::map<stream_index_pair, std::string> _depth_aligned_frame_id;\n\n ros::NodeHandle& _node_handle, _pnh;\n\n bool _align_depth;\n\n\n\n virtual void calcAndPublishStaticTransform(const stream_index_pair& stream, const rs2::stream_profile& base_profile);\n\n rs2::stream_profile getAProfile(const stream_index_pair& stream);\n\n tf::Quaternion rotationMatrixToQuaternion(const float rotation[9]) const;\n\n void publish_static_tf(const ros::Time& t,\n\n const float3& trans,\n\n const tf::Quaternion& q,\n\n const std::string& from,\n\n const std::string& to);\n\n\n\n\n\n private:\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":12,"score":40809.74622657525},{"content":" void clip_depth(rs2::depth_frame depth_frame, float clipping_dist);\n\n void updateStreamCalibData(const rs2::video_stream_profile& video_profile);\n\n void publishStaticTransforms();\n\n void publishPointCloud(rs2::points f, const ros::Time& t, const rs2::frameset& frameset);\n\n Extrinsics rsExtrinsicsToMsg(const rs2_extrinsics& extrinsics, const std::string& frame_id) const;\n\n\n\n IMUInfo getImuInfo(const stream_index_pair& stream_index);\n\n void publishFrame(rs2::frame f, const ros::Time& t,\n\n const stream_index_pair& stream,\n\n std::map<stream_index_pair, cv::Mat>& images,\n\n const std::map<stream_index_pair, ros::Publisher>& info_publishers,\n\n const std::map<stream_index_pair, ImagePublisherWithFrequencyDiagnostics>& image_publishers,\n\n std::map<stream_index_pair, int>& seq,\n\n std::map<stream_index_pair, sensor_msgs::CameraInfo>& camera_info,\n\n const std::map<stream_index_pair, std::string>& optical_frame_id,\n\n const std::map<rs2_stream, std::string>& encoding,\n\n bool copy_data_from_frame = true);\n\n bool getEnabledProfile(const stream_index_pair& stream_index, rs2::stream_profile& profile);\n\n\n\n void publishAlignedDepthToOthers(rs2::frameset frames, const ros::Time& t);\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":13,"score":40808.84455708749},{"content":"\n\n public:\n\n CIMUHistory(size_t size);\n\n void add_data(sensor_name module, imuData data);\n\n bool is_all_data(sensor_name);\n\n bool is_data(sensor_name);\n\n const std::list<imuData>& get_data(sensor_name module);\n\n imuData last_data(sensor_name module);\n\n };\n\n\n\n static std::string getNamespaceStr();\n\n void getParameters();\n\n void setupDevice();\n\n void setupErrorCallback();\n\n void setupPublishers();\n\n void enable_devices();\n\n void setupFilters();\n\n void setupStreams();\n\n void setBaseTime(double frame_time, bool warn_no_metadata);\n\n cv::Mat& fix_depth_scale(const cv::Mat& from_image, cv::Mat& to_image);\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":14,"score":40808.444225162224},{"content":" static void callback(const ddynamic_reconfigure::DDMap& map, int, rs2::options sensor);\n\n double FillImuData_Copy(const stream_index_pair stream_index, const CIMUHistory::imuData imu_data, sensor_msgs::Imu& imu_msg);\n\n double FillImuData_LinearInterpolation(const stream_index_pair stream_index, const CIMUHistory::imuData imu_data, sensor_msgs::Imu& imu_msg);\n\n void imu_callback(rs2::frame frame);\n\n void imu_callback_sync(rs2::frame frame, imu_sync_method sync_method=imu_sync_method::COPY);\n\n void pose_callback(rs2::frame frame);\n\n void multiple_message_callback(rs2::frame frame, imu_sync_method sync_method);\n\n void frame_callback(rs2::frame frame);\n\n void registerDynamicOption(ros::NodeHandle& nh, rs2::options sensor, std::string& module_name);\n\n rs2_stream rs2_string_to_stream(std::string str);\n\n\n\n rs2::device _dev;\n\n std::map<stream_index_pair, rs2::sensor> _sensors;\n\n std::map<std::string, std::function<void(rs2::frame)>> _sensors_callback;\n\n std::vector<std::shared_ptr<ddynamic_reconfigure::DDynamicReconfigure>> _ddynrec;\n\n\n\n std::string _json_file_path;\n\n std::string _serial_no;\n\n float _depth_scale_meters;\n\n float _clipping_distance;\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":15,"score":40808.044077748644},{"content":" std::map<rs2_stream, std::string> _encoding;\n\n\n\n std::map<stream_index_pair, int> _seq;\n\n std::map<rs2_stream, int> _unit_step_size;\n\n std::map<stream_index_pair, sensor_msgs::CameraInfo> _camera_info;\n\n std::atomic_bool _is_initialized_time_base;\n\n double _camera_time_base;\n\n std::map<stream_index_pair, std::vector<rs2::stream_profile>> _enabled_profiles;\n\n\n\n ros::Publisher _pointcloud_publisher;\n\n ros::Time _ros_time_base;\n\n bool _sync_frames;\n\n bool _pointcloud;\n\n bool _publish_odom_tf;\n\n imu_sync_method _imu_sync_method;\n\n std::string _filters_str;\n\n stream_index_pair _pointcloud_texture;\n\n PipelineSyncer _syncer;\n\n std::vector<NamedFilter> _filters;\n\n std::vector<rs2::sensor> _dev_sensors;\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":16,"score":40804.194500413156},{"content":" bool _allow_no_texture_points;\n\n\n\n double _linear_accel_cov;\n\n double _angular_velocity_cov;\n\n bool _hold_back_imu_for_frames;\n\n\n\n std::map<stream_index_pair, rs2_intrinsics> _stream_intrinsics;\n\n std::map<stream_index_pair, int> _width;\n\n std::map<stream_index_pair, int> _height;\n\n std::map<stream_index_pair, int> _fps;\n\n std::map<stream_index_pair, bool> _enable;\n\n std::map<rs2_stream, std::string> _stream_name;\n\n tf2_ros::StaticTransformBroadcaster _static_tf_broadcaster;\n\n\n\n std::map<stream_index_pair, ImagePublisherWithFrequencyDiagnostics> _image_publishers;\n\n std::map<stream_index_pair, ros::Publisher> _imu_publishers;\n\n std::shared_ptr<SyncedImuPublisher> _synced_imu_publisher;\n\n std::map<rs2_stream, int> _image_format;\n\n std::map<stream_index_pair, ros::Publisher> _info_publisher;\n\n std::map<stream_index_pair, cv::Mat> _image;\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":17,"score":40802.39552450772},{"content":"// License: Apache 2.0. See LICENSE file in root directory.\n\n// Copyright(c) 2018 Intel Corporation. All Rights Reserved\n\n\n\n#pragma once\n\n\n\n#include <pluginlib/class_list_macros.h>\n\n#include <nodelet/nodelet.h>\n\n#include <image_transport/image_transport.h>\n\n#include <ros/ros.h>\n\n#include <ros/package.h>\n\n#include <librealsense2/rs.hpp>\n\n#include <librealsense2/rsutil.h>\n\n#include <librealsense2/hpp/rs_processing.hpp>\n\n#include <librealsense2/rs_advanced_mode.hpp>\n\n#include <cv_bridge/cv_bridge.h>\n\n#include <constants.h>\n\n#include <realsense2_camera/Extrinsics.h>\n\n#include <tf/transform_broadcaster.h>\n\n#include <tf2_ros/static_transform_broadcaster.h>\n\n#include <realsense2_camera/IMUInfo.h>\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h","rank":18,"score":40802.2347338902},{"content":"// License: Apache 2.0. See LICENSE file in root directory.\n\n// Copyright(c) 2018 Intel Corporation. All Rights Reserved\n\n\n\n#pragma once\n\n\n\n#include \"../include/realsense_node_factory.h\"\n\n#include <ddynamic_reconfigure/ddynamic_reconfigure.h>\n\n#include <ddynamic_reconfigure/param/dd_all_params.h>\n\n\n\n#include <diagnostic_updater/diagnostic_updater.h>\n\n#include <diagnostic_updater/update_functions.h>\n\n#include <sensor_msgs/CameraInfo.h>\n\n#include <sensor_msgs/PointCloud2.h>\n\n#include <sensor_msgs/point_cloud2_iterator.h>\n\n#include <sensor_msgs/Imu.h>\n\n#include <nav_msgs/Odometry.h>\n\n\n\n#include <queue>\n\n#include <mutex>\n\n#include <atomic>\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":19,"score":40802.23194057435},{"content":"\n\nnamespace realsense2_camera\n\n{\n\n struct FrequencyDiagnostics\n\n {\n\n FrequencyDiagnostics(double expected_frequency, std::string name, std::string hardware_id) :\n\n expected_frequency_(expected_frequency),\n\n frequency_status_(diagnostic_updater::FrequencyStatusParam(&expected_frequency_, &expected_frequency_)),\n\n diagnostic_updater_(ros::NodeHandle(), ros::NodeHandle(\"~\"), ros::this_node::getName() + \"_\" + name)\n\n {\n\n ROS_INFO(\"Expected frequency for %s = %.5f\", name.c_str(), expected_frequency_);\n\n diagnostic_updater_.setHardwareID(hardware_id);\n\n diagnostic_updater_.add(frequency_status_);\n\n }\n\n\n\n void update()\n\n {\n\n frequency_status_.tick();\n\n diagnostic_updater_.update();\n\n }\n\n\n\n double expected_frequency_;\n\n diagnostic_updater::FrequencyStatus frequency_status_;\n\n diagnostic_updater::Updater diagnostic_updater_;\n\n };\n\n typedef std::pair<image_transport::Publisher, std::shared_ptr<FrequencyDiagnostics>> ImagePublisherWithFrequencyDiagnostics;\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":20,"score":40802.141448700684},{"content":"#pragma once\n\n\n\n#include <base_realsense_node.h>\n\n\n\nnamespace realsense2_camera\n\n{\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/t265_realsense_node.h","rank":21,"score":40800.95252651928},{"content":"#include <csignal>\n\n#include <eigen3/Eigen/Geometry>\n\n#include <fstream>\n\n#include <thread>\n\n\n\nnamespace realsense2_camera\n\n{\n\n const stream_index_pair COLOR{RS2_STREAM_COLOR, 0};\n\n const stream_index_pair DEPTH{RS2_STREAM_DEPTH, 0};\n\n const stream_index_pair INFRA1{RS2_STREAM_INFRARED, 1};\n\n const stream_index_pair INFRA2{RS2_STREAM_INFRARED, 2};\n\n const stream_index_pair FISHEYE{RS2_STREAM_FISHEYE, 0};\n\n const stream_index_pair FISHEYE1{RS2_STREAM_FISHEYE, 1};\n\n const stream_index_pair FISHEYE2{RS2_STREAM_FISHEYE, 2};\n\n const stream_index_pair GYRO{RS2_STREAM_GYRO, 0};\n\n const stream_index_pair ACCEL{RS2_STREAM_ACCEL, 0};\n\n const stream_index_pair POSE{RS2_STREAM_POSE, 0};\n\n \n\n\n\n const std::vector<stream_index_pair> IMAGE_STREAMS = {DEPTH, INFRA1, INFRA2,\n\n COLOR,\n\n FISHEYE,\n\n FISHEYE1, FISHEYE2};\n\n\n\n const std::vector<stream_index_pair> HID_STREAMS = {GYRO, ACCEL, POSE};\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h","rank":22,"score":40800.922968044775},{"content":" std::map<rs2_stream, std::shared_ptr<rs2::align>> _align;\n\n\n\n std::map<stream_index_pair, cv::Mat> _depth_aligned_image;\n\n std::map<stream_index_pair, cv::Mat> _depth_scaled_image;\n\n std::map<rs2_stream, std::string> _depth_aligned_encoding;\n\n std::map<stream_index_pair, sensor_msgs::CameraInfo> _depth_aligned_camera_info;\n\n std::map<stream_index_pair, int> _depth_aligned_seq;\n\n std::map<stream_index_pair, ros::Publisher> _depth_aligned_info_publisher;\n\n std::map<stream_index_pair, ImagePublisherWithFrequencyDiagnostics> _depth_aligned_image_publishers;\n\n std::map<stream_index_pair, ros::Publisher> _depth_to_other_extrinsics_publishers;\n\n std::map<stream_index_pair, rs2_extrinsics> _depth_to_other_extrinsics;\n\n\n\n const std::string _namespace;\n\n\n\n };//end class\n\n\n\n}\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":23,"score":40799.7916486708},{"content":" * for native strings: if the string contains a floating value (for example \"1.1\" contains the double '1.1' in it),\n\n * it will return the double interpretation of that string.\n\n * Otherwise, returns the hash value of the string.\n\n */\n\n inline double toDouble() const {\n\n if(type_ == \"string\") {\n\n double f;\n\n if(sscanf(str_val_.c_str(), \"%lf\", &f) == 0) {\n\n return boost::hash<string>()(str_val_);\n\n }\n\n return f;\n\n } else if(type_ == \"bool\") {return bool_val_ ? 1.0 : 0.0;}\n\n else if(type_ == \"double\") {return double_val_;}\n\n else {return int_val_;}\n\n }\n\n\n\n /**\n\n * @brief converts the stored value into a boolean.\n\n * @return for native integers: returns true if the value is bigger than 0, false otherwise.\n\n * for native doubles: returns true if the value is bigger than 0, false otherwise.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":24,"score":39943.171221738514},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n#include <string>\n\n#include <sstream>\n\n#include <cstdio>\n\n#include <boost/functional/hash.hpp>\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_VALUE_H\n\n#define DDYNAMIC_RECONFIGURE_DD_VALUE_H\n\nusing namespace std;\n\nusing namespace boost;\n\nnamespace ddynamic_reconfigure {\n\n /**\n\n * @brief The Value class is used to wrap all basic data-types (bool,int,double,string) in something generic.\n\n * The value object always stores an explicit basic data-type.\n\n * This has three main uses:\n\n *\n\n * 1. Values can represent all basic data-types.\n\n * This means that arguments that need something relatively similar from all basic data-types can now just use the value in its argument.\n\n * This also goes for when you need to return something that is of different data-types from different classes\n\n * (one can only return integer, other can only return strings).\n\n *\n\n * 2. Values can be explicitly converted to all basic data-types they wrap.\n\n * This means that converting an int to a string is far easier.\n\n *\n\n * 3. Values store the type they were instantiated with. This can be tested against to get the original piece of data the value stored.\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":25,"score":39938.77387158079},{"content":" * for native booleans: returns itself\n\n * for native strings: returns true if the string's value is 'true', false otherwise.\n\n */\n\n inline bool toBool() const {\n\n if(type_ == \"string\") { return str_val_ == \"true\";}\n\n else if(type_ == \"bool\") {return bool_val_;}\n\n else if(type_ == \"double\") {return double_val_ > 0.0;}\n\n else {return int_val_ > 0;}\n\n }\n\n };\n\n}\n\n\n\n#endif //DDYNAMIC_RECONFIGURE_DD_VALUE_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":26,"score":39938.08980184785},{"content":" }\n\n\n\n /**\n\n * @brief creates an integer value wrapper\n\n * @param val the boolean to wrap\n\n */\n\n inline explicit Value(bool val) : int_val_(0), double_val_(0.0) {\n\n type_ = \"bool\";\n\n bool_val_ = val;\n\n }\n\n\n\n /**\n\n * @brief gets the type this value wrapper stores\n\n * @return a string containing the type: one of {\"int\",\"double\",\"bool\",\"string\"}\n\n */\n\n inline string getType() const {\n\n return type_;\n\n }\n\n\n\n /**\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":27,"score":39937.85480458831},{"content":" inline explicit Value(double val) : int_val_(0), bool_val_(false) {\n\n type_ = \"double\";\n\n double_val_ = val;\n\n }\n\n\n\n /**\n\n * @brief creates a string value wrapper\n\n * @param val the string to wrap\n\n */\n\n inline explicit Value(const string &val) : int_val_(0), double_val_(0.0), bool_val_(false) {\n\n type_ = \"string\";\n\n str_val_ = val;\n\n }\n\n\n\n /**\n\n * @brief creates a c-string value wrapper, though it is considered a regular string.\n\n * @param val the c-string to wrap\n\n */\n\n inline explicit Value(const char* val) : int_val_(0), double_val_(0.0), bool_val_(false) {\n\n *this = Value(string(val));\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":28,"score":39937.64422929807},{"content":" /**\n\n * @brief converts the stored value into a string.\n\n * @return for native integers: returns the number in string form ('1' -> \"1\")\n\n * for native doubles: returns the number in shorthand string form ('1.0' -> \"1\")\n\n * for native booleans: returns \"true\" if true, \"false\" if false.\n\n * for native strings: returns itself.\n\n */\n\n inline string toString() const {\n\n stringstream ss;\n\n if(type_ == \"string\") { return str_val_;}\n\n else if(type_ == \"bool\") {return bool_val_ ? \"true\" : \"false\";}\n\n else if(type_ == \"double\") {ss << double_val_; return ss.str();}\n\n else {ss << int_val_; return ss.str();}\n\n }\n\n\n\n /**\n\n * @brief converts the stored value into a double.\n\n * @return for native integers: returns itself\n\n * for native doubles: returns a itself\n\n * for native booleans: returns 1.0 if true, 0.0 if false.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":29,"score":39937.21356079122},{"content":" * @brief converts the stored value into an integer.\n\n * @return for native integers: returns itself.\n\n * for native doubles: returns a casted integer.\n\n * for native booleans: returns 1 if true, 0 if false.\n\n * for native strings: if the string contains an integer value (for example \"1\" contains the int '1' in it),\n\n * it will return the integer interpretation of that string.\n\n * Otherwise, returns the hash value of the string.\n\n */\n\n inline int toInt() const {\n\n if (type_ == \"string\") {\n\n int i;\n\n if (sscanf(str_val_.c_str(), \"%d\", &i) == 0) {\n\n return (int) boost::hash<string>()(str_val_);\n\n }\n\n return i;\n\n } else if (type_ == \"bool\") { return bool_val_ ? 1 : 0; }\n\n else if (type_ == \"double\") { return (int) double_val_; }\n\n else { return int_val_; }\n\n }\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":30,"score":39937.18297174609},{"content":"//\n\n// Created by Noam Dori on 18/06/18.\n\n//\n\n//include space, written in C++03\n\n#include <ros/ros.h>\n\n#include <dynamic_reconfigure/server.h>\n\n\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n\n\n#include <boost/shared_ptr.hpp>\n\n#include <boost/function.hpp>\n\n#include <boost/bind.hpp>\n\n\n\n#include \"dd_param.h\"\n\nusing namespace std;\n\nusing namespace boost;\n\nusing namespace dynamic_reconfigure;\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":31,"score":39936.880291619134},{"content":"//\n\n// Created by Noam Dori on 18/06/18.\n\n//\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_PARAM_H\n\n#define DDYNAMIC_RECONFIGURE_DD_PARAM_H\n\n\n\n#include <string>\n\n#include <dynamic_reconfigure/Group.h>\n\n#include <dynamic_reconfigure/Config.h>\n\n#include <dynamic_reconfigure/ConfigDescription.h>\n\n#include \"dd_value.h\"\n\n\n\nusing namespace dynamic_reconfigure;\n\nusing namespace std;\n\nnamespace ddynamic_reconfigure {\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":32,"score":39936.558120903646},{"content":" */\n\n virtual void add(DDParam *param);\n\n\n\n /**\n\n * removes the specified parameter from the list.\n\n * @param param the parameter to remove.\n\n */\n\n virtual void remove(DDPtr param);\n\n\n\n /**\n\n * removes the specified parameter from the list.\n\n * @param param the parameter to remove.\n\n */\n\n virtual void remove(DDParam *param);\n\n\n\n /**\n\n * removes the specified parameter from the list.\n\n * @param param_name the name of the parameter to remove.\n\n */\n\n virtual void remove(string param_name);\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":33,"score":39935.96973014908},{"content":" * While DDParam is abstract, all of its concrete implementations should follow this guideline:\n\n * DD<Type>(const string &name, unsigned int level, const string &description, <type> def, <extra-args>)\n\n * Where:\n\n * - <Type> is the type name you are implementing\n\n * - name is the reference name\n\n * - level is the severity level\n\n * - description is the object's description\n\n * - def is the default value and the first value stored right after construction.\n\n *\n\n * You may then include extra arguments as you wish, required or optional.\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":34,"score":39935.58460999948},{"content":" */\n\n void start(DDFunc callback);\n\n\n\n /**\n\n * @brief starts the server, using the given callback in method form.\n\n * @param callback a void pointer accepting a callback type with the method to use when values are updated.\n\n */\n\n void start(void(*callback)(const DDMap&, int));\n\n\n\n /**\n\n * @brief starts the server, using the given callback in class-wise static method form.\n\n * @param callback a class void pointer accepting a callback type with the method to use when values are updated.\n\n * @param obj the object used for reference in the class void\n\n * @tparam T the class of the object.\n\n */\n\n template<class T>\n\n void start(void(T::*callback)(const DDMap&, int), T *obj) {\n\n DDFunc f = bind(callback,obj,_1,_2);\n\n start();\n\n }\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":35,"score":39933.268400506815},{"content":"\n\n /**\n\n * @brief sets the callback to this.\n\n * @param callback a boost function with the method to use when values are updated.\n\n */\n\n void setCallback(DDFunc callback);\n\n\n\n /**\n\n * @brief sets the callback to be empty.\n\n */\n\n void clearCallback();\n\n\n\n /**\n\n * @brief starts the server and config, without having any callback.\n\n */\n\n virtual void start();\n\n\n\n /**\n\n * @brief starts the server, using the given callback in function form.\n\n * @param callback a boost function with the method to use when values are updated.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":36,"score":39932.68245881599},{"content":" * @param val the value to use\n\n */\n\n virtual void setValue(Value val) = 0;\n\n\n\n /**\n\n * @brief updates a group message according to this param's info.\n\n * @param group the group to update.\n\n * @note this is an internal method. It is recommended not to use it.\n\n */\n\n virtual void prepGroup(Group &group) = 0;\n\n\n\n /**\n\n * @brief updates a config message according to this param's info.\n\n * @param conf the group to update.\n\n * @note this is an internal method. It is recommended not to use it.\n\n */\n\n virtual void prepConfig(Config &conf) = 0;\n\n\n\n /**\n\n * @brief updates a config description message according to this param's info.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":37,"score":39932.487202895674},{"content":"#ifndef DDYNAMIC_RECONFIGURE_DDYNAMIC_RECONFIGURE_H\n\n#define DDYNAMIC_RECONFIGURE_DDYNAMIC_RECONFIGURE_H\n\nnamespace ddynamic_reconfigure {\n\n // this is a map from the DDParam name to the object. Acts like a set with a search function.\n\n typedef map<string,DDPtr> DDMap;\n\n // the function you will use a lot\n\n typedef boost::function<void(const DDMap&,int)> DDFunc;\n\n\n\n /**\n\n * @brief The DDynamicReconfigure class is the main class responsible for keeping track of parameters basic properties,\n\n * values, descriptions, etc.\n\n *\n\n * It is also responsible of handling callbacks, config change requests, description setup and config setup,\n\n * and the ROS publishers and services.\n\n *\n\n * To operate a DDynamic instance, you must go through the following procedure:\n\n *\n\n * 1. Construct a DDynamicReconfigure instance with proper handling.\n\n * 2. Add parameters to the instance as needed with any of the \"add\" methods.\n\n * 3. Start the ROS services with any of the \"start\" methods.\n\n * 4. If you need to change the callback after startup you may do so using \"setCallback\".\n\n * 5. When you need to get any of the stored parameters, call either \"get\" or \"at\" on this instance,\n\n * rather than through the callback.\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":38,"score":39932.409006991445},{"content":"\n\n /**\n\n * @brief a tool people who use this API can use to find the value given within the param map.\n\n * @param name the string to look for\n\n * @return the value of param with the given name if it exists, a string value containing \"\\000\" otherwise\n\n */\n\n Value get(const char* name);\n\n\n\n /**\n\n * @brief a tool people who use this API can use to find the param given within the param map.\n\n * @param name the string to look for\n\n * @return the param with the given name if it exists, nullptr otherwise\n\n */\n\n DDPtr at(const char* name);\n\n\n\n /**\n\n * @brief the operator taking care of streaming the param values\n\n * @param os the stream to place the param into\n\n * @param dd the dd-reconfigure you want to place into the stream\n\n * @return os, but with dd-reconfigure added.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":39,"score":39932.21247917293},{"content":" };\n\n\n\n /**\n\n * @brief a tool people who use this API can use to find the param given within the param map.\n\n * @param name the string to look for\n\n * @param map the map to search\n\n * @return the param with the given name if it exists, nullptr otherwise\n\n */\n\n DDPtr at(const DDMap& map, const char* name); // I could do this with an operator, but its bad design.\n\n\n\n /**\n\n * @brief a tool people who use this API can use to find the value given within the param map.\n\n * @param name the string to look for\n\n * @param map the map to search\n\n * @return the value of param with the given name if it exists, a string value containing \"\\000\" otherwise\n\n */\n\n Value get(const DDMap& map, const char* name); // I could do this with an operator, but its bad design.\n\n}\n\n#endif //DDYNAMIC_RECONFIGURE_DDYNAMIC_RECONFIGURE_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":40,"score":39932.18891667058},{"content":" \n\n /**\n\n * @brief checks whether or not the raw value stored in the value is compatible with the given parameter.\n\n * Compatible is a very broad word in this scenario.\n\n * It means that the value can be placed in the parameter regardless of other limitations.\n\n * @param val the value to test\n\n * @return true is this parameter can handle the original value, false otherwise.\n\n */\n\n virtual bool sameType(Value val) = 0;\n\n \n\n /**\n\n * @brief checks whether or not the value stored in the value object,\n\n * when converted to the type of the internal value, are equal. This acts regardless of type.\n\n * @param val the value to test\n\n * @return true is this parameter can is the same as the original value, false otherwise.\n\n */\n\n virtual bool sameValue(Value val) = 0;\n\n\n\n /**\n\n * @brief sets the value of this parameter as this one.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":41,"score":39931.9393438403},{"content":" * @param conf_desc the config description to update.\n\n * @note this is an internal method. It is recommended not to use it.\n\n */\n\n virtual void prepConfigDescription(ConfigDescription &conf_desc) = 0;\n\n\n\n /**\n\n * @brief the operator taking care of streaming the param values\n\n * @param os the stream to place the param into\n\n * @param param the param you want to place into the stream\n\n * @return os, but with param added.\n\n */\n\n friend ostream& operator<<(ostream& os, const DDParam ¶m);\n\n };\n\n}\n\n#endif //DDYNAMIC_RECONFIGURE_DD_PARAM_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":42,"score":39931.128996280655},{"content":"\n\n private:\n\n\n\n /**\n\n * @brief reassigns a value to the internal map assuming it is registered.\n\n * @param map the map that is being edited\n\n * @param name the name of the parameter to test\n\n * @param value the value of the new parameter\n\n * @tparam T the type of value\n\n * @return -1 if the value could not be reassigned,\n\n * 0 if the value was not changed,\n\n * otherwise the level of the parameter changed.\n\n */\n\n template <class T>\n\n static int reassign(DDMap& map, const string &name, T value);\n\n\n\n /**\n\n * @brief gets the updates and assigns them to DDMap\n\n * @param req the ROS request holding info about the new map\n\n * @param config the map to update\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":43,"score":39930.95230915641},{"content":" * @param rsp ----(ROS)\n\n * @return -------(ROS)\n\n * @note this is here so that deriving methods can call the internal callback.\n\n */\n\n static bool internalCallback(DDynamicReconfigure *obj, Reconfigure::Request &req, Reconfigure::Response &rsp);\n\n\n\n /**\n\n * @brief the ROS node handler to use to make everything ROS related.\n\n */\n\n ros::NodeHandle nh_;\n\n /**\n\n * @brief a map of all contained parameters.\n\n */\n\n DDMap params_;\n\n /**\n\n * @brief the publisher responsible for updating the descriptions of the parameter for commandline (desc_pub_),\n\n * and the publisher responsible for updating the configuration values for commandline and client (update_pub_).\n\n * desc_pub_ publishes to \"parameter_descriptions\", and update_pub_ publishes to \"/parameter_updates\".\n\n */\n\n ros::Publisher desc_pub_, update_pub_;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":44,"score":39930.800834387286},{"content":" class float3\n\n {\n\n public:\n\n float x, y, z;\n\n\n\n public:\n\n float3& operator*=(const float& factor)\n\n {\n\n x*=factor;\n\n y*=factor;\n\n z*=factor;\n\n return (*this);\n\n }\n\n float3& operator+=(const float3& other)\n\n {\n\n x+=other.x;\n\n y+=other.y;\n\n z+=other.z;\n\n return (*this);\n\n }\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":45,"score":39928.13823910353},{"content":" * @return the level of change (integer)\n\n */\n\n int getUpdates(const Reconfigure::Request &req, DDMap &config);\n\n\n\n /**\n\n * @brief the use defined callback to call when parameters are updated.\n\n */\n\n boost::shared_ptr<DDFunc> callback_;\n\n #ifdef __clang__\n\n #pragma clang diagnostic push // CLion suppressor\n\n #pragma ide diagnostic ignored \"OCUnusedGlobalDeclarationInspection\"\n\n #endif\n\n /**\n\n * @brief the service server used to trigger parameter updates.\n\n * It also contains the new parameters sent from client or commandline.\n\n */\n\n ros::ServiceServer set_service_;\n\n #ifdef __clang__\n\n #pragma clang diagnostic pop\n\n #endif\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":46,"score":39928.13823910353},{"content":" */\n\n friend ostream& operator<<(ostream& os, const DDynamicReconfigure &dd);\n\n protected:\n\n\n\n /**\n\n * @brief makes the config descriptions for publishing\n\n * @return a ROS message of type ConfigDescription\n\n */\n\n ConfigDescription makeDescription();\n\n\n\n /**\n\n * @brief makes the config update for publishing\n\n * @return a ROS message of type Config\n\n */\n\n Config makeConfig();\n\n\n\n /**\n\n * @brief calls the internal callback for the low-level service, not exposed to us.\n\n * @param obj the object we are using for its callback.\n\n * @param req ----(ROS)\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":47,"score":39928.13823910353},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#include <ddynamic_reconfigure/param/dd_bool_param.h>\n\n\n\nnamespace ddynamic_reconfigure {\n\n string DDBool::getName() const {\n\n return name_;\n\n }\n\n\n\n void DDBool::prepGroup(Group &group) {\n\n ParamDescription desc;\n\n desc.name = name_;\n\n desc.level = level_;\n\n desc.description = desc_;\n\n desc.type = \"bool\";\n\n group.parameters.push_back(desc);\n\n }\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_bool_param.cpp","rank":48,"score":39623.253580397504},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#include <ddynamic_reconfigure/param/dd_double_param.h>\n\n\n\nnamespace ddynamic_reconfigure {\n\n string DDDouble::getName() const {\n\n return name_;\n\n }\n\n\n\n void DDDouble::prepGroup(Group &group) {\n\n ParamDescription desc;\n\n desc.name = name_;\n\n desc.level = level_;\n\n desc.description = desc_;\n\n desc.type = \"double\";\n\n group.parameters.push_back(desc);\n\n }\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_double_param.cpp","rank":49,"score":39623.072363376676},{"content":" }\n\n\n\n bool DDDouble::sameType(Value val) {\n\n return val.getType() == \"double\";\n\n }\n\n\n\n bool DDDouble::sameValue(Value val) {\n\n return val.toDouble() == val_;\n\n }\n\n\n\n void DDDouble::setValue(Value val) {\n\n val_ = val.toDouble();\n\n }\n\n\n\n Value DDDouble::getValue() const {\n\n return Value(val_);\n\n }\n\n}\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_double_param.cpp","rank":50,"score":39621.95583245896},{"content":" }\n\n\n\n bool DDString::sameType(Value val) {\n\n return val.getType() == \"string\";\n\n }\n\n\n\n bool DDString::sameValue(Value val) {\n\n return val.toString() == val_;\n\n }\n\n\n\n void DDString::setValue(Value val) {\n\n val_ = val.toString();\n\n }\n\n\n\n Value DDString::getValue() const {\n\n return Value(val_);\n\n }\n\n}\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_string_param.cpp","rank":51,"score":39621.7342525261},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#include <ddynamic_reconfigure/param/dd_string_param.h>\n\n\n\nnamespace ddynamic_reconfigure {\n\n string DDString::getName() const {\n\n return name_;\n\n }\n\n\n\n void DDString::prepGroup(Group &group) {\n\n ParamDescription desc;\n\n desc.name = name_;\n\n desc.level = level_;\n\n desc.description = desc_;\n\n desc.type = \"string\";\n\n group.parameters.push_back(desc);\n\n }\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_string_param.cpp","rank":52,"score":39620.11534387237},{"content":" }\n\n\n\n bool DDBool::sameType(Value val) {\n\n return val.getType() == \"bool\";\n\n }\n\n\n\n bool DDBool::sameValue(Value val) {\n\n return val.toBool() == val_;\n\n }\n\n\n\n void DDBool::setValue(Value val) {\n\n val_ = val.toBool();\n\n }\n\n\n\n Value DDBool::getValue() const {\n\n return Value(val_);\n\n }\n\n}\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_bool_param.cpp","rank":53,"score":39617.645744029105},{"content":" void DDBool::prepConfig(Config &conf) {\n\n BoolParameter param;\n\n param.name = name_;\n\n param.value = (unsigned char)val_;\n\n conf.bools.push_back(param);\n\n }\n\n\n\n void DDBool::prepConfigDescription(ConfigDescription &conf_desc) {\n\n BoolParameter param;\n\n param.name = name_;\n\n param.value = (unsigned char)def_;\n\n conf_desc.dflt.bools.push_back(param);\n\n param.value = (unsigned char)true;\n\n conf_desc.max.bools.push_back(param);\n\n param.value = (unsigned char)false;\n\n conf_desc.min.bools.push_back(param);\n\n }\n\n\n\n int DDBool::getLevel() const {\n\n return level_;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_bool_param.cpp","rank":54,"score":39617.551380107805},{"content":" void DDDouble::prepConfig(Config &conf) {\n\n DoubleParameter param;\n\n param.name = name_;\n\n param.value = val_;\n\n conf.doubles.push_back(param);\n\n }\n\n\n\n void DDDouble::prepConfigDescription(ConfigDescription &conf_desc) {\n\n DoubleParameter param;\n\n param.name = name_;\n\n param.value = def_;\n\n conf_desc.dflt.doubles.push_back(param);\n\n param.value = max_;\n\n conf_desc.max.doubles.push_back(param);\n\n param.value = min_;\n\n conf_desc.min.doubles.push_back(param);\n\n }\n\n\n\n int DDDouble::getLevel() const {\n\n return level_;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_double_param.cpp","rank":55,"score":39617.35601553404},{"content":" void DDString::prepConfig(Config &conf) {\n\n StrParameter param;\n\n param.name = name_;\n\n param.value = val_;\n\n conf.strs.push_back(param);\n\n }\n\n\n\n void DDString::prepConfigDescription(ConfigDescription &conf_desc) {\n\n StrParameter param;\n\n param.name = name_;\n\n param.value = def_;\n\n conf_desc.dflt.strs.push_back(param);\n\n param.value = \"\";\n\n conf_desc.max.strs.push_back(param);\n\n param.value = \"\";\n\n conf_desc.min.strs.push_back(param);\n\n }\n\n\n\n int DDString::getLevel() const {\n\n return level_;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_string_param.cpp","rank":56,"score":39616.594630713254},{"content":" class CIMUHistory\n\n {\n\n public:\n\n enum sensor_name {mGYRO, mACCEL};\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":57,"score":39095.89808604912},{"content":" class Value {\n\n private:\n\n int int_val_;\n\n string str_val_, type_;\n\n double double_val_;\n\n bool bool_val_;\n\n public:\n\n /**\n\n * @brief creates an integer value wrapper\n\n * @param val the int to wrap\n\n */\n\n inline explicit Value(int val) : double_val_(0.0), bool_val_(false) {\n\n type_ = \"int\";\n\n int_val_ = val;\n\n }\n\n\n\n /**\n\n * @brief creates an double value wrapper\n\n * @param val the double to wrap\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h","rank":58,"score":39095.89808604912},{"content":" class imuData\n\n {\n\n public:\n\n imuData(const imuData& other):\n\n imuData(other.m_reading, other.m_time)\n\n {};\n\n imuData(const float3 reading, double time):\n\n m_reading(reading),\n\n m_time(time)\n\n {};\n\n imuData operator*(const double factor);\n\n imuData operator+(const imuData& other);\n\n public:\n\n BaseRealSenseNode::float3 m_reading;\n\n double m_time;\n\n };\n\n \n\n private:\n\n size_t m_max_size;\n\n std::map<sensor_name, std::list<imuData> > m_map;\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":59,"score":39095.89808604912},{"content":" class NamedFilter\n\n {\n\n public:\n\n std::string _name;\n\n std::shared_ptr<rs2::filter> _filter;\n\n\n\n public:\n\n NamedFilter(std::string name, std::shared_ptr<rs2::filter> filter):\n\n _name(name), _filter(filter)\n\n {}\n\n };\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":60,"score":39095.89808604912},{"content":"#include <ros/ros.h>\n\n#include <gtest/gtest.h>\n\n#include <ddynamic_reconfigure/param/dd_double_param.h>\n\n\n\nnamespace ddynamic_reconfigure {\n\n\n\n /**\n\n * @brief preliminary test which makes sure we can use the object.\n\n */\n\n TEST(DDDoubleTest, constructorTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDDouble param1(\"param1\",0,\"param1\",0.5);\n\n DDDouble param2(\"\",0,\"\",1,10);\n\n DDDouble param3(\"\\000\",0,\"\\000\", -0, -3.4e100, 43.5e20); // NOLINT(bugprone-string-literal-with-embedded-nul)\n\n }\n\n\n\n /**\n\n * @brief a test making sure we can handle all API for handling the values of the param\n\n */\n\n TEST(DDDoubleTest, valueTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDDouble param(\"dd_param\",0,\"dd_param\",1);\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_double.cpp","rank":61,"score":38811.77552310516},{"content":"#include <ros/ros.h>\n\n#include <gtest/gtest.h>\n\n#include <ddynamic_reconfigure/param/dd_bool_param.h>\n\n\n\nnamespace ddynamic_reconfigure {\n\n\n\n /**\n\n * @brief preliminary test which makes sure we can use the object.\n\n */\n\n TEST(DDBoolTest, constructorTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDBool param1(\"param1\",0,\"param1\",true);\n\n DDBool param2(\"\",0,\"\",false);\n\n DDBool param3(\"\\000\",0,\"\\000\",false); // NOLINT(bugprone-string-literal-with-embedded-nul)\n\n }\n\n\n\n /**\n\n * @brief a test making sure we can handle all API for handling the values of the param\n\n */\n\n TEST(DDBoolTest, valueTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDBool param(\"dd_param\",0,\"dd_param\",true);\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_bool.cpp","rank":62,"score":38811.60646859969},{"content":"#include <ros/ros.h>\n\n#include <gtest/gtest.h>\n\n#include <ddynamic_reconfigure/param/dd_string_param.h>\n\n\n\nnamespace ddynamic_reconfigure {\n\n\n\n /**\n\n * @brief preliminary test which makes sure we can use the object.\n\n */\n\n TEST(DDStringTest, constructorTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDString param1(\"param1\",0,\"param1\",\"Hello World\");\n\n DDString param2(\"\",0,\"\",\"\");\n\n DDString param3(\"\\000\",0,\"\\000\",\"\\000\"); // NOLINT(bugprone-string-literal-with-embedded-nul)\n\n }\n\n\n\n /**\n\n * @brief a test making sure we can handle all API for handling the values of the param\n\n */\n\n TEST(DDStringTest, valueTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDString param(\"dd_param\",0,\"param1\",\"1\");\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_string.cpp","rank":63,"score":38809.15094982345},{"content":"\n\n ASSERT_TRUE(param.getValue().getType() == \"bool\");\n\n ASSERT_TRUE(param.sameValue(Value(false)));\n\n }\n\n\n\n TEST(DDBoolTest, streamTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDBool param1(\"param1\",0,\"param1\",true);\n\n stringstream stream;\n\n stream << param1;\n\n ASSERT_EQ(param1.getName() + \":\" + param1.getValue().toString(),stream.str());\n\n }\n\n}\n\n\n\n\n\nint main(int argc, char** argv) {\n\n testing::InitGoogleTest(&argc, argv);\n\n\n\n srand((unsigned int)random());\n\n\n\n return RUN_ALL_TESTS();\n\n}","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_bool.cpp","rank":64,"score":38807.07701577213},{"content":"\n\n ASSERT_TRUE(param.getValue().getType() == \"double\");\n\n ASSERT_TRUE(param.sameValue(Value(2)));\n\n }\n\n\n\n TEST(DDDoubleTest, streamTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDDouble param1(\"param1\",0,\"param1\",1.0);\n\n stringstream stream;\n\n stream << param1;\n\n ASSERT_EQ(param1.getName() + \":\" + param1.getValue().toString(),stream.str());\n\n }\n\n}\n\n\n\n\n\nint main(int argc, char** argv) {\n\n testing::InitGoogleTest(&argc, argv);\n\n\n\n srand((unsigned int)random());\n\n\n\n return RUN_ALL_TESTS();\n\n}","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_double.cpp","rank":65,"score":38806.689695833404},{"content":"\n\n ASSERT_TRUE(param.getValue().getType() == \"string\");\n\n ASSERT_TRUE(param.sameValue(Value(\"2\")));\n\n }\n\n\n\n TEST(DDStringTest, streamTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\n\n DDString param1(\"param1\",0,\"param1\",\"Hello World\");\n\n stringstream stream;\n\n stream << param1;\n\n ASSERT_EQ(param1.getName() + \":\" + param1.getValue().toString(),stream.str());\n\n }\n\n}\n\n\n\n\n\nint main(int argc, char** argv) {\n\n testing::InitGoogleTest(&argc, argv);\n\n\n\n srand((unsigned int)random());\n\n\n\n return RUN_ALL_TESTS();\n\n}","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_string.cpp","rank":66,"score":38804.49949413581},{"content":" // we won't do any tests on getLevel or getName, as those are implicit.\n\n Value v(\"1\");\n\n ASSERT_TRUE(param.sameType(v));\n\n ASSERT_TRUE(param.sameValue(v));\n\n\n\n v = Value(1);\n\n ASSERT_FALSE(param.sameType(v));\n\n ASSERT_TRUE(param.sameValue(v));\n\n\n\n v = Value(\"2\");\n\n ASSERT_TRUE(param.sameType(v));\n\n ASSERT_FALSE(param.sameValue(v));\n\n\n\n v = Value(2);\n\n ASSERT_FALSE(param.sameType(v));\n\n ASSERT_FALSE(param.sameValue(v));\n\n\n\n param.setValue(v);\n\n v = Value(\"3\");\n\n ASSERT_FALSE(param.sameValue(v)); // makes sure anti-aliasing happens\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_string.cpp","rank":67,"score":38799.952523898326},{"content":" // we won't do any tests on getLevel or getName, as those are implicit.\n\n Value v(true);\n\n ASSERT_TRUE(param.sameType(v));\n\n ASSERT_TRUE(param.sameValue(v));\n\n\n\n v = Value(1);\n\n ASSERT_FALSE(param.sameType(v));\n\n ASSERT_TRUE(param.sameValue(v));\n\n\n\n v = Value(false);\n\n ASSERT_TRUE(param.sameType(v));\n\n ASSERT_FALSE(param.sameValue(v));\n\n\n\n v = Value(0);\n\n ASSERT_FALSE(param.sameType(v));\n\n ASSERT_FALSE(param.sameValue(v));\n\n\n\n param.setValue(v);\n\n v = Value(true);\n\n ASSERT_FALSE(param.sameValue(v)); // makes sure anti-aliasing happens\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_bool.cpp","rank":68,"score":38799.952523898326},{"content":" // we won't do any tests on getLevel or getName, as those are implicit.\n\n Value v(1.0);\n\n ASSERT_TRUE(param.sameType(v));\n\n ASSERT_TRUE(param.sameValue(v));\n\n\n\n v = Value(1);\n\n ASSERT_FALSE(param.sameType(v));\n\n ASSERT_TRUE(param.sameValue(v));\n\n\n\n v = Value(2.0);\n\n ASSERT_TRUE(param.sameType(v));\n\n ASSERT_FALSE(param.sameValue(v));\n\n\n\n v = Value(2);\n\n ASSERT_FALSE(param.sameType(v));\n\n ASSERT_FALSE(param.sameValue(v));\n\n\n\n param.setValue(v);\n\n v = Value(3);\n\n ASSERT_FALSE(param.sameValue(v)); // makes sure anti-aliasing happens\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_double.cpp","rank":69,"score":38799.952523898326},{"content":"//\n\n// Created by Noam Dori on 20/06/18.\n\n//\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_ENUM_PARAM_H\n\n#define DDYNAMIC_RECONFIGURE_DD_ENUM_PARAM_H\n\n\n\n#include \"dd_int_param.h\"\n\n#include <boost/foreach.hpp>\n\n\n\nnamespace ddynamic_reconfigure {\n\n typedef map<string,pair<int,string> > EnumMap;\n\n /**\n\n * @brief an integer enum implementation of the parameter.\n\n * This is an extension to the int parameter,\n\n * which allows creating string aliases for certain (if not all) numbers available.\n\n *\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h","rank":70,"score":38306.32326455289},{"content":" * @deprecated see note. This is not tested, so it may fail.\n\n */\n\n DDEnum(const string &name, unsigned int level, const string &description,\n\n const string& def, const pair<map<string,pair<int,string> >,string> &dictionary);\n\n #ifdef __clang__\n\n #pragma clang diagnostic pop\n\n #endif\n\n\n\n protected:\n\n /** \n\n * @brief A dictionary from the string aliases to their integer counterparts.\n\n * This method of storage allows integers to have multiple aliases.\n\n */\n\n const EnumMap dict_;\n\n /**\n\n * @brief this holds the physical enum's description. why is this here? because 1D-reconfigure.\n\n */\n\n string enum_description_;\n\n private:\n\n /**\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h","rank":71,"score":38302.85623164435},{"content":" * converts the value given to an integer according to the embedded dictionary.\n\n * @param val the value to look up within the dictionary\n\n * @return if the value is a string which exists in the dictionary, returns the int definition of the term given.\n\n * otherwise, returns the Value object defined conversion of the type to an integer.\n\n */\n\n int lookup(Value val);\n\n\n\n /**\n\n * generates the 'edit_method' sting for prepGroup().\n\n * @return a string that should not be touched.\n\n */\n\n string makeEditMethod();\n\n\n\n /**\n\n * generates a 'const' sting for prepGroup().\n\n * @param name the name of the constant\n\n * @param value the value of the constant\n\n * @param desc the description given to the constant.\n\n * @return a string that should not be touched.\n\n */\n\n string makeConst(string name, int value, string desc);\n\n };\n\n}\n\n\n\n#endif //DDYNAMIC_RECONFIGURE_DD_ENUM_PARAM_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h","rank":72,"score":38302.61347038098},{"content":" * @param level the change level\n\n * @param def the default value in integer form\n\n * @param description details about the parameter\n\n * @param dictionary the alias dictionary this enum will use.\n\n * @note since ROS cannot send the enum and const descriptions, this method is useless.\n\n * Please use the constructor which takes a map<string,int> instead.\n\n * @deprecated see note. This is not tested, so it may fail.\n\n */\n\n DDEnum(const string &name, unsigned int level, const string &description,\n\n int def, const pair<map<string,pair<int,string> >,string> &dictionary);\n\n\n\n /**\n\n * @brief creates a new int-enum param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param def an alias of the default value\n\n * @param description details about the parameter\n\n * @param dictionary the alias dictionary this enum will use.\n\n * @note since ROS cannot send the enum and const descriptions, this method is useless.\n\n * Please use the constructor which takes a map<string,int> instead.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h","rank":73,"score":38302.43143425335},{"content":" int def, const map<string,int> &dictionary);\n\n\n\n /**\n\n * @brief creates a new int-enum param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param def an alias of the default value\n\n * @param description details about the parameter\n\n * @param dictionary the alias dictionary this enum will use.\n\n */\n\n DDEnum(const string &name, unsigned int level, const string &description,\n\n const string& def, const map<string,int> &dictionary);\n\n\n\n #ifdef __clang__\n\n #pragma clang diagnostic push\n\n #pragma ide diagnostic ignored \"OCUnusedGlobalDeclarationInspection\"\n\n #endif\n\n /**\n\n * @brief creates a new int-enum param\n\n * @param name the name of the parameter\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h","rank":74,"score":38302.37190159722},{"content":" /**\n\n * creates a new int param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param def the default value\n\n * @param description details about the parameter\n\n * @param max the maximum allowed value. Defaults to INT32_MAX\n\n * @param min the minimum allowed value. Defaults to INT32_MIN\n\n */\n\n inline DDInt(const string &name, unsigned int level, const string &description,\n\n int def, int min = INT32_MIN, int max = INT32_MAX) {\n\n name_ = name;\n\n level_ = level;\n\n desc_ = description;\n\n def_ = def;\n\n val_ = def;\n\n max_ = max;\n\n min_ = min;\n\n }\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h","rank":75,"score":38301.395452110286},{"content":"//\n\n// Created by Noam Dori on 19/06/18.\n\n//\n\n\n\n#ifndef DDYNAMIC_RECONFIGURE_DD_INT_PARAM_H\n\n#define DDYNAMIC_RECONFIGURE_DD_INT_PARAM_H\n\n\n\n#include \"ddynamic_reconfigure/dd_param.h\"\n\n\n\nnamespace ddynamic_reconfigure {\n\n /**\n\n * @brief an integer implementation of the parameter.\n\n * This is used to 32 bit signed integral numbers.\n\n * This can also handle shorts, bytes, and other integrals provided they are not too big\n\n * (by then looping will occur)\n\n */\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h","rank":76,"score":38300.92849012372},{"content":" protected:\n\n /**\n\n * @brief the level of the parameter:\n\n * the degree in which things need to be shut down if this param changes\n\n */\n\n unsigned int level_;\n\n /**\n\n * @brief the default value (def_),\n\n * the current value (val_),\n\n * the minimum allowed value (min_),\n\n * and the maximum allowed value (max_)\n\n */\n\n int def_,max_,min_,val_;\n\n /**\n\n * @brief the name of the parameter (name_),\n\n * and its description (desc_)\n\n */\n\n string name_, desc_;\n\n };\n\n}\n\n\n\n#endif //DDYNAMIC_RECONFIGURE_DD_INT_PARAM_H\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h","rank":77,"score":38300.75745366544},{"content":" class SyncedImuPublisher\n\n {\n\n public:\n\n SyncedImuPublisher() {_is_enabled=false;};\n\n SyncedImuPublisher(ros::Publisher imu_publisher, std::size_t waiting_list_size=1000);\n\n ~SyncedImuPublisher();\n\n void Pause(); // Pause sending messages. All messages from now on are saved in queue.\n\n void Resume(); // Send all pending messages and allow sending future messages.\n\n void Publish(sensor_msgs::Imu msg); //either send or hold message.\n\n uint32_t getNumSubscribers() { return _publisher.getNumSubscribers();};\n\n void Enable(bool is_enabled) {_is_enabled=is_enabled;};\n\n \n\n private:\n\n void PublishPendingMessages();\n\n\n\n private:\n\n std::mutex _mutex;\n\n ros::Publisher _publisher;\n\n bool _pause_mode;\n\n std::queue<sensor_msgs::Imu> _pending_messages;\n\n std::size_t _waiting_list_size;\n\n bool _is_enabled;\n\n };\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":78,"score":38297.643077376444},{"content":" class DDParam {\n\n public:\n\n\n\n /**\n\n * @brief gets the name of the parameter, that is, the ID used in the program when requesting it.\n\n * @return the unique string name of the parameter.\n\n */\n\n virtual string getName() const = 0;\n\n\n\n /**\n\n * @brief fetches the level of the parameter\n\n * @return the level of the param.\n\n */\n\n virtual int getLevel() const = 0;\n\n\n\n /**\n\n * @brief gets the value of this parameter.\n\n * @return the value stored in this param.\n\n */\n\n virtual Value getValue() const = 0;\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":79,"score":38297.643077376444},{"content":"namespace realsense2_camera\n\n{\n\n const uint16_t SR300_PID = 0x0aa5; // SR300\n\n const uint16_t RS400_PID = 0x0ad1; // PSR\n\n const uint16_t RS410_PID = 0x0ad2; // ASR\n\n const uint16_t RS415_PID = 0x0ad3; // ASRC\n\n const uint16_t RS430_PID = 0x0ad4; // AWG\n\n const uint16_t RS430_MM_PID = 0x0ad5; // AWGT\n\n const uint16_t RS_USB2_PID = 0x0ad6; // USB2\n\n const uint16_t RS420_PID = 0x0af6; // PWG\n\n const uint16_t RS420_MM_PID = 0x0afe; // PWGT\n\n const uint16_t RS410_MM_PID = 0x0aff; // ASR\n\n const uint16_t RS400_MM_PID = 0x0b00; // PSR\n\n const uint16_t RS430_MM_RGB_PID = 0x0b01; // AWGCT\n\n const uint16_t RS460_PID = 0x0b03; // DS5U\n\n const uint16_t RS435_RGB_PID = 0x0b07; // AWGC\n\n const uint16_t RS435i_RGB_PID = 0x0B3A; // AWGC_MM\n\n const uint16_t RS405_PID = 0x0b0c; // DS5U\n\n const uint16_t RS_T265_PID = 0x0b37; // \n\n \n\n\n\n const bool ALIGN_DEPTH = false;\n\n const bool POINTCLOUD = false;\n\n const bool ALLOW_NO_TEXTURE_POINTS = false;\n\n const bool SYNC_FRAMES = false;\n\n\n\n const int IMAGE_WIDTH = 640;\n\n const int IMAGE_HEIGHT = 480;\n\n const int IMAGE_FPS = 30;\n\n\n\n const int IMU_FPS = 0;\n\n\n\n\n\n const bool ENABLE_DEPTH = true;\n\n const bool ENABLE_INFRA1 = true;\n\n const bool ENABLE_INFRA2 = true;\n\n const bool ENABLE_COLOR = true;\n\n const bool ENABLE_FISHEYE = true;\n\n const bool ENABLE_IMU = true;\n\n const bool HOLD_BACK_IMU_FOR_FRAMES = false;\n\n const bool PUBLISH_ODOM_TF = true;\n\n\n\n\n\n const std::string DEFAULT_BASE_FRAME_ID = \"camera_link\";\n\n const std::string DEFAULT_ODOM_FRAME_ID = \"odom_frame\";\n\n const std::string DEFAULT_DEPTH_FRAME_ID = \"camera_depth_frame\";\n\n const std::string DEFAULT_INFRA1_FRAME_ID = \"camera_infra1_frame\";\n\n const std::string DEFAULT_INFRA2_FRAME_ID = \"camera_infra2_frame\";\n\n const std::string DEFAULT_COLOR_FRAME_ID = \"camera_color_frame\";\n\n const std::string DEFAULT_FISHEYE_FRAME_ID = \"camera_fisheye_frame\";\n\n const std::string DEFAULT_IMU_FRAME_ID = \"camera_imu_frame\";\n\n\n\n const std::string DEFAULT_DEPTH_OPTICAL_FRAME_ID = \"camera_depth_optical_frame\";\n\n const std::string DEFAULT_INFRA1_OPTICAL_FRAME_ID = \"camera_infra1_optical_frame\";\n\n const std::string DEFAULT_INFRA2_OPTICAL_FRAME_ID = \"camera_infra2_optical_frame\";\n\n const std::string DEFAULT_COLOR_OPTICAL_FRAME_ID = \"camera_color_optical_frame\";\n\n const std::string DEFAULT_FISHEYE_OPTICAL_FRAME_ID = \"camera_fisheye_optical_frame\";\n\n const std::string DEFAULT_ACCEL_OPTICAL_FRAME_ID = \"camera_accel_optical_frame\";\n\n const std::string DEFAULT_GYRO_OPTICAL_FRAME_ID = \"camera_gyro_optical_frame\";\n\n const std::string DEFAULT_IMU_OPTICAL_FRAME_ID = \"camera_imu_optical_frame\";\n\n\n\n const std::string DEFAULT_ALIGNED_DEPTH_TO_COLOR_FRAME_ID = \"camera_aligned_depth_to_color_frame\";\n\n const std::string DEFAULT_ALIGNED_DEPTH_TO_INFRA1_FRAME_ID = \"camera_aligned_depth_to_infra1_frame\";\n\n const std::string DEFAULT_ALIGNED_DEPTH_TO_INFRA2_FRAME_ID = \"camera_aligned_depth_to_infra2_frame\";\n\n const std::string DEFAULT_ALIGNED_DEPTH_TO_FISHEYE_FRAME_ID = \"camera_aligned_depth_to_fisheye_frame\";\n\n\n\n const std::string DEFAULT_UNITE_IMU_METHOD = \"\";\n\n const std::string DEFAULT_FILTERS = \"\";\n\n const std::string DEFAULT_TOPIC_ODOM_IN = \"\";\n\n\n\n const float ROS_DEPTH_SCALE = 0.001;\n\n using stream_index_pair = std::pair<rs2_stream, int>;\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/constants.h","rank":80,"score":38297.643077376444},{"content":" class DDynamicReconfigure {\n\n public:\n\n /**\n\n * @brief creates the most basic instance of a 2d-conf object.\n\n * @param nh the node handler of the node this is placed at.\n\n */\n\n explicit DDynamicReconfigure(ros::NodeHandle &nh);\n\n\n\n /**\n\n * @brief adds a parameter to the list, allowing it to be generated.\n\n * @param param the pointer to the 2d-param to add to the list.\n\n */\n\n virtual void add(DDPtr param);\n\n\n\n /**\n\n * @brief a convenience method for adding a parameter to the list, allowing it to be generated.\n\n * @warning When adding in this manner, you must be careful. After using this method to add the parameter,\n\n * running any of the \"remove\" methods on this object WILL cause the entire param object to be deleted!\n\n * To make sure that you can add the object back after removing it, please use the other \"add\" method.\n\n * @param param the pointer to the 2d-param to add to the list.\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h","rank":81,"score":37531.333153857384},{"content":" class InterfaceRealSenseNode\n\n {\n\n public:\n\n virtual void publishTopics() = 0;\n\n virtual void registerDynamicReconfigCb(ros::NodeHandle& nh) = 0;\n\n virtual ~InterfaceRealSenseNode() = default;\n\n };\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h","rank":82,"score":37531.333153857384},{"content":"#define REALSENSE_ROS_VERSION_STR (VAR_ARG_STRING(REALSENSE_ROS_MAJOR_VERSION.REALSENSE_ROS_MINOR_VERSION.REALSENSE_ROS_PATCH_VERSION))\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/constants.h","rank":83,"score":36804.170616516756},{"content":"#define REALSENSE_ROS_MINOR_VERSION 2\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/constants.h","rank":84,"score":36795.08833403484},{"content":"#define REALSENSE_ROS_MAJOR_VERSION 2\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/constants.h","rank":85,"score":36795.08833403484},{"content":"#define REALSENSE_ROS_PATCH_VERSION 4\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/constants.h","rank":86,"score":36795.08833403484},{"content":"\tclass PipelineSyncer : public rs2::asynchronous_syncer\n\n\t{\n\n\tpublic: \n\n\t\tvoid operator()(rs2::frame f) const\n\n\t\t{\n\n\t\t\tinvoke(std::move(f));\n\n\t\t}\n\n\t};\n\n\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":87,"score":36087.17331523018},{"content":" class DDParam;// declaration for the sake of order.\n\n // this is the pointer to any type of Dynamic Dynamic parameter.\n\n typedef boost::shared_ptr<DDParam> DDPtr;\n\n /**\n\n * @brief The DDParam class is the abstraction of all parameter types, and is the template for creating them.\n\n * At this point, not much is known about the parameter, but the following:\n\n *\n\n * - the parameter has a name\n\n * - the parameter has a severity level\n\n * - the parameter has a description\n\n * - the parameter contains some value, though its type and contents are unknown.\n\n *\n\n * Other than storing data, the parameter also has specialised methods to interact with DDynamicReconfigure in order to apply changes and send them.\n\n * These methods should not be touched by the user.\n\n *\n\n * Since this class is abstract, the class has multiple implementations whicch are not directly exposed but are used,\n\n * so its worth checking out their descriptions.\n\n *\n\n * While this class is abstract, it does have one implemented thing, and that is its stream operator (`<<`) which can be freely used.\n\n *\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h","rank":88,"score":36087.17331523018},{"content":" class RealSenseNodeFactory : public nodelet::Nodelet\n\n {\n\n public:\n\n RealSenseNodeFactory();\n\n virtual ~RealSenseNodeFactory();\n\n\n\n private:\n\n void closeDevice();\n\n void StartDevice();\n\n void change_device_callback(rs2::event_information& info);\n\n void getDevice(rs2::device_list list);\n\n virtual void onInit() override;\n\n void tryGetLogSeverity(rs2_log_severity& severity) const;\n\n\n\n rs2::device _device;\n\n std::unique_ptr<InterfaceRealSenseNode> _realSenseNode;\n\n rs2::context _ctx;\n\n std::string _serial_no;\n\n bool _initial_reset;\n\n std::thread _query_thread;\n\n\n\n };\n\n}//end namespace\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h","rank":89,"score":35405.98381859954},{"content":" class T265RealsenseNode : public BaseRealSenseNode\n\n {\n\n public:\n\n T265RealsenseNode(ros::NodeHandle& nodeHandle,\n\n ros::NodeHandle& privateNodeHandle,\n\n rs2::device dev,\n\n const std::string& serial_no);\n\n void publishTopics();\n\n\n\n protected:\n\n void calcAndPublishStaticTransform(const stream_index_pair& stream, const rs2::stream_profile& base_profile) override;\n\n\n\n private:\n\n void initializeOdometryInput();\n\n void setupSubscribers();\n\n void odom_in_callback(const nav_msgs::Odometry::ConstPtr& msg);\n\n\n\n ros::Subscriber _odom_subscriber;\n\n rs2::wheel_odometer _wo_snr;\n\n bool _use_odom_in;\n\n };\n\n}\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/t265_realsense_node.h","rank":90,"score":34750.03445206085},{"content":" class DDInt : virtual public DDParam {\n\n public:\n\n string getName() const;\n\n\n\n void prepGroup(Group &group);\n\n\n\n void prepConfig(Config &conf);\n\n\n\n void prepConfigDescription(ConfigDescription &conf_desc);\n\n\n\n int getLevel() const;\n\n\n\n bool sameType(Value val);\n\n\n\n bool sameValue(Value val);\n\n\n\n void setValue(Value val);\n\n\n\n Value getValue() const;\n\n\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h","rank":91,"score":34117.947897826416},{"content":" class BaseRealSenseNode : public InterfaceRealSenseNode\n\n {\n\n public:\n\n BaseRealSenseNode(ros::NodeHandle& nodeHandle,\n\n ros::NodeHandle& privateNodeHandle,\n\n rs2::device dev,\n\n const std::string& serial_no);\n\n\n\n void toggleSensors(bool enabled);\n\n virtual void publishTopics() override;\n\n virtual void registerDynamicReconfigCb(ros::NodeHandle& nh) override;\n\n virtual ~BaseRealSenseNode() {}\n\n\n\n public:\n\n enum imu_sync_method{NONE, COPY, LINEAR_INTERPOLATION};\n\n\n\n protected:\n","file_path":"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h","rank":92,"score":34117.947897826416},{"content":" class DDEnum : virtual public DDInt {\n\n public:\n\n\n\n void prepGroup(Group &group);\n\n\n\n bool sameType(Value val);\n\n\n\n bool sameValue(Value val);\n\n\n\n void setValue(Value val);\n\n\n\n /**\n\n * @brief creates a new int-enum param\n\n * @param name the name of the parameter\n\n * @param level the change level\n\n * @param def the default value in integer form\n\n * @param description details about the parameter\n\n * @param dictionary the alias dictionary this enum will use.\n\n */\n\n DDEnum(const string &name, unsigned int level, const string &description,\n","file_path":"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h","rank":93,"score":34117.947897826416},{"content":"function map(x,old_low,old_high,new_low,new_high)\n\n return ((x-old_low)*((new_high-new_low)/(old_high-old_low))) + new_low\n\nend\n\n\n","file_path":"sih/Controlling-UAV-in-V-REP-via-ROS-master/child_script.lua","rank":94,"score":16835.55892814097},{"content":"#include <ros/ros.h>\n\n#include <serial/serial.h>\n\n#include <std_msgs/String.h>\n\n#include <string>\n\n#include <swiftpro/SwiftproState.h>\n\n\n\nserial::Serial _serial;\t\t\t\t// serial object\n\nfloat position[4] = {0.0};\t\t\t// 3 cartesian coordinates: x, y, z(mm) and 1 angle(degree)\n\nchar strdata[2048];\t\t\t\t// global variables for handling string\n\n\n\n\n\nvoid handlestr()\n\n{\n\n\tchar *pch = strtok(strdata, \" \");\n\n\tfloat value[8];\n\n\tint index = 0;\n\n\n\n\twhile (pch != NULL && index < 5)\n\n\t{\n\n\t\tvalue[index] = atof(pch+1);\n","file_path":"uarm/src/swiftpro_read_node2.cpp","rank":96,"score":16.91888013677238},{"content":" * Description: callback when receive data from position_write_topic\n\n * Inputs: \t\tmsg(float)\t\t\t3 cartesian coordinates: x, y, z(mm)\n\n * Outputs:\t\tGcode\t\t\t\tsend gcode to control swift pro\n\n */\n\nvoid position_write_callback(const swiftpro::position& msg)\n\n{\n\n\tstd::string Gcode = \"\";\n\n\tstd_msgs::String result;\n\n\tchar x[10];\n\n\tchar y[10];\n\n\tchar z[10];\n\n\n\n\tpos.x = msg.x;\n\n\tpos.y = msg.y;\n\n\tpos.z = msg.z;\n\n\tsprintf(x, \"%.2f\", msg.x);\n\n\tsprintf(y, \"%.2f\", msg.y);\n\n\tsprintf(z, \"%.2f\", msg.z);\n\n\tGcode = (std::string)\"G0 X\" + x + \" Y\" + y + \" Z\" + z + \" F10000\" + \"\\r\\n\";\n\n\tROS_INFO(\"%s\", Gcode.c_str());\n","file_path":"uarm/src/swiftpro_write_node2.cpp","rank":97,"score":16.223595357838498},{"content":" * Description: callback when receive data from position_write_topic\n\n * Inputs: \t\tmsg(float)\t\t\t3 cartesian coordinates: x, y, z(mm)\n\n * Outputs:\t\tGcode\t\t\t\tsend gcode to control swift pro\n\n */\n\nvoid position_write_callback(const swiftpro::position& msg)\n\n{\n\n\tstd::string Gcode = \"\";\n\n\tstd_msgs::String result;\n\n\tchar x[10];\n\n\tchar y[10];\n\n\tchar z[10];\n\n\n\n\tpos.x = msg.x;\n\n\tpos.y = msg.y;\n\n\tpos.z = msg.z;\n\n\tsprintf(x, \"%.2f\", msg.x);\n\n\tsprintf(y, \"%.2f\", msg.y);\n\n\tsprintf(z, \"%.2f\", msg.z);\n\n\tGcode = (std::string)\"G0 X\" + x + \" Y\" + y + \" Z\" + z + \" F10000\" + \"\\r\\n\";\n\n\tROS_INFO(\"%s\", Gcode.c_str());\n","file_path":"swiftpro/src/swiftpro_write_node.cpp","rank":98,"score":16.223595357838498}],"string":"[\n {\n \"content\": \" class DDDouble : virtual public DDParam {\\n\\n public:\\n\\n string getName() const;\\n\\n\\n\\n void prepGroup(Group &group);\\n\\n\\n\\n void prepConfig(Config &conf);\\n\\n\\n\\n void prepConfigDescription(ConfigDescription &conf_desc);\\n\\n\\n\\n int getLevel() const;\\n\\n\\n\\n bool sameType(Value val);\\n\\n\\n\\n bool sameValue(Value val);\\n\\n\\n\\n void setValue(Value val);\\n\\n\\n\\n Value getValue() const;\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h\",\n \"rank\": 0,\n \"score\": 79677.44074427793\n },\n {\n \"content\": \" class DDBool : virtual public DDParam {\\n\\n public:\\n\\n string getName() const;\\n\\n\\n\\n void prepGroup(Group &group);\\n\\n\\n\\n void prepConfig(Config &conf);\\n\\n\\n\\n void prepConfigDescription(ConfigDescription &conf_desc);\\n\\n\\n\\n int getLevel() const;\\n\\n\\n\\n bool sameType(Value val);\\n\\n\\n\\n bool sameValue(Value val);\\n\\n\\n\\n void setValue(Value val);\\n\\n\\n\\n Value getValue() const;\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h\",\n \"rank\": 1,\n \"score\": 79677.44074427793\n },\n {\n \"content\": \" class DDString : virtual public DDParam {\\n\\n public:\\n\\n string getName() const;\\n\\n\\n\\n void prepGroup(Group &group);\\n\\n\\n\\n void prepConfig(Config &conf);\\n\\n\\n\\n void prepConfigDescription(ConfigDescription &conf_desc);\\n\\n\\n\\n int getLevel() const;\\n\\n\\n\\n bool sameType(Value val);\\n\\n\\n\\n bool sameValue(Value val);\\n\\n\\n\\n void setValue(Value val);\\n\\n\\n\\n Value getValue() const;\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h\",\n \"rank\": 2,\n \"score\": 79677.44074427793\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_DOUBLE_PARAM_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_DOUBLE_PARAM_H\\n\\n\\n\\n#include \\\"ddynamic_reconfigure/dd_param.h\\\"\\n\\n\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n typedef numeric_limits<double> d_limit;\\n\\n /**\\n\\n * @brief a double implementation of the parameter.\\n\\n * This is used to handle double-precision floating point numbers,\\n\\n * though it can handle single precision as well.\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h\",\n \"rank\": 3,\n \"score\": 77108.39162659523\n },\n {\n \"content\": \" /**\\n\\n * @brief creates a new bool param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param description details about the parameter\\n\\n * @param def the default value\\n\\n */\\n\\n DDBool(const string &name, unsigned int level, const string &description, bool def) {\\n\\n name_ = name;\\n\\n level_ = level;\\n\\n desc_ = description;\\n\\n def_ = def;\\n\\n val_ = def;\\n\\n }\\n\\n protected:\\n\\n /**\\n\\n * @brief the level of the parameter:\\n\\n * the degree in which things need to be shut down if this param changes\\n\\n */\\n\\n unsigned int level_;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h\",\n \"rank\": 4,\n \"score\": 77106.21933363154\n },\n {\n \"content\": \" /**\\n\\n * @brief the default value (def_),\\n\\n * and the current value (val_)\\n\\n */\\n\\n bool def_,val_;\\n\\n /**\\n\\n * @brief the name of the parameter (name_),\\n\\n * and its description (desc_)\\n\\n */\\n\\n string name_, desc_;\\n\\n };\\n\\n}\\n\\n\\n\\n\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_BOOL_PARAM_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h\",\n \"rank\": 5,\n \"score\": 77105.95734924369\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_STRING_PARAM_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_STRING_PARAM_H\\n\\n\\n\\n#include \\\"ddynamic_reconfigure/dd_param.h\\\"\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n /**\\n\\n * @brief a string implementation of the parameter.\\n\\n * This is used to handle strings of characters of variable length.\\n\\n * Like string, each param value can hold up to 2^32-1 characters.\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h\",\n \"rank\": 6,\n \"score\": 77105.9616865491\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_BOOL_PARAM_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_BOOL_PARAM_H\\n\\n\\n\\n#include \\\"ddynamic_reconfigure/dd_param.h\\\"\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n /**\\n\\n * @brief a boolean implementation of the parameter.\\n\\n * These are used to handle true/false values, or bit quantities if needed.\\n\\n * In ROS, booleans are handled as u-bytes (u-int8), so be careful with these!\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_bool_param.h\",\n \"rank\": 7,\n \"score\": 77105.19595149056\n },\n {\n \"content\": \" /**\\n\\n * creates a new double param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param def the default value\\n\\n * @param description details about the parameter\\n\\n * @param max the maximum allowed value. Defaults to DBL_MAX\\n\\n * @param min the minimum allowed value. Defaults to -DBL_MAX\\n\\n */\\n\\n DDDouble(const string &name, unsigned int level, const string &description, double def,\\n\\n double min = -d_limit::infinity(), double max = d_limit::infinity())\\n\\n : max_(), min_() {\\n\\n name_ = name;\\n\\n level_ = level;\\n\\n desc_ = description;\\n\\n def_ = def;\\n\\n val_ = def;\\n\\n max_ = max;\\n\\n min_ = min;\\n\\n }\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h\",\n \"rank\": 8,\n \"score\": 77104.24240649953\n },\n {\n \"content\": \" protected:\\n\\n /**\\n\\n * @brief the level of the parameter:\\n\\n * the degree in which things need to be shut down if this param changes\\n\\n */\\n\\n unsigned int level_;\\n\\n /**\\n\\n * @brief the default value (def_),\\n\\n * the current value (val_),\\n\\n * the minimum allowed value (min_),\\n\\n * and the maximum allowed value (max_)\\n\\n */\\n\\n double def_,max_,min_,val_;\\n\\n /**\\n\\n * @brief the name of the parameter (name_),\\n\\n * and its description (desc_)\\n\\n */\\n\\n string name_, desc_;\\n\\n };\\n\\n}\\n\\n\\n\\n\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_DOUBLE_PARAM_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_double_param.h\",\n \"rank\": 9,\n \"score\": 77104.00753056731\n },\n {\n \"content\": \" /**\\n\\n * creates a new string param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param description details about the parameter\\n\\n * @param def the default value\\n\\n */\\n\\n DDString(const string &name, unsigned int level, const string &description, const string &def) {\\n\\n name_ = name;\\n\\n level_ = level;\\n\\n desc_ = description;\\n\\n def_ = def;\\n\\n val_ = def;\\n\\n }\\n\\n protected:\\n\\n /**\\n\\n * @brief the level of the parameter:\\n\\n * the degree in which things need to be shut down if this param changes\\n\\n */\\n\\n unsigned int level_;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h\",\n \"rank\": 10,\n \"score\": 77102.53449879441\n },\n {\n \"content\": \" /**\\n\\n * @brief the default value (def_),\\n\\n * and the current value (val_)\\n\\n */\\n\\n string def_,val_;\\n\\n /**\\n\\n * @brief the name of the parameter (name_),\\n\\n * and its description (desc_)\\n\\n */\\n\\n string name_, desc_;\\n\\n };\\n\\n}\\n\\n\\n\\n\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_STRING_PARAM_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_string_param.h\",\n \"rank\": 11,\n \"score\": 77102.47950733577\n },\n {\n \"content\": \" };\\n\\n\\n\\n std::string _base_frame_id;\\n\\n std::string _odom_frame_id;\\n\\n std::map<stream_index_pair, std::string> _frame_id;\\n\\n std::map<stream_index_pair, std::string> _optical_frame_id;\\n\\n std::map<stream_index_pair, std::string> _depth_aligned_frame_id;\\n\\n ros::NodeHandle& _node_handle, _pnh;\\n\\n bool _align_depth;\\n\\n\\n\\n virtual void calcAndPublishStaticTransform(const stream_index_pair& stream, const rs2::stream_profile& base_profile);\\n\\n rs2::stream_profile getAProfile(const stream_index_pair& stream);\\n\\n tf::Quaternion rotationMatrixToQuaternion(const float rotation[9]) const;\\n\\n void publish_static_tf(const ros::Time& t,\\n\\n const float3& trans,\\n\\n const tf::Quaternion& q,\\n\\n const std::string& from,\\n\\n const std::string& to);\\n\\n\\n\\n\\n\\n private:\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 12,\n \"score\": 40809.74622657525\n },\n {\n \"content\": \" void clip_depth(rs2::depth_frame depth_frame, float clipping_dist);\\n\\n void updateStreamCalibData(const rs2::video_stream_profile& video_profile);\\n\\n void publishStaticTransforms();\\n\\n void publishPointCloud(rs2::points f, const ros::Time& t, const rs2::frameset& frameset);\\n\\n Extrinsics rsExtrinsicsToMsg(const rs2_extrinsics& extrinsics, const std::string& frame_id) const;\\n\\n\\n\\n IMUInfo getImuInfo(const stream_index_pair& stream_index);\\n\\n void publishFrame(rs2::frame f, const ros::Time& t,\\n\\n const stream_index_pair& stream,\\n\\n std::map<stream_index_pair, cv::Mat>& images,\\n\\n const std::map<stream_index_pair, ros::Publisher>& info_publishers,\\n\\n const std::map<stream_index_pair, ImagePublisherWithFrequencyDiagnostics>& image_publishers,\\n\\n std::map<stream_index_pair, int>& seq,\\n\\n std::map<stream_index_pair, sensor_msgs::CameraInfo>& camera_info,\\n\\n const std::map<stream_index_pair, std::string>& optical_frame_id,\\n\\n const std::map<rs2_stream, std::string>& encoding,\\n\\n bool copy_data_from_frame = true);\\n\\n bool getEnabledProfile(const stream_index_pair& stream_index, rs2::stream_profile& profile);\\n\\n\\n\\n void publishAlignedDepthToOthers(rs2::frameset frames, const ros::Time& t);\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 13,\n \"score\": 40808.84455708749\n },\n {\n \"content\": \"\\n\\n public:\\n\\n CIMUHistory(size_t size);\\n\\n void add_data(sensor_name module, imuData data);\\n\\n bool is_all_data(sensor_name);\\n\\n bool is_data(sensor_name);\\n\\n const std::list<imuData>& get_data(sensor_name module);\\n\\n imuData last_data(sensor_name module);\\n\\n };\\n\\n\\n\\n static std::string getNamespaceStr();\\n\\n void getParameters();\\n\\n void setupDevice();\\n\\n void setupErrorCallback();\\n\\n void setupPublishers();\\n\\n void enable_devices();\\n\\n void setupFilters();\\n\\n void setupStreams();\\n\\n void setBaseTime(double frame_time, bool warn_no_metadata);\\n\\n cv::Mat& fix_depth_scale(const cv::Mat& from_image, cv::Mat& to_image);\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 14,\n \"score\": 40808.444225162224\n },\n {\n \"content\": \" static void callback(const ddynamic_reconfigure::DDMap& map, int, rs2::options sensor);\\n\\n double FillImuData_Copy(const stream_index_pair stream_index, const CIMUHistory::imuData imu_data, sensor_msgs::Imu& imu_msg);\\n\\n double FillImuData_LinearInterpolation(const stream_index_pair stream_index, const CIMUHistory::imuData imu_data, sensor_msgs::Imu& imu_msg);\\n\\n void imu_callback(rs2::frame frame);\\n\\n void imu_callback_sync(rs2::frame frame, imu_sync_method sync_method=imu_sync_method::COPY);\\n\\n void pose_callback(rs2::frame frame);\\n\\n void multiple_message_callback(rs2::frame frame, imu_sync_method sync_method);\\n\\n void frame_callback(rs2::frame frame);\\n\\n void registerDynamicOption(ros::NodeHandle& nh, rs2::options sensor, std::string& module_name);\\n\\n rs2_stream rs2_string_to_stream(std::string str);\\n\\n\\n\\n rs2::device _dev;\\n\\n std::map<stream_index_pair, rs2::sensor> _sensors;\\n\\n std::map<std::string, std::function<void(rs2::frame)>> _sensors_callback;\\n\\n std::vector<std::shared_ptr<ddynamic_reconfigure::DDynamicReconfigure>> _ddynrec;\\n\\n\\n\\n std::string _json_file_path;\\n\\n std::string _serial_no;\\n\\n float _depth_scale_meters;\\n\\n float _clipping_distance;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 15,\n \"score\": 40808.044077748644\n },\n {\n \"content\": \" std::map<rs2_stream, std::string> _encoding;\\n\\n\\n\\n std::map<stream_index_pair, int> _seq;\\n\\n std::map<rs2_stream, int> _unit_step_size;\\n\\n std::map<stream_index_pair, sensor_msgs::CameraInfo> _camera_info;\\n\\n std::atomic_bool _is_initialized_time_base;\\n\\n double _camera_time_base;\\n\\n std::map<stream_index_pair, std::vector<rs2::stream_profile>> _enabled_profiles;\\n\\n\\n\\n ros::Publisher _pointcloud_publisher;\\n\\n ros::Time _ros_time_base;\\n\\n bool _sync_frames;\\n\\n bool _pointcloud;\\n\\n bool _publish_odom_tf;\\n\\n imu_sync_method _imu_sync_method;\\n\\n std::string _filters_str;\\n\\n stream_index_pair _pointcloud_texture;\\n\\n PipelineSyncer _syncer;\\n\\n std::vector<NamedFilter> _filters;\\n\\n std::vector<rs2::sensor> _dev_sensors;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 16,\n \"score\": 40804.194500413156\n },\n {\n \"content\": \" bool _allow_no_texture_points;\\n\\n\\n\\n double _linear_accel_cov;\\n\\n double _angular_velocity_cov;\\n\\n bool _hold_back_imu_for_frames;\\n\\n\\n\\n std::map<stream_index_pair, rs2_intrinsics> _stream_intrinsics;\\n\\n std::map<stream_index_pair, int> _width;\\n\\n std::map<stream_index_pair, int> _height;\\n\\n std::map<stream_index_pair, int> _fps;\\n\\n std::map<stream_index_pair, bool> _enable;\\n\\n std::map<rs2_stream, std::string> _stream_name;\\n\\n tf2_ros::StaticTransformBroadcaster _static_tf_broadcaster;\\n\\n\\n\\n std::map<stream_index_pair, ImagePublisherWithFrequencyDiagnostics> _image_publishers;\\n\\n std::map<stream_index_pair, ros::Publisher> _imu_publishers;\\n\\n std::shared_ptr<SyncedImuPublisher> _synced_imu_publisher;\\n\\n std::map<rs2_stream, int> _image_format;\\n\\n std::map<stream_index_pair, ros::Publisher> _info_publisher;\\n\\n std::map<stream_index_pair, cv::Mat> _image;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 17,\n \"score\": 40802.39552450772\n },\n {\n \"content\": \"// License: Apache 2.0. See LICENSE file in root directory.\\n\\n// Copyright(c) 2018 Intel Corporation. All Rights Reserved\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <pluginlib/class_list_macros.h>\\n\\n#include <nodelet/nodelet.h>\\n\\n#include <image_transport/image_transport.h>\\n\\n#include <ros/ros.h>\\n\\n#include <ros/package.h>\\n\\n#include <librealsense2/rs.hpp>\\n\\n#include <librealsense2/rsutil.h>\\n\\n#include <librealsense2/hpp/rs_processing.hpp>\\n\\n#include <librealsense2/rs_advanced_mode.hpp>\\n\\n#include <cv_bridge/cv_bridge.h>\\n\\n#include <constants.h>\\n\\n#include <realsense2_camera/Extrinsics.h>\\n\\n#include <tf/transform_broadcaster.h>\\n\\n#include <tf2_ros/static_transform_broadcaster.h>\\n\\n#include <realsense2_camera/IMUInfo.h>\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h\",\n \"rank\": 18,\n \"score\": 40802.2347338902\n },\n {\n \"content\": \"// License: Apache 2.0. See LICENSE file in root directory.\\n\\n// Copyright(c) 2018 Intel Corporation. All Rights Reserved\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include \\\"../include/realsense_node_factory.h\\\"\\n\\n#include <ddynamic_reconfigure/ddynamic_reconfigure.h>\\n\\n#include <ddynamic_reconfigure/param/dd_all_params.h>\\n\\n\\n\\n#include <diagnostic_updater/diagnostic_updater.h>\\n\\n#include <diagnostic_updater/update_functions.h>\\n\\n#include <sensor_msgs/CameraInfo.h>\\n\\n#include <sensor_msgs/PointCloud2.h>\\n\\n#include <sensor_msgs/point_cloud2_iterator.h>\\n\\n#include <sensor_msgs/Imu.h>\\n\\n#include <nav_msgs/Odometry.h>\\n\\n\\n\\n#include <queue>\\n\\n#include <mutex>\\n\\n#include <atomic>\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 19,\n \"score\": 40802.23194057435\n },\n {\n \"content\": \"\\n\\nnamespace realsense2_camera\\n\\n{\\n\\n struct FrequencyDiagnostics\\n\\n {\\n\\n FrequencyDiagnostics(double expected_frequency, std::string name, std::string hardware_id) :\\n\\n expected_frequency_(expected_frequency),\\n\\n frequency_status_(diagnostic_updater::FrequencyStatusParam(&expected_frequency_, &expected_frequency_)),\\n\\n diagnostic_updater_(ros::NodeHandle(), ros::NodeHandle(\\\"~\\\"), ros::this_node::getName() + \\\"_\\\" + name)\\n\\n {\\n\\n ROS_INFO(\\\"Expected frequency for %s = %.5f\\\", name.c_str(), expected_frequency_);\\n\\n diagnostic_updater_.setHardwareID(hardware_id);\\n\\n diagnostic_updater_.add(frequency_status_);\\n\\n }\\n\\n\\n\\n void update()\\n\\n {\\n\\n frequency_status_.tick();\\n\\n diagnostic_updater_.update();\\n\\n }\\n\\n\\n\\n double expected_frequency_;\\n\\n diagnostic_updater::FrequencyStatus frequency_status_;\\n\\n diagnostic_updater::Updater diagnostic_updater_;\\n\\n };\\n\\n typedef std::pair<image_transport::Publisher, std::shared_ptr<FrequencyDiagnostics>> ImagePublisherWithFrequencyDiagnostics;\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 20,\n \"score\": 40802.141448700684\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <base_realsense_node.h>\\n\\n\\n\\nnamespace realsense2_camera\\n\\n{\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/t265_realsense_node.h\",\n \"rank\": 21,\n \"score\": 40800.95252651928\n },\n {\n \"content\": \"#include <csignal>\\n\\n#include <eigen3/Eigen/Geometry>\\n\\n#include <fstream>\\n\\n#include <thread>\\n\\n\\n\\nnamespace realsense2_camera\\n\\n{\\n\\n const stream_index_pair COLOR{RS2_STREAM_COLOR, 0};\\n\\n const stream_index_pair DEPTH{RS2_STREAM_DEPTH, 0};\\n\\n const stream_index_pair INFRA1{RS2_STREAM_INFRARED, 1};\\n\\n const stream_index_pair INFRA2{RS2_STREAM_INFRARED, 2};\\n\\n const stream_index_pair FISHEYE{RS2_STREAM_FISHEYE, 0};\\n\\n const stream_index_pair FISHEYE1{RS2_STREAM_FISHEYE, 1};\\n\\n const stream_index_pair FISHEYE2{RS2_STREAM_FISHEYE, 2};\\n\\n const stream_index_pair GYRO{RS2_STREAM_GYRO, 0};\\n\\n const stream_index_pair ACCEL{RS2_STREAM_ACCEL, 0};\\n\\n const stream_index_pair POSE{RS2_STREAM_POSE, 0};\\n\\n \\n\\n\\n\\n const std::vector<stream_index_pair> IMAGE_STREAMS = {DEPTH, INFRA1, INFRA2,\\n\\n COLOR,\\n\\n FISHEYE,\\n\\n FISHEYE1, FISHEYE2};\\n\\n\\n\\n const std::vector<stream_index_pair> HID_STREAMS = {GYRO, ACCEL, POSE};\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h\",\n \"rank\": 22,\n \"score\": 40800.922968044775\n },\n {\n \"content\": \" std::map<rs2_stream, std::shared_ptr<rs2::align>> _align;\\n\\n\\n\\n std::map<stream_index_pair, cv::Mat> _depth_aligned_image;\\n\\n std::map<stream_index_pair, cv::Mat> _depth_scaled_image;\\n\\n std::map<rs2_stream, std::string> _depth_aligned_encoding;\\n\\n std::map<stream_index_pair, sensor_msgs::CameraInfo> _depth_aligned_camera_info;\\n\\n std::map<stream_index_pair, int> _depth_aligned_seq;\\n\\n std::map<stream_index_pair, ros::Publisher> _depth_aligned_info_publisher;\\n\\n std::map<stream_index_pair, ImagePublisherWithFrequencyDiagnostics> _depth_aligned_image_publishers;\\n\\n std::map<stream_index_pair, ros::Publisher> _depth_to_other_extrinsics_publishers;\\n\\n std::map<stream_index_pair, rs2_extrinsics> _depth_to_other_extrinsics;\\n\\n\\n\\n const std::string _namespace;\\n\\n\\n\\n };//end class\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 23,\n \"score\": 40799.7916486708\n },\n {\n \"content\": \" * for native strings: if the string contains a floating value (for example \\\"1.1\\\" contains the double '1.1' in it),\\n\\n * it will return the double interpretation of that string.\\n\\n * Otherwise, returns the hash value of the string.\\n\\n */\\n\\n inline double toDouble() const {\\n\\n if(type_ == \\\"string\\\") {\\n\\n double f;\\n\\n if(sscanf(str_val_.c_str(), \\\"%lf\\\", &f) == 0) {\\n\\n return boost::hash<string>()(str_val_);\\n\\n }\\n\\n return f;\\n\\n } else if(type_ == \\\"bool\\\") {return bool_val_ ? 1.0 : 0.0;}\\n\\n else if(type_ == \\\"double\\\") {return double_val_;}\\n\\n else {return int_val_;}\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief converts the stored value into a boolean.\\n\\n * @return for native integers: returns true if the value is bigger than 0, false otherwise.\\n\\n * for native doubles: returns true if the value is bigger than 0, false otherwise.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 24,\n \"score\": 39943.171221738514\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n#include <string>\\n\\n#include <sstream>\\n\\n#include <cstdio>\\n\\n#include <boost/functional/hash.hpp>\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_VALUE_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_VALUE_H\\n\\nusing namespace std;\\n\\nusing namespace boost;\\n\\nnamespace ddynamic_reconfigure {\\n\\n /**\\n\\n * @brief The Value class is used to wrap all basic data-types (bool,int,double,string) in something generic.\\n\\n * The value object always stores an explicit basic data-type.\\n\\n * This has three main uses:\\n\\n *\\n\\n * 1. Values can represent all basic data-types.\\n\\n * This means that arguments that need something relatively similar from all basic data-types can now just use the value in its argument.\\n\\n * This also goes for when you need to return something that is of different data-types from different classes\\n\\n * (one can only return integer, other can only return strings).\\n\\n *\\n\\n * 2. Values can be explicitly converted to all basic data-types they wrap.\\n\\n * This means that converting an int to a string is far easier.\\n\\n *\\n\\n * 3. Values store the type they were instantiated with. This can be tested against to get the original piece of data the value stored.\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 25,\n \"score\": 39938.77387158079\n },\n {\n \"content\": \" * for native booleans: returns itself\\n\\n * for native strings: returns true if the string's value is 'true', false otherwise.\\n\\n */\\n\\n inline bool toBool() const {\\n\\n if(type_ == \\\"string\\\") { return str_val_ == \\\"true\\\";}\\n\\n else if(type_ == \\\"bool\\\") {return bool_val_;}\\n\\n else if(type_ == \\\"double\\\") {return double_val_ > 0.0;}\\n\\n else {return int_val_ > 0;}\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_VALUE_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 26,\n \"score\": 39938.08980184785\n },\n {\n \"content\": \" }\\n\\n\\n\\n /**\\n\\n * @brief creates an integer value wrapper\\n\\n * @param val the boolean to wrap\\n\\n */\\n\\n inline explicit Value(bool val) : int_val_(0), double_val_(0.0) {\\n\\n type_ = \\\"bool\\\";\\n\\n bool_val_ = val;\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief gets the type this value wrapper stores\\n\\n * @return a string containing the type: one of {\\\"int\\\",\\\"double\\\",\\\"bool\\\",\\\"string\\\"}\\n\\n */\\n\\n inline string getType() const {\\n\\n return type_;\\n\\n }\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 27,\n \"score\": 39937.85480458831\n },\n {\n \"content\": \" inline explicit Value(double val) : int_val_(0), bool_val_(false) {\\n\\n type_ = \\\"double\\\";\\n\\n double_val_ = val;\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief creates a string value wrapper\\n\\n * @param val the string to wrap\\n\\n */\\n\\n inline explicit Value(const string &val) : int_val_(0), double_val_(0.0), bool_val_(false) {\\n\\n type_ = \\\"string\\\";\\n\\n str_val_ = val;\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief creates a c-string value wrapper, though it is considered a regular string.\\n\\n * @param val the c-string to wrap\\n\\n */\\n\\n inline explicit Value(const char* val) : int_val_(0), double_val_(0.0), bool_val_(false) {\\n\\n *this = Value(string(val));\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 28,\n \"score\": 39937.64422929807\n },\n {\n \"content\": \" /**\\n\\n * @brief converts the stored value into a string.\\n\\n * @return for native integers: returns the number in string form ('1' -> \\\"1\\\")\\n\\n * for native doubles: returns the number in shorthand string form ('1.0' -> \\\"1\\\")\\n\\n * for native booleans: returns \\\"true\\\" if true, \\\"false\\\" if false.\\n\\n * for native strings: returns itself.\\n\\n */\\n\\n inline string toString() const {\\n\\n stringstream ss;\\n\\n if(type_ == \\\"string\\\") { return str_val_;}\\n\\n else if(type_ == \\\"bool\\\") {return bool_val_ ? \\\"true\\\" : \\\"false\\\";}\\n\\n else if(type_ == \\\"double\\\") {ss << double_val_; return ss.str();}\\n\\n else {ss << int_val_; return ss.str();}\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief converts the stored value into a double.\\n\\n * @return for native integers: returns itself\\n\\n * for native doubles: returns a itself\\n\\n * for native booleans: returns 1.0 if true, 0.0 if false.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 29,\n \"score\": 39937.21356079122\n },\n {\n \"content\": \" * @brief converts the stored value into an integer.\\n\\n * @return for native integers: returns itself.\\n\\n * for native doubles: returns a casted integer.\\n\\n * for native booleans: returns 1 if true, 0 if false.\\n\\n * for native strings: if the string contains an integer value (for example \\\"1\\\" contains the int '1' in it),\\n\\n * it will return the integer interpretation of that string.\\n\\n * Otherwise, returns the hash value of the string.\\n\\n */\\n\\n inline int toInt() const {\\n\\n if (type_ == \\\"string\\\") {\\n\\n int i;\\n\\n if (sscanf(str_val_.c_str(), \\\"%d\\\", &i) == 0) {\\n\\n return (int) boost::hash<string>()(str_val_);\\n\\n }\\n\\n return i;\\n\\n } else if (type_ == \\\"bool\\\") { return bool_val_ ? 1 : 0; }\\n\\n else if (type_ == \\\"double\\\") { return (int) double_val_; }\\n\\n else { return int_val_; }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 30,\n \"score\": 39937.18297174609\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 18/06/18.\\n\\n//\\n\\n//include space, written in C++03\\n\\n#include <ros/ros.h>\\n\\n#include <dynamic_reconfigure/server.h>\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <map>\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n#include <boost/function.hpp>\\n\\n#include <boost/bind.hpp>\\n\\n\\n\\n#include \\\"dd_param.h\\\"\\n\\nusing namespace std;\\n\\nusing namespace boost;\\n\\nusing namespace dynamic_reconfigure;\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 31,\n \"score\": 39936.880291619134\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 18/06/18.\\n\\n//\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_PARAM_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_PARAM_H\\n\\n\\n\\n#include <string>\\n\\n#include <dynamic_reconfigure/Group.h>\\n\\n#include <dynamic_reconfigure/Config.h>\\n\\n#include <dynamic_reconfigure/ConfigDescription.h>\\n\\n#include \\\"dd_value.h\\\"\\n\\n\\n\\nusing namespace dynamic_reconfigure;\\n\\nusing namespace std;\\n\\nnamespace ddynamic_reconfigure {\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 32,\n \"score\": 39936.558120903646\n },\n {\n \"content\": \" */\\n\\n virtual void add(DDParam *param);\\n\\n\\n\\n /**\\n\\n * removes the specified parameter from the list.\\n\\n * @param param the parameter to remove.\\n\\n */\\n\\n virtual void remove(DDPtr param);\\n\\n\\n\\n /**\\n\\n * removes the specified parameter from the list.\\n\\n * @param param the parameter to remove.\\n\\n */\\n\\n virtual void remove(DDParam *param);\\n\\n\\n\\n /**\\n\\n * removes the specified parameter from the list.\\n\\n * @param param_name the name of the parameter to remove.\\n\\n */\\n\\n virtual void remove(string param_name);\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 33,\n \"score\": 39935.96973014908\n },\n {\n \"content\": \" * While DDParam is abstract, all of its concrete implementations should follow this guideline:\\n\\n * DD<Type>(const string &name, unsigned int level, const string &description, <type> def, <extra-args>)\\n\\n * Where:\\n\\n * - <Type> is the type name you are implementing\\n\\n * - name is the reference name\\n\\n * - level is the severity level\\n\\n * - description is the object's description\\n\\n * - def is the default value and the first value stored right after construction.\\n\\n *\\n\\n * You may then include extra arguments as you wish, required or optional.\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 34,\n \"score\": 39935.58460999948\n },\n {\n \"content\": \" */\\n\\n void start(DDFunc callback);\\n\\n\\n\\n /**\\n\\n * @brief starts the server, using the given callback in method form.\\n\\n * @param callback a void pointer accepting a callback type with the method to use when values are updated.\\n\\n */\\n\\n void start(void(*callback)(const DDMap&, int));\\n\\n\\n\\n /**\\n\\n * @brief starts the server, using the given callback in class-wise static method form.\\n\\n * @param callback a class void pointer accepting a callback type with the method to use when values are updated.\\n\\n * @param obj the object used for reference in the class void\\n\\n * @tparam T the class of the object.\\n\\n */\\n\\n template<class T>\\n\\n void start(void(T::*callback)(const DDMap&, int), T *obj) {\\n\\n DDFunc f = bind(callback,obj,_1,_2);\\n\\n start();\\n\\n }\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 35,\n \"score\": 39933.268400506815\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief sets the callback to this.\\n\\n * @param callback a boost function with the method to use when values are updated.\\n\\n */\\n\\n void setCallback(DDFunc callback);\\n\\n\\n\\n /**\\n\\n * @brief sets the callback to be empty.\\n\\n */\\n\\n void clearCallback();\\n\\n\\n\\n /**\\n\\n * @brief starts the server and config, without having any callback.\\n\\n */\\n\\n virtual void start();\\n\\n\\n\\n /**\\n\\n * @brief starts the server, using the given callback in function form.\\n\\n * @param callback a boost function with the method to use when values are updated.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 36,\n \"score\": 39932.68245881599\n },\n {\n \"content\": \" * @param val the value to use\\n\\n */\\n\\n virtual void setValue(Value val) = 0;\\n\\n\\n\\n /**\\n\\n * @brief updates a group message according to this param's info.\\n\\n * @param group the group to update.\\n\\n * @note this is an internal method. It is recommended not to use it.\\n\\n */\\n\\n virtual void prepGroup(Group &group) = 0;\\n\\n\\n\\n /**\\n\\n * @brief updates a config message according to this param's info.\\n\\n * @param conf the group to update.\\n\\n * @note this is an internal method. It is recommended not to use it.\\n\\n */\\n\\n virtual void prepConfig(Config &conf) = 0;\\n\\n\\n\\n /**\\n\\n * @brief updates a config description message according to this param's info.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 37,\n \"score\": 39932.487202895674\n },\n {\n \"content\": \"#ifndef DDYNAMIC_RECONFIGURE_DDYNAMIC_RECONFIGURE_H\\n\\n#define DDYNAMIC_RECONFIGURE_DDYNAMIC_RECONFIGURE_H\\n\\nnamespace ddynamic_reconfigure {\\n\\n // this is a map from the DDParam name to the object. Acts like a set with a search function.\\n\\n typedef map<string,DDPtr> DDMap;\\n\\n // the function you will use a lot\\n\\n typedef boost::function<void(const DDMap&,int)> DDFunc;\\n\\n\\n\\n /**\\n\\n * @brief The DDynamicReconfigure class is the main class responsible for keeping track of parameters basic properties,\\n\\n * values, descriptions, etc.\\n\\n *\\n\\n * It is also responsible of handling callbacks, config change requests, description setup and config setup,\\n\\n * and the ROS publishers and services.\\n\\n *\\n\\n * To operate a DDynamic instance, you must go through the following procedure:\\n\\n *\\n\\n * 1. Construct a DDynamicReconfigure instance with proper handling.\\n\\n * 2. Add parameters to the instance as needed with any of the \\\"add\\\" methods.\\n\\n * 3. Start the ROS services with any of the \\\"start\\\" methods.\\n\\n * 4. If you need to change the callback after startup you may do so using \\\"setCallback\\\".\\n\\n * 5. When you need to get any of the stored parameters, call either \\\"get\\\" or \\\"at\\\" on this instance,\\n\\n * rather than through the callback.\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 38,\n \"score\": 39932.409006991445\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief a tool people who use this API can use to find the value given within the param map.\\n\\n * @param name the string to look for\\n\\n * @return the value of param with the given name if it exists, a string value containing \\\"\\\\000\\\" otherwise\\n\\n */\\n\\n Value get(const char* name);\\n\\n\\n\\n /**\\n\\n * @brief a tool people who use this API can use to find the param given within the param map.\\n\\n * @param name the string to look for\\n\\n * @return the param with the given name if it exists, nullptr otherwise\\n\\n */\\n\\n DDPtr at(const char* name);\\n\\n\\n\\n /**\\n\\n * @brief the operator taking care of streaming the param values\\n\\n * @param os the stream to place the param into\\n\\n * @param dd the dd-reconfigure you want to place into the stream\\n\\n * @return os, but with dd-reconfigure added.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 39,\n \"score\": 39932.21247917293\n },\n {\n \"content\": \" };\\n\\n\\n\\n /**\\n\\n * @brief a tool people who use this API can use to find the param given within the param map.\\n\\n * @param name the string to look for\\n\\n * @param map the map to search\\n\\n * @return the param with the given name if it exists, nullptr otherwise\\n\\n */\\n\\n DDPtr at(const DDMap& map, const char* name); // I could do this with an operator, but its bad design.\\n\\n\\n\\n /**\\n\\n * @brief a tool people who use this API can use to find the value given within the param map.\\n\\n * @param name the string to look for\\n\\n * @param map the map to search\\n\\n * @return the value of param with the given name if it exists, a string value containing \\\"\\\\000\\\" otherwise\\n\\n */\\n\\n Value get(const DDMap& map, const char* name); // I could do this with an operator, but its bad design.\\n\\n}\\n\\n#endif //DDYNAMIC_RECONFIGURE_DDYNAMIC_RECONFIGURE_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 40,\n \"score\": 39932.18891667058\n },\n {\n \"content\": \" \\n\\n /**\\n\\n * @brief checks whether or not the raw value stored in the value is compatible with the given parameter.\\n\\n * Compatible is a very broad word in this scenario.\\n\\n * It means that the value can be placed in the parameter regardless of other limitations.\\n\\n * @param val the value to test\\n\\n * @return true is this parameter can handle the original value, false otherwise.\\n\\n */\\n\\n virtual bool sameType(Value val) = 0;\\n\\n \\n\\n /**\\n\\n * @brief checks whether or not the value stored in the value object,\\n\\n * when converted to the type of the internal value, are equal. This acts regardless of type.\\n\\n * @param val the value to test\\n\\n * @return true is this parameter can is the same as the original value, false otherwise.\\n\\n */\\n\\n virtual bool sameValue(Value val) = 0;\\n\\n\\n\\n /**\\n\\n * @brief sets the value of this parameter as this one.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 41,\n \"score\": 39931.9393438403\n },\n {\n \"content\": \" * @param conf_desc the config description to update.\\n\\n * @note this is an internal method. It is recommended not to use it.\\n\\n */\\n\\n virtual void prepConfigDescription(ConfigDescription &conf_desc) = 0;\\n\\n\\n\\n /**\\n\\n * @brief the operator taking care of streaming the param values\\n\\n * @param os the stream to place the param into\\n\\n * @param param the param you want to place into the stream\\n\\n * @return os, but with param added.\\n\\n */\\n\\n friend ostream& operator<<(ostream& os, const DDParam ¶m);\\n\\n };\\n\\n}\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_PARAM_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 42,\n \"score\": 39931.128996280655\n },\n {\n \"content\": \"\\n\\n private:\\n\\n\\n\\n /**\\n\\n * @brief reassigns a value to the internal map assuming it is registered.\\n\\n * @param map the map that is being edited\\n\\n * @param name the name of the parameter to test\\n\\n * @param value the value of the new parameter\\n\\n * @tparam T the type of value\\n\\n * @return -1 if the value could not be reassigned,\\n\\n * 0 if the value was not changed,\\n\\n * otherwise the level of the parameter changed.\\n\\n */\\n\\n template <class T>\\n\\n static int reassign(DDMap& map, const string &name, T value);\\n\\n\\n\\n /**\\n\\n * @brief gets the updates and assigns them to DDMap\\n\\n * @param req the ROS request holding info about the new map\\n\\n * @param config the map to update\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 43,\n \"score\": 39930.95230915641\n },\n {\n \"content\": \" * @param rsp ----(ROS)\\n\\n * @return -------(ROS)\\n\\n * @note this is here so that deriving methods can call the internal callback.\\n\\n */\\n\\n static bool internalCallback(DDynamicReconfigure *obj, Reconfigure::Request &req, Reconfigure::Response &rsp);\\n\\n\\n\\n /**\\n\\n * @brief the ROS node handler to use to make everything ROS related.\\n\\n */\\n\\n ros::NodeHandle nh_;\\n\\n /**\\n\\n * @brief a map of all contained parameters.\\n\\n */\\n\\n DDMap params_;\\n\\n /**\\n\\n * @brief the publisher responsible for updating the descriptions of the parameter for commandline (desc_pub_),\\n\\n * and the publisher responsible for updating the configuration values for commandline and client (update_pub_).\\n\\n * desc_pub_ publishes to \\\"parameter_descriptions\\\", and update_pub_ publishes to \\\"/parameter_updates\\\".\\n\\n */\\n\\n ros::Publisher desc_pub_, update_pub_;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 44,\n \"score\": 39930.800834387286\n },\n {\n \"content\": \" class float3\\n\\n {\\n\\n public:\\n\\n float x, y, z;\\n\\n\\n\\n public:\\n\\n float3& operator*=(const float& factor)\\n\\n {\\n\\n x*=factor;\\n\\n y*=factor;\\n\\n z*=factor;\\n\\n return (*this);\\n\\n }\\n\\n float3& operator+=(const float3& other)\\n\\n {\\n\\n x+=other.x;\\n\\n y+=other.y;\\n\\n z+=other.z;\\n\\n return (*this);\\n\\n }\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 45,\n \"score\": 39928.13823910353\n },\n {\n \"content\": \" * @return the level of change (integer)\\n\\n */\\n\\n int getUpdates(const Reconfigure::Request &req, DDMap &config);\\n\\n\\n\\n /**\\n\\n * @brief the use defined callback to call when parameters are updated.\\n\\n */\\n\\n boost::shared_ptr<DDFunc> callback_;\\n\\n #ifdef __clang__\\n\\n #pragma clang diagnostic push // CLion suppressor\\n\\n #pragma ide diagnostic ignored \\\"OCUnusedGlobalDeclarationInspection\\\"\\n\\n #endif\\n\\n /**\\n\\n * @brief the service server used to trigger parameter updates.\\n\\n * It also contains the new parameters sent from client or commandline.\\n\\n */\\n\\n ros::ServiceServer set_service_;\\n\\n #ifdef __clang__\\n\\n #pragma clang diagnostic pop\\n\\n #endif\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 46,\n \"score\": 39928.13823910353\n },\n {\n \"content\": \" */\\n\\n friend ostream& operator<<(ostream& os, const DDynamicReconfigure &dd);\\n\\n protected:\\n\\n\\n\\n /**\\n\\n * @brief makes the config descriptions for publishing\\n\\n * @return a ROS message of type ConfigDescription\\n\\n */\\n\\n ConfigDescription makeDescription();\\n\\n\\n\\n /**\\n\\n * @brief makes the config update for publishing\\n\\n * @return a ROS message of type Config\\n\\n */\\n\\n Config makeConfig();\\n\\n\\n\\n /**\\n\\n * @brief calls the internal callback for the low-level service, not exposed to us.\\n\\n * @param obj the object we are using for its callback.\\n\\n * @param req ----(ROS)\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 47,\n \"score\": 39928.13823910353\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#include <ddynamic_reconfigure/param/dd_bool_param.h>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n string DDBool::getName() const {\\n\\n return name_;\\n\\n }\\n\\n\\n\\n void DDBool::prepGroup(Group &group) {\\n\\n ParamDescription desc;\\n\\n desc.name = name_;\\n\\n desc.level = level_;\\n\\n desc.description = desc_;\\n\\n desc.type = \\\"bool\\\";\\n\\n group.parameters.push_back(desc);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_bool_param.cpp\",\n \"rank\": 48,\n \"score\": 39623.253580397504\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#include <ddynamic_reconfigure/param/dd_double_param.h>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n string DDDouble::getName() const {\\n\\n return name_;\\n\\n }\\n\\n\\n\\n void DDDouble::prepGroup(Group &group) {\\n\\n ParamDescription desc;\\n\\n desc.name = name_;\\n\\n desc.level = level_;\\n\\n desc.description = desc_;\\n\\n desc.type = \\\"double\\\";\\n\\n group.parameters.push_back(desc);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_double_param.cpp\",\n \"rank\": 49,\n \"score\": 39623.072363376676\n },\n {\n \"content\": \" }\\n\\n\\n\\n bool DDDouble::sameType(Value val) {\\n\\n return val.getType() == \\\"double\\\";\\n\\n }\\n\\n\\n\\n bool DDDouble::sameValue(Value val) {\\n\\n return val.toDouble() == val_;\\n\\n }\\n\\n\\n\\n void DDDouble::setValue(Value val) {\\n\\n val_ = val.toDouble();\\n\\n }\\n\\n\\n\\n Value DDDouble::getValue() const {\\n\\n return Value(val_);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_double_param.cpp\",\n \"rank\": 50,\n \"score\": 39621.95583245896\n },\n {\n \"content\": \" }\\n\\n\\n\\n bool DDString::sameType(Value val) {\\n\\n return val.getType() == \\\"string\\\";\\n\\n }\\n\\n\\n\\n bool DDString::sameValue(Value val) {\\n\\n return val.toString() == val_;\\n\\n }\\n\\n\\n\\n void DDString::setValue(Value val) {\\n\\n val_ = val.toString();\\n\\n }\\n\\n\\n\\n Value DDString::getValue() const {\\n\\n return Value(val_);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_string_param.cpp\",\n \"rank\": 51,\n \"score\": 39621.7342525261\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#include <ddynamic_reconfigure/param/dd_string_param.h>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n string DDString::getName() const {\\n\\n return name_;\\n\\n }\\n\\n\\n\\n void DDString::prepGroup(Group &group) {\\n\\n ParamDescription desc;\\n\\n desc.name = name_;\\n\\n desc.level = level_;\\n\\n desc.description = desc_;\\n\\n desc.type = \\\"string\\\";\\n\\n group.parameters.push_back(desc);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_string_param.cpp\",\n \"rank\": 52,\n \"score\": 39620.11534387237\n },\n {\n \"content\": \" }\\n\\n\\n\\n bool DDBool::sameType(Value val) {\\n\\n return val.getType() == \\\"bool\\\";\\n\\n }\\n\\n\\n\\n bool DDBool::sameValue(Value val) {\\n\\n return val.toBool() == val_;\\n\\n }\\n\\n\\n\\n void DDBool::setValue(Value val) {\\n\\n val_ = val.toBool();\\n\\n }\\n\\n\\n\\n Value DDBool::getValue() const {\\n\\n return Value(val_);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_bool_param.cpp\",\n \"rank\": 53,\n \"score\": 39617.645744029105\n },\n {\n \"content\": \" void DDBool::prepConfig(Config &conf) {\\n\\n BoolParameter param;\\n\\n param.name = name_;\\n\\n param.value = (unsigned char)val_;\\n\\n conf.bools.push_back(param);\\n\\n }\\n\\n\\n\\n void DDBool::prepConfigDescription(ConfigDescription &conf_desc) {\\n\\n BoolParameter param;\\n\\n param.name = name_;\\n\\n param.value = (unsigned char)def_;\\n\\n conf_desc.dflt.bools.push_back(param);\\n\\n param.value = (unsigned char)true;\\n\\n conf_desc.max.bools.push_back(param);\\n\\n param.value = (unsigned char)false;\\n\\n conf_desc.min.bools.push_back(param);\\n\\n }\\n\\n\\n\\n int DDBool::getLevel() const {\\n\\n return level_;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_bool_param.cpp\",\n \"rank\": 54,\n \"score\": 39617.551380107805\n },\n {\n \"content\": \" void DDDouble::prepConfig(Config &conf) {\\n\\n DoubleParameter param;\\n\\n param.name = name_;\\n\\n param.value = val_;\\n\\n conf.doubles.push_back(param);\\n\\n }\\n\\n\\n\\n void DDDouble::prepConfigDescription(ConfigDescription &conf_desc) {\\n\\n DoubleParameter param;\\n\\n param.name = name_;\\n\\n param.value = def_;\\n\\n conf_desc.dflt.doubles.push_back(param);\\n\\n param.value = max_;\\n\\n conf_desc.max.doubles.push_back(param);\\n\\n param.value = min_;\\n\\n conf_desc.min.doubles.push_back(param);\\n\\n }\\n\\n\\n\\n int DDDouble::getLevel() const {\\n\\n return level_;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_double_param.cpp\",\n \"rank\": 55,\n \"score\": 39617.35601553404\n },\n {\n \"content\": \" void DDString::prepConfig(Config &conf) {\\n\\n StrParameter param;\\n\\n param.name = name_;\\n\\n param.value = val_;\\n\\n conf.strs.push_back(param);\\n\\n }\\n\\n\\n\\n void DDString::prepConfigDescription(ConfigDescription &conf_desc) {\\n\\n StrParameter param;\\n\\n param.name = name_;\\n\\n param.value = def_;\\n\\n conf_desc.dflt.strs.push_back(param);\\n\\n param.value = \\\"\\\";\\n\\n conf_desc.max.strs.push_back(param);\\n\\n param.value = \\\"\\\";\\n\\n conf_desc.min.strs.push_back(param);\\n\\n }\\n\\n\\n\\n int DDString::getLevel() const {\\n\\n return level_;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/src/param/dd_string_param.cpp\",\n \"rank\": 56,\n \"score\": 39616.594630713254\n },\n {\n \"content\": \" class CIMUHistory\\n\\n {\\n\\n public:\\n\\n enum sensor_name {mGYRO, mACCEL};\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 57,\n \"score\": 39095.89808604912\n },\n {\n \"content\": \" class Value {\\n\\n private:\\n\\n int int_val_;\\n\\n string str_val_, type_;\\n\\n double double_val_;\\n\\n bool bool_val_;\\n\\n public:\\n\\n /**\\n\\n * @brief creates an integer value wrapper\\n\\n * @param val the int to wrap\\n\\n */\\n\\n inline explicit Value(int val) : double_val_(0.0), bool_val_(false) {\\n\\n type_ = \\\"int\\\";\\n\\n int_val_ = val;\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief creates an double value wrapper\\n\\n * @param val the double to wrap\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_value.h\",\n \"rank\": 58,\n \"score\": 39095.89808604912\n },\n {\n \"content\": \" class imuData\\n\\n {\\n\\n public:\\n\\n imuData(const imuData& other):\\n\\n imuData(other.m_reading, other.m_time)\\n\\n {};\\n\\n imuData(const float3 reading, double time):\\n\\n m_reading(reading),\\n\\n m_time(time)\\n\\n {};\\n\\n imuData operator*(const double factor);\\n\\n imuData operator+(const imuData& other);\\n\\n public:\\n\\n BaseRealSenseNode::float3 m_reading;\\n\\n double m_time;\\n\\n };\\n\\n \\n\\n private:\\n\\n size_t m_max_size;\\n\\n std::map<sensor_name, std::list<imuData> > m_map;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 59,\n \"score\": 39095.89808604912\n },\n {\n \"content\": \" class NamedFilter\\n\\n {\\n\\n public:\\n\\n std::string _name;\\n\\n std::shared_ptr<rs2::filter> _filter;\\n\\n\\n\\n public:\\n\\n NamedFilter(std::string name, std::shared_ptr<rs2::filter> filter):\\n\\n _name(name), _filter(filter)\\n\\n {}\\n\\n };\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 60,\n \"score\": 39095.89808604912\n },\n {\n \"content\": \"#include <ros/ros.h>\\n\\n#include <gtest/gtest.h>\\n\\n#include <ddynamic_reconfigure/param/dd_double_param.h>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n\\n\\n /**\\n\\n * @brief preliminary test which makes sure we can use the object.\\n\\n */\\n\\n TEST(DDDoubleTest, constructorTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDDouble param1(\\\"param1\\\",0,\\\"param1\\\",0.5);\\n\\n DDDouble param2(\\\"\\\",0,\\\"\\\",1,10);\\n\\n DDDouble param3(\\\"\\\\000\\\",0,\\\"\\\\000\\\", -0, -3.4e100, 43.5e20); // NOLINT(bugprone-string-literal-with-embedded-nul)\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief a test making sure we can handle all API for handling the values of the param\\n\\n */\\n\\n TEST(DDDoubleTest, valueTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDDouble param(\\\"dd_param\\\",0,\\\"dd_param\\\",1);\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_double.cpp\",\n \"rank\": 61,\n \"score\": 38811.77552310516\n },\n {\n \"content\": \"#include <ros/ros.h>\\n\\n#include <gtest/gtest.h>\\n\\n#include <ddynamic_reconfigure/param/dd_bool_param.h>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n\\n\\n /**\\n\\n * @brief preliminary test which makes sure we can use the object.\\n\\n */\\n\\n TEST(DDBoolTest, constructorTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDBool param1(\\\"param1\\\",0,\\\"param1\\\",true);\\n\\n DDBool param2(\\\"\\\",0,\\\"\\\",false);\\n\\n DDBool param3(\\\"\\\\000\\\",0,\\\"\\\\000\\\",false); // NOLINT(bugprone-string-literal-with-embedded-nul)\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief a test making sure we can handle all API for handling the values of the param\\n\\n */\\n\\n TEST(DDBoolTest, valueTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDBool param(\\\"dd_param\\\",0,\\\"dd_param\\\",true);\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_bool.cpp\",\n \"rank\": 62,\n \"score\": 38811.60646859969\n },\n {\n \"content\": \"#include <ros/ros.h>\\n\\n#include <gtest/gtest.h>\\n\\n#include <ddynamic_reconfigure/param/dd_string_param.h>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n\\n\\n /**\\n\\n * @brief preliminary test which makes sure we can use the object.\\n\\n */\\n\\n TEST(DDStringTest, constructorTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDString param1(\\\"param1\\\",0,\\\"param1\\\",\\\"Hello World\\\");\\n\\n DDString param2(\\\"\\\",0,\\\"\\\",\\\"\\\");\\n\\n DDString param3(\\\"\\\\000\\\",0,\\\"\\\\000\\\",\\\"\\\\000\\\"); // NOLINT(bugprone-string-literal-with-embedded-nul)\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief a test making sure we can handle all API for handling the values of the param\\n\\n */\\n\\n TEST(DDStringTest, valueTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDString param(\\\"dd_param\\\",0,\\\"param1\\\",\\\"1\\\");\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_string.cpp\",\n \"rank\": 63,\n \"score\": 38809.15094982345\n },\n {\n \"content\": \"\\n\\n ASSERT_TRUE(param.getValue().getType() == \\\"bool\\\");\\n\\n ASSERT_TRUE(param.sameValue(Value(false)));\\n\\n }\\n\\n\\n\\n TEST(DDBoolTest, streamTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDBool param1(\\\"param1\\\",0,\\\"param1\\\",true);\\n\\n stringstream stream;\\n\\n stream << param1;\\n\\n ASSERT_EQ(param1.getName() + \\\":\\\" + param1.getValue().toString(),stream.str());\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nint main(int argc, char** argv) {\\n\\n testing::InitGoogleTest(&argc, argv);\\n\\n\\n\\n srand((unsigned int)random());\\n\\n\\n\\n return RUN_ALL_TESTS();\\n\\n}\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_bool.cpp\",\n \"rank\": 64,\n \"score\": 38807.07701577213\n },\n {\n \"content\": \"\\n\\n ASSERT_TRUE(param.getValue().getType() == \\\"double\\\");\\n\\n ASSERT_TRUE(param.sameValue(Value(2)));\\n\\n }\\n\\n\\n\\n TEST(DDDoubleTest, streamTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDDouble param1(\\\"param1\\\",0,\\\"param1\\\",1.0);\\n\\n stringstream stream;\\n\\n stream << param1;\\n\\n ASSERT_EQ(param1.getName() + \\\":\\\" + param1.getValue().toString(),stream.str());\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nint main(int argc, char** argv) {\\n\\n testing::InitGoogleTest(&argc, argv);\\n\\n\\n\\n srand((unsigned int)random());\\n\\n\\n\\n return RUN_ALL_TESTS();\\n\\n}\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_double.cpp\",\n \"rank\": 65,\n \"score\": 38806.689695833404\n },\n {\n \"content\": \"\\n\\n ASSERT_TRUE(param.getValue().getType() == \\\"string\\\");\\n\\n ASSERT_TRUE(param.sameValue(Value(\\\"2\\\")));\\n\\n }\\n\\n\\n\\n TEST(DDStringTest, streamTest) { // NOLINT(cert-err58-cpp,modernize-use-equals-delete)\\n\\n DDString param1(\\\"param1\\\",0,\\\"param1\\\",\\\"Hello World\\\");\\n\\n stringstream stream;\\n\\n stream << param1;\\n\\n ASSERT_EQ(param1.getName() + \\\":\\\" + param1.getValue().toString(),stream.str());\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nint main(int argc, char** argv) {\\n\\n testing::InitGoogleTest(&argc, argv);\\n\\n\\n\\n srand((unsigned int)random());\\n\\n\\n\\n return RUN_ALL_TESTS();\\n\\n}\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_string.cpp\",\n \"rank\": 66,\n \"score\": 38804.49949413581\n },\n {\n \"content\": \" // we won't do any tests on getLevel or getName, as those are implicit.\\n\\n Value v(\\\"1\\\");\\n\\n ASSERT_TRUE(param.sameType(v));\\n\\n ASSERT_TRUE(param.sameValue(v));\\n\\n\\n\\n v = Value(1);\\n\\n ASSERT_FALSE(param.sameType(v));\\n\\n ASSERT_TRUE(param.sameValue(v));\\n\\n\\n\\n v = Value(\\\"2\\\");\\n\\n ASSERT_TRUE(param.sameType(v));\\n\\n ASSERT_FALSE(param.sameValue(v));\\n\\n\\n\\n v = Value(2);\\n\\n ASSERT_FALSE(param.sameType(v));\\n\\n ASSERT_FALSE(param.sameValue(v));\\n\\n\\n\\n param.setValue(v);\\n\\n v = Value(\\\"3\\\");\\n\\n ASSERT_FALSE(param.sameValue(v)); // makes sure anti-aliasing happens\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_string.cpp\",\n \"rank\": 67,\n \"score\": 38799.952523898326\n },\n {\n \"content\": \" // we won't do any tests on getLevel or getName, as those are implicit.\\n\\n Value v(true);\\n\\n ASSERT_TRUE(param.sameType(v));\\n\\n ASSERT_TRUE(param.sameValue(v));\\n\\n\\n\\n v = Value(1);\\n\\n ASSERT_FALSE(param.sameType(v));\\n\\n ASSERT_TRUE(param.sameValue(v));\\n\\n\\n\\n v = Value(false);\\n\\n ASSERT_TRUE(param.sameType(v));\\n\\n ASSERT_FALSE(param.sameValue(v));\\n\\n\\n\\n v = Value(0);\\n\\n ASSERT_FALSE(param.sameType(v));\\n\\n ASSERT_FALSE(param.sameValue(v));\\n\\n\\n\\n param.setValue(v);\\n\\n v = Value(true);\\n\\n ASSERT_FALSE(param.sameValue(v)); // makes sure anti-aliasing happens\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_bool.cpp\",\n \"rank\": 68,\n \"score\": 38799.952523898326\n },\n {\n \"content\": \" // we won't do any tests on getLevel or getName, as those are implicit.\\n\\n Value v(1.0);\\n\\n ASSERT_TRUE(param.sameType(v));\\n\\n ASSERT_TRUE(param.sameValue(v));\\n\\n\\n\\n v = Value(1);\\n\\n ASSERT_FALSE(param.sameType(v));\\n\\n ASSERT_TRUE(param.sameValue(v));\\n\\n\\n\\n v = Value(2.0);\\n\\n ASSERT_TRUE(param.sameType(v));\\n\\n ASSERT_FALSE(param.sameValue(v));\\n\\n\\n\\n v = Value(2);\\n\\n ASSERT_FALSE(param.sameType(v));\\n\\n ASSERT_FALSE(param.sameValue(v));\\n\\n\\n\\n param.setValue(v);\\n\\n v = Value(3);\\n\\n ASSERT_FALSE(param.sameValue(v)); // makes sure anti-aliasing happens\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/test/dd_param/test_dd_double.cpp\",\n \"rank\": 69,\n \"score\": 38799.952523898326\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 20/06/18.\\n\\n//\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_ENUM_PARAM_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_ENUM_PARAM_H\\n\\n\\n\\n#include \\\"dd_int_param.h\\\"\\n\\n#include <boost/foreach.hpp>\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n typedef map<string,pair<int,string> > EnumMap;\\n\\n /**\\n\\n * @brief an integer enum implementation of the parameter.\\n\\n * This is an extension to the int parameter,\\n\\n * which allows creating string aliases for certain (if not all) numbers available.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h\",\n \"rank\": 70,\n \"score\": 38306.32326455289\n },\n {\n \"content\": \" * @deprecated see note. This is not tested, so it may fail.\\n\\n */\\n\\n DDEnum(const string &name, unsigned int level, const string &description,\\n\\n const string& def, const pair<map<string,pair<int,string> >,string> &dictionary);\\n\\n #ifdef __clang__\\n\\n #pragma clang diagnostic pop\\n\\n #endif\\n\\n\\n\\n protected:\\n\\n /** \\n\\n * @brief A dictionary from the string aliases to their integer counterparts.\\n\\n * This method of storage allows integers to have multiple aliases.\\n\\n */\\n\\n const EnumMap dict_;\\n\\n /**\\n\\n * @brief this holds the physical enum's description. why is this here? because 1D-reconfigure.\\n\\n */\\n\\n string enum_description_;\\n\\n private:\\n\\n /**\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h\",\n \"rank\": 71,\n \"score\": 38302.85623164435\n },\n {\n \"content\": \" * converts the value given to an integer according to the embedded dictionary.\\n\\n * @param val the value to look up within the dictionary\\n\\n * @return if the value is a string which exists in the dictionary, returns the int definition of the term given.\\n\\n * otherwise, returns the Value object defined conversion of the type to an integer.\\n\\n */\\n\\n int lookup(Value val);\\n\\n\\n\\n /**\\n\\n * generates the 'edit_method' sting for prepGroup().\\n\\n * @return a string that should not be touched.\\n\\n */\\n\\n string makeEditMethod();\\n\\n\\n\\n /**\\n\\n * generates a 'const' sting for prepGroup().\\n\\n * @param name the name of the constant\\n\\n * @param value the value of the constant\\n\\n * @param desc the description given to the constant.\\n\\n * @return a string that should not be touched.\\n\\n */\\n\\n string makeConst(string name, int value, string desc);\\n\\n };\\n\\n}\\n\\n\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_ENUM_PARAM_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h\",\n \"rank\": 72,\n \"score\": 38302.61347038098\n },\n {\n \"content\": \" * @param level the change level\\n\\n * @param def the default value in integer form\\n\\n * @param description details about the parameter\\n\\n * @param dictionary the alias dictionary this enum will use.\\n\\n * @note since ROS cannot send the enum and const descriptions, this method is useless.\\n\\n * Please use the constructor which takes a map<string,int> instead.\\n\\n * @deprecated see note. This is not tested, so it may fail.\\n\\n */\\n\\n DDEnum(const string &name, unsigned int level, const string &description,\\n\\n int def, const pair<map<string,pair<int,string> >,string> &dictionary);\\n\\n\\n\\n /**\\n\\n * @brief creates a new int-enum param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param def an alias of the default value\\n\\n * @param description details about the parameter\\n\\n * @param dictionary the alias dictionary this enum will use.\\n\\n * @note since ROS cannot send the enum and const descriptions, this method is useless.\\n\\n * Please use the constructor which takes a map<string,int> instead.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h\",\n \"rank\": 73,\n \"score\": 38302.43143425335\n },\n {\n \"content\": \" int def, const map<string,int> &dictionary);\\n\\n\\n\\n /**\\n\\n * @brief creates a new int-enum param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param def an alias of the default value\\n\\n * @param description details about the parameter\\n\\n * @param dictionary the alias dictionary this enum will use.\\n\\n */\\n\\n DDEnum(const string &name, unsigned int level, const string &description,\\n\\n const string& def, const map<string,int> &dictionary);\\n\\n\\n\\n #ifdef __clang__\\n\\n #pragma clang diagnostic push\\n\\n #pragma ide diagnostic ignored \\\"OCUnusedGlobalDeclarationInspection\\\"\\n\\n #endif\\n\\n /**\\n\\n * @brief creates a new int-enum param\\n\\n * @param name the name of the parameter\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h\",\n \"rank\": 74,\n \"score\": 38302.37190159722\n },\n {\n \"content\": \" /**\\n\\n * creates a new int param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param def the default value\\n\\n * @param description details about the parameter\\n\\n * @param max the maximum allowed value. Defaults to INT32_MAX\\n\\n * @param min the minimum allowed value. Defaults to INT32_MIN\\n\\n */\\n\\n inline DDInt(const string &name, unsigned int level, const string &description,\\n\\n int def, int min = INT32_MIN, int max = INT32_MAX) {\\n\\n name_ = name;\\n\\n level_ = level;\\n\\n desc_ = description;\\n\\n def_ = def;\\n\\n val_ = def;\\n\\n max_ = max;\\n\\n min_ = min;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h\",\n \"rank\": 75,\n \"score\": 38301.395452110286\n },\n {\n \"content\": \"//\\n\\n// Created by Noam Dori on 19/06/18.\\n\\n//\\n\\n\\n\\n#ifndef DDYNAMIC_RECONFIGURE_DD_INT_PARAM_H\\n\\n#define DDYNAMIC_RECONFIGURE_DD_INT_PARAM_H\\n\\n\\n\\n#include \\\"ddynamic_reconfigure/dd_param.h\\\"\\n\\n\\n\\nnamespace ddynamic_reconfigure {\\n\\n /**\\n\\n * @brief an integer implementation of the parameter.\\n\\n * This is used to 32 bit signed integral numbers.\\n\\n * This can also handle shorts, bytes, and other integrals provided they are not too big\\n\\n * (by then looping will occur)\\n\\n */\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h\",\n \"rank\": 76,\n \"score\": 38300.92849012372\n },\n {\n \"content\": \" protected:\\n\\n /**\\n\\n * @brief the level of the parameter:\\n\\n * the degree in which things need to be shut down if this param changes\\n\\n */\\n\\n unsigned int level_;\\n\\n /**\\n\\n * @brief the default value (def_),\\n\\n * the current value (val_),\\n\\n * the minimum allowed value (min_),\\n\\n * and the maximum allowed value (max_)\\n\\n */\\n\\n int def_,max_,min_,val_;\\n\\n /**\\n\\n * @brief the name of the parameter (name_),\\n\\n * and its description (desc_)\\n\\n */\\n\\n string name_, desc_;\\n\\n };\\n\\n}\\n\\n\\n\\n#endif //DDYNAMIC_RECONFIGURE_DD_INT_PARAM_H\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h\",\n \"rank\": 77,\n \"score\": 38300.75745366544\n },\n {\n \"content\": \" class SyncedImuPublisher\\n\\n {\\n\\n public:\\n\\n SyncedImuPublisher() {_is_enabled=false;};\\n\\n SyncedImuPublisher(ros::Publisher imu_publisher, std::size_t waiting_list_size=1000);\\n\\n ~SyncedImuPublisher();\\n\\n void Pause(); // Pause sending messages. All messages from now on are saved in queue.\\n\\n void Resume(); // Send all pending messages and allow sending future messages.\\n\\n void Publish(sensor_msgs::Imu msg); //either send or hold message.\\n\\n uint32_t getNumSubscribers() { return _publisher.getNumSubscribers();};\\n\\n void Enable(bool is_enabled) {_is_enabled=is_enabled;};\\n\\n \\n\\n private:\\n\\n void PublishPendingMessages();\\n\\n\\n\\n private:\\n\\n std::mutex _mutex;\\n\\n ros::Publisher _publisher;\\n\\n bool _pause_mode;\\n\\n std::queue<sensor_msgs::Imu> _pending_messages;\\n\\n std::size_t _waiting_list_size;\\n\\n bool _is_enabled;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 78,\n \"score\": 38297.643077376444\n },\n {\n \"content\": \" class DDParam {\\n\\n public:\\n\\n\\n\\n /**\\n\\n * @brief gets the name of the parameter, that is, the ID used in the program when requesting it.\\n\\n * @return the unique string name of the parameter.\\n\\n */\\n\\n virtual string getName() const = 0;\\n\\n\\n\\n /**\\n\\n * @brief fetches the level of the parameter\\n\\n * @return the level of the param.\\n\\n */\\n\\n virtual int getLevel() const = 0;\\n\\n\\n\\n /**\\n\\n * @brief gets the value of this parameter.\\n\\n * @return the value stored in this param.\\n\\n */\\n\\n virtual Value getValue() const = 0;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 79,\n \"score\": 38297.643077376444\n },\n {\n \"content\": \"namespace realsense2_camera\\n\\n{\\n\\n const uint16_t SR300_PID = 0x0aa5; // SR300\\n\\n const uint16_t RS400_PID = 0x0ad1; // PSR\\n\\n const uint16_t RS410_PID = 0x0ad2; // ASR\\n\\n const uint16_t RS415_PID = 0x0ad3; // ASRC\\n\\n const uint16_t RS430_PID = 0x0ad4; // AWG\\n\\n const uint16_t RS430_MM_PID = 0x0ad5; // AWGT\\n\\n const uint16_t RS_USB2_PID = 0x0ad6; // USB2\\n\\n const uint16_t RS420_PID = 0x0af6; // PWG\\n\\n const uint16_t RS420_MM_PID = 0x0afe; // PWGT\\n\\n const uint16_t RS410_MM_PID = 0x0aff; // ASR\\n\\n const uint16_t RS400_MM_PID = 0x0b00; // PSR\\n\\n const uint16_t RS430_MM_RGB_PID = 0x0b01; // AWGCT\\n\\n const uint16_t RS460_PID = 0x0b03; // DS5U\\n\\n const uint16_t RS435_RGB_PID = 0x0b07; // AWGC\\n\\n const uint16_t RS435i_RGB_PID = 0x0B3A; // AWGC_MM\\n\\n const uint16_t RS405_PID = 0x0b0c; // DS5U\\n\\n const uint16_t RS_T265_PID = 0x0b37; // \\n\\n \\n\\n\\n\\n const bool ALIGN_DEPTH = false;\\n\\n const bool POINTCLOUD = false;\\n\\n const bool ALLOW_NO_TEXTURE_POINTS = false;\\n\\n const bool SYNC_FRAMES = false;\\n\\n\\n\\n const int IMAGE_WIDTH = 640;\\n\\n const int IMAGE_HEIGHT = 480;\\n\\n const int IMAGE_FPS = 30;\\n\\n\\n\\n const int IMU_FPS = 0;\\n\\n\\n\\n\\n\\n const bool ENABLE_DEPTH = true;\\n\\n const bool ENABLE_INFRA1 = true;\\n\\n const bool ENABLE_INFRA2 = true;\\n\\n const bool ENABLE_COLOR = true;\\n\\n const bool ENABLE_FISHEYE = true;\\n\\n const bool ENABLE_IMU = true;\\n\\n const bool HOLD_BACK_IMU_FOR_FRAMES = false;\\n\\n const bool PUBLISH_ODOM_TF = true;\\n\\n\\n\\n\\n\\n const std::string DEFAULT_BASE_FRAME_ID = \\\"camera_link\\\";\\n\\n const std::string DEFAULT_ODOM_FRAME_ID = \\\"odom_frame\\\";\\n\\n const std::string DEFAULT_DEPTH_FRAME_ID = \\\"camera_depth_frame\\\";\\n\\n const std::string DEFAULT_INFRA1_FRAME_ID = \\\"camera_infra1_frame\\\";\\n\\n const std::string DEFAULT_INFRA2_FRAME_ID = \\\"camera_infra2_frame\\\";\\n\\n const std::string DEFAULT_COLOR_FRAME_ID = \\\"camera_color_frame\\\";\\n\\n const std::string DEFAULT_FISHEYE_FRAME_ID = \\\"camera_fisheye_frame\\\";\\n\\n const std::string DEFAULT_IMU_FRAME_ID = \\\"camera_imu_frame\\\";\\n\\n\\n\\n const std::string DEFAULT_DEPTH_OPTICAL_FRAME_ID = \\\"camera_depth_optical_frame\\\";\\n\\n const std::string DEFAULT_INFRA1_OPTICAL_FRAME_ID = \\\"camera_infra1_optical_frame\\\";\\n\\n const std::string DEFAULT_INFRA2_OPTICAL_FRAME_ID = \\\"camera_infra2_optical_frame\\\";\\n\\n const std::string DEFAULT_COLOR_OPTICAL_FRAME_ID = \\\"camera_color_optical_frame\\\";\\n\\n const std::string DEFAULT_FISHEYE_OPTICAL_FRAME_ID = \\\"camera_fisheye_optical_frame\\\";\\n\\n const std::string DEFAULT_ACCEL_OPTICAL_FRAME_ID = \\\"camera_accel_optical_frame\\\";\\n\\n const std::string DEFAULT_GYRO_OPTICAL_FRAME_ID = \\\"camera_gyro_optical_frame\\\";\\n\\n const std::string DEFAULT_IMU_OPTICAL_FRAME_ID = \\\"camera_imu_optical_frame\\\";\\n\\n\\n\\n const std::string DEFAULT_ALIGNED_DEPTH_TO_COLOR_FRAME_ID = \\\"camera_aligned_depth_to_color_frame\\\";\\n\\n const std::string DEFAULT_ALIGNED_DEPTH_TO_INFRA1_FRAME_ID = \\\"camera_aligned_depth_to_infra1_frame\\\";\\n\\n const std::string DEFAULT_ALIGNED_DEPTH_TO_INFRA2_FRAME_ID = \\\"camera_aligned_depth_to_infra2_frame\\\";\\n\\n const std::string DEFAULT_ALIGNED_DEPTH_TO_FISHEYE_FRAME_ID = \\\"camera_aligned_depth_to_fisheye_frame\\\";\\n\\n\\n\\n const std::string DEFAULT_UNITE_IMU_METHOD = \\\"\\\";\\n\\n const std::string DEFAULT_FILTERS = \\\"\\\";\\n\\n const std::string DEFAULT_TOPIC_ODOM_IN = \\\"\\\";\\n\\n\\n\\n const float ROS_DEPTH_SCALE = 0.001;\\n\\n using stream_index_pair = std::pair<rs2_stream, int>;\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/constants.h\",\n \"rank\": 80,\n \"score\": 38297.643077376444\n },\n {\n \"content\": \" class DDynamicReconfigure {\\n\\n public:\\n\\n /**\\n\\n * @brief creates the most basic instance of a 2d-conf object.\\n\\n * @param nh the node handler of the node this is placed at.\\n\\n */\\n\\n explicit DDynamicReconfigure(ros::NodeHandle &nh);\\n\\n\\n\\n /**\\n\\n * @brief adds a parameter to the list, allowing it to be generated.\\n\\n * @param param the pointer to the 2d-param to add to the list.\\n\\n */\\n\\n virtual void add(DDPtr param);\\n\\n\\n\\n /**\\n\\n * @brief a convenience method for adding a parameter to the list, allowing it to be generated.\\n\\n * @warning When adding in this manner, you must be careful. After using this method to add the parameter,\\n\\n * running any of the \\\"remove\\\" methods on this object WILL cause the entire param object to be deleted!\\n\\n * To make sure that you can add the object back after removing it, please use the other \\\"add\\\" method.\\n\\n * @param param the pointer to the 2d-param to add to the list.\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/ddynamic_reconfigure.h\",\n \"rank\": 81,\n \"score\": 37531.333153857384\n },\n {\n \"content\": \" class InterfaceRealSenseNode\\n\\n {\\n\\n public:\\n\\n virtual void publishTopics() = 0;\\n\\n virtual void registerDynamicReconfigCb(ros::NodeHandle& nh) = 0;\\n\\n virtual ~InterfaceRealSenseNode() = default;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h\",\n \"rank\": 82,\n \"score\": 37531.333153857384\n },\n {\n \"content\": \"#define REALSENSE_ROS_VERSION_STR (VAR_ARG_STRING(REALSENSE_ROS_MAJOR_VERSION.REALSENSE_ROS_MINOR_VERSION.REALSENSE_ROS_PATCH_VERSION))\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/constants.h\",\n \"rank\": 83,\n \"score\": 36804.170616516756\n },\n {\n \"content\": \"#define REALSENSE_ROS_MINOR_VERSION 2\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/constants.h\",\n \"rank\": 84,\n \"score\": 36795.08833403484\n },\n {\n \"content\": \"#define REALSENSE_ROS_MAJOR_VERSION 2\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/constants.h\",\n \"rank\": 85,\n \"score\": 36795.08833403484\n },\n {\n \"content\": \"#define REALSENSE_ROS_PATCH_VERSION 4\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/constants.h\",\n \"rank\": 86,\n \"score\": 36795.08833403484\n },\n {\n \"content\": \"\\tclass PipelineSyncer : public rs2::asynchronous_syncer\\n\\n\\t{\\n\\n\\tpublic: \\n\\n\\t\\tvoid operator()(rs2::frame f) const\\n\\n\\t\\t{\\n\\n\\t\\t\\tinvoke(std::move(f));\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 87,\n \"score\": 36087.17331523018\n },\n {\n \"content\": \" class DDParam;// declaration for the sake of order.\\n\\n // this is the pointer to any type of Dynamic Dynamic parameter.\\n\\n typedef boost::shared_ptr<DDParam> DDPtr;\\n\\n /**\\n\\n * @brief The DDParam class is the abstraction of all parameter types, and is the template for creating them.\\n\\n * At this point, not much is known about the parameter, but the following:\\n\\n *\\n\\n * - the parameter has a name\\n\\n * - the parameter has a severity level\\n\\n * - the parameter has a description\\n\\n * - the parameter contains some value, though its type and contents are unknown.\\n\\n *\\n\\n * Other than storing data, the parameter also has specialised methods to interact with DDynamicReconfigure in order to apply changes and send them.\\n\\n * These methods should not be touched by the user.\\n\\n *\\n\\n * Since this class is abstract, the class has multiple implementations whicch are not directly exposed but are used,\\n\\n * so its worth checking out their descriptions.\\n\\n *\\n\\n * While this class is abstract, it does have one implemented thing, and that is its stream operator (`<<`) which can be freely used.\\n\\n *\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/dd_param.h\",\n \"rank\": 88,\n \"score\": 36087.17331523018\n },\n {\n \"content\": \" class RealSenseNodeFactory : public nodelet::Nodelet\\n\\n {\\n\\n public:\\n\\n RealSenseNodeFactory();\\n\\n virtual ~RealSenseNodeFactory();\\n\\n\\n\\n private:\\n\\n void closeDevice();\\n\\n void StartDevice();\\n\\n void change_device_callback(rs2::event_information& info);\\n\\n void getDevice(rs2::device_list list);\\n\\n virtual void onInit() override;\\n\\n void tryGetLogSeverity(rs2_log_severity& severity) const;\\n\\n\\n\\n rs2::device _device;\\n\\n std::unique_ptr<InterfaceRealSenseNode> _realSenseNode;\\n\\n rs2::context _ctx;\\n\\n std::string _serial_no;\\n\\n bool _initial_reset;\\n\\n std::thread _query_thread;\\n\\n\\n\\n };\\n\\n}//end namespace\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/realsense_node_factory.h\",\n \"rank\": 89,\n \"score\": 35405.98381859954\n },\n {\n \"content\": \" class T265RealsenseNode : public BaseRealSenseNode\\n\\n {\\n\\n public:\\n\\n T265RealsenseNode(ros::NodeHandle& nodeHandle,\\n\\n ros::NodeHandle& privateNodeHandle,\\n\\n rs2::device dev,\\n\\n const std::string& serial_no);\\n\\n void publishTopics();\\n\\n\\n\\n protected:\\n\\n void calcAndPublishStaticTransform(const stream_index_pair& stream, const rs2::stream_profile& base_profile) override;\\n\\n\\n\\n private:\\n\\n void initializeOdometryInput();\\n\\n void setupSubscribers();\\n\\n void odom_in_callback(const nav_msgs::Odometry::ConstPtr& msg);\\n\\n\\n\\n ros::Subscriber _odom_subscriber;\\n\\n rs2::wheel_odometer _wo_snr;\\n\\n bool _use_odom_in;\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/t265_realsense_node.h\",\n \"rank\": 90,\n \"score\": 34750.03445206085\n },\n {\n \"content\": \" class DDInt : virtual public DDParam {\\n\\n public:\\n\\n string getName() const;\\n\\n\\n\\n void prepGroup(Group &group);\\n\\n\\n\\n void prepConfig(Config &conf);\\n\\n\\n\\n void prepConfigDescription(ConfigDescription &conf_desc);\\n\\n\\n\\n int getLevel() const;\\n\\n\\n\\n bool sameType(Value val);\\n\\n\\n\\n bool sameValue(Value val);\\n\\n\\n\\n void setValue(Value val);\\n\\n\\n\\n Value getValue() const;\\n\\n\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_int_param.h\",\n \"rank\": 91,\n \"score\": 34117.947897826416\n },\n {\n \"content\": \" class BaseRealSenseNode : public InterfaceRealSenseNode\\n\\n {\\n\\n public:\\n\\n BaseRealSenseNode(ros::NodeHandle& nodeHandle,\\n\\n ros::NodeHandle& privateNodeHandle,\\n\\n rs2::device dev,\\n\\n const std::string& serial_no);\\n\\n\\n\\n void toggleSensors(bool enabled);\\n\\n virtual void publishTopics() override;\\n\\n virtual void registerDynamicReconfigCb(ros::NodeHandle& nh) override;\\n\\n virtual ~BaseRealSenseNode() {}\\n\\n\\n\\n public:\\n\\n enum imu_sync_method{NONE, COPY, LINEAR_INTERPOLATION};\\n\\n\\n\\n protected:\\n\",\n \"file_path\": \"realsense-ros-2.2.4/realsense2_camera/include/base_realsense_node.h\",\n \"rank\": 92,\n \"score\": 34117.947897826416\n },\n {\n \"content\": \" class DDEnum : virtual public DDInt {\\n\\n public:\\n\\n\\n\\n void prepGroup(Group &group);\\n\\n\\n\\n bool sameType(Value val);\\n\\n\\n\\n bool sameValue(Value val);\\n\\n\\n\\n void setValue(Value val);\\n\\n\\n\\n /**\\n\\n * @brief creates a new int-enum param\\n\\n * @param name the name of the parameter\\n\\n * @param level the change level\\n\\n * @param def the default value in integer form\\n\\n * @param description details about the parameter\\n\\n * @param dictionary the alias dictionary this enum will use.\\n\\n */\\n\\n DDEnum(const string &name, unsigned int level, const string &description,\\n\",\n \"file_path\": \"realsense-ros-2.2.4/ddynamic_reconfigure/include/ddynamic_reconfigure/param/dd_enum_param.h\",\n \"rank\": 93,\n \"score\": 34117.947897826416\n },\n {\n \"content\": \"function map(x,old_low,old_high,new_low,new_high)\\n\\n return ((x-old_low)*((new_high-new_low)/(old_high-old_low))) + new_low\\n\\nend\\n\\n\\n\",\n \"file_path\": \"sih/Controlling-UAV-in-V-REP-via-ROS-master/child_script.lua\",\n \"rank\": 94,\n \"score\": 16835.55892814097\n },\n {\n \"content\": \"#include <ros/ros.h>\\n\\n#include <serial/serial.h>\\n\\n#include <std_msgs/String.h>\\n\\n#include <string>\\n\\n#include <swiftpro/SwiftproState.h>\\n\\n\\n\\nserial::Serial _serial;\\t\\t\\t\\t// serial object\\n\\nfloat position[4] = {0.0};\\t\\t\\t// 3 cartesian coordinates: x, y, z(mm) and 1 angle(degree)\\n\\nchar strdata[2048];\\t\\t\\t\\t// global variables for handling string\\n\\n\\n\\n\\n\\nvoid handlestr()\\n\\n{\\n\\n\\tchar *pch = strtok(strdata, \\\" \\\");\\n\\n\\tfloat value[8];\\n\\n\\tint index = 0;\\n\\n\\n\\n\\twhile (pch != NULL && index < 5)\\n\\n\\t{\\n\\n\\t\\tvalue[index] = atof(pch+1);\\n\",\n \"file_path\": \"uarm/src/swiftpro_read_node2.cpp\",\n \"rank\": 96,\n \"score\": 16.91888013677238\n },\n {\n \"content\": \" * Description: callback when receive data from position_write_topic\\n\\n * Inputs: \\t\\tmsg(float)\\t\\t\\t3 cartesian coordinates: x, y, z(mm)\\n\\n * Outputs:\\t\\tGcode\\t\\t\\t\\tsend gcode to control swift pro\\n\\n */\\n\\nvoid position_write_callback(const swiftpro::position& msg)\\n\\n{\\n\\n\\tstd::string Gcode = \\\"\\\";\\n\\n\\tstd_msgs::String result;\\n\\n\\tchar x[10];\\n\\n\\tchar y[10];\\n\\n\\tchar z[10];\\n\\n\\n\\n\\tpos.x = msg.x;\\n\\n\\tpos.y = msg.y;\\n\\n\\tpos.z = msg.z;\\n\\n\\tsprintf(x, \\\"%.2f\\\", msg.x);\\n\\n\\tsprintf(y, \\\"%.2f\\\", msg.y);\\n\\n\\tsprintf(z, \\\"%.2f\\\", msg.z);\\n\\n\\tGcode = (std::string)\\\"G0 X\\\" + x + \\\" Y\\\" + y + \\\" Z\\\" + z + \\\" F10000\\\" + \\\"\\\\r\\\\n\\\";\\n\\n\\tROS_INFO(\\\"%s\\\", Gcode.c_str());\\n\",\n \"file_path\": \"uarm/src/swiftpro_write_node2.cpp\",\n \"rank\": 97,\n \"score\": 16.223595357838498\n },\n {\n \"content\": \" * Description: callback when receive data from position_write_topic\\n\\n * Inputs: \\t\\tmsg(float)\\t\\t\\t3 cartesian coordinates: x, y, z(mm)\\n\\n * Outputs:\\t\\tGcode\\t\\t\\t\\tsend gcode to control swift pro\\n\\n */\\n\\nvoid position_write_callback(const swiftpro::position& msg)\\n\\n{\\n\\n\\tstd::string Gcode = \\\"\\\";\\n\\n\\tstd_msgs::String result;\\n\\n\\tchar x[10];\\n\\n\\tchar y[10];\\n\\n\\tchar z[10];\\n\\n\\n\\n\\tpos.x = msg.x;\\n\\n\\tpos.y = msg.y;\\n\\n\\tpos.z = msg.z;\\n\\n\\tsprintf(x, \\\"%.2f\\\", msg.x);\\n\\n\\tsprintf(y, \\\"%.2f\\\", msg.y);\\n\\n\\tsprintf(z, \\\"%.2f\\\", msg.z);\\n\\n\\tGcode = (std::string)\\\"G0 X\\\" + x + \\\" Y\\\" + y + \\\" Z\\\" + z + \\\" F10000\\\" + \\\"\\\\r\\\\n\\\";\\n\\n\\tROS_INFO(\\\"%s\\\", Gcode.c_str());\\n\",\n \"file_path\": \"swiftpro/src/swiftpro_write_node.cpp\",\n \"rank\": 98,\n \"score\": 16.223595357838498\n }\n]","isConversational":false}}},{"rowIdx":71,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"BZOJ/BZOJ1336.cpp"},"repo_name":{"kind":"string","value":"xehoth/OnlineJudgeCodes"},"commit":{"kind":"string","value":"013d31cccaaa1d2b6d652c2f5d5d6cb2e39884a7"},"file_code":{"kind":"string","value":"\n\n#include <algorithm>\n#include <cctype>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nnamespace IO {\n\ninline char read() {\n static const int IN_LEN = 1000000;\n static char buf[IN_LEN], *s, *t;\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n return s == t ? -1 : *s++;\n}\n\ntemplate <typename T>\ninline void read(T &x) {\n static char c;\n static bool iosig;\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n if (c == -1) return;\n iosig ? x = -x : 0;\n }\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n iosig ? x = -x : 0;\n}\n\ninline int read(char *buf) {\n register int s = 0;\n register char c;\n while (c = read(), isspace(c) && c != -1)\n ;\n if (c == -1) {\n *buf = '\\0';\n return -1;\n }\n do\n buf[s++] = c;\n while (c = read(), !isspace(c) && c != -1);\n buf[s] = '\\0';\n return s;\n}\n\ninline void read(double &x) {\n static char buf[30];\n read(buf), x = atof(buf);\n}\n\nconst int OUT_LEN = 1000000;\n\nchar obuf[OUT_LEN], *oh = obuf;\n\ninline void print(char c) {\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n *oh++ = c;\n}\n\ntemplate <typename T>\ninline void print(T x) {\n static int buf[30], cnt;\n if (x == 0) {\n print('0');\n } else {\n x < 0 ? (print('-'), x = -x) : 0;\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n while (cnt) print((char)buf[cnt--]);\n }\n}\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n} \n\nnamespace Task {\n\nconst int MAXN = 100005;\nconst double EPS = 1e-8;\n\ntemplate <typename T>\ninline T square(const T &x) {\n return x * x;\n}\n\nstruct Point {\n double x, y;\n\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n inline double dis(const Point &p) const {\n return sqrt(square(x - p.x) + square(y - p.y));\n }\n\n inline Point operator+(const Point &p) const {\n return Point(x + p.x, y + p.y);\n }\n\n inline Point operator-(const Point &p) const {\n return Point(x - p.x, y - p.y);\n }\n\n inline Point operator*(const double i) const { return Point(x * i, y * i); }\n\n inline double operator*(const Point &p) const { return x * p.y - y * p.x; }\n\n inline double operator^(const Point &p) const { return x * p.x + y * p.y; }\n\n inline Point operator/(const double i) const { return Point(x / i, y / i); }\n\n inline void read() { IO::read(x), IO::read(y); }\n} p[MAXN];\n\nstruct Circle {\n Point o;\n double r;\n\n Circle(const Point &o, const double r) : o(o), r(r) {}\n\n Circle() {}\n};\n\nstruct Line {\n Point s, t;\n\n Line(const Point &s, const Point &t) : s(s), t(t) {}\n\n inline Point intersect(const Line &l) const {\n return s +\n (t - s) * (((s - l.s) * (l.t - l.s)) / ((l.t - l.s) * (t - s)));\n }\n\n inline Line getPerpendicularBisector() {\n return Line(\n Point((s.x + t.x) / 2, (s.y + t.y) / 2),\n Point((s.x + t.x) / 2 + s.y - t.y, (s.y + t.y) / 2 + t.x - s.x));\n }\n};\n\ninline Point getCenter(const Point &a, const Point &b, const Point &c) {\n return Line(a, b).getPerpendicularBisector().intersect(\n Line(a, c).getPerpendicularBisector());\n}\n\ninline void solve() {\n using namespace IO;\n srand(495);\n register int n;\n read(n);\n for (register int i = 1; i <= n; i++) p[i].read();\n std::random_shuffle(p + 1, p + n + 1);\n Circle c(p[1], 0);\n for (register int i = 1; i <= n; i++) {\n if (c.o.dis(p[i]) - c.r < EPS) continue;\n c = Circle((p[1] + p[i]) / 2, p[1].dis(p[i]) / 2);\n for (register int j = 2; j < i; j++) {\n if (c.o.dis(p[j]) - c.r < EPS) continue;\n c = Circle((p[i] + p[j]) / 2, p[i].dis(p[j]) / 2);\n for (register int k = 1; k < j; k++) {\n if (c.o.dis(p[k]) - c.r < EPS) continue;\n c = Circle(getCenter(p[i], p[j], p[k]), c.r);\n c.r = c.o.dis(p[k]);\n }\n }\n }\n printf(\"%.5lf\\n%.5lf %.5lf\\n\", c.r, c.o.x, c.o.y);\n}\n} \n\nint main() {\n#ifdef DBG\n freopen(\"in.in\", \"r\", stdin);\n#endif\n Task::solve();\n return 0;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <algorithm>\n#include <cctype>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nnamespace IO {\n\ninline char read() {\n static const int IN_LEN = 1000000;\n static char buf[IN_LEN], *s, *t;\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n return s == t ? -1 : *s++;\n}\n\ntemplate <typename T>\ninline void read(T &x) {\n static char c;\n static bool iosig;\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n if (c == -1) return;\n iosig ? x = -x : 0;\n }\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n iosig ? x = -x : 0;\n}\n\ninline int read(char *buf) {\n register int s = 0;\n register char c;\n while (c = read(), isspace(c) && c != -1)\n ;\n if (c == -1) {\n *buf = '\\0';\n return -1;\n }\n do\n buf[s++] = c;\n while (c = read(), !isspace(c) && c != -1);\n buf[s] = '\\0';\n return s;\n}\n\ninline void read(double &x) {\n static char buf[30];\n read(buf), x = atof(buf);\n}\n\nconst int OUT_LEN = 1000000;\n\nchar obuf[OUT_LEN], *oh = obuf;\n\ninline void print(char c) {\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n *oh++ = c;\n}\n\ntemplate <typename T>\ninline void print(T x) {\n static int buf[30], cnt;\n "},"suffix":{"kind":"string","value":"\n}\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n} \n\nnamespace Task {\n\nconst int MAXN = 100005;\nconst double EPS = 1e-8;\n\ntemplate <typename T>\ninline T square(const T &x) {\n return x * x;\n}\n\nstruct Point {\n double x, y;\n\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n inline double dis(const Point &p) const {\n return sqrt(square(x - p.x) + square(y - p.y));\n }\n\n inline Point operator+(const Point &p) const {\n return Point(x + p.x, y + p.y);\n }\n\n inline Point operator-(const Point &p) const {\n return Point(x - p.x, y - p.y);\n }\n\n inline Point operator*(const double i) const { return Point(x * i, y * i); }\n\n inline double operator*(const Point &p) const { return x * p.y - y * p.x; }\n\n inline double operator^(const Point &p) const { return x * p.x + y * p.y; }\n\n inline Point operator/(const double i) const { return Point(x / i, y / i); }\n\n inline void read() { IO::read(x), IO::read(y); }\n} p[MAXN];\n\nstruct Circle {\n Point o;\n double r;\n\n Circle(const Point &o, const double r) : o(o), r(r) {}\n\n Circle() {}\n};\n\nstruct Line {\n Point s, t;\n\n Line(const Point &s, const Point &t) : s(s), t(t) {}\n\n inline Point intersect(const Line &l) const {\n return s +\n (t - s) * (((s - l.s) * (l.t - l.s)) / ((l.t - l.s) * (t - s)));\n }\n\n inline Line getPerpendicularBisector() {\n return Line(\n Point((s.x + t.x) / 2, (s.y + t.y) / 2),\n Point((s.x + t.x) / 2 + s.y - t.y, (s.y + t.y) / 2 + t.x - s.x));\n }\n};\n\ninline Point getCenter(const Point &a, const Point &b, const Point &c) {\n return Line(a, b).getPerpendicularBisector().intersect(\n Line(a, c).getPerpendicularBisector());\n}\n\ninline void solve() {\n using namespace IO;\n srand(495);\n register int n;\n read(n);\n for (register int i = 1; i <= n; i++) p[i].read();\n std::random_shuffle(p + 1, p + n + 1);\n Circle c(p[1], 0);\n for (register int i = 1; i <= n; i++) {\n if (c.o.dis(p[i]) - c.r < EPS) continue;\n c = Circle((p[1] + p[i]) / 2, p[1].dis(p[i]) / 2);\n for (register int j = 2; j < i; j++) {\n if (c.o.dis(p[j]) - c.r < EPS) continue;\n c = Circle((p[i] + p[j]) / 2, p[i].dis(p[j]) / 2);\n for (register int k = 1; k < j; k++) {\n if (c.o.dis(p[k]) - c.r < EPS) continue;\n c = Circle(getCenter(p[i], p[j], p[k]), c.r);\n c.r = c.o.dis(p[k]);\n }\n }\n }\n printf(\"%.5lf\\n%.5lf %.5lf\\n\", c.r, c.o.x, c.o.y);\n}\n} \n\nint main() {\n#ifdef DBG\n freopen(\"in.in\", \"r\", stdin);\n#endif\n Task::solve();\n return 0;\n}\n"},"middle":{"kind":"string","value":"if (x == 0) {\n print('0');\n } else {\n x < 0 ? (print('-'), x = -x) : 0;\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n while (cnt) print((char)buf[cnt--]);\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"struct PriorityQueue : public std::map<int, int, std::greater<int> > {\n\n typedef std::map<int, int, std::greater<int> > super;\n\n\n\n inline void push(int x) { super::operator[](x)++; }\n\n\n\n inline void erase(int x) {\n\n super::iterator it = super::find(x);\n\n if (it != super::end() && --it->second == 0) super::erase(it);\n\n }\n\n\n\n inline int top() { return super::empty() ? 0 : super::begin()->first; }\n\n};\n\n\n","file_path":"BZOJ/BZOJ4382-Podział naszyjnika-线段树+map.cpp","rank":0,"score":99142.46373898798},{"content":"struct buf {\n\n char z[1 << 25], *s;\n\n buf() : s(z) { fread(z, 1, sizeof z, stdin); }\n\n inline void pre(char *v) {\n\n while (*s < 48) ++s;\n\n while (*s > 32) *v++ = *s++;\n\n *v = 0;\n\n }\n\n operator int() {\n\n int x = 0, y = 0;\n\n while (*s < 48) y = *s++;\n\n while (*s > 32) x = x * 10 + *s++ - 48;\n\n if (y == 45) return -x;\n\n return x;\n\n }\n\n} it;\n\nint main() {\n\n static char s[N];\n\n static arr1 a, t;\n\n register int n = it;\n","file_path":"BZOJ/BZOJ4199.cpp","rank":1,"score":94759.63732507822},{"content":"n, k, x = map(int, input().split())\n\nrangers = list(map(int, input().split()))\n\nfor i in range(min(k, 8 + (k & 3))):\n\n rangers.sort()\n\n rangers = [rangers[i] if (i & 1) else rangers[i] ^ x for i in range(n)]\n\n print(rangers)\n\nrangers.sort()\n","file_path":"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/C-Jon Snow and his Favourite Number.py","rank":2,"score":69464.61375650797},{"content":"class MonotoneQueue : public std::deque<std::pair<T, int> > {\n\n public:\n\n typedef std::pair<T, int> Pair;\n\n typedef std::deque<Pair> super;\n\n\n\n MonotoneQueue(Comparator cmp = Comparator()) : cmp(cmp), pos(0), cur(0) {}\n\n\n\n inline void push(const T &v) {\n\n while (!super::empty() && cmp(super::front().first, v))\n\n super::pop_front();\n\n super::push_front(Pair(v, cur++));\n\n }\n\n\n\n inline void pop() {\n\n if (super::back().second == pos++) super::pop_back();\n\n }\n\n\n\n inline const T &top() { return super::back().first; }\n\n\n\n inline void clear() { super::clear(), pos = cur = 0; }\n","file_path":"CodeVS/CodeVS3269-混合背包-dp+单调队列.cpp","rank":3,"score":59352.197070466624},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「BZOJ 3453」XLkxc 18-09-2017\n\n * 拉格朗日插值\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <typename T>\n\ninline void read(T &x) {\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":4,"score":49060.9242236257},{"content":"template <typename T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void print(const char *s) {\n\n for (; *s; s++) print(*s);\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":5,"score":49057.18330959311},{"content":" static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\n\n iosig ? x = -x : 0;\n\n}\n\n\n\ninline void read(char &c) {\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n\n}\n\n\n\ninline int read(char *buf) {\n\n register int s = 0;\n\n register char c;\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":6,"score":49054.92138489802},{"content":" if (c == -1) {\n\n *buf = 0;\n\n return -1;\n\n }\n\n do\n\n buf[s++] = c;\n\n while (c = read(), !isspace(c) && c != -1);\n\n buf[s] = 0;\n\n return s;\n\n}\n\n\n\nconst int OUT_LEN = 1000000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n\ninline void print(char c) {\n\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n\n *oh++ = c;\n\n}\n\n\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":7,"score":49048.48210689305},{"content":" register uint ret = 0, tmp;\n\n for (register int i = 1; i <= n + 1; i++) {\n\n tmp = (ulong)f[i] * pre[i - 1] % MOD * suf[i + 1] % MOD *\n\n inv[i - 1] % MOD * inv[n + 1 - i] % MOD;\n\n if ((n + 1 - i) % 2) tmp = MOD - tmp;\n\n ret = (ret + tmp) % MOD;\n\n }\n\n return ret;\n\n }\n\n\n\n inline void solve() {\n\n register int T;\n\n io >> T;\n\n init(MAXN + 5);\n\n static uint g[MAXN + 10], f[MAXN + 10];\n\n while (T--) {\n\n io >> k >> a >> n >> d;\n\n for (register int i = 0; i <= k + 3; i++) g[i] = modPow(i, k);\n\n for (register int i = 1; i <= k + 3; i++)\n\n g[i] = (g[i] + g[i - 1]) % MOD;\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":8,"score":49028.06370505897},{"content":" for (register int i = 1; i <= k + 3; i++)\n\n g[i] = (g[i] + g[i - 1]) % MOD;\n\n f[0] = interpolation(g, a, k + 2);\n\n for (register int i = 1; i <= k + 5; i++)\n\n f[i] = (f[i - 1] +\n\n interpolation(g, (a + (ulong)d * i) % MOD, k + 2)) %\n\n MOD;\n\n io << interpolation(f, n, k + 4) << '\\n';\n\n }\n\n }\n\n} task;\n\n}\n\n\n\nint main() {\n\n task.solve();\n\n return 0;\n\n}","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":9,"score":49017.12987719444},{"content":"typedef unsigned int uint;\n\n\n\nconst uint MOD = 1234567891;\n\nconst int MAXN = 123;\n\n\n\ntypedef unsigned long long ulong;\n\n\n\ninline int modPow(int a, int b) {\n\n register int ret = 1;\n\n for (; b; b >>= 1, a = (ulong)a * a % MOD)\n\n (b & 1) ? ret = (ulong)ret * a % MOD : 0;\n\n return ret;\n\n}\n\n\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":10,"score":49014.69136726026},{"content":"def c(n, m):\n\n if (n < m):\n\n return 0\n","file_path":"BZOJ/BZOJ2729.py","rank":11,"score":48286.83665702732},{"content":"\n\ntemplate<class T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read())\n\n x = (x + (x << 2) << 1) + (c ^ '0');\n\n iosig ? x = -x : 0;\n\n}\n\n\n\nconst int OUT_LEN = 1000000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n\ninline void print(char c) {\n\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n","file_path":"atcoder/AtCoder Beginner Contest 061/C.cpp","rank":12,"score":46911.30402238217},{"content":" *oh++ = c;\n\n}\n\n\n\ntemplate<class T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void flush() {\n\n fwrite(obuf, 1, oh - obuf, stdout);\n\n}\n\n}\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 100005;\n\n\n","file_path":"atcoder/AtCoder Beginner Contest 061/C.cpp","rank":13,"score":46910.304842856174},{"content":"struct Task {\n\n uint inv[MAXN + 10];\n\n int k, a, n, d;\n\n\n\n inline void init(const int n) {\n\n inv[0] = inv[1] = 1;\n\n for (register int i = 2; i <= n; i++)\n\n inv[i] = (ulong)i * inv[i - 1] % MOD;\n\n inv[n] = modPow(inv[n], MOD - 2);\n\n for (register int i = n - 1; i >= 0; i--)\n\n inv[i] = inv[i + 1] * (i + 1ll) % MOD;\n\n }\n\n\n\n inline uint interpolation(uint *f, uint u, int n) {\n\n static uint pre[MAXN + 10], suf[MAXN + 10];\n\n pre[0] = suf[n + 2] = 1;\n\n for (register int i = 1; i <= n + 1; i++)\n\n pre[i] = (ulong)pre[i - 1] * (u - i + MOD) % MOD;\n\n for (register int i = n + 1; i; i--)\n\n suf[i] = (ulong)suf[i + 1] * (u - i + MOD) % MOD;\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":14,"score":46896.38549692933},{"content":" * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n ******************************************************************************/\n\n#include <bits/stdc++.h>\n\n/**\n\n * 「AtCoder Beginner Contest 061」Big Array 13-05-2017\n\n * @author xehoth \n\n */\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n","file_path":"atcoder/AtCoder Beginner Contest 061/C.cpp","rank":15,"score":46887.48794200966},{"content":"\n\nint main() {\n\n // freopen(\"in.in\", \"r\", stdin);\n\n ios::sync_with_stdio(false);\n\n cin.tie(NULL);\n\n cin >> n;\n\n for (register int i = 1; i <= n; i++) {\n\n cin >> (s + 1);\n\n l = strlen(s + 1);\n\n solve(0, 0);\n\n ss[++len] = 'a' + 26;\n\n for (register int j = 1; j <= l; j++) ss[++len] = s[j];\n\n }\n\n ac_bfs();\n\n int pos = 0, now = 0;\n\n for (; pos < len; pos++) tag[now = f[now][ss[pos + 1] - 'a']]++;\n\n for (register int i = tail; i; i--) {\n\n tag[fail[line[i]]] += tag[line[i]];\n\n for (int k = first[line[i]]; k; k = next[k]) ans[k] = tag[line[i]];\n\n }\n\n for (register int i = 1; i <= n; i++) cout << ans[i] << \"\\n\";\n\n return 0;\n\n}","file_path":"省选/2013/TJOI/单词-AC自动机.cpp","rank":16,"score":46867.26762317405},{"content":"/**\n\n * Copyright (c) 2016, xehoth\n\n * All rights reserved.\n\n * 「TJOI 2013」单词 26-07-2016\n\n * AC 自动机\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n#define MAX_N 1050050\n\nusing namespace std;\n\nint n, len, l, tot, head = 0, tail = 1;\n\nchar ss[MAX_N], s[MAX_N];\n\nint first[MAX_N], next[MAX_N], ans[MAX_N], fail[MAX_N], f[MAX_N][27];\n\nint st, tag[MAX_N], line[MAX_N];\n\n\n\nvoid solve(int v, int x) {\n\n if (x == l) {\n\n next[++st] = first[v];\n\n first[v] = st;\n\n return;\n","file_path":"省选/2013/TJOI/单词-AC自动机.cpp","rank":17,"score":46867.164473284094},{"content":" return;\n\n }\n\n k -= q[i].b;\n\n }\n\n}\n\n}\n\n\n\nint main() {\n\n#ifdef DBG\n\n freopen(\"in.in\", \"r\", stdin);\n\n#endif\n\n Task::solve();\n\n IO::flush();\n\n return 0;\n\n}\n","file_path":"atcoder/AtCoder Beginner Contest 061/C.cpp","rank":18,"score":46864.06409351797},{"content":" }\n\n if (!f[v][s[x + 1] - 'a']) f[v][s[x + 1] - 'a'] = ++tot;\n\n solve(f[v][s[x + 1] - 'a'], x + 1);\n\n}\n\n\n\nvoid ac_bfs() {\n\n line[1] = 0;\n\n while (head ^ tail) {\n\n head++;\n\n if (line[head])\n\n for (int j = 0; j < 26; j++)\n\n if (f[line[head]][j])\n\n fail[f[line[head]][j]] = f[fail[line[head]]][j];\n\n for (int j = 0; j < 26; j++)\n\n if (!f[line[head]][j])\n\n f[line[head]][j] = f[fail[line[head]]][j];\n\n else\n\n line[++tail] = f[line[head]][j];\n\n }\n\n}\n","file_path":"省选/2013/TJOI/单词-AC自动机.cpp","rank":19,"score":46857.17617634322},{"content":"/*******************************************************************************\n\n * Copyright (c) 2016-2017, xehoth\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above copyright\n\n * notice, this list of conditions and the following disclaimer in the\n\n * documentation and/or other materials provided with the distribution.\n\n * * Neither the name xehoth, nor the names of its contributors may be used\n\n * to endorse or promote products derived from this software without \n\n * specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY XEHOTH AND CONTRIBUTORS \"AS IS\" AND ANY\n\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL XEHOTH AND CONTRIBUTORS BE LIABLE FOR ANY\n","file_path":"atcoder/AtCoder Beginner Contest 061/C.cpp","rank":20,"score":46851.56233734379},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「ARC 071C」怪文書 20-08-2017\n\n * dp\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace Task {\n\n\n\ninline void solve() {\n\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\n\n register int n;\n\n std::cin >> n;\n\n std::streambuf *ob = std::cout.rdbuf(), *ib = std::cin.rdbuf();\n\n static int buc[26], f[26];\n\n memset(f, 127, sizeof(f));\n\n register char c;\n\n for (register int i = 0; i < n; i++) {\n","file_path":"atcoder/AtCoder Regular Contest 071/C-怪文書-dp.cpp","rank":21,"score":44957.653535553814},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「ARC 080C」4-adjacent 24-08-2017\n\n *\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 200000;\n\nint a[MAXN + 1];\n\n\n\ninline void solve() {\n\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\n\n register int n;\n\n std::cin >> n;\n\n for (register int i = 1; i <= n; i++) std::cin >> a[i];\n\n register int cnt4 = 0, cnt2 = 0, cnt = 0;\n","file_path":"atcoder/AtCoder Regular Contest 080/C-4-adjacent.cpp","rank":22,"score":44956.8414167616},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「ARC 085C」HSI 06-12-2017\n\n *\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nint main() {\n\n register int n, m;\n\n std::cin >> n >> m;\n\n std::cout << (1900 * m + 100 * (n - m)) * (1 << m);\n\n return 0;\n\n}\n","file_path":"atcoder/AtCoder Regular Contest 085/C-HSI.cpp","rank":23,"score":44939.50917053249},{"content":"\n\nint main() {\n\n // freopen(\"in.in\", \"r\", stdin);\n\n ios::sync_with_stdio(false);\n\n cin.tie(NULL);\n\n cin >> n;\n\n for (register int i = 1; i <= n; i++) {\n\n cin >> (s + 1);\n\n l = strlen(s + 1);\n\n solve(0, 0);\n\n ss[++len] = 'a' + 26;\n\n for (register int j = 1; j <= l; j++) ss[++len] = s[j];\n\n }\n\n ac_bfs();\n\n int pos = 0, now = 0;\n\n for (; pos < len; pos++) tag[now = f[now][ss[pos + 1] - 'a']]++;\n\n for (register int i = tail; i; i--) {\n\n tag[fail[line[i]]] += tag[line[i]];\n\n for (int k = first[line[i]]; k; k = next[k]) ans[k] = tag[line[i]];\n\n }\n\n for (register int i = 1; i <= n; i++) cout << ans[i] << \"\\n\";\n\n return 0;\n\n}","file_path":"BZOJ/BZOJ3172-单词-AC自动机.cpp","rank":24,"score":44938.41989627859},{"content":"/**\n\n * Copyright (c) 2016, xehoth\n\n * All rights reserved.\n\n * 「TJOI 2013」单词 26-07-2016\n\n * AC 自动机\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n#define MAX_N 1050050\n\nusing namespace std;\n\nint n, len, l, tot, head = 0, tail = 1;\n\nchar ss[MAX_N], s[MAX_N];\n\nint first[MAX_N], next[MAX_N], ans[MAX_N], fail[MAX_N], f[MAX_N][27];\n\nint st, tag[MAX_N], line[MAX_N];\n\n\n\nvoid solve(int v, int x) {\n\n if (x == l) {\n\n next[++st] = first[v];\n\n first[v] = st;\n\n return;\n","file_path":"BZOJ/BZOJ3172-单词-AC自动机.cpp","rank":25,"score":44938.316746388635},{"content":" for (register int i = 1; i <= n; i++) {\n\n if (a[i] % 4 == 0) {\n\n cnt4++;\n\n } else if (a[i] % 2 == 0) {\n\n cnt2++;\n\n } else {\n\n cnt++;\n\n }\n\n }\n\n if (cnt2 == 0 && cnt <= cnt4 + 1) {\n\n std::cout << \"Yes\";\n\n } else if (cnt <= cnt4) {\n\n std::cout << \"Yes\";\n\n } else {\n\n std::cout << \"No\";\n\n }\n\n}\n\n}\n\n\n\nint main() {\n\n Task::solve();\n\n return 0;\n\n}","file_path":"atcoder/AtCoder Regular Contest 080/C-4-adjacent.cpp","rank":26,"score":44935.969171642966},{"content":" memset(buc, 0, sizeof(buc));\n\n while (c = ib->sbumpc(), !isalpha(c))\n\n ;\n\n while (isalpha(c)) buc[c - 'a']++, c = ib->sbumpc();\n\n for (register int i = 0; i < 26; i++) f[i] = std::min(f[i], buc[i]);\n\n }\n\n for (register int i = 0; i < 26; i++)\n\n for (; f[i]--;) ob->sputc('a' + i);\n\n}\n\n}\n\n\n\nint main() {\n\n Task::solve();\n\n return 0;\n\n}\n","file_path":"atcoder/AtCoder Regular Contest 071/C-怪文書-dp.cpp","rank":27,"score":44930.803211457336},{"content":" }\n\n if (!f[v][s[x + 1] - 'a']) f[v][s[x + 1] - 'a'] = ++tot;\n\n solve(f[v][s[x + 1] - 'a'], x + 1);\n\n}\n\n\n\nvoid ac_bfs() {\n\n line[1] = 0;\n\n while (head ^ tail) {\n\n head++;\n\n if (line[head])\n\n for (int j = 0; j < 26; j++)\n\n if (f[line[head]][j])\n\n fail[f[line[head]][j]] = f[fail[line[head]]][j];\n\n for (int j = 0; j < 26; j++)\n\n if (!f[line[head]][j])\n\n f[line[head]][j] = f[fail[line[head]]][j];\n\n else\n\n line[++tail] = f[line[head]][j];\n\n }\n\n}\n","file_path":"BZOJ/BZOJ3172-单词-AC自动机.cpp","rank":28,"score":44928.32844944776},{"content":"class CPlusPlusInterpreter {\n\n public:\n\n CPlusPlusInterpreter() {\n\n init();\n\n funcAndVar();\n\n runFunction(func[\"main\"].first, std::vector<int>());\n\n }\n\n\n\n private:\n\n std::vector<std::string> code;\n\n\n\n inline void init() {\n\n std::ios::sync_with_stdio(false);\n\n std::cin.tie(NULL);\n\n std::cout.tie(NULL);\n\n InputNumber::init();\n\n std::string str, src;\n\n for (register int i = 0; i < 5; i++) std::cin >> str;\n\n while (std::cin >> str) src += str + '\\n';\n\n\n","file_path":"BZOJ/BZOJ4020.cpp","rank":29,"score":44919.68230560329},{"content":"struct Query {\n\n int a, b;\n\n\n\n inline bool operator<(const Query &n) const {\n\n return a < n.a || (a == n.a && b < n.b);\n\n }\n\n} q[MAXN];\n\n\n\ninline void solve() {\n\n using namespace IO;\n\n register int n;\n\n register long long k;\n\n read(n), read(k);\n\n for (register int i = 0; i < n; i++) {\n\n read(q[i].a), read(q[i].b);\n\n }\n\n std::sort(q, q + n);\n\n for (register int i = 0; i < n; i++) {\n\n if (k <= q[i].b) {\n\n print(q[i].a), print('\\n');\n","file_path":"atcoder/AtCoder Beginner Contest 061/C.cpp","rank":30,"score":44919.68230560329},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「BZOJ 4264」小C找朋友 16-10-2017\n\n * Hash\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <typename T>\n\ninline bool read(T &x) {\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":31,"score":43202.75764774292},{"content":"\n\ntemplate <typename T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void print(const char *s) {\n\n for (; *s; s++) print(*s);\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":32,"score":43200.10463597317},{"content":"\n\ntemplate <typename T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void print(const char *s) {\n\n for (; *s; s++) print(*s);\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":33,"score":43200.10463597317},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「SuperOJ 1985」字符串 15-09-2017\n\n * AC 自动机\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <typename T>\n\ninline bool read(T &x) {\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":34,"score":43199.79021602961},{"content":" static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return false;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\n\n iosig ? x = -x : 0;\n\n return true;\n\n}\n\n\n\ninline void read(char &c) {\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n\n}\n\n\n\ninline int read(char *buf) {\n\n register int s = 0;\n\n register char c;\n\n while (c = read(), isspace(c) && c != -1)\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":35,"score":43197.20495503703},{"content":" static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return false;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\n\n iosig ? x = -x : 0;\n\n return true;\n\n}\n\n\n\ninline void read(char &c) {\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n\n}\n\n\n\ninline int read(char *buf) {\n\n register int s = 0;\n\n register char c;\n\n while (c = read(), isspace(c) && c != -1)\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":36,"score":43197.20495503703},{"content":" ;\n\n if (c == -1) {\n\n *buf = 0;\n\n return -1;\n\n }\n\n do\n\n buf[s++] = c;\n\n while (c = read(), !isspace(c) && c != -1);\n\n buf[s] = 0;\n\n return s;\n\n}\n\n\n\nconst int OUT_LEN = 1000000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n\ninline void print(char c) {\n\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n\n *oh++ = c;\n\n}\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":37,"score":43191.40343327311},{"content":" ;\n\n if (c == -1) {\n\n *buf = 0;\n\n return -1;\n\n }\n\n do\n\n buf[s++] = c;\n\n while (c = read(), !isspace(c) && c != -1);\n\n buf[s] = 0;\n\n return s;\n\n}\n\n\n\nconst int OUT_LEN = 1000000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n\ninline void print(char c) {\n\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n\n *oh++ = c;\n\n}\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":38,"score":43191.40343327311},{"content":"struct InputOutputStream {\n\n template <typename T>\n\n inline InputOutputStream &operator>>(T &x) {\n\n read(x);\n\n return *this;\n\n }\n\n\n\n template <typename T>\n\n inline InputOutputStream &operator<<(const T &x) {\n\n print(x);\n\n return *this;\n\n }\n\n\n\n ~InputOutputStream() { flush(); }\n\n} io;\n\n}\n\n\n\nnamespace {\n\n\n\nusing IO::io;\n","file_path":"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp","rank":39,"score":43187.45358133679},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「ARC 081C」Make a Rectangle 21-08-2017\n\n * 贪心\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace Task {\n\n\n\n#define long long long\n\n\n\nstd::map<int, int> map;\n\n\n\ninline void solve() {\n\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\n\n register int n, cnt = 2;\n\n register long ans = 1;\n\n std::cin >> n;\n","file_path":"atcoder/AtCoder Regular Contest 081/C-Make a Rectangle-贪心.cpp","rank":40,"score":43179.23429021368},{"content":"inline void insert(const char *s) {\n\n register Node *p = root;\n\n for (register int idx = 0; *s; s++) {\n\n if (p->c[idx = *s - 'a'] == null) p->c[idx] = new Node();\n\n p = p->c[idx];\n\n }\n\n p->cnt++;\n\n}\n\n\n\ninline void init() {\n\n null->fail = null, root = new Node();\n\n for (register int i = 0; i < MAX_SIGMA; i++) null->c[i] = root;\n\n null->cnt = 0;\n\n}\n\n\n\ninline void build() {\n\n static std::queue<Node *> q;\n\n q.push(root);\n\n for (Node *p, *u; !q.empty();) {\n\n p = q.front(), q.pop();\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":41,"score":43177.05718239754},{"content":"\n\ninline void solve() {\n\n init();\n\n register int n, q, maxLen = 0;\n\n io >> n >> q;\n\n for (register int i = 1; i <= n; i++)\n\n maxLen = std::max(maxLen, IO::read(s)), insert(s);\n\n build();\n\n register int len = IO::read(s + 1);\n\n register char c;\n\n register int ans = query(s + 1, len);\n\n io << ans << '\\n';\n\n for (register int pos; q--;) {\n\n io >> pos >> c;\n\n ans -=\n\n query(s + std::max(pos - maxLen, 1),\n\n std::min(len, pos + maxLen) - std::max(pos - maxLen, 1) + 1);\n\n s[pos] = c;\n\n ans +=\n\n query(s + std::max(pos - maxLen, 1),\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":42,"score":43175.059690846625},{"content":" for (register int i = 0; i < MAX_SIGMA; i++) {\n\n if (p->c[i] != null) {\n\n for (u = p->fail; u->c[i] == null;) u = u->fail;\n\n p->c[i]->fail = u->c[i], q.push(p->c[i]);\n\n p->c[i]->cnt += u->c[i]->cnt;\n\n } else {\n\n p->c[i] = p->fail->c[i];\n\n }\n\n }\n\n }\n\n}\n\n\n\ninline int query(const char *s, register int len) {\n\n register int ret = 0;\n\n register Node *p = root;\n\n for (register int i = 0; i < len; i++) p = p->c[s[i] - 'a'], ret += p->cnt;\n\n return ret;\n\n}\n\n\n\nchar s[MAXN + 1];\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":43,"score":43171.43953096296},{"content":"\n\ntypedef unsigned long long ulong;\n\n\n\ninline ulong xorShift128Plus() {\n\n static ulong seed1 = 495;\n\n static ulong seed2 = 233;\n\n register ulong x = seed1;\n\n register const ulong y = seed2;\n\n seed1 = y, x ^= x << 23;\n\n seed2 = x ^ y ^ (x >> 17) ^ (y >> 26);\n\n return seed2 + y;\n\n}\n\n\n\nconst int MAXN = 1000000;\n\nulong hash[MAXN + 1], val[MAXN + 1], ans, cnt;\n\n\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":44,"score":43166.08004296032},{"content":" for (register int i = 1; i <= m; i++) {\n\n if (edge[i].u != edge[i].v) {\n\n hash[edge[i].u] ^= val[edge[i].v];\n\n hash[edge[i].v] ^= val[edge[i].u];\n\n }\n\n }\n\n for (register int i = 1; i <= m; i++) {\n\n if (edge[i].u != edge[i].v && ((hash[edge[i].u] ^ val[edge[i].v]) ==\n\n (hash[edge[i].v] ^ val[edge[i].u])))\n\n ans++;\n\n }\n\n std::sort(hash + 1, hash + n + 1);\n\n for (register int i = 1; i <= n; i++) {\n\n cnt++;\n\n if (i == n || hash[i] != hash[i + 1])\n\n ans += cnt * (cnt - 1) >> 1, cnt = 0;\n\n }\n\n io << ans << '\\n';\n\n}\n\n}\n\n\n\nint main() {\n\n solve();\n\n return 0;\n\n}\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":45,"score":43164.87668491422},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「ARC 070C」Go Home 18-08-2017\n\n * 结论题\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nint main() {\n\n register int n = 1, x;\n\n std::cin >> x;\n\n while (n * (n + 1) / 2 < x) n++;\n\n std::cout << n;\n\n return 0;\n\n}","file_path":"atcoder/AtCoder Regular Contest 070/C-GoHome-结论.cpp","rank":46,"score":43163.015017052334},{"content":" std::min(len, pos + maxLen) - std::max(pos - maxLen, 1) + 1);\n\n io << ans << '\\n';\n\n }\n\n}\n\n}\n\n\n\nint main() {\n\n // freopen(\"blocks.in\", \"r\", stdin);\n\n // freopen(\"blocks.out\", \"w\", stdout);\n\n solve();\n\n return 0;\n\n}","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":47,"score":43161.81053248975},{"content":" for (register int i = 0, t; i < n; i++) std::cin >> t, map[t]++;\n\n for (auto it = map.rbegin(); it != map.rend(); it++) {\n\n if (it->second > 1) {\n\n ans *= it->first, cnt--;\n\n if (it->second > 3 && cnt == 1) ans *= it->first, cnt--;\n\n }\n\n if (cnt == 0) break;\n\n }\n\n if (cnt == 0)\n\n std::cout << ans;\n\n else\n\n std::cout << '0';\n\n}\n\n\n\n#undef long\n\n}\n\n\n\nint main() {\n\n Task::solve();\n\n return 0;\n\n}","file_path":"atcoder/AtCoder Regular Contest 081/C-Make a Rectangle-贪心.cpp","rank":48,"score":43159.14141731502},{"content":"#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <typename T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":49,"score":41569.732126468756},{"content":"inline void read(T1 &a, T2 &b, T3 &c, T4 &d, T5 &e) {\n\n read(a), read(b), read(c), read(d), read(e);\n\n}\n\n\n\nconst int OUT_LEN = 1000000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n\ninline void print(char c) {\n\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n\n *oh++ = c;\n\n}\n\n\n\ntemplate <typename T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":50,"score":41561.57939287101},{"content":"}\n\n\n\ntemplate <typename T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n\n iosig ? x = -x : 0;\n\n}\n\n\n\ninline int read(char *buf) {\n\n register int s = 0;\n\n register char c;\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n\n if (c == -1) {\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":51,"score":41560.188116102676},{"content":" oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n\n *oh++ = c;\n\n}\n\n\n\ntemplate <typename T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void print(const char *s) {\n\n for (; *s; s++) print(*s);\n\n}\n\n\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":52,"score":41559.7109399017},{"content":"template <typename T1, typename T2, typename T3, typename T4, typename T5>\n\ninline void println(T1 a, T2 b, T3 c, T4 d, T5 e) {\n\n print(a), print(b), print(c), print(d), print(e), print('\\n');\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n}\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 5005;\n\n\n\ntypedef std::pair<int, int> Pair;\n\n\n\ninline void solve() {\n\n using namespace IO;\n\n register int n;\n\n read(n);\n\n static int l[MAXN], r[MAXN], a[MAXN];\n\n memset(l, 127, sizeof(int) * (MAXN + 1));\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":53,"score":41551.38850288457},{"content":" iosig ? x = -x : 0;\n\n}\n\n\n\ninline int read(char *buf) {\n\n register int s = 0;\n\n register char c;\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n\n if (c == -1) {\n\n *buf = '\\0';\n\n return -1;\n\n }\n\n do\n\n buf[s++] = c;\n\n while (c = read(), !isspace(c) && c != -1);\n\n buf[s] = '\\0';\n\n return s;\n\n}\n\n\n\ninline void read(double &x) {\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":54,"score":41548.1522809269},{"content":" * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n ******************************************************************************/\n\n#include <bits/stdc++.h>\n\n/**\n\n * T1 28-05-2017\n\n * dp\n\n * @author xehoth\n\n */\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":55,"score":41541.88065038773},{"content":" *buf = '\\0';\n\n return -1;\n\n }\n\n do\n\n buf[s++] = c;\n\n while (c = read(), !isspace(c) && c != -1);\n\n buf[s] = '\\0';\n\n return s;\n\n}\n\n\n\ninline void read(double &x) {\n\n static char buf[30];\n\n read(buf), x = atof(buf);\n\n}\n\n\n\ntemplate <typename T1, typename T2>\n\ninline void read(T1 &a, T2 &b) {\n\n read(a), read(b);\n\n}\n\n\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":56,"score":41540.90262603176},{"content":"template <typename T1, typename T2, typename T3>\n\ninline void read(T1 &a, T2 &b, T3 &c) {\n\n read(a), read(b), read(c);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\n\ninline void read(T1 &a, T2 &b, T3 &c, T4 &d) {\n\n read(a), read(b), read(c), read(d);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\n\ninline void read(T1 &a, T2 &b, T3 &c, T4 &d, T5 &e) {\n\n read(a), read(b), read(c), read(d), read(e);\n\n}\n\n\n\nconst int OUT_LEN = 1000000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n\ninline void print(char c) {\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":57,"score":41540.690951637174},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「ARC 079C」Cat Snuke and a Voyage 26-08-2017\n\n *\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace {\n\n\n\nconst int MAXN = 200000;\n\nbool vis[MAXN + 1];\n\n\n\ninline void solve() {\n\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\n\n register int n, m, u, v;\n\n for (std::cin >> n >> m; m--;) {\n\n std::cin >> u >> v;\n\n if (u == 1) {\n","file_path":"atcoder/AtCoder Regular Contest 079/C-Cat Snuke and a Voyage.cpp","rank":58,"score":41537.85546304997},{"content":" static char buf[30];\n\n read(buf), x = atof(buf);\n\n}\n\n\n\ntemplate <typename T1, typename T2>\n\ninline void read(T1 &a, T2 &b) {\n\n read(a), read(b);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3>\n\ninline void read(T1 &a, T2 &b, T3 &c) {\n\n read(a), read(b), read(c);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\n\ninline void read(T1 &a, T2 &b, T3 &c, T4 &d) {\n\n read(a), read(b), read(c), read(d);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":59,"score":41537.553621957086},{"content":" for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void print(const char *s) {\n\n for (; *s; s++) print(*s);\n\n}\n\n\n\ntemplate <typename T>\n\ninline void println(T x) {\n\n print(x), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2>\n\ninline void print(T1 a, T2 b) {\n\n print(a), print(b);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3>\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":60,"score":41536.81586556131},{"content":"inline void println(T1 a, T2 b, T3 c) {\n\n print(a), print(b), print(c), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\n\ninline void println(T1 a, T2 b, T3 c, T4 d) {\n\n print(a), print(b), print(c), print(d), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\n\ninline void println(T1 a, T2 b, T3 c, T4 d, T5 e) {\n\n print(a), print(b), print(c), print(d), print(e), print('\\n');\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n}\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 100010;\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":61,"score":41534.966491103805},{"content":"\n\n#define long long long\n\nlong cost[MAXN], base[MAXN];\n\nlong n, S;\n\n\n\ninline bool check(long m) {\n\n for (int i = 1; i <= n; i++) {\n\n cost[i] = base[i] + i * m;\n\n }\n\n std::sort(cost + 1, cost + n + 1);\n\n long s = 0;\n\n for (int i = 1; i <= m; ++i) {\n\n s += cost[i];\n\n }\n\n return s <= S;\n\n}\n\n\n\ninline void solve() {\n\n using namespace IO;\n\n read(n), read(S);\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":62,"score":41534.063968292714},{"content":" for (register int i = 0; i < n; i++) {\n\n read(a[i]);\n\n l[a[i]] = std::min(l[a[i]], i), r[a[i]] = i;\n\n }\n\n static std::vector<Pair> vec[MAXN];\n\n for (register int i = 0; i < n; i++) {\n\n bool vis[MAXN] = {false};\n\n register int x = 0, min = INT_MAX, max = INT_MIN;\n\n for (register int j = i; j < n; j++) {\n\n if (!vis[a[j]]) x ^= a[j], vis[a[j]] = true;\n\n min = std::min(min, l[a[j]]), max = std::max(max, r[a[j]]);\n\n if (min >= i && max <= j) vec[i].emplace_back(j, x);\n\n }\n\n }\n\n static int f[MAXN];\n\n for (register int i = 0; i < n; i++) {\n\n for (const auto &j : vec[i])\n\n f[j.first + 1] = std::max(f[j.first + 1], f[i] + j.second);\n\n f[i + 1] = std::max(f[i + 1], f[i]);\n\n }\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":63,"score":41526.06885192274},{"content":" for (register int i = 1; i <= n; i++) read(base[i]);\n\n static long sum[MAXN];\n\n register int l = 0, r = n + 1;\n\n while (r - l > 1) {\n\n register int mid = l + r >> 1;\n\n if (check(mid))\n\n l = mid;\n\n else\n\n r = mid;\n\n }\n\n print(l), print(' ');\n\n for (int i = 1; i <= n; i++) {\n\n cost[i] = base[i] + i * l;\n\n }\n\n std::sort(cost + 1, cost + n + 1);\n\n long s = 0;\n\n for (int i = 1; i <= l; ++i) {\n\n s += cost[i];\n\n }\n\n print(s);\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":64,"score":41522.89730630432},{"content":" print(std::max(f[n], f[n + 1]));\n\n}\n\n}\n\n\n\nint main() {\n\n#ifdef DBG\n\n freopen(\"in.in\", \"r\", stdin);\n\n freopen(\"out.out\", \"w\", stdout);\n\n freopen(\"debug.log\", \"w\", stderr);\n\n#endif\n\n Task::solve();\n\n IO::flush();\n\n return 0;\n\n}","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":65,"score":41521.26228824745},{"content":"template <typename T>\n\ninline void println(T x) {\n\n print(x), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2>\n\ninline void print(T1 a, T2 b) {\n\n print(a), print(b);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3>\n\ninline void print(T1 a, T2 b, T3 c) {\n\n print(a), print(b), print(c);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\n\ninline void print(T1 a, T2 b, T3 c, T4 d) {\n\n print(a), print(b), print(c), print(d);\n\n}\n\n\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":66,"score":41519.79718656047},{"content":"inline void print(T1 a, T2 b, T3 c) {\n\n print(a), print(b), print(c);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\n\ninline void print(T1 a, T2 b, T3 c, T4 d) {\n\n print(a), print(b), print(c), print(d);\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\n\ninline void print(T1 a, T2 b, T3 c, T4 d, T5 e) {\n\n print(a), print(b), print(c), print(d), print(e);\n\n}\n\n\n\ntemplate <typename T1, typename T2>\n\ninline void println(T1 a, T2 b) {\n\n print(a), print(b), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3>\n","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":67,"score":41518.887755326636},{"content":"template <typename T1, typename T2, typename T3, typename T4, typename T5>\n\ninline void print(T1 a, T2 b, T3 c, T4 d, T5 e) {\n\n print(a), print(b), print(c), print(d), print(e);\n\n}\n\n\n\ntemplate <typename T1, typename T2>\n\ninline void println(T1 a, T2 b) {\n\n print(a), print(b), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3>\n\ninline void println(T1 a, T2 b, T3 c) {\n\n print(a), print(b), print(c), print('\\n');\n\n}\n\n\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\n\ninline void println(T1 a, T2 b, T3 c, T4 d) {\n\n print(a), print(b), print(c), print(d), print('\\n');\n\n}\n\n\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":68,"score":41518.7806519511},{"content":"}\n\n}\n\n\n\nint main() {\n\n#ifdef DBG\n\n freopen(\"in.in\", \"r\", stdin);\n\n#endif\n\n Task::solve();\n\n IO::flush();\n\n return 0;\n\n}","file_path":"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp","rank":69,"score":41517.75721729353},{"content":" if (vis[v]) std::cout << \"POSSIBLE\", exit(0);\n\n vis[v] = true;\n\n } else if (v == n) {\n\n if (vis[u]) std::cout << \"POSSIBLE\", exit(0);\n\n vis[u] = true;\n\n }\n\n }\n\n std::cout << \"IMPOSSIBLE\";\n\n}\n\n}\n\n\n\nint main() {\n\n solve();\n\n return 0;\n\n}","file_path":"atcoder/AtCoder Regular Contest 079/C-Cat Snuke and a Voyage.cpp","rank":70,"score":41506.15465165505},{"content":"/*******************************************************************************\n\n * Copyright (c) 2016-2017, xehoth\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above copyright\n\n * notice, this list of conditions and the following disclaimer in the\n\n * documentation and/or other materials provided with the distribution.\n\n * * Neither the name xehoth, nor the names of its contributors may be used\n\n * to endorse or promote products derived from this software without\n\n * specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY XEHOTH AND CONTRIBUTORS \"AS IS\" AND ANY\n\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL XEHOTH AND CONTRIBUTORS BE LIABLE FOR ANY\n","file_path":"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp","rank":71,"score":41505.255461119355},{"content":"struct Edge {\n\n int u, v;\n\n\n\n inline bool operator<(const Edge &x) const {\n\n return u == x.u && v < x.v && u < x.u;\n\n }\n\n\n\n inline bool operator==(const Edge &x) const { return u == x.u && v == x.v; }\n\n} edge[MAXN + 1];\n\n\n\ninline void solve() {\n\n register int n, m;\n\n io >> n >> m;\n\n for (register int i = 1; i <= n; i++) val[i] = xorShift128Plus();\n\n for (register int i = 1; i <= m; i++) {\n\n io >> edge[i].u >> edge[i].v;\n\n if (edge[i].u > edge[i].v) std::swap(edge[i].u, edge[i].v);\n\n }\n\n std::sort(edge + 1, edge + m + 1);\n\n m = std::unique(edge + 1, edge + m + 1) - edge - 1;\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":72,"score":41502.22315627431},{"content":"struct Node {\n\n Node *c[MAX_SIGMA], *fail;\n\n int cnt;\n\n Node();\n\n\n\n inline void *operator new(size_t);\n\n};\n\n\n\nconst int NODE_SIZE = sizeof(Node);\n\n\n\nchar pool[MAXN * NODE_SIZE], *cur = pool;\n\n\n\nNode *null = (Node *)pool, *root;\n\n\n\nNode::Node() : fail(null), cnt(0) {\n\n for (register int i = 0; i < MAX_SIGMA; i++) c[i] = null;\n\n}\n\n\n\ninline void *Node::operator new(size_t) { return cur += NODE_SIZE; }\n\n\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":73,"score":41502.22315627431},{"content":"struct InputOutputStream {\n\n template <typename T>\n\n inline InputOutputStream &operator>>(T &x) {\n\n read(x);\n\n return *this;\n\n }\n\n\n\n template <typename T>\n\n inline InputOutputStream &operator<<(const T &x) {\n\n print(x);\n\n return *this;\n\n }\n\n\n\n ~InputOutputStream() { flush(); }\n\n} io;\n\n}\n\n\n\nnamespace {\n\n\n\nconst int MAXN = 100000;\n\nconst int MAX_SIGMA = 26;\n\n\n\nusing IO::io;\n\n\n","file_path":"SuperOJ/p1985-字符串-AC自动机.cpp","rank":74,"score":38567.996018015816},{"content":"struct InputOutputStream {\n\n template <typename T>\n\n inline InputOutputStream &operator>>(T &x) {\n\n read(x);\n\n return *this;\n\n }\n\n\n\n template <typename T>\n\n inline InputOutputStream &operator<<(const T &x) {\n\n print(x);\n\n return *this;\n\n }\n\n\n\n ~InputOutputStream() { flush(); }\n\n} io;\n\n}\n\n\n\nnamespace {\n\n\n\nusing IO::io;\n","file_path":"BZOJ/BZOJ4264-小C找朋友-Hash.cpp","rank":75,"score":38567.996018015816},{"content":"from math import log2\n\nn, l, r = map(int, input().split())\n\na = list(map(int, list(bin(n)[2:])))\n\nans = 0\n\nfor i in range(l, r + 1):\n\n ans += a[int(log2(i & -i))]\n","file_path":"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/B-Code For 1.py","rank":76,"score":37316.93525783213},{"content":"inline void print(char c) {\n\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\n\n *oh++ = c;\n\n}\n\n\n\ntemplate <typename T>\n\ninline void print(T x) {\n\n static int buf[30], cnt;\n\n if (x == 0) {\n\n print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n\n","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":77,"score":33884.844745402865},{"content":"inline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\n\n iosig ? x = -x : 0;\n\n}\n\n\n\ninline void read(char &c) {\n\n while (c = read(), isspace(c) && c != -1)\n\n ;\n\n}\n\n\n\nconst int OUT_LEN = 100000;\n\n\n\nchar obuf[OUT_LEN], *oh = obuf;\n\n\n","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":78,"score":33880.28840925502},{"content":"/**\n\n * Copyright (c) 2017, xehoth\n\n * All rights reserved.\n\n * 「BZOJ 3578」GTY的人类基因组计划2 07-10-2017\n\n * Hash\n\n * @author xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n#include <tr1/unordered_set>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <typename T>\n","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":79,"score":33877.14690435087},{"content":"inline void solve() {\n\n io >> n >> m >> q;\n\n for (register int i = 1; i <= n; i++) num[i] = xorShift128Plus();\n\n s.insert(1);\n\n for (register int i = 1; i <= n; i++) h[1] ^= num[i], size[1]++, pos[i] = 1;\n\n for (register int i = 1, x, y; i <= q; i++) {\n\n register char c;\n\n io >> c >> x >> y;\n\n switch (c) {\n\n case 'C': {\n\n if (pos[x] == y) continue;\n\n s.erase(pos[x]), s.erase(y);\n\n h[pos[x]] ^= num[x], size[pos[x]]--;\n\n if (exist.find(h[pos[x]]) == exist.end()) s.insert(pos[x]);\n\n h[y] ^= num[x], size[y]++;\n\n if (exist.find(h[y]) == exist.end()) s.insert(y);\n\n pos[x] = y;\n\n break;\n\n }\n\n case 'W': {\n","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":80,"score":33856.30848542977},{"content":"\n\ninline ulong xorShift128Plus() {\n\n static ulong seed1 = 495;\n\n static ulong seed2 = 233;\n\n register ulong x = seed1;\n\n register const ulong y = seed2;\n\n seed1 = y, x ^= x << 23;\n\n seed2 = x ^ y ^ (x >> 17) ^ (y >> 26);\n\n return seed2 + y;\n\n}\n\n\n\nusing IO::io;\n\n\n\nstd::set<int> s;\n\nstd::tr1::unordered_set<ulong> exist;\n\nconst int MAXN = 100010;\n\n\n\nulong num[MAXN], size[MAXN], pos[MAXN], h[MAXN];\n\nint n, m, q;\n\n\n","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":81,"score":33850.02791895626},{"content":" register int ans = 0;\n\n for (register std::set<int>::iterator it = s.lower_bound(x);\n\n it != s.end() && *it <= y; it = s.lower_bound(x))\n\n exist.insert(h[*it]), ans += size[*it], s.erase(it);\n\n io << ans << '\\n';\n\n break;\n\n }\n\n }\n\n }\n\n}\n\n}\n\n\n\nint main() {\n\n#ifdef DBG\n\n freopen(\"sample/1.in\", \"r\", stdin);\n\n#endif\n\n solve();\n\n return 0;\n\n}","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":82,"score":33845.82159125843},{"content":"struct MulInv<mod, 0, inv> {\n\n static const uint INV = inv;\n\n};\n\n\n\ntemplate <uint mod>\n","file_path":"BZOJ/BZOJ4517-排列计数-组合数学+取模优化.cpp","rank":83,"score":33394.67431568321},{"content":"struct MulInv<mod, 0, inv> {\n\n static const uint INV = inv;\n\n};\n\n\n\ntemplate <uint mod>\n","file_path":"SuperOJ/p2103-呼吸决定-扩展埃筛+自然数幂和+取模优化.cpp","rank":84,"score":33394.67431568321},{"content":"struct Node *pos[MAXN + 1];\n","file_path":"BZOJ/BZOJ3600-没有人的算术-线段树 + 替罪羊树 + 动态标号.cpp","rank":85,"score":33377.9904410897},{"content":"struct InputOutputStream {\n\n ~InputOutputStream() { flush(); }\n\n\n\n template <typename T>\n\n inline InputOutputStream &operator<<(const T &x) {\n\n print(x);\n\n return *this;\n\n }\n\n\n\n template <typename T>\n\n inline InputOutputStream &operator>>(T &x) {\n\n read(x);\n\n return *this;\n\n }\n\n} io;\n\n}\n\n\n\nnamespace {\n\n\n\ntypedef unsigned long long ulong;\n","file_path":"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp","rank":86,"score":30950.180198459668},{"content":"k, q = map(int, input().split())\n\ndp = [[0.0 for i in range(k + 1)] for j in range(10000)]\n\ndp[0][0] = 1.0\n\nfor i in range(1, 10000):\n\n for j in range(1, k + 1):\n\n dp[i][j] = dp[i - 1][j] * j / k + dp[i - 1][j - 1] * (k - j + 1) / k\n\nfor t in range(q):\n\n p = int(input())\n\n for i in range(10000):\n\n if p <= dp[i][k] * 2000:\n\n print(i)\n","file_path":"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/D-Jon and Orbs.py","rank":87,"score":28891.164188639457},{"content":"from math import sqrt\n\nk = 0\n\nfor t in range(int(input())): k ^= int(int(sqrt(8 * int(input()) + 1) - 1) / 2)\n","file_path":"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/E-Game of Stones.py","rank":88,"score":28891.164188639457},{"content":"n = int(input())\n\ni = list(map(int, input().split()))\n","file_path":"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/A-Oath of the Night's Watch.py","rank":89,"score":27083.75681566728},{"content":"#include <cmath>\n\n#include <cstddef>\n\n#include <cstdio>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <map>\n\n#include <vector>\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1 << 18 | 1;\n\n static char buf[IN_LEN], *s, *t;\n\n return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)),\n\n s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <typename T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n","file_path":"BZOJ/BZOJ2402-陶陶的难题II.cpp","rank":90,"score":71.87701857953616},{"content":" for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n}\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 1010;\n\n\n\nbool isPalindrome[MAXN][MAXN];\n\nchar s[MAXN];\n\n\n\ninline void solve() {\n\n using namespace IO;\n\n register int t;\n\n for (read(t); t--;) {\n\n register int n = read(s);\n","file_path":"UVA/UVA11584-PartitioningbyPalindromes-dp.cpp","rank":91,"score":71.0758960789894},{"content":"#include <cstdio>\n\n#include <cctype>\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <class T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n\n iosig ? x = -x : 0;\n","file_path":"BZOJ/BZOJ2733_new_seg.cpp","rank":92,"score":70.02926876647689},{"content":"namespace {\n\n\n\n inline char read() {\n\n static const int IN_LEN = 1 << 18 | 1;\n\n static char buf[IN_LEN], *s, *t;\n\n return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)), s == t ? -1 : *s++;\n\n }\n\n\n\n const int OUT_LEN = 1 << 18 | 1;\n\n\n\n char obuf[OUT_LEN], *oh = obuf;\n\n\n\n inline void print(char c) {\n\n (oh == obuf + OUT_LEN) && (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf);\n\n *oh++ = c;\n\n }\n\n\n\n template <typename T>\n\n inline void print(T x) {\n\n static int buf[21], cnt;\n","file_path":"loj/LOJ6029-市场-线段树.cpp","rank":93,"score":69.30127679886067},{"content":" print('0');\n\n } else {\n\n x < 0 ? (print('-'), x = -x) : 0;\n\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n}\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 2000;\n\n\n\ninline void solve() {\n\n using namespace IO;\n\n register int n;\n\n read(n);\n\n static struct Array {\n","file_path":"BZOJ/BZOJ4247-挂饰-dp.cpp","rank":94,"score":68.89449207159889},{"content":" for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\n\n while (cnt) print((char)buf[cnt--]);\n\n }\n\n}\n\n\n\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\n\n}\n\n\n\nnamespace Task {\n\n\n\nconst int MAXN = 50;\n\nconst int MAXM = 50;\n\nconst int MAXT = 2500;\n\n\n\ninline void solve() {\n\n using namespace IO;\n\n register int n, m, t;\n\n read(n), read(m), read(t);\n\n static int w[MAXN][MAXM + 1], f[MAXM + 1][MAXM + 1];\n\n for (register int i = 0; i < n; i++) {\n","file_path":"省选/2009/SCOI/粉刷匠-dp.cpp","rank":95,"score":68.8555102420587},{"content":"#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <class T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n","file_path":"BZOJ/BZOJ4814.cpp","rank":96,"score":67.94459986429021},{"content":"#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <class T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n\n c == '-' ? iosig = true : 0;\n\n }\n\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\n","file_path":"BZOJ/BZOJ3653.cpp","rank":97,"score":67.94459986429021},{"content":"/*\n\n * created by xehoth\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <class T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n","file_path":"BZOJ/BZOJ2929.cpp","rank":98,"score":67.87040326658993},{"content":"/*\n\n * created by xehoth 04-05-2017\n\n */\n\n#include <bits/stdc++.h>\n\n\n\nnamespace IO {\n\n\n\ninline char read() {\n\n static const int IN_LEN = 1000000;\n\n static char buf[IN_LEN], *s, *t;\n\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\n\n return s == t ? -1 : *s++;\n\n}\n\n\n\ntemplate <class T>\n\ninline void read(T &x) {\n\n static char c;\n\n static bool iosig;\n\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\n\n if (c == -1) return;\n","file_path":"BZOJ/BZOJ4887.cpp","rank":99,"score":67.87040326658993}],"string":"[\n {\n \"content\": \"struct PriorityQueue : public std::map<int, int, std::greater<int> > {\\n\\n typedef std::map<int, int, std::greater<int> > super;\\n\\n\\n\\n inline void push(int x) { super::operator[](x)++; }\\n\\n\\n\\n inline void erase(int x) {\\n\\n super::iterator it = super::find(x);\\n\\n if (it != super::end() && --it->second == 0) super::erase(it);\\n\\n }\\n\\n\\n\\n inline int top() { return super::empty() ? 0 : super::begin()->first; }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ4382-Podział naszyjnika-线段树+map.cpp\",\n \"rank\": 0,\n \"score\": 99142.46373898798\n },\n {\n \"content\": \"struct buf {\\n\\n char z[1 << 25], *s;\\n\\n buf() : s(z) { fread(z, 1, sizeof z, stdin); }\\n\\n inline void pre(char *v) {\\n\\n while (*s < 48) ++s;\\n\\n while (*s > 32) *v++ = *s++;\\n\\n *v = 0;\\n\\n }\\n\\n operator int() {\\n\\n int x = 0, y = 0;\\n\\n while (*s < 48) y = *s++;\\n\\n while (*s > 32) x = x * 10 + *s++ - 48;\\n\\n if (y == 45) return -x;\\n\\n return x;\\n\\n }\\n\\n} it;\\n\\nint main() {\\n\\n static char s[N];\\n\\n static arr1 a, t;\\n\\n register int n = it;\\n\",\n \"file_path\": \"BZOJ/BZOJ4199.cpp\",\n \"rank\": 1,\n \"score\": 94759.63732507822\n },\n {\n \"content\": \"n, k, x = map(int, input().split())\\n\\nrangers = list(map(int, input().split()))\\n\\nfor i in range(min(k, 8 + (k & 3))):\\n\\n rangers.sort()\\n\\n rangers = [rangers[i] if (i & 1) else rangers[i] ^ x for i in range(n)]\\n\\n print(rangers)\\n\\nrangers.sort()\\n\",\n \"file_path\": \"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/C-Jon Snow and his Favourite Number.py\",\n \"rank\": 2,\n \"score\": 69464.61375650797\n },\n {\n \"content\": \"class MonotoneQueue : public std::deque<std::pair<T, int> > {\\n\\n public:\\n\\n typedef std::pair<T, int> Pair;\\n\\n typedef std::deque<Pair> super;\\n\\n\\n\\n MonotoneQueue(Comparator cmp = Comparator()) : cmp(cmp), pos(0), cur(0) {}\\n\\n\\n\\n inline void push(const T &v) {\\n\\n while (!super::empty() && cmp(super::front().first, v))\\n\\n super::pop_front();\\n\\n super::push_front(Pair(v, cur++));\\n\\n }\\n\\n\\n\\n inline void pop() {\\n\\n if (super::back().second == pos++) super::pop_back();\\n\\n }\\n\\n\\n\\n inline const T &top() { return super::back().first; }\\n\\n\\n\\n inline void clear() { super::clear(), pos = cur = 0; }\\n\",\n \"file_path\": \"CodeVS/CodeVS3269-混合背包-dp+单调队列.cpp\",\n \"rank\": 3,\n \"score\": 59352.197070466624\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「BZOJ 3453」XLkxc 18-09-2017\\n\\n * 拉格朗日插值\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void read(T &x) {\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 4,\n \"score\": 49060.9242236257\n },\n {\n \"content\": \"template <typename T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void print(const char *s) {\\n\\n for (; *s; s++) print(*s);\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 5,\n \"score\": 49057.18330959311\n },\n {\n \"content\": \" static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\\n}\\n\\n\\n\\ninline void read(char &c) {\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\\n}\\n\\n\\n\\ninline int read(char *buf) {\\n\\n register int s = 0;\\n\\n register char c;\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 6,\n \"score\": 49054.92138489802\n },\n {\n \"content\": \" if (c == -1) {\\n\\n *buf = 0;\\n\\n return -1;\\n\\n }\\n\\n do\\n\\n buf[s++] = c;\\n\\n while (c = read(), !isspace(c) && c != -1);\\n\\n buf[s] = 0;\\n\\n return s;\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 1000000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\ninline void print(char c) {\\n\\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\\n *oh++ = c;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 7,\n \"score\": 49048.48210689305\n },\n {\n \"content\": \" register uint ret = 0, tmp;\\n\\n for (register int i = 1; i <= n + 1; i++) {\\n\\n tmp = (ulong)f[i] * pre[i - 1] % MOD * suf[i + 1] % MOD *\\n\\n inv[i - 1] % MOD * inv[n + 1 - i] % MOD;\\n\\n if ((n + 1 - i) % 2) tmp = MOD - tmp;\\n\\n ret = (ret + tmp) % MOD;\\n\\n }\\n\\n return ret;\\n\\n }\\n\\n\\n\\n inline void solve() {\\n\\n register int T;\\n\\n io >> T;\\n\\n init(MAXN + 5);\\n\\n static uint g[MAXN + 10], f[MAXN + 10];\\n\\n while (T--) {\\n\\n io >> k >> a >> n >> d;\\n\\n for (register int i = 0; i <= k + 3; i++) g[i] = modPow(i, k);\\n\\n for (register int i = 1; i <= k + 3; i++)\\n\\n g[i] = (g[i] + g[i - 1]) % MOD;\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 8,\n \"score\": 49028.06370505897\n },\n {\n \"content\": \" for (register int i = 1; i <= k + 3; i++)\\n\\n g[i] = (g[i] + g[i - 1]) % MOD;\\n\\n f[0] = interpolation(g, a, k + 2);\\n\\n for (register int i = 1; i <= k + 5; i++)\\n\\n f[i] = (f[i - 1] +\\n\\n interpolation(g, (a + (ulong)d * i) % MOD, k + 2)) %\\n\\n MOD;\\n\\n io << interpolation(f, n, k + 4) << '\\\\n';\\n\\n }\\n\\n }\\n\\n} task;\\n\\n}\\n\\n\\n\\nint main() {\\n\\n task.solve();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 9,\n \"score\": 49017.12987719444\n },\n {\n \"content\": \"typedef unsigned int uint;\\n\\n\\n\\nconst uint MOD = 1234567891;\\n\\nconst int MAXN = 123;\\n\\n\\n\\ntypedef unsigned long long ulong;\\n\\n\\n\\ninline int modPow(int a, int b) {\\n\\n register int ret = 1;\\n\\n for (; b; b >>= 1, a = (ulong)a * a % MOD)\\n\\n (b & 1) ? ret = (ulong)ret * a % MOD : 0;\\n\\n return ret;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 10,\n \"score\": 49014.69136726026\n },\n {\n \"content\": \"def c(n, m):\\n\\n if (n < m):\\n\\n return 0\\n\",\n \"file_path\": \"BZOJ/BZOJ2729.py\",\n \"rank\": 11,\n \"score\": 48286.83665702732\n },\n {\n \"content\": \"\\n\\ntemplate<class T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read())\\n\\n x = (x + (x << 2) << 1) + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 1000000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\ninline void print(char c) {\\n\\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\",\n \"file_path\": \"atcoder/AtCoder Beginner Contest 061/C.cpp\",\n \"rank\": 12,\n \"score\": 46911.30402238217\n },\n {\n \"content\": \" *oh++ = c;\\n\\n}\\n\\n\\n\\ntemplate<class T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void flush() {\\n\\n fwrite(obuf, 1, oh - obuf, stdout);\\n\\n}\\n\\n}\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 100005;\\n\\n\\n\",\n \"file_path\": \"atcoder/AtCoder Beginner Contest 061/C.cpp\",\n \"rank\": 13,\n \"score\": 46910.304842856174\n },\n {\n \"content\": \"struct Task {\\n\\n uint inv[MAXN + 10];\\n\\n int k, a, n, d;\\n\\n\\n\\n inline void init(const int n) {\\n\\n inv[0] = inv[1] = 1;\\n\\n for (register int i = 2; i <= n; i++)\\n\\n inv[i] = (ulong)i * inv[i - 1] % MOD;\\n\\n inv[n] = modPow(inv[n], MOD - 2);\\n\\n for (register int i = n - 1; i >= 0; i--)\\n\\n inv[i] = inv[i + 1] * (i + 1ll) % MOD;\\n\\n }\\n\\n\\n\\n inline uint interpolation(uint *f, uint u, int n) {\\n\\n static uint pre[MAXN + 10], suf[MAXN + 10];\\n\\n pre[0] = suf[n + 2] = 1;\\n\\n for (register int i = 1; i <= n + 1; i++)\\n\\n pre[i] = (ulong)pre[i - 1] * (u - i + MOD) % MOD;\\n\\n for (register int i = n + 1; i; i--)\\n\\n suf[i] = (ulong)suf[i + 1] * (u - i + MOD) % MOD;\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 14,\n \"score\": 46896.38549692933\n },\n {\n \"content\": \" * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\\n\\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\\n\\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\\n\\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n ******************************************************************************/\\n\\n#include <bits/stdc++.h>\\n\\n/**\\n\\n * 「AtCoder Beginner Contest 061」Big Array 13-05-2017\\n\\n * @author xehoth \\n\\n */\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\",\n \"file_path\": \"atcoder/AtCoder Beginner Contest 061/C.cpp\",\n \"rank\": 15,\n \"score\": 46887.48794200966\n },\n {\n \"content\": \"\\n\\nint main() {\\n\\n // freopen(\\\"in.in\\\", \\\"r\\\", stdin);\\n\\n ios::sync_with_stdio(false);\\n\\n cin.tie(NULL);\\n\\n cin >> n;\\n\\n for (register int i = 1; i <= n; i++) {\\n\\n cin >> (s + 1);\\n\\n l = strlen(s + 1);\\n\\n solve(0, 0);\\n\\n ss[++len] = 'a' + 26;\\n\\n for (register int j = 1; j <= l; j++) ss[++len] = s[j];\\n\\n }\\n\\n ac_bfs();\\n\\n int pos = 0, now = 0;\\n\\n for (; pos < len; pos++) tag[now = f[now][ss[pos + 1] - 'a']]++;\\n\\n for (register int i = tail; i; i--) {\\n\\n tag[fail[line[i]]] += tag[line[i]];\\n\\n for (int k = first[line[i]]; k; k = next[k]) ans[k] = tag[line[i]];\\n\\n }\\n\\n for (register int i = 1; i <= n; i++) cout << ans[i] << \\\"\\\\n\\\";\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"省选/2013/TJOI/单词-AC自动机.cpp\",\n \"rank\": 16,\n \"score\": 46867.26762317405\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2016, xehoth\\n\\n * All rights reserved.\\n\\n * 「TJOI 2013」单词 26-07-2016\\n\\n * AC 自动机\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n#define MAX_N 1050050\\n\\nusing namespace std;\\n\\nint n, len, l, tot, head = 0, tail = 1;\\n\\nchar ss[MAX_N], s[MAX_N];\\n\\nint first[MAX_N], next[MAX_N], ans[MAX_N], fail[MAX_N], f[MAX_N][27];\\n\\nint st, tag[MAX_N], line[MAX_N];\\n\\n\\n\\nvoid solve(int v, int x) {\\n\\n if (x == l) {\\n\\n next[++st] = first[v];\\n\\n first[v] = st;\\n\\n return;\\n\",\n \"file_path\": \"省选/2013/TJOI/单词-AC自动机.cpp\",\n \"rank\": 17,\n \"score\": 46867.164473284094\n },\n {\n \"content\": \" return;\\n\\n }\\n\\n k -= q[i].b;\\n\\n }\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n#ifdef DBG\\n\\n freopen(\\\"in.in\\\", \\\"r\\\", stdin);\\n\\n#endif\\n\\n Task::solve();\\n\\n IO::flush();\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"atcoder/AtCoder Beginner Contest 061/C.cpp\",\n \"rank\": 18,\n \"score\": 46864.06409351797\n },\n {\n \"content\": \" }\\n\\n if (!f[v][s[x + 1] - 'a']) f[v][s[x + 1] - 'a'] = ++tot;\\n\\n solve(f[v][s[x + 1] - 'a'], x + 1);\\n\\n}\\n\\n\\n\\nvoid ac_bfs() {\\n\\n line[1] = 0;\\n\\n while (head ^ tail) {\\n\\n head++;\\n\\n if (line[head])\\n\\n for (int j = 0; j < 26; j++)\\n\\n if (f[line[head]][j])\\n\\n fail[f[line[head]][j]] = f[fail[line[head]]][j];\\n\\n for (int j = 0; j < 26; j++)\\n\\n if (!f[line[head]][j])\\n\\n f[line[head]][j] = f[fail[line[head]]][j];\\n\\n else\\n\\n line[++tail] = f[line[head]][j];\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"省选/2013/TJOI/单词-AC自动机.cpp\",\n \"rank\": 19,\n \"score\": 46857.17617634322\n },\n {\n \"content\": \"/*******************************************************************************\\n\\n * Copyright (c) 2016-2017, xehoth\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above copyright\\n\\n * notice, this list of conditions and the following disclaimer in the\\n\\n * documentation and/or other materials provided with the distribution.\\n\\n * * Neither the name xehoth, nor the names of its contributors may be used\\n\\n * to endorse or promote products derived from this software without \\n\\n * specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY XEHOTH AND CONTRIBUTORS \\\"AS IS\\\" AND ANY\\n\\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\\n\\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL XEHOTH AND CONTRIBUTORS BE LIABLE FOR ANY\\n\",\n \"file_path\": \"atcoder/AtCoder Beginner Contest 061/C.cpp\",\n \"rank\": 20,\n \"score\": 46851.56233734379\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「ARC 071C」怪文書 20-08-2017\\n\\n * dp\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\ninline void solve() {\\n\\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\\n\\n register int n;\\n\\n std::cin >> n;\\n\\n std::streambuf *ob = std::cout.rdbuf(), *ib = std::cin.rdbuf();\\n\\n static int buc[26], f[26];\\n\\n memset(f, 127, sizeof(f));\\n\\n register char c;\\n\\n for (register int i = 0; i < n; i++) {\\n\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 071/C-怪文書-dp.cpp\",\n \"rank\": 21,\n \"score\": 44957.653535553814\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「ARC 080C」4-adjacent 24-08-2017\\n\\n *\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 200000;\\n\\nint a[MAXN + 1];\\n\\n\\n\\ninline void solve() {\\n\\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\\n\\n register int n;\\n\\n std::cin >> n;\\n\\n for (register int i = 1; i <= n; i++) std::cin >> a[i];\\n\\n register int cnt4 = 0, cnt2 = 0, cnt = 0;\\n\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 080/C-4-adjacent.cpp\",\n \"rank\": 22,\n \"score\": 44956.8414167616\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「ARC 085C」HSI 06-12-2017\\n\\n *\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nint main() {\\n\\n register int n, m;\\n\\n std::cin >> n >> m;\\n\\n std::cout << (1900 * m + 100 * (n - m)) * (1 << m);\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 085/C-HSI.cpp\",\n \"rank\": 23,\n \"score\": 44939.50917053249\n },\n {\n \"content\": \"\\n\\nint main() {\\n\\n // freopen(\\\"in.in\\\", \\\"r\\\", stdin);\\n\\n ios::sync_with_stdio(false);\\n\\n cin.tie(NULL);\\n\\n cin >> n;\\n\\n for (register int i = 1; i <= n; i++) {\\n\\n cin >> (s + 1);\\n\\n l = strlen(s + 1);\\n\\n solve(0, 0);\\n\\n ss[++len] = 'a' + 26;\\n\\n for (register int j = 1; j <= l; j++) ss[++len] = s[j];\\n\\n }\\n\\n ac_bfs();\\n\\n int pos = 0, now = 0;\\n\\n for (; pos < len; pos++) tag[now = f[now][ss[pos + 1] - 'a']]++;\\n\\n for (register int i = tail; i; i--) {\\n\\n tag[fail[line[i]]] += tag[line[i]];\\n\\n for (int k = first[line[i]]; k; k = next[k]) ans[k] = tag[line[i]];\\n\\n }\\n\\n for (register int i = 1; i <= n; i++) cout << ans[i] << \\\"\\\\n\\\";\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"BZOJ/BZOJ3172-单词-AC自动机.cpp\",\n \"rank\": 24,\n \"score\": 44938.41989627859\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2016, xehoth\\n\\n * All rights reserved.\\n\\n * 「TJOI 2013」单词 26-07-2016\\n\\n * AC 自动机\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n#define MAX_N 1050050\\n\\nusing namespace std;\\n\\nint n, len, l, tot, head = 0, tail = 1;\\n\\nchar ss[MAX_N], s[MAX_N];\\n\\nint first[MAX_N], next[MAX_N], ans[MAX_N], fail[MAX_N], f[MAX_N][27];\\n\\nint st, tag[MAX_N], line[MAX_N];\\n\\n\\n\\nvoid solve(int v, int x) {\\n\\n if (x == l) {\\n\\n next[++st] = first[v];\\n\\n first[v] = st;\\n\\n return;\\n\",\n \"file_path\": \"BZOJ/BZOJ3172-单词-AC自动机.cpp\",\n \"rank\": 25,\n \"score\": 44938.316746388635\n },\n {\n \"content\": \" for (register int i = 1; i <= n; i++) {\\n\\n if (a[i] % 4 == 0) {\\n\\n cnt4++;\\n\\n } else if (a[i] % 2 == 0) {\\n\\n cnt2++;\\n\\n } else {\\n\\n cnt++;\\n\\n }\\n\\n }\\n\\n if (cnt2 == 0 && cnt <= cnt4 + 1) {\\n\\n std::cout << \\\"Yes\\\";\\n\\n } else if (cnt <= cnt4) {\\n\\n std::cout << \\\"Yes\\\";\\n\\n } else {\\n\\n std::cout << \\\"No\\\";\\n\\n }\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n Task::solve();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 080/C-4-adjacent.cpp\",\n \"rank\": 26,\n \"score\": 44935.969171642966\n },\n {\n \"content\": \" memset(buc, 0, sizeof(buc));\\n\\n while (c = ib->sbumpc(), !isalpha(c))\\n\\n ;\\n\\n while (isalpha(c)) buc[c - 'a']++, c = ib->sbumpc();\\n\\n for (register int i = 0; i < 26; i++) f[i] = std::min(f[i], buc[i]);\\n\\n }\\n\\n for (register int i = 0; i < 26; i++)\\n\\n for (; f[i]--;) ob->sputc('a' + i);\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n Task::solve();\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 071/C-怪文書-dp.cpp\",\n \"rank\": 27,\n \"score\": 44930.803211457336\n },\n {\n \"content\": \" }\\n\\n if (!f[v][s[x + 1] - 'a']) f[v][s[x + 1] - 'a'] = ++tot;\\n\\n solve(f[v][s[x + 1] - 'a'], x + 1);\\n\\n}\\n\\n\\n\\nvoid ac_bfs() {\\n\\n line[1] = 0;\\n\\n while (head ^ tail) {\\n\\n head++;\\n\\n if (line[head])\\n\\n for (int j = 0; j < 26; j++)\\n\\n if (f[line[head]][j])\\n\\n fail[f[line[head]][j]] = f[fail[line[head]]][j];\\n\\n for (int j = 0; j < 26; j++)\\n\\n if (!f[line[head]][j])\\n\\n f[line[head]][j] = f[fail[line[head]]][j];\\n\\n else\\n\\n line[++tail] = f[line[head]][j];\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"BZOJ/BZOJ3172-单词-AC自动机.cpp\",\n \"rank\": 28,\n \"score\": 44928.32844944776\n },\n {\n \"content\": \"class CPlusPlusInterpreter {\\n\\n public:\\n\\n CPlusPlusInterpreter() {\\n\\n init();\\n\\n funcAndVar();\\n\\n runFunction(func[\\\"main\\\"].first, std::vector<int>());\\n\\n }\\n\\n\\n\\n private:\\n\\n std::vector<std::string> code;\\n\\n\\n\\n inline void init() {\\n\\n std::ios::sync_with_stdio(false);\\n\\n std::cin.tie(NULL);\\n\\n std::cout.tie(NULL);\\n\\n InputNumber::init();\\n\\n std::string str, src;\\n\\n for (register int i = 0; i < 5; i++) std::cin >> str;\\n\\n while (std::cin >> str) src += str + '\\\\n';\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ4020.cpp\",\n \"rank\": 29,\n \"score\": 44919.68230560329\n },\n {\n \"content\": \"struct Query {\\n\\n int a, b;\\n\\n\\n\\n inline bool operator<(const Query &n) const {\\n\\n return a < n.a || (a == n.a && b < n.b);\\n\\n }\\n\\n} q[MAXN];\\n\\n\\n\\ninline void solve() {\\n\\n using namespace IO;\\n\\n register int n;\\n\\n register long long k;\\n\\n read(n), read(k);\\n\\n for (register int i = 0; i < n; i++) {\\n\\n read(q[i].a), read(q[i].b);\\n\\n }\\n\\n std::sort(q, q + n);\\n\\n for (register int i = 0; i < n; i++) {\\n\\n if (k <= q[i].b) {\\n\\n print(q[i].a), print('\\\\n');\\n\",\n \"file_path\": \"atcoder/AtCoder Beginner Contest 061/C.cpp\",\n \"rank\": 30,\n \"score\": 44919.68230560329\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「BZOJ 4264」小C找朋友 16-10-2017\\n\\n * Hash\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline bool read(T &x) {\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 31,\n \"score\": 43202.75764774292\n },\n {\n \"content\": \"\\n\\ntemplate <typename T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void print(const char *s) {\\n\\n for (; *s; s++) print(*s);\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 32,\n \"score\": 43200.10463597317\n },\n {\n \"content\": \"\\n\\ntemplate <typename T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void print(const char *s) {\\n\\n for (; *s; s++) print(*s);\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 33,\n \"score\": 43200.10463597317\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「SuperOJ 1985」字符串 15-09-2017\\n\\n * AC 自动机\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline bool read(T &x) {\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 34,\n \"score\": 43199.79021602961\n },\n {\n \"content\": \" static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return false;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\\n return true;\\n\\n}\\n\\n\\n\\ninline void read(char &c) {\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\\n}\\n\\n\\n\\ninline int read(char *buf) {\\n\\n register int s = 0;\\n\\n register char c;\\n\\n while (c = read(), isspace(c) && c != -1)\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 35,\n \"score\": 43197.20495503703\n },\n {\n \"content\": \" static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return false;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\\n return true;\\n\\n}\\n\\n\\n\\ninline void read(char &c) {\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\\n}\\n\\n\\n\\ninline int read(char *buf) {\\n\\n register int s = 0;\\n\\n register char c;\\n\\n while (c = read(), isspace(c) && c != -1)\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 36,\n \"score\": 43197.20495503703\n },\n {\n \"content\": \" ;\\n\\n if (c == -1) {\\n\\n *buf = 0;\\n\\n return -1;\\n\\n }\\n\\n do\\n\\n buf[s++] = c;\\n\\n while (c = read(), !isspace(c) && c != -1);\\n\\n buf[s] = 0;\\n\\n return s;\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 1000000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\ninline void print(char c) {\\n\\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\\n *oh++ = c;\\n\\n}\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 37,\n \"score\": 43191.40343327311\n },\n {\n \"content\": \" ;\\n\\n if (c == -1) {\\n\\n *buf = 0;\\n\\n return -1;\\n\\n }\\n\\n do\\n\\n buf[s++] = c;\\n\\n while (c = read(), !isspace(c) && c != -1);\\n\\n buf[s] = 0;\\n\\n return s;\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 1000000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\ninline void print(char c) {\\n\\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\\n *oh++ = c;\\n\\n}\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 38,\n \"score\": 43191.40343327311\n },\n {\n \"content\": \"struct InputOutputStream {\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator>>(T &x) {\\n\\n read(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator<<(const T &x) {\\n\\n print(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n ~InputOutputStream() { flush(); }\\n\\n} io;\\n\\n}\\n\\n\\n\\nnamespace {\\n\\n\\n\\nusing IO::io;\\n\",\n \"file_path\": \"BZOJ/BZOJ3453-XLkxc-拉格朗日插值.cpp\",\n \"rank\": 39,\n \"score\": 43187.45358133679\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「ARC 081C」Make a Rectangle 21-08-2017\\n\\n * 贪心\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\n#define long long long\\n\\n\\n\\nstd::map<int, int> map;\\n\\n\\n\\ninline void solve() {\\n\\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\\n\\n register int n, cnt = 2;\\n\\n register long ans = 1;\\n\\n std::cin >> n;\\n\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 081/C-Make a Rectangle-贪心.cpp\",\n \"rank\": 40,\n \"score\": 43179.23429021368\n },\n {\n \"content\": \"inline void insert(const char *s) {\\n\\n register Node *p = root;\\n\\n for (register int idx = 0; *s; s++) {\\n\\n if (p->c[idx = *s - 'a'] == null) p->c[idx] = new Node();\\n\\n p = p->c[idx];\\n\\n }\\n\\n p->cnt++;\\n\\n}\\n\\n\\n\\ninline void init() {\\n\\n null->fail = null, root = new Node();\\n\\n for (register int i = 0; i < MAX_SIGMA; i++) null->c[i] = root;\\n\\n null->cnt = 0;\\n\\n}\\n\\n\\n\\ninline void build() {\\n\\n static std::queue<Node *> q;\\n\\n q.push(root);\\n\\n for (Node *p, *u; !q.empty();) {\\n\\n p = q.front(), q.pop();\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 41,\n \"score\": 43177.05718239754\n },\n {\n \"content\": \"\\n\\ninline void solve() {\\n\\n init();\\n\\n register int n, q, maxLen = 0;\\n\\n io >> n >> q;\\n\\n for (register int i = 1; i <= n; i++)\\n\\n maxLen = std::max(maxLen, IO::read(s)), insert(s);\\n\\n build();\\n\\n register int len = IO::read(s + 1);\\n\\n register char c;\\n\\n register int ans = query(s + 1, len);\\n\\n io << ans << '\\\\n';\\n\\n for (register int pos; q--;) {\\n\\n io >> pos >> c;\\n\\n ans -=\\n\\n query(s + std::max(pos - maxLen, 1),\\n\\n std::min(len, pos + maxLen) - std::max(pos - maxLen, 1) + 1);\\n\\n s[pos] = c;\\n\\n ans +=\\n\\n query(s + std::max(pos - maxLen, 1),\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 42,\n \"score\": 43175.059690846625\n },\n {\n \"content\": \" for (register int i = 0; i < MAX_SIGMA; i++) {\\n\\n if (p->c[i] != null) {\\n\\n for (u = p->fail; u->c[i] == null;) u = u->fail;\\n\\n p->c[i]->fail = u->c[i], q.push(p->c[i]);\\n\\n p->c[i]->cnt += u->c[i]->cnt;\\n\\n } else {\\n\\n p->c[i] = p->fail->c[i];\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\ninline int query(const char *s, register int len) {\\n\\n register int ret = 0;\\n\\n register Node *p = root;\\n\\n for (register int i = 0; i < len; i++) p = p->c[s[i] - 'a'], ret += p->cnt;\\n\\n return ret;\\n\\n}\\n\\n\\n\\nchar s[MAXN + 1];\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 43,\n \"score\": 43171.43953096296\n },\n {\n \"content\": \"\\n\\ntypedef unsigned long long ulong;\\n\\n\\n\\ninline ulong xorShift128Plus() {\\n\\n static ulong seed1 = 495;\\n\\n static ulong seed2 = 233;\\n\\n register ulong x = seed1;\\n\\n register const ulong y = seed2;\\n\\n seed1 = y, x ^= x << 23;\\n\\n seed2 = x ^ y ^ (x >> 17) ^ (y >> 26);\\n\\n return seed2 + y;\\n\\n}\\n\\n\\n\\nconst int MAXN = 1000000;\\n\\nulong hash[MAXN + 1], val[MAXN + 1], ans, cnt;\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 44,\n \"score\": 43166.08004296032\n },\n {\n \"content\": \" for (register int i = 1; i <= m; i++) {\\n\\n if (edge[i].u != edge[i].v) {\\n\\n hash[edge[i].u] ^= val[edge[i].v];\\n\\n hash[edge[i].v] ^= val[edge[i].u];\\n\\n }\\n\\n }\\n\\n for (register int i = 1; i <= m; i++) {\\n\\n if (edge[i].u != edge[i].v && ((hash[edge[i].u] ^ val[edge[i].v]) ==\\n\\n (hash[edge[i].v] ^ val[edge[i].u])))\\n\\n ans++;\\n\\n }\\n\\n std::sort(hash + 1, hash + n + 1);\\n\\n for (register int i = 1; i <= n; i++) {\\n\\n cnt++;\\n\\n if (i == n || hash[i] != hash[i + 1])\\n\\n ans += cnt * (cnt - 1) >> 1, cnt = 0;\\n\\n }\\n\\n io << ans << '\\\\n';\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n solve();\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 45,\n \"score\": 43164.87668491422\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「ARC 070C」Go Home 18-08-2017\\n\\n * 结论题\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nint main() {\\n\\n register int n = 1, x;\\n\\n std::cin >> x;\\n\\n while (n * (n + 1) / 2 < x) n++;\\n\\n std::cout << n;\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 070/C-GoHome-结论.cpp\",\n \"rank\": 46,\n \"score\": 43163.015017052334\n },\n {\n \"content\": \" std::min(len, pos + maxLen) - std::max(pos - maxLen, 1) + 1);\\n\\n io << ans << '\\\\n';\\n\\n }\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n // freopen(\\\"blocks.in\\\", \\\"r\\\", stdin);\\n\\n // freopen(\\\"blocks.out\\\", \\\"w\\\", stdout);\\n\\n solve();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 47,\n \"score\": 43161.81053248975\n },\n {\n \"content\": \" for (register int i = 0, t; i < n; i++) std::cin >> t, map[t]++;\\n\\n for (auto it = map.rbegin(); it != map.rend(); it++) {\\n\\n if (it->second > 1) {\\n\\n ans *= it->first, cnt--;\\n\\n if (it->second > 3 && cnt == 1) ans *= it->first, cnt--;\\n\\n }\\n\\n if (cnt == 0) break;\\n\\n }\\n\\n if (cnt == 0)\\n\\n std::cout << ans;\\n\\n else\\n\\n std::cout << '0';\\n\\n}\\n\\n\\n\\n#undef long\\n\\n}\\n\\n\\n\\nint main() {\\n\\n Task::solve();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 081/C-Make a Rectangle-贪心.cpp\",\n \"rank\": 48,\n \"score\": 43159.14141731502\n },\n {\n \"content\": \"#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 49,\n \"score\": 41569.732126468756\n },\n {\n \"content\": \"inline void read(T1 &a, T2 &b, T3 &c, T4 &d, T5 &e) {\\n\\n read(a), read(b), read(c), read(d), read(e);\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 1000000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\ninline void print(char c) {\\n\\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\\n *oh++ = c;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 50,\n \"score\": 41561.57939287101\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\\n}\\n\\n\\n\\ninline int read(char *buf) {\\n\\n register int s = 0;\\n\\n register char c;\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\\n if (c == -1) {\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 51,\n \"score\": 41560.188116102676\n },\n {\n \"content\": \" oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\\n *oh++ = c;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void print(const char *s) {\\n\\n for (; *s; s++) print(*s);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 52,\n \"score\": 41559.7109399017\n },\n {\n \"content\": \"template <typename T1, typename T2, typename T3, typename T4, typename T5>\\n\\ninline void println(T1 a, T2 b, T3 c, T4 d, T5 e) {\\n\\n print(a), print(b), print(c), print(d), print(e), print('\\\\n');\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n}\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 5005;\\n\\n\\n\\ntypedef std::pair<int, int> Pair;\\n\\n\\n\\ninline void solve() {\\n\\n using namespace IO;\\n\\n register int n;\\n\\n read(n);\\n\\n static int l[MAXN], r[MAXN], a[MAXN];\\n\\n memset(l, 127, sizeof(int) * (MAXN + 1));\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 53,\n \"score\": 41551.38850288457\n },\n {\n \"content\": \" iosig ? x = -x : 0;\\n\\n}\\n\\n\\n\\ninline int read(char *buf) {\\n\\n register int s = 0;\\n\\n register char c;\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\\n if (c == -1) {\\n\\n *buf = '\\\\0';\\n\\n return -1;\\n\\n }\\n\\n do\\n\\n buf[s++] = c;\\n\\n while (c = read(), !isspace(c) && c != -1);\\n\\n buf[s] = '\\\\0';\\n\\n return s;\\n\\n}\\n\\n\\n\\ninline void read(double &x) {\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 54,\n \"score\": 41548.1522809269\n },\n {\n \"content\": \" * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\\n\\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\\n\\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\\n\\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n ******************************************************************************/\\n\\n#include <bits/stdc++.h>\\n\\n/**\\n\\n * T1 28-05-2017\\n\\n * dp\\n\\n * @author xehoth\\n\\n */\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 55,\n \"score\": 41541.88065038773\n },\n {\n \"content\": \" *buf = '\\\\0';\\n\\n return -1;\\n\\n }\\n\\n do\\n\\n buf[s++] = c;\\n\\n while (c = read(), !isspace(c) && c != -1);\\n\\n buf[s] = '\\\\0';\\n\\n return s;\\n\\n}\\n\\n\\n\\ninline void read(double &x) {\\n\\n static char buf[30];\\n\\n read(buf), x = atof(buf);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2>\\n\\ninline void read(T1 &a, T2 &b) {\\n\\n read(a), read(b);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 56,\n \"score\": 41540.90262603176\n },\n {\n \"content\": \"template <typename T1, typename T2, typename T3>\\n\\ninline void read(T1 &a, T2 &b, T3 &c) {\\n\\n read(a), read(b), read(c);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4>\\n\\ninline void read(T1 &a, T2 &b, T3 &c, T4 &d) {\\n\\n read(a), read(b), read(c), read(d);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\\n\\ninline void read(T1 &a, T2 &b, T3 &c, T4 &d, T5 &e) {\\n\\n read(a), read(b), read(c), read(d), read(e);\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 1000000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\ninline void print(char c) {\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 57,\n \"score\": 41540.690951637174\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「ARC 079C」Cat Snuke and a Voyage 26-08-2017\\n\\n *\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace {\\n\\n\\n\\nconst int MAXN = 200000;\\n\\nbool vis[MAXN + 1];\\n\\n\\n\\ninline void solve() {\\n\\n std::ios::sync_with_stdio(false), std::cin.tie(NULL), std::cout.tie(NULL);\\n\\n register int n, m, u, v;\\n\\n for (std::cin >> n >> m; m--;) {\\n\\n std::cin >> u >> v;\\n\\n if (u == 1) {\\n\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 079/C-Cat Snuke and a Voyage.cpp\",\n \"rank\": 58,\n \"score\": 41537.85546304997\n },\n {\n \"content\": \" static char buf[30];\\n\\n read(buf), x = atof(buf);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2>\\n\\ninline void read(T1 &a, T2 &b) {\\n\\n read(a), read(b);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3>\\n\\ninline void read(T1 &a, T2 &b, T3 &c) {\\n\\n read(a), read(b), read(c);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4>\\n\\ninline void read(T1 &a, T2 &b, T3 &c, T4 &d) {\\n\\n read(a), read(b), read(c), read(d);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 59,\n \"score\": 41537.553621957086\n },\n {\n \"content\": \" for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void print(const char *s) {\\n\\n for (; *s; s++) print(*s);\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void println(T x) {\\n\\n print(x), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2>\\n\\ninline void print(T1 a, T2 b) {\\n\\n print(a), print(b);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3>\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 60,\n \"score\": 41536.81586556131\n },\n {\n \"content\": \"inline void println(T1 a, T2 b, T3 c) {\\n\\n print(a), print(b), print(c), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4>\\n\\ninline void println(T1 a, T2 b, T3 c, T4 d) {\\n\\n print(a), print(b), print(c), print(d), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\\n\\ninline void println(T1 a, T2 b, T3 c, T4 d, T5 e) {\\n\\n print(a), print(b), print(c), print(d), print(e), print('\\\\n');\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n}\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 100010;\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 61,\n \"score\": 41534.966491103805\n },\n {\n \"content\": \"\\n\\n#define long long long\\n\\nlong cost[MAXN], base[MAXN];\\n\\nlong n, S;\\n\\n\\n\\ninline bool check(long m) {\\n\\n for (int i = 1; i <= n; i++) {\\n\\n cost[i] = base[i] + i * m;\\n\\n }\\n\\n std::sort(cost + 1, cost + n + 1);\\n\\n long s = 0;\\n\\n for (int i = 1; i <= m; ++i) {\\n\\n s += cost[i];\\n\\n }\\n\\n return s <= S;\\n\\n}\\n\\n\\n\\ninline void solve() {\\n\\n using namespace IO;\\n\\n read(n), read(S);\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 62,\n \"score\": 41534.063968292714\n },\n {\n \"content\": \" for (register int i = 0; i < n; i++) {\\n\\n read(a[i]);\\n\\n l[a[i]] = std::min(l[a[i]], i), r[a[i]] = i;\\n\\n }\\n\\n static std::vector<Pair> vec[MAXN];\\n\\n for (register int i = 0; i < n; i++) {\\n\\n bool vis[MAXN] = {false};\\n\\n register int x = 0, min = INT_MAX, max = INT_MIN;\\n\\n for (register int j = i; j < n; j++) {\\n\\n if (!vis[a[j]]) x ^= a[j], vis[a[j]] = true;\\n\\n min = std::min(min, l[a[j]]), max = std::max(max, r[a[j]]);\\n\\n if (min >= i && max <= j) vec[i].emplace_back(j, x);\\n\\n }\\n\\n }\\n\\n static int f[MAXN];\\n\\n for (register int i = 0; i < n; i++) {\\n\\n for (const auto &j : vec[i])\\n\\n f[j.first + 1] = std::max(f[j.first + 1], f[i] + j.second);\\n\\n f[i + 1] = std::max(f[i + 1], f[i]);\\n\\n }\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 63,\n \"score\": 41526.06885192274\n },\n {\n \"content\": \" for (register int i = 1; i <= n; i++) read(base[i]);\\n\\n static long sum[MAXN];\\n\\n register int l = 0, r = n + 1;\\n\\n while (r - l > 1) {\\n\\n register int mid = l + r >> 1;\\n\\n if (check(mid))\\n\\n l = mid;\\n\\n else\\n\\n r = mid;\\n\\n }\\n\\n print(l), print(' ');\\n\\n for (int i = 1; i <= n; i++) {\\n\\n cost[i] = base[i] + i * l;\\n\\n }\\n\\n std::sort(cost + 1, cost + n + 1);\\n\\n long s = 0;\\n\\n for (int i = 1; i <= l; ++i) {\\n\\n s += cost[i];\\n\\n }\\n\\n print(s);\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 64,\n \"score\": 41522.89730630432\n },\n {\n \"content\": \" print(std::max(f[n], f[n + 1]));\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n#ifdef DBG\\n\\n freopen(\\\"in.in\\\", \\\"r\\\", stdin);\\n\\n freopen(\\\"out.out\\\", \\\"w\\\", stdout);\\n\\n freopen(\\\"debug.log\\\", \\\"w\\\", stderr);\\n\\n#endif\\n\\n Task::solve();\\n\\n IO::flush();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 65,\n \"score\": 41521.26228824745\n },\n {\n \"content\": \"template <typename T>\\n\\ninline void println(T x) {\\n\\n print(x), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2>\\n\\ninline void print(T1 a, T2 b) {\\n\\n print(a), print(b);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3>\\n\\ninline void print(T1 a, T2 b, T3 c) {\\n\\n print(a), print(b), print(c);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4>\\n\\ninline void print(T1 a, T2 b, T3 c, T4 d) {\\n\\n print(a), print(b), print(c), print(d);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 66,\n \"score\": 41519.79718656047\n },\n {\n \"content\": \"inline void print(T1 a, T2 b, T3 c) {\\n\\n print(a), print(b), print(c);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4>\\n\\ninline void print(T1 a, T2 b, T3 c, T4 d) {\\n\\n print(a), print(b), print(c), print(d);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5>\\n\\ninline void print(T1 a, T2 b, T3 c, T4 d, T5 e) {\\n\\n print(a), print(b), print(c), print(d), print(e);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2>\\n\\ninline void println(T1 a, T2 b) {\\n\\n print(a), print(b), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3>\\n\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 67,\n \"score\": 41518.887755326636\n },\n {\n \"content\": \"template <typename T1, typename T2, typename T3, typename T4, typename T5>\\n\\ninline void print(T1 a, T2 b, T3 c, T4 d, T5 e) {\\n\\n print(a), print(b), print(c), print(d), print(e);\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2>\\n\\ninline void println(T1 a, T2 b) {\\n\\n print(a), print(b), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3>\\n\\ninline void println(T1 a, T2 b, T3 c) {\\n\\n print(a), print(b), print(c), print('\\\\n');\\n\\n}\\n\\n\\n\\ntemplate <typename T1, typename T2, typename T3, typename T4>\\n\\ninline void println(T1 a, T2 b, T3 c, T4 d) {\\n\\n print(a), print(b), print(c), print(d), print('\\\\n');\\n\\n}\\n\\n\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 68,\n \"score\": 41518.7806519511\n },\n {\n \"content\": \"}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n#ifdef DBG\\n\\n freopen(\\\"in.in\\\", \\\"r\\\", stdin);\\n\\n#endif\\n\\n Task::solve();\\n\\n IO::flush();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"codeforces/Codeforces Round #417 (Div. 2)/C-Sagheer and Nubian Market-二分.cpp\",\n \"rank\": 69,\n \"score\": 41517.75721729353\n },\n {\n \"content\": \" if (vis[v]) std::cout << \\\"POSSIBLE\\\", exit(0);\\n\\n vis[v] = true;\\n\\n } else if (v == n) {\\n\\n if (vis[u]) std::cout << \\\"POSSIBLE\\\", exit(0);\\n\\n vis[u] = true;\\n\\n }\\n\\n }\\n\\n std::cout << \\\"IMPOSSIBLE\\\";\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n solve();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"atcoder/AtCoder Regular Contest 079/C-Cat Snuke and a Voyage.cpp\",\n \"rank\": 70,\n \"score\": 41506.15465165505\n },\n {\n \"content\": \"/*******************************************************************************\\n\\n * Copyright (c) 2016-2017, xehoth\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above copyright\\n\\n * notice, this list of conditions and the following disclaimer in the\\n\\n * documentation and/or other materials provided with the distribution.\\n\\n * * Neither the name xehoth, nor the names of its contributors may be used\\n\\n * to endorse or promote products derived from this software without\\n\\n * specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY XEHOTH AND CONTRIBUTORS \\\"AS IS\\\" AND ANY\\n\\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\\n\\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL XEHOTH AND CONTRIBUTORS BE LIABLE FOR ANY\\n\",\n \"file_path\": \"codeforces/Codeforces Round #416 (Div. 2)/C-Vladik and Memorable Trip.cpp\",\n \"rank\": 71,\n \"score\": 41505.255461119355\n },\n {\n \"content\": \"struct Edge {\\n\\n int u, v;\\n\\n\\n\\n inline bool operator<(const Edge &x) const {\\n\\n return u == x.u && v < x.v && u < x.u;\\n\\n }\\n\\n\\n\\n inline bool operator==(const Edge &x) const { return u == x.u && v == x.v; }\\n\\n} edge[MAXN + 1];\\n\\n\\n\\ninline void solve() {\\n\\n register int n, m;\\n\\n io >> n >> m;\\n\\n for (register int i = 1; i <= n; i++) val[i] = xorShift128Plus();\\n\\n for (register int i = 1; i <= m; i++) {\\n\\n io >> edge[i].u >> edge[i].v;\\n\\n if (edge[i].u > edge[i].v) std::swap(edge[i].u, edge[i].v);\\n\\n }\\n\\n std::sort(edge + 1, edge + m + 1);\\n\\n m = std::unique(edge + 1, edge + m + 1) - edge - 1;\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 72,\n \"score\": 41502.22315627431\n },\n {\n \"content\": \"struct Node {\\n\\n Node *c[MAX_SIGMA], *fail;\\n\\n int cnt;\\n\\n Node();\\n\\n\\n\\n inline void *operator new(size_t);\\n\\n};\\n\\n\\n\\nconst int NODE_SIZE = sizeof(Node);\\n\\n\\n\\nchar pool[MAXN * NODE_SIZE], *cur = pool;\\n\\n\\n\\nNode *null = (Node *)pool, *root;\\n\\n\\n\\nNode::Node() : fail(null), cnt(0) {\\n\\n for (register int i = 0; i < MAX_SIGMA; i++) c[i] = null;\\n\\n}\\n\\n\\n\\ninline void *Node::operator new(size_t) { return cur += NODE_SIZE; }\\n\\n\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 73,\n \"score\": 41502.22315627431\n },\n {\n \"content\": \"struct InputOutputStream {\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator>>(T &x) {\\n\\n read(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator<<(const T &x) {\\n\\n print(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n ~InputOutputStream() { flush(); }\\n\\n} io;\\n\\n}\\n\\n\\n\\nnamespace {\\n\\n\\n\\nconst int MAXN = 100000;\\n\\nconst int MAX_SIGMA = 26;\\n\\n\\n\\nusing IO::io;\\n\\n\\n\",\n \"file_path\": \"SuperOJ/p1985-字符串-AC自动机.cpp\",\n \"rank\": 74,\n \"score\": 38567.996018015816\n },\n {\n \"content\": \"struct InputOutputStream {\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator>>(T &x) {\\n\\n read(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator<<(const T &x) {\\n\\n print(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n ~InputOutputStream() { flush(); }\\n\\n} io;\\n\\n}\\n\\n\\n\\nnamespace {\\n\\n\\n\\nusing IO::io;\\n\",\n \"file_path\": \"BZOJ/BZOJ4264-小C找朋友-Hash.cpp\",\n \"rank\": 75,\n \"score\": 38567.996018015816\n },\n {\n \"content\": \"from math import log2\\n\\nn, l, r = map(int, input().split())\\n\\na = list(map(int, list(bin(n)[2:])))\\n\\nans = 0\\n\\nfor i in range(l, r + 1):\\n\\n ans += a[int(log2(i & -i))]\\n\",\n \"file_path\": \"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/B-Code For 1.py\",\n \"rank\": 76,\n \"score\": 37316.93525783213\n },\n {\n \"content\": \"inline void print(char c) {\\n\\n oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;\\n\\n *oh++ = c;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void print(T x) {\\n\\n static int buf[30], cnt;\\n\\n if (x == 0) {\\n\\n print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 77,\n \"score\": 33884.844745402865\n },\n {\n \"content\": \"inline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\\n}\\n\\n\\n\\ninline void read(char &c) {\\n\\n while (c = read(), isspace(c) && c != -1)\\n\\n ;\\n\\n}\\n\\n\\n\\nconst int OUT_LEN = 100000;\\n\\n\\n\\nchar obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 78,\n \"score\": 33880.28840925502\n },\n {\n \"content\": \"/**\\n\\n * Copyright (c) 2017, xehoth\\n\\n * All rights reserved.\\n\\n * 「BZOJ 3578」GTY的人类基因组计划2 07-10-2017\\n\\n * Hash\\n\\n * @author xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n#include <tr1/unordered_set>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 79,\n \"score\": 33877.14690435087\n },\n {\n \"content\": \"inline void solve() {\\n\\n io >> n >> m >> q;\\n\\n for (register int i = 1; i <= n; i++) num[i] = xorShift128Plus();\\n\\n s.insert(1);\\n\\n for (register int i = 1; i <= n; i++) h[1] ^= num[i], size[1]++, pos[i] = 1;\\n\\n for (register int i = 1, x, y; i <= q; i++) {\\n\\n register char c;\\n\\n io >> c >> x >> y;\\n\\n switch (c) {\\n\\n case 'C': {\\n\\n if (pos[x] == y) continue;\\n\\n s.erase(pos[x]), s.erase(y);\\n\\n h[pos[x]] ^= num[x], size[pos[x]]--;\\n\\n if (exist.find(h[pos[x]]) == exist.end()) s.insert(pos[x]);\\n\\n h[y] ^= num[x], size[y]++;\\n\\n if (exist.find(h[y]) == exist.end()) s.insert(y);\\n\\n pos[x] = y;\\n\\n break;\\n\\n }\\n\\n case 'W': {\\n\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 80,\n \"score\": 33856.30848542977\n },\n {\n \"content\": \"\\n\\ninline ulong xorShift128Plus() {\\n\\n static ulong seed1 = 495;\\n\\n static ulong seed2 = 233;\\n\\n register ulong x = seed1;\\n\\n register const ulong y = seed2;\\n\\n seed1 = y, x ^= x << 23;\\n\\n seed2 = x ^ y ^ (x >> 17) ^ (y >> 26);\\n\\n return seed2 + y;\\n\\n}\\n\\n\\n\\nusing IO::io;\\n\\n\\n\\nstd::set<int> s;\\n\\nstd::tr1::unordered_set<ulong> exist;\\n\\nconst int MAXN = 100010;\\n\\n\\n\\nulong num[MAXN], size[MAXN], pos[MAXN], h[MAXN];\\n\\nint n, m, q;\\n\\n\\n\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 81,\n \"score\": 33850.02791895626\n },\n {\n \"content\": \" register int ans = 0;\\n\\n for (register std::set<int>::iterator it = s.lower_bound(x);\\n\\n it != s.end() && *it <= y; it = s.lower_bound(x))\\n\\n exist.insert(h[*it]), ans += size[*it], s.erase(it);\\n\\n io << ans << '\\\\n';\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n}\\n\\n\\n\\nint main() {\\n\\n#ifdef DBG\\n\\n freopen(\\\"sample/1.in\\\", \\\"r\\\", stdin);\\n\\n#endif\\n\\n solve();\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 82,\n \"score\": 33845.82159125843\n },\n {\n \"content\": \"struct MulInv<mod, 0, inv> {\\n\\n static const uint INV = inv;\\n\\n};\\n\\n\\n\\ntemplate <uint mod>\\n\",\n \"file_path\": \"BZOJ/BZOJ4517-排列计数-组合数学+取模优化.cpp\",\n \"rank\": 83,\n \"score\": 33394.67431568321\n },\n {\n \"content\": \"struct MulInv<mod, 0, inv> {\\n\\n static const uint INV = inv;\\n\\n};\\n\\n\\n\\ntemplate <uint mod>\\n\",\n \"file_path\": \"SuperOJ/p2103-呼吸决定-扩展埃筛+自然数幂和+取模优化.cpp\",\n \"rank\": 84,\n \"score\": 33394.67431568321\n },\n {\n \"content\": \"struct Node *pos[MAXN + 1];\\n\",\n \"file_path\": \"BZOJ/BZOJ3600-没有人的算术-线段树 + 替罪羊树 + 动态标号.cpp\",\n \"rank\": 85,\n \"score\": 33377.9904410897\n },\n {\n \"content\": \"struct InputOutputStream {\\n\\n ~InputOutputStream() { flush(); }\\n\\n\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator<<(const T &x) {\\n\\n print(x);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n inline InputOutputStream &operator>>(T &x) {\\n\\n read(x);\\n\\n return *this;\\n\\n }\\n\\n} io;\\n\\n}\\n\\n\\n\\nnamespace {\\n\\n\\n\\ntypedef unsigned long long ulong;\\n\",\n \"file_path\": \"BZOJ/BZOJ3578-GTY的人类基因组计划2-HASH.cpp\",\n \"rank\": 86,\n \"score\": 30950.180198459668\n },\n {\n \"content\": \"k, q = map(int, input().split())\\n\\ndp = [[0.0 for i in range(k + 1)] for j in range(10000)]\\n\\ndp[0][0] = 1.0\\n\\nfor i in range(1, 10000):\\n\\n for j in range(1, k + 1):\\n\\n dp[i][j] = dp[i - 1][j] * j / k + dp[i - 1][j - 1] * (k - j + 1) / k\\n\\nfor t in range(q):\\n\\n p = int(input())\\n\\n for i in range(10000):\\n\\n if p <= dp[i][k] * 2000:\\n\\n print(i)\\n\",\n \"file_path\": \"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/D-Jon and Orbs.py\",\n \"rank\": 87,\n \"score\": 28891.164188639457\n },\n {\n \"content\": \"from math import sqrt\\n\\nk = 0\\n\\nfor t in range(int(input())): k ^= int(int(sqrt(8 * int(input()) + 1) - 1) / 2)\\n\",\n \"file_path\": \"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/E-Game of Stones.py\",\n \"rank\": 88,\n \"score\": 28891.164188639457\n },\n {\n \"content\": \"n = int(input())\\n\\ni = list(map(int, input().split()))\\n\",\n \"file_path\": \"codeforces/Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) 768/A-Oath of the Night's Watch.py\",\n \"rank\": 89,\n \"score\": 27083.75681566728\n },\n {\n \"content\": \"#include <cmath>\\n\\n#include <cstddef>\\n\\n#include <cstdio>\\n\\n#include <cstring>\\n\\n#include <iostream>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1 << 18 | 1;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)),\\n\\n s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\",\n \"file_path\": \"BZOJ/BZOJ2402-陶陶的难题II.cpp\",\n \"rank\": 90,\n \"score\": 71.87701857953616\n },\n {\n \"content\": \" for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n}\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 1010;\\n\\n\\n\\nbool isPalindrome[MAXN][MAXN];\\n\\nchar s[MAXN];\\n\\n\\n\\ninline void solve() {\\n\\n using namespace IO;\\n\\n register int t;\\n\\n for (read(t); t--;) {\\n\\n register int n = read(s);\\n\",\n \"file_path\": \"UVA/UVA11584-PartitioningbyPalindromes-dp.cpp\",\n \"rank\": 91,\n \"score\": 71.0758960789894\n },\n {\n \"content\": \"#include <cstdio>\\n\\n#include <cctype>\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\\n\\n iosig ? x = -x : 0;\\n\",\n \"file_path\": \"BZOJ/BZOJ2733_new_seg.cpp\",\n \"rank\": 92,\n \"score\": 70.02926876647689\n },\n {\n \"content\": \"namespace {\\n\\n\\n\\n inline char read() {\\n\\n static const int IN_LEN = 1 << 18 | 1;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)), s == t ? -1 : *s++;\\n\\n }\\n\\n\\n\\n const int OUT_LEN = 1 << 18 | 1;\\n\\n\\n\\n char obuf[OUT_LEN], *oh = obuf;\\n\\n\\n\\n inline void print(char c) {\\n\\n (oh == obuf + OUT_LEN) && (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf);\\n\\n *oh++ = c;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n inline void print(T x) {\\n\\n static int buf[21], cnt;\\n\",\n \"file_path\": \"loj/LOJ6029-市场-线段树.cpp\",\n \"rank\": 93,\n \"score\": 69.30127679886067\n },\n {\n \"content\": \" print('0');\\n\\n } else {\\n\\n x < 0 ? (print('-'), x = -x) : 0;\\n\\n for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n}\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 2000;\\n\\n\\n\\ninline void solve() {\\n\\n using namespace IO;\\n\\n register int n;\\n\\n read(n);\\n\\n static struct Array {\\n\",\n \"file_path\": \"BZOJ/BZOJ4247-挂饰-dp.cpp\",\n \"rank\": 94,\n \"score\": 68.89449207159889\n },\n {\n \"content\": \" for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;\\n\\n while (cnt) print((char)buf[cnt--]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }\\n\\n}\\n\\n\\n\\nnamespace Task {\\n\\n\\n\\nconst int MAXN = 50;\\n\\nconst int MAXM = 50;\\n\\nconst int MAXT = 2500;\\n\\n\\n\\ninline void solve() {\\n\\n using namespace IO;\\n\\n register int n, m, t;\\n\\n read(n), read(m), read(t);\\n\\n static int w[MAXN][MAXM + 1], f[MAXM + 1][MAXM + 1];\\n\\n for (register int i = 0; i < n; i++) {\\n\",\n \"file_path\": \"省选/2009/SCOI/粉刷匠-dp.cpp\",\n \"rank\": 95,\n \"score\": 68.8555102420587\n },\n {\n \"content\": \"#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\\n\",\n \"file_path\": \"BZOJ/BZOJ4814.cpp\",\n \"rank\": 96,\n \"score\": 67.94459986429021\n },\n {\n \"content\": \"#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\\n c == '-' ? iosig = true : 0;\\n\\n }\\n\\n for (x = 0; isdigit(c); c = read()) x = (x + (x << 2) << 1) + (c ^ '0');\\n\",\n \"file_path\": \"BZOJ/BZOJ3653.cpp\",\n \"rank\": 97,\n \"score\": 67.94459986429021\n },\n {\n \"content\": \"/*\\n\\n * created by xehoth\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\",\n \"file_path\": \"BZOJ/BZOJ2929.cpp\",\n \"rank\": 98,\n \"score\": 67.87040326658993\n },\n {\n \"content\": \"/*\\n\\n * created by xehoth 04-05-2017\\n\\n */\\n\\n#include <bits/stdc++.h>\\n\\n\\n\\nnamespace IO {\\n\\n\\n\\ninline char read() {\\n\\n static const int IN_LEN = 1000000;\\n\\n static char buf[IN_LEN], *s, *t;\\n\\n s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;\\n\\n return s == t ? -1 : *s++;\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\ninline void read(T &x) {\\n\\n static char c;\\n\\n static bool iosig;\\n\\n for (c = read(), iosig = false; !isdigit(c); c = read()) {\\n\\n if (c == -1) return;\\n\",\n \"file_path\": \"BZOJ/BZOJ4887.cpp\",\n \"rank\": 99,\n \"score\": 67.87040326658993\n }\n]","isConversational":false}}},{"rowIdx":72,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/termination_check_base.cpp"},"repo_name":{"kind":"string","value":"kuri-kustar/victim_localization"},"commit":{"kind":"string","value":"b5b0b8f2915d9805372a1d8c4809991b6d63c1b5"},"file_code":{"kind":"string","value":"#include \"victim_localization/termination_check_base.h\"\n\nTerminationCheckBase::TerminationCheckBase()\n{\n ros::param::param<int>(\"~termination_repeat_window_size\", repeat_window_size_, 8);\n ros::param::param<std::string>(\"~SaveDataFolder\",saveFolder, std::string(\"Data\"));\n result_status=\"Success\";\n}\n\nbool TerminationCheckBase::isTerminated()\n{\n std::cout << \"[TerminationCheckBase]: \" << cc.yellow << \"update() not defined. Used derived class with proper implimentation.\\n\" << cc.reset;\n return false;\n}\n\nvoid TerminationCheckBase::setHistory(nbv_history* h)\n{\n nbv_history_ = h;\n}\n\nvoid TerminationCheckBase::setViewEvaluator(view_evaluator_base* v)\n{\n view_evaluator = v;\n}\n\nvoid TerminationCheckBase::setNBVTimeTaken(ros::Duration t)\n{\n NBVDurationTaken=t;\n}\n\nvoid TerminationCheckBase::SaveResults()\n{\n std::string path = ros::package::getPath(\"victim_localization\");\n std::cout << \"path to package is\" << path <<std::endl;\n\n \n std::string file_path;\n file_path=path + \"/\" + saveFolder+ \"/\";\n view_evaluator->view_gen_->manager_->\n octree_->writeBinary(file_path+\"environment\");\n\n \n ofstream myfile (file_path+\"POSES.txt\");\n if (myfile.is_open())\n {\n for(int i =0; i< (nbv_history_->selected_poses.size()) ;i+=1)\n {\n myfile << nbv_history_->selected_poses[i].position.x << \" \"\n << nbv_history_->selected_poses[i].position.y<< \" \"\n << nbv_history_->selected_poses[i].position.z<< \" \"\n << nbv_history_->selected_poses[i].orientation.x<< \" \"\n << nbv_history_->selected_poses[i].orientation.y<< \" \"\n << nbv_history_->selected_poses[i].orientation.z<< \" \"\n << nbv_history_->selected_poses[i].orientation.w<< \"\\n\";\n }\n myfile.close();\n }\n else\n cout << \"Unable to open PATH.txt file\";\n\n \n ofstream myfile2 (file_path+\"PATH.txt\");\n if (myfile2.is_open())\n {\n for(int i =0; i< (nbv_history_->selected_poses_along_path.size()) ;i+=1)\n {\n myfile2 << nbv_history_->selected_poses_along_path[i].position.x << \" \"\n << nbv_history_->selected_poses_along_path[i].position.y<< \" \"\n << nbv_history_->selected_poses_along_path[i].position.z<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.x<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.y<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.z<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.w<< \"\\n\";\n }\n myfile2.close();\n }\n else\n cout << \"Unable to open PATH.txt file\";\n\n \n \n cv::Mat occupancyImage;\n grid_map::GridMap gridMap;\n Victim_Map_Base *Map_=view_evaluator->mapping_module_;\n double upscale_factor=32;\n double upscale_resolution= Map_->map_resol/upscale_factor;\n std::string mapName= \"SaveOccupancy\";\n gridMap.setGeometry(Map_->map.getLength(),upscale_resolution);\n gridMap.add(mapName,0);\n\n occupancyImage= upscaleOccupancyImage(Map_->map,Map_->layer_name,gridMap,mapName);\n cv::imwrite(file_path+Map_->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n\n \n if (Map_->Maptype==MAP::COMBINED)\n {\n \n gridMap[mapName].setZero(); \n occupancyImage= upscaleOccupancyImage(Map_->getMapLayer(MAP::DL)->map,\n Map_->getMapLayer(MAP::DL)->getlayer_name(),\n gridMap,mapName);\n cv::imwrite(file_path+Map_->getMapLayer(MAP::DL)->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n\n \n gridMap[mapName].setZero(); \n occupancyImage= upscaleOccupancyImage(Map_->getMapLayer(MAP::THERMAL)->map,\n Map_->getMapLayer(MAP::THERMAL)->getlayer_name(),\n gridMap,mapName);\n cv::imwrite(file_path+Map_->getMapLayer(MAP::THERMAL)->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n\n \n gridMap[mapName].setZero(); \n occupancyImage= upscaleOccupancyImage(Map_->getMapLayer(MAP::WIRELESS)->map,\n Map_->getMapLayer(MAP::WIRELESS)->getlayer_name(),\n gridMap,mapName);\n cv::imwrite(file_path+Map_->getMapLayer(MAP::WIRELESS)->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n }\n\n \n ofstream Results (file_path+Map_->layer_name+\"Result.txt\");\n if (Results.is_open())\n {\n Results << \"time taken: \" << NBVDurationTaken.toSec() << \"\\n\"\n << \"Total entropy: \" << view_evaluator->info_entropy_total_ << \"\\n\"\n << \"distance: \" << view_evaluator->info_distance_total_ << \"\\n\"\n << \"iteration: \" << nbv_history_->iteration << \"\\n\"\n << \"Result Status: \" << result_status << std::endl << \"\\n\";\n Results.close();\n }\n else cout << \"Unable to find Results file\";\n}\n\ncv::Mat TerminationCheckBase::upscaleOccupancyImage(grid_map::GridMap inputMap , std::string Input, grid_map::GridMap upscaledMap, std::string Output)\n{\n cv::Mat image;\n const float minValue = 0.0;\n const float maxValue = 1.0;\n Index index;\n Position position;\n for (grid_map::GridMapIterator iterator(upscaledMap);\n !iterator.isPastEnd(); ++iterator)\n {\n index=*iterator;\n upscaledMap.getPosition(index,position);\n upscaledMap.atPosition(Output,position)=1-inputMap.atPosition(Input,position);\n }\n\n GridMapCvConverter::toImage<unsigned char, 4>(upscaledMap, Output, CV_8UC4, minValue, maxValue, image);\n\n return image;\n}\n\n"},"prefix":{"kind":"string","value":"#include \"victim_localization/termination_check_base.h\"\n\nTerminationCheckBase::TerminationCheckBase()\n{\n ros::param::param<int>(\"~termination_repeat_window_size\", repeat_window_size_, 8);\n ros::param::param<std::string>(\"~SaveDataFolder\",saveFolder, std::string(\"Data\"));\n result_status=\"Success\";\n}\n\nbool TerminationCheckBase::isTerminated()\n{\n std::cout << \"[TerminationCheckBase]: \" << cc.yellow << \"update() not defined. Used derived class with proper implimentation.\\n\" << cc.reset;\n return false;\n}\n\nvoid TerminationCheckBase::setHistory(nbv_history* h)\n{\n nbv_history_ = h;\n}\n\nvoid TerminationCheckBase::setViewEvaluator(view_evaluator_base* v)\n{\n view_evaluator = v;\n}\n\nvoid TerminationCheckBase::setNBVTimeTaken(ros::Duration t)\n{\n NBVDurationTaken=t;\n}\n\nvoid TerminationCheckBase::SaveResults()\n{\n std::string path = ros::package::getPath(\"victim_localization\");\n std::cout << \"path to package is\" << path <<std::endl;\n\n \n std::string file_path;\n file_path=path + \"/\" + saveFolder+ \"/\";\n view_evaluator->view_gen_->manager_->\n octree_->writeBinary(file_path+\"environment\");\n\n \n ofstream myfile (file_path+\"POSES.txt\");\n if (myfile.is_open())\n {\n for(int i =0; i< (nbv_history_->selected_poses.size()) ;i+=1)\n {\n myfile << nbv_history_->selected_poses[i].position.x << \" \"\n << nbv_history_->selected_poses[i].position.y<< \" \"\n << nbv_history_->selected_poses[i].position.z<< \" \"\n << nbv_history_->selected_poses[i].orientation.x<< \" \"\n << nbv_history_->selected_poses[i].orientation.y<< \" \"\n << nbv_history_->selected_poses[i].orientation.z<< \" \"\n << nbv_history_->selected_poses[i].orientation.w<< \"\\n\";\n }\n myfile.close();\n }\n else\n cout << \"Unable to open PATH.txt file\";\n\n \n ofstream myfile2 (file_path+\"PATH.txt\");\n if (myfile2.is_open())\n {\n for(int i =0; i< (nbv_history_->selected_poses_along_path.size()) ;i+=1)\n {\n myfile2 << nbv_history_->selected_poses_along_path[i].position.x << \" \"\n << nbv_history_->selected_poses_along_path[i].position.y<< \" \"\n << nbv_history_->selected_poses_along_path[i].position.z<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.x<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.y<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.z<< \" \"\n << nbv_history_->selected_poses_along_path[i].orientation.w<< \"\\n\";\n }\n myfile2.close();\n }\n else\n cout"},"suffix":{"kind":"string","value":"tion)=1-inputMap.atPosition(Input,position);\n }\n\n GridMapCvConverter::toImage<unsigned char, 4>(upscaledMap, Output, CV_8UC4, minValue, maxValue, image);\n\n return image;\n}\n\n"},"middle":{"kind":"string","value":" << \"Unable to open PATH.txt file\";\n\n \n \n cv::Mat occupancyImage;\n grid_map::GridMap gridMap;\n Victim_Map_Base *Map_=view_evaluator->mapping_module_;\n double upscale_factor=32;\n double upscale_resolution= Map_->map_resol/upscale_factor;\n std::string mapName= \"SaveOccupancy\";\n gridMap.setGeometry(Map_->map.getLength(),upscale_resolution);\n gridMap.add(mapName,0);\n\n occupancyImage= upscaleOccupancyImage(Map_->map,Map_->layer_name,gridMap,mapName);\n cv::imwrite(file_path+Map_->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n\n \n if (Map_->Maptype==MAP::COMBINED)\n {\n \n gridMap[mapName].setZero(); \n occupancyImage= upscaleOccupancyImage(Map_->getMapLayer(MAP::DL)->map,\n Map_->getMapLayer(MAP::DL)->getlayer_name(),\n gridMap,mapName);\n cv::imwrite(file_path+Map_->getMapLayer(MAP::DL)->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n\n \n gridMap[mapName].setZero(); \n occupancyImage= upscaleOccupancyImage(Map_->getMapLayer(MAP::THERMAL)->map,\n Map_->getMapLayer(MAP::THERMAL)->getlayer_name(),\n gridMap,mapName);\n cv::imwrite(file_path+Map_->getMapLayer(MAP::THERMAL)->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n\n \n gridMap[mapName].setZero(); \n occupancyImage= upscaleOccupancyImage(Map_->getMapLayer(MAP::WIRELESS)->map,\n Map_->getMapLayer(MAP::WIRELESS)->getlayer_name(),\n gridMap,mapName);\n cv::imwrite(file_path+Map_->getMapLayer(MAP::WIRELESS)->getlayer_name()+\"Occupancy.jpeg\",occupancyImage);\n }\n\n \n ofstream Results (file_path+Map_->layer_name+\"Result.txt\");\n if (Results.is_open())\n {\n Results << \"time taken: \" << NBVDurationTaken.toSec() << \"\\n\"\n << \"Total entropy: \" << view_evaluator->info_entropy_total_ << \"\\n\"\n << \"distance: \" << view_evaluator->info_distance_total_ << \"\\n\"\n << \"iteration: \" << nbv_history_->iteration << \"\\n\"\n << \"Result Status: \" << result_status << std::endl << \"\\n\";\n Results.close();\n }\n else cout << \"Unable to find Results file\";\n}\n\ncv::Mat TerminationCheckBase::upscaleOccupancyImage(grid_map::GridMap inputMap , std::string Input, grid_map::GridMap upscaledMap, std::string Output)\n{\n cv::Mat image;\n const float minValue = 0.0;\n const float maxValue = 1.0;\n Index index;\n Position position;\n for (grid_map::GridMapIterator iterator(upscaledMap);\n !iterator.isPastEnd(); ++iterator)\n {\n index=*iterator;\n upscaledMap.getPosition(index,position);\n upscaledMap.atPosition(Output,posi"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class ReactivePathPlanner : public navigationBase\n\n{\n\npublic:\n\n ReactivePathPlanner(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager);\n\n\n\n sspp::sspp_srv planningService;\n\n ReactivePlannerServer *reactivePlannerServer;\n\n\n\n ros::NodeHandle nh_;\n\n ros::NodeHandle nh_private_;\n\n volumetric_mapping::OctomapManager *manager_;\n\n\n\n // ros::ServiceClient clientPath_;\n\n\n\n double uav_fixed_height;\n\n double extensionRange_;\n\n double boundingbox_x_;\n\n double boundingbox_y_;\n\n double boundingbox_z_;\n\n double dOvershoot_;\n","file_path":"include/victim_localization/reactive_path_planner.h","rank":0,"score":134070.60781306797},{"content":"class Raytracing\n\n{\n\npublic:\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\n\n\n\n geometry_msgs::Pose current_pose_;\n\n std::shared_ptr<octomap::OcTree> tree_;\n\n vehicle_communicator *drone_comm;\n\n VehicleControlBase *vehicle;\n\n volumetric_mapping::OctomapManager *manager_;\n\n\n\n nav_msgs::OccupancyGridPtr grid_;\n\n\n\n std::string Layer_name_;\n\n double HFOV_deg;\n\n double VFOV_deg;\n\n double range_max_;\n\n double range_min_;\n\n double x_arena_max;\n","file_path":"include/victim_localization/raytracing.h","rank":1,"score":108643.92784109377},{"content":"class vehicle_communicator\n\n{\n\npublic:\n\n vehicle_communicator(const ros::NodeHandle& nh, const ros::NodeHandle& nh_private,\n\n volumetric_mapping::OctomapManager *mapManager);\n\n ros::NodeHandle nh_;\n\n ros::NodeHandle nh_private_;\n\n volumetric_mapping::OctomapManager *manager_;\n\n\n\n ros::Publisher pub_waypoint;\n\n ros::Publisher pub_path;\n\n\n\n ros::Subscriber sub_pose;\n\n ros::Subscriber sub_command_status;\n\n\n\n ros::ServiceClient clientExecuteRotation ;\n\n ros::ServiceClient clientExecuteWaypoint;\n\n ros::ServiceClient clientExecutePath;\n\n ros::ServiceClient clientExecutePath2;\n\n ros::ServiceClient ClientCheckStatus;\n","file_path":"include/control/vehicle_communicator.h","rank":2,"score":106102.28436550131},{"content":"class OcclusionCulling\n\n{\n\npublic:\n\n\t// >>>>>>>>\n\n // Attributes\n\n // >>>>>>>>\n\n ros::NodeHandle nh;\n\n std::string model;\n\n // ros::Publisher original_pub;\n\n // ros::Publisher visible_pub;\n\n ros::Publisher fov_pub;\n\n pcl::PointCloud<pcl::PointXYZ>::Ptr cloud;\n\n pcl::PointCloud<pcl::PointXYZ>::Ptr filtered_cloud;\n\n pcl::PointCloud<pcl::PointXYZ>::Ptr occlusionFreeCloud;//I can add it to accumulate cloud if I want to extract visible surface from multiple locations\n\n pcl::PointCloud<pcl::PointXYZ>::Ptr FrustumCloud;//frustum cull\n\n\n\n pcl::PointCloud<pcl::PointXYZ> FreeCloud;\n\n float voxelRes, OriginalVoxelsSize;\n\n double id;\n\n pcl::VoxelGridOcclusionEstimationT voxelFilterOriginal;\n","file_path":"include/culling/occlusion_culling.h","rank":3,"score":106102.28436550131},{"content":"class TimeProfiler {\n\n\n\n public:\n\n struct ProfilerEntry{\n\n double min, max, total, avg, last;\n\n int count;\n\n };\n\n\n\n TimeProfiler();\n\n TimeProfiler(bool b);\n\n double getLatestTime(std::string s);\n\n void start();\n\n void start(std::string s);\n\n void toc();\n\n void toc(std::string s);\n\n void stop();\n\n void stop(std::string s);\n\n void dump();\n\n\n\n private:\n\n bool verbose;\n\n std::map<std::string,std::chrono::steady_clock::time_point> timers;\n\n std::map<std::string,ProfilerEntry> entries;\n\n\n\n std::string getEntryTitle(std::string s);\n\n};\n\n\n\n#endif // TimeProfiler_H\n","file_path":"include/utilities/time_profiler.h","rank":4,"score":106102.28436550131},{"content":"class navigationBase\n\n{\n\npublic:\n\n navigationBase();\n\n geometry_msgs::Pose current_pose_;\n\n\n\n\n\n double nav_bounds_x_min_;\n\n double nav_bounds_y_min_;\n\n double nav_bounds_z_min_;\n\n double nav_bounds_x_max_;\n\n double nav_bounds_y_max_;\n\n double nav_bounds_z_max_;\n\n double uav_fixed_height;\n\n\n\n std::string methodName_;\n\n double d_close;\n\n double getDistance(geometry_msgs::Pose p1, geometry_msgs::Pose p2);\n\n\n\n\n","file_path":"include/victim_localization/navigation_base.h","rank":5,"score":103709.53681133158},{"content":"class TestNBV\n\n{\n\n\n\n tf::TransformListener tf_;\n\npublic:\n\n ros::NodeHandle nh;\n\n ros::NodeHandle nh_private;\n\n ros::Publisher pub_iteration_info;\n\n TimeProfiler timer;\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\n\n ros::Time StartTimeForNBV;\n\n\n\n\n\n vehicle_communicator *drone_communicator_;\n\n VehicleControlBase *vehicle_;\n\n Victim_Map_Base *Map_;\n\n nbv_history *history_;\n\n TerminationCheckBase *termination_check_module_;\n\n\n","file_path":"include/victim_localization/test_NBV.h","rank":6,"score":103709.53681133158},{"content":"class iris_drone_commander\n\n{\n\npublic:\n\n iris_drone_commander(const ros::NodeHandle &nh, const ros::NodeHandle &nhPrivate);\n\n VehicleControlBase *vehicle_;\n\n ros::NodeHandle nh_;\n\n ros::NodeHandle nh_private_;\n\n ros::Publisher localPosePub;\n\n\n\n ros::Publisher waypoint_status;\n\n ros::Publisher path_status;\n\n\n\n bool command_status;\n\n Command::State state;\n\n bool enable_rotate;\n\n geometry_msgs::PoseStamped hoverPose;\n\n\n\n double start_x, start_y, start_z, start_yaw;\n\n int vehicle_type;\n\n std::string base_frame;\n","file_path":"include/control/vehicle_commander.h","rank":7,"score":103709.53681133158},{"content":"class nbv_history\n\n{\n\npublic:\n\n nbv_history();\n\n void computeEntropyDiff();\n\n double getMaxUtility (int N_iterations);\n\n bool isRepeatingMotions(int window_size);\n\n void update();\n\n\n\n int iteration;\n\n std::vector<float> entropy_diff;\n\n std::vector<geometry_msgs::Pose> selected_poses;\n\n std::vector<geometry_msgs::Pose> selected_poses_along_path;\n\n std::vector<float> selected_utility;\n\n std::vector<float> number_of_visited_cells_in_selected_poses;\n\n std::vector<float> number_of_unvisited_cells_in_selected_poses;\n\n std::vector<float> percentage_of_Unvisited_cells;\n\n\n\n\n\n std::vector<float> total_entropy;\n","file_path":"include/victim_localization/nbv_history.h","rank":8,"score":103709.53681133158},{"content":"class visualizeResults1\n\n{\n\npublic:\n\n visualizeResults1(const ros::NodeHandle &nh_,\n\n const ros::NodeHandle &nh_private_ );\n\n\n\n ros::NodeHandle nh;\n\n ros::NodeHandle nh_private;\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\n\n volumetric_mapping::OctomapManager *manager_;\n\n\n\n std::string resultPath;\n\n std::vector<geometry_msgs::Pose> Poses;\n\n std::vector<geometry_msgs::Pose> Path;\n\n\n\n void SetPathtoResults(std::string path);\n\n void trigger();\n\n\n\n\n\n};\n\n\n\n#endif // PLOTRESULTS1_H\n","file_path":"include/victim_localization/visualize_results1.h","rank":9,"score":103709.53681133158},{"content":"class SSD_client {\n\n protected:\n\n ros::NodeHandle n;\n\n ros::Rate loop_rate;\n\n ros::ServiceClient client ;\n\n\n\n public:\n\n bool Detection_success;\n\n victim_localization::DL_box srv;\n\n SSD_client::SSD_client();\n\n void Get_SSD_Detection();\n\n\n\n};\n\n\n\n#endif // SSD_CLIENT_H\n","file_path":"include/victim_localization/ssd_client.h","rank":10,"score":103709.53681133158},{"content":"class test_navigation\n\n{\n\n tf::TransformListener tf_;\n\npublic:\n\n test_navigation(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private );\n\n ReactivePathPlanner *planner_;\n\n vehicle_communicator *drone_communicator_;\n\n volumetric_mapping::OctomapManager *manager_;\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\n\n\n\n\n\n Volumetric_Map *Volumetric_Map_;\n\n costmap_2d::Costmap2DROS *CostMapROS_;\n\n nav_msgs::Path path_;\n\n nav_msgs::Path path_to_waypoint;\n\n\n\n\n\n ros::NodeHandle nh_;\n\n ros::NodeHandle nh_private_;\n","file_path":"include/victim_localization/test_navigation.h","rank":11,"score":103709.53681133158},{"content":"class visualizeResults\n\n{\n\npublic:\n\n visualizeResults(const ros::NodeHandle &nh_,\n\n const ros::NodeHandle &nh_private_ );\n\n\n\n ros::NodeHandle nh;\n\n ros::NodeHandle nh_private;\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\n\n volumetric_mapping::OctomapManager *manager_;\n\n\n\n std::string resultPath;\n\n std::vector<geometry_msgs::Pose> Path;\n\n void SetPathtoResults(std::string path);\n\n void trigger();\n\n\n\n\n\n};\n\n\n\n#endif // PLOTRESULTS_H\n","file_path":"include/victim_localization/visualize_results.h","rank":12,"score":103709.53681133158},{"content":"class VehicleControlBase\n\n{\n\nprotected:\n\n bool is_ready_;\n\n\n\npublic:\n\n double distance_threshold_;\n\n double angular_threshold_;\n\n double linear_speed_threshold_;\n\n double angular_speed_threshold_;\n\n\n\n geometry_msgs::Pose vehicle_current_pose_;\n\n geometry_msgs::Twist vehicle_current_twist_;\n\n mavros_msgs::State vehicle_current_state_;\n\n\n\n geometry_msgs::Pose setpoint_;\n\n std::vector<geometry_msgs::Pose> setpath_;\n\n\n\n ros::Time setpoint_last_received;\n\n geometry_msgs::PoseStamped setpoint_last_pose;\n","file_path":"include/control/vehicle_control_base.h","rank":13,"score":101452.97346955829},{"content":"class Volumetric_Map\n\n{\n\n\n\n typedef octomap::OcTree OcTreeT;\n\n typedef octomap_msgs::GetOctomap OctomapSrv;\n\n typedef octomap_msgs::BoundingBoxQuery BBXSrv;\n\n\n\npublic:\n\n //....variables....\n\n ros::Time previous_time;\n\n std::string topic_pointcloud_;\n\n std::string topic_Pose;\n\n ros::Subscriber pointcloud_sub_;\n\n costmap_2d::Costmap2DROS *costmap_ros_;\n\n costmap_2d::Costmap2D *costmap_;\n\n double pcl_throttle_;\n\n double map2D_throttle_;\n\n bool accept_pointCloud;\n\n bool stop;\n\n int count_pointCloud;\n","file_path":"include/victim_localization/volumetric_map_manager.h","rank":14,"score":101452.97346955829},{"content":"class view_generator_IG\n\n{\n\npublic:\n\n\n\n\n\nprotected:\n\n double res_x_, res_y_, res_z_, res_yaw_;\n\n\n\n double nav_bounds_x_max_, nav_bounds_y_max_, nav_bounds_z_max_;\n\n double nav_bounds_x_min_, nav_bounds_y_min_, nav_bounds_z_min_;\n\n double dist_to_goal;\n\n\n\n double uav_fixed_height;\n\n double extensionRange_;\n\n Eigen::Vector3d boundingbox_;\n\n double boundingbox_x_,boundingbox_y_,boundingbox_z_;\n\n double dOvershoot_;\n\n\n\npublic:\n\n //....variables....\n","file_path":"include/victim_localization/view_generator_ig.h","rank":15,"score":99321.28957701172},{"content":"class ReactivePlannerServer\n\n{\n\nprivate:\n\n ros::ServiceServer planningService;\n\n ros::Subscriber sub;\n\n ros::NodeHandle nh;\n\n ros::NodeHandle nh_private;\n\n volumetric_mapping::OctomapManager * mapManager = NULL;\n\n geometry_msgs::Point robotCenter;\n\n geometry_msgs::Vector3 gridSize;\n\n geometry_msgs::Pose gridStart;\n\n SSPP::PathPlanner* pathPlanner = NULL;\n\n Robot* robot = NULL;\n\n Pose start,end;\n\n double orientationSamplingRes = 90.0;\n\n double debugDelay = 0.0;\n\n double regGridConRad;\n\n double gridRes;\n\n double distanceToGoal = 0;\n\n int treeProgressDisplayFrequency = -1;\n","file_path":"include/victim_localization/reactive_planner_server.h","rank":16,"score":99321.28957701172},{"content":"class view_evaluator_base\n\n{\n\npublic:\n\n float info_selected_utility_;\n\n float info_percentage_of_New_Cells;\n\n\n\n float info_dl_selected_utility_;\n\n float info_thermal_selected_utility_;\n\n float info_wireless_selected_utility_;\n\n\n\n float info_selected_direction_; // this param is used for in wireless Viewpoint evaluation\n\n float info_entropy_total_;\n\n float info_dl_entropy_total_;\n\n float info_thermal_entropy_total_;\n\n float info_wireless_entropy_total_;\n\n\n\n\n\n view_evaluator_base();\n\n geometry_msgs::Pose getTargetPose();\n\n void setViewGenerator(view_generator_IG* v);\n","file_path":"include/victim_localization/view_evaluator_base.h","rank":17,"score":99321.28957701172},{"content":"class TerminationCheckBase\n\n{\n\npublic:\n\n TerminationCheckBase();\n\n virtual bool isTerminated();\n\n void setHistory(nbv_history* h);\n\n void setViewEvaluator(view_evaluator_base* v);\n\n void SaveResults();\n\n cv::Mat upscaleOccupancyImage(grid_map::GridMap inputMap , std::string Input,\n\n grid_map::GridMap upscaledMap, std::string Output);\n\n\n\n void setNBVTimeTaken(ros::Duration t);\n\n ros::Duration NBVDurationTaken;\n\n std::string saveFolder;\n\n std::string result_status; // result_status\n\n\n\n\n\nprotected:\n\n nbv_history* nbv_history_;\n\n view_evaluator_base* view_evaluator;\n\n\n\n int repeat_window_size_;\n\n};\n\n\n\n#endif // TERMINATION_CHECK_BASE_H\n","file_path":"include/victim_localization/termination_check_base.h","rank":18,"score":99321.28957701172},{"content":"class victim_detector_base\n\n{\n\npublic:\n\n victim_detector_base();\n\n ~victim_detector_base();\n\n\n\n vehicle_communicator *vehicle_comm_;\n\n virtual Status getDetectorStatus(){};\n\n virtual void performDetection(){};\n\n\n\n geometry_msgs::PoseStamped capture_ps;\n\n geometry_msgs::PoseStamped current_ps;\n\n void SetVehicleCommunicator(vehicle_communicator *vehicle_comm);\n\n virtual ros::Time getCaptureTime(){};\n\n virtual ros::Duration GetConnectionTime(); // GetConnectionTime only use with\n\n // DeepLeanring Detector to account for possible connection drop\n\n};\n\n\n\n#endif // VICTIM_DETECTOR_BASE_H\n","file_path":"include/victim_localization/victim_detector_base.h","rank":19,"score":99321.28957701172},{"content":"class Victim_Map_Base\n\n{\n\n\n\nprotected://get it from config ..\n\n double Prob_D_H; //P(D|H)\n\n double Prob_D_Hc; //P(D|Hc)\n\n double Prob_Dc_H; //P(Dc|H)\n\n double Prob_Dc_Hc; //P(Dc|Hc)\n\n\n\npublic:\n\n Victim_Map_Base(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\n\n ~Victim_Map_Base();\n\n\n\n MAP::MAPtype Maptype;\n\n\n\n vehicle_communicator *drone_comm;\n\n VehicleControlBase *vehicle_;\n\n\n\n std::string camera_optical_frame;\n\n std::string camera_thermal_frame;\n","file_path":"include/victim_localization/victim_map_base.h","rank":20,"score":99321.28957701172},{"content":"class victim_thermal_detector\n\n{\n\npublic:\n\n victim_thermal_detector(ros::NodeHandle& nh_,ros::NodeHandle& pnh_);\n\n ~victim_thermal_detector();\n\n\n\n image_transport::Subscriber sub_image;\n\n image_transport::Publisher pub_detection_;\n\n\n\n double minTempVictim_;\n\n double maxTempVictim_;\n\n double minAreaVictim_;\n\n double minDistBetweenBlobs_;\n\n double blob_temperature_;\n\n std::vector<geometry_msgs::Point> victim_loc;\n\n\n\n void imageCallback(const sensor_msgs::ImageConstPtr& img);\n\n std::vector<geometry_msgs::Point> GetDetectionResult();\n\n\n\n\n\n\n\n\n\n};\n\n\n\n#endif // VICTIM_THERMAL_DETECTOR_H\n","file_path":"include/victim_localization/victim_thermal_detector_node.h","rank":21,"score":97304.39790457269},{"content":"class SSD_Detection_with_clustering\n\n{\n\npublic:\n\n SSD_Detection_with_clustering();\n\n cv_bridge::CvImagePtr current_depth_image;\n\n victim_localization::DL_msgs_boxes current_ssd_detection;\n\n geometry_msgs::Pose current_pose;\n\n geometry_msgs::Point detected_point;\n\n bool detection_status_; //\n\n ros::Publisher pub_segemented_human_pointcloud;\n\n\n\n tf::TransformListener *tf_listener;\n\n typedef message_filters::sync_policies::ApproximateTime<sensor_msgs::Image,victim_localization::DL_msgs_boxes,geometry_msgs::PoseStamped> MySyncPolicy;\n\n message_filters::Subscriber<sensor_msgs::Image> *depth_in_;\n\n message_filters::Subscriber<victim_localization::DL_msgs_boxes> *box_;\n\n message_filters::Subscriber<geometry_msgs::PoseStamped> *loc_sub_;\n\n message_filters::Synchronizer<MySyncPolicy> *sync;\n\n\n\n bool DetectionAvailable();\n\n void CallBackData(const sensor_msgs::ImageConstPtr& input_depth, const victim_localization::DL_msgs_boxesConstPtr& boxes_,\n\n const geometry_msgs::PoseStamped::ConstPtr& loc);\n\n void FindClusterCentroid();\n\n bool getClusterCentroidResultStatus();\n\n geometry_msgs::Point getClusterCentroid();\n\n void PublishSegmentedPointCloud(const pcl::PointCloud<pcl::PointXYZ> input_PointCloud);\n\n};\n\n\n\n#endif // SSD_DETECTION_H\n","file_path":"include/ssd_keras/ssd_detection_with_ecludian_clustering (backup).h","rank":22,"score":95393.26914281788},{"content":"class Raytracing2D : public Raytracing\n\n{\n\npublic:\n\n\n\n Raytracing2D(double map_res_);\n\n Raytracing2D(double map_res_, double HFOV_deg, double VFOV_deg, double max_d, double min_d);\n\n ~Raytracing2D();\n\n\n\n void GenerateOctomap(bool rebuild_once, bool publish);\n\n void generateMarkerArray(\n\n const std::string& tf_frame,\n\n visualization_msgs::MarkerArray* occupied_nodes,\n\n visualization_msgs::MarkerArray* free_nodes);\n\n\n\n double colorizeMapByHeight(double z, double min_z,\n\n double max_z) const {\n\n return (1.0 - std::min(std::max((z - min_z) / (max_z - min_z), 0.0), 1.0));\n\n }\n\n\n\n std_msgs::ColorRGBA percentToColor(double h)const;\n","file_path":"include/victim_localization/raytracing_2d.h","rank":23,"score":94226.29371551238},{"content":"class straightLine : public navigationBase\n\n{\n\npublic:\n\n straightLine(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager);\n\n\n\n ros::NodeHandle nh_;\n\n ros::NodeHandle nh_private_;\n\n volumetric_mapping::OctomapManager *manager_;\n\n double extensionRange_;\n\n double boundingbox_x_;\n\n double boundingbox_y_;\n\n double boundingbox_z_;\n\n double dOvershoot_;\n\n\n\n Eigen::Vector3d boundingbox_;\n\n\n\n std::string methodName(void);\n\n bool GeneratePath(geometry_msgs::Pose end, nav_msgs::Path &Path);\n\n void start(){};\n\n\n\n};\n\n\n\n#endif // STRAIGHTLINE_H\n","file_path":"include/victim_localization/straightline.h","rank":24,"score":92094.60982296581},{"content":"class FloatingSensorPosition : public ModelPlugin\n\n{\n\npublic:\n\n FloatingSensorPosition();\n\n virtual ~FloatingSensorPosition();\n\n\n\nprotected:\n\n virtual void Load(physics::ModelPtr _model, sdf::ElementPtr _sdf);\n\n virtual void Update();\n\n virtual void Reset();\n\n virtual void OnRosMsgPose(const geometry_msgs::PoseStampedConstPtr &msg);\n\n virtual void OnRosMsgTwist(const geometry_msgs::TwistConstPtr &msg);\n\n virtual void QueueThread();\n\n virtual void GetCurrentPose();\n\n virtual void UpdatePosition();\n\n\n\nprivate:\n\n std::mutex mtx_pose_; // mutex for critical section\n\n tf::TransformBroadcaster tf_broadcaster_;\n\n\n","file_path":"include/vehicle/floating_sensor_position_plugin.h","rank":25,"score":86353.1170019225},{"content":"class VehicleControlIris : public VehicleControlBase\n\n{\n\nprivate:\n\n double uav_height_min_;\n\n double uav_height_max_;\n\n\n\n\n\npublic:\n\n ros::Subscriber sub_odom;\n\n ros::Subscriber sub_state;\n\n ros::Subscriber sub_setpoint;\n\n ros::ServiceClient arming_client;\n\n ros::ServiceClient set_mode_client;\n\n ros::Publisher pub_setpoint;\n\n VehicleControlIris();\n\n\n\n//private:\n\n\n\n void callbackOdometry(const nav_msgs::Odometry& odom_msg);\n\n void callbackState(const mavros_msgs::State& state_msg);\n","file_path":"include/control/vehicle_control_iris.h","rank":26,"score":86353.1170019225},{"content":"class view_evaluator_ig : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_ig();\n\n\n\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateCombinedUtility(geometry_msgs::Pose p,double &new_cell_percentage);\n\n\n\n\n\n std::string getMethodName();\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_IG_H\n","file_path":"include/victim_localization/view_evaluator_ig.h","rank":27,"score":84630.00228306273},{"content":"class Victim_Map_Wireless: public Victim_Map_Base\n\n{\n\n\n\nprivate:\n\n std::string wireless_polygon_topic=\"polygon_wireless\";\n\n std::string wireless_layer_name=\"victim_wireless\";\n\n Position victim_loc;\n\n double vision_map_resol;\n\n double max_wireless_range;\n\n\n\npublic:\n\n Victim_Map_Wireless(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\n\n victim_wireless_detector *detector_;\n\n void Update();\n\n void runDetector();\n\n virtual void setDetectionResult(Status detection_status);\n\n\n\n double Distance_to_center(Position p1, Position p2);\n\n\n\n\n\n};\n\n\n\n#endif // VICTIM_MAP_WIRELESS_2_H\n","file_path":"include/victim_localization/victim_map_wireless_2.h","rank":28,"score":84630.00228306273},{"content":"class victim_thermal_detector : public victim_detector_base\n\n{\n\npublic:\n\n victim_thermal_detector();\n\n ~victim_thermal_detector();\n\n\n\n image_transport::Subscriber sub_image;\n\n image_transport::Publisher pub_detection_;\n\n\n\n double minTempVictim_;\n\n double maxTempVictim_;\n\n double minAreaVictim_;\n\n double minDistBetweenBlobs_;\n\n double blob_temperature_;\n\n sensor_msgs::ImageConstPtr input_image;\n\n cv::Mat img_proc;\n\n Position victim_loc;\n\n bool victim_found;\n\n bool plot_;\n\n\n","file_path":"include/victim_localization/victim_thermal_detector.h","rank":29,"score":84630.00228306273},{"content":"class victim_map_Thermal: public Victim_Map_Base\n\n{\n\n\n\nprivate:\n\n std::string thermal_polygon_topic=\"polygon_thermal\";\n\n std::string Thermal_layer_name=\"victim_thermal\";\n\n double thermal_img_x_res;\n\n double thermal_img_y_res;\n\n double thermal_x_offset;\n\n double thermal_y_offset;\n\n double max_thermal_d;\n\n double min_thermal_d;\n\n\n\n Position ThermalRayStart;\n\n Position ThermalRayEnd;\n\n std::vector<Position> ThermalRay;\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualize_thermal_ray;\n\n\n\n\n","file_path":"include/victim_localization/victim_map_thermal.h","rank":30,"score":84630.00228306273},{"content":"class victim_map_DL: public Victim_Map_Base\n\n{\n\n\n\nprivate:\n\n std::string DL_polygon_topic=\"polygon_DL\";\n\n std::string DL_layer_name=\"victim_DL\";\n\n\n\n victim_vision_detector *detector_;\n\n\n\n\n\npublic:\n\n victim_map_DL(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\n\n void Update();\n\n void runDetector();\n\n ros::Duration getServiceConnectionTimeout();\n\n};\n\n\n\n#endif // VICTIM_MAP_DL_H\n","file_path":"include/victim_localization/victim_map_dl.h","rank":31,"score":84630.00228306273},{"content":"class view_evaluator_weighted : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_weighted();\n\n\n\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module,double &new_cell_percentage);\n\n void calculateIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max,double &new_cell_percentage);\n\n void calculateWirelessIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max,double &new_cell_percentage);\n\n void evaluate();\n\n void evaluateWireless();\n\n void evaluateCombined();\n\n double f_;\n\n bool use_dist;\n\n\n\n\n\n std::string getMethodName();\n\n std::vector<geometry_msgs::Pose> Info_poses;\n\n std::vector<double> Info_View_utilities;\n\n std::vector<double> Info_View_Max;\n\n std::vector<double> Info_WirelessDiection;\n","file_path":"include/victim_localization/view_evaluator_weighted.h","rank":32,"score":84630.00228306273},{"content":"class victim_vision_detector : public victim_detector_base\n\n{\n\npublic:\n\n victim_vision_detector();\n\n ~victim_vision_detector();\n\n cv_bridge::CvImagePtr current_depth_image;\n\n victim_localization::DL_msgs_box current_ssd_detection;\n\n geometry_msgs::Point detected_point;\n\n bool detection_Cluster_succeed; //\n\n ros::Publisher pub_segemented_human_pointcloud;\n\n ros::Publisher pub_setpoint;\n\n double image_x_resol;\n\n double image_y_resol;\n\n double image_x_offset;\n\n double image_y_offset;\n\n double RGB_FL;\n\n std::string camera_optical_frame;\n\n bool ServiceCallFirstTime;\n\n ros::Time Start_time;\n\n ros::Duration Service_startTime;\n","file_path":"include/ssd_keras/victim_vision_detector.h","rank":33,"score":84630.00228306273},{"content":"class view_evaluator_sum: public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_sum();\n\n ~view_evaluator_sum();\n\n\n\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n std::string getMethodName();\n\n\n\nprivate:\n\n double w_dist_;\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_SUMM_H\n","file_path":"include/victim_localization/view_evaluator_sum.h","rank":34,"score":84630.00228306273},{"content":"class view_evaluator_FOV: public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_FOV();\n\n ~view_evaluator_FOV();\n\n\n\n double FOVSize(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\n\n std::string getMethodName();\n\n\n\n std::vector<double> Info_View_counts;\n\n std::vector<geometry_msgs::Pose> Info_poses;\n\n\n\n std::vector<double> Info_View_counts_dl;\n\n std::vector<double> Info_View_counts_thermal;\n\n\n\n void evaluate();\n\n void evaluateCombined();\n\n\n\nprivate:\n\n double w_dist_;\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_FFOV_H\n","file_path":"include/victim_localization/view_evaluator_fieldofview.h","rank":35,"score":84630.00228306273},{"content":"class victim_wireless_detector : public victim_detector_base\n\n{\n\npublic:\n\n victim_wireless_detector();\n\n ~victim_wireless_detector();\n\n\n\n\n\n double current_node_loc;\n\n double target_node_loc;\n\n double d0;\n\n double N_sensor;\n\n double lamda;\n\n double frequency;\n\n double SNR;\n\n double K;\n\n double path_loss;\n\n double exact_dist;\n\n double distance_to_victim;\n\n double distance_threshold;\n\n double current_loc[2];\n","file_path":"include/victim_localization/victim_wireless_detector.h","rank":36,"score":84630.00228306273},{"content":"class Victim_Map_Wireless: public Victim_Map_Base\n\n{\n\n\n\nprivate:\n\n std::string wireless_polygon_topic=\"polygon_wireless\";\n\n std::string wireless_layer_name=\"victim_wireless\";\n\n grid_map::Polygon wireless_polygon;\n\n Position victim_loc;\n\n\n\n grid_map::GridMap offline_map;\n\n double offline_map_resol;\n\n double detection_threshold;\n\n double wireless_error;\n\n\n\n ros::Publisher pub_map_offline;\n\n\n\npublic:\n\n Victim_Map_Wireless(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\n\n void Update();\n\n void runDetector(){};\n\n void Generate_offline_wireless_map(double error);\n\n void Publish_Offline_Map();\n\n};\n\n\n\n#endif // VICTIM_MAP_WIRELESS_H\n","file_path":"include/victim_localization/victim_map_wireless.h","rank":37,"score":84630.00228306273},{"content":"class victim_map_combined : public Victim_Map_Base\n\n{\n\npublic:\n\n victim_map_combined(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\n\n\n\n\n\n\n\n std::string combinedMap_layer_name=\"victim_fused\";\n\n double alpha;\n\n double beta;\n\n double gama;\n\n\n\n void Update();\n\n void setDroneCommunicator(vehicle_communicator *drone_comm_);\n\n void setVehicle(VehicleControlBase *vehicle);\n\n void setOctomapManager(volumetric_mapping::OctomapManager *manager);\n\n void SetNavMap(nav_msgs::OccupancyGridPtr Nav_map);\n\n void setCurrentPose(geometry_msgs::Pose ps);\n\n\n\n Victim_Map_Base *victim_map_dl_;\n","file_path":"include/victim_localization/victim_map_combined.h","rank":38,"score":84630.00228306273},{"content":"class VehicleControlIrisOrigin : public VehicleControlIris\n\n{\n\npublic:\n\n VehicleControlIrisOrigin();\n\n\n\n void setOffboardState();\n\n //void moveVehicle(double threshold_sensitivity);\n\n\n\n geometry_msgs::Pose transformSetpoint2Global (const geometry_msgs::Pose p_set);\n\n geometry_msgs::Pose transformGlobal2Setpoint (const geometry_msgs::Pose p_global);\n\n};\n\n\n\n#endif // VEHICLE_CONTROL_IRIS_ORIGIN_H\n","file_path":"include/control/vehicle_control_iris_origin.h","rank":39,"score":82990.65617335825},{"content":"class VehicleControlFloatingSensor : public VehicleControlBase\n\n{\n\nprivate:\n\n ros::Subscriber sub_pose;\n\n ros::Publisher pub_pose;\n\n ros::Publisher pub_twist;\n\n\n\n double speed_;\n\n double time_to_target_;\n\n geometry_msgs::Twist twist_;\n\n\n\npublic:\n\n VehicleControlFloatingSensor();\n\n\n\n void callbackPose(const geometry_msgs::PoseStamped& pose_msg);\n\n\n\n bool isReady();\n\n bool isSationary(double threshold_sensitivity = 1);\n\n void moveVehicle(double threshold_sensitivity = 1);\n\n void FollowPath(double threshold_sensitivity = 1);\n","file_path":"include/control/vehicle_control_floating_sensor.h","rank":40,"score":82990.65617335825},{"content":"\n\n std::string methodName(void);\n\n bool GeneratePath(geometry_msgs::Pose end, nav_msgs::Path &Path);\n\n bool GeneratePath(geometry_msgs::Pose end, std::vector<geometry_msgs::Pose> &Path);\n\n\n\n void SetDynamicGridSize(double x, double y,double z);\n\n void SetOriginPose(double x, double y,double z);\n\n\n\n void start();\n\n\n\n};\n\n\n\n#endif // REACTIVEPATHPLANNER_H\n","file_path":"include/victim_localization/reactive_path_planner.h","rank":41,"score":81982.45771064873},{"content":"#ifndef REACTIVEPATHPLANNER_H\n\n#define REACTIVEPATHPLANNER_H\n\n\n\n#include <ros/ros.h>\n\n#include \"sspp/pathplanner.h\"\n\n\n\n#include <ros/package.h>\n\n#include <geometry_msgs/Pose.h>\n\n#include <geometry_msgs/PoseArray.h>\n\n\n\n#include \"sspp/distance_heuristic.h\"\n\n#include \"rviz_visual_tools/rviz_visual_tools.h\"\n\n#include <octomap_world/octomap_manager.h>\n\n#include <pcl_conversions/pcl_conversions.h>\n\n#include <sspp/sspp_srv.h>\n\n#include <geometry_msgs/PoseStamped.h>\n\n#include <geometry_msgs/Pose.h>\n\n#include \"victim_localization/reactive_planner_server.h\"\n\n#include \"victim_localization/navigation_base.h\"\n\n#include \"nav_msgs/Path.h\"\n\n\n","file_path":"include/victim_localization/reactive_path_planner.h","rank":42,"score":81976.58611336035},{"content":"class TerminationCheckMaxProbability: public TerminationCheckBase\n\n{\n\npublic:\n\n TerminationCheckMaxProbability();\n\n bool isTerminated();\n\n\n\nprotected:\n\n double max_probablity;\n\n};\n\n\n\n#endif // TERMINATION_CHECK_MAX_PROBABILITY_H\n","file_path":"include/victim_localization/termination_check_max_probability.h","rank":43,"score":81429.11506054642},{"content":"class view_generator_ig_frontier: public view_generator_IG\n\n{\n\npublic:\n\n double frontier_yaw_res_;\n\n void setvictimmap(grid_map::GridMap *map,std::string layer_name);\n\n bool setYawtoViewpoint(geometry_msgs::Pose Frontier, Index index_, std::vector<geometry_msgs::Pose> &Frontier_with_yaws);\n\n bool IsPointingtoUnkown(double yaw, Index index_);\n\n\n\n ros::NodeHandle nh_;\n\n ros::Publisher pub_Nav_map;\n\n void publish_Map(grid_map::GridMap Map);\n\n grid_map::GridMap Victim_Nav_map;\n\n std::string Nav_map_layer;\n\n double x_arena_max;\n\n double y_arena_max;\n\n int pointing_to_unknown;\n\n double pointing_to_unknown_threshold;\n\n bool IsWithinCostmap(double x1,double x2);\n\n bool isPreviouslyRejected(geometry_msgs::Pose p);\n\n\n","file_path":"include/victim_localization/view_generator_ig_frontier.h","rank":44,"score":81429.11506054642},{"content":"class TerminationCheckMaxIterations: public TerminationCheckBase\n\n{\n\npublic:\n\n TerminationCheckMaxIterations();\n\n bool isTerminated();\n\n\n\nprotected:\n\n int max_iterations_;\n\n double max_probablity;\n\n\n\n};\n\n\n\n#endif // TERMINATION_CHECK_MAX_ITERATIONS_H\n","file_path":"include/victim_localization/termination_check_max_iterations.h","rank":45,"score":81429.11506054642},{"content":"class view_evaluator_log_reward : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_log_reward();\n\n\n\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\n\n std::string getMethodName();\n\n\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_LOG_H\n","file_path":"include/victim_localization/view_evaluator_log_reward.h","rank":46,"score":81429.11506054642},{"content":"class view_evaluator_ig_exp : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_ig_exp();\n\n\n\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateCombinedUtility(geometry_msgs::Pose p,double &new_cell_percentage);\n\n\n\n\n\n std::string getMethodName();\n\n double w_dist_;\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_IG_EXP_H\n","file_path":"include/victim_localization/view_evaluator_ig_exp.h","rank":47,"score":81429.11506054642},{"content":"class view_evaluator_MaxSUM : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_MaxSUM();\n\n\n\n void evaluate();\n\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\n\n std::string getMethodName();\n\n\n\n};\n\n#endif // VIEW_EVALUATOR_MAX_SUM_H\n","file_path":"include/victim_localization/view_evaluator_max_sum.h","rank":48,"score":81429.11506054642},{"content":"class view_evaluator_weighted_max : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_weighted_max();\n\n\n\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\n\n void calculateIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max);\n\n void calculateWirelessIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max);\n\n void evaluate();\n\n void evaluateWireless();\n\n void evaluateCombined();\n\n\n\n\n\n std::string getMethodName();\n\n std::vector<geometry_msgs::Pose> Info_poses;\n\n std::vector<double> Info_View_utilities;\n\n std::vector<double> Info_View_Max;\n\n std::vector<double> Info_WirelessDiection;\n\n\n\n\n","file_path":"include/victim_localization/view_evaluator_weighted_max.h","rank":49,"score":81429.11506054642},{"content":"class view_evaluator_MaxMax : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_MaxMax();\n\n\n\n\n\n double GetMAXANDCOUNT(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &max, double &max_count, double &new_cell_percentage);\n\n double GetMAXANDCOUNTWIRELESS(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &max, double &max_count,double &new_cell_percentage);\n\n double GetMAXANDCOUNCombined(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &max, double &max_count, double &new_cell_percentage);\n\n void evaluate();\n\n void evaluateCombined();\n\n void evaluateWireless();\n\n\n\n\n\n std::string getMethodName();\n\n std::vector<double> Info_View_max;\n\n std::vector<double> Info_View_max_count;\n\n std::vector<double> Info_WirelessDiection;\n\n std::vector<geometry_msgs::Pose> Info_poses;\n\n std::vector<double> Info_New_cellsPercentage;\n\n\n\n\n\nprivate:\n\n double max_belief;\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_MAX_MAX_H\n","file_path":"include/victim_localization/view_evaluator_max_max.h","rank":50,"score":81429.11506054642},{"content":"class view_evaluator_MinNEIGH : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_MinNEIGH();\n\n\n\n void evaluate();\n\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\n\n std::string getMethodName();\n\n\n\nprivate:\n\n double min_belief;\n\n double max_belief;\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_MIN_NEIGH_H\n","file_path":"include/victim_localization/view_evaluator_min_neigh.h","rank":51,"score":81429.11506054642},{"content":"class view_evaluator_MaxMIN : public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_MaxMIN();\n\n\n\n void evaluate();\n\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\n\n std::string getMethodName();\n\n\n\nprivate:\n\n double min_belief;\n\n\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_MAX_MIN_H\n","file_path":"include/victim_localization/view_evaluator_max_min.h","rank":52,"score":81429.11506054642},{"content":" class FrustumCullingTT : public FilterIndices<pcl::PointXYZ>\n\n {\n\n typedef typename Filter<pcl::PointXYZ>::PointCloud PointCloud;\n\n typedef typename PointCloud::Ptr PointCloudPtr;\n\n typedef typename PointCloud::ConstPtr PointCloudConstPtr;\n\n\n\n public:\n\n\n\n typedef boost::shared_ptr< FrustumCullingTT> Ptr;\n\n typedef boost::shared_ptr< const FrustumCullingTT > ConstPtr;\n\n\n\n\n\n using Filter<pcl::PointXYZ>::getClassName;\n\n\n\n FrustumCullingTT (bool extract_removed_indices = false)\n\n : FilterIndices<pcl::PointXYZ>::FilterIndices (extract_removed_indices)\n\n , camera_pose_ (Eigen::Matrix4f::Identity ())\n\n , hfov_ (60.0f)\n\n , vfov_ (60.0f)\n\n , np_dist_ (0.1f)\n","file_path":"include/culling/frustum_culling.h","rank":53,"score":80704.4253286197},{"content":"class view_generator_ig_nn_adaptive : public view_generator_IG\n\n{\n\npublic:\n\n view_generator_ig_nn_adaptive();\n\n virtual void generateViews();\n\n std::string getMethodName();\n\n double scale_factor_;\n\n double scale_multiplier_;\n\n\n\n\n\nprivate:\n\n int minima_iterations_;\n\n double minima_threshold_;\n\n bool isStuckInLocalMinima();\n\n bool IsPreviouslyCheckedSamples(double i_x,double i_y);\n\n bool do_adaptive_generation;\n\n double entropy_max;\n\n double new_cell_percentage_threshold;\n\n double current_percentage;\n\n double new_cell_percentage_threshold_respawn;\n\n double new_cell_percentage_Iteration;\n\n bool new_cell_status;\n\n bool new_cell_status_stop;\n\n\n\n\n\n};\n\n\n\n#endif // VIEW_GENERATOR_IG_NN_ADAPTIVE_H\n","file_path":"include/victim_localization/view_generator_ig_nn_adaptive.h","rank":54,"score":78518.29551983727},{"content":"class view_evaluator_ig_exp_max: public view_evaluator_base\n\n{\n\npublic:\n\n view_evaluator_ig_exp_max();\n\n\n\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n\n\n std::string getMethodName();\n\n\n\nprivate:\n\n double w_dist_;\n\n double calculateIGMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\n\n double calculateWirelessIGMAX(geometry_msgs::Pose p, Victim_Map_Base *mapping_module , double &new_cell_percentage);\n\n};\n\n\n\n#endif // VIEW_EVALUATOR_IG_EXP_MAX_H\n","file_path":"include/victim_localization/view_evaluator_ig_exp_max.h","rank":55,"score":78518.29551983727},{"content":"/*\n\n * Academic License - for use in teaching, academic research, and meeting\n\n * course requirements at degree granting institutions only. Not for\n\n * government, commercial, or other organizational use.\n\n * File: rtGetNaN.cpp\n\n *\n\n * MATLAB Coder version : 3.2\n\n * C/C++ source code generated on : 05-Feb-2018 03:23:30\n\n */\n\n\n\n/*\n\n * Abstract:\n\n * MATLAB for code generation function to initialize non-finite, NaN\n\n */\n\n#include \"rtGetNaN.h\"\n\n#define NumBitsPerChar 8U\n\n\n\n/* Function: rtGetNaN ==================================================\n\n * Abstract:\n\n * Initialize rtNaN needed by the generated code.\n","file_path":"include/RSSmodel2/rtGetNaN.cpp","rank":56,"score":77299.27514181833},{"content":" switch (machByteOrder) {\n\n case LittleEndian:\n\n {\n\n nanF.wordL.wordLuint = 0xFFC00000U;\n\n break;\n\n }\n\n\n\n case BigEndian:\n\n {\n\n nanF.wordL.wordLuint = 0x7FFFFFFFU;\n\n break;\n\n }\n\n }\n\n\n\n return nanF.wordL.wordLreal;\n\n}\n\n\n\n/*\n\n * File trailer for rtGetNaN.cpp\n\n *\n\n * [EOF]\n\n */\n","file_path":"include/RSSmodel2/rtGetNaN.cpp","rank":57,"score":77290.36283923745},{"content":" * NaN is initialized as non-signaling. Assumes IEEE.\n\n */\n\nreal_T rtGetNaN(void)\n\n{\n\n size_t bitsPerReal = sizeof(real_T) * (NumBitsPerChar);\n\n real_T nan = 0.0;\n\n if (bitsPerReal == 32U) {\n\n nan = rtGetNaNF();\n\n } else {\n\n uint16_T one = 1U;\n\n enum {\n\n LittleEndian,\n\n BigEndian\n\n } machByteOrder = (*((uint8_T *) &one) == 1U) ? LittleEndian : BigEndian;\n\n switch (machByteOrder) {\n\n case LittleEndian:\n\n {\n\n union {\n\n LittleEndianIEEEDouble bitVal;\n\n real_T fltVal;\n","file_path":"include/RSSmodel2/rtGetNaN.cpp","rank":58,"score":77290.03433129114},{"content":" }\n\n }\n\n\n\n return nan;\n\n}\n\n\n\n/* Function: rtGetNaNF ==================================================\n\n * Abstract:\n\n * Initialize rtNaNF needed by the generated code.\n\n * NaN is initialized as non-signaling. Assumes IEEE.\n\n */\n\nreal32_T rtGetNaNF(void)\n\n{\n\n IEEESingle nanF = { { 0 } };\n\n\n\n uint16_T one = 1U;\n\n enum {\n\n LittleEndian,\n\n BigEndian\n\n } machByteOrder = (*((uint8_T *) &one) == 1U) ? LittleEndian : BigEndian;\n","file_path":"include/RSSmodel2/rtGetNaN.cpp","rank":59,"score":77289.74857983881},{"content":" } tmpVal;\n\n\n\n tmpVal.bitVal.words.wordH = 0xFFF80000U;\n\n tmpVal.bitVal.words.wordL = 0x00000000U;\n\n nan = tmpVal.fltVal;\n\n break;\n\n }\n\n\n\n case BigEndian:\n\n {\n\n union {\n\n BigEndianIEEEDouble bitVal;\n\n real_T fltVal;\n\n } tmpVal;\n\n\n\n tmpVal.bitVal.words.wordH = 0x7FFFFFFFU;\n\n tmpVal.bitVal.words.wordL = 0xFFFFFFFFU;\n\n nan = tmpVal.fltVal;\n\n break;\n\n }\n","file_path":"include/RSSmodel2/rtGetNaN.cpp","rank":60,"score":77287.14275215888},{"content":"class view_generator_ig_adaptive_frontier : public view_generator_ig_frontier\n\n{\n\npublic:\n\n view_generator_ig_adaptive_frontier();\n\n\n\n void generateViews(); //viewpoints is generated at current pose\n\n std::string getMethodName();\n\n void resetScaleFactor();\n\n void setSampleResolution(double resX, double resY);\n\n\n\n\n\n //visualize\n\n double scale_factor_;\n\n double scale_multiplier_;\n\n\n\nprivate:\n\n int minima_iterations_;\n\n double minima_threshold_;\n\n int adaptive_ig_max_iteration_;\n\n int adaptive_iteration_;\n\n bool isStuckInLocalMinima();\n\n\n\n};\n\n\n\n#endif // VIEW_GENERATOR_IG_ADAPTIVE_FRONTIER_H\n","file_path":"include/victim_localization/view_generator_ig_adaptive_frontier.h","rank":61,"score":77159.6124259931},{"content":"extern real_T rtGetNaN(void);\n","file_path":"include/RSSmodel2/rtGetNaN.h","rank":62,"score":74879.14091574417},{"content":" class VoxelGridOcclusionEstimationT: public VoxelGrid<pcl::PointXYZ>\n\n {\n\n protected:\n\n using VoxelGrid<pcl::PointXYZ>::min_b_;\n\n using VoxelGrid<pcl::PointXYZ>::max_b_;\n\n using VoxelGrid<pcl::PointXYZ>::div_b_;\n\n using VoxelGrid<pcl::PointXYZ>::leaf_size_;\n\n using VoxelGrid<pcl::PointXYZ>::inverse_leaf_size_;\n\n\n\n typedef typename Filter<pcl::PointXYZ>::PointCloud PointCloud;\n\n typedef typename PointCloud::Ptr PointCloudPtr;\n\n typedef typename PointCloud::ConstPtr PointCloudConstPtr;\n\n\n\n public:\n\n /** \\brief Empty constructor. */\n\n VoxelGridOcclusionEstimationT ()\n\n {\n\n initialized_ = false;\n\n this->setSaveLeafLayout (true);\n\n }\n","file_path":"include/culling/voxel_grid_occlusion_estimation.h","rank":63,"score":74592.71856539424},{"content":" class VoxelGridOcclusionEstimationT: public VoxelGrid<pcl::PointXYZ>\n\n {\n\n protected:\n\n using VoxelGrid<pcl::PointXYZ>::min_b_;\n\n using VoxelGrid<pcl::PointXYZ>::max_b_;\n\n using VoxelGrid<pcl::PointXYZ>::div_b_;\n\n using VoxelGrid<pcl::PointXYZ>::leaf_size_;\n\n using VoxelGrid<pcl::PointXYZ>::inverse_leaf_size_;\n\n\n\n typedef typename Filter<pcl::PointXYZ>::PointCloud PointCloud;\n\n typedef typename PointCloud::Ptr PointCloudPtr;\n\n typedef typename PointCloud::ConstPtr PointCloudConstPtr;\n\n\n\n public:\n\n /** \\brief Empty constructor. */\n\n VoxelGridOcclusionEstimationT ()\n\n {\n\n initialized_ = false;\n\n this->setSaveLeafLayout (true);\n\n }\n","file_path":"include/component_test/voxel_grid_occlusion_estimation.h","rank":64,"score":73234.03547155007},{"content":" uint32_T wordH;\n","file_path":"include/RSSmodel2/rt_nonfinite.h","rank":65,"score":69421.64076384345},{"content":"extern boolean_T rtIsNaN(real_T value);\n","file_path":"include/RSSmodel2/rt_nonfinite.h","rank":66,"score":67656.04280728946},{"content":"extern real_T rtNaN;\n","file_path":"include/RSSmodel2/rt_nonfinite.h","rank":67,"score":67656.04280728946},{"content":"extern void rt_InitInfAndNaN(size_t realSize);\n","file_path":"include/RSSmodel2/rt_nonfinite.h","rank":68,"score":64445.01972361658},{"content":"extern real32_T rtGetNaNF(void);\n","file_path":"include/RSSmodel2/rtGetNaN.h","rank":69,"score":62951.15745106927},{"content":"#include \"victim_localization/reactive_path_planner.h\"\n\n\n\n\n\nReactivePathPlanner::ReactivePathPlanner(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager):\n\nnh_(nh),\n\nnh_private_(nh_private),\n\nmanager_(manager),\n\nnavigationBase()\n\n{\n\n}\n\n\n\nbool ReactivePathPlanner::GeneratePath(geometry_msgs::Pose end, nav_msgs::Path &Path)\n\n{\n\n if (getDistance(current_pose_,end)< d_close) // terminate if the end pose is at the robot current pose\n\n return false;\n\n\n\n std::cout << \"calling the service\" << std::endl;\n\n\n\n if (manager_ == NULL) {\n\n ROS_ERROR_THROTTLE(1, \"Planner not set up: No octomap available!\");\n","file_path":"src/reactive_path_planner.cpp","rank":70,"score":43996.853961453},{"content":" return false;\n\n\n\n if (manager_ == NULL) {\n\n ROS_ERROR_THROTTLE(1, \"Planner not set up: No octomap available!\");\n\n return false;\n\n }\n\n\n\n ROS_INFO(\"Executing the Reactive Planner\");\n\n\n\n if(reactivePlannerServer->PathGeneration(current_pose_,end,Path))\n\n {\n\n return true;\n\n }\n\n else\n\n {\n\n std::cout << cc.red << \"Planner Failed to generate planne... Skipping Navigation \\n\" << cc.reset;\n\n return false;\n\n }\n\n}\n\nstd::string ReactivePathPlanner::methodName(void)\n","file_path":"src/reactive_path_planner.cpp","rank":71,"score":43994.24560127945},{"content":"{\n\n methodName_=\"ReactivePathPlanner\";\n\n return methodName_;\n\n}\n\n\n\nvoid ReactivePathPlanner::start()\n\n\n\n{\n\n //initiate the reactive planner service\n\n reactivePlannerServer= new ReactivePlannerServer(nh_,nh_private_,manager_);\n\n}\n\n\n\nvoid ReactivePathPlanner::SetDynamicGridSize(double x, double y, double z)\n\n{\n\n reactivePlannerServer->SetDynamicGridSize(x,y,z);\n\n}\n\n\n\nvoid ReactivePathPlanner::SetOriginPose(double x, double y, double z)\n\n{\n\n reactivePlannerServer->SetOriginPose(x,y,z);\n\n}\n","file_path":"src/reactive_path_planner.cpp","rank":72,"score":43992.01995055516},{"content":" return false;\n\n }\n\n\n\n ROS_INFO(\"Executing the Planner Loop...\");\n\n\n\n if(reactivePlannerServer->PathGeneration(current_pose_,end,Path))\n\n {\n\n return true;\n\n }\n\n else\n\n {\n\n ROS_INFO(\"No Path Found or planner not ready!\");\n\n return false;\n\n }\n\n\n\n}\n\n\n\nbool ReactivePathPlanner::GeneratePath(geometry_msgs::Pose end,std::vector<geometry_msgs::Pose> &Path)\n\n{\n\n if (getDistance(current_pose_,end)< d_close) // terminate if the end pose is at the robot current pose\n","file_path":"src/reactive_path_planner.cpp","rank":73,"score":43991.300300336115},{"content":" void callbackCommandStatus(const std_msgs::Bool::ConstPtr& msg);\n\n bool GetStatus();\n\n\n\n ros::Time previous_time;\n\n\n\n bool Execute_waypoint(geometry_msgs::Pose p);\n\n bool Execute_path(nav_msgs::Path path);\n\n bool Execute_path(std::vector<geometry_msgs::Pose> path);\n\n\n\n};\n\n\n\n#endif // DRONE_COMMUNICATOR_H\n","file_path":"include/control/vehicle_communicator.h","rank":74,"score":41851.87826607616},{"content":"\n\n double sensor_max_range,visualize_max_z,visualize_min_z,map_publish_frequency;\n\n bool treat_unknown_as_occupied;\n\n\n\npublic:\n\n\n\n void update();\n\n double compute2DRelativeRays();\n\n void compute2DRaysAtPose(geometry_msgs::Pose p);\n\n virtual void Initiate(bool publish, bool rebuild_once=false);\n\n void Done();\n\n\n\n\n\n};\n\n\n\n#endif // RAY_TRACING_2D_H\n","file_path":"include/victim_localization/raytracing_2d.h","rank":75,"score":41851.051509419085},{"content":" void setOctomapManager(volumetric_mapping::OctomapManager *manager);\n\n void publish_Map(grid_map::GridMap Map);\n\n void SetNavMap(nav_msgs::OccupancyGridPtr Nav_map);\n\n virtual void update();\n\n virtual void Initiate(bool publish, bool rebuild_once=false){};\n\n virtual void Done(){};\n\n\n\n};\n\n\n\n#endif // RAY_TRACING_H\n","file_path":"include/victim_localization/raytracing.h","rank":76,"score":41850.79250174356},{"content":"#ifndef IRIS_DRONE_COMMANDER_H\n\n#define IRIS_DRONE_COMMANDER_H\n\n\n\n#include \"control/vehicle_control_iris.h\"\n\n#include \"control/vehicle_control_iris_origin.h\"\n\n#include \"control/vehicle_control_floating_sensor.h\"\n\n#include \"std_msgs/Bool.h\"\n\n#include \"std_msgs/Int32.h\"\n\n#include \"victim_localization/rotate_action.h\"\n\n#include \"victim_localization/waypoint_action.h\"\n\n#include \"victim_localization/path_action.h\"\n\n#include \"victim_localization/path2_action.h\"\n\n#include \"victim_localization/status_action.h\"\n\n\n\nnamespace Command {\n","file_path":"include/control/vehicle_commander.h","rank":77,"score":41850.06269692413},{"content":"#ifndef DRONE_COMMUNICATOR_H\n\n#define DRONE_COMMUNICATOR_H\n\n\n\n#include \"control/vehicle_control_iris.h\"\n\n#include \"std_msgs/Bool.h\"\n\n#include \"std_msgs/Int32.h\"\n\n#include \"victim_localization/volumetric_map_manager.h\"\n\n#include \"victim_localization/rotate_action.h\"\n\n#include \"victim_localization/path_action.h\"\n\n#include \"victim_localization/path2_action.h\"\n\n#include \"victim_localization/waypoint_action.h\"\n\n#include \"victim_localization/status_action.h\"\n\n#include \"rviz_visual_tools/rviz_visual_tools.h\"\n\n#include \"vehicle_control_base.h\"\n\n\n\n\n\n\n\nnamespace Command {\n","file_path":"include/control/vehicle_communicator.h","rank":78,"score":41849.93465785261},{"content":"\n\n ros::ServiceServer service_rotation;\n\n ros::ServiceServer service_waypoint;\n\n ros::ServiceServer service_path;\n\n ros::ServiceServer service_path2;\n\n ros::ServiceServer service_status;\n\n void Takeoff();\n\n void rotate();\n\n void start();\n\n bool execute_rotation(victim_localization::rotate_action::Request &request,\n\n victim_localization::rotate_action::Response &respond);\n\n\n\n bool execute_waypoint(victim_localization::waypoint_action::Request &request,\n\n victim_localization::waypoint_action::Response &respond);\n\n\n\n bool execute_path(victim_localization::path_action::Request &request,\n\n victim_localization::path_action::Response &respond);\n\n\n\n bool execute_path2(victim_localization::path2_action::Request &request,\n\n victim_localization::path2_action::Response &respond);\n\n\n\n bool check_status(victim_localization::status_action::Request &request,\n\n victim_localization::status_action::Response &respond);\n\n\n\n};\n\n\n\n#endif // IRIS_DRONE_COMMANDER_H\n","file_path":"include/control/vehicle_commander.h","rank":79,"score":41849.71436329802},{"content":"#ifndef RAY_TRACING_2D_H\n\n#define RAY_TRACING_2D_H\n\n\n\n#include <victim_localization/raytracing.h>\n\n\n\n\n\ntypedef geometry_msgs::Point Point;\n\ntypedef geometry_msgs::PoseStamped PoseStamped;\n\n\n\nusing namespace grid_map;\n\nusing namespace volumetric_mapping;\n\n\n\n\n\n\n","file_path":"include/victim_localization/raytracing_2d.h","rank":80,"score":41846.849783215774},{"content":"\n\n void Publish2DOctomap();\n\n void updateOctomapOccupancy(octomap::KeySet* free_cells,\n\n octomap::KeySet* occupied_cells);\n\n void ResetOctomapRebuild();\n\n\n\n grid_map::GridMap Generate_2D_Safe_Plane(geometry_msgs::Pose p, bool publish_=false, bool castThroughUnkown=true);\n\n\n\n void publish_Map2(GridMap Map);\n\n\n\n // Publish markers for visualization.\n\n ros::Publisher occupied_nodes_pub_;\n\n ros::Publisher free_nodes_pub_;\n\n ros::Publisher pub_temp_map1;\n\n\n\n grid_map::GridMap map_;\n\n std::shared_ptr<octomap::OcTree> octree_2d;\n\n bool rebuild_octomap_once;\n\n double octomap_height;\n\n bool rebuild_octomap_;\n","file_path":"include/victim_localization/raytracing_2d.h","rank":81,"score":41845.88665878092},{"content":"\n\n victim_localization::rotate_action rotate_srv;\n\n victim_localization::waypoint_action waypoint_srv;\n\n victim_localization::path_action path_srv;\n\n victim_localization::path2_action path2_srv;\n\n victim_localization::status_action status_srv;\n\n\n\n geometry_msgs::Pose Waypoint_;\n\n nav_msgs::Path Path_;\n\n\n\n geometry_msgs::Pose current_pose;\n\n\n\n bool current_drone_status;\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\n\n\n\n\n\n geometry_msgs::Pose GetPose();\n\n void Check_MapManager_and_Drone_Ready();\n\n void callbackPose(const geometry_msgs::PoseStamped::ConstPtr& msg);\n","file_path":"include/control/vehicle_communicator.h","rank":82,"score":41845.228360274916},{"content":"#ifndef TimeProfiler_H\n\n#define TimeProfiler_H\n\n\n\n#include <iostream>\n\n#include <sstream>\n\n#include <chrono>\n\n#include <fstream>\n\n#include <map>\n\n\n","file_path":"include/utilities/time_profiler.h","rank":83,"score":41844.31264730584},{"content":"/*\n\n * Software License Agreement (BSD License)\n\n *\n\n * Point Cloud Library (PCL) - www.pointclouds.org\n\n * Copyright (c) 2012-, Open Perception, Inc.\n\n *\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of the copyright holder(s) nor the names of its\n\n * contributors may be used to endorse or promote products derived\n","file_path":"include/culling/frustum_culling.h","rank":84,"score":41843.9161063502},{"content":"#ifndef OCCLUSION_H_\n\n#define OCCLUSION_H_\n\n\n\n#include <iostream>\n\n\n\n#include \"ros/ros.h\"\n\n#include <ros/package.h>\n\n\n\n#include <eigen_conversions/eigen_msg.h>\n\n#include <Eigen/Geometry>\n\n#include <Eigen/Dense>\n\n\n\n#include <geometry_msgs/Pose.h>\n\n\n\n#include <pcl/io/pcd_io.h>\n\n#include <pcl/point_types.h>\n\n#include <pcl_conversions/pcl_conversions.h>\n\n#include <pcl/common/eigen.h>\n\n#include <pcl/common/transforms.h>\n\n#include <pcl/range_image/range_image.h>\n","file_path":"include/culling/occlusion_culling.h","rank":85,"score":41843.68700035304},{"content":"#ifndef RAY_TRACING_H\n\n#define RAY_TRACING_H\n\n\n\n#include <ros/ros.h>\n\n#include <grid_map_ros/grid_map_ros.hpp>\n\n#include <grid_map_msgs/GridMap.h>\n\n#include <cmath>\n\n#include \"math.h\"\n\n#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n#include \"geometry_msgs/PointStamped.h\"\n\n#include <boost/filesystem.hpp>\n\n#include <boost/shared_ptr.hpp>\n\n#include <boost/array.hpp>\n\n#include <sensor_msgs/PointCloud.h>\n\n#include \"victim_localization/common.h\"\n\n#include <octomap_world/octomap_manager.h>\n\n#include <visualization_msgs/Marker.h>\n\n#include <std_msgs/Float32.h>\n","file_path":"include/victim_localization/raytracing.h","rank":86,"score":41843.39880571366},{"content":"#ifndef STRAIGHTLINE_H\n\n#define STRAIGHTLINE_H\n\n\n\n#include \"victim_localization/navigation_base.h\"\n\n\n\n\n","file_path":"include/victim_localization/straightline.h","rank":87,"score":41843.11924793462},{"content":" * from this software without specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *\n\n */\n\n\n\n#include <pcl/point_types.h>\n\n#include <pcl/filters/filter_indices.h>\n\n#include <pcl/common/transforms.h>\n","file_path":"include/culling/frustum_culling.h","rank":88,"score":41842.61458308899},{"content":"#include <tf_conversions/tf_eigen.h>\n\n#include <tf/transform_listener.h>\n\n#include <Eigen/Geometry>\n\n#include <victim_localization/view_generator_ig.h>\n\n#include <control/vehicle_communicator.h>\n\n\n\n\n\ntypedef geometry_msgs::Point Point;\n\ntypedef geometry_msgs::PoseStamped PoseStamped;\n\n\n\nusing namespace grid_map;\n\n\n","file_path":"include/victim_localization/raytracing.h","rank":89,"score":41842.597346839575},{"content":"\n\nRaytracing(double map_res_);\n\nRaytracing(double map_res_, double HFOV_deg, double VFOV_deg, double max_d, double min_d);\n\n~Raytracing();\n\n\n\nvoid setCameraSettings(double fov_h, double fov_v, double r_max, double r_min);\n\nbool isInsideBounds(Position p);\n\n\n\npublic:\n\n\n\n bool isPointInBounds(octomap::point3d &p);\n\n void getCameraRotationMtxs();\n\n double getNodeOccupancy(octomap::OcTreeNode* node);\n\n double getNodeEntropy(octomap::OcTreeNode* node);\n\n int getPointCountAtOcTreeKey(octomap::OcTreeKey key);\n\n double computeRelativeRays();\n\n void computeRaysAtPose(geometry_msgs::Pose p);\n\n bool isInsideRegionofInterest(double z , double tolerance=0.3);\n\n void setDroneCommunicator(vehicle_communicator *drone_comm_);\n\n void setVehicle(VehicleControlBase *vehicle_);\n","file_path":"include/victim_localization/raytracing.h","rank":90,"score":41842.31191373775},{"content":"\n\n#include <sensor_msgs/PointCloud2.h>\n\n\n\n#include <tf/tf.h>\n\n#include <tf_conversions/tf_eigen.h>\n\n\n\n#include <visualization_msgs/Marker.h>\n\n#include <visualization_msgs/MarkerArray.h>\n\n\n\n// Custom classes\n\n#include <culling/frustum_culling.h>\n\n#include <culling/voxel_grid_occlusion_estimation.h>\n\n\n","file_path":"include/culling/occlusion_culling.h","rank":91,"score":41838.98224228825},{"content":" Eigen::Vector3f fp_tl;\n\n Eigen::Vector3f fp_tr;\n\n Eigen::Vector3f fp_bl;\n\n Eigen::Vector3f fp_br;\n\n \n\n Eigen::Vector3f np_tr;\n\n Eigen::Vector3f np_bl;\n\n Eigen::Vector3f np_br;\n\n Eigen::Vector3f np_tl;\n\n protected:\n\n using PCLBase<pcl::PointXYZ>::input_;\n\n using PCLBase<pcl::PointXYZ>::indices_;\n\n using Filter<pcl::PointXYZ>::filter_name_;\n\n using FilterIndices<pcl::PointXYZ>::negative_;\n\n using FilterIndices<pcl::PointXYZ>::keep_organized_;\n\n using FilterIndices<pcl::PointXYZ>::user_filter_value_;\n\n using FilterIndices<pcl::PointXYZ>::extract_removed_indices_;\n\n using FilterIndices<pcl::PointXYZ>::removed_indices_;\n\n\n\n /** \\brief Sample of point indices into a separate PointCloud\n","file_path":"include/culling/frustum_culling.h","rank":92,"score":41838.62564268653},{"content":" * fc.setCameraPose (pose_new);\n\n * \\endcode\n\n */\n\n void \n\n setCameraPose (const Eigen::Matrix4f& camera_pose)\n\n {\n\n camera_pose_ = camera_pose;\n\n }\n\n\n\n /** \\brief Get the pose of the camera w.r.t the origin */\n\n Eigen::Matrix4f\n\n getCameraPose () const\n\n {\n\n return (camera_pose_);\n\n }\n\n\n\n /** \\brief Set the horizontal field of view for the camera in degrees\n\n * \\param[in] hfov the field of view\n\n */\n\n void \n","file_path":"include/culling/frustum_culling.h","rank":93,"score":41837.58807951584},{"content":" double y_arena_max;\n\n std::string camera_optical_frame;\n\n std::string base_frame;\n\n double tree_resolution;\n\n Eigen::Matrix3d camera_rotation_mtx_; // Camera rotation mtx\n\n double map_res;\n\n bool publish_ray_;\n\n ros::Publisher pub_temp_map;\n\n ros::NodeHandle nh_;\n\n\n\n\n\nstd::vector<Eigen::Vector3d> rays_far_plane_;\n\nstd::vector<octomap::point3d> rays_far_plane_at_pose_;\n\n\n\ndouble nav_bounds_x_max_, nav_bounds_y_max_, nav_bounds_z_max_;\n\ndouble nav_bounds_x_min_, nav_bounds_y_min_, nav_bounds_z_min_;\n\ndouble uav_fixed_height_;\n\n\n\nvirtual grid_map::GridMap Generate_2D_Safe_Plane(geometry_msgs::Pose p, bool publish_=false, bool castThroughUnkown=true);\n\n\n","file_path":"include/victim_localization/raytracing.h","rank":94,"score":41837.49455963446},{"content":" * \\param[out] output the resultant point cloud\n\n */\n\n void\n\n applyFilter (PointCloud &output);\n\n\n\n /** \\brief Sample of point indices\n\n * \\param[out] indices the resultant point cloud indices\n\n */\n\n void\n\n applyFilter (std::vector<int> &indices);\n\n\n\n private:\n\n\n\n /** \\brief The camera pose */\n\n Eigen::Matrix4f camera_pose_;\n\n /** \\brief Horizontal field of view */\n\n float hfov_;\n\n /** \\brief Vertical field of view */\n\n float vfov_;\n\n /** \\brief Near plane distance */\n\n float np_dist_;\n\n /** \\brief Far plane distance */\n\n float fp_dist_;\n\n\n\n public:\n\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n };\n\n}\n","file_path":"include/culling/frustum_culling.h","rank":95,"score":41837.18983933975},{"content":" Eigen::Vector3i max_b1, min_b1;\n\n visualization_msgs::Marker linesList1,linesList2,linesList3,linesList4;\n\n visualization_msgs::MarkerArray marker_array;\n\n pcl::FrustumCullingTT fc;\n\n double maxAccuracyError, minAccuracyError;\n\n\n\n // >>>>>>>>\n\n // Methods\n\n // >>>>>>>>\n\n //OcclusionCulling();\n\n //OcclusionCulling(std::string modelName);\n\n //OcclusionCulling(ros::NodeHandle & n, std::string modelName);\n\n OcclusionCulling(pcl::PointCloud<pcl::PointXYZ>::Ptr& cloudPtr);\n\n OcclusionCulling(pcl::PointCloud<pcl::PointXYZRGB>::Ptr& cloudPtr);\n\n \n\n ~OcclusionCulling(){};\n\n void initConfig(pcl::PointCloud<pcl::PointXYZ>::Ptr& cloudPtr);\n\n void initConfig(pcl::PointCloud<pcl::PointXYZ>::Ptr& cloudPtr, ros::NodeHandle nodeHandle);\n\n void visualizeRaycast(geometry_msgs::Pose location);\n\n \n","file_path":"include/culling/occlusion_culling.h","rank":96,"score":41837.181081487324},{"content":" setHorizontalFOV (float hfov)\n\n {\n\n hfov_ = hfov;\n\n }\n\n\n\n /** \\brief Get the horizontal field of view for the camera in degrees */\n\n float \n\n getHorizontalFOV () const\n\n {\n\n return (hfov_);\n\n }\n\n\n\n /** \\brief Set the vertical field of view for the camera in degrees\n\n * \\param[in] vfov the field of view\n\n */\n\n void \n\n setVerticalFOV (float vfov)\n\n {\n\n vfov_ = vfov;\n\n }\n","file_path":"include/culling/frustum_culling.h","rank":97,"score":41836.68338015755},{"content":" {\n\n return (np_dist_);\n\n }\n\n\n\n /** \\brief Set the far plane distance\n\n * \\param[in] fp_dist the far plane distance\n\n */\n\n void \n\n setFarPlaneDistance (float fp_dist)\n\n {\n\n fp_dist_ = fp_dist;\n\n }\n\n\n\n /** \\brief Get the far plane distance */\n\n float \n\n getFarPlaneDistance () const\n\n {\n\n return (fp_dist_);\n\n }\n\n //added part for debuging\n","file_path":"include/culling/frustum_culling.h","rank":98,"score":41836.63492378264}],"string":"[\n {\n \"content\": \"class ReactivePathPlanner : public navigationBase\\n\\n{\\n\\npublic:\\n\\n ReactivePathPlanner(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager);\\n\\n\\n\\n sspp::sspp_srv planningService;\\n\\n ReactivePlannerServer *reactivePlannerServer;\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::NodeHandle nh_private_;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n\\n\\n // ros::ServiceClient clientPath_;\\n\\n\\n\\n double uav_fixed_height;\\n\\n double extensionRange_;\\n\\n double boundingbox_x_;\\n\\n double boundingbox_y_;\\n\\n double boundingbox_z_;\\n\\n double dOvershoot_;\\n\",\n \"file_path\": \"include/victim_localization/reactive_path_planner.h\",\n \"rank\": 0,\n \"score\": 134070.60781306797\n },\n {\n \"content\": \"class Raytracing\\n\\n{\\n\\npublic:\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\\n\\n\\n\\n geometry_msgs::Pose current_pose_;\\n\\n std::shared_ptr<octomap::OcTree> tree_;\\n\\n vehicle_communicator *drone_comm;\\n\\n VehicleControlBase *vehicle;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n\\n\\n nav_msgs::OccupancyGridPtr grid_;\\n\\n\\n\\n std::string Layer_name_;\\n\\n double HFOV_deg;\\n\\n double VFOV_deg;\\n\\n double range_max_;\\n\\n double range_min_;\\n\\n double x_arena_max;\\n\",\n \"file_path\": \"include/victim_localization/raytracing.h\",\n \"rank\": 1,\n \"score\": 108643.92784109377\n },\n {\n \"content\": \"class vehicle_communicator\\n\\n{\\n\\npublic:\\n\\n vehicle_communicator(const ros::NodeHandle& nh, const ros::NodeHandle& nh_private,\\n\\n volumetric_mapping::OctomapManager *mapManager);\\n\\n ros::NodeHandle nh_;\\n\\n ros::NodeHandle nh_private_;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n\\n\\n ros::Publisher pub_waypoint;\\n\\n ros::Publisher pub_path;\\n\\n\\n\\n ros::Subscriber sub_pose;\\n\\n ros::Subscriber sub_command_status;\\n\\n\\n\\n ros::ServiceClient clientExecuteRotation ;\\n\\n ros::ServiceClient clientExecuteWaypoint;\\n\\n ros::ServiceClient clientExecutePath;\\n\\n ros::ServiceClient clientExecutePath2;\\n\\n ros::ServiceClient ClientCheckStatus;\\n\",\n \"file_path\": \"include/control/vehicle_communicator.h\",\n \"rank\": 2,\n \"score\": 106102.28436550131\n },\n {\n \"content\": \"class OcclusionCulling\\n\\n{\\n\\npublic:\\n\\n\\t// >>>>>>>>\\n\\n // Attributes\\n\\n // >>>>>>>>\\n\\n ros::NodeHandle nh;\\n\\n std::string model;\\n\\n // ros::Publisher original_pub;\\n\\n // ros::Publisher visible_pub;\\n\\n ros::Publisher fov_pub;\\n\\n pcl::PointCloud<pcl::PointXYZ>::Ptr cloud;\\n\\n pcl::PointCloud<pcl::PointXYZ>::Ptr filtered_cloud;\\n\\n pcl::PointCloud<pcl::PointXYZ>::Ptr occlusionFreeCloud;//I can add it to accumulate cloud if I want to extract visible surface from multiple locations\\n\\n pcl::PointCloud<pcl::PointXYZ>::Ptr FrustumCloud;//frustum cull\\n\\n\\n\\n pcl::PointCloud<pcl::PointXYZ> FreeCloud;\\n\\n float voxelRes, OriginalVoxelsSize;\\n\\n double id;\\n\\n pcl::VoxelGridOcclusionEstimationT voxelFilterOriginal;\\n\",\n \"file_path\": \"include/culling/occlusion_culling.h\",\n \"rank\": 3,\n \"score\": 106102.28436550131\n },\n {\n \"content\": \"class TimeProfiler {\\n\\n\\n\\n public:\\n\\n struct ProfilerEntry{\\n\\n double min, max, total, avg, last;\\n\\n int count;\\n\\n };\\n\\n\\n\\n TimeProfiler();\\n\\n TimeProfiler(bool b);\\n\\n double getLatestTime(std::string s);\\n\\n void start();\\n\\n void start(std::string s);\\n\\n void toc();\\n\\n void toc(std::string s);\\n\\n void stop();\\n\\n void stop(std::string s);\\n\\n void dump();\\n\\n\\n\\n private:\\n\\n bool verbose;\\n\\n std::map<std::string,std::chrono::steady_clock::time_point> timers;\\n\\n std::map<std::string,ProfilerEntry> entries;\\n\\n\\n\\n std::string getEntryTitle(std::string s);\\n\\n};\\n\\n\\n\\n#endif // TimeProfiler_H\\n\",\n \"file_path\": \"include/utilities/time_profiler.h\",\n \"rank\": 4,\n \"score\": 106102.28436550131\n },\n {\n \"content\": \"class navigationBase\\n\\n{\\n\\npublic:\\n\\n navigationBase();\\n\\n geometry_msgs::Pose current_pose_;\\n\\n\\n\\n\\n\\n double nav_bounds_x_min_;\\n\\n double nav_bounds_y_min_;\\n\\n double nav_bounds_z_min_;\\n\\n double nav_bounds_x_max_;\\n\\n double nav_bounds_y_max_;\\n\\n double nav_bounds_z_max_;\\n\\n double uav_fixed_height;\\n\\n\\n\\n std::string methodName_;\\n\\n double d_close;\\n\\n double getDistance(geometry_msgs::Pose p1, geometry_msgs::Pose p2);\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/navigation_base.h\",\n \"rank\": 5,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class TestNBV\\n\\n{\\n\\n\\n\\n tf::TransformListener tf_;\\n\\npublic:\\n\\n ros::NodeHandle nh;\\n\\n ros::NodeHandle nh_private;\\n\\n ros::Publisher pub_iteration_info;\\n\\n TimeProfiler timer;\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\\n\\n ros::Time StartTimeForNBV;\\n\\n\\n\\n\\n\\n vehicle_communicator *drone_communicator_;\\n\\n VehicleControlBase *vehicle_;\\n\\n Victim_Map_Base *Map_;\\n\\n nbv_history *history_;\\n\\n TerminationCheckBase *termination_check_module_;\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/test_NBV.h\",\n \"rank\": 6,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class iris_drone_commander\\n\\n{\\n\\npublic:\\n\\n iris_drone_commander(const ros::NodeHandle &nh, const ros::NodeHandle &nhPrivate);\\n\\n VehicleControlBase *vehicle_;\\n\\n ros::NodeHandle nh_;\\n\\n ros::NodeHandle nh_private_;\\n\\n ros::Publisher localPosePub;\\n\\n\\n\\n ros::Publisher waypoint_status;\\n\\n ros::Publisher path_status;\\n\\n\\n\\n bool command_status;\\n\\n Command::State state;\\n\\n bool enable_rotate;\\n\\n geometry_msgs::PoseStamped hoverPose;\\n\\n\\n\\n double start_x, start_y, start_z, start_yaw;\\n\\n int vehicle_type;\\n\\n std::string base_frame;\\n\",\n \"file_path\": \"include/control/vehicle_commander.h\",\n \"rank\": 7,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class nbv_history\\n\\n{\\n\\npublic:\\n\\n nbv_history();\\n\\n void computeEntropyDiff();\\n\\n double getMaxUtility (int N_iterations);\\n\\n bool isRepeatingMotions(int window_size);\\n\\n void update();\\n\\n\\n\\n int iteration;\\n\\n std::vector<float> entropy_diff;\\n\\n std::vector<geometry_msgs::Pose> selected_poses;\\n\\n std::vector<geometry_msgs::Pose> selected_poses_along_path;\\n\\n std::vector<float> selected_utility;\\n\\n std::vector<float> number_of_visited_cells_in_selected_poses;\\n\\n std::vector<float> number_of_unvisited_cells_in_selected_poses;\\n\\n std::vector<float> percentage_of_Unvisited_cells;\\n\\n\\n\\n\\n\\n std::vector<float> total_entropy;\\n\",\n \"file_path\": \"include/victim_localization/nbv_history.h\",\n \"rank\": 8,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class visualizeResults1\\n\\n{\\n\\npublic:\\n\\n visualizeResults1(const ros::NodeHandle &nh_,\\n\\n const ros::NodeHandle &nh_private_ );\\n\\n\\n\\n ros::NodeHandle nh;\\n\\n ros::NodeHandle nh_private;\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n\\n\\n std::string resultPath;\\n\\n std::vector<geometry_msgs::Pose> Poses;\\n\\n std::vector<geometry_msgs::Pose> Path;\\n\\n\\n\\n void SetPathtoResults(std::string path);\\n\\n void trigger();\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // PLOTRESULTS1_H\\n\",\n \"file_path\": \"include/victim_localization/visualize_results1.h\",\n \"rank\": 9,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class SSD_client {\\n\\n protected:\\n\\n ros::NodeHandle n;\\n\\n ros::Rate loop_rate;\\n\\n ros::ServiceClient client ;\\n\\n\\n\\n public:\\n\\n bool Detection_success;\\n\\n victim_localization::DL_box srv;\\n\\n SSD_client::SSD_client();\\n\\n void Get_SSD_Detection();\\n\\n\\n\\n};\\n\\n\\n\\n#endif // SSD_CLIENT_H\\n\",\n \"file_path\": \"include/victim_localization/ssd_client.h\",\n \"rank\": 10,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class test_navigation\\n\\n{\\n\\n tf::TransformListener tf_;\\n\\npublic:\\n\\n test_navigation(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private );\\n\\n ReactivePathPlanner *planner_;\\n\\n vehicle_communicator *drone_communicator_;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\\n\\n\\n\\n\\n\\n Volumetric_Map *Volumetric_Map_;\\n\\n costmap_2d::Costmap2DROS *CostMapROS_;\\n\\n nav_msgs::Path path_;\\n\\n nav_msgs::Path path_to_waypoint;\\n\\n\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::NodeHandle nh_private_;\\n\",\n \"file_path\": \"include/victim_localization/test_navigation.h\",\n \"rank\": 11,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class visualizeResults\\n\\n{\\n\\npublic:\\n\\n visualizeResults(const ros::NodeHandle &nh_,\\n\\n const ros::NodeHandle &nh_private_ );\\n\\n\\n\\n ros::NodeHandle nh;\\n\\n ros::NodeHandle nh_private;\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n\\n\\n std::string resultPath;\\n\\n std::vector<geometry_msgs::Pose> Path;\\n\\n void SetPathtoResults(std::string path);\\n\\n void trigger();\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // PLOTRESULTS_H\\n\",\n \"file_path\": \"include/victim_localization/visualize_results.h\",\n \"rank\": 12,\n \"score\": 103709.53681133158\n },\n {\n \"content\": \"class VehicleControlBase\\n\\n{\\n\\nprotected:\\n\\n bool is_ready_;\\n\\n\\n\\npublic:\\n\\n double distance_threshold_;\\n\\n double angular_threshold_;\\n\\n double linear_speed_threshold_;\\n\\n double angular_speed_threshold_;\\n\\n\\n\\n geometry_msgs::Pose vehicle_current_pose_;\\n\\n geometry_msgs::Twist vehicle_current_twist_;\\n\\n mavros_msgs::State vehicle_current_state_;\\n\\n\\n\\n geometry_msgs::Pose setpoint_;\\n\\n std::vector<geometry_msgs::Pose> setpath_;\\n\\n\\n\\n ros::Time setpoint_last_received;\\n\\n geometry_msgs::PoseStamped setpoint_last_pose;\\n\",\n \"file_path\": \"include/control/vehicle_control_base.h\",\n \"rank\": 13,\n \"score\": 101452.97346955829\n },\n {\n \"content\": \"class Volumetric_Map\\n\\n{\\n\\n\\n\\n typedef octomap::OcTree OcTreeT;\\n\\n typedef octomap_msgs::GetOctomap OctomapSrv;\\n\\n typedef octomap_msgs::BoundingBoxQuery BBXSrv;\\n\\n\\n\\npublic:\\n\\n //....variables....\\n\\n ros::Time previous_time;\\n\\n std::string topic_pointcloud_;\\n\\n std::string topic_Pose;\\n\\n ros::Subscriber pointcloud_sub_;\\n\\n costmap_2d::Costmap2DROS *costmap_ros_;\\n\\n costmap_2d::Costmap2D *costmap_;\\n\\n double pcl_throttle_;\\n\\n double map2D_throttle_;\\n\\n bool accept_pointCloud;\\n\\n bool stop;\\n\\n int count_pointCloud;\\n\",\n \"file_path\": \"include/victim_localization/volumetric_map_manager.h\",\n \"rank\": 14,\n \"score\": 101452.97346955829\n },\n {\n \"content\": \"class view_generator_IG\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\n\\nprotected:\\n\\n double res_x_, res_y_, res_z_, res_yaw_;\\n\\n\\n\\n double nav_bounds_x_max_, nav_bounds_y_max_, nav_bounds_z_max_;\\n\\n double nav_bounds_x_min_, nav_bounds_y_min_, nav_bounds_z_min_;\\n\\n double dist_to_goal;\\n\\n\\n\\n double uav_fixed_height;\\n\\n double extensionRange_;\\n\\n Eigen::Vector3d boundingbox_;\\n\\n double boundingbox_x_,boundingbox_y_,boundingbox_z_;\\n\\n double dOvershoot_;\\n\\n\\n\\npublic:\\n\\n //....variables....\\n\",\n \"file_path\": \"include/victim_localization/view_generator_ig.h\",\n \"rank\": 15,\n \"score\": 99321.28957701172\n },\n {\n \"content\": \"class ReactivePlannerServer\\n\\n{\\n\\nprivate:\\n\\n ros::ServiceServer planningService;\\n\\n ros::Subscriber sub;\\n\\n ros::NodeHandle nh;\\n\\n ros::NodeHandle nh_private;\\n\\n volumetric_mapping::OctomapManager * mapManager = NULL;\\n\\n geometry_msgs::Point robotCenter;\\n\\n geometry_msgs::Vector3 gridSize;\\n\\n geometry_msgs::Pose gridStart;\\n\\n SSPP::PathPlanner* pathPlanner = NULL;\\n\\n Robot* robot = NULL;\\n\\n Pose start,end;\\n\\n double orientationSamplingRes = 90.0;\\n\\n double debugDelay = 0.0;\\n\\n double regGridConRad;\\n\\n double gridRes;\\n\\n double distanceToGoal = 0;\\n\\n int treeProgressDisplayFrequency = -1;\\n\",\n \"file_path\": \"include/victim_localization/reactive_planner_server.h\",\n \"rank\": 16,\n \"score\": 99321.28957701172\n },\n {\n \"content\": \"class view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n float info_selected_utility_;\\n\\n float info_percentage_of_New_Cells;\\n\\n\\n\\n float info_dl_selected_utility_;\\n\\n float info_thermal_selected_utility_;\\n\\n float info_wireless_selected_utility_;\\n\\n\\n\\n float info_selected_direction_; // this param is used for in wireless Viewpoint evaluation\\n\\n float info_entropy_total_;\\n\\n float info_dl_entropy_total_;\\n\\n float info_thermal_entropy_total_;\\n\\n float info_wireless_entropy_total_;\\n\\n\\n\\n\\n\\n view_evaluator_base();\\n\\n geometry_msgs::Pose getTargetPose();\\n\\n void setViewGenerator(view_generator_IG* v);\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_base.h\",\n \"rank\": 17,\n \"score\": 99321.28957701172\n },\n {\n \"content\": \"class TerminationCheckBase\\n\\n{\\n\\npublic:\\n\\n TerminationCheckBase();\\n\\n virtual bool isTerminated();\\n\\n void setHistory(nbv_history* h);\\n\\n void setViewEvaluator(view_evaluator_base* v);\\n\\n void SaveResults();\\n\\n cv::Mat upscaleOccupancyImage(grid_map::GridMap inputMap , std::string Input,\\n\\n grid_map::GridMap upscaledMap, std::string Output);\\n\\n\\n\\n void setNBVTimeTaken(ros::Duration t);\\n\\n ros::Duration NBVDurationTaken;\\n\\n std::string saveFolder;\\n\\n std::string result_status; // result_status\\n\\n\\n\\n\\n\\nprotected:\\n\\n nbv_history* nbv_history_;\\n\\n view_evaluator_base* view_evaluator;\\n\\n\\n\\n int repeat_window_size_;\\n\\n};\\n\\n\\n\\n#endif // TERMINATION_CHECK_BASE_H\\n\",\n \"file_path\": \"include/victim_localization/termination_check_base.h\",\n \"rank\": 18,\n \"score\": 99321.28957701172\n },\n {\n \"content\": \"class victim_detector_base\\n\\n{\\n\\npublic:\\n\\n victim_detector_base();\\n\\n ~victim_detector_base();\\n\\n\\n\\n vehicle_communicator *vehicle_comm_;\\n\\n virtual Status getDetectorStatus(){};\\n\\n virtual void performDetection(){};\\n\\n\\n\\n geometry_msgs::PoseStamped capture_ps;\\n\\n geometry_msgs::PoseStamped current_ps;\\n\\n void SetVehicleCommunicator(vehicle_communicator *vehicle_comm);\\n\\n virtual ros::Time getCaptureTime(){};\\n\\n virtual ros::Duration GetConnectionTime(); // GetConnectionTime only use with\\n\\n // DeepLeanring Detector to account for possible connection drop\\n\\n};\\n\\n\\n\\n#endif // VICTIM_DETECTOR_BASE_H\\n\",\n \"file_path\": \"include/victim_localization/victim_detector_base.h\",\n \"rank\": 19,\n \"score\": 99321.28957701172\n },\n {\n \"content\": \"class Victim_Map_Base\\n\\n{\\n\\n\\n\\nprotected://get it from config ..\\n\\n double Prob_D_H; //P(D|H)\\n\\n double Prob_D_Hc; //P(D|Hc)\\n\\n double Prob_Dc_H; //P(Dc|H)\\n\\n double Prob_Dc_Hc; //P(Dc|Hc)\\n\\n\\n\\npublic:\\n\\n Victim_Map_Base(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\\n\\n ~Victim_Map_Base();\\n\\n\\n\\n MAP::MAPtype Maptype;\\n\\n\\n\\n vehicle_communicator *drone_comm;\\n\\n VehicleControlBase *vehicle_;\\n\\n\\n\\n std::string camera_optical_frame;\\n\\n std::string camera_thermal_frame;\\n\",\n \"file_path\": \"include/victim_localization/victim_map_base.h\",\n \"rank\": 20,\n \"score\": 99321.28957701172\n },\n {\n \"content\": \"class victim_thermal_detector\\n\\n{\\n\\npublic:\\n\\n victim_thermal_detector(ros::NodeHandle& nh_,ros::NodeHandle& pnh_);\\n\\n ~victim_thermal_detector();\\n\\n\\n\\n image_transport::Subscriber sub_image;\\n\\n image_transport::Publisher pub_detection_;\\n\\n\\n\\n double minTempVictim_;\\n\\n double maxTempVictim_;\\n\\n double minAreaVictim_;\\n\\n double minDistBetweenBlobs_;\\n\\n double blob_temperature_;\\n\\n std::vector<geometry_msgs::Point> victim_loc;\\n\\n\\n\\n void imageCallback(const sensor_msgs::ImageConstPtr& img);\\n\\n std::vector<geometry_msgs::Point> GetDetectionResult();\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VICTIM_THERMAL_DETECTOR_H\\n\",\n \"file_path\": \"include/victim_localization/victim_thermal_detector_node.h\",\n \"rank\": 21,\n \"score\": 97304.39790457269\n },\n {\n \"content\": \"class SSD_Detection_with_clustering\\n\\n{\\n\\npublic:\\n\\n SSD_Detection_with_clustering();\\n\\n cv_bridge::CvImagePtr current_depth_image;\\n\\n victim_localization::DL_msgs_boxes current_ssd_detection;\\n\\n geometry_msgs::Pose current_pose;\\n\\n geometry_msgs::Point detected_point;\\n\\n bool detection_status_; //\\n\\n ros::Publisher pub_segemented_human_pointcloud;\\n\\n\\n\\n tf::TransformListener *tf_listener;\\n\\n typedef message_filters::sync_policies::ApproximateTime<sensor_msgs::Image,victim_localization::DL_msgs_boxes,geometry_msgs::PoseStamped> MySyncPolicy;\\n\\n message_filters::Subscriber<sensor_msgs::Image> *depth_in_;\\n\\n message_filters::Subscriber<victim_localization::DL_msgs_boxes> *box_;\\n\\n message_filters::Subscriber<geometry_msgs::PoseStamped> *loc_sub_;\\n\\n message_filters::Synchronizer<MySyncPolicy> *sync;\\n\\n\\n\\n bool DetectionAvailable();\\n\\n void CallBackData(const sensor_msgs::ImageConstPtr& input_depth, const victim_localization::DL_msgs_boxesConstPtr& boxes_,\\n\\n const geometry_msgs::PoseStamped::ConstPtr& loc);\\n\\n void FindClusterCentroid();\\n\\n bool getClusterCentroidResultStatus();\\n\\n geometry_msgs::Point getClusterCentroid();\\n\\n void PublishSegmentedPointCloud(const pcl::PointCloud<pcl::PointXYZ> input_PointCloud);\\n\\n};\\n\\n\\n\\n#endif // SSD_DETECTION_H\\n\",\n \"file_path\": \"include/ssd_keras/ssd_detection_with_ecludian_clustering (backup).h\",\n \"rank\": 22,\n \"score\": 95393.26914281788\n },\n {\n \"content\": \"class Raytracing2D : public Raytracing\\n\\n{\\n\\npublic:\\n\\n\\n\\n Raytracing2D(double map_res_);\\n\\n Raytracing2D(double map_res_, double HFOV_deg, double VFOV_deg, double max_d, double min_d);\\n\\n ~Raytracing2D();\\n\\n\\n\\n void GenerateOctomap(bool rebuild_once, bool publish);\\n\\n void generateMarkerArray(\\n\\n const std::string& tf_frame,\\n\\n visualization_msgs::MarkerArray* occupied_nodes,\\n\\n visualization_msgs::MarkerArray* free_nodes);\\n\\n\\n\\n double colorizeMapByHeight(double z, double min_z,\\n\\n double max_z) const {\\n\\n return (1.0 - std::min(std::max((z - min_z) / (max_z - min_z), 0.0), 1.0));\\n\\n }\\n\\n\\n\\n std_msgs::ColorRGBA percentToColor(double h)const;\\n\",\n \"file_path\": \"include/victim_localization/raytracing_2d.h\",\n \"rank\": 23,\n \"score\": 94226.29371551238\n },\n {\n \"content\": \"class straightLine : public navigationBase\\n\\n{\\n\\npublic:\\n\\n straightLine(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager);\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::NodeHandle nh_private_;\\n\\n volumetric_mapping::OctomapManager *manager_;\\n\\n double extensionRange_;\\n\\n double boundingbox_x_;\\n\\n double boundingbox_y_;\\n\\n double boundingbox_z_;\\n\\n double dOvershoot_;\\n\\n\\n\\n Eigen::Vector3d boundingbox_;\\n\\n\\n\\n std::string methodName(void);\\n\\n bool GeneratePath(geometry_msgs::Pose end, nav_msgs::Path &Path);\\n\\n void start(){};\\n\\n\\n\\n};\\n\\n\\n\\n#endif // STRAIGHTLINE_H\\n\",\n \"file_path\": \"include/victim_localization/straightline.h\",\n \"rank\": 24,\n \"score\": 92094.60982296581\n },\n {\n \"content\": \"class FloatingSensorPosition : public ModelPlugin\\n\\n{\\n\\npublic:\\n\\n FloatingSensorPosition();\\n\\n virtual ~FloatingSensorPosition();\\n\\n\\n\\nprotected:\\n\\n virtual void Load(physics::ModelPtr _model, sdf::ElementPtr _sdf);\\n\\n virtual void Update();\\n\\n virtual void Reset();\\n\\n virtual void OnRosMsgPose(const geometry_msgs::PoseStampedConstPtr &msg);\\n\\n virtual void OnRosMsgTwist(const geometry_msgs::TwistConstPtr &msg);\\n\\n virtual void QueueThread();\\n\\n virtual void GetCurrentPose();\\n\\n virtual void UpdatePosition();\\n\\n\\n\\nprivate:\\n\\n std::mutex mtx_pose_; // mutex for critical section\\n\\n tf::TransformBroadcaster tf_broadcaster_;\\n\\n\\n\",\n \"file_path\": \"include/vehicle/floating_sensor_position_plugin.h\",\n \"rank\": 25,\n \"score\": 86353.1170019225\n },\n {\n \"content\": \"class VehicleControlIris : public VehicleControlBase\\n\\n{\\n\\nprivate:\\n\\n double uav_height_min_;\\n\\n double uav_height_max_;\\n\\n\\n\\n\\n\\npublic:\\n\\n ros::Subscriber sub_odom;\\n\\n ros::Subscriber sub_state;\\n\\n ros::Subscriber sub_setpoint;\\n\\n ros::ServiceClient arming_client;\\n\\n ros::ServiceClient set_mode_client;\\n\\n ros::Publisher pub_setpoint;\\n\\n VehicleControlIris();\\n\\n\\n\\n//private:\\n\\n\\n\\n void callbackOdometry(const nav_msgs::Odometry& odom_msg);\\n\\n void callbackState(const mavros_msgs::State& state_msg);\\n\",\n \"file_path\": \"include/control/vehicle_control_iris.h\",\n \"rank\": 26,\n \"score\": 86353.1170019225\n },\n {\n \"content\": \"class view_evaluator_ig : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_ig();\\n\\n\\n\\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateCombinedUtility(geometry_msgs::Pose p,double &new_cell_percentage);\\n\\n\\n\\n\\n\\n std::string getMethodName();\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_IG_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_ig.h\",\n \"rank\": 27,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class Victim_Map_Wireless: public Victim_Map_Base\\n\\n{\\n\\n\\n\\nprivate:\\n\\n std::string wireless_polygon_topic=\\\"polygon_wireless\\\";\\n\\n std::string wireless_layer_name=\\\"victim_wireless\\\";\\n\\n Position victim_loc;\\n\\n double vision_map_resol;\\n\\n double max_wireless_range;\\n\\n\\n\\npublic:\\n\\n Victim_Map_Wireless(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\\n\\n victim_wireless_detector *detector_;\\n\\n void Update();\\n\\n void runDetector();\\n\\n virtual void setDetectionResult(Status detection_status);\\n\\n\\n\\n double Distance_to_center(Position p1, Position p2);\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VICTIM_MAP_WIRELESS_2_H\\n\",\n \"file_path\": \"include/victim_localization/victim_map_wireless_2.h\",\n \"rank\": 28,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class victim_thermal_detector : public victim_detector_base\\n\\n{\\n\\npublic:\\n\\n victim_thermal_detector();\\n\\n ~victim_thermal_detector();\\n\\n\\n\\n image_transport::Subscriber sub_image;\\n\\n image_transport::Publisher pub_detection_;\\n\\n\\n\\n double minTempVictim_;\\n\\n double maxTempVictim_;\\n\\n double minAreaVictim_;\\n\\n double minDistBetweenBlobs_;\\n\\n double blob_temperature_;\\n\\n sensor_msgs::ImageConstPtr input_image;\\n\\n cv::Mat img_proc;\\n\\n Position victim_loc;\\n\\n bool victim_found;\\n\\n bool plot_;\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/victim_thermal_detector.h\",\n \"rank\": 29,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class victim_map_Thermal: public Victim_Map_Base\\n\\n{\\n\\n\\n\\nprivate:\\n\\n std::string thermal_polygon_topic=\\\"polygon_thermal\\\";\\n\\n std::string Thermal_layer_name=\\\"victim_thermal\\\";\\n\\n double thermal_img_x_res;\\n\\n double thermal_img_y_res;\\n\\n double thermal_x_offset;\\n\\n double thermal_y_offset;\\n\\n double max_thermal_d;\\n\\n double min_thermal_d;\\n\\n\\n\\n Position ThermalRayStart;\\n\\n Position ThermalRayEnd;\\n\\n std::vector<Position> ThermalRay;\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualize_thermal_ray;\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/victim_map_thermal.h\",\n \"rank\": 30,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class victim_map_DL: public Victim_Map_Base\\n\\n{\\n\\n\\n\\nprivate:\\n\\n std::string DL_polygon_topic=\\\"polygon_DL\\\";\\n\\n std::string DL_layer_name=\\\"victim_DL\\\";\\n\\n\\n\\n victim_vision_detector *detector_;\\n\\n\\n\\n\\n\\npublic:\\n\\n victim_map_DL(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\\n\\n void Update();\\n\\n void runDetector();\\n\\n ros::Duration getServiceConnectionTimeout();\\n\\n};\\n\\n\\n\\n#endif // VICTIM_MAP_DL_H\\n\",\n \"file_path\": \"include/victim_localization/victim_map_dl.h\",\n \"rank\": 31,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class view_evaluator_weighted : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_weighted();\\n\\n\\n\\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module,double &new_cell_percentage);\\n\\n void calculateIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max,double &new_cell_percentage);\\n\\n void calculateWirelessIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max,double &new_cell_percentage);\\n\\n void evaluate();\\n\\n void evaluateWireless();\\n\\n void evaluateCombined();\\n\\n double f_;\\n\\n bool use_dist;\\n\\n\\n\\n\\n\\n std::string getMethodName();\\n\\n std::vector<geometry_msgs::Pose> Info_poses;\\n\\n std::vector<double> Info_View_utilities;\\n\\n std::vector<double> Info_View_Max;\\n\\n std::vector<double> Info_WirelessDiection;\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_weighted.h\",\n \"rank\": 32,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class victim_vision_detector : public victim_detector_base\\n\\n{\\n\\npublic:\\n\\n victim_vision_detector();\\n\\n ~victim_vision_detector();\\n\\n cv_bridge::CvImagePtr current_depth_image;\\n\\n victim_localization::DL_msgs_box current_ssd_detection;\\n\\n geometry_msgs::Point detected_point;\\n\\n bool detection_Cluster_succeed; //\\n\\n ros::Publisher pub_segemented_human_pointcloud;\\n\\n ros::Publisher pub_setpoint;\\n\\n double image_x_resol;\\n\\n double image_y_resol;\\n\\n double image_x_offset;\\n\\n double image_y_offset;\\n\\n double RGB_FL;\\n\\n std::string camera_optical_frame;\\n\\n bool ServiceCallFirstTime;\\n\\n ros::Time Start_time;\\n\\n ros::Duration Service_startTime;\\n\",\n \"file_path\": \"include/ssd_keras/victim_vision_detector.h\",\n \"rank\": 33,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class view_evaluator_sum: public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_sum();\\n\\n ~view_evaluator_sum();\\n\\n\\n\\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n std::string getMethodName();\\n\\n\\n\\nprivate:\\n\\n double w_dist_;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_SUMM_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_sum.h\",\n \"rank\": 34,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class view_evaluator_FOV: public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_FOV();\\n\\n ~view_evaluator_FOV();\\n\\n\\n\\n double FOVSize(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\\n\\n std::string getMethodName();\\n\\n\\n\\n std::vector<double> Info_View_counts;\\n\\n std::vector<geometry_msgs::Pose> Info_poses;\\n\\n\\n\\n std::vector<double> Info_View_counts_dl;\\n\\n std::vector<double> Info_View_counts_thermal;\\n\\n\\n\\n void evaluate();\\n\\n void evaluateCombined();\\n\\n\\n\\nprivate:\\n\\n double w_dist_;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_FFOV_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_fieldofview.h\",\n \"rank\": 35,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class victim_wireless_detector : public victim_detector_base\\n\\n{\\n\\npublic:\\n\\n victim_wireless_detector();\\n\\n ~victim_wireless_detector();\\n\\n\\n\\n\\n\\n double current_node_loc;\\n\\n double target_node_loc;\\n\\n double d0;\\n\\n double N_sensor;\\n\\n double lamda;\\n\\n double frequency;\\n\\n double SNR;\\n\\n double K;\\n\\n double path_loss;\\n\\n double exact_dist;\\n\\n double distance_to_victim;\\n\\n double distance_threshold;\\n\\n double current_loc[2];\\n\",\n \"file_path\": \"include/victim_localization/victim_wireless_detector.h\",\n \"rank\": 36,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class Victim_Map_Wireless: public Victim_Map_Base\\n\\n{\\n\\n\\n\\nprivate:\\n\\n std::string wireless_polygon_topic=\\\"polygon_wireless\\\";\\n\\n std::string wireless_layer_name=\\\"victim_wireless\\\";\\n\\n grid_map::Polygon wireless_polygon;\\n\\n Position victim_loc;\\n\\n\\n\\n grid_map::GridMap offline_map;\\n\\n double offline_map_resol;\\n\\n double detection_threshold;\\n\\n double wireless_error;\\n\\n\\n\\n ros::Publisher pub_map_offline;\\n\\n\\n\\npublic:\\n\\n Victim_Map_Wireless(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\\n\\n void Update();\\n\\n void runDetector(){};\\n\\n void Generate_offline_wireless_map(double error);\\n\\n void Publish_Offline_Map();\\n\\n};\\n\\n\\n\\n#endif // VICTIM_MAP_WIRELESS_H\\n\",\n \"file_path\": \"include/victim_localization/victim_map_wireless.h\",\n \"rank\": 37,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class victim_map_combined : public Victim_Map_Base\\n\\n{\\n\\npublic:\\n\\n victim_map_combined(const ros::NodeHandle &nh,const ros::NodeHandle &nh_private);\\n\\n\\n\\n\\n\\n\\n\\n std::string combinedMap_layer_name=\\\"victim_fused\\\";\\n\\n double alpha;\\n\\n double beta;\\n\\n double gama;\\n\\n\\n\\n void Update();\\n\\n void setDroneCommunicator(vehicle_communicator *drone_comm_);\\n\\n void setVehicle(VehicleControlBase *vehicle);\\n\\n void setOctomapManager(volumetric_mapping::OctomapManager *manager);\\n\\n void SetNavMap(nav_msgs::OccupancyGridPtr Nav_map);\\n\\n void setCurrentPose(geometry_msgs::Pose ps);\\n\\n\\n\\n Victim_Map_Base *victim_map_dl_;\\n\",\n \"file_path\": \"include/victim_localization/victim_map_combined.h\",\n \"rank\": 38,\n \"score\": 84630.00228306273\n },\n {\n \"content\": \"class VehicleControlIrisOrigin : public VehicleControlIris\\n\\n{\\n\\npublic:\\n\\n VehicleControlIrisOrigin();\\n\\n\\n\\n void setOffboardState();\\n\\n //void moveVehicle(double threshold_sensitivity);\\n\\n\\n\\n geometry_msgs::Pose transformSetpoint2Global (const geometry_msgs::Pose p_set);\\n\\n geometry_msgs::Pose transformGlobal2Setpoint (const geometry_msgs::Pose p_global);\\n\\n};\\n\\n\\n\\n#endif // VEHICLE_CONTROL_IRIS_ORIGIN_H\\n\",\n \"file_path\": \"include/control/vehicle_control_iris_origin.h\",\n \"rank\": 39,\n \"score\": 82990.65617335825\n },\n {\n \"content\": \"class VehicleControlFloatingSensor : public VehicleControlBase\\n\\n{\\n\\nprivate:\\n\\n ros::Subscriber sub_pose;\\n\\n ros::Publisher pub_pose;\\n\\n ros::Publisher pub_twist;\\n\\n\\n\\n double speed_;\\n\\n double time_to_target_;\\n\\n geometry_msgs::Twist twist_;\\n\\n\\n\\npublic:\\n\\n VehicleControlFloatingSensor();\\n\\n\\n\\n void callbackPose(const geometry_msgs::PoseStamped& pose_msg);\\n\\n\\n\\n bool isReady();\\n\\n bool isSationary(double threshold_sensitivity = 1);\\n\\n void moveVehicle(double threshold_sensitivity = 1);\\n\\n void FollowPath(double threshold_sensitivity = 1);\\n\",\n \"file_path\": \"include/control/vehicle_control_floating_sensor.h\",\n \"rank\": 40,\n \"score\": 82990.65617335825\n },\n {\n \"content\": \"\\n\\n std::string methodName(void);\\n\\n bool GeneratePath(geometry_msgs::Pose end, nav_msgs::Path &Path);\\n\\n bool GeneratePath(geometry_msgs::Pose end, std::vector<geometry_msgs::Pose> &Path);\\n\\n\\n\\n void SetDynamicGridSize(double x, double y,double z);\\n\\n void SetOriginPose(double x, double y,double z);\\n\\n\\n\\n void start();\\n\\n\\n\\n};\\n\\n\\n\\n#endif // REACTIVEPATHPLANNER_H\\n\",\n \"file_path\": \"include/victim_localization/reactive_path_planner.h\",\n \"rank\": 41,\n \"score\": 81982.45771064873\n },\n {\n \"content\": \"#ifndef REACTIVEPATHPLANNER_H\\n\\n#define REACTIVEPATHPLANNER_H\\n\\n\\n\\n#include <ros/ros.h>\\n\\n#include \\\"sspp/pathplanner.h\\\"\\n\\n\\n\\n#include <ros/package.h>\\n\\n#include <geometry_msgs/Pose.h>\\n\\n#include <geometry_msgs/PoseArray.h>\\n\\n\\n\\n#include \\\"sspp/distance_heuristic.h\\\"\\n\\n#include \\\"rviz_visual_tools/rviz_visual_tools.h\\\"\\n\\n#include <octomap_world/octomap_manager.h>\\n\\n#include <pcl_conversions/pcl_conversions.h>\\n\\n#include <sspp/sspp_srv.h>\\n\\n#include <geometry_msgs/PoseStamped.h>\\n\\n#include <geometry_msgs/Pose.h>\\n\\n#include \\\"victim_localization/reactive_planner_server.h\\\"\\n\\n#include \\\"victim_localization/navigation_base.h\\\"\\n\\n#include \\\"nav_msgs/Path.h\\\"\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/reactive_path_planner.h\",\n \"rank\": 42,\n \"score\": 81976.58611336035\n },\n {\n \"content\": \"class TerminationCheckMaxProbability: public TerminationCheckBase\\n\\n{\\n\\npublic:\\n\\n TerminationCheckMaxProbability();\\n\\n bool isTerminated();\\n\\n\\n\\nprotected:\\n\\n double max_probablity;\\n\\n};\\n\\n\\n\\n#endif // TERMINATION_CHECK_MAX_PROBABILITY_H\\n\",\n \"file_path\": \"include/victim_localization/termination_check_max_probability.h\",\n \"rank\": 43,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_generator_ig_frontier: public view_generator_IG\\n\\n{\\n\\npublic:\\n\\n double frontier_yaw_res_;\\n\\n void setvictimmap(grid_map::GridMap *map,std::string layer_name);\\n\\n bool setYawtoViewpoint(geometry_msgs::Pose Frontier, Index index_, std::vector<geometry_msgs::Pose> &Frontier_with_yaws);\\n\\n bool IsPointingtoUnkown(double yaw, Index index_);\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::Publisher pub_Nav_map;\\n\\n void publish_Map(grid_map::GridMap Map);\\n\\n grid_map::GridMap Victim_Nav_map;\\n\\n std::string Nav_map_layer;\\n\\n double x_arena_max;\\n\\n double y_arena_max;\\n\\n int pointing_to_unknown;\\n\\n double pointing_to_unknown_threshold;\\n\\n bool IsWithinCostmap(double x1,double x2);\\n\\n bool isPreviouslyRejected(geometry_msgs::Pose p);\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/view_generator_ig_frontier.h\",\n \"rank\": 44,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class TerminationCheckMaxIterations: public TerminationCheckBase\\n\\n{\\n\\npublic:\\n\\n TerminationCheckMaxIterations();\\n\\n bool isTerminated();\\n\\n\\n\\nprotected:\\n\\n int max_iterations_;\\n\\n double max_probablity;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // TERMINATION_CHECK_MAX_ITERATIONS_H\\n\",\n \"file_path\": \"include/victim_localization/termination_check_max_iterations.h\",\n \"rank\": 45,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_log_reward : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_log_reward();\\n\\n\\n\\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\\n\\n std::string getMethodName();\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_LOG_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_log_reward.h\",\n \"rank\": 46,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_ig_exp : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_ig_exp();\\n\\n\\n\\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateCombinedUtility(geometry_msgs::Pose p,double &new_cell_percentage);\\n\\n\\n\\n\\n\\n std::string getMethodName();\\n\\n double w_dist_;\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_IG_EXP_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_ig_exp.h\",\n \"rank\": 47,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_MaxSUM : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_MaxSUM();\\n\\n\\n\\n void evaluate();\\n\\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\\n\\n std::string getMethodName();\\n\\n\\n\\n};\\n\\n#endif // VIEW_EVALUATOR_MAX_SUM_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_max_sum.h\",\n \"rank\": 48,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_weighted_max : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_weighted_max();\\n\\n\\n\\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\\n\\n void calculateIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max);\\n\\n void calculateWirelessIGwithMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &IG, double &Max);\\n\\n void evaluate();\\n\\n void evaluateWireless();\\n\\n void evaluateCombined();\\n\\n\\n\\n\\n\\n std::string getMethodName();\\n\\n std::vector<geometry_msgs::Pose> Info_poses;\\n\\n std::vector<double> Info_View_utilities;\\n\\n std::vector<double> Info_View_Max;\\n\\n std::vector<double> Info_WirelessDiection;\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_weighted_max.h\",\n \"rank\": 49,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_MaxMax : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_MaxMax();\\n\\n\\n\\n\\n\\n double GetMAXANDCOUNT(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &max, double &max_count, double &new_cell_percentage);\\n\\n double GetMAXANDCOUNTWIRELESS(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &max, double &max_count,double &new_cell_percentage);\\n\\n double GetMAXANDCOUNCombined(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &max, double &max_count, double &new_cell_percentage);\\n\\n void evaluate();\\n\\n void evaluateCombined();\\n\\n void evaluateWireless();\\n\\n\\n\\n\\n\\n std::string getMethodName();\\n\\n std::vector<double> Info_View_max;\\n\\n std::vector<double> Info_View_max_count;\\n\\n std::vector<double> Info_WirelessDiection;\\n\\n std::vector<geometry_msgs::Pose> Info_poses;\\n\\n std::vector<double> Info_New_cellsPercentage;\\n\\n\\n\\n\\n\\nprivate:\\n\\n double max_belief;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_MAX_MAX_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_max_max.h\",\n \"rank\": 50,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_MinNEIGH : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_MinNEIGH();\\n\\n\\n\\n void evaluate();\\n\\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\\n\\n std::string getMethodName();\\n\\n\\n\\nprivate:\\n\\n double min_belief;\\n\\n double max_belief;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_MIN_NEIGH_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_min_neigh.h\",\n \"rank\": 51,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \"class view_evaluator_MaxMIN : public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_MaxMIN();\\n\\n\\n\\n void evaluate();\\n\\n double calculateUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module);\\n\\n std::string getMethodName();\\n\\n\\n\\nprivate:\\n\\n double min_belief;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_MAX_MIN_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_max_min.h\",\n \"rank\": 52,\n \"score\": 81429.11506054642\n },\n {\n \"content\": \" class FrustumCullingTT : public FilterIndices<pcl::PointXYZ>\\n\\n {\\n\\n typedef typename Filter<pcl::PointXYZ>::PointCloud PointCloud;\\n\\n typedef typename PointCloud::Ptr PointCloudPtr;\\n\\n typedef typename PointCloud::ConstPtr PointCloudConstPtr;\\n\\n\\n\\n public:\\n\\n\\n\\n typedef boost::shared_ptr< FrustumCullingTT> Ptr;\\n\\n typedef boost::shared_ptr< const FrustumCullingTT > ConstPtr;\\n\\n\\n\\n\\n\\n using Filter<pcl::PointXYZ>::getClassName;\\n\\n\\n\\n FrustumCullingTT (bool extract_removed_indices = false)\\n\\n : FilterIndices<pcl::PointXYZ>::FilterIndices (extract_removed_indices)\\n\\n , camera_pose_ (Eigen::Matrix4f::Identity ())\\n\\n , hfov_ (60.0f)\\n\\n , vfov_ (60.0f)\\n\\n , np_dist_ (0.1f)\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 53,\n \"score\": 80704.4253286197\n },\n {\n \"content\": \"class view_generator_ig_nn_adaptive : public view_generator_IG\\n\\n{\\n\\npublic:\\n\\n view_generator_ig_nn_adaptive();\\n\\n virtual void generateViews();\\n\\n std::string getMethodName();\\n\\n double scale_factor_;\\n\\n double scale_multiplier_;\\n\\n\\n\\n\\n\\nprivate:\\n\\n int minima_iterations_;\\n\\n double minima_threshold_;\\n\\n bool isStuckInLocalMinima();\\n\\n bool IsPreviouslyCheckedSamples(double i_x,double i_y);\\n\\n bool do_adaptive_generation;\\n\\n double entropy_max;\\n\\n double new_cell_percentage_threshold;\\n\\n double current_percentage;\\n\\n double new_cell_percentage_threshold_respawn;\\n\\n double new_cell_percentage_Iteration;\\n\\n bool new_cell_status;\\n\\n bool new_cell_status_stop;\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_GENERATOR_IG_NN_ADAPTIVE_H\\n\",\n \"file_path\": \"include/victim_localization/view_generator_ig_nn_adaptive.h\",\n \"rank\": 54,\n \"score\": 78518.29551983727\n },\n {\n \"content\": \"class view_evaluator_ig_exp_max: public view_evaluator_base\\n\\n{\\n\\npublic:\\n\\n view_evaluator_ig_exp_max();\\n\\n\\n\\n double calculateUtiltiy(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateWirelessUtility(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n\\n\\n std::string getMethodName();\\n\\n\\n\\nprivate:\\n\\n double w_dist_;\\n\\n double calculateIGMax(geometry_msgs::Pose p, Victim_Map_Base *mapping_module, double &new_cell_percentage);\\n\\n double calculateWirelessIGMAX(geometry_msgs::Pose p, Victim_Map_Base *mapping_module , double &new_cell_percentage);\\n\\n};\\n\\n\\n\\n#endif // VIEW_EVALUATOR_IG_EXP_MAX_H\\n\",\n \"file_path\": \"include/victim_localization/view_evaluator_ig_exp_max.h\",\n \"rank\": 55,\n \"score\": 78518.29551983727\n },\n {\n \"content\": \"/*\\n\\n * Academic License - for use in teaching, academic research, and meeting\\n\\n * course requirements at degree granting institutions only. Not for\\n\\n * government, commercial, or other organizational use.\\n\\n * File: rtGetNaN.cpp\\n\\n *\\n\\n * MATLAB Coder version : 3.2\\n\\n * C/C++ source code generated on : 05-Feb-2018 03:23:30\\n\\n */\\n\\n\\n\\n/*\\n\\n * Abstract:\\n\\n * MATLAB for code generation function to initialize non-finite, NaN\\n\\n */\\n\\n#include \\\"rtGetNaN.h\\\"\\n\\n#define NumBitsPerChar 8U\\n\\n\\n\\n/* Function: rtGetNaN ==================================================\\n\\n * Abstract:\\n\\n * Initialize rtNaN needed by the generated code.\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.cpp\",\n \"rank\": 56,\n \"score\": 77299.27514181833\n },\n {\n \"content\": \" switch (machByteOrder) {\\n\\n case LittleEndian:\\n\\n {\\n\\n nanF.wordL.wordLuint = 0xFFC00000U;\\n\\n break;\\n\\n }\\n\\n\\n\\n case BigEndian:\\n\\n {\\n\\n nanF.wordL.wordLuint = 0x7FFFFFFFU;\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n return nanF.wordL.wordLreal;\\n\\n}\\n\\n\\n\\n/*\\n\\n * File trailer for rtGetNaN.cpp\\n\\n *\\n\\n * [EOF]\\n\\n */\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.cpp\",\n \"rank\": 57,\n \"score\": 77290.36283923745\n },\n {\n \"content\": \" * NaN is initialized as non-signaling. Assumes IEEE.\\n\\n */\\n\\nreal_T rtGetNaN(void)\\n\\n{\\n\\n size_t bitsPerReal = sizeof(real_T) * (NumBitsPerChar);\\n\\n real_T nan = 0.0;\\n\\n if (bitsPerReal == 32U) {\\n\\n nan = rtGetNaNF();\\n\\n } else {\\n\\n uint16_T one = 1U;\\n\\n enum {\\n\\n LittleEndian,\\n\\n BigEndian\\n\\n } machByteOrder = (*((uint8_T *) &one) == 1U) ? LittleEndian : BigEndian;\\n\\n switch (machByteOrder) {\\n\\n case LittleEndian:\\n\\n {\\n\\n union {\\n\\n LittleEndianIEEEDouble bitVal;\\n\\n real_T fltVal;\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.cpp\",\n \"rank\": 58,\n \"score\": 77290.03433129114\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n return nan;\\n\\n}\\n\\n\\n\\n/* Function: rtGetNaNF ==================================================\\n\\n * Abstract:\\n\\n * Initialize rtNaNF needed by the generated code.\\n\\n * NaN is initialized as non-signaling. Assumes IEEE.\\n\\n */\\n\\nreal32_T rtGetNaNF(void)\\n\\n{\\n\\n IEEESingle nanF = { { 0 } };\\n\\n\\n\\n uint16_T one = 1U;\\n\\n enum {\\n\\n LittleEndian,\\n\\n BigEndian\\n\\n } machByteOrder = (*((uint8_T *) &one) == 1U) ? LittleEndian : BigEndian;\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.cpp\",\n \"rank\": 59,\n \"score\": 77289.74857983881\n },\n {\n \"content\": \" } tmpVal;\\n\\n\\n\\n tmpVal.bitVal.words.wordH = 0xFFF80000U;\\n\\n tmpVal.bitVal.words.wordL = 0x00000000U;\\n\\n nan = tmpVal.fltVal;\\n\\n break;\\n\\n }\\n\\n\\n\\n case BigEndian:\\n\\n {\\n\\n union {\\n\\n BigEndianIEEEDouble bitVal;\\n\\n real_T fltVal;\\n\\n } tmpVal;\\n\\n\\n\\n tmpVal.bitVal.words.wordH = 0x7FFFFFFFU;\\n\\n tmpVal.bitVal.words.wordL = 0xFFFFFFFFU;\\n\\n nan = tmpVal.fltVal;\\n\\n break;\\n\\n }\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.cpp\",\n \"rank\": 60,\n \"score\": 77287.14275215888\n },\n {\n \"content\": \"class view_generator_ig_adaptive_frontier : public view_generator_ig_frontier\\n\\n{\\n\\npublic:\\n\\n view_generator_ig_adaptive_frontier();\\n\\n\\n\\n void generateViews(); //viewpoints is generated at current pose\\n\\n std::string getMethodName();\\n\\n void resetScaleFactor();\\n\\n void setSampleResolution(double resX, double resY);\\n\\n\\n\\n\\n\\n //visualize\\n\\n double scale_factor_;\\n\\n double scale_multiplier_;\\n\\n\\n\\nprivate:\\n\\n int minima_iterations_;\\n\\n double minima_threshold_;\\n\\n int adaptive_ig_max_iteration_;\\n\\n int adaptive_iteration_;\\n\\n bool isStuckInLocalMinima();\\n\\n\\n\\n};\\n\\n\\n\\n#endif // VIEW_GENERATOR_IG_ADAPTIVE_FRONTIER_H\\n\",\n \"file_path\": \"include/victim_localization/view_generator_ig_adaptive_frontier.h\",\n \"rank\": 61,\n \"score\": 77159.6124259931\n },\n {\n \"content\": \"extern real_T rtGetNaN(void);\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.h\",\n \"rank\": 62,\n \"score\": 74879.14091574417\n },\n {\n \"content\": \" class VoxelGridOcclusionEstimationT: public VoxelGrid<pcl::PointXYZ>\\n\\n {\\n\\n protected:\\n\\n using VoxelGrid<pcl::PointXYZ>::min_b_;\\n\\n using VoxelGrid<pcl::PointXYZ>::max_b_;\\n\\n using VoxelGrid<pcl::PointXYZ>::div_b_;\\n\\n using VoxelGrid<pcl::PointXYZ>::leaf_size_;\\n\\n using VoxelGrid<pcl::PointXYZ>::inverse_leaf_size_;\\n\\n\\n\\n typedef typename Filter<pcl::PointXYZ>::PointCloud PointCloud;\\n\\n typedef typename PointCloud::Ptr PointCloudPtr;\\n\\n typedef typename PointCloud::ConstPtr PointCloudConstPtr;\\n\\n\\n\\n public:\\n\\n /** \\\\brief Empty constructor. */\\n\\n VoxelGridOcclusionEstimationT ()\\n\\n {\\n\\n initialized_ = false;\\n\\n this->setSaveLeafLayout (true);\\n\\n }\\n\",\n \"file_path\": \"include/culling/voxel_grid_occlusion_estimation.h\",\n \"rank\": 63,\n \"score\": 74592.71856539424\n },\n {\n \"content\": \" class VoxelGridOcclusionEstimationT: public VoxelGrid<pcl::PointXYZ>\\n\\n {\\n\\n protected:\\n\\n using VoxelGrid<pcl::PointXYZ>::min_b_;\\n\\n using VoxelGrid<pcl::PointXYZ>::max_b_;\\n\\n using VoxelGrid<pcl::PointXYZ>::div_b_;\\n\\n using VoxelGrid<pcl::PointXYZ>::leaf_size_;\\n\\n using VoxelGrid<pcl::PointXYZ>::inverse_leaf_size_;\\n\\n\\n\\n typedef typename Filter<pcl::PointXYZ>::PointCloud PointCloud;\\n\\n typedef typename PointCloud::Ptr PointCloudPtr;\\n\\n typedef typename PointCloud::ConstPtr PointCloudConstPtr;\\n\\n\\n\\n public:\\n\\n /** \\\\brief Empty constructor. */\\n\\n VoxelGridOcclusionEstimationT ()\\n\\n {\\n\\n initialized_ = false;\\n\\n this->setSaveLeafLayout (true);\\n\\n }\\n\",\n \"file_path\": \"include/component_test/voxel_grid_occlusion_estimation.h\",\n \"rank\": 64,\n \"score\": 73234.03547155007\n },\n {\n \"content\": \" uint32_T wordH;\\n\",\n \"file_path\": \"include/RSSmodel2/rt_nonfinite.h\",\n \"rank\": 65,\n \"score\": 69421.64076384345\n },\n {\n \"content\": \"extern boolean_T rtIsNaN(real_T value);\\n\",\n \"file_path\": \"include/RSSmodel2/rt_nonfinite.h\",\n \"rank\": 66,\n \"score\": 67656.04280728946\n },\n {\n \"content\": \"extern real_T rtNaN;\\n\",\n \"file_path\": \"include/RSSmodel2/rt_nonfinite.h\",\n \"rank\": 67,\n \"score\": 67656.04280728946\n },\n {\n \"content\": \"extern void rt_InitInfAndNaN(size_t realSize);\\n\",\n \"file_path\": \"include/RSSmodel2/rt_nonfinite.h\",\n \"rank\": 68,\n \"score\": 64445.01972361658\n },\n {\n \"content\": \"extern real32_T rtGetNaNF(void);\\n\",\n \"file_path\": \"include/RSSmodel2/rtGetNaN.h\",\n \"rank\": 69,\n \"score\": 62951.15745106927\n },\n {\n \"content\": \"#include \\\"victim_localization/reactive_path_planner.h\\\"\\n\\n\\n\\n\\n\\nReactivePathPlanner::ReactivePathPlanner(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager):\\n\\nnh_(nh),\\n\\nnh_private_(nh_private),\\n\\nmanager_(manager),\\n\\nnavigationBase()\\n\\n{\\n\\n}\\n\\n\\n\\nbool ReactivePathPlanner::GeneratePath(geometry_msgs::Pose end, nav_msgs::Path &Path)\\n\\n{\\n\\n if (getDistance(current_pose_,end)< d_close) // terminate if the end pose is at the robot current pose\\n\\n return false;\\n\\n\\n\\n std::cout << \\\"calling the service\\\" << std::endl;\\n\\n\\n\\n if (manager_ == NULL) {\\n\\n ROS_ERROR_THROTTLE(1, \\\"Planner not set up: No octomap available!\\\");\\n\",\n \"file_path\": \"src/reactive_path_planner.cpp\",\n \"rank\": 70,\n \"score\": 43996.853961453\n },\n {\n \"content\": \" return false;\\n\\n\\n\\n if (manager_ == NULL) {\\n\\n ROS_ERROR_THROTTLE(1, \\\"Planner not set up: No octomap available!\\\");\\n\\n return false;\\n\\n }\\n\\n\\n\\n ROS_INFO(\\\"Executing the Reactive Planner\\\");\\n\\n\\n\\n if(reactivePlannerServer->PathGeneration(current_pose_,end,Path))\\n\\n {\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n std::cout << cc.red << \\\"Planner Failed to generate planne... Skipping Navigation \\\\n\\\" << cc.reset;\\n\\n return false;\\n\\n }\\n\\n}\\n\\nstd::string ReactivePathPlanner::methodName(void)\\n\",\n \"file_path\": \"src/reactive_path_planner.cpp\",\n \"rank\": 71,\n \"score\": 43994.24560127945\n },\n {\n \"content\": \"{\\n\\n methodName_=\\\"ReactivePathPlanner\\\";\\n\\n return methodName_;\\n\\n}\\n\\n\\n\\nvoid ReactivePathPlanner::start()\\n\\n\\n\\n{\\n\\n //initiate the reactive planner service\\n\\n reactivePlannerServer= new ReactivePlannerServer(nh_,nh_private_,manager_);\\n\\n}\\n\\n\\n\\nvoid ReactivePathPlanner::SetDynamicGridSize(double x, double y, double z)\\n\\n{\\n\\n reactivePlannerServer->SetDynamicGridSize(x,y,z);\\n\\n}\\n\\n\\n\\nvoid ReactivePathPlanner::SetOriginPose(double x, double y, double z)\\n\\n{\\n\\n reactivePlannerServer->SetOriginPose(x,y,z);\\n\\n}\\n\",\n \"file_path\": \"src/reactive_path_planner.cpp\",\n \"rank\": 72,\n \"score\": 43992.01995055516\n },\n {\n \"content\": \" return false;\\n\\n }\\n\\n\\n\\n ROS_INFO(\\\"Executing the Planner Loop...\\\");\\n\\n\\n\\n if(reactivePlannerServer->PathGeneration(current_pose_,end,Path))\\n\\n {\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n ROS_INFO(\\\"No Path Found or planner not ready!\\\");\\n\\n return false;\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\nbool ReactivePathPlanner::GeneratePath(geometry_msgs::Pose end,std::vector<geometry_msgs::Pose> &Path)\\n\\n{\\n\\n if (getDistance(current_pose_,end)< d_close) // terminate if the end pose is at the robot current pose\\n\",\n \"file_path\": \"src/reactive_path_planner.cpp\",\n \"rank\": 73,\n \"score\": 43991.300300336115\n },\n {\n \"content\": \" void callbackCommandStatus(const std_msgs::Bool::ConstPtr& msg);\\n\\n bool GetStatus();\\n\\n\\n\\n ros::Time previous_time;\\n\\n\\n\\n bool Execute_waypoint(geometry_msgs::Pose p);\\n\\n bool Execute_path(nav_msgs::Path path);\\n\\n bool Execute_path(std::vector<geometry_msgs::Pose> path);\\n\\n\\n\\n};\\n\\n\\n\\n#endif // DRONE_COMMUNICATOR_H\\n\",\n \"file_path\": \"include/control/vehicle_communicator.h\",\n \"rank\": 74,\n \"score\": 41851.87826607616\n },\n {\n \"content\": \"\\n\\n double sensor_max_range,visualize_max_z,visualize_min_z,map_publish_frequency;\\n\\n bool treat_unknown_as_occupied;\\n\\n\\n\\npublic:\\n\\n\\n\\n void update();\\n\\n double compute2DRelativeRays();\\n\\n void compute2DRaysAtPose(geometry_msgs::Pose p);\\n\\n virtual void Initiate(bool publish, bool rebuild_once=false);\\n\\n void Done();\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n#endif // RAY_TRACING_2D_H\\n\",\n \"file_path\": \"include/victim_localization/raytracing_2d.h\",\n \"rank\": 75,\n \"score\": 41851.051509419085\n },\n {\n \"content\": \" void setOctomapManager(volumetric_mapping::OctomapManager *manager);\\n\\n void publish_Map(grid_map::GridMap Map);\\n\\n void SetNavMap(nav_msgs::OccupancyGridPtr Nav_map);\\n\\n virtual void update();\\n\\n virtual void Initiate(bool publish, bool rebuild_once=false){};\\n\\n virtual void Done(){};\\n\\n\\n\\n};\\n\\n\\n\\n#endif // RAY_TRACING_H\\n\",\n \"file_path\": \"include/victim_localization/raytracing.h\",\n \"rank\": 76,\n \"score\": 41850.79250174356\n },\n {\n \"content\": \"#ifndef IRIS_DRONE_COMMANDER_H\\n\\n#define IRIS_DRONE_COMMANDER_H\\n\\n\\n\\n#include \\\"control/vehicle_control_iris.h\\\"\\n\\n#include \\\"control/vehicle_control_iris_origin.h\\\"\\n\\n#include \\\"control/vehicle_control_floating_sensor.h\\\"\\n\\n#include \\\"std_msgs/Bool.h\\\"\\n\\n#include \\\"std_msgs/Int32.h\\\"\\n\\n#include \\\"victim_localization/rotate_action.h\\\"\\n\\n#include \\\"victim_localization/waypoint_action.h\\\"\\n\\n#include \\\"victim_localization/path_action.h\\\"\\n\\n#include \\\"victim_localization/path2_action.h\\\"\\n\\n#include \\\"victim_localization/status_action.h\\\"\\n\\n\\n\\nnamespace Command {\\n\",\n \"file_path\": \"include/control/vehicle_commander.h\",\n \"rank\": 77,\n \"score\": 41850.06269692413\n },\n {\n \"content\": \"#ifndef DRONE_COMMUNICATOR_H\\n\\n#define DRONE_COMMUNICATOR_H\\n\\n\\n\\n#include \\\"control/vehicle_control_iris.h\\\"\\n\\n#include \\\"std_msgs/Bool.h\\\"\\n\\n#include \\\"std_msgs/Int32.h\\\"\\n\\n#include \\\"victim_localization/volumetric_map_manager.h\\\"\\n\\n#include \\\"victim_localization/rotate_action.h\\\"\\n\\n#include \\\"victim_localization/path_action.h\\\"\\n\\n#include \\\"victim_localization/path2_action.h\\\"\\n\\n#include \\\"victim_localization/waypoint_action.h\\\"\\n\\n#include \\\"victim_localization/status_action.h\\\"\\n\\n#include \\\"rviz_visual_tools/rviz_visual_tools.h\\\"\\n\\n#include \\\"vehicle_control_base.h\\\"\\n\\n\\n\\n\\n\\n\\n\\nnamespace Command {\\n\",\n \"file_path\": \"include/control/vehicle_communicator.h\",\n \"rank\": 78,\n \"score\": 41849.93465785261\n },\n {\n \"content\": \"\\n\\n ros::ServiceServer service_rotation;\\n\\n ros::ServiceServer service_waypoint;\\n\\n ros::ServiceServer service_path;\\n\\n ros::ServiceServer service_path2;\\n\\n ros::ServiceServer service_status;\\n\\n void Takeoff();\\n\\n void rotate();\\n\\n void start();\\n\\n bool execute_rotation(victim_localization::rotate_action::Request &request,\\n\\n victim_localization::rotate_action::Response &respond);\\n\\n\\n\\n bool execute_waypoint(victim_localization::waypoint_action::Request &request,\\n\\n victim_localization::waypoint_action::Response &respond);\\n\\n\\n\\n bool execute_path(victim_localization::path_action::Request &request,\\n\\n victim_localization::path_action::Response &respond);\\n\\n\\n\\n bool execute_path2(victim_localization::path2_action::Request &request,\\n\\n victim_localization::path2_action::Response &respond);\\n\\n\\n\\n bool check_status(victim_localization::status_action::Request &request,\\n\\n victim_localization::status_action::Response &respond);\\n\\n\\n\\n};\\n\\n\\n\\n#endif // IRIS_DRONE_COMMANDER_H\\n\",\n \"file_path\": \"include/control/vehicle_commander.h\",\n \"rank\": 79,\n \"score\": 41849.71436329802\n },\n {\n \"content\": \"#ifndef RAY_TRACING_2D_H\\n\\n#define RAY_TRACING_2D_H\\n\\n\\n\\n#include <victim_localization/raytracing.h>\\n\\n\\n\\n\\n\\ntypedef geometry_msgs::Point Point;\\n\\ntypedef geometry_msgs::PoseStamped PoseStamped;\\n\\n\\n\\nusing namespace grid_map;\\n\\nusing namespace volumetric_mapping;\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/raytracing_2d.h\",\n \"rank\": 80,\n \"score\": 41846.849783215774\n },\n {\n \"content\": \"\\n\\n void Publish2DOctomap();\\n\\n void updateOctomapOccupancy(octomap::KeySet* free_cells,\\n\\n octomap::KeySet* occupied_cells);\\n\\n void ResetOctomapRebuild();\\n\\n\\n\\n grid_map::GridMap Generate_2D_Safe_Plane(geometry_msgs::Pose p, bool publish_=false, bool castThroughUnkown=true);\\n\\n\\n\\n void publish_Map2(GridMap Map);\\n\\n\\n\\n // Publish markers for visualization.\\n\\n ros::Publisher occupied_nodes_pub_;\\n\\n ros::Publisher free_nodes_pub_;\\n\\n ros::Publisher pub_temp_map1;\\n\\n\\n\\n grid_map::GridMap map_;\\n\\n std::shared_ptr<octomap::OcTree> octree_2d;\\n\\n bool rebuild_octomap_once;\\n\\n double octomap_height;\\n\\n bool rebuild_octomap_;\\n\",\n \"file_path\": \"include/victim_localization/raytracing_2d.h\",\n \"rank\": 81,\n \"score\": 41845.88665878092\n },\n {\n \"content\": \"\\n\\n victim_localization::rotate_action rotate_srv;\\n\\n victim_localization::waypoint_action waypoint_srv;\\n\\n victim_localization::path_action path_srv;\\n\\n victim_localization::path2_action path2_srv;\\n\\n victim_localization::status_action status_srv;\\n\\n\\n\\n geometry_msgs::Pose Waypoint_;\\n\\n nav_msgs::Path Path_;\\n\\n\\n\\n geometry_msgs::Pose current_pose;\\n\\n\\n\\n bool current_drone_status;\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr visualTools;\\n\\n\\n\\n\\n\\n geometry_msgs::Pose GetPose();\\n\\n void Check_MapManager_and_Drone_Ready();\\n\\n void callbackPose(const geometry_msgs::PoseStamped::ConstPtr& msg);\\n\",\n \"file_path\": \"include/control/vehicle_communicator.h\",\n \"rank\": 82,\n \"score\": 41845.228360274916\n },\n {\n \"content\": \"#ifndef TimeProfiler_H\\n\\n#define TimeProfiler_H\\n\\n\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n#include <chrono>\\n\\n#include <fstream>\\n\\n#include <map>\\n\\n\\n\",\n \"file_path\": \"include/utilities/time_profiler.h\",\n \"rank\": 83,\n \"score\": 41844.31264730584\n },\n {\n \"content\": \"/*\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Point Cloud Library (PCL) - www.pointclouds.org\\n\\n * Copyright (c) 2012-, Open Perception, Inc.\\n\\n *\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of the copyright holder(s) nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 84,\n \"score\": 41843.9161063502\n },\n {\n \"content\": \"#ifndef OCCLUSION_H_\\n\\n#define OCCLUSION_H_\\n\\n\\n\\n#include <iostream>\\n\\n\\n\\n#include \\\"ros/ros.h\\\"\\n\\n#include <ros/package.h>\\n\\n\\n\\n#include <eigen_conversions/eigen_msg.h>\\n\\n#include <Eigen/Geometry>\\n\\n#include <Eigen/Dense>\\n\\n\\n\\n#include <geometry_msgs/Pose.h>\\n\\n\\n\\n#include <pcl/io/pcd_io.h>\\n\\n#include <pcl/point_types.h>\\n\\n#include <pcl_conversions/pcl_conversions.h>\\n\\n#include <pcl/common/eigen.h>\\n\\n#include <pcl/common/transforms.h>\\n\\n#include <pcl/range_image/range_image.h>\\n\",\n \"file_path\": \"include/culling/occlusion_culling.h\",\n \"rank\": 85,\n \"score\": 41843.68700035304\n },\n {\n \"content\": \"#ifndef RAY_TRACING_H\\n\\n#define RAY_TRACING_H\\n\\n\\n\\n#include <ros/ros.h>\\n\\n#include <grid_map_ros/grid_map_ros.hpp>\\n\\n#include <grid_map_msgs/GridMap.h>\\n\\n#include <cmath>\\n\\n#include \\\"math.h\\\"\\n\\n#include <iostream>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include \\\"geometry_msgs/PointStamped.h\\\"\\n\\n#include <boost/filesystem.hpp>\\n\\n#include <boost/shared_ptr.hpp>\\n\\n#include <boost/array.hpp>\\n\\n#include <sensor_msgs/PointCloud.h>\\n\\n#include \\\"victim_localization/common.h\\\"\\n\\n#include <octomap_world/octomap_manager.h>\\n\\n#include <visualization_msgs/Marker.h>\\n\\n#include <std_msgs/Float32.h>\\n\",\n \"file_path\": \"include/victim_localization/raytracing.h\",\n \"rank\": 86,\n \"score\": 41843.39880571366\n },\n {\n \"content\": \"#ifndef STRAIGHTLINE_H\\n\\n#define STRAIGHTLINE_H\\n\\n\\n\\n#include \\\"victim_localization/navigation_base.h\\\"\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/straightline.h\",\n \"rank\": 87,\n \"score\": 41843.11924793462\n },\n {\n \"content\": \" * from this software without specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *\\n\\n */\\n\\n\\n\\n#include <pcl/point_types.h>\\n\\n#include <pcl/filters/filter_indices.h>\\n\\n#include <pcl/common/transforms.h>\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 88,\n \"score\": 41842.61458308899\n },\n {\n \"content\": \"#include <tf_conversions/tf_eigen.h>\\n\\n#include <tf/transform_listener.h>\\n\\n#include <Eigen/Geometry>\\n\\n#include <victim_localization/view_generator_ig.h>\\n\\n#include <control/vehicle_communicator.h>\\n\\n\\n\\n\\n\\ntypedef geometry_msgs::Point Point;\\n\\ntypedef geometry_msgs::PoseStamped PoseStamped;\\n\\n\\n\\nusing namespace grid_map;\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/raytracing.h\",\n \"rank\": 89,\n \"score\": 41842.597346839575\n },\n {\n \"content\": \"\\n\\nRaytracing(double map_res_);\\n\\nRaytracing(double map_res_, double HFOV_deg, double VFOV_deg, double max_d, double min_d);\\n\\n~Raytracing();\\n\\n\\n\\nvoid setCameraSettings(double fov_h, double fov_v, double r_max, double r_min);\\n\\nbool isInsideBounds(Position p);\\n\\n\\n\\npublic:\\n\\n\\n\\n bool isPointInBounds(octomap::point3d &p);\\n\\n void getCameraRotationMtxs();\\n\\n double getNodeOccupancy(octomap::OcTreeNode* node);\\n\\n double getNodeEntropy(octomap::OcTreeNode* node);\\n\\n int getPointCountAtOcTreeKey(octomap::OcTreeKey key);\\n\\n double computeRelativeRays();\\n\\n void computeRaysAtPose(geometry_msgs::Pose p);\\n\\n bool isInsideRegionofInterest(double z , double tolerance=0.3);\\n\\n void setDroneCommunicator(vehicle_communicator *drone_comm_);\\n\\n void setVehicle(VehicleControlBase *vehicle_);\\n\",\n \"file_path\": \"include/victim_localization/raytracing.h\",\n \"rank\": 90,\n \"score\": 41842.31191373775\n },\n {\n \"content\": \"\\n\\n#include <sensor_msgs/PointCloud2.h>\\n\\n\\n\\n#include <tf/tf.h>\\n\\n#include <tf_conversions/tf_eigen.h>\\n\\n\\n\\n#include <visualization_msgs/Marker.h>\\n\\n#include <visualization_msgs/MarkerArray.h>\\n\\n\\n\\n// Custom classes\\n\\n#include <culling/frustum_culling.h>\\n\\n#include <culling/voxel_grid_occlusion_estimation.h>\\n\\n\\n\",\n \"file_path\": \"include/culling/occlusion_culling.h\",\n \"rank\": 91,\n \"score\": 41838.98224228825\n },\n {\n \"content\": \" Eigen::Vector3f fp_tl;\\n\\n Eigen::Vector3f fp_tr;\\n\\n Eigen::Vector3f fp_bl;\\n\\n Eigen::Vector3f fp_br;\\n\\n \\n\\n Eigen::Vector3f np_tr;\\n\\n Eigen::Vector3f np_bl;\\n\\n Eigen::Vector3f np_br;\\n\\n Eigen::Vector3f np_tl;\\n\\n protected:\\n\\n using PCLBase<pcl::PointXYZ>::input_;\\n\\n using PCLBase<pcl::PointXYZ>::indices_;\\n\\n using Filter<pcl::PointXYZ>::filter_name_;\\n\\n using FilterIndices<pcl::PointXYZ>::negative_;\\n\\n using FilterIndices<pcl::PointXYZ>::keep_organized_;\\n\\n using FilterIndices<pcl::PointXYZ>::user_filter_value_;\\n\\n using FilterIndices<pcl::PointXYZ>::extract_removed_indices_;\\n\\n using FilterIndices<pcl::PointXYZ>::removed_indices_;\\n\\n\\n\\n /** \\\\brief Sample of point indices into a separate PointCloud\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 92,\n \"score\": 41838.62564268653\n },\n {\n \"content\": \" * fc.setCameraPose (pose_new);\\n\\n * \\\\endcode\\n\\n */\\n\\n void \\n\\n setCameraPose (const Eigen::Matrix4f& camera_pose)\\n\\n {\\n\\n camera_pose_ = camera_pose;\\n\\n }\\n\\n\\n\\n /** \\\\brief Get the pose of the camera w.r.t the origin */\\n\\n Eigen::Matrix4f\\n\\n getCameraPose () const\\n\\n {\\n\\n return (camera_pose_);\\n\\n }\\n\\n\\n\\n /** \\\\brief Set the horizontal field of view for the camera in degrees\\n\\n * \\\\param[in] hfov the field of view\\n\\n */\\n\\n void \\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 93,\n \"score\": 41837.58807951584\n },\n {\n \"content\": \" double y_arena_max;\\n\\n std::string camera_optical_frame;\\n\\n std::string base_frame;\\n\\n double tree_resolution;\\n\\n Eigen::Matrix3d camera_rotation_mtx_; // Camera rotation mtx\\n\\n double map_res;\\n\\n bool publish_ray_;\\n\\n ros::Publisher pub_temp_map;\\n\\n ros::NodeHandle nh_;\\n\\n\\n\\n\\n\\nstd::vector<Eigen::Vector3d> rays_far_plane_;\\n\\nstd::vector<octomap::point3d> rays_far_plane_at_pose_;\\n\\n\\n\\ndouble nav_bounds_x_max_, nav_bounds_y_max_, nav_bounds_z_max_;\\n\\ndouble nav_bounds_x_min_, nav_bounds_y_min_, nav_bounds_z_min_;\\n\\ndouble uav_fixed_height_;\\n\\n\\n\\nvirtual grid_map::GridMap Generate_2D_Safe_Plane(geometry_msgs::Pose p, bool publish_=false, bool castThroughUnkown=true);\\n\\n\\n\",\n \"file_path\": \"include/victim_localization/raytracing.h\",\n \"rank\": 94,\n \"score\": 41837.49455963446\n },\n {\n \"content\": \" * \\\\param[out] output the resultant point cloud\\n\\n */\\n\\n void\\n\\n applyFilter (PointCloud &output);\\n\\n\\n\\n /** \\\\brief Sample of point indices\\n\\n * \\\\param[out] indices the resultant point cloud indices\\n\\n */\\n\\n void\\n\\n applyFilter (std::vector<int> &indices);\\n\\n\\n\\n private:\\n\\n\\n\\n /** \\\\brief The camera pose */\\n\\n Eigen::Matrix4f camera_pose_;\\n\\n /** \\\\brief Horizontal field of view */\\n\\n float hfov_;\\n\\n /** \\\\brief Vertical field of view */\\n\\n float vfov_;\\n\\n /** \\\\brief Near plane distance */\\n\\n float np_dist_;\\n\\n /** \\\\brief Far plane distance */\\n\\n float fp_dist_;\\n\\n\\n\\n public:\\n\\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 95,\n \"score\": 41837.18983933975\n },\n {\n \"content\": \" Eigen::Vector3i max_b1, min_b1;\\n\\n visualization_msgs::Marker linesList1,linesList2,linesList3,linesList4;\\n\\n visualization_msgs::MarkerArray marker_array;\\n\\n pcl::FrustumCullingTT fc;\\n\\n double maxAccuracyError, minAccuracyError;\\n\\n\\n\\n // >>>>>>>>\\n\\n // Methods\\n\\n // >>>>>>>>\\n\\n //OcclusionCulling();\\n\\n //OcclusionCulling(std::string modelName);\\n\\n //OcclusionCulling(ros::NodeHandle & n, std::string modelName);\\n\\n OcclusionCulling(pcl::PointCloud<pcl::PointXYZ>::Ptr& cloudPtr);\\n\\n OcclusionCulling(pcl::PointCloud<pcl::PointXYZRGB>::Ptr& cloudPtr);\\n\\n \\n\\n ~OcclusionCulling(){};\\n\\n void initConfig(pcl::PointCloud<pcl::PointXYZ>::Ptr& cloudPtr);\\n\\n void initConfig(pcl::PointCloud<pcl::PointXYZ>::Ptr& cloudPtr, ros::NodeHandle nodeHandle);\\n\\n void visualizeRaycast(geometry_msgs::Pose location);\\n\\n \\n\",\n \"file_path\": \"include/culling/occlusion_culling.h\",\n \"rank\": 96,\n \"score\": 41837.181081487324\n },\n {\n \"content\": \" setHorizontalFOV (float hfov)\\n\\n {\\n\\n hfov_ = hfov;\\n\\n }\\n\\n\\n\\n /** \\\\brief Get the horizontal field of view for the camera in degrees */\\n\\n float \\n\\n getHorizontalFOV () const\\n\\n {\\n\\n return (hfov_);\\n\\n }\\n\\n\\n\\n /** \\\\brief Set the vertical field of view for the camera in degrees\\n\\n * \\\\param[in] vfov the field of view\\n\\n */\\n\\n void \\n\\n setVerticalFOV (float vfov)\\n\\n {\\n\\n vfov_ = vfov;\\n\\n }\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 97,\n \"score\": 41836.68338015755\n },\n {\n \"content\": \" {\\n\\n return (np_dist_);\\n\\n }\\n\\n\\n\\n /** \\\\brief Set the far plane distance\\n\\n * \\\\param[in] fp_dist the far plane distance\\n\\n */\\n\\n void \\n\\n setFarPlaneDistance (float fp_dist)\\n\\n {\\n\\n fp_dist_ = fp_dist;\\n\\n }\\n\\n\\n\\n /** \\\\brief Get the far plane distance */\\n\\n float \\n\\n getFarPlaneDistance () const\\n\\n {\\n\\n return (fp_dist_);\\n\\n }\\n\\n //added part for debuging\\n\",\n \"file_path\": \"include/culling/frustum_culling.h\",\n \"rank\": 98,\n \"score\": 41836.63492378264\n }\n]","isConversational":false}}},{"rowIdx":73,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"fin_control/src/fin_control.cpp"},"repo_name":{"kind":"string","value":"ChrisScianna/ROS-Underwater-RnD"},"commit":{"kind":"string","value":"f928bcc6b19a830b98e2cc2aedd65ff35b887901"},"file_code":{"kind":"string","value":"\n\n#include \"fin_control/fin_control.h\"\n\n#include <string>\n\n#include <diagnostic_tools/message_stagnation_check.h>\n#include <diagnostic_tools/periodic_message_status.h>\n\nnamespace qna\n{\nnamespace robot\n{\n\nFinControl::FinControl(ros::NodeHandle &nodeHandle)\n : nodeHandle(nodeHandle), diagnosticsUpdater(nodeHandle)\n{\n diagnosticsUpdater.setHardwareID(\"fin_control\");\n\n fincontrolEnabled = false;\n std::string serial_dev = \"/dev/ttyUSB0\";\n int serial_baud = 57600;\n ctrlFinOffset = 0;\n ctrlFinScaleFactor = 1.0;\n servosON = false;\n const char *log;\n currentLoggingEnabled = false;\n reportAngleRate = 25.0;\n minReportAngleRate = reportAngleRate / 2.0;\n maxReportAngleRate = reportAngleRate * 2.0;\n\n ros::NodeHandle nh;\n\n ROS_INFO(\"Starting fin_control node Version: [%s]\", NODE_VERSION);\n nh.setParam(\"/version_numbers/fin_control\", NODE_VERSION);\n\n if (nh.getParam(\"/fin_control/port\", serial_dev) == 0)\n ROS_INFO(\"Parmeter Not found defaullting Serial Port: [%s]\", serial_dev.c_str());\n\n nh.getParam(\"/fin_control/baud\", serial_baud);\n\n ROS_INFO(\"Serial Port: [%s]\", serial_dev.c_str());\n ROS_INFO(\"baud: [%d]\", serial_baud);\n\n maxCtrlFinAngle = degreesToRadians(10);\n nh.getParam(\"/fin_control/max_ctrl_fin_angle\", maxCtrlFinAngle);\n ROS_INFO(\"max cf angle: [%f] rad\", maxCtrlFinAngle);\n\n nh.getParam(\"/fin_control/ctrl_fin_offset\", ctrlFinOffset);\n ROS_INFO(\"cf offset: [%f] rad\", ctrlFinOffset);\n\n nh.getParam(\"/fin_control/ctrl_fin_scale_factor\", ctrlFinScaleFactor);\n ROS_INFO(\"cf scale: [%f]\", ctrlFinScaleFactor);\n\n nh.getParam(\"/fin_control/current_logging_enabled\", currentLoggingEnabled);\n if (currentLoggingEnabled) ROS_INFO(\"FIN CURRENT LOGGING ENABLED\");\n\n nh.getParam(\"/fin_control/report_angle_rate\", reportAngleRate);\n nh.getParam(\"/fin_control/min_report_angle_rate\", minReportAngleRate);\n nh.getParam(\"/fin_control/max_report_angle_rate\", maxReportAngleRate);\n\n ROS_INFO(\"fin control constructor enter\");\n\n subscriber_setAngles =\n nodeHandle.subscribe(\"/fin_control/set_angles\", 10, &FinControl::handleSetAngles, this);\n\n publisher_reportAngle =\n diagnostic_tools::create_publisher<fin_control::ReportAngle>(\n nodeHandle, \"/fin_control/report_angle\", 1);\n\n diagnostic_tools::PeriodicMessageStatusParams report_angle_rate_check_params;\n report_angle_rate_check_params.min_acceptable_period(minReportAngleRate);\n report_angle_rate_check_params.max_acceptable_period(maxReportAngleRate);\n report_angle_rate_check_params.abnormal_diagnostic(diagnostic_tools::Diagnostic::WARN);\n report_angle_rate_check_params.stale_diagnostic({ \n diagnostic_tools::Diagnostic::STALE, health_monitor::ReportFault::FIN_DATA_STALE\n }); \n diagnosticsUpdater.add(\n publisher_reportAngle.add_check<diagnostic_tools::PeriodicMessageStatus>(\n \"rate check\", report_angle_rate_check_params));\n\n timer_reportAngle = nodeHandle.createTimer(\n ros::Duration(1. / reportAngleRate), &FinControl::reportAngleSendTimeout, this);\n\n finAngleCheck = diagnostic_tools::create_health_check<double>(\n \"Fin angle within range\",\n [this](double angle) -> diagnostic_tools::Diagnostic\n {\n using diagnostic_tools::Diagnostic;\n if (std::abs(angle) > maxCtrlFinAngle)\n {\n using health_monitor::ReportFault;\n return Diagnostic(Diagnostic::WARN, ReportFault::FIN_DATA_THRESHOLD_REACHED)\n .description(\"Fin angle beyond limits: |%f| rad > %f rad\", angle, maxCtrlFinAngle);\n }\n return Diagnostic::OK;\n }); \n\n diagnosticsUpdater.add(finAngleCheck);\n\n if (myWorkBench.begin(serial_dev.c_str(), serial_baud, &log))\n {\n ROS_INFO(\"Dynamixel Workbench intialized\");\n }\n else\n {\n ROS_ERROR(\"Dynamixel Workbench failed init %s\", log);\n return;\n }\n\n numOfIDs = 0;\n\n if (myWorkBench.scan(ids, &numOfIDs, 1, 4, &log))\n {\n ROS_INFO(\"num of ids found [%d]\", numOfIDs);\n if (numOfIDs < NUM_FINS)\n ROS_WARN(\"Fin servos found: [%d] does not match expected number of fins [%d]\", numOfIDs,\n NUM_FINS);\n }\n else\n {\n ROS_ERROR(\"Servo scan failed! %s\", log);\n return;\n }\n \n for (int x = 0; x < numOfIDs; x++)\n {\n if (!myWorkBench.torqueOn(ids[x], &log))\n {\n ROS_ERROR(\"Could not set torque on fin sevro [%d] %s\", ids[x], log);\n return;\n }\n else\n {\n servosON = true;\n }\n }\n\n if (!myWorkBench.initBulkWrite(&log))\n {\n ROS_ERROR(\"Could not init bulk write %s\", log);\n return;\n }\n\n ros::spin();\n}\n\nFinControl::~FinControl()\n{\n const char *log;\n\n if (servosON)\n {\n ROS_INFO(\"Turning off fin servos\");\n \n for (int x = 0; x < numOfIDs; x++)\n {\n if (!myWorkBench.torqueOff(ids[x], &log))\n ROS_ERROR(\"Could not turn off torque on fin sevro [%d] %s\", ids[x], log);\n }\n }\n}\n\nvoid FinControl::reportAngles()\n{\n const char *log;\n fin_control::ReportAngle message;\n bool servos_angles_info_complete = true;\n float radianAngleFromMyWorkBench = 0.;\n\n message.header.stamp = ros::Time::now();\n\n for (int id = 1; id <= numOfIDs; ++id)\n {\n \n if (myWorkBench.getRadian(id, &radianAngleFromMyWorkBench, &log))\n {\n message.angles_in_radians.push_back(\n static_cast<float>(\n round(((radianAngleFromMyWorkBench / ctrlFinScaleFactor) - ctrlFinOffset) *\n 100.0) /\n 100.0));\n finAngleCheck.test(message.angles_in_radians.back());\n }\n else\n {\n servos_angles_info_complete = false;\n ROS_ERROR(\"Could not get servo angle for ID %d %s\", id, log);\n }\n }\n if (servos_angles_info_complete)\n {\n publisher_reportAngle.publish(message);\n }\n}\n\nfloat FinControl::degreesToRadians(float degrees) { return ((degrees / 180.0) * M_PI); }\n\nvoid FinControl::handleSetAngles(const fin_control::SetAngles::ConstPtr &msg)\n{\n const char *log;\n float angle_plus_offset;\n\n \n for (int i = 0; i < 4; i++)\n {\n if (fabs(msg->fin_angle_in_radians[i]) > maxCtrlFinAngle)\n {\n ROS_ERROR_STREAM(\"The Angle \" << i << \"to be set is out of range - value: \"\n << msg->fin_angle_in_radians[i]);\n return;\n }\n }\n\n boost::mutex::scoped_lock lock(m_mutex);\n\n if (!myWorkBench.initBulkWrite(&log))\n {\n ROS_ERROR(\"Could not init bulk write %s\", log);\n return;\n }\n\n int32_t current_data = 0;\n for (int i = 0; i < 4; ++i)\n {\n angle_plus_offset = ctrlFinScaleFactor * (msg->fin_angle_in_radians[i] + ctrlFinOffset);\n\n const int id = i + 1;\n if (!(myWorkBench.addBulkWriteParam(\n id, \"Goal_Position\", myWorkBench.convertRadian2Value(id, angle_plus_offset), &log)))\n {\n ROS_ERROR_STREAM(\"Could not add bulk write param \" << id << \" \" << log);\n return;\n }\n\n if (!myWorkBench.bulkWrite(&log))\n {\n ROS_ERROR_STREAM(\"Could not bulk write \" << log);\n }\n\n \n if (currentLoggingEnabled)\n {\n if (!myWorkBench.itemRead(id, \"Present_Current\", ¤t_data, &log))\n {\n ROS_ERROR_STREAM(\"Could not read current from finID: \" << id << \" log: \" << log);\n }\n else\n {\n ROS_DEBUG_STREAM(\"Current for Fin: \"\n << id << \" = \"\n << myWorkBench.convertValue2Current(static_cast<int16_t>(current_data)));\n }\n }\n }\n}\n\nvoid FinControl::reportAngleSendTimeout(const ros::TimerEvent &ev)\n{\n reportAngles();\n diagnosticsUpdater.update();\n}\n\n} \n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"fin_control/fin_control.h\"\n\n#include <string>\n\n#include <diagnostic_tools/message_stagnation_check.h>\n#include <diagnostic_tools/periodic_message_status.h>\n\nnamespace qna\n{\nnamespace robot\n{\n\nFinControl::FinControl(ros::NodeHandle &nodeHandle)\n : nodeHandle(nodeHandle), diagnosticsUpdater(nodeHandle)\n{\n diagnosticsUpdater.setHardwareID(\"fin_control\");\n\n fincontrolEnabled = false;\n std::string serial_dev = \"/dev/ttyUSB0\";\n int serial_baud = 57600;\n ctrlFinOffset = 0;\n ctrlFinScaleFactor = 1.0;\n servosON = false;\n const char *log;\n currentLoggingEnabled = false;\n reportAngleRate = 25.0;\n minReportAngleRate = reportAngleRate / 2.0;\n maxReportAngleRate = reportAngleRate * 2.0;\n\n ros::NodeHandle nh;\n\n ROS_INFO(\"Starting fin_control node Version: [%s]\", NODE_VERSION);\n nh.setParam(\"/version_numbers/fin_control\", NODE_VERSION);\n\n if (nh.getParam(\"/fin_control/port\", serial_dev) == 0)\n ROS_INFO(\"Parmeter Not found defaullting Serial Port: [%s]\", serial_dev.c_str());\n\n nh.getParam(\"/fin_control/baud\", serial_baud);\n\n ROS_INFO(\"Serial Port: [%s]\", serial_dev.c_str());\n ROS_INFO(\"baud: [%d]\", serial_baud);\n\n maxCtrlFinAngle = degreesToRadians(10);\n nh.getParam(\"/fin_control/max_ctrl_fin_angle\", maxCtrlFinAngle);\n ROS_INFO(\"max cf angle: [%f] rad\", maxCtrlFinAngle);\n\n nh.getParam(\"/fin_control/ctrl_fin_offset\", ctrlFinOffset);\n ROS_INFO(\"cf offset: [%f] rad\", ctrlFinOffset);\n\n nh.getParam(\"/fin_control/ctrl_fin_scale_factor\", ctrlFinScaleFactor);\n ROS_INFO(\"cf scale: [%f]\", ctrlFinScaleFactor);\n\n nh.getParam(\"/fin_control/current_logging_enabled\", currentLoggingEnabled);\n if (currentLoggingEnabled) ROS_INFO(\"FIN CURRENT LOGGING ENABLED\");\n\n nh.getParam(\"/fin_control/report_angle_rate\", reportAngleRate);\n nh.getParam(\"/fin_control/min_report_angle_rate\", minReportAngleRate);\n nh.getParam(\"/fin_control/max_report_angle_rate\", maxReportAngleRate);\n\n ROS_INFO(\"fin control constructor enter\");\n\n subscriber_setAngles =\n nodeHandle.subscribe(\"/fin_control/set_angles\", 10, &FinControl::handleSetAngles, this);\n\n publisher_reportAngle =\n diagnostic_tools::create_publisher<fin_control::ReportAngle>(\n nodeHandle, \"/fin_control/report_angle\", 1);\n\n diagnostic_tools::PeriodicMessageStatusParams report_angle_rate_check_params;\n report_angle_rate_check_params.min_acceptable_period(minReportAngleRate);\n report_angle_rate_check_params.max_acceptable_period(maxReportAngleRate);\n report_angle_rate_check_params.abnormal_diagnostic(diagnostic_tools::Diagnostic::WARN);\n report_angle_rate_check_params.stale_diagnostic({ \n diagnostic_tools::Diagnostic::STALE, health_monitor::ReportFault::FIN_DATA_STALE\n }); \n diagnosticsUpdater.add(\n publisher_reportAngle.add_check<diagnostic_tools::PeriodicMessageStatus>(\n \"rate check\", report_angle_rate_check_params));\n\n timer_reportAngle = nodeHandle.createTimer(\n ros::Duration(1. / reportAngleRate), &FinControl::reportAngleSendTimeout, this);\n\n finAngleCheck = diagnostic_tools::create_health_check<double>(\n \"Fin angle within range\",\n [this](double angle) -> diagnostic_tools::Diagnostic\n {\n using diagnostic_tools::Diagnostic;\n if (std::abs(angle) > maxCtrlFinAngle)\n {\n using health_monitor::ReportFault;\n return Diagnostic(Diagnostic::WARN, ReportFault::FIN_DATA_THRESHOLD_REACHED)\n .description(\"Fin angle beyond limits: |%f| rad > %f rad\", angle, maxCtrlFinAngle);\n }\n return Diagnostic::OK;\n }); \n\n diagnosticsUpdater.add(finAngleCheck);\n\n if (myWorkBench.begin(serial_dev.c_str(), serial_baud, &log))\n {\n ROS_INFO(\"Dynamixel Workbench intialized\");\n }\n else\n {\n ROS_ERROR(\"Dynamixel Workbench failed init %s\", log);\n return;\n }\n\n numOfIDs = 0;\n\n if (myWorkBench.scan(ids, &numOfIDs, 1, 4, &log))\n {\n ROS_INFO(\"num of ids found [%d]\", numOfIDs);\n if (numOfIDs < NUM_FINS)\n ROS_WARN(\"Fin servos found: [%d] does not match expected number of fins [%d]\", numOfIDs,\n NUM_FINS);\n }\n else\n {\n ROS_ERROR(\"Servo scan failed! %s\", log);\n return;\n }\n \n for (int x = 0; x < numOfIDs; x++)\n {\n if (!myWorkBench.torqueOn(ids[x], &log))\n {\n ROS_ERROR(\"Could not set torque on fin sevro [%d] %s\", ids[x], log);\n return;\n }\n else\n {\n servosON = true;\n }\n }\n\n if (!myWorkBench.initBulkWrite(&log))\n {\n ROS_ERROR(\"Could not init bulk write %s\", log);\n return;\n }\n\n ros::spin();\n}\n\nFinControl::~FinControl()\n{\n const char *log;\n\n if (servosON)\n {\n ROS_INFO(\"Turning off fin servos\");\n \n for (int x = 0; x < numOfIDs; x++)\n {\n if (!myWorkBench.torqueOff(ids[x], &log))\n ROS_ERROR(\"Could not turn off torque on fin sevro [%d] %s\", ids[x], log);\n }\n }\n}\n\nvoid FinControl::reportAngles()\n{\n const char *log;\n fin_control::ReportAngle message;\n bool servos_angles_info_complete = true;\n float radianAngleFromMyWorkBench = 0.;\n\n message.header.stamp = ros::Time::now();\n\n for (int id = 1; id <= numOfIDs; ++id)\n {\n \n if (myWorkBench.getRadian(id, &radianAngleFromMyWorkBench, &log))\n {\n message.angles_in_radians.push_back(\n static_cast<floa"},"suffix":{"kind":"string","value":"\n\nfloat FinControl::degreesToRadians(float degrees) { return ((degrees / 180.0) * M_PI); }\n\nvoid FinControl::handleSetAngles(const fin_control::SetAngles::ConstPtr &msg)\n{\n const char *log;\n float angle_plus_offset;\n\n \n for (int i = 0; i < 4; i++)\n {\n if (fabs(msg->fin_angle_in_radians[i]) > maxCtrlFinAngle)\n {\n ROS_ERROR_STREAM(\"The Angle \" << i << \"to be set is out of range - value: \"\n << msg->fin_angle_in_radians[i]);\n return;\n }\n }\n\n boost::mutex::scoped_lock lock(m_mutex);\n\n if (!myWorkBench.initBulkWrite(&log))\n {\n ROS_ERROR(\"Could not init bulk write %s\", log);\n return;\n }\n\n int32_t current_data = 0;\n for (int i = 0; i < 4; ++i)\n {\n angle_plus_offset = ctrlFinScaleFactor * (msg->fin_angle_in_radians[i] + ctrlFinOffset);\n\n const int id = i + 1;\n if (!(myWorkBench.addBulkWriteParam(\n id, \"Goal_Position\", myWorkBench.convertRadian2Value(id, angle_plus_offset), &log)))\n {\n ROS_ERROR_STREAM(\"Could not add bulk write param \" << id << \" \" << log);\n return;\n }\n\n if (!myWorkBench.bulkWrite(&log))\n {\n ROS_ERROR_STREAM(\"Could not bulk write \" << log);\n }\n\n \n if (currentLoggingEnabled)\n {\n if (!myWorkBench.itemRead(id, \"Present_Current\", ¤t_data, &log))\n {\n ROS_ERROR_STREAM(\"Could not read current from finID: \" << id << \" log: \" << log);\n }\n else\n {\n ROS_DEBUG_STREAM(\"Current for Fin: \"\n << id << \" = \"\n << myWorkBench.convertValue2Current(static_cast<int16_t>(current_data)));\n }\n }\n }\n}\n\nvoid FinControl::reportAngleSendTimeout(const ros::TimerEvent &ev)\n{\n reportAngles();\n diagnosticsUpdater.update();\n}\n\n} \n} \n"},"middle":{"kind":"string","value":"t>(\n round(((radianAngleFromMyWorkBench / ctrlFinScaleFactor) - ctrlFinOffset) *\n 100.0) /\n 100.0));\n finAngleCheck.test(message.angles_in_radians.back());\n }\n else\n {\n servos_angles_info_complete = false;\n ROS_ERROR(\"Could not get servo angle for ID %d %s\", id, log);\n }\n }\n if (servos_angles_info_complete)\n {\n publisher_reportAngle.publish(message);\n }\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"class IntrospectableNode<BaseNodeT, true> : public BaseNodeT\n\n{\n\n public:\n\n IntrospectableNode(const std::string& name, const BT::NodeConfiguration& config)\n\n : BaseNodeT(name), blackboard_(config.blackboard)\n\n {\n\n }\n\n\n\n BT::NodeStatus executeTick() override\n\n {\n\n if (BT::NodeStatus::IDLE == this->status())\n\n {\n\n parent_path_ =\n\n introspection::extendActivePath(blackboard_.get(), this->name());\n\n }\n\n // NOTE(hidmic): this will not work for async and coroutine-based action types.\n\n // The BT library does not lend itself well to built-in node types extension.\n\n BT::NodeStatus current_status = BaseNodeT::executeTick();\n\n\n\n if (BT::NodeStatus::RUNNING != current_status)\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":0,"score":196185.8618802681},{"content":"class AttitudeServoNode : public ReactiveActionNode\n\n{\n\npublic:\n\n AttitudeServoNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return MakePortsList(\n\n InputPort<double, HasTolerance, HasAngleUnits>(\n\n \"roll\", NAN, \"Roll angle to reach\"),\n\n InputPort<double, HasTolerance, HasAngleUnits>(\n\n \"pitch\", NAN, \"Pitch angle to reach\"),\n\n InputPort<double, HasTolerance, HasAngleUnits>(\n\n \"yaw\", NAN, \"Yaw angle to reach\"),\n\n BT::InputPort<double>(\"speed_knots\", NAN, \"Cruise speed to command, in knots\"));\n\n }\n\n\n\nprivate:\n\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\n\n\n","file_path":"mission_control/include/mission_control/behaviors/attitude_servo.h","rank":1,"score":189528.7938831936},{"content":"class LogToBagfileNode : public BT::DecoratorNode\n\n{\n\n public:\n\n struct Options\n\n {\n\n static BT::PortsList portsList()\n\n {\n\n static const Options options;\n\n return {\n\n BT::InputPort<std::string>(\n\n \"prefix\", options.prefix,\n\n \"Prefix for bag filename. If relative, it is resolved against the ROS log directory. \"\n\n \"If it lacks the '.bag' extension, a '{timestamp}.bag' suffix is appended.\"),\n\n BT::InputPort<std::string>(\n\n \"topics\", \"all\",\n\n \"Topic names to be logged as a comma-separated list. If the 'all' value is given, \"\n\n \"all topics are logged by periodically looking up the ROS graph.\"),\n\n BT::InputPort<rosbag::CompressionType>(\n\n \"compression\", options.writer_options.compression,\n\n \"Compression type to be used. Supported types are 'none', 'bz2', and 'lz4'.\")};\n","file_path":"mission_control/include/mission_control/behaviors/log_to_bagfile.h","rank":2,"score":189511.89727815945},{"content":"class SetFinDeflection : public JausMessageIn {\n\n private:\n\n void commandFinAngles(const ros::TimerEvent& ev);\n\n\n\n int8_t _finId; // 1 byte\n\n int8_t _deflectionAngle; // 1 byte\n\n int8_t _deflectionRateCmd; // 1 byte but not used\n\n ros::Publisher _publisher_setAngles;\n\n ros::Timer _commandFinAnglesTimer;\n\n std::vector<float> _finAngles{0.,0.,0.,0.};\n\n\n\n public:\n\n void init(ros::NodeHandle* nodeHandle);\n\n void PublishFinAngles(const bool enable);\n\n\n\n void ProcessData(char* message);\n\n\n\n int8_t GetFinID();\n\n int8_t GetDeflectionAngle();\n\n int8_t GetDeflectionRateCmd();\n\n};\n\n\n\n#endif /* SETFINDEFLECTION_H_ */\n","file_path":"jaus_ros_bridge/include/SetFinDeflection.h","rank":3,"score":184488.28551864854},{"content":"class SetAltitudeHeadingNode : public ReactiveActionNode\n\n{\n\npublic:\n\n SetAltitudeHeadingNode(const std::string &name, const BT::NodeConfiguration &config);\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return MakePortsList(\n\n InputPort<double, HasTolerance>(\n\n \"altitude\", NAN, \"Altitude to reach (positive up), in meters\"),\n\n InputPort<double, HasTolerance, HasAngleUnits>(\n\n \"heading\", NAN, \"Heading (or yaw) to reach\"),\n\n BT::InputPort<double>(\"speed_knots\", NAN, \"Cruise speed to command, in knots\"));\n\n }\n\n\n\nprivate:\n\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\n\n\n\n BT::NodeStatus setUp() override;\n\n BT::NodeStatus doWork() override;\n","file_path":"mission_control/include/mission_control/behaviors/set_altitude_heading.h","rank":4,"score":182718.7812501337},{"content":"class SetDepthHeadingNode : public ReactiveActionNode\n\n{\n\n public:\n\n SetDepthHeadingNode(const std::string &name, const BT::NodeConfiguration &config);\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return MakePortsList(\n\n InputPort<double, HasTolerance>(\n\n \"depth\", NAN, \"Depth to reach (positive down), in meters\"),\n\n InputPort<double, HasTolerance, HasAngleUnits>(\n\n \"heading\", NAN, \"Heading (or yaw) to reach\"),\n\n BT::InputPort<double>(\"speed_knots\", NAN, \"Cruise speed to command, in knots\"));\n\n }\n\n\n\n private:\n\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\n\n\n\n BT::NodeStatus setUp() override;\n\n BT::NodeStatus doWork() override;\n","file_path":"mission_control/include/mission_control/behaviors/set_depth_heading.h","rank":5,"score":182718.7812501337},{"content":"class FinControl\n\n{\n\n public:\n\n explicit FinControl(ros::NodeHandle& nodeHandle);\n\n virtual ~FinControl();\n\n\n\n private:\n\n bool fincontrolEnabled;\n\n bool servosON;\n\n bool currentLoggingEnabled;\n\n\n\n void reportAngles();\n\n\n\n float degreesToRadians(float degrees);\n\n\n\n void reportAngleSendTimeout(const ros::TimerEvent& ev);\n\n void handleSetAngles(const fin_control::SetAngles::ConstPtr& msg);\n\n\n\n double maxCtrlFinAngle;\n\n double ctrlFinOffset;\n","file_path":"fin_control/include/fin_control/fin_control.h","rank":6,"score":175067.3718278023},{"content":" double ctrlFinScaleFactor;\n\n\n\n double reportAngleRate;\n\n double minReportAngleRate;\n\n double maxReportAngleRate;\n\n\n\n ros::NodeHandle& nodeHandle;\n\n ros::Subscriber subscriber_setAngles;\n\n ros::Subscriber subscriber_enableReportAngles;\n\n diagnostic_tools::DiagnosedPublisher<\n\n fin_control::ReportAngle> publisher_reportAngle;\n\n ros::Timer timer_reportAngle;\n\n\n\n DynamixelWorkbench myWorkBench;\n\n\n\n uint8_t ids[10];\n\n uint8_t numOfIDs;\n\n\n\n boost::mutex m_mutex;\n\n\n\n diagnostic_tools::HealthCheck<double> finAngleCheck;\n\n diagnostic_updater::Updater diagnosticsUpdater;\n\n};\n\n\n\n} // namespace robot\n\n} // namespace qna\n\n\n\n#endif // FIN_CONTROL_FIN_CONTROL_H\n","file_path":"fin_control/include/fin_control/fin_control.h","rank":7,"score":174122.78928462663},{"content":"#include <fin_control/SetAngles.h>\n\n#include <health_monitor/ReportFault.h>\n\n\n\n#include \"dynamixel_workbench_msgs/DynamixelCommand.h\"\n\n#include \"dynamixel_workbench_msgs/DynamixelInfo.h\"\n\n#include \"dynamixel_workbench_msgs/GetDynamixelInfo.h\"\n\n#include \"dynamixel_workbench_toolbox/dynamixel_workbench.h\"\n\n\n\nnamespace qna\n\n{\n\nnamespace robot\n\n{\n","file_path":"fin_control/include/fin_control/fin_control.h","rank":8,"score":174104.9814148911},{"content":"#ifndef FIN_CONTROL_FIN_CONTROL_H\n\n#define FIN_CONTROL_FIN_CONTROL_H\n\n\n\n#define NUM_FINS 4\n\n#define NODE_VERSION \"1.8x\"\n\n\n\n#include <pthread.h>\n\n#include <stdio.h>\n\n#include <sys/select.h>\n\n#include <string>\n\n\n\n#include <ros/ros.h>\n\n\n\n#include <boost/thread.hpp>\n\n#include <boost/thread/mutex.hpp>\n\n\n\n#include <diagnostic_tools/diagnosed_publisher.h>\n\n#include <diagnostic_tools/health_check.h>\n\n#include <diagnostic_updater/diagnostic_updater.h>\n\n#include <fin_control/ReportAngle.h>\n","file_path":"fin_control/include/fin_control/fin_control.h","rank":9,"score":174102.83773817477},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\n\n\n\n/*\n\n * fin_control.h\n\n */\n\n\n","file_path":"fin_control/include/fin_control/fin_control.h","rank":10,"score":174085.80087345548},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2020, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"fin_control/include/fin_control/fin_control.h","rank":11,"score":174069.1111305272},{"content":" double read_period_;\n\n double write_period_;\n\n double pub_period_;\n\n\n\n bool is_moving_;\n\n\n\n public:\n\n DynamixelController();\n\n ~DynamixelController();\n\n\n\n bool initWorkbench(const std::string port_name, const uint32_t baud_rate);\n\n bool getDynamixelsInfo(const std::string yaml_file);\n\n bool loadDynamixels(void);\n\n bool initDynamixels(void);\n\n bool initSDKHandlers(void);\n\n bool getPresentPosition(std::vector<std::string> dxl_name);\n\n\n\n double getReadPeriod(){return read_period_;}\n\n double getWritePeriod(){return write_period_;}\n\n double getPublishPeriod(){return pub_period_;}\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":12,"score":161834.72577428824},{"content":"\n\n void initPublisher(void);\n\n void initSubscriber(void);\n\n\n\n void initServer();\n\n\n\n void readCallback(const ros::TimerEvent&);\n\n void writeCallback(const ros::TimerEvent&);\n\n void publishCallback(const ros::TimerEvent&);\n\n\n\n void commandVelocityCallback(const geometry_msgs::Twist::ConstPtr &msg);\n\n void trajectoryMsgCallback(const trajectory_msgs::JointTrajectory::ConstPtr &msg);\n\n bool dynamixelCommandMsgCallback(dynamixel_workbench_msgs::DynamixelCommand::Request &req,\n\n dynamixel_workbench_msgs::DynamixelCommand::Response &res);\n\n};\n\n\n\n#endif //DYNAMIXEL_WORKBENCH_CONTROLLERS_H\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":13,"score":161824.44554412903},{"content":"/*******************************************************************************\n\n* Copyright 2018 ROBOTIS CO., LTD.\n\n*\n\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n\n* you may not use this file except in compliance with the License.\n\n* You may obtain a copy of the License at\n\n*\n\n* http://www.apache.org/licenses/LICENSE-2.0\n\n*\n\n* Unless required by applicable law or agreed to in writing, software\n\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n* See the License for the specific language governing permissions and\n\n* limitations under the License.\n\n*******************************************************************************/\n\n\n\n/* Authors: Taehun Lim (Darby) */\n\n\n\n#ifndef DYNAMIXEL_WORKBENCH_CONTROLLERS_H\n\n#define DYNAMIXEL_WORKBENCH_CONTROLLERS_H\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":14,"score":161815.72066875966},{"content":"\n\n#include <ros/ros.h>\n\n\n\n#include <yaml-cpp/yaml.h>\n\n\n\n#include <sensor_msgs/JointState.h>\n\n#include <geometry_msgs/Twist.h>\n\n#include <trajectory_msgs/JointTrajectory.h>\n\n#include <trajectory_msgs/JointTrajectoryPoint.h>\n\n\n\n#include <dynamixel_workbench_toolbox/dynamixel_workbench.h>\n\n#include <dynamixel_workbench_msgs/DynamixelStateList.h>\n\n#include <dynamixel_workbench_msgs/DynamixelCommand.h>\n\n\n\n#include <dynamixel_workbench_controllers/trajectory_generator.h>\n\n\n\n// SYNC_WRITE_HANDLER\n\n#define SYNC_WRITE_HANDLER_FOR_GOAL_POSITION 0\n\n#define SYNC_WRITE_HANDLER_FOR_GOAL_VELOCITY 1\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":15,"score":161814.2024360993},{"content":" // ROS Service Client\n\n\n\n // Dynamixel Workbench Parameters\n\n DynamixelWorkbench *dxl_wb_;\n\n std::map<std::string, uint32_t> dynamixel_;\n\n std::vector<std::pair<std::string, ItemValue>> dynamixel_info_;\n\n dynamixel_workbench_msgs::DynamixelStateList dynamixel_state_list_;\n\n sensor_msgs::JointState joint_state_msg_;\n\n std::vector<WayPoint> pre_goal_;\n\n\n\n bool is_joint_state_topic_;\n\n bool is_cmd_vel_topic_;\n\n bool use_moveit_;\n\n\n\n double wheel_separation_;\n\n double wheel_radius_;\n\n\n\n JointTrajectory *jnt_tra_;\n\n trajectory_msgs::JointTrajectory *jnt_tra_msg_;\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":16,"score":161810.5548302992},{"content":"// SYNC_READ_HANDLER(Only for Protocol 2.0)\n\n#define SYNC_READ_HANDLER_FOR_PRESENT_POSITION_VELOCITY_CURRENT 0\n\n\n\n// Protocol 2.0\n\n#define ADDR_PRESENT_CURRENT_2 126\n\n#define ADDR_PRESENT_VELOCITY_2 128\n\n#define ADDR_PRESENT_POSITION_2 132\n\n\n\n#define LENGTH_PRESENT_CURRENT_2 2\n\n#define LENGTH_PRESENT_VELOCITY_2 4\n\n#define LENGTH_PRESENT_POSITION_2 4\n\n\n\n// Protocol 2.0 (XL-320)\n\n#define ADDR_PRESENT_LOAD_XL_320 41\n\n#define ADDR_PRESENT_VELOCITY_XL_320 39\n\n#define ADDR_PRESENT_POSITION_XL_320 37\n\n\n\n#define LENGTH_PRESENT_LOAD_XL_320 2\n\n#define LENGTH_PRESENT_VELOCITY_XL_320 2\n\n#define LENGTH_PRESENT_POSITION_XL_320 2\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":17,"score":161797.42299401393},{"content":"\n\n// Protocol 1.0\n\n#define ADDR_PRESENT_LOAD_1 40\n\n#define ADDR_PRESENT_VELOCITY_1 38\n\n#define ADDR_PRESENT_POSITION_1 36\n\n\n\n#define LENGTH_PRESENT_LOAD_1 2\n\n#define LENGTH_PRESENT_VELOCITY_1 2\n\n#define LENGTH_PRESENT_POSITION_1 2\n\n\n\n//#define DEBUG\n\n\n\ntypedef struct\n\n{\n\n std::string item_name;\n\n int32_t value;\n\n} ItemValue;\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":18,"score":161796.20675618658},{"content":"class DynamixelController\n\n{\n\n private:\n\n // ROS NodeHandle\n\n ros::NodeHandle node_handle_;\n\n ros::NodeHandle priv_node_handle_;\n\n\n\n // ROS Parameters\n\n\n\n // ROS Topic Publisher\n\n ros::Publisher dynamixel_state_list_pub_;\n\n ros::Publisher joint_states_pub_;\n\n\n\n // ROS Topic Subscriber\n\n ros::Subscriber cmd_vel_sub_;\n\n ros::Subscriber trajectory_sub_;\n\n\n\n // ROS Service Server\n\n ros::ServiceServer dynamixel_command_server_;\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h","rank":19,"score":161101.71113395068},{"content":"/*******************************************************************************\n\n* Copyright 2018 ROBOTIS CO., LTD.\n\n*\n\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n\n* you may not use this file except in compliance with the License.\n\n* You may obtain a copy of the License at\n\n*\n\n* http://www.apache.org/licenses/LICENSE-2.0\n\n*\n\n* Unless required by applicable law or agreed to in writing, software\n\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n* See the License for the specific language governing permissions and\n\n* limitations under the License.\n\n*******************************************************************************/\n\n\n\n/* Authors: Darby Lim, Hye-Jong KIM, Ryan Shim, Yong-Ho Na */\n\n\n\n#ifndef TRAJECTORY_GENERATOR_H_\n\n#define TRAJECTORY_GENERATOR_H_\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h","rank":20,"score":154153.37959412835},{"content":"\n\n#include <math.h>\n\n#include <vector>\n\n\n\n#include <eigen3/Eigen/Eigen>\n\n#include <eigen3/Eigen/LU>\n\n#include <eigen3/Eigen/QR>\n\n\n\ntypedef struct _Point\n\n{\n\n double position;\n\n double velocity;\n\n double acceleration;\n\n} WayPoint;\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h","rank":21,"score":154146.65474834817},{"content":"class IntrospectableNode;\n\n\n\ntemplate<class BaseNodeT>\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":22,"score":152333.6190622801},{"content":"class MissionControlNode\n\n{\n\npublic:\n\n MissionControlNode();\n\n\n\n void spin();\n\n\n\nprivate:\n\n int loadMission(const std::string& path);\n\n void reportOn(const Mission& mission);\n\n void update(const ros::TimerEvent& ev);\n\n\n\n void reportHeartbeat(const ros::TimerEvent& ev);\n\n\n\n void loadMissionCallback(const LoadMission& msg);\n\n void executeMissionCallback(const ExecuteMission& msg);\n\n void abortMissionCallback(const AbortMission& msg);\n\n void queryMissionsCallback(const QueryMissions& msg);\n\n void removeMissionsCallback(const RemoveMissions& msg);\n\n void stopMissionsCallback(const std_msgs::Empty&);\n","file_path":"mission_control/include/mission_control/mission_control.h","rank":23,"score":149027.44889161078},{"content":"class JointTrajectory\n\n{\n\nprivate:\n\n MinimumJerk trajectory_generator_;\n\n\n\n uint8_t joint_num_;\n\n Eigen::MatrixXd coefficient_;\n\n std::vector<WayPoint> joint_way_point_;\n\n\n\npublic:\n\n JointTrajectory();\n\n virtual ~JointTrajectory();\n\n\n\n void setJointNum(uint8_t joint_num);\n\n void init(double move_time,\n\n double control_time,\n\n std::vector<WayPoint> start,\n\n std::vector<WayPoint> goal\n\n );\n\n\n\n std::vector<WayPoint> getJointWayPoint(double tick);\n\n\n\n Eigen::MatrixXd getCoefficient();\n\n};\n\n\n\n#endif // TRAJECTORY_GENERATOR_H_\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h","rank":24,"score":148601.6436905654},{"content":"class MinimumJerk\n\n{\n\nprivate:\n\n Eigen::VectorXd coefficient_;\n\n\n\npublic:\n\n MinimumJerk();\n\n virtual ~MinimumJerk();\n\n\n\n void calcCoefficient(WayPoint start,\n\n WayPoint goal,\n\n double move_time,\n\n double control_time);\n\n\n\n Eigen::VectorXd getCoefficient();\n\n};\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h","rank":25,"score":148601.6436905654},{"content":" BT::NodeStatus setUp() override;\n\n BT::NodeStatus doWork() override;\n\n void tearDown() override;\n\n\n\n ros::NodeHandle nh_;\n\n ros::Publisher attitude_servo_pub_;\n\n ros::Subscriber state_sub_;\n\n\n\n double target_roll_;\n\n double target_pitch_;\n\n double target_yaw_;\n\n double speed_knots_;\n\n uint8_t enable_mask_;\n\n\n\n double roll_tolerance_;\n\n double pitch_tolerance_;\n\n double yaw_tolerance_;\n\n\n\n auv_interfaces::StateStamped::ConstPtr state_;\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_ATTITUDE_SERVO_H\n","file_path":"mission_control/include/mission_control/behaviors/attitude_servo.h","rank":26,"score":146339.02852057942},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\n\n\n\n#ifndef MISSION_CONTROL_BEHAVIORS_ATTITUDE_SERVO_H\n\n#define MISSION_CONTROL_BEHAVIORS_ATTITUDE_SERVO_H\n\n\n\n#include <behaviortree_cpp_v3/basic_types.h>\n","file_path":"mission_control/include/mission_control/behaviors/attitude_servo.h","rank":27,"score":146328.65889157212},{"content":"#include <behaviortree_cpp_v3/behavior_tree.h>\n\n#include <behaviortree_cpp_v3/bt_factory.h>\n\n#include <ros/ros.h>\n\n\n\n#include <string>\n\n\n\n#include \"auv_interfaces/StateStamped.h\"\n\n#include \"mission_control/behaviors/helpers.h\"\n\n#include \"mission_control/behaviors/reactive_action.h\"\n\n\n\n\n\nnamespace mission_control\n\n{\n","file_path":"mission_control/include/mission_control/behaviors/attitude_servo.h","rank":28,"score":146324.50802976207},{"content":" bool startLogging();\n\n bool stopLogging();\n\n\n\n ros::NodeHandle nh_;\n\n Options options_;\n\n bool read_parameter_from_ports_;\n\n\n\n internal::AsyncBagWriter bag_writer_;\n\n internal::GenericSubscription subscription_;\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_LOG_TO_BAGFILE_H\n","file_path":"mission_control/include/mission_control/behaviors/log_to_bagfile.h","rank":29,"score":146323.20170217854},{"content":" }\n\n\n\n static Options populateFromPorts(BT::TreeNode * node);\n\n\n\n std::string prefix{\"mission_bag_\"};\n\n std::vector<std::string> topics{};\n\n internal::AsyncBagWriter::Options writer_options{};\n\n };\n\n\n\n static BT::PortsList providedPorts() { return Options::portsList(); }\n\n\n\n LogToBagfileNode(const std::string& name, Options options);\n\n\n\n LogToBagfileNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n void halt() override;\n\n\n\n private:\n\n BT::NodeStatus tick() override;\n\n\n","file_path":"mission_control/include/mission_control/behaviors/log_to_bagfile.h","rank":30,"score":146315.06149579637},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n#ifndef MISSION_CONTROL_BEHAVIORS_LOG_TO_BAGFILE_H\n\n#define MISSION_CONTROL_BEHAVIORS_LOG_TO_BAGFILE_H\n\n\n\n#include <behaviortree_cpp_v3/basic_types.h>\n\n#include <behaviortree_cpp_v3/decorator_node.h>\n\n\n\n#include <ros/ros.h>\n","file_path":"mission_control/include/mission_control/behaviors/log_to_bagfile.h","rank":31,"score":146314.31912902687},{"content":"\n\n#include <string>\n\n#include <vector>\n\n\n\n#include \"mission_control/behaviors/internal/async_bag_writer.h\"\n\n#include \"mission_control/behaviors/internal/generic_subscription.h\"\n\n\n\n\n\nnamespace mission_control\n\n{\n\n\n","file_path":"mission_control/include/mission_control/behaviors/log_to_bagfile.h","rank":32,"score":146310.73654693487},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2020, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"mission_control/include/mission_control/behaviors/attitude_servo.h","rank":33,"score":146307.4610473709},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2021, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"mission_control/include/mission_control/behaviors/log_to_bagfile.h","rank":34,"score":146292.49466259216},{"content":"\n\n#include <string>\n\n\n\n#include \"mission_control/behaviors/introspection.h\"\n\n\n\n\n\nnamespace mission_control\n\n{\n\n\n\n// NOTE(hidmic): this is insane, but BT library support for\n\n// various constructor forms left little margin.\n\ntemplate<class BaseNodeT, bool default_constructible_only =\n\n BT::has_default_constructor<BaseNodeT>::value &&\n\n !BT::has_params_constructor<BaseNodeT>::value>\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":35,"score":146285.516079933},{"content":" {\n\n introspection::setActivePath(blackboard_.get(), parent_path_);\n\n }\n\n return current_status;\n\n }\n\n\n\n void halt() override\n\n {\n\n introspection::setActivePath(blackboard_.get(), parent_path_);\n\n\n\n BaseNodeT::halt();\n\n }\n\n\n\n private:\n\n BT::Blackboard::Ptr blackboard_;\n\n std::string parent_path_{};\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_INTROSPECTABLE_NODE_H\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":36,"score":146283.68555754237},{"content":" }\n\n return current_status;\n\n }\n\n\n\n void halt() override\n\n {\n\n introspection::setActivePath(this->config().blackboard.get(), parent_path_);\n\n\n\n BaseNodeT::halt();\n\n }\n\n\n\n private:\n\n std::string parent_path_{};\n\n};\n\n\n\ntemplate<class BaseNodeT>\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":37,"score":146275.59532750607},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n#ifndef MISSION_CONTROL_BEHAVIORS_INTROSPECTABLE_NODE_H\n\n#define MISSION_CONTROL_BEHAVIORS_INTROSPECTABLE_NODE_H\n\n\n\n#include <behaviortree_cpp_v3/behavior_tree.h>\n\n#include <behaviortree_cpp_v3/bt_factory.h>\n\n#include <ros/ros.h>\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":38,"score":146274.5694027718},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2021, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":39,"score":146255.76003755038},{"content":"class MessageStagnationCheckParams final\n\n{\n\npublic:\n\n MessageStagnationCheckParams() = default;\n\n\n\n MessageStagnationCheckParams &window_size(size_t size)\n\n {\n\n window_size_ = size;\n\n return *this;\n\n }\n\n\n\n size_t window_size() const\n\n {\n\n return window_size_;\n\n }\n\n\n\n MessageStagnationCheckParams &stagnation_diagnostic(Diagnostic diagnostic)\n\n {\n\n if (diagnostic.description().empty())\n\n {\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":40,"score":144806.9923656939},{"content":"class TimeoutNode : public BT::DecoratorNode\n\n{\n\n public:\n\n TimeoutNode(const std::string& name, std::chrono::milliseconds timeout);\n\n\n\n TimeoutNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n ~TimeoutNode() override { halt(); }\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return {\n\n BT::InputPort<unsigned>(\"msec\", \"Timeout to halt child if still running, in milliseconds\")};\n\n }\n\n\n\n void halt() override\n\n {\n\n timer_.cancelAll();\n\n DecoratorNode::halt();\n\n }\n\n\n\n private:\n\n internal::TimerQueue timer_;\n\n\n\n BT::NodeStatus tick() override;\n\n\n\n std::chrono::milliseconds timeout_;\n\n\n","file_path":"mission_control/include/mission_control/behaviors/timeout.h","rank":41,"score":143312.76147263835},{"content":"class AbortNode : public ReactiveActionNode\n\n{\n\npublic:\n\n AbortNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n static BT::PortsList providedPorts() { return {}; }\n\n\n\nprivate:\n\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\n\n\n\n BT::NodeStatus setUp() override;\n\n BT::NodeStatus doWork() override;\n\n void tearDown() override;\n\n\n\n ros::NodeHandle nh_;\n\n ros::Publisher attitude_servo_pub_;\n\n ros::Subscriber state_sub_;\n\n\n\n auv_interfaces::StateStamped::ConstPtr state_;\n\n\n","file_path":"mission_control/include/mission_control/behaviors/abort.h","rank":42,"score":143312.76147263835},{"content":"class DelayForNode : public BT::DecoratorNode\n\n{\n\n public:\n\n DelayForNode(const std::string& name, std::chrono::milliseconds delay);\n\n\n\n DelayForNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n ~DelayForNode() override { halt(); }\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return {BT::InputPort<unsigned>(\"delay_msec\", \"Time to delay child ticking, in milliseconds\")};\n\n }\n\n\n\n void halt() override\n\n {\n\n timer_.cancelAll();\n\n DecoratorNode::halt();\n\n }\n\n\n\n private:\n\n internal::TimerQueue timer_;\n\n\n\n BT::NodeStatus tick() override;\n\n\n\n std::chrono::milliseconds delay_;\n\n\n","file_path":"mission_control/include/mission_control/behaviors/delay_for.h","rank":43,"score":143312.76147263835},{"content":"class IntrospectableNode<BaseNodeT, false> : public BaseNodeT\n\n{\n\npublic:\n\n using BaseNodeT::BaseNodeT;\n\n\n\n BT::NodeStatus executeTick() override\n\n {\n\n if (BT::NodeStatus::IDLE == this->status())\n\n {\n\n parent_path_ = introspection::extendActivePath(\n\n this->config().blackboard.get(), this->name());\n\n }\n\n\n\n // NOTE(hidmic): this will not work for async and coroutine-based action types.\n\n // The BT library does not lend itself well to built-in node types extension.\n\n BT::NodeStatus current_status = BaseNodeT::executeTick();\n\n\n\n if (BT::NodeStatus::RUNNING != current_status)\n\n {\n\n introspection::setActivePath(this->config().blackboard.get(), parent_path_);\n","file_path":"mission_control/include/mission_control/behaviors/introspectable_node.h","rank":44,"score":142598.8995606905},{"content":" void tearDown() override;\n\n\n\n ros::NodeHandle nh_;\n\n ros::Publisher depth_heading_pub_;\n\n ros::Subscriber state_sub_;\n\n\n\n double target_depth_;\n\n double depth_tolerance_;\n\n double target_heading_;\n\n double heading_tolerance_;\n\n double speed_knots_;\n\n uint8_t enable_mask_;\n\n\n\n auv_interfaces::StateStamped::ConstPtr state_;\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_SET_DEPTH_HEADING_H\n","file_path":"mission_control/include/mission_control/behaviors/set_depth_heading.h","rank":45,"score":142579.23760892535},{"content":" void tearDown() override;\n\n\n\n ros::NodeHandle nh_;\n\n ros::Publisher altitude_heading_pub_;\n\n ros::Subscriber state_sub_;\n\n\n\n double target_altitude_;\n\n double altitude_tolerance_;\n\n double target_heading_;\n\n double heading_tolerance_;\n\n double speed_knots_;\n\n uint8_t enable_mask_;\n\n\n\n auv_interfaces::StateStamped::ConstPtr state_;\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_SET_ALTITUDE_HEADING_H\n","file_path":"mission_control/include/mission_control/behaviors/set_altitude_heading.h","rank":46,"score":142579.23760892535},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\n\n\n\n#ifndef MISSION_CONTROL_BEHAVIORS_SET_DEPTH_HEADING_H\n\n#define MISSION_CONTROL_BEHAVIORS_SET_DEPTH_HEADING_H\n\n\n\n#include <behaviortree_cpp_v3/basic_types.h>\n","file_path":"mission_control/include/mission_control/behaviors/set_depth_heading.h","rank":47,"score":142572.62367396362},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\n\n\n\n#ifndef MISSION_CONTROL_BEHAVIORS_SET_ALTITUDE_HEADING_H\n\n#define MISSION_CONTROL_BEHAVIORS_SET_ALTITUDE_HEADING_H\n\n\n\n#include <behaviortree_cpp_v3/basic_types.h>\n","file_path":"mission_control/include/mission_control/behaviors/set_altitude_heading.h","rank":48,"score":142572.62367396362},{"content":"#include <behaviortree_cpp_v3/behavior_tree.h>\n\n#include <ros/ros.h>\n\n\n\n#include <string>\n\n\n\n#include \"auv_interfaces/StateStamped.h\"\n\n#include \"mission_control/behaviors/helpers.h\"\n\n#include \"mission_control/behaviors/reactive_action.h\"\n\n\n\n\n\nnamespace mission_control\n\n{\n","file_path":"mission_control/include/mission_control/behaviors/set_depth_heading.h","rank":49,"score":142569.28749238874},{"content":"#include <behaviortree_cpp_v3/behavior_tree.h>\n\n#include <ros/ros.h>\n\n\n\n#include <string>\n\n\n\n#include \"auv_interfaces/StateStamped.h\"\n\n#include \"mission_control/behaviors/helpers.h\"\n\n#include \"mission_control/behaviors/reactive_action.h\"\n\n\n\n\n\nnamespace mission_control\n\n{\n\n\n","file_path":"mission_control/include/mission_control/behaviors/set_altitude_heading.h","rank":50,"score":142569.28749238874},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2020, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"mission_control/include/mission_control/behaviors/set_depth_heading.h","rank":51,"score":142551.69804740185},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2021, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"mission_control/include/mission_control/behaviors/set_altitude_heading.h","rank":52,"score":142551.69804740185},{"content":"class MessageStagnationCheck : public TopicDiagnosticTask<MessageT>\n\n{\n\npublic:\n\n using MessageEqualOp = boost::function<bool(const MessageT &, const MessageT &)>;\n\n\n\n MessageStagnationCheck(const std::string &name, const MessageEqualOp &equal_op)\n\n : MessageStagnationCheck(name, equal_op, MessageStagnationCheckParams{}) {}\n\n\n\n MessageStagnationCheck(const std::string &name, const MessageEqualOp &equal_op,\n\n MessageStagnationCheckParams params)\n\n : TopicDiagnosticTask<MessageT>(name), equal_op_(equal_op), params_(std::move(params)) {}\n\n\n\n void tick(const ros::Time &stamp, const MessageT &message) override\n\n {\n\n tick(stamp, boost::make_shared<MessageT const>(message));\n\n }\n\n\n\n void tick(const ros::Time &stamp, const boost::shared_ptr<MessageT const> &message) override\n\n {\n\n if (!message)\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":53,"score":141621.4832303572},{"content":" * Author: jsun\n\n */\n\n\n\n#ifndef SETFINDEFLECTION_H_\n\n#define SETFINDEFLECTION_H_\n\n\n\n#include <ros/ros.h>\n\n#include <stdint.h>\n\n#include \"JausMessageIn.h\"\n\n#include <fin_control/SetAngles.h>\n\n\n","file_path":"jaus_ros_bridge/include/SetFinDeflection.h","rank":54,"score":139240.64644344078},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n// Original version: Jie Sun <Jie.Sun@us.QinetiQ.com>\n\n\n\n/*\n\n * SetFinDeflection.h\n\n *\n\n * Created on: Jun 11, 2019\n","file_path":"jaus_ros_bridge/include/SetFinDeflection.h","rank":55,"score":139238.36613039422},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2020, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"jaus_ros_bridge/include/SetFinDeflection.h","rank":56,"score":139218.7330317905},{"content":"class SingleDynamixelController\n\n{\n\n private:\n\n // ROS NodeHandle\n\n ros::NodeHandle node_handle_;\n\n\n\n // ROS Parameters\n\n\n\n // ROS Topic Publisher\n\n\n\n // ROS Topic Subscriber\n\n\n\n // ROS Service Server\n\n\n\n // ROS Service Client\n\n ros::ServiceClient dynamixel_info_client_;\n\n ros::ServiceClient dynamixel_command_client_;\n\n\n\n // Dynamixel Workbench Parameters\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h","rank":57,"score":138716.310761672},{"content":"class FixRudderNode : public ReactiveActionNode\n\n{\n\npublic:\n\n FixRudderNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return MakePortsList(\n\n InputPort<double, HasAngleUnits>(\"rudder\", NAN, \"Rudder angle\"),\n\n BT::InputPort<double>(\"depth\", NAN, \"Depth to reach (positive down), in meters\"),\n\n BT::InputPort<double>(\"speed_knots\", NAN, \"Cruise speed to command, in knots\"));\n\n }\n\n\n\nprotected:\n\n BT::NodeStatus doWork() override;\n\n\n\nprivate:\n\n ros::NodeHandle nodeHandle_;\n\n ros::Publisher fixedRudderBehaviorPub_;\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_FIX_RUDDER_H\n","file_path":"mission_control/include/mission_control/behaviors/fix_rudder.h","rank":58,"score":137889.22583845793},{"content":"class GoToWaypointNode : public ReactiveActionNode\n\n{\n\npublic:\n\n GoToWaypointNode(const std::string &name, const BT::NodeConfiguration &config);\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return {\n\n BT::InputPort<double>(\"depth\", NAN, \"Waypoint depth (positive down), in meters\"),\n\n BT::InputPort<double>(\"altitude\", NAN, \"Waypoint altitude (positive up), in meters\"),\n\n BT::InputPort<double>(\"latitude\", NAN, \"Waypoint latitude, in degrees\"),\n\n BT::InputPort<double>(\"longitude\", NAN, \"Waypoint longitude, in degrees\"),\n\n BT::InputPort<double>(\"speed_knots\", NAN, \"Cruise speed to command, in knots\"),\n\n BT::InputPort<double>(\"tolerance_radius\", 0.0, \"Radius of the tolerance sphere \"\n\n \"for UTM coordinates, in meters\")};\n\n }\n\n\n\nprivate:\n\n void stateCallback(auv_interfaces::StateStamped::ConstPtr msg);\n\n\n","file_path":"mission_control/include/mission_control/behaviors/go_to_waypoint.h","rank":59,"score":137889.22583845793},{"content":"class PayloadCommandNode : public ReactiveActionNode\n\n{\n\npublic:\n\n PayloadCommandNode(const std::string& name, const BT::NodeConfiguration& config);\n\n\n\n static BT::PortsList providedPorts()\n\n {\n\n return {BT::InputPort<std::string>(\"command\", \"Command to be sent to payload\")};\n\n }\n\n\n\nprotected:\n\n BT::NodeStatus doWork() override;\n\n\n\nprivate:\n\n ros::NodeHandle nodeHandle_;\n\n ros::Publisher payloadCommandPub_;\n\n};\n\n\n\n} // namespace mission_control\n\n\n\n#endif // MISSION_CONTROL_BEHAVIORS_PAYLOAD_COMMAND_H\n","file_path":"mission_control/include/mission_control/behaviors/payload_command.h","rank":60,"score":137889.22583845793},{"content":" dxl_id[1] = atoi(argv[4]);\n\n }\n\n\n\n DynamixelWorkbench dxl_wb;\n\n\n\n const char *log;\n\n bool result = false;\n\n\n\n result = dxl_wb.init(port_name, baud_rate, &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to init\\n\");\n\n\n\n return 0;\n\n }\n\n else\n\n printf(\"Succeed to init(%d)\\n\", baud_rate); \n\n\n\n for (int cnt = 0; cnt < 2; cnt++)\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":61,"score":137861.4688933535},{"content":"void swap(int32_t *array);\n\n\n\nint main(int argc, char *argv[]) \n\n{\n\n const char* port_name = \"/dev/ttyUSB0\";\n\n int baud_rate = 57600;\n\n\n\n uint16_t model_number = 0;\n\n uint8_t dxl_id[2] = {0, 0};\n\n\n\n if (argc < 5)\n\n {\n\n printf(\"Please set '-port_name', '-baud_rate', '-dynamixel_id_1', '-dynamixel_id_2' arguments for connected Dynamixels\\n\");\n\n return 0;\n\n }\n\n else\n\n {\n\n port_name = argv[1];\n\n baud_rate = atoi(argv[2]);\n\n dxl_id[0] = atoi(argv[3]);\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":62,"score":137854.2760774127},{"content":" printf(\"Failed to add bulk write position param\\n\");\n\n }\n\n else\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n\n\n result = dxl_wb.addBulkWriteParam(dxl_id[1], \"LED\", led[0], &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to add bulk write led param\\n\");\n\n }\n\n else\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n\n\n result = dxl_wb.bulkWrite(&log);\n\n if (result == false)\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":63,"score":137842.9219647419},{"content":" printf(\"Failed to add bulk read led param\\n\");\n\n }\n\n else\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n\n\n int32_t goal_position[2] = {0, 1023};\n\n int32_t led[2] = {0, 1};\n\n\n\n int32_t get_data[2] = {0, 0};\n\n\n\n const uint8_t handler_index = 0;\n\n\n\n while(1)\n\n {\n\n result = dxl_wb.addBulkWriteParam(dxl_id[0], \"Goal_Position\", goal_position[0], &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":64,"score":137838.29123744817},{"content":" {\n\n result = dxl_wb.ping(dxl_id[cnt], &model_number, &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to ping\\n\");\n\n }\n\n else\n\n {\n\n printf(\"Succeeded to ping\\n\");\n\n printf(\"id : %d, model_number : %d\\n\", dxl_id[cnt], model_number);\n\n }\n\n\n\n result = dxl_wb.jointMode(dxl_id[cnt], 0, 0, &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to change joint mode\\n\");\n\n }\n\n else\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":65,"score":137837.66164188896},{"content":" {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to bulk write\\n\");\n\n }\n\n\n\n do\n\n {\n\n result = dxl_wb.bulkRead(&log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to bulk read\\n\");\n\n }\n\n\n\n result = dxl_wb.getBulkReadData(&get_data[0], &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n else\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":66,"score":137837.30732305473},{"content":" {\n\n printf(\"Succeed to change joint mode\\n\");\n\n }\n\n }\n\n\n\n result = dxl_wb.initBulkWrite(&log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n else\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n\n\n result = dxl_wb.initBulkRead(&log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":67,"score":137836.93442471052},{"content":" else\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n\n\n result = dxl_wb.addBulkReadParam(dxl_id[0], \"Present_Position\", &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n\n printf(\"Failed to add bulk read position param\\n\");\n\n }\n\n else\n\n {\n\n printf(\"%s\\n\", log);\n\n }\n\n\n\n result = dxl_wb.addBulkReadParam(dxl_id[1], \"LED\", &log);\n\n if (result == false)\n\n {\n\n printf(\"%s\\n\", log);\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":68,"score":137836.2708466289},{"content":"/*******************************************************************************\n\n* Copyright 2018 ROBOTIS CO., LTD.\n\n*\n\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n\n* you may not use this file except in compliance with the License.\n\n* You may obtain a copy of the License at\n\n*\n\n* http://www.apache.org/licenses/LICENSE-2.0\n\n*\n\n* Unless required by applicable law or agreed to in writing, software\n\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n* See the License for the specific language governing permissions and\n\n* limitations under the License.\n\n*******************************************************************************/\n\n\n\n/* Authors: Taehun Lim (Darby) */\n\n\n\n#include <DynamixelWorkbench.h>\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":69,"score":137835.91098889205},{"content":" {\n\n printf(\"[ID %d]\\tGoal Position : %d\\tPresent Position : %d, [ID %d]\\tLED : %d\\n\"\n\n ,dxl_id[0], goal_position[0], get_data[0], dxl_id[1], get_data[1]);\n\n }\n\n\n\n }while(abs(goal_position[0] - get_data[0]) > 15);\n\n\n\n swap(goal_position);\n\n swap(led);\n\n }\n\n\n\n return 0;\n\n}\n\n\n\nvoid swap(int32_t *array)\n\n{\n\n int32_t tmp = array[0];\n\n array[0] = array[1];\n\n array[1] = tmp;\n\n}","file_path":"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp","rank":70,"score":137824.33373168053},{"content":"class ReactiveActionNode : public BT::ActionNodeBase\n\n{\n\npublic:\n\n using BT::ActionNodeBase::ActionNodeBase;\n\n\n\n BT::NodeStatus tick() override\n\n {\n\n BT::NodeStatus current_status = status();\n\n switch (current_status)\n\n {\n\n case BT::NodeStatus::IDLE:\n\n current_status = setUp();\n\n break;\n\n case BT::NodeStatus::RUNNING:\n\n current_status = doWork();\n\n if (BT::NodeStatus::RUNNING != current_status)\n\n {\n\n tearDown();\n\n }\n\n break;\n","file_path":"mission_control/include/mission_control/behaviors/reactive_action.h","rank":71,"score":135333.38878858718},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n *********************************************************************/\n\n\n\n/*\n\n * diagnostic_tools/message_stagnation_check.h\n\n */\n\n\n\n#ifndef DIAGNOSTIC_TOOLS_MESSAGE_STAGNATION_CHECK_H\n\n#define DIAGNOSTIC_TOOLS_MESSAGE_STAGNATION_CHECK_H\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":72,"score":135127.6278015817},{"content":" return params_.stagnation_diagnostic();\n\n }\n\n return params_.normal_diagnostic();\n\n }\n\n\n\n MessageEqualOp equal_op_;\n\n MessageStagnationCheckParams params_;\n\n std::deque<boost::shared_ptr<MessageT const>> message_window_;\n\n std::mutex mutex_;\n\n};\n\n\n\n} // namespace diagnostic_tools\n\n} // namespace qna\n\n\n\n#endif // DIAGNOSTIC_TOOLS_MESSAGE_STAGNATION_CHECK_H\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":73,"score":135124.73307702402},{"content":"\n\n#include <cinttypes>\n\n#include <deque>\n\n#include <mutex> // NOLINT(build/c++11)\n\n#include <string>\n\n#include <utility>\n\n\n\n#include <diagnostic_updater/diagnostic_updater.h>\n\n\n\n#include <ros/ros.h>\n\n\n\n#include \"diagnostic_tools/diagnostic.h\"\n\n#include \"diagnostic_tools/topic_diagnostic_task.h\"\n\n\n\nnamespace qna\n\n{\n\nnamespace diagnostic_tools\n\n{\n\n\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":74,"score":135124.24544484136},{"content":" {\n\n ROS_WARN_NAMED(\"diagnostic_tools\", \"No stagnation checks possible on null message\");\n\n return;\n\n }\n\n\n\n std::lock_guard<std::mutex> guard(mutex_);\n\n message_window_.push_back(message);\n\n if (message_window_.size() > params_.window_size())\n\n {\n\n message_window_.pop_front();\n\n }\n\n }\n\n\n\n void run(diagnostic_updater::DiagnosticStatusWrapper &stat) override\n\n {\n\n std::lock_guard<std::mutex> guard(mutex_);\n\n const Diagnostic &diagnostic = diagnose();\n\n stat.summary(diagnostic.status(), diagnostic.description());\n\n if (diagnostic.has_code())\n\n {\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":75,"score":135116.33943766088},{"content":" diagnostic.description(\"Messages have stagnated\");\n\n }\n\n stagnation_diagnostic_ = std::move(diagnostic);\n\n return *this;\n\n }\n\n\n\n const Diagnostic &stagnation_diagnostic() const\n\n {\n\n return stagnation_diagnostic_;\n\n }\n\n\n\n MessageStagnationCheckParams &stale_diagnostic(Diagnostic diagnostic)\n\n {\n\n if (diagnostic.description().empty())\n\n {\n\n diagnostic.description(\"Not enough messages since last update\");\n\n }\n\n stale_diagnostic_ = std::move(diagnostic);\n\n return *this;\n\n }\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":76,"score":135113.1252927396},{"content":"\n\n const Diagnostic &stale_diagnostic() const\n\n {\n\n return stale_diagnostic_;\n\n }\n\n\n\n MessageStagnationCheckParams &normal_diagnostic(Diagnostic diagnostic)\n\n {\n\n if (diagnostic.description().empty())\n\n {\n\n diagnostic.description(\"Messages fluctuate normally\");\n\n }\n\n normal_diagnostic_ = std::move(diagnostic);\n\n return *this;\n\n }\n\n\n\n const Diagnostic &normal_diagnostic() const\n\n {\n\n return normal_diagnostic_;\n\n }\n\n\n\nprivate:\n\n size_t window_size_{3};\n\n Diagnostic normal_diagnostic_{Diagnostic::OK, \"Messages fluctuate normally\"};\n\n Diagnostic stagnation_diagnostic_{Diagnostic::WARN, \"Messages have stagnated\"};\n\n Diagnostic stale_diagnostic_{Diagnostic::STALE, \"Not enough messages since last update\"};\n\n};\n\n\n\ntemplate <typename MessageT>\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":77,"score":135112.78415380284},{"content":" stat.addf(\"Code\", \"%\" PRIu64, diagnostic.code());\n\n }\n\n }\n\n\n\nprivate:\n\n const Diagnostic &diagnose()\n\n {\n\n if (message_window_.size() < params_.window_size())\n\n {\n\n return params_.stale_diagnostic();\n\n }\n\n auto predicate = [this](const boost::shared_ptr<MessageT const> &a,\n\n const boost::shared_ptr<MessageT const> &b)\n\n {\n\n return equal_op_(*a, *b);\n\n };\n\n if (std::adjacent_find(message_window_.begin(),\n\n message_window_.end(),\n\n predicate) != message_window_.end())\n\n {\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":78,"score":135109.45072859223},{"content":"/*********************************************************************\n\n * Software License Agreement (BSD License)\n\n *\n\n * Copyright (c) 2020, QinetiQ, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions\n\n * are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * * Redistributions in binary form must reproduce the above\n\n * copyright notice, this list of conditions and the following\n\n * disclaimer in the documentation and/or other materials provided\n\n * with the distribution.\n\n * * Neither the name of QinetiQ nor the names of its\n\n * contributors may be used to endorse or promote products derived\n\n * from this software without specific prior written permission.\n\n *\n","file_path":"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h","rank":79,"score":135107.39988133364},{"content":" public:\n\n SingleDynamixelController();\n\n ~SingleDynamixelController();\n\n void viewManagerMenu(void);\n\n bool controlLoop(void);\n\n\n\n private:\n\n bool initSingleDynamixelController();\n\n bool shutdownSingleDynamixelController();\n\n\n\n int getch(void);\n\n int kbhit(void);\n\n\n\n bool sendCommandMsg(std::string cmd, std::string addr = \"\", int64_t value = 0);\n\n\n\n};\n\n}\n\n\n\n#endif //DYNAMIXEL_WORKBENCH_SINGLE_DYNAMIXEL_CONTROLLER_H\n","file_path":"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h","rank":80,"score":132700.045534833},{"content":"\n\n#include <fcntl.h> // FILE control\n\n#include <termios.h> // Terminal IO\n\n#include <ros/ros.h>\n\n\n\n#include \"dynamixel_workbench_msgs/DynamixelCommand.h\"\n\n#include \"dynamixel_workbench_msgs/GetDynamixelInfo.h\"\n\n#include \"message_header.h\"\n\n\n\nnamespace single_dynamixel_controller\n\n{\n\n#define ESC_ASCII_VALUE 0x1b\n\n#define SPACEBAR_ASCII_VALUE 0x20\n\n#define ENTER_ASCII_VALUE 0x0a\n\n\n","file_path":"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h","rank":81,"score":132691.80188293476},{"content":"/*******************************************************************************\n\n* Copyright 2016 ROBOTIS CO., LTD.\n\n*\n\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n\n* you may not use this file except in compliance with the License.\n\n* You may obtain a copy of the License at\n\n*\n\n* http://www.apache.org/licenses/LICENSE-2.0\n\n*\n\n* Unless required by applicable law or agreed to in writing, software\n\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n* See the License for the specific language governing permissions and\n\n* limitations under the License.\n\n*******************************************************************************/\n\n\n\n/* Authors: Taehun Lim (Darby) */\n\n\n\n#ifndef DYNAMIXEL_WORKBENCH_SINGLE_DYNAMIXEL_CONTROLLER_H\n\n#define DYNAMIXEL_WORKBENCH_SINGLE_DYNAMIXEL_CONTROLLER_H\n","file_path":"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h","rank":82,"score":132685.53670886823},{"content":"class ReportFinDeflection : public JausMessageOut {\n\n private:\n\n int8_t _deflectionAngle; // 1 byte - DeflectionCMD in document\n\n int8_t _finId; // 1 byte\n\n ros::Subscriber _subscriber_reportAngle;\n\n\n\n public:\n\n void init(ros::NodeHandle* nodeHandle, int8_t finId, udpserver* udp);\n\n virtual DataInfo GetPackedMessage(void* data);\n\n void SetFinId(int8_t finId) { _finId = finId; };\n\n virtual void Reset() { _deflectionAngle = -100; }\n\n // void SetdeflectionAngle(int8_t angle){\n\n // _deflectionAngle = angle;};\n\n void handleReportAngle(const fin_control::ReportAngle::ConstPtr& msg);\n\n};\n\n\n\n#endif /* REPORTFINDEFLECTION_H_ */\n","file_path":"jaus_ros_bridge/include/ReportFinDeflection.h","rank":83,"score":131168.17253069536},{"content":"class SetPayloadCommands : public JausMessageIn {\n\n public:\n\n void init(ros::NodeHandle* nodeHandle);\n\n\n\n void ProcessData(char* message, JausCommandID cmdID);\n\n\n\n private:\n\n ros::Publisher _publisher_payload_command;\n\n};\n\n\n\n#endif // SETPAYLOADCOMMANDS_H\n","file_path":"jaus_ros_bridge/include/SetPayloadCommands.h","rank":84,"score":131101.3822766257},{"content":"class SetMissionCommands : public JausMessageIn {\n\n public:\n\n void init(ros::NodeHandle* nodeHandle);\n\n\n\n void ProcessData(char* message, JausCommandID cmdID);\n\n\n\n void StopMissions();\n\n\n\n private:\n\n ros::Publisher _publisher_Execute_mission;\n\n ros::Publisher _publisher_Stop_mission;\n\n ros::Publisher _publisher_Abort_mission;\n\n ros::Publisher _publisher_Load_mission;\n\n ros::Publisher _publisher_Query_mission;\n\n ros::Publisher _publisher_Remove_mission;\n\n};\n\n\n\n#endif // SETMISSIONCOMMANDS_H\n","file_path":"jaus_ros_bridge/include/SetMissionCommands.h","rank":85,"score":131101.3822766257},{"content":"class PowerPlantControl : public JausMessageIn {\n\n public:\n\n // PowerPlantControl();\n\n void init(ros::NodeHandle* nodeHandle);\n\n void PublishRPM(const bool enable);\n\n void ProcessData(char* message);\n\n\n\n enum PresenceBits { RPMBit = 0, ThrottleBit = 1, GlowPlugStateBit = 2 };\n\n\n\n int8_t GetPowerPlantID();\n\n\n\n int8_t GetPowerCMD();\n\n\n\n int8_t GetEnginId();\n\n\n\n int GetRpm();\n\n void StopThruster();\n\n\n\n private:\n\n void commandRPM(const ros::TimerEvent& ev);\n","file_path":"jaus_ros_bridge/include/PowerPlantControl.h","rank":86,"score":129663.9674542912},{"content":"enum JausCommandID {\n\n JAUS_COMMAND_Invalid = 0,\n\n JAUS_COMMAND_PowerPlantControl = 0x0A06,\n\n // JAUS_COMMAND_QueryPowerPlantSpecifications = 0x2A05,\n\n // JAUS_COMMAND_QueryPowerPlantStatus = 0x2A06,\n\n // JAUS_COMMAND_ReportPowerPlantSpecifications = 0x4A05,\n\n JAUS_COMMAND_ReportPowerPlantStatus = 0x4A06,\n\n\n\n // Fin control\n\n JAUS_COMMAND_SetFinDeflection = 0x0A36,\n\n JAUS_COMMAND_ReportFinDeflection = 0x4A36,\n\n\n\n // INS data report\n\n JAUS_COMMAND_ReportINSData = 0x5A01,\n\n\n\n // Altimeter report\n\n JAUS_COMMAND_ReportAltimeter = 0x5A06,\n\n\n\n // Altimeter report\n\n JAUS_COMMAND_ReportPoseEstimetorData = 0x5A10,\n","file_path":"jaus_ros_bridge/include/JausMessageHeader.h","rank":87,"score":127506.25560732269},{"content":"/// \\brief Represents a cross-platform serial port.\n\n///\n\n/// When the SerialPort if first created and the connection opened, the user\n\n/// will normally have to poll the method \\ref read to see if any new data is\n\n/// available on the serial port. However, if the user code registers a\n\n/// handler with the method \\ref registerDataReceivedHandler, the SerialPort\n\n/// object will start an internal thread that monitors the serial port for new\n\n/// data, and when new data is available, it will alert the user code through\n\n/// the callback handler. Then the user can call \\ref read to retrieve the\n\n/// data.\n\nclass vn_proglib_DLLEXPORT SerialPort : public IPort, util::NoCopy\n\n{\n\n\n\n\t// Types //////////////////////////////////////////////////////////////////\n\n\t\n\npublic:\n\n\t\n\n\tenum StopBits\n\n\t{\n\n\t\tONE_STOP_BIT,\n\n\t\tTWO_STOP_BITS\n\n\t};\n\n\n\n\t// Constructors ///////////////////////////////////////////////////////////\n\n\n\npublic:\n\n\n\n\t/// \\brief Creates a new \\ref SerialPort with the provided connection\n\n\t/// parameters.\n\n\t///\n","file_path":"vectornav/vnproglib-1.1.4.0/cpp/include/vn/serialport.h","rank":88,"score":125698.26195179526}],"string":"[\n {\n \"content\": \"class IntrospectableNode<BaseNodeT, true> : public BaseNodeT\\n\\n{\\n\\n public:\\n\\n IntrospectableNode(const std::string& name, const BT::NodeConfiguration& config)\\n\\n : BaseNodeT(name), blackboard_(config.blackboard)\\n\\n {\\n\\n }\\n\\n\\n\\n BT::NodeStatus executeTick() override\\n\\n {\\n\\n if (BT::NodeStatus::IDLE == this->status())\\n\\n {\\n\\n parent_path_ =\\n\\n introspection::extendActivePath(blackboard_.get(), this->name());\\n\\n }\\n\\n // NOTE(hidmic): this will not work for async and coroutine-based action types.\\n\\n // The BT library does not lend itself well to built-in node types extension.\\n\\n BT::NodeStatus current_status = BaseNodeT::executeTick();\\n\\n\\n\\n if (BT::NodeStatus::RUNNING != current_status)\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 0,\n \"score\": 196185.8618802681\n },\n {\n \"content\": \"class AttitudeServoNode : public ReactiveActionNode\\n\\n{\\n\\npublic:\\n\\n AttitudeServoNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return MakePortsList(\\n\\n InputPort<double, HasTolerance, HasAngleUnits>(\\n\\n \\\"roll\\\", NAN, \\\"Roll angle to reach\\\"),\\n\\n InputPort<double, HasTolerance, HasAngleUnits>(\\n\\n \\\"pitch\\\", NAN, \\\"Pitch angle to reach\\\"),\\n\\n InputPort<double, HasTolerance, HasAngleUnits>(\\n\\n \\\"yaw\\\", NAN, \\\"Yaw angle to reach\\\"),\\n\\n BT::InputPort<double>(\\\"speed_knots\\\", NAN, \\\"Cruise speed to command, in knots\\\"));\\n\\n }\\n\\n\\n\\nprivate:\\n\\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/attitude_servo.h\",\n \"rank\": 1,\n \"score\": 189528.7938831936\n },\n {\n \"content\": \"class LogToBagfileNode : public BT::DecoratorNode\\n\\n{\\n\\n public:\\n\\n struct Options\\n\\n {\\n\\n static BT::PortsList portsList()\\n\\n {\\n\\n static const Options options;\\n\\n return {\\n\\n BT::InputPort<std::string>(\\n\\n \\\"prefix\\\", options.prefix,\\n\\n \\\"Prefix for bag filename. If relative, it is resolved against the ROS log directory. \\\"\\n\\n \\\"If it lacks the '.bag' extension, a '{timestamp}.bag' suffix is appended.\\\"),\\n\\n BT::InputPort<std::string>(\\n\\n \\\"topics\\\", \\\"all\\\",\\n\\n \\\"Topic names to be logged as a comma-separated list. If the 'all' value is given, \\\"\\n\\n \\\"all topics are logged by periodically looking up the ROS graph.\\\"),\\n\\n BT::InputPort<rosbag::CompressionType>(\\n\\n \\\"compression\\\", options.writer_options.compression,\\n\\n \\\"Compression type to be used. Supported types are 'none', 'bz2', and 'lz4'.\\\")};\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/log_to_bagfile.h\",\n \"rank\": 2,\n \"score\": 189511.89727815945\n },\n {\n \"content\": \"class SetFinDeflection : public JausMessageIn {\\n\\n private:\\n\\n void commandFinAngles(const ros::TimerEvent& ev);\\n\\n\\n\\n int8_t _finId; // 1 byte\\n\\n int8_t _deflectionAngle; // 1 byte\\n\\n int8_t _deflectionRateCmd; // 1 byte but not used\\n\\n ros::Publisher _publisher_setAngles;\\n\\n ros::Timer _commandFinAnglesTimer;\\n\\n std::vector<float> _finAngles{0.,0.,0.,0.};\\n\\n\\n\\n public:\\n\\n void init(ros::NodeHandle* nodeHandle);\\n\\n void PublishFinAngles(const bool enable);\\n\\n\\n\\n void ProcessData(char* message);\\n\\n\\n\\n int8_t GetFinID();\\n\\n int8_t GetDeflectionAngle();\\n\\n int8_t GetDeflectionRateCmd();\\n\\n};\\n\\n\\n\\n#endif /* SETFINDEFLECTION_H_ */\\n\",\n \"file_path\": \"jaus_ros_bridge/include/SetFinDeflection.h\",\n \"rank\": 3,\n \"score\": 184488.28551864854\n },\n {\n \"content\": \"class SetAltitudeHeadingNode : public ReactiveActionNode\\n\\n{\\n\\npublic:\\n\\n SetAltitudeHeadingNode(const std::string &name, const BT::NodeConfiguration &config);\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return MakePortsList(\\n\\n InputPort<double, HasTolerance>(\\n\\n \\\"altitude\\\", NAN, \\\"Altitude to reach (positive up), in meters\\\"),\\n\\n InputPort<double, HasTolerance, HasAngleUnits>(\\n\\n \\\"heading\\\", NAN, \\\"Heading (or yaw) to reach\\\"),\\n\\n BT::InputPort<double>(\\\"speed_knots\\\", NAN, \\\"Cruise speed to command, in knots\\\"));\\n\\n }\\n\\n\\n\\nprivate:\\n\\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\\n\\n\\n\\n BT::NodeStatus setUp() override;\\n\\n BT::NodeStatus doWork() override;\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_altitude_heading.h\",\n \"rank\": 4,\n \"score\": 182718.7812501337\n },\n {\n \"content\": \"class SetDepthHeadingNode : public ReactiveActionNode\\n\\n{\\n\\n public:\\n\\n SetDepthHeadingNode(const std::string &name, const BT::NodeConfiguration &config);\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return MakePortsList(\\n\\n InputPort<double, HasTolerance>(\\n\\n \\\"depth\\\", NAN, \\\"Depth to reach (positive down), in meters\\\"),\\n\\n InputPort<double, HasTolerance, HasAngleUnits>(\\n\\n \\\"heading\\\", NAN, \\\"Heading (or yaw) to reach\\\"),\\n\\n BT::InputPort<double>(\\\"speed_knots\\\", NAN, \\\"Cruise speed to command, in knots\\\"));\\n\\n }\\n\\n\\n\\n private:\\n\\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\\n\\n\\n\\n BT::NodeStatus setUp() override;\\n\\n BT::NodeStatus doWork() override;\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_depth_heading.h\",\n \"rank\": 5,\n \"score\": 182718.7812501337\n },\n {\n \"content\": \"class FinControl\\n\\n{\\n\\n public:\\n\\n explicit FinControl(ros::NodeHandle& nodeHandle);\\n\\n virtual ~FinControl();\\n\\n\\n\\n private:\\n\\n bool fincontrolEnabled;\\n\\n bool servosON;\\n\\n bool currentLoggingEnabled;\\n\\n\\n\\n void reportAngles();\\n\\n\\n\\n float degreesToRadians(float degrees);\\n\\n\\n\\n void reportAngleSendTimeout(const ros::TimerEvent& ev);\\n\\n void handleSetAngles(const fin_control::SetAngles::ConstPtr& msg);\\n\\n\\n\\n double maxCtrlFinAngle;\\n\\n double ctrlFinOffset;\\n\",\n \"file_path\": \"fin_control/include/fin_control/fin_control.h\",\n \"rank\": 6,\n \"score\": 175067.3718278023\n },\n {\n \"content\": \" double ctrlFinScaleFactor;\\n\\n\\n\\n double reportAngleRate;\\n\\n double minReportAngleRate;\\n\\n double maxReportAngleRate;\\n\\n\\n\\n ros::NodeHandle& nodeHandle;\\n\\n ros::Subscriber subscriber_setAngles;\\n\\n ros::Subscriber subscriber_enableReportAngles;\\n\\n diagnostic_tools::DiagnosedPublisher<\\n\\n fin_control::ReportAngle> publisher_reportAngle;\\n\\n ros::Timer timer_reportAngle;\\n\\n\\n\\n DynamixelWorkbench myWorkBench;\\n\\n\\n\\n uint8_t ids[10];\\n\\n uint8_t numOfIDs;\\n\\n\\n\\n boost::mutex m_mutex;\\n\\n\\n\\n diagnostic_tools::HealthCheck<double> finAngleCheck;\\n\\n diagnostic_updater::Updater diagnosticsUpdater;\\n\\n};\\n\\n\\n\\n} // namespace robot\\n\\n} // namespace qna\\n\\n\\n\\n#endif // FIN_CONTROL_FIN_CONTROL_H\\n\",\n \"file_path\": \"fin_control/include/fin_control/fin_control.h\",\n \"rank\": 7,\n \"score\": 174122.78928462663\n },\n {\n \"content\": \"#include <fin_control/SetAngles.h>\\n\\n#include <health_monitor/ReportFault.h>\\n\\n\\n\\n#include \\\"dynamixel_workbench_msgs/DynamixelCommand.h\\\"\\n\\n#include \\\"dynamixel_workbench_msgs/DynamixelInfo.h\\\"\\n\\n#include \\\"dynamixel_workbench_msgs/GetDynamixelInfo.h\\\"\\n\\n#include \\\"dynamixel_workbench_toolbox/dynamixel_workbench.h\\\"\\n\\n\\n\\nnamespace qna\\n\\n{\\n\\nnamespace robot\\n\\n{\\n\",\n \"file_path\": \"fin_control/include/fin_control/fin_control.h\",\n \"rank\": 8,\n \"score\": 174104.9814148911\n },\n {\n \"content\": \"#ifndef FIN_CONTROL_FIN_CONTROL_H\\n\\n#define FIN_CONTROL_FIN_CONTROL_H\\n\\n\\n\\n#define NUM_FINS 4\\n\\n#define NODE_VERSION \\\"1.8x\\\"\\n\\n\\n\\n#include <pthread.h>\\n\\n#include <stdio.h>\\n\\n#include <sys/select.h>\\n\\n#include <string>\\n\\n\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include <boost/thread.hpp>\\n\\n#include <boost/thread/mutex.hpp>\\n\\n\\n\\n#include <diagnostic_tools/diagnosed_publisher.h>\\n\\n#include <diagnostic_tools/health_check.h>\\n\\n#include <diagnostic_updater/diagnostic_updater.h>\\n\\n#include <fin_control/ReportAngle.h>\\n\",\n \"file_path\": \"fin_control/include/fin_control/fin_control.h\",\n \"rank\": 9,\n \"score\": 174102.83773817477\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\\n\\n\\n\\n/*\\n\\n * fin_control.h\\n\\n */\\n\\n\\n\",\n \"file_path\": \"fin_control/include/fin_control/fin_control.h\",\n \"rank\": 10,\n \"score\": 174085.80087345548\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2020, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"fin_control/include/fin_control/fin_control.h\",\n \"rank\": 11,\n \"score\": 174069.1111305272\n },\n {\n \"content\": \" double read_period_;\\n\\n double write_period_;\\n\\n double pub_period_;\\n\\n\\n\\n bool is_moving_;\\n\\n\\n\\n public:\\n\\n DynamixelController();\\n\\n ~DynamixelController();\\n\\n\\n\\n bool initWorkbench(const std::string port_name, const uint32_t baud_rate);\\n\\n bool getDynamixelsInfo(const std::string yaml_file);\\n\\n bool loadDynamixels(void);\\n\\n bool initDynamixels(void);\\n\\n bool initSDKHandlers(void);\\n\\n bool getPresentPosition(std::vector<std::string> dxl_name);\\n\\n\\n\\n double getReadPeriod(){return read_period_;}\\n\\n double getWritePeriod(){return write_period_;}\\n\\n double getPublishPeriod(){return pub_period_;}\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 12,\n \"score\": 161834.72577428824\n },\n {\n \"content\": \"\\n\\n void initPublisher(void);\\n\\n void initSubscriber(void);\\n\\n\\n\\n void initServer();\\n\\n\\n\\n void readCallback(const ros::TimerEvent&);\\n\\n void writeCallback(const ros::TimerEvent&);\\n\\n void publishCallback(const ros::TimerEvent&);\\n\\n\\n\\n void commandVelocityCallback(const geometry_msgs::Twist::ConstPtr &msg);\\n\\n void trajectoryMsgCallback(const trajectory_msgs::JointTrajectory::ConstPtr &msg);\\n\\n bool dynamixelCommandMsgCallback(dynamixel_workbench_msgs::DynamixelCommand::Request &req,\\n\\n dynamixel_workbench_msgs::DynamixelCommand::Response &res);\\n\\n};\\n\\n\\n\\n#endif //DYNAMIXEL_WORKBENCH_CONTROLLERS_H\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 13,\n \"score\": 161824.44554412903\n },\n {\n \"content\": \"/*******************************************************************************\\n\\n* Copyright 2018 ROBOTIS CO., LTD.\\n\\n*\\n\\n* Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n* you may not use this file except in compliance with the License.\\n\\n* You may obtain a copy of the License at\\n\\n*\\n\\n* http://www.apache.org/licenses/LICENSE-2.0\\n\\n*\\n\\n* Unless required by applicable law or agreed to in writing, software\\n\\n* distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n* See the License for the specific language governing permissions and\\n\\n* limitations under the License.\\n\\n*******************************************************************************/\\n\\n\\n\\n/* Authors: Taehun Lim (Darby) */\\n\\n\\n\\n#ifndef DYNAMIXEL_WORKBENCH_CONTROLLERS_H\\n\\n#define DYNAMIXEL_WORKBENCH_CONTROLLERS_H\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 14,\n \"score\": 161815.72066875966\n },\n {\n \"content\": \"\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include <yaml-cpp/yaml.h>\\n\\n\\n\\n#include <sensor_msgs/JointState.h>\\n\\n#include <geometry_msgs/Twist.h>\\n\\n#include <trajectory_msgs/JointTrajectory.h>\\n\\n#include <trajectory_msgs/JointTrajectoryPoint.h>\\n\\n\\n\\n#include <dynamixel_workbench_toolbox/dynamixel_workbench.h>\\n\\n#include <dynamixel_workbench_msgs/DynamixelStateList.h>\\n\\n#include <dynamixel_workbench_msgs/DynamixelCommand.h>\\n\\n\\n\\n#include <dynamixel_workbench_controllers/trajectory_generator.h>\\n\\n\\n\\n// SYNC_WRITE_HANDLER\\n\\n#define SYNC_WRITE_HANDLER_FOR_GOAL_POSITION 0\\n\\n#define SYNC_WRITE_HANDLER_FOR_GOAL_VELOCITY 1\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 15,\n \"score\": 161814.2024360993\n },\n {\n \"content\": \" // ROS Service Client\\n\\n\\n\\n // Dynamixel Workbench Parameters\\n\\n DynamixelWorkbench *dxl_wb_;\\n\\n std::map<std::string, uint32_t> dynamixel_;\\n\\n std::vector<std::pair<std::string, ItemValue>> dynamixel_info_;\\n\\n dynamixel_workbench_msgs::DynamixelStateList dynamixel_state_list_;\\n\\n sensor_msgs::JointState joint_state_msg_;\\n\\n std::vector<WayPoint> pre_goal_;\\n\\n\\n\\n bool is_joint_state_topic_;\\n\\n bool is_cmd_vel_topic_;\\n\\n bool use_moveit_;\\n\\n\\n\\n double wheel_separation_;\\n\\n double wheel_radius_;\\n\\n\\n\\n JointTrajectory *jnt_tra_;\\n\\n trajectory_msgs::JointTrajectory *jnt_tra_msg_;\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 16,\n \"score\": 161810.5548302992\n },\n {\n \"content\": \"// SYNC_READ_HANDLER(Only for Protocol 2.0)\\n\\n#define SYNC_READ_HANDLER_FOR_PRESENT_POSITION_VELOCITY_CURRENT 0\\n\\n\\n\\n// Protocol 2.0\\n\\n#define ADDR_PRESENT_CURRENT_2 126\\n\\n#define ADDR_PRESENT_VELOCITY_2 128\\n\\n#define ADDR_PRESENT_POSITION_2 132\\n\\n\\n\\n#define LENGTH_PRESENT_CURRENT_2 2\\n\\n#define LENGTH_PRESENT_VELOCITY_2 4\\n\\n#define LENGTH_PRESENT_POSITION_2 4\\n\\n\\n\\n// Protocol 2.0 (XL-320)\\n\\n#define ADDR_PRESENT_LOAD_XL_320 41\\n\\n#define ADDR_PRESENT_VELOCITY_XL_320 39\\n\\n#define ADDR_PRESENT_POSITION_XL_320 37\\n\\n\\n\\n#define LENGTH_PRESENT_LOAD_XL_320 2\\n\\n#define LENGTH_PRESENT_VELOCITY_XL_320 2\\n\\n#define LENGTH_PRESENT_POSITION_XL_320 2\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 17,\n \"score\": 161797.42299401393\n },\n {\n \"content\": \"\\n\\n// Protocol 1.0\\n\\n#define ADDR_PRESENT_LOAD_1 40\\n\\n#define ADDR_PRESENT_VELOCITY_1 38\\n\\n#define ADDR_PRESENT_POSITION_1 36\\n\\n\\n\\n#define LENGTH_PRESENT_LOAD_1 2\\n\\n#define LENGTH_PRESENT_VELOCITY_1 2\\n\\n#define LENGTH_PRESENT_POSITION_1 2\\n\\n\\n\\n//#define DEBUG\\n\\n\\n\\ntypedef struct\\n\\n{\\n\\n std::string item_name;\\n\\n int32_t value;\\n\\n} ItemValue;\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 18,\n \"score\": 161796.20675618658\n },\n {\n \"content\": \"class DynamixelController\\n\\n{\\n\\n private:\\n\\n // ROS NodeHandle\\n\\n ros::NodeHandle node_handle_;\\n\\n ros::NodeHandle priv_node_handle_;\\n\\n\\n\\n // ROS Parameters\\n\\n\\n\\n // ROS Topic Publisher\\n\\n ros::Publisher dynamixel_state_list_pub_;\\n\\n ros::Publisher joint_states_pub_;\\n\\n\\n\\n // ROS Topic Subscriber\\n\\n ros::Subscriber cmd_vel_sub_;\\n\\n ros::Subscriber trajectory_sub_;\\n\\n\\n\\n // ROS Service Server\\n\\n ros::ServiceServer dynamixel_command_server_;\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/dynamixel_workbench_controllers.h\",\n \"rank\": 19,\n \"score\": 161101.71113395068\n },\n {\n \"content\": \"/*******************************************************************************\\n\\n* Copyright 2018 ROBOTIS CO., LTD.\\n\\n*\\n\\n* Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n* you may not use this file except in compliance with the License.\\n\\n* You may obtain a copy of the License at\\n\\n*\\n\\n* http://www.apache.org/licenses/LICENSE-2.0\\n\\n*\\n\\n* Unless required by applicable law or agreed to in writing, software\\n\\n* distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n* See the License for the specific language governing permissions and\\n\\n* limitations under the License.\\n\\n*******************************************************************************/\\n\\n\\n\\n/* Authors: Darby Lim, Hye-Jong KIM, Ryan Shim, Yong-Ho Na */\\n\\n\\n\\n#ifndef TRAJECTORY_GENERATOR_H_\\n\\n#define TRAJECTORY_GENERATOR_H_\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h\",\n \"rank\": 20,\n \"score\": 154153.37959412835\n },\n {\n \"content\": \"\\n\\n#include <math.h>\\n\\n#include <vector>\\n\\n\\n\\n#include <eigen3/Eigen/Eigen>\\n\\n#include <eigen3/Eigen/LU>\\n\\n#include <eigen3/Eigen/QR>\\n\\n\\n\\ntypedef struct _Point\\n\\n{\\n\\n double position;\\n\\n double velocity;\\n\\n double acceleration;\\n\\n} WayPoint;\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h\",\n \"rank\": 21,\n \"score\": 154146.65474834817\n },\n {\n \"content\": \"class IntrospectableNode;\\n\\n\\n\\ntemplate<class BaseNodeT>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 22,\n \"score\": 152333.6190622801\n },\n {\n \"content\": \"class MissionControlNode\\n\\n{\\n\\npublic:\\n\\n MissionControlNode();\\n\\n\\n\\n void spin();\\n\\n\\n\\nprivate:\\n\\n int loadMission(const std::string& path);\\n\\n void reportOn(const Mission& mission);\\n\\n void update(const ros::TimerEvent& ev);\\n\\n\\n\\n void reportHeartbeat(const ros::TimerEvent& ev);\\n\\n\\n\\n void loadMissionCallback(const LoadMission& msg);\\n\\n void executeMissionCallback(const ExecuteMission& msg);\\n\\n void abortMissionCallback(const AbortMission& msg);\\n\\n void queryMissionsCallback(const QueryMissions& msg);\\n\\n void removeMissionsCallback(const RemoveMissions& msg);\\n\\n void stopMissionsCallback(const std_msgs::Empty&);\\n\",\n \"file_path\": \"mission_control/include/mission_control/mission_control.h\",\n \"rank\": 23,\n \"score\": 149027.44889161078\n },\n {\n \"content\": \"class JointTrajectory\\n\\n{\\n\\nprivate:\\n\\n MinimumJerk trajectory_generator_;\\n\\n\\n\\n uint8_t joint_num_;\\n\\n Eigen::MatrixXd coefficient_;\\n\\n std::vector<WayPoint> joint_way_point_;\\n\\n\\n\\npublic:\\n\\n JointTrajectory();\\n\\n virtual ~JointTrajectory();\\n\\n\\n\\n void setJointNum(uint8_t joint_num);\\n\\n void init(double move_time,\\n\\n double control_time,\\n\\n std::vector<WayPoint> start,\\n\\n std::vector<WayPoint> goal\\n\\n );\\n\\n\\n\\n std::vector<WayPoint> getJointWayPoint(double tick);\\n\\n\\n\\n Eigen::MatrixXd getCoefficient();\\n\\n};\\n\\n\\n\\n#endif // TRAJECTORY_GENERATOR_H_\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h\",\n \"rank\": 24,\n \"score\": 148601.6436905654\n },\n {\n \"content\": \"class MinimumJerk\\n\\n{\\n\\nprivate:\\n\\n Eigen::VectorXd coefficient_;\\n\\n\\n\\npublic:\\n\\n MinimumJerk();\\n\\n virtual ~MinimumJerk();\\n\\n\\n\\n void calcCoefficient(WayPoint start,\\n\\n WayPoint goal,\\n\\n double move_time,\\n\\n double control_time);\\n\\n\\n\\n Eigen::VectorXd getCoefficient();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_controllers/include/dynamixel_workbench_controllers/trajectory_generator.h\",\n \"rank\": 25,\n \"score\": 148601.6436905654\n },\n {\n \"content\": \" BT::NodeStatus setUp() override;\\n\\n BT::NodeStatus doWork() override;\\n\\n void tearDown() override;\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::Publisher attitude_servo_pub_;\\n\\n ros::Subscriber state_sub_;\\n\\n\\n\\n double target_roll_;\\n\\n double target_pitch_;\\n\\n double target_yaw_;\\n\\n double speed_knots_;\\n\\n uint8_t enable_mask_;\\n\\n\\n\\n double roll_tolerance_;\\n\\n double pitch_tolerance_;\\n\\n double yaw_tolerance_;\\n\\n\\n\\n auv_interfaces::StateStamped::ConstPtr state_;\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_ATTITUDE_SERVO_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/attitude_servo.h\",\n \"rank\": 26,\n \"score\": 146339.02852057942\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\\n\\n\\n\\n#ifndef MISSION_CONTROL_BEHAVIORS_ATTITUDE_SERVO_H\\n\\n#define MISSION_CONTROL_BEHAVIORS_ATTITUDE_SERVO_H\\n\\n\\n\\n#include <behaviortree_cpp_v3/basic_types.h>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/attitude_servo.h\",\n \"rank\": 27,\n \"score\": 146328.65889157212\n },\n {\n \"content\": \"#include <behaviortree_cpp_v3/behavior_tree.h>\\n\\n#include <behaviortree_cpp_v3/bt_factory.h>\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include <string>\\n\\n\\n\\n#include \\\"auv_interfaces/StateStamped.h\\\"\\n\\n#include \\\"mission_control/behaviors/helpers.h\\\"\\n\\n#include \\\"mission_control/behaviors/reactive_action.h\\\"\\n\\n\\n\\n\\n\\nnamespace mission_control\\n\\n{\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/attitude_servo.h\",\n \"rank\": 28,\n \"score\": 146324.50802976207\n },\n {\n \"content\": \" bool startLogging();\\n\\n bool stopLogging();\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n Options options_;\\n\\n bool read_parameter_from_ports_;\\n\\n\\n\\n internal::AsyncBagWriter bag_writer_;\\n\\n internal::GenericSubscription subscription_;\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_LOG_TO_BAGFILE_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/log_to_bagfile.h\",\n \"rank\": 29,\n \"score\": 146323.20170217854\n },\n {\n \"content\": \" }\\n\\n\\n\\n static Options populateFromPorts(BT::TreeNode * node);\\n\\n\\n\\n std::string prefix{\\\"mission_bag_\\\"};\\n\\n std::vector<std::string> topics{};\\n\\n internal::AsyncBagWriter::Options writer_options{};\\n\\n };\\n\\n\\n\\n static BT::PortsList providedPorts() { return Options::portsList(); }\\n\\n\\n\\n LogToBagfileNode(const std::string& name, Options options);\\n\\n\\n\\n LogToBagfileNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n void halt() override;\\n\\n\\n\\n private:\\n\\n BT::NodeStatus tick() override;\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/log_to_bagfile.h\",\n \"rank\": 30,\n \"score\": 146315.06149579637\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n#ifndef MISSION_CONTROL_BEHAVIORS_LOG_TO_BAGFILE_H\\n\\n#define MISSION_CONTROL_BEHAVIORS_LOG_TO_BAGFILE_H\\n\\n\\n\\n#include <behaviortree_cpp_v3/basic_types.h>\\n\\n#include <behaviortree_cpp_v3/decorator_node.h>\\n\\n\\n\\n#include <ros/ros.h>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/log_to_bagfile.h\",\n \"rank\": 31,\n \"score\": 146314.31912902687\n },\n {\n \"content\": \"\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#include \\\"mission_control/behaviors/internal/async_bag_writer.h\\\"\\n\\n#include \\\"mission_control/behaviors/internal/generic_subscription.h\\\"\\n\\n\\n\\n\\n\\nnamespace mission_control\\n\\n{\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/log_to_bagfile.h\",\n \"rank\": 32,\n \"score\": 146310.73654693487\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2020, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/attitude_servo.h\",\n \"rank\": 33,\n \"score\": 146307.4610473709\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2021, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/log_to_bagfile.h\",\n \"rank\": 34,\n \"score\": 146292.49466259216\n },\n {\n \"content\": \"\\n\\n#include <string>\\n\\n\\n\\n#include \\\"mission_control/behaviors/introspection.h\\\"\\n\\n\\n\\n\\n\\nnamespace mission_control\\n\\n{\\n\\n\\n\\n// NOTE(hidmic): this is insane, but BT library support for\\n\\n// various constructor forms left little margin.\\n\\ntemplate<class BaseNodeT, bool default_constructible_only =\\n\\n BT::has_default_constructor<BaseNodeT>::value &&\\n\\n !BT::has_params_constructor<BaseNodeT>::value>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 35,\n \"score\": 146285.516079933\n },\n {\n \"content\": \" {\\n\\n introspection::setActivePath(blackboard_.get(), parent_path_);\\n\\n }\\n\\n return current_status;\\n\\n }\\n\\n\\n\\n void halt() override\\n\\n {\\n\\n introspection::setActivePath(blackboard_.get(), parent_path_);\\n\\n\\n\\n BaseNodeT::halt();\\n\\n }\\n\\n\\n\\n private:\\n\\n BT::Blackboard::Ptr blackboard_;\\n\\n std::string parent_path_{};\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_INTROSPECTABLE_NODE_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 36,\n \"score\": 146283.68555754237\n },\n {\n \"content\": \" }\\n\\n return current_status;\\n\\n }\\n\\n\\n\\n void halt() override\\n\\n {\\n\\n introspection::setActivePath(this->config().blackboard.get(), parent_path_);\\n\\n\\n\\n BaseNodeT::halt();\\n\\n }\\n\\n\\n\\n private:\\n\\n std::string parent_path_{};\\n\\n};\\n\\n\\n\\ntemplate<class BaseNodeT>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 37,\n \"score\": 146275.59532750607\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n#ifndef MISSION_CONTROL_BEHAVIORS_INTROSPECTABLE_NODE_H\\n\\n#define MISSION_CONTROL_BEHAVIORS_INTROSPECTABLE_NODE_H\\n\\n\\n\\n#include <behaviortree_cpp_v3/behavior_tree.h>\\n\\n#include <behaviortree_cpp_v3/bt_factory.h>\\n\\n#include <ros/ros.h>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 38,\n \"score\": 146274.5694027718\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2021, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 39,\n \"score\": 146255.76003755038\n },\n {\n \"content\": \"class MessageStagnationCheckParams final\\n\\n{\\n\\npublic:\\n\\n MessageStagnationCheckParams() = default;\\n\\n\\n\\n MessageStagnationCheckParams &window_size(size_t size)\\n\\n {\\n\\n window_size_ = size;\\n\\n return *this;\\n\\n }\\n\\n\\n\\n size_t window_size() const\\n\\n {\\n\\n return window_size_;\\n\\n }\\n\\n\\n\\n MessageStagnationCheckParams &stagnation_diagnostic(Diagnostic diagnostic)\\n\\n {\\n\\n if (diagnostic.description().empty())\\n\\n {\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 40,\n \"score\": 144806.9923656939\n },\n {\n \"content\": \"class TimeoutNode : public BT::DecoratorNode\\n\\n{\\n\\n public:\\n\\n TimeoutNode(const std::string& name, std::chrono::milliseconds timeout);\\n\\n\\n\\n TimeoutNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n ~TimeoutNode() override { halt(); }\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return {\\n\\n BT::InputPort<unsigned>(\\\"msec\\\", \\\"Timeout to halt child if still running, in milliseconds\\\")};\\n\\n }\\n\\n\\n\\n void halt() override\\n\\n {\\n\\n timer_.cancelAll();\\n\\n DecoratorNode::halt();\\n\\n }\\n\\n\\n\\n private:\\n\\n internal::TimerQueue timer_;\\n\\n\\n\\n BT::NodeStatus tick() override;\\n\\n\\n\\n std::chrono::milliseconds timeout_;\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/timeout.h\",\n \"rank\": 41,\n \"score\": 143312.76147263835\n },\n {\n \"content\": \"class AbortNode : public ReactiveActionNode\\n\\n{\\n\\npublic:\\n\\n AbortNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n static BT::PortsList providedPorts() { return {}; }\\n\\n\\n\\nprivate:\\n\\n void stateDataCallback(auv_interfaces::StateStamped::ConstPtr msg);\\n\\n\\n\\n BT::NodeStatus setUp() override;\\n\\n BT::NodeStatus doWork() override;\\n\\n void tearDown() override;\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::Publisher attitude_servo_pub_;\\n\\n ros::Subscriber state_sub_;\\n\\n\\n\\n auv_interfaces::StateStamped::ConstPtr state_;\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/abort.h\",\n \"rank\": 42,\n \"score\": 143312.76147263835\n },\n {\n \"content\": \"class DelayForNode : public BT::DecoratorNode\\n\\n{\\n\\n public:\\n\\n DelayForNode(const std::string& name, std::chrono::milliseconds delay);\\n\\n\\n\\n DelayForNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n ~DelayForNode() override { halt(); }\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return {BT::InputPort<unsigned>(\\\"delay_msec\\\", \\\"Time to delay child ticking, in milliseconds\\\")};\\n\\n }\\n\\n\\n\\n void halt() override\\n\\n {\\n\\n timer_.cancelAll();\\n\\n DecoratorNode::halt();\\n\\n }\\n\\n\\n\\n private:\\n\\n internal::TimerQueue timer_;\\n\\n\\n\\n BT::NodeStatus tick() override;\\n\\n\\n\\n std::chrono::milliseconds delay_;\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/delay_for.h\",\n \"rank\": 43,\n \"score\": 143312.76147263835\n },\n {\n \"content\": \"class IntrospectableNode<BaseNodeT, false> : public BaseNodeT\\n\\n{\\n\\npublic:\\n\\n using BaseNodeT::BaseNodeT;\\n\\n\\n\\n BT::NodeStatus executeTick() override\\n\\n {\\n\\n if (BT::NodeStatus::IDLE == this->status())\\n\\n {\\n\\n parent_path_ = introspection::extendActivePath(\\n\\n this->config().blackboard.get(), this->name());\\n\\n }\\n\\n\\n\\n // NOTE(hidmic): this will not work for async and coroutine-based action types.\\n\\n // The BT library does not lend itself well to built-in node types extension.\\n\\n BT::NodeStatus current_status = BaseNodeT::executeTick();\\n\\n\\n\\n if (BT::NodeStatus::RUNNING != current_status)\\n\\n {\\n\\n introspection::setActivePath(this->config().blackboard.get(), parent_path_);\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/introspectable_node.h\",\n \"rank\": 44,\n \"score\": 142598.8995606905\n },\n {\n \"content\": \" void tearDown() override;\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::Publisher depth_heading_pub_;\\n\\n ros::Subscriber state_sub_;\\n\\n\\n\\n double target_depth_;\\n\\n double depth_tolerance_;\\n\\n double target_heading_;\\n\\n double heading_tolerance_;\\n\\n double speed_knots_;\\n\\n uint8_t enable_mask_;\\n\\n\\n\\n auv_interfaces::StateStamped::ConstPtr state_;\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_SET_DEPTH_HEADING_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_depth_heading.h\",\n \"rank\": 45,\n \"score\": 142579.23760892535\n },\n {\n \"content\": \" void tearDown() override;\\n\\n\\n\\n ros::NodeHandle nh_;\\n\\n ros::Publisher altitude_heading_pub_;\\n\\n ros::Subscriber state_sub_;\\n\\n\\n\\n double target_altitude_;\\n\\n double altitude_tolerance_;\\n\\n double target_heading_;\\n\\n double heading_tolerance_;\\n\\n double speed_knots_;\\n\\n uint8_t enable_mask_;\\n\\n\\n\\n auv_interfaces::StateStamped::ConstPtr state_;\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_SET_ALTITUDE_HEADING_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_altitude_heading.h\",\n \"rank\": 46,\n \"score\": 142579.23760892535\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\\n\\n\\n\\n#ifndef MISSION_CONTROL_BEHAVIORS_SET_DEPTH_HEADING_H\\n\\n#define MISSION_CONTROL_BEHAVIORS_SET_DEPTH_HEADING_H\\n\\n\\n\\n#include <behaviortree_cpp_v3/basic_types.h>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_depth_heading.h\",\n \"rank\": 47,\n \"score\": 142572.62367396362\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n// Original version: Christopher Scianna Christopher.Scianna@us.QinetiQ.com\\n\\n\\n\\n#ifndef MISSION_CONTROL_BEHAVIORS_SET_ALTITUDE_HEADING_H\\n\\n#define MISSION_CONTROL_BEHAVIORS_SET_ALTITUDE_HEADING_H\\n\\n\\n\\n#include <behaviortree_cpp_v3/basic_types.h>\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_altitude_heading.h\",\n \"rank\": 48,\n \"score\": 142572.62367396362\n },\n {\n \"content\": \"#include <behaviortree_cpp_v3/behavior_tree.h>\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include <string>\\n\\n\\n\\n#include \\\"auv_interfaces/StateStamped.h\\\"\\n\\n#include \\\"mission_control/behaviors/helpers.h\\\"\\n\\n#include \\\"mission_control/behaviors/reactive_action.h\\\"\\n\\n\\n\\n\\n\\nnamespace mission_control\\n\\n{\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_depth_heading.h\",\n \"rank\": 49,\n \"score\": 142569.28749238874\n },\n {\n \"content\": \"#include <behaviortree_cpp_v3/behavior_tree.h>\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include <string>\\n\\n\\n\\n#include \\\"auv_interfaces/StateStamped.h\\\"\\n\\n#include \\\"mission_control/behaviors/helpers.h\\\"\\n\\n#include \\\"mission_control/behaviors/reactive_action.h\\\"\\n\\n\\n\\n\\n\\nnamespace mission_control\\n\\n{\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_altitude_heading.h\",\n \"rank\": 50,\n \"score\": 142569.28749238874\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2020, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_depth_heading.h\",\n \"rank\": 51,\n \"score\": 142551.69804740185\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2021, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/set_altitude_heading.h\",\n \"rank\": 52,\n \"score\": 142551.69804740185\n },\n {\n \"content\": \"class MessageStagnationCheck : public TopicDiagnosticTask<MessageT>\\n\\n{\\n\\npublic:\\n\\n using MessageEqualOp = boost::function<bool(const MessageT &, const MessageT &)>;\\n\\n\\n\\n MessageStagnationCheck(const std::string &name, const MessageEqualOp &equal_op)\\n\\n : MessageStagnationCheck(name, equal_op, MessageStagnationCheckParams{}) {}\\n\\n\\n\\n MessageStagnationCheck(const std::string &name, const MessageEqualOp &equal_op,\\n\\n MessageStagnationCheckParams params)\\n\\n : TopicDiagnosticTask<MessageT>(name), equal_op_(equal_op), params_(std::move(params)) {}\\n\\n\\n\\n void tick(const ros::Time &stamp, const MessageT &message) override\\n\\n {\\n\\n tick(stamp, boost::make_shared<MessageT const>(message));\\n\\n }\\n\\n\\n\\n void tick(const ros::Time &stamp, const boost::shared_ptr<MessageT const> &message) override\\n\\n {\\n\\n if (!message)\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 53,\n \"score\": 141621.4832303572\n },\n {\n \"content\": \" * Author: jsun\\n\\n */\\n\\n\\n\\n#ifndef SETFINDEFLECTION_H_\\n\\n#define SETFINDEFLECTION_H_\\n\\n\\n\\n#include <ros/ros.h>\\n\\n#include <stdint.h>\\n\\n#include \\\"JausMessageIn.h\\\"\\n\\n#include <fin_control/SetAngles.h>\\n\\n\\n\",\n \"file_path\": \"jaus_ros_bridge/include/SetFinDeflection.h\",\n \"rank\": 54,\n \"score\": 139240.64644344078\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n// Original version: Jie Sun <Jie.Sun@us.QinetiQ.com>\\n\\n\\n\\n/*\\n\\n * SetFinDeflection.h\\n\\n *\\n\\n * Created on: Jun 11, 2019\\n\",\n \"file_path\": \"jaus_ros_bridge/include/SetFinDeflection.h\",\n \"rank\": 55,\n \"score\": 139238.36613039422\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2020, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"jaus_ros_bridge/include/SetFinDeflection.h\",\n \"rank\": 56,\n \"score\": 139218.7330317905\n },\n {\n \"content\": \"class SingleDynamixelController\\n\\n{\\n\\n private:\\n\\n // ROS NodeHandle\\n\\n ros::NodeHandle node_handle_;\\n\\n\\n\\n // ROS Parameters\\n\\n\\n\\n // ROS Topic Publisher\\n\\n\\n\\n // ROS Topic Subscriber\\n\\n\\n\\n // ROS Service Server\\n\\n\\n\\n // ROS Service Client\\n\\n ros::ServiceClient dynamixel_info_client_;\\n\\n ros::ServiceClient dynamixel_command_client_;\\n\\n\\n\\n // Dynamixel Workbench Parameters\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h\",\n \"rank\": 57,\n \"score\": 138716.310761672\n },\n {\n \"content\": \"class FixRudderNode : public ReactiveActionNode\\n\\n{\\n\\npublic:\\n\\n FixRudderNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return MakePortsList(\\n\\n InputPort<double, HasAngleUnits>(\\\"rudder\\\", NAN, \\\"Rudder angle\\\"),\\n\\n BT::InputPort<double>(\\\"depth\\\", NAN, \\\"Depth to reach (positive down), in meters\\\"),\\n\\n BT::InputPort<double>(\\\"speed_knots\\\", NAN, \\\"Cruise speed to command, in knots\\\"));\\n\\n }\\n\\n\\n\\nprotected:\\n\\n BT::NodeStatus doWork() override;\\n\\n\\n\\nprivate:\\n\\n ros::NodeHandle nodeHandle_;\\n\\n ros::Publisher fixedRudderBehaviorPub_;\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_FIX_RUDDER_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/fix_rudder.h\",\n \"rank\": 58,\n \"score\": 137889.22583845793\n },\n {\n \"content\": \"class GoToWaypointNode : public ReactiveActionNode\\n\\n{\\n\\npublic:\\n\\n GoToWaypointNode(const std::string &name, const BT::NodeConfiguration &config);\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return {\\n\\n BT::InputPort<double>(\\\"depth\\\", NAN, \\\"Waypoint depth (positive down), in meters\\\"),\\n\\n BT::InputPort<double>(\\\"altitude\\\", NAN, \\\"Waypoint altitude (positive up), in meters\\\"),\\n\\n BT::InputPort<double>(\\\"latitude\\\", NAN, \\\"Waypoint latitude, in degrees\\\"),\\n\\n BT::InputPort<double>(\\\"longitude\\\", NAN, \\\"Waypoint longitude, in degrees\\\"),\\n\\n BT::InputPort<double>(\\\"speed_knots\\\", NAN, \\\"Cruise speed to command, in knots\\\"),\\n\\n BT::InputPort<double>(\\\"tolerance_radius\\\", 0.0, \\\"Radius of the tolerance sphere \\\"\\n\\n \\\"for UTM coordinates, in meters\\\")};\\n\\n }\\n\\n\\n\\nprivate:\\n\\n void stateCallback(auv_interfaces::StateStamped::ConstPtr msg);\\n\\n\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/go_to_waypoint.h\",\n \"rank\": 59,\n \"score\": 137889.22583845793\n },\n {\n \"content\": \"class PayloadCommandNode : public ReactiveActionNode\\n\\n{\\n\\npublic:\\n\\n PayloadCommandNode(const std::string& name, const BT::NodeConfiguration& config);\\n\\n\\n\\n static BT::PortsList providedPorts()\\n\\n {\\n\\n return {BT::InputPort<std::string>(\\\"command\\\", \\\"Command to be sent to payload\\\")};\\n\\n }\\n\\n\\n\\nprotected:\\n\\n BT::NodeStatus doWork() override;\\n\\n\\n\\nprivate:\\n\\n ros::NodeHandle nodeHandle_;\\n\\n ros::Publisher payloadCommandPub_;\\n\\n};\\n\\n\\n\\n} // namespace mission_control\\n\\n\\n\\n#endif // MISSION_CONTROL_BEHAVIORS_PAYLOAD_COMMAND_H\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/payload_command.h\",\n \"rank\": 60,\n \"score\": 137889.22583845793\n },\n {\n \"content\": \" dxl_id[1] = atoi(argv[4]);\\n\\n }\\n\\n\\n\\n DynamixelWorkbench dxl_wb;\\n\\n\\n\\n const char *log;\\n\\n bool result = false;\\n\\n\\n\\n result = dxl_wb.init(port_name, baud_rate, &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to init\\\\n\\\");\\n\\n\\n\\n return 0;\\n\\n }\\n\\n else\\n\\n printf(\\\"Succeed to init(%d)\\\\n\\\", baud_rate); \\n\\n\\n\\n for (int cnt = 0; cnt < 2; cnt++)\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 61,\n \"score\": 137861.4688933535\n },\n {\n \"content\": \"void swap(int32_t *array);\\n\\n\\n\\nint main(int argc, char *argv[]) \\n\\n{\\n\\n const char* port_name = \\\"/dev/ttyUSB0\\\";\\n\\n int baud_rate = 57600;\\n\\n\\n\\n uint16_t model_number = 0;\\n\\n uint8_t dxl_id[2] = {0, 0};\\n\\n\\n\\n if (argc < 5)\\n\\n {\\n\\n printf(\\\"Please set '-port_name', '-baud_rate', '-dynamixel_id_1', '-dynamixel_id_2' arguments for connected Dynamixels\\\\n\\\");\\n\\n return 0;\\n\\n }\\n\\n else\\n\\n {\\n\\n port_name = argv[1];\\n\\n baud_rate = atoi(argv[2]);\\n\\n dxl_id[0] = atoi(argv[3]);\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 62,\n \"score\": 137854.2760774127\n },\n {\n \"content\": \" printf(\\\"Failed to add bulk write position param\\\\n\\\");\\n\\n }\\n\\n else\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n\\n\\n result = dxl_wb.addBulkWriteParam(dxl_id[1], \\\"LED\\\", led[0], &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to add bulk write led param\\\\n\\\");\\n\\n }\\n\\n else\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n\\n\\n result = dxl_wb.bulkWrite(&log);\\n\\n if (result == false)\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 63,\n \"score\": 137842.9219647419\n },\n {\n \"content\": \" printf(\\\"Failed to add bulk read led param\\\\n\\\");\\n\\n }\\n\\n else\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n\\n\\n int32_t goal_position[2] = {0, 1023};\\n\\n int32_t led[2] = {0, 1};\\n\\n\\n\\n int32_t get_data[2] = {0, 0};\\n\\n\\n\\n const uint8_t handler_index = 0;\\n\\n\\n\\n while(1)\\n\\n {\\n\\n result = dxl_wb.addBulkWriteParam(dxl_id[0], \\\"Goal_Position\\\", goal_position[0], &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 64,\n \"score\": 137838.29123744817\n },\n {\n \"content\": \" {\\n\\n result = dxl_wb.ping(dxl_id[cnt], &model_number, &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to ping\\\\n\\\");\\n\\n }\\n\\n else\\n\\n {\\n\\n printf(\\\"Succeeded to ping\\\\n\\\");\\n\\n printf(\\\"id : %d, model_number : %d\\\\n\\\", dxl_id[cnt], model_number);\\n\\n }\\n\\n\\n\\n result = dxl_wb.jointMode(dxl_id[cnt], 0, 0, &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to change joint mode\\\\n\\\");\\n\\n }\\n\\n else\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 65,\n \"score\": 137837.66164188896\n },\n {\n \"content\": \" {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to bulk write\\\\n\\\");\\n\\n }\\n\\n\\n\\n do\\n\\n {\\n\\n result = dxl_wb.bulkRead(&log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to bulk read\\\\n\\\");\\n\\n }\\n\\n\\n\\n result = dxl_wb.getBulkReadData(&get_data[0], &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n else\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 66,\n \"score\": 137837.30732305473\n },\n {\n \"content\": \" {\\n\\n printf(\\\"Succeed to change joint mode\\\\n\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n result = dxl_wb.initBulkWrite(&log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n else\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n\\n\\n result = dxl_wb.initBulkRead(&log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 67,\n \"score\": 137836.93442471052\n },\n {\n \"content\": \" else\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n\\n\\n result = dxl_wb.addBulkReadParam(dxl_id[0], \\\"Present_Position\\\", &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n printf(\\\"Failed to add bulk read position param\\\\n\\\");\\n\\n }\\n\\n else\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\\n }\\n\\n\\n\\n result = dxl_wb.addBulkReadParam(dxl_id[1], \\\"LED\\\", &log);\\n\\n if (result == false)\\n\\n {\\n\\n printf(\\\"%s\\\\n\\\", log);\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 68,\n \"score\": 137836.2708466289\n },\n {\n \"content\": \"/*******************************************************************************\\n\\n* Copyright 2018 ROBOTIS CO., LTD.\\n\\n*\\n\\n* Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n* you may not use this file except in compliance with the License.\\n\\n* You may obtain a copy of the License at\\n\\n*\\n\\n* http://www.apache.org/licenses/LICENSE-2.0\\n\\n*\\n\\n* Unless required by applicable law or agreed to in writing, software\\n\\n* distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n* See the License for the specific language governing permissions and\\n\\n* limitations under the License.\\n\\n*******************************************************************************/\\n\\n\\n\\n/* Authors: Taehun Lim (Darby) */\\n\\n\\n\\n#include <DynamixelWorkbench.h>\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 69,\n \"score\": 137835.91098889205\n },\n {\n \"content\": \" {\\n\\n printf(\\\"[ID %d]\\\\tGoal Position : %d\\\\tPresent Position : %d, [ID %d]\\\\tLED : %d\\\\n\\\"\\n\\n ,dxl_id[0], goal_position[0], get_data[0], dxl_id[1], get_data[1]);\\n\\n }\\n\\n\\n\\n }while(abs(goal_position[0] - get_data[0]) > 15);\\n\\n\\n\\n swap(goal_position);\\n\\n swap(led);\\n\\n }\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\nvoid swap(int32_t *array)\\n\\n{\\n\\n int32_t tmp = array[0];\\n\\n array[0] = array[1];\\n\\n array[1] = tmp;\\n\\n}\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_toolbox/examples/src/n_Bulk_Read_Write.cpp\",\n \"rank\": 70,\n \"score\": 137824.33373168053\n },\n {\n \"content\": \"class ReactiveActionNode : public BT::ActionNodeBase\\n\\n{\\n\\npublic:\\n\\n using BT::ActionNodeBase::ActionNodeBase;\\n\\n\\n\\n BT::NodeStatus tick() override\\n\\n {\\n\\n BT::NodeStatus current_status = status();\\n\\n switch (current_status)\\n\\n {\\n\\n case BT::NodeStatus::IDLE:\\n\\n current_status = setUp();\\n\\n break;\\n\\n case BT::NodeStatus::RUNNING:\\n\\n current_status = doWork();\\n\\n if (BT::NodeStatus::RUNNING != current_status)\\n\\n {\\n\\n tearDown();\\n\\n }\\n\\n break;\\n\",\n \"file_path\": \"mission_control/include/mission_control/behaviors/reactive_action.h\",\n \"rank\": 71,\n \"score\": 135333.38878858718\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n * \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\\n\\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\\n\\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\\n\\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\\n\\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\\n\\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\\n\\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\\n\\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n *********************************************************************/\\n\\n\\n\\n/*\\n\\n * diagnostic_tools/message_stagnation_check.h\\n\\n */\\n\\n\\n\\n#ifndef DIAGNOSTIC_TOOLS_MESSAGE_STAGNATION_CHECK_H\\n\\n#define DIAGNOSTIC_TOOLS_MESSAGE_STAGNATION_CHECK_H\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 72,\n \"score\": 135127.6278015817\n },\n {\n \"content\": \" return params_.stagnation_diagnostic();\\n\\n }\\n\\n return params_.normal_diagnostic();\\n\\n }\\n\\n\\n\\n MessageEqualOp equal_op_;\\n\\n MessageStagnationCheckParams params_;\\n\\n std::deque<boost::shared_ptr<MessageT const>> message_window_;\\n\\n std::mutex mutex_;\\n\\n};\\n\\n\\n\\n} // namespace diagnostic_tools\\n\\n} // namespace qna\\n\\n\\n\\n#endif // DIAGNOSTIC_TOOLS_MESSAGE_STAGNATION_CHECK_H\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 73,\n \"score\": 135124.73307702402\n },\n {\n \"content\": \"\\n\\n#include <cinttypes>\\n\\n#include <deque>\\n\\n#include <mutex> // NOLINT(build/c++11)\\n\\n#include <string>\\n\\n#include <utility>\\n\\n\\n\\n#include <diagnostic_updater/diagnostic_updater.h>\\n\\n\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include \\\"diagnostic_tools/diagnostic.h\\\"\\n\\n#include \\\"diagnostic_tools/topic_diagnostic_task.h\\\"\\n\\n\\n\\nnamespace qna\\n\\n{\\n\\nnamespace diagnostic_tools\\n\\n{\\n\\n\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 74,\n \"score\": 135124.24544484136\n },\n {\n \"content\": \" {\\n\\n ROS_WARN_NAMED(\\\"diagnostic_tools\\\", \\\"No stagnation checks possible on null message\\\");\\n\\n return;\\n\\n }\\n\\n\\n\\n std::lock_guard<std::mutex> guard(mutex_);\\n\\n message_window_.push_back(message);\\n\\n if (message_window_.size() > params_.window_size())\\n\\n {\\n\\n message_window_.pop_front();\\n\\n }\\n\\n }\\n\\n\\n\\n void run(diagnostic_updater::DiagnosticStatusWrapper &stat) override\\n\\n {\\n\\n std::lock_guard<std::mutex> guard(mutex_);\\n\\n const Diagnostic &diagnostic = diagnose();\\n\\n stat.summary(diagnostic.status(), diagnostic.description());\\n\\n if (diagnostic.has_code())\\n\\n {\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 75,\n \"score\": 135116.33943766088\n },\n {\n \"content\": \" diagnostic.description(\\\"Messages have stagnated\\\");\\n\\n }\\n\\n stagnation_diagnostic_ = std::move(diagnostic);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n const Diagnostic &stagnation_diagnostic() const\\n\\n {\\n\\n return stagnation_diagnostic_;\\n\\n }\\n\\n\\n\\n MessageStagnationCheckParams &stale_diagnostic(Diagnostic diagnostic)\\n\\n {\\n\\n if (diagnostic.description().empty())\\n\\n {\\n\\n diagnostic.description(\\\"Not enough messages since last update\\\");\\n\\n }\\n\\n stale_diagnostic_ = std::move(diagnostic);\\n\\n return *this;\\n\\n }\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 76,\n \"score\": 135113.1252927396\n },\n {\n \"content\": \"\\n\\n const Diagnostic &stale_diagnostic() const\\n\\n {\\n\\n return stale_diagnostic_;\\n\\n }\\n\\n\\n\\n MessageStagnationCheckParams &normal_diagnostic(Diagnostic diagnostic)\\n\\n {\\n\\n if (diagnostic.description().empty())\\n\\n {\\n\\n diagnostic.description(\\\"Messages fluctuate normally\\\");\\n\\n }\\n\\n normal_diagnostic_ = std::move(diagnostic);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n const Diagnostic &normal_diagnostic() const\\n\\n {\\n\\n return normal_diagnostic_;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n size_t window_size_{3};\\n\\n Diagnostic normal_diagnostic_{Diagnostic::OK, \\\"Messages fluctuate normally\\\"};\\n\\n Diagnostic stagnation_diagnostic_{Diagnostic::WARN, \\\"Messages have stagnated\\\"};\\n\\n Diagnostic stale_diagnostic_{Diagnostic::STALE, \\\"Not enough messages since last update\\\"};\\n\\n};\\n\\n\\n\\ntemplate <typename MessageT>\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 77,\n \"score\": 135112.78415380284\n },\n {\n \"content\": \" stat.addf(\\\"Code\\\", \\\"%\\\" PRIu64, diagnostic.code());\\n\\n }\\n\\n }\\n\\n\\n\\nprivate:\\n\\n const Diagnostic &diagnose()\\n\\n {\\n\\n if (message_window_.size() < params_.window_size())\\n\\n {\\n\\n return params_.stale_diagnostic();\\n\\n }\\n\\n auto predicate = [this](const boost::shared_ptr<MessageT const> &a,\\n\\n const boost::shared_ptr<MessageT const> &b)\\n\\n {\\n\\n return equal_op_(*a, *b);\\n\\n };\\n\\n if (std::adjacent_find(message_window_.begin(),\\n\\n message_window_.end(),\\n\\n predicate) != message_window_.end())\\n\\n {\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 78,\n \"score\": 135109.45072859223\n },\n {\n \"content\": \"/*********************************************************************\\n\\n * Software License Agreement (BSD License)\\n\\n *\\n\\n * Copyright (c) 2020, QinetiQ, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions\\n\\n * are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * * Redistributions in binary form must reproduce the above\\n\\n * copyright notice, this list of conditions and the following\\n\\n * disclaimer in the documentation and/or other materials provided\\n\\n * with the distribution.\\n\\n * * Neither the name of QinetiQ nor the names of its\\n\\n * contributors may be used to endorse or promote products derived\\n\\n * from this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"diagnostics_tools/include/diagnostic_tools/message_stagnation_check.h\",\n \"rank\": 79,\n \"score\": 135107.39988133364\n },\n {\n \"content\": \" public:\\n\\n SingleDynamixelController();\\n\\n ~SingleDynamixelController();\\n\\n void viewManagerMenu(void);\\n\\n bool controlLoop(void);\\n\\n\\n\\n private:\\n\\n bool initSingleDynamixelController();\\n\\n bool shutdownSingleDynamixelController();\\n\\n\\n\\n int getch(void);\\n\\n int kbhit(void);\\n\\n\\n\\n bool sendCommandMsg(std::string cmd, std::string addr = \\\"\\\", int64_t value = 0);\\n\\n\\n\\n};\\n\\n}\\n\\n\\n\\n#endif //DYNAMIXEL_WORKBENCH_SINGLE_DYNAMIXEL_CONTROLLER_H\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h\",\n \"rank\": 80,\n \"score\": 132700.045534833\n },\n {\n \"content\": \"\\n\\n#include <fcntl.h> // FILE control\\n\\n#include <termios.h> // Terminal IO\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include \\\"dynamixel_workbench_msgs/DynamixelCommand.h\\\"\\n\\n#include \\\"dynamixel_workbench_msgs/GetDynamixelInfo.h\\\"\\n\\n#include \\\"message_header.h\\\"\\n\\n\\n\\nnamespace single_dynamixel_controller\\n\\n{\\n\\n#define ESC_ASCII_VALUE 0x1b\\n\\n#define SPACEBAR_ASCII_VALUE 0x20\\n\\n#define ENTER_ASCII_VALUE 0x0a\\n\\n\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h\",\n \"rank\": 81,\n \"score\": 132691.80188293476\n },\n {\n \"content\": \"/*******************************************************************************\\n\\n* Copyright 2016 ROBOTIS CO., LTD.\\n\\n*\\n\\n* Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n* you may not use this file except in compliance with the License.\\n\\n* You may obtain a copy of the License at\\n\\n*\\n\\n* http://www.apache.org/licenses/LICENSE-2.0\\n\\n*\\n\\n* Unless required by applicable law or agreed to in writing, software\\n\\n* distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n* See the License for the specific language governing permissions and\\n\\n* limitations under the License.\\n\\n*******************************************************************************/\\n\\n\\n\\n/* Authors: Taehun Lim (Darby) */\\n\\n\\n\\n#ifndef DYNAMIXEL_WORKBENCH_SINGLE_DYNAMIXEL_CONTROLLER_H\\n\\n#define DYNAMIXEL_WORKBENCH_SINGLE_DYNAMIXEL_CONTROLLER_H\\n\",\n \"file_path\": \"dynamixel-workbench/dynamixel_workbench_single_manager/include/dynamixel_workbench_single_manager/single_dynamixel_controller.h\",\n \"rank\": 82,\n \"score\": 132685.53670886823\n },\n {\n \"content\": \"class ReportFinDeflection : public JausMessageOut {\\n\\n private:\\n\\n int8_t _deflectionAngle; // 1 byte - DeflectionCMD in document\\n\\n int8_t _finId; // 1 byte\\n\\n ros::Subscriber _subscriber_reportAngle;\\n\\n\\n\\n public:\\n\\n void init(ros::NodeHandle* nodeHandle, int8_t finId, udpserver* udp);\\n\\n virtual DataInfo GetPackedMessage(void* data);\\n\\n void SetFinId(int8_t finId) { _finId = finId; };\\n\\n virtual void Reset() { _deflectionAngle = -100; }\\n\\n // void SetdeflectionAngle(int8_t angle){\\n\\n // _deflectionAngle = angle;};\\n\\n void handleReportAngle(const fin_control::ReportAngle::ConstPtr& msg);\\n\\n};\\n\\n\\n\\n#endif /* REPORTFINDEFLECTION_H_ */\\n\",\n \"file_path\": \"jaus_ros_bridge/include/ReportFinDeflection.h\",\n \"rank\": 83,\n \"score\": 131168.17253069536\n },\n {\n \"content\": \"class SetPayloadCommands : public JausMessageIn {\\n\\n public:\\n\\n void init(ros::NodeHandle* nodeHandle);\\n\\n\\n\\n void ProcessData(char* message, JausCommandID cmdID);\\n\\n\\n\\n private:\\n\\n ros::Publisher _publisher_payload_command;\\n\\n};\\n\\n\\n\\n#endif // SETPAYLOADCOMMANDS_H\\n\",\n \"file_path\": \"jaus_ros_bridge/include/SetPayloadCommands.h\",\n \"rank\": 84,\n \"score\": 131101.3822766257\n },\n {\n \"content\": \"class SetMissionCommands : public JausMessageIn {\\n\\n public:\\n\\n void init(ros::NodeHandle* nodeHandle);\\n\\n\\n\\n void ProcessData(char* message, JausCommandID cmdID);\\n\\n\\n\\n void StopMissions();\\n\\n\\n\\n private:\\n\\n ros::Publisher _publisher_Execute_mission;\\n\\n ros::Publisher _publisher_Stop_mission;\\n\\n ros::Publisher _publisher_Abort_mission;\\n\\n ros::Publisher _publisher_Load_mission;\\n\\n ros::Publisher _publisher_Query_mission;\\n\\n ros::Publisher _publisher_Remove_mission;\\n\\n};\\n\\n\\n\\n#endif // SETMISSIONCOMMANDS_H\\n\",\n \"file_path\": \"jaus_ros_bridge/include/SetMissionCommands.h\",\n \"rank\": 85,\n \"score\": 131101.3822766257\n },\n {\n \"content\": \"class PowerPlantControl : public JausMessageIn {\\n\\n public:\\n\\n // PowerPlantControl();\\n\\n void init(ros::NodeHandle* nodeHandle);\\n\\n void PublishRPM(const bool enable);\\n\\n void ProcessData(char* message);\\n\\n\\n\\n enum PresenceBits { RPMBit = 0, ThrottleBit = 1, GlowPlugStateBit = 2 };\\n\\n\\n\\n int8_t GetPowerPlantID();\\n\\n\\n\\n int8_t GetPowerCMD();\\n\\n\\n\\n int8_t GetEnginId();\\n\\n\\n\\n int GetRpm();\\n\\n void StopThruster();\\n\\n\\n\\n private:\\n\\n void commandRPM(const ros::TimerEvent& ev);\\n\",\n \"file_path\": \"jaus_ros_bridge/include/PowerPlantControl.h\",\n \"rank\": 86,\n \"score\": 129663.9674542912\n },\n {\n \"content\": \"enum JausCommandID {\\n\\n JAUS_COMMAND_Invalid = 0,\\n\\n JAUS_COMMAND_PowerPlantControl = 0x0A06,\\n\\n // JAUS_COMMAND_QueryPowerPlantSpecifications = 0x2A05,\\n\\n // JAUS_COMMAND_QueryPowerPlantStatus = 0x2A06,\\n\\n // JAUS_COMMAND_ReportPowerPlantSpecifications = 0x4A05,\\n\\n JAUS_COMMAND_ReportPowerPlantStatus = 0x4A06,\\n\\n\\n\\n // Fin control\\n\\n JAUS_COMMAND_SetFinDeflection = 0x0A36,\\n\\n JAUS_COMMAND_ReportFinDeflection = 0x4A36,\\n\\n\\n\\n // INS data report\\n\\n JAUS_COMMAND_ReportINSData = 0x5A01,\\n\\n\\n\\n // Altimeter report\\n\\n JAUS_COMMAND_ReportAltimeter = 0x5A06,\\n\\n\\n\\n // Altimeter report\\n\\n JAUS_COMMAND_ReportPoseEstimetorData = 0x5A10,\\n\",\n \"file_path\": \"jaus_ros_bridge/include/JausMessageHeader.h\",\n \"rank\": 87,\n \"score\": 127506.25560732269\n },\n {\n \"content\": \"/// \\\\brief Represents a cross-platform serial port.\\n\\n///\\n\\n/// When the SerialPort if first created and the connection opened, the user\\n\\n/// will normally have to poll the method \\\\ref read to see if any new data is\\n\\n/// available on the serial port. However, if the user code registers a\\n\\n/// handler with the method \\\\ref registerDataReceivedHandler, the SerialPort\\n\\n/// object will start an internal thread that monitors the serial port for new\\n\\n/// data, and when new data is available, it will alert the user code through\\n\\n/// the callback handler. Then the user can call \\\\ref read to retrieve the\\n\\n/// data.\\n\\nclass vn_proglib_DLLEXPORT SerialPort : public IPort, util::NoCopy\\n\\n{\\n\\n\\n\\n\\t// Types //////////////////////////////////////////////////////////////////\\n\\n\\t\\n\\npublic:\\n\\n\\t\\n\\n\\tenum StopBits\\n\\n\\t{\\n\\n\\t\\tONE_STOP_BIT,\\n\\n\\t\\tTWO_STOP_BITS\\n\\n\\t};\\n\\n\\n\\n\\t// Constructors ///////////////////////////////////////////////////////////\\n\\n\\n\\npublic:\\n\\n\\n\\n\\t/// \\\\brief Creates a new \\\\ref SerialPort with the provided connection\\n\\n\\t/// parameters.\\n\\n\\t///\\n\",\n \"file_path\": \"vectornav/vnproglib-1.1.4.0/cpp/include/vn/serialport.h\",\n \"rank\": 88,\n \"score\": 125698.26195179526\n }\n]","isConversational":false}}},{"rowIdx":74,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Source/UnitUtil.cpp"},"repo_name":{"kind":"string","value":"biug/XBot"},"commit":{"kind":"string","value":"20f51094ee18aeaa58d769a894c68b4f05f900d4"},"file_code":{"kind":"string","value":"#include \"UnitUtil.h\"\n\nusing namespace XBot;\n\nbool UnitUtil::IsMorphedBuildingType(BWAPI::UnitType type)\n{\n\treturn\n\t\ttype == BWAPI::UnitTypes::Zerg_Sunken_Colony ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Spore_Colony ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Lair ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Hive ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Greater_Spire;\n}\n\nbool UnitUtil::IsCombatSimUnit(BWAPI::UnitType type)\n{\n\tif (type.isWorker())\n\t{\n\t\treturn false;\n\t}\n\n\treturn\n\t\ttype.canAttack() || \n\t\ttype == BWAPI::UnitTypes::Terran_Medic ||\n\t\ttype.isDetector();\n}\n\nbool UnitUtil::IsCombatUnit(BWAPI::UnitType type)\n{\n \n\t\n\tif (type.isWorker() ||\n\t\ttype.isBuilding() ||\n\t\ttype == BWAPI::UnitTypes::Protoss_Interceptor) \n {\n return false;\n }\n\n\tif (type.canAttack() || \n\t\ttype.isDetector() ||\n\t\ttype == BWAPI::UnitTypes::Terran_Medic ||\n\t\ttype == BWAPI::UnitTypes::Protoss_High_Templar ||\n\t\ttype.isFlyer() && type.spaceProvided() > 0) \n {\n return true;\n\t}\n\n\treturn false;\n}\n\nbool UnitUtil::IsCombatUnit(BWAPI::Unit unit)\n{\n\tUAB_ASSERT(unit != nullptr, \"Unit was null\");\n\tif (!unit)\n\t{\n\t\treturn false;\n\t}\n\n\treturn IsCombatUnit(unit->getType());\n}\n\nbool UnitUtil::IsValidUnit(BWAPI::Unit unit)\n{\n\treturn unit\n\t\t&& unit->exists()\n\t\t&& (unit->isCompleted() || IsMorphedBuildingType(unit->getType()))\n\t\t&& unit->getHitPoints() > 0\n\t\t&& unit->getType() != BWAPI::UnitTypes::Unknown\n\t\t&& unit->getPosition().isValid();\n}\n\nbool UnitUtil::CanAttack(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\treturn target->isFlying() ? TypeCanAttackAir(attacker->getType()) : TypeCanAttackGround(attacker->getType());\n}\n\nbool UnitUtil::CanAttack(BWAPI::UnitType attacker, BWAPI::UnitType target)\n{\n\treturn target.isFlyer() ? TypeCanAttackAir(attacker) : TypeCanAttackGround(attacker);\n}\n\nbool UnitUtil::CanAttackAir(BWAPI::Unit attacker)\n{\n\treturn TypeCanAttackAir(attacker->getType());\n}\n\nbool UnitUtil::TypeCanAttackAir(BWAPI::UnitType attacker)\n{\n\treturn attacker.airWeapon() != BWAPI::WeaponTypes::None ||\n\t\tattacker == BWAPI::UnitTypes::Terran_Bunker ||\n\t\tattacker == BWAPI::UnitTypes::Protoss_Carrier;\n}\n\nbool UnitUtil::CanAttackGround(BWAPI::Unit attacker)\n{\n\treturn TypeCanAttackGround(attacker->getType());\n}\n\nbool UnitUtil::TypeCanAttackGround(BWAPI::UnitType attacker)\n{\n\treturn attacker.groundWeapon() != BWAPI::WeaponTypes::None ||\n\t\tattacker == BWAPI::UnitTypes::Terran_Bunker ||\n\t\tattacker == BWAPI::UnitTypes::Protoss_Carrier ||\n\t\tattacker == BWAPI::UnitTypes::Protoss_Reaver;\n}\n\ndouble UnitUtil::CalculateLTD(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\tBWAPI::WeaponType weapon = GetWeapon(attacker, target);\n\n\tif (weapon == BWAPI::WeaponTypes::None || weapon.damageCooldown() <= 0)\n\t{\n\t\treturn 0;\n\t}\n\n\treturn double(weapon.damageAmount()) / weapon.damageCooldown();\n}\n\nBWAPI::WeaponType UnitUtil::GetWeapon(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\treturn GetWeapon(attacker->getType(), target);\n}\n\nBWAPI::WeaponType UnitUtil::GetWeapon(BWAPI::UnitType attacker, BWAPI::Unit target)\n{\n\tif (attacker == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Interceptor, target);\n\t}\n\tif (attacker == BWAPI::UnitTypes::Protoss_Reaver)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Scarab, target);\n\t}\n\treturn target->isFlying() ? attacker.airWeapon() : attacker.groundWeapon();\n}\n\nBWAPI::WeaponType UnitUtil::GetWeapon(BWAPI::UnitType attacker, BWAPI::UnitType target)\n{\n\tif (attacker == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Interceptor, target);\n\t}\n\tif (attacker == BWAPI::UnitTypes::Protoss_Reaver)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Scarab, target);\n\t}\n\treturn target.isFlyer() ? attacker.airWeapon() : attacker.groundWeapon();\n}\n\nint UnitUtil::GetAttackRange(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\t\n\tif (attacker->getType() == BWAPI::UnitTypes::Protoss_Reaver && !target->isFlying())\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker->getType() == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker->getType() == BWAPI::UnitTypes::Terran_Bunker)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::U_238_Shells))\n\t\t{\n\t\t\treturn 6 * 32;\n\t\t}\n\t\treturn 5 * 32;\n\t}\n\n\tconst BWAPI::WeaponType weapon = GetWeapon(attacker, target);\n\n\tif (weapon == BWAPI::WeaponTypes::None)\n\t{\n\t\treturn 0;\n\t}\n\n\tint range = weapon.maxRange();\n\n\t\n\t\n\t\n\tif (attacker->getType() == BWAPI::UnitTypes::Protoss_Dragoon)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::Singularity_Charge))\n\t\t{\n\t\t\trange = 6 * 32;\n\t\t}\n\t}\n\telse if (attacker->getType() == BWAPI::UnitTypes::Terran_Marine)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::U_238_Shells))\n\t\t{\n\t\t\trange = 5 * 32;\n\t\t}\n\t}\n\telse if (attacker->getType() == BWAPI::UnitTypes::Terran_Goliath && target->isFlying())\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::Charon_Boosters))\n\t\t{\n\t\t\trange = 8 * 32;\n\t\t}\n\t}\n\telse if (attacker->getType() == BWAPI::UnitTypes::Zerg_Hydralisk)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::Grooved_Spines))\n\t\t{\n\t\t\trange = 5 * 32;\n\t\t}\n\t}\n\n return range;\n}\n\nint UnitUtil::GetAttackRangeAssumingUpgrades(BWAPI::UnitType attacker, BWAPI::UnitType target)\n{\n\t\n\tif (attacker == BWAPI::UnitTypes::Protoss_Reaver && !target.isFlyer())\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker == BWAPI::UnitTypes::Terran_Bunker)\n\t{\n\t\treturn 6 * 32;\n\t}\n\n\tBWAPI::WeaponType weapon = GetWeapon(attacker, target);\n\tif (weapon == BWAPI::WeaponTypes::None)\n {\n return 0;\n }\n\n int range = weapon.maxRange();\n\n\t\n\tif (attacker == BWAPI::UnitTypes::Protoss_Dragoon)\n\t{\n\t\trange = 6 * 32;\n\t}\n\telse if (attacker == BWAPI::UnitTypes::Terran_Marine)\n\t{\n\t\trange = 5 * 32;\n\t}\n\telse if (attacker == BWAPI::UnitTypes::Terran_Goliath && target.isFlyer())\n\t{\n\t\trange = 8 * 32;\n\t}\n\telse if (attacker == BWAPI::UnitTypes::Zerg_Hydralisk)\n\t{\n\t\trange = 5 * 32;\n\t}\n\n\treturn range;\n}\n\nint UnitUtil::GetAllUnitCount(BWAPI::UnitType type)\n{\n int count = 0;\n for (const auto unit : BWAPI::Broodwar->self()->getUnits())\n {\n \n if (unit->getType() == type)\n {\n count++;\n }\n\n \n if (unit->getType() == BWAPI::UnitTypes::Zerg_Egg && unit->getBuildType() == type)\n {\n count += type.isTwoUnitsInOneEgg() ? 2 : 1;\n }\n\n \n if (unit->getRemainingTrainTime() > 0)\n {\n BWAPI::UnitType trainType = unit->getLastCommand().getUnitType();\n\n if (trainType == type && unit->getRemainingTrainTime() == trainType.buildTime())\n {\n count++;\n }\n }\n }\n\n return count;\n}\n\nint UnitUtil::GetCompletedUnitCount(BWAPI::UnitType type)\n{\n\tint count = 0;\n\tfor (const auto unit : BWAPI::Broodwar->self()->getUnits())\n\t{\n\t\tif (unit->getType() == type && unit->isCompleted())\n\t\t{\n\t\t\tcount++;\n\t\t}\n\t}\n\n\treturn count;\n}"},"prefix":{"kind":"string","value":"#include \"UnitUtil.h\"\n\nusing namespace XBot;\n\nbool UnitUtil::IsMorphedBuildingType(BWAPI::UnitType type)\n{\n\treturn\n\t\ttype == BWAPI::UnitTypes::Zerg_Sunken_Colony ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Spore_Colony ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Lair ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Hive ||\n\t\ttype == BWAPI::UnitTypes::Zerg_Greater_Spire;\n}\n\nbool UnitUtil::IsCombatSimUnit(BWAPI::UnitType type)\n{\n\tif (type.isWorker())\n\t{\n\t\treturn false;\n\t}\n\n\treturn\n\t\ttype.canAttack() || \n\t\ttype == BWAPI::UnitTypes::Terran_Medic ||\n\t\ttype.isDetector();\n}\n\nbool UnitUtil::IsCombatUnit(BWAPI::UnitType type)\n{\n \n\t\n\tif (type.isWorker() ||\n\t\ttype.isBuilding() ||\n\t\ttype == BWAPI::UnitTypes::Protoss_Interceptor) \n {\n return false;\n }\n\n\tif (type.canAttack() || \n\t\ttype.isDetector() ||\n\t\ttype == BWAPI::UnitTypes::Terran_Medic ||\n\t\ttype == BWAPI::UnitTypes::Protoss_High_Templar ||\n\t\ttype.isFlyer() && type.spaceProvided() > 0) \n {\n return true;\n\t}\n\n\treturn false;\n}\n\nbool UnitUtil::IsCombatUnit(BWAPI::Unit unit)\n{\n\tUAB_ASSERT(unit != nullptr, \"Unit was null\");\n\tif (!unit)\n\t{\n\t\treturn false;\n\t}\n\n\treturn IsCombatUnit(unit->getType());\n}\n\nbool UnitUtil::IsValidUnit(BWAPI::Unit unit)\n{\n\treturn unit\n\t\t&& unit->exists()\n\t\t&& (unit->isCompleted() || IsMorphedBuildingType(unit->getType()))\n\t\t&& unit->getHitPoints() > 0\n\t\t&& unit->getType() != BWAPI::UnitTypes::Unknown\n\t\t&& unit->getPosition().isValid();\n}\n\nbool UnitUtil::CanAttack(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\treturn target->isFlying() ? TypeCanAttackAir(attacker->getType()) : TypeCanAttackGround(attacker->getType());\n}\n\nbool UnitUtil::CanAttack(BWAPI::UnitType attacker, BWAPI::UnitType target)\n{\n\treturn target.isFlyer() ? TypeCanAttackAir(attacker) : TypeCanAttackGround(attacker);\n}\n\nbool UnitUtil::CanAttackAir(BWAPI::Unit attacker)\n{\n\treturn TypeCanAttackAir(attacker->getType());\n}\n\nbool UnitUtil::TypeCanAttackAir(BWAPI::UnitType attacker)\n{\n\treturn attacker.airWeapon() != BWAPI::WeaponTypes::None ||\n\t\tattacker == BWAPI::UnitTypes::Terran_Bunker ||\n\t\tattacker == BWAPI::UnitTypes::Protoss_Carrier;\n}\n\nbool UnitUtil::CanAttackGround(BWAPI::Unit attacker)\n{\n\treturn TypeCanAttackGround(attacker->getType());\n}\n\nbool UnitUtil::TypeCanAttackGround(BWAPI::UnitType attacker)\n{\n\treturn attacker.groundWeapon() != BWAPI::WeaponTypes::None ||\n\t\tattacker == BWAPI::UnitTypes::Terran_Bunker ||\n\t\tattacker == BWAPI::UnitTypes::Protoss_Carrier ||\n\t\tattacker == BWAPI::UnitTypes::Protoss_Reaver;\n}\n\ndouble UnitUtil::CalculateLTD(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\tBWAPI::WeaponType weapon = GetWeapon(attacker, target);\n\n\tif (weapon == BWAPI::WeaponTypes::None || weapon.damageCooldown() <= 0)\n\t{\n\t\treturn 0;\n\t}\n\n\treturn double(weapon.damageAmount()) / weapon.damageCooldown();\n}\n\nBWAPI::WeaponType UnitUtil::GetWeapon(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\treturn GetWeapon(attacker->getType(), target);\n}\n\nBWAPI::WeaponType UnitUtil::GetWeapon(BWAPI::UnitType attacker, BWAPI::Unit target)\n{\n\tif (attacker == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Interceptor, target);\n\t}\n\tif (attacker == BWAPI::UnitTypes::Protoss_Reaver)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Scarab, target);\n\t}\n\treturn target->isFlying() ? attacker.airWeapon() : attacker.groundWeapon();\n}\n\nBWAPI::WeaponType UnitUtil::GetWeapon(BWAPI::UnitType attacker, BWAPI::UnitType target)\n{\n\tif (attacker == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Interceptor, target);\n\t}\n\tif (attacker == BWAPI::UnitTypes::Protoss_Reaver)\n\t{\n\t\treturn GetWeapon(BWAPI::UnitTypes::Protoss_Scarab, target);\n\t}\n\treturn target.isFlyer() ? attacker.airWeapon() : attacker.groundWeapon();\n}\n\nint UnitUtil::GetAttackRange(BWAPI::Unit attacker, BWAPI::Unit target)\n{\n\t\n\tif (attacker->getType() == BWAPI::UnitTypes::Protoss_Reaver && !target->isFlying())\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker->getType() == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker->getType() == BWAPI::UnitTypes::Terran_Bunker)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::U_238_Shells))\n\t\t{\n\t\t\treturn 6 * 32;\n\t\t}\n\t\treturn 5 * 32;\n\t}\n\n\tconst BWAPI::WeaponType weapon = GetWeapon(attacker, target);\n\n\tif (weapon == BWAPI::WeaponTypes::None)\n\t{\n\t\treturn 0;\n\t}\n\n\tint range = weapon.maxRange();\n\n\t\n\t\n\t\n\tif (attacker->getType() == BWAPI::UnitTypes::Protoss_Dragoon)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::Singularity_Charge))\n\t\t{\n\t\t\trange = 6 * 32;\n\t\t}\n\t}\n\telse if (attacker->getType() == BWAPI::UnitTypes::Terran_Marine)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::U_238_Shells))\n\t\t{\n\t\t\trange = 5 * 32;\n\t\t}\n\t}\n\telse if (attacker->getType() == BWAPI::UnitTypes::Terran_Goliath && target->isFlying())\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::Charon_Boosters))\n\t\t{\n\t\t\trange = 8 * 32;\n\t\t}\n\t}\n\telse if (attacker->getType() == BWAPI::UnitTypes::Zerg_Hydralisk)\n\t{\n\t\tif (attacker->getPlayer() == BWAPI::Broodwar->enemy() ||\n\t\t\tBWAPI::Broodwar->self()->getUpgradeLevel(BWAPI::UpgradeTypes::Grooved_Spines))\n\t\t{\n\t\t\trange = 5 * 32;\n\t\t}\n\t}\n\n return range;\n}\n\nint UnitUtil::GetAttackRangeAssumingUpgrades(BWAPI::UnitType attacker, BWAPI::UnitType target)\n{\n\t\n\tif (attacker == BWAPI::UnitTypes::Protoss_Reaver && !target.isFlyer())\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker == BWAPI::UnitTypes::Protoss_Carrier)\n\t{\n\t\treturn 8;\n\t}\n\tif (attacker == BWAPI::UnitTypes::Terran_Bunker)\n\t{\n\t\treturn 6 * 32;\n\t}\n\n\tBWAPI::WeaponType weapon = GetWeapon(attacker, target);\n\tif (weapon == BWAPI::WeaponTypes::None)\n {\n return 0;\n }\n\n int range = weapon.maxRange();\n\n\t\n\tif (attacker == BWAPI::UnitTypes::Protoss_Dragoon)\n\t{\n\t\trange = 6 * 32;\n\t}\n\telse if (attacker == BWAPI::UnitTypes::Terran_Marine)\n\t{\n\t\trange = 5 * 32;\n\t}\n\telse if (attacker == BWAPI::UnitTypes::Terran_Goliath && target.isFlyer())\n\t{\n\t\trange = 8 * 32;\n\t}\n\telse if (attacker == BWAPI::UnitTypes::Zerg_Hydralisk)\n\t{\n\t\trange = 5 * 32;\n\t}\n\n\treturn range;\n}\n\nint UnitUtil::GetAllUnitCount(BWAPI::UnitType type)\n{\n int count = 0;\n for (const auto unit : BWAPI::Broodwar->self()->getUnits())\n {\n \n if (unit->getType() == type)\n {\n count++;\n }\n\n \n if (unit->getType() == BWAPI::UnitTypes::Ze"},"suffix":{"kind":"string","value":"\n\nint UnitUtil::GetCompletedUnitCount(BWAPI::UnitType type)\n{\n\tint count = 0;\n\tfor (const auto unit : BWAPI::Broodwar->self()->getUnits())\n\t{\n\t\tif (unit->getType() == type && unit->isCompleted())\n\t\t{\n\t\t\tcount++;\n\t\t}\n\t}\n\n\treturn count;\n}"},"middle":{"kind":"string","value":"rg_Egg && unit->getBuildType() == type)\n {\n count += type.isTwoUnitsInOneEgg() ? 2 : 1;\n }\n\n \n if (unit->getRemainingTrainTime() > 0)\n {\n BWAPI::UnitType trainType = unit->getLastCommand().getUnitType();\n\n if (trainType == type && unit->getRemainingTrainTime() == trainType.buildTime())\n {\n count++;\n }\n }\n }\n\n return count;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"// Unit choices for main unit mix and tech target.\n\n// This deliberately omits support units like queens and defilers.\n\nenum class TechUnit : int\n\n\t{ None\n\n\t, Zerglings\n\n\t, Hydralisks\n\n\t, Lurkers\n\n\t, Mutalisks\n\n\t, Ultralisks\n\n\t, Guardians\n\n\t, Devourers\n\n\t, Size\n\n};\n\n\n","file_path":"Source/StrategyBossZerg.h","rank":0,"score":97105.6186361545},{"content":" friend bool operator==(ParseErrorCode code, const ParseResult & err) { return code == err.code_; }\n","file_path":"Source/rapidjson/error/error.h","rank":1,"score":73195.34718891876},{"content":"namespace XBot\n\n{\n\nnamespace UnitUtil\n\n{ \n\n\tbool IsMorphedBuildingType(BWAPI::UnitType unitType);\n\n\t\n\n\tbool IsCombatSimUnit(BWAPI::UnitType type);\n\n\tbool IsCombatUnit(BWAPI::UnitType type);\n\n\tbool IsCombatUnit(BWAPI::Unit unit);\n\n bool IsValidUnit(BWAPI::Unit unit);\n\n \n\n\tbool CanAttack(BWAPI::Unit attacker, BWAPI::Unit target);\n\n\tbool CanAttack(BWAPI::UnitType attacker, BWAPI::UnitType target);\n\n\tbool CanAttackAir(BWAPI::Unit attacker);\n\n\tbool TypeCanAttackAir(BWAPI::UnitType attacker);\n\n\tbool CanAttackGround(BWAPI::Unit attacker);\n\n\tbool TypeCanAttackGround(BWAPI::UnitType attacker);\n\n\tdouble CalculateLTD(BWAPI::Unit attacker, BWAPI::Unit target);\n\n\tBWAPI::WeaponType GetWeapon(BWAPI::Unit attacker, BWAPI::Unit target);\n\n\tBWAPI::WeaponType GetWeapon(BWAPI::UnitType attacker, BWAPI::Unit target);\n\n\tBWAPI::WeaponType GetWeapon(BWAPI::UnitType attacker, BWAPI::UnitType target);\n\n\tint GetAttackRange(BWAPI::Unit attacker, BWAPI::Unit target);\n\n\tint GetAttackRangeAssumingUpgrades(BWAPI::UnitType attacker, BWAPI::UnitType target);\n\n\t\n\n\tint GetAllUnitCount(BWAPI::UnitType type);\n\n\tint GetCompletedUnitCount(BWAPI::UnitType type);\n\n};\n","file_path":"Source/UnitUtil.h","rank":2,"score":73066.87243961479},{"content":"","file_path":"Source/StateManager.h","rank":3,"score":71134.48540044519},{"content":"","file_path":"Source/StateManager.h","rank":4,"score":71070.42466152788},{"content":"","file_path":"Source/StateManager.h","rank":5,"score":71070.42466152788},{"content":"","file_path":"Source/StateManager.h","rank":6,"score":71070.42466152788},{"content":"","file_path":"Source/StateManager.h","rank":7,"score":71070.42466152788},{"content":"enum WorkerData::WorkerJob WorkerData::getWorkerJob(BWAPI::Unit unit)\n\n{\n\n\tif (!unit) { return Default; }\n\n\n\n\tstd::map<BWAPI::Unit, enum WorkerJob>::iterator it = workerJobMap.find(unit);\n\n\n\n\tif (it != workerJobMap.end())\n\n\t{\n\n\t\treturn it->second;\n\n\t}\n\n\n\n\treturn Default;\n\n}\n\n\n\nbool WorkerData::depotIsFull(BWAPI::Unit depot)\n\n{\n\n\tif (!depot) { return false; }\n\n\n\n\tint assignedWorkers = getNumAssignedWorkers(depot);\n\n\tint mineralsNearDepot = getMineralsNearDepot(depot);\n","file_path":"Source/WorkerData.cpp","rank":8,"score":62455.36619926634},{"content":"class UnitData\n\n{\n\n UIMap unitMap;\n\n\n\n const bool badUnitInfo(const UnitInfo & ui) const;\n\n\n\n std::vector<int>\t\t\t\t\t\tnumUnits; // how many now\n\n\tstd::vector<int>\t\t\t\t\t\tnumDeadUnits; // how many lost\n\n\n\n int\t\t\t\t\t\t\t\t\t\tmineralsLost;\n\n int\t\t\t\t\t\t\t\t\t\tgasLost;\n\n\n\npublic:\n\n\n\n UnitData();\n\n\n\n void\tupdateUnit(BWAPI::Unit unit);\n\n void\tremoveUnit(BWAPI::Unit unit);\n\n void\tremoveBadUnits();\n\n\n\n int\t\tgetGasLost() const;\n\n int\t\tgetMineralsLost() const;\n\n int\t\tgetNumUnits(BWAPI::UnitType t) const;\n\n int\t\tgetNumDeadUnits(BWAPI::UnitType t) const;\n\n const\tstd::map<BWAPI::Unit,UnitInfo> & getUnits() const;\n\n\tconst\tUnitInfo * getUnit(BWAPI::Unit unit)\t\tconst;\n\n};\n\n}","file_path":"Source/UnitData.h","rank":9,"score":56271.435437263855},{"content":"struct UnitInfo\n\n{\n\n // we need to store all of this data because if the unit is not visible, we\n\n // can't reference it from the unit pointer\n\n\n\n int unitID;\n\n\tint\t\t\t\tupdateFrame;\n\n int lastHealth;\n\n int lastShields;\n\n BWAPI::Player player;\n\n BWAPI::Unit unit;\n\n BWAPI::Position lastPosition;\n\n\tBWAPI::TilePosition lastTilePosition;\n\n BWAPI::UnitType type;\n\n bool completed;\n\n\n\n UnitInfo()\n\n : unitID(0)\n\n\t\t, updateFrame(0)\n\n\t\t, lastHealth(0)\n","file_path":"Source/UnitData.h","rank":10,"score":56271.435437263855},{"content":"\tclass Graph &\t\t\t\tGetGraph()\t\t\t\t\t\t\t\t\t\t\t\t{ return m_Graph; }\n\n\n\n\n\n\tconst vector<pair<pair<Area::id, Area::id>, BWAPI::WalkPosition>> &\t\tRawFrontier() const override\t\t{ return m_RawFrontier; }\n\n\n\n\n\n\n\n\tvoid\t\t\t\t\t\tOnMineralDestroyed(const Mineral * pMineral);\n\n\tvoid\t\t\t\t\t\tOnBlockingNeutralDestroyed(const Neutral * pBlocking);\n\n\n\nprivate:\n\n\tvoid\t\t\t\t\t\tReplaceAreaIds(BWAPI::WalkPosition p, Area::id newAreaId);\n\n\n\n\tvoid\t\t\t\t\t\tInitializeNeutrals();\n\n\tvoid\t\t\t\t\t\tLoadData();\n\n\tvoid\t\t\t\t\t\tDecideSeasOrLakes();\n\n\tvoid\t\t\t\t\t\tComputeAltitude();\n\n\tvoid\t\t\t\t\t\tProcessBlockingNeutrals();\n\n\tvoid\t\t\t\t\t\tComputeAreas();\n\n\tvector<pair<BWAPI::WalkPosition, MiniTile *>>\n","file_path":"Source/bwem/mapImpl.h","rank":11,"score":53691.5073949815},{"content":"struct GenericMemberIterator<true,Encoding,Allocator> {\n\n //! use plain const pointer as iterator type\n\n typedef const GenericMember<Encoding,Allocator>* Iterator;\n\n};\n\n\n\n#endif // RAPIDJSON_NOMEMBERITERATORCLASS\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// GenericStringRef\n\n\n\n//! Reference to a constant string (not taking a copy)\n\n/*!\n\n \\tparam CharType character type of the string\n\n\n\n This helper class is used to automatically infer constant string\n\n references for string literals, especially from \\c const \\b (!)\n\n character arrays.\n\n\n\n The main use is for creating JSON string values without copying the\n\n source string via an \\ref Allocator. This requires that the referenced\n","file_path":"Source/rapidjson/document.h","rank":12,"score":53685.481801766015},{"content":"class MicroRanged : public MicroManager\n\n{\n\npublic:\n\n\n\n\tMicroRanged();\n\n\tvoid executeMicro(const BWAPI::Unitset & targets);\n\n\n\n\tBWAPI::Unit chooseTarget(BWAPI::Unit rangedUnit, const BWAPI::Unitset & targets, std::map<BWAPI::Unit, int> & numTargeting);\n\n\n\n\tint getAttackPriority(BWAPI::Unit rangedUnit, BWAPI::Unit target);\n\n\tBWAPI::Unit getTarget(BWAPI::Unit rangedUnit, const BWAPI::Unitset & targets);\n\n\n\n void assignTargets(const BWAPI::Unitset & targets);\n\n\n\n\tbool stayHomeUntilReady(const BWAPI::Unit u) const;\n\n};\n\n}","file_path":"Source/MicroRanged.h","rank":13,"score":52210.68997473142},{"content":"#pragma once;\n\n\n\n#include <Common.h>\n\n#include \"MicroManager.h\"\n\n\n\nnamespace XBot\n\n{\n","file_path":"Source/MicroRanged.h","rank":14,"score":48459.494676786504},{"content":"\t\t, lastShields(0)\n\n\t\t, player(nullptr)\n\n , unit(nullptr)\n\n , lastPosition(BWAPI::Positions::None)\n\n\t\t, lastTilePosition(BWAPI::TilePositions::None)\n\n , type(BWAPI::UnitTypes::None)\n\n , completed(false)\n\n\t{\n\n }\n\n\n\n\tUnitInfo(BWAPI::Unit unit)\n\n\t\t: unitID(unit->getID())\n\n\t\t, updateFrame(BWAPI::Broodwar->getFrameCount())\n\n\t\t, lastHealth(unit->getHitPoints())\n\n\t\t, lastShields(unit->getShields())\n\n\t\t, player(unit->getPlayer())\n\n\t\t, unit(unit)\n\n\t\t, lastPosition(unit->getPosition())\n\n\t\t, lastTilePosition(unit->getTilePosition())\n\n\t\t, type(unit->getType())\n","file_path":"Source/UnitData.h","rank":15,"score":48431.30028950554},{"content":"\t\t, completed(unit->isCompleted())\n\n\t{\n\n\t}\n\n\n\n const bool operator == (BWAPI::Unit unit) const\n\n {\n\n return unitID == unit->getID();\n\n }\n\n\n\n const bool operator == (const UnitInfo & rhs) const\n\n {\n\n return (unitID == rhs.unitID);\n\n }\n\n\n\n const bool operator < (const UnitInfo & rhs) const\n\n {\n\n return (unitID < rhs.unitID);\n\n }\n\n};\n\n\n\ntypedef std::vector<UnitInfo> UnitInfoVector;\n\ntypedef std::map<BWAPI::Unit,UnitInfo> UIMap;\n\n\n","file_path":"Source/UnitData.h","rank":16,"score":48425.147653345215},{"content":"#pragma once\n\n\n\n#include \"Common.h\"\n\n#include \"BWTA.h\"\n\n\n\nnamespace XBot\n\n{\n","file_path":"Source/UnitData.h","rank":17,"score":48424.61279654068},{"content":"\tint bestScore = -999999;\n\n\tBWAPI::Unit bestTarget = nullptr;\n\n\n\n\tfor (const auto target : targets)\n\n\t{\n\n\t\tint priority = getAttackPriority(rangedUnit, target); // 0..12\n\n\t\tint range = rangedUnit->getDistance(target); // 0..map size in pixels\n\n\t\tint toGoal = target->getDistance(order.getPosition()); // 0..map size in pixels\n\n\n\n\t\t// Let's say that 1 priority step is worth 160 pixels (5 tiles).\n\n\t\t// We care about unit-target range and target-order position distance.\n\n\t\tint score = 5 * 32 * priority - range - toGoal/2;\n\n\n\n\t\t// Adjust for special features.\n\n\t\t// This could adjust for relative speed and direction, so that we don't chase what we can't catch.\n\n\t\tif (rangedUnit->isInWeaponRange(target))\n\n\t\t{\n\n\t\t\tscore += 4 * 32;\n\n\t\t}\n\n\t\telse if (!target->isMoving())\n","file_path":"Source/MicroRanged.cpp","rank":18,"score":46395.20319950419},{"content":"\t\t{\n\n\t\t\tif (target->getType().size() == BWAPI::UnitSizeTypes::Small)\n\n\t\t\t{\n\n\t\t\t\tscore += 32;\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t\tif (score > bestScore)\n\n\t\t{\n\n\t\t\tbestScore = score;\n\n\t\t\tbestTarget = target;\n\n\t\t}\n\n\t}\n\n\t\n\n\treturn bestTarget;\n\n}\n\n\n\n// get the attack priority of a target unit\n\nint MicroRanged::getAttackPriority(BWAPI::Unit rangedUnit, BWAPI::Unit target) \n\n{\n","file_path":"Source/MicroRanged.cpp","rank":19,"score":46390.750631375406},{"content":"#include \"MicroRanged.h\"\n\n#include \"UnitUtil.h\"\n\n\n\nusing namespace XBot;\n\n\n\nMicroRanged::MicroRanged()\n\n{ \n\n}\n\n\n\nvoid MicroRanged::executeMicro(const BWAPI::Unitset & targets) \n\n{\n\n\tassignTargets(targets);\n\n}\n\n\n\nvoid MicroRanged::assignTargets(const BWAPI::Unitset & targets)\n\n{\n\n const BWAPI::Unitset & rangedUnits = getUnits();\n\n\n\n\t// The set of potential targets.\n\n\tBWAPI::Unitset rangedUnitTargets;\n","file_path":"Source/MicroRanged.cpp","rank":20,"score":46390.29980219689},{"content":"\t\t{\n\n\t\t\t// This includes proxy buildings, which deserve high priority.\n\n\t\t\t// But when bases are close together, it can include innocent buildings.\n\n\t\t\t// We also don't want to disrupt priorities in case of proxy buildings\n\n\t\t\t// supported by units; we may want to target the units first.\n\n\t\t\tif (UnitUtil::CanAttackGround(target) || UnitUtil::CanAttackAir(target))\n\n\t\t\t{\n\n\t\t\t\treturn 10;\n\n\t\t\t}\n\n\t\t\treturn 8;\n\n\t\t}\n\n\t}\n\n \n\n\tif (rangedType.isFlyer()) {\n\n\t\t// Exceptions if we're a flyer (other than scourge, which is handled above).\n\n\t\tif (targetType == BWAPI::UnitTypes::Zerg_Scourge)\n\n\t\t{\n\n\t\t\treturn 12;\n\n\t\t}\n\n\t}\n","file_path":"Source/MicroRanged.cpp","rank":21,"score":46389.19678785186},{"content":"\t// Short circuit: Give bunkers a lower priority to reduce bunker obsession.\n\n\tif (targetType == BWAPI::UnitTypes::Terran_Bunker)\n\n\t{\n\n\t\treturn 9;\n\n\t}\n\n\n\n\t// Threats can attack us. Exception: Workers are not threats.\n\n\tif (UnitUtil::CanAttack(targetType, rangedType) && !targetType.isWorker())\n\n\t{\n\n\t\t// Enemy unit which is far enough outside its range is lower priority than a worker.\n\n\t\tif (rangedUnit->getDistance(target) > 48 + UnitUtil::GetAttackRange(target, rangedUnit))\n\n\t\t{\n\n\t\t\treturn 8;\n\n\t\t}\n\n\t\treturn 10;\n\n\t}\n\n\t// Droppers are as bad as threats. They may be loaded and are often isolated and safer to attack.\n\n\tif (targetType == BWAPI::UnitTypes::Terran_Dropship ||\n\n\t\ttargetType == BWAPI::UnitTypes::Protoss_Shuttle)\n\n\t{\n","file_path":"Source/MicroRanged.cpp","rank":22,"score":46388.573937875175},{"content":"\tif (targetType.gasPrice() > 0)\n\n\t{\n\n\t\treturn 4;\n\n\t}\n\n\tif (targetType.mineralPrice() > 0)\n\n\t{\n\n\t\treturn 3;\n\n\t}\n\n\t// Finally everything else.\n\n\treturn 1;\n\n}\n\n\n\n// Should the unit stay (or return) home until ready to move out?\n\nbool MicroRanged::stayHomeUntilReady(const BWAPI::Unit u) const\n\n{\n\n\treturn\n\n\t\tu->getType() == BWAPI::UnitTypes::Protoss_Carrier && u->getInterceptorCount() < 4;\n\n}\n","file_path":"Source/MicroRanged.cpp","rank":23,"score":46388.418413187894},{"content":"\t\t\tBWAPI::Unit target = getTarget(rangedUnit, rangedUnitTargets);\n\n\t\t\tif (target)\n\n\t\t\t{\n\n\t\t\t\tif (Config::Debug::DrawUnitTargetInfo)\n\n\t\t\t\t{\n\n\t\t\t\t\tBWAPI::Broodwar->drawLineMap(rangedUnit->getPosition(), rangedUnit->getTargetPosition(), BWAPI::Colors::Purple);\n\n\t\t\t\t}\n\n\n\n\t\t\t\t// attack it\n\n\t\t\t\tif (Config::Micro::KiteWithRangedUnits)\n\n\t\t\t\t{\n\n\t\t\t\t\tif (rangedUnit->getType() == BWAPI::UnitTypes::Zerg_Mutalisk || rangedUnit->getType() == BWAPI::UnitTypes::Terran_Vulture)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tMicro::MutaDanceTarget(rangedUnit, target);\n\n\t\t\t\t\t}\n\n\t\t\t\t\telse\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tMicro::SmartKiteTarget(rangedUnit, target);\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n","file_path":"Source/MicroRanged.cpp","rank":24,"score":46387.009323541235},{"content":"\t\t\t\telse\n\n\t\t\t\t{\n\n\t\t\t\t\tMicro::SmartAttackUnit(rangedUnit, target);\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\telse\n\n\t\t\t{\n\n\t\t\t\t// No target found. If we're not near the order position, go there.\n\n\t\t\t\tif (rangedUnit->getDistance(order.getPosition()) > 100)\n\n\t\t\t\t{\n\n\t\t\t\t\tMicro::SmartAttackMove(rangedUnit, order.getPosition());\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\n// This could return null if no target is worth attacking, but doesn't happen to.\n\nBWAPI::Unit MicroRanged::getTarget(BWAPI::Unit rangedUnit, const BWAPI::Unitset & targets)\n\n{\n","file_path":"Source/MicroRanged.cpp","rank":25,"score":46386.98562360152},{"content":" std::copy_if(targets.begin(), targets.end(), std::inserter(rangedUnitTargets, rangedUnitTargets.end()),\n\n\t\t[](BWAPI::Unit u) {\n\n\t\treturn\n\n\t\t\tu->isVisible() &&\n\n\t\t\tu->isDetected() &&\n\n\t\t\tu->getType() != BWAPI::UnitTypes::Zerg_Larva &&\n\n\t\t\tu->getType() != BWAPI::UnitTypes::Zerg_Egg &&\n\n\t\t\t!u->isStasised();\n\n\t});\n\n\n\n for (const auto rangedUnit : rangedUnits)\n\n\t{\n\n\t\tif (buildScarabOrInterceptor(rangedUnit))\n\n\t\t{\n\n\t\t\t// If we started one, no further action this frame.\n\n\t\t\tcontinue;\n\n\t\t}\n\n\n\n\t\t// Special case for irradiated zerg air units.\n\n\t\tif (rangedUnit->isIrradiated() && rangedUnit->getType().getRace() == BWAPI::Races::Zerg)\n","file_path":"Source/MicroRanged.cpp","rank":26,"score":46386.389261027245},{"content":"\t\t\n\n\t\t// Prefer targets that are already hurt.\n\n\t\tif (target->getType().getRace() == BWAPI::Races::Protoss && target->getShields() == 0)\n\n\t\t{\n\n\t\t\tscore += 32;\n\n\t\t}\n\n\t\tif (target->getHitPoints() < target->getType().maxHitPoints())\n\n\t\t{\n\n\t\t\tscore += 24;\n\n\t\t}\n\n\n\n\t\tBWAPI::DamageType damage = UnitUtil::GetWeapon(rangedUnit, target).damageType();\n\n\t\tif (damage == BWAPI::DamageTypes::Explosive)\n\n\t\t{\n\n\t\t\tif (target->getType().size() == BWAPI::UnitSizeTypes::Large)\n\n\t\t\t{\n\n\t\t\t\tscore += 32;\n\n\t\t\t}\n\n\t\t}\n\n\t\telse if (damage == BWAPI::DamageTypes::Concussive)\n","file_path":"Source/MicroRanged.cpp","rank":27,"score":46383.67900097899},{"content":"\t\treturn 6;\n\n\t}\n\n\tif (targetType == BWAPI::UnitTypes::Protoss_Pylon)\n\n\t{\n\n\t\treturn 5;\n\n\t}\n\n\tif (targetType == BWAPI::UnitTypes::Terran_Factory || targetType == BWAPI::UnitTypes::Terran_Armory)\n\n\t{\n\n\t\treturn 5;\n\n\t}\n\n\t// Downgrade unfinished/unpowered buildings, with exceptions.\n\n\tif (targetType.isBuilding() &&\n\n\t\t(!target->isCompleted() || !target->isPowered()) &&\n\n\t\t!(\ttargetType.isResourceDepot() ||\n\n\t\t\ttargetType.groundWeapon() != BWAPI::WeaponTypes::None ||\n\n\t\t\ttargetType.airWeapon() != BWAPI::WeaponTypes::None ||\n\n\t\t\ttargetType == BWAPI::UnitTypes::Terran_Bunker))\n\n\t{\n\n\t\treturn 2;\n\n\t}\n","file_path":"Source/MicroRanged.cpp","rank":28,"score":46383.55801973491},{"content":"\tconst BWAPI::UnitType rangedType = rangedUnit->getType();\n\n\tconst BWAPI::UnitType targetType = target->getType();\n\n\n\n\tif (rangedType == BWAPI::UnitTypes::Zerg_Scourge)\n\n {\n\n\t\tif (!targetType.isFlyer())\n\n\t\t{\n\n\t\t\t// Can't target it. Also, ignore lifted buildings.\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\tif (targetType == BWAPI::UnitTypes::Zerg_Overlord ||\n\n\t\t\ttargetType == BWAPI::UnitTypes::Zerg_Scourge ||\n\n\t\t\ttargetType == BWAPI::UnitTypes::Protoss_Interceptor)\n\n\t\t{\n\n\t\t\t// Usually not worth scourge at all.\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\t\n\n\t\t// Everything else is the same. Hit whatever's closest.\n\n\t\treturn 10;\n","file_path":"Source/MicroRanged.cpp","rank":29,"score":46383.41145424937},{"content":"\t// Spellcasters are as important as key buildings.\n\n\t// Also remember to target other non-threat combat units.\n\n\tif (targetType.isSpellcaster() ||\n\n\t\ttargetType.groundWeapon() != BWAPI::WeaponTypes::None ||\n\n\t\ttargetType.airWeapon() != BWAPI::WeaponTypes::None)\n\n\t{\n\n\t\treturn 7;\n\n\t}\n\n\t// Templar tech and spawning pool are more important.\n\n\tif (targetType == BWAPI::UnitTypes::Protoss_Templar_Archives)\n\n\t{\n\n\t\treturn 7;\n\n\t}\n\n\tif (targetType == BWAPI::UnitTypes::Zerg_Spawning_Pool)\n\n\t{\n\n\t\treturn 7;\n\n\t}\n\n\t// Don't forget the nexus/cc/hatchery.\n\n\tif (targetType.isResourceDepot())\n\n\t{\n","file_path":"Source/MicroRanged.cpp","rank":30,"score":46382.72086577251},{"content":"\t\t// Carriers stay at home until they have enough interceptors to be useful,\n\n\t\t// or retreat toward home to rebuild them if they run low.\n\n\t\t// On attack-move so that they're not helpless, but that can cause problems too....\n\n\t\t// Potentially useful for other units.\n\n\t\t// NOTE Regrouping can cause the carriers to move away from home.\n\n\t\tif (stayHomeUntilReady(rangedUnit))\n\n\t\t{\n\n\t\t\tBWAPI::Position fleeTo(InformationManager::Instance().getMyMainBaseLocation()->getPosition());\n\n\t\t\tMicro::SmartAttackMove(rangedUnit, fleeTo);\n\n\t\t\tcontinue;\n\n\t\t}\n\n\n\n\t\tif (order.isCombatOrder())\n\n {\n\n\t\t\tif (unstickStuckUnit(rangedUnit))\n\n\t\t\t{\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\n\n\t\t\t// If a target can be found.\n","file_path":"Source/MicroRanged.cpp","rank":31,"score":46382.44138976413},{"content":"\t}\n\n\n\n\tif (rangedType == BWAPI::UnitTypes::Zerg_Devourer)\n\n\t{\n\n\t\tif (!target->isFlying())\n\n\t\t{\n\n\t\t\t// Can't target it.\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\tif (targetType.isBuilding())\n\n\t\t{\n\n\t\t\t// A lifted building is less important.\n\n\t\t\treturn 1;\n\n\t\t}\n\n\n\n\t\t// Everything else is the same.\n\n\t\treturn 10;\n\n\t}\n\n\t\n\n\tif (rangedType == BWAPI::UnitTypes::Zerg_Guardian && target->isFlying())\n","file_path":"Source/MicroRanged.cpp","rank":32,"score":46382.38770157002},{"content":"\t\treturn 10;\n\n\t}\n\n\t// Also as bad are other dangerous things.\n\n\tif (targetType == BWAPI::UnitTypes::Terran_Science_Vessel ||\n\n\t\ttargetType == BWAPI::UnitTypes::Zerg_Scourge)\n\n\t{\n\n\t\treturn 10;\n\n\t}\n\n\t// Next are workers.\n\n\tif (targetType.isWorker()) \n\n\t{\n\n if (rangedUnit->getType() == BWAPI::UnitTypes::Terran_Vulture)\n\n {\n\n return 11;\n\n }\n\n\t\t// Repairing or blocking a choke makes you critical.\n\n\t\tif (target->isRepairing() || unitNearChokepoint(target))\n\n\t\t{\n\n\t\t\treturn 11;\n\n\t\t}\n","file_path":"Source/MicroRanged.cpp","rank":33,"score":46381.501905517856},{"content":"\t\t{\n\n\t\t\tif (target->isSieged() ||\n\n\t\t\t\ttarget->getOrder() == BWAPI::Orders::Sieging ||\n\n\t\t\t\ttarget->getOrder() == BWAPI::Orders::Unsieging)\n\n\t\t\t{\n\n\t\t\t\tscore += 48;\n\n\t\t\t}\n\n\t\t\telse\n\n\t\t\t{\n\n\t\t\t\tscore += 24;\n\n\t\t\t}\n\n\t\t}\n\n\t\telse if (target->isBraking())\n\n\t\t{\n\n\t\t\tscore += 16;\n\n\t\t}\n\n\t\telse if (target->getType().topSpeed() >= rangedUnit->getType().topSpeed())\n\n\t\t{\n\n\t\t\tscore -= 5 * 32;\n\n\t\t}\n","file_path":"Source/MicroRanged.cpp","rank":34,"score":46379.134029896195},{"content":"\telse\n\n\t{\n\n\t\t// Exceptions if we're a ground unit.\n\n\t\tif (targetType == BWAPI::UnitTypes::Terran_Vulture_Spider_Mine && !target->isBurrowed() ||\n\n\t\t\ttargetType == BWAPI::UnitTypes::Zerg_Infested_Terran)\n\n\t\t{\n\n\t\t\treturn 12;\n\n\t\t}\n\n\t}\n\n\n\n\tif (targetType == BWAPI::UnitTypes::Protoss_High_Templar)\n\n\t{\n\n\t\treturn 12;\n\n\t}\n\n\n\n\tif (targetType == BWAPI::UnitTypes::Protoss_Reaver)\n\n\t{\n\n\t\treturn 11;\n\n\t}\n\n\n","file_path":"Source/MicroRanged.cpp","rank":35,"score":46377.92883209711},{"content":"\t\t// SCVs constructing are also important.\n\n\t\tif (target->isConstructing())\n\n\t\t{\n\n\t\t\treturn 10;\n\n\t\t}\n\n\n\n \t\treturn 9;\n\n\t}\n\n\t// Important combat units that we may not have targeted above (esp. if we're a flyer).\n\n\tif (targetType == BWAPI::UnitTypes::Protoss_Carrier ||\n\n\t\ttargetType == BWAPI::UnitTypes::Terran_Siege_Tank_Tank_Mode ||\n\n\t\ttargetType == BWAPI::UnitTypes::Terran_Siege_Tank_Siege_Mode)\n\n\t{\n\n\t\treturn 8;\n\n\t}\n\n\t// Nydus canal is the most important building to kill.\n\n\tif (targetType == BWAPI::UnitTypes::Zerg_Nydus_Canal)\n\n\t{\n\n\t\treturn 9;\n\n\t}\n","file_path":"Source/MicroRanged.cpp","rank":36,"score":46377.46319076497},{"content":"\t\t{\n\n\t\t\tif (rangedUnit->isFlying())\n\n\t\t\t{\n\n\t\t\t\tif (rangedUnit->getDistance(order.getPosition()) < 300)\n\n\t\t\t\t{\n\n\t\t\t\t\tMicro::SmartAttackMove(rangedUnit, order.getPosition());\n\n\t\t\t\t}\n\n\t\t\t\telse\n\n\t\t\t\t{\n\n\t\t\t\t\tMicro::SmartMove(rangedUnit, order.getPosition());\n\n\t\t\t\t}\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\t\t\telse if (rangedUnit->canBurrow())\n\n\t\t\t{\n\n\t\t\t\trangedUnit->burrow();\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\t\t}\n\n\n","file_path":"Source/MicroRanged.cpp","rank":37,"score":46376.11351309152},{"content":"\t{\n\n\t\t// Can't target it.\n\n\t\treturn 0;\n\n\t}\n\n\n\n\t// An addon other than a completed comsat is boring.\n\n\t// TODO should also check that it is attached\n\n\tif (targetType.isAddon() && !(targetType == BWAPI::UnitTypes::Terran_Comsat_Station && target->isCompleted()))\n\n\t{\n\n\t\treturn 1;\n\n\t}\n\n\n\n // if the target is building something near our base something is fishy\n\n BWAPI::Position ourBasePosition = BWAPI::Position(InformationManager::Instance().getMyMainBaseLocation()->getPosition());\n\n\tif (target->getDistance(ourBasePosition) < 1200) {\n\n\t\tif (target->getType().isWorker() && (target->isConstructing() || target->isRepairing()))\n\n\t\t{\n\n\t\t\treturn 12;\n\n\t\t}\n\n\t\tif (target->getType().isBuilding())\n","file_path":"Source/MicroRanged.cpp","rank":38,"score":46374.821599824456},{"content":"#include \"Common.h\"\n\n#include \"UnitData.h\"\n\n\n\nusing namespace XBot;\n\n\n\nUnitData::UnitData() \n\n\t: mineralsLost(0)\n\n\t, gasLost(0)\n\n{\n\n\tint maxTypeID(0);\n\n\tfor (const BWAPI::UnitType & t : BWAPI::UnitTypes::allUnitTypes())\n\n\t{\n\n\t\tmaxTypeID = maxTypeID > t.getID() ? maxTypeID : t.getID();\n\n\t}\n\n\n\n\tnumUnits\t\t= std::vector<int>(maxTypeID + 1, 0);\n\n\tnumDeadUnits\t= std::vector<int>(maxTypeID + 1, 0);\n\n}\n\n\n\nvoid UnitData::updateUnit(BWAPI::Unit unit)\n","file_path":"Source/UnitData.cpp","rank":49,"score":46354.27581661133},{"content":"{\n\n\tif (!unit) { return; }\n\n\n\n bool firstSeen = false;\n\n auto & it = unitMap.find(unit);\n\n if (it == unitMap.end())\n\n {\n\n firstSeen = true;\n\n unitMap[unit] = UnitInfo();\n\n }\n\n \n\n\tUnitInfo & ui = unitMap[unit];\n\n ui.unit = unit;\n\n\tui.updateFrame\t= BWAPI::Broodwar->getFrameCount();\n\n ui.player = unit->getPlayer();\n\n\tui.lastPosition = unit->getPosition();\n\n\tui.lastTilePosition = unit->getTilePosition();\n\n\tui.lastHealth = unit->getHitPoints();\n\n ui.lastShields = unit->getShields();\n\n\tui.unitID = unit->getID();\n","file_path":"Source/UnitData.cpp","rank":56,"score":46344.66420100084},{"content":"const bool UnitData::badUnitInfo(const UnitInfo & ui) const\n\n{\n\n if (!ui.unit)\n\n {\n\n return false;\n\n }\n\n\n\n\t// Cull away any refineries/assimilators/extractors that were destroyed and reverted to vespene geysers\n\n\tif (ui.unit->getType() == BWAPI::UnitTypes::Resource_Vespene_Geyser)\n\n\t{ \n\n\t\treturn true;\n\n\t}\n\n\n\n\t// If the unit is a building and we can currently see its position and it is not there.\n\n\t// NOTE A terran building could have lifted off and moved away.\n\n\tif (ui.type.isBuilding() && BWAPI::Broodwar->isVisible(ui.lastPosition.x/32, ui.lastPosition.y/32) && !ui.unit->isVisible())\n\n\t{\n\n\t\treturn true;\n\n\t}\n\n\n","file_path":"Source/UnitData.cpp","rank":57,"score":46344.431224355074},{"content":"\t// NOTE This assert fails, so the unit counts cannot be trusted. :-(\n\n\t// UAB_ASSERT(numUnits[unit->getType().getID()] >= 0, \"negative units\");\n\n}\n\n\n\nvoid UnitData::removeBadUnits()\n\n{\n\n\tfor (auto iter(unitMap.begin()); iter != unitMap.end();)\n\n\t{\n\n\t\tif (badUnitInfo(iter->second))\n\n\t\t{\n\n\t\t\tnumUnits[iter->second.type.getID()]--;\n\n\t\t\titer = unitMap.erase(iter);\n\n\t\t}\n\n\t\telse\n\n\t\t{\n\n\t\t\titer++;\n\n\t\t}\n\n\t}\n\n}\n\n\n","file_path":"Source/UnitData.cpp","rank":59,"score":46343.15368789241},{"content":"\treturn false;\n\n}\n\n\n\nint UnitData::getGasLost() const \n\n{ \n\n return gasLost; \n\n}\n\n\n\nint UnitData::getMineralsLost() const \n\n{ \n\n return mineralsLost; \n\n}\n\n\n\nint UnitData::getNumUnits(BWAPI::UnitType t) const \n\n{ \n\n return numUnits[t.getID()]; \n\n}\n\n\n\nint UnitData::getNumDeadUnits(BWAPI::UnitType t) const \n\n{ \n","file_path":"Source/UnitData.cpp","rank":60,"score":46342.91219198512},{"content":"\tui.type = unit->getType();\n\n ui.completed = unit->isCompleted();\n\n\n\n if (firstSeen)\n\n {\n\n numUnits[unit->getType().getID()]++;\n\n }\n\n}\n\n\n\nvoid UnitData::removeUnit(BWAPI::Unit unit)\n\n{\n\n\tif (!unit) { return; }\n\n\n\n\tmineralsLost += unit->getType().mineralPrice();\n\n\tgasLost += unit->getType().gasPrice();\n\n\t--numUnits[unit->getType().getID()];\n\n\t++numDeadUnits[unit->getType().getID()];\n\n\t\n\n\tunitMap.erase(unit);\n\n\n","file_path":"Source/UnitData.cpp","rank":61,"score":46338.30108266939},{"content":" return numDeadUnits[t.getID()]; \n\n}\n\n\n\nconst std::map<BWAPI::Unit,UnitInfo> & UnitData::getUnits() const \n\n{ \n\n return unitMap; \n\n}\n\n\n\nconst UnitInfo * UnitData::getUnit(BWAPI::Unit unit) const\n\n{\n\n\tif (unitMap.find(unit) != unitMap.end())\n\n\t{\n\n\t\treturn &unitMap.at(unit);\n\n\t}\n\n\treturn nullptr;\n\n}","file_path":"Source/UnitData.cpp","rank":62,"score":46336.63464265848},{"content":"enum class ExtractorTrick { None, Start, ExtractorOrdered, UnitOrdered, MakeUnitBypass };\n\n\n","file_path":"Source/ProductionManager.h","rank":63,"score":44594.43919522029},{"content":"class Double {\n\npublic:\n\n Double() {}\n\n Double(double d) : d_(d) {}\n\n Double(uint64_t u) : u_(u) {}\n\n\n\n double Value() const { return d_; }\n\n uint64_t Uint64Value() const { return u_; }\n\n\n\n double NextPositiveDouble() const {\n\n RAPIDJSON_ASSERT(!Sign());\n\n return Double(u_ + 1).Value();\n\n }\n\n\n\n bool Sign() const { return (u_ & kSignMask) != 0; }\n\n uint64_t Significand() const { return u_ & kSignificandMask; }\n\n int Exponent() const { return static_cast<int>(((u_ & kExponentMask) >> kSignificandSize) - kExponentBias); }\n\n\n\n bool IsNan() const { return (u_ & kExponentMask) == kExponentMask && Significand() != 0; }\n\n bool IsInf() const { return (u_ & kExponentMask) == kExponentMask && Significand() == 0; }\n","file_path":"Source/rapidjson/internal/ieee754.h","rank":64,"score":44507.477484396084},{"content":"class UnitToAssign\n\n{\n\npublic:\n\n\n\n\tBWAPI::Unit unit;\n\n\tbool isAssigned;\n\n\n\n\tUnitToAssign(BWAPI::Unit u)\n\n\t{\n\n\t\tunit = u;\n\n\t\tisAssigned = false;\n\n\t}\n\n};\n\n\n","file_path":"Source/GameCommander.h","rank":65,"score":44411.32461346539},{"content":" class NumberStream<InputStream, true> : public NumberStream<InputStream, false> {\n\n typedef NumberStream<InputStream, false> Base;\n\n public:\n\n NumberStream(GenericReader& reader, InputStream& is) : NumberStream<InputStream, false>(reader, is), stackStream(reader.stack_) {}\n\n ~NumberStream() {}\n\n\n\n RAPIDJSON_FORCEINLINE Ch TakePush() {\n\n stackStream.Put((char)Base::is.Peek());\n\n return Base::is.Take();\n\n }\n\n\n\n size_t Length() { return stackStream.Length(); }\n\n\n\n const char* Pop() {\n\n stackStream.Put('\\0');\n\n return stackStream.Pop();\n\n }\n\n\n\n private:\n\n StackStream<char> stackStream;\n","file_path":"Source/rapidjson/reader.h","rank":66,"score":43366.10040762825},{"content":"class Area : public utils::Markable<Area, int>, public utils::UserData\n\n{\n\npublic:\n\n\ttypedef int16_t\t\t\t\t\tid;\n\n\n\n\ttypedef int16_t\t\t\t\t\tgroupId;\n\n\n\n\t// Unique id > 0 of this Area. Range = 1 .. Map::Areas().size()\n\n\t// this == Map::GetArea(Id())\n\n\t// Id() == Map::GetMiniTile(w).AreaId() for each walkable MiniTile w in this Area.\n\n\t// Area::ids are guaranteed to remain unchanged.\n\n\tid\t\t\t\t\t\t\t\tId() const\t\t\t\t\t\t{ return m_id; }\n\n\n\n\t// Unique id > 0 of the group of Areas which are accessible from this Area.\n\n\t// For each pair (a, b) of Areas: a->GroupId() == b->GroupId() <==> a->AccessibleFrom(b)\n\n\t// A groupId uniquely identifies a maximum set of mutually accessible Areas, that is, in the absence of blocking ChokePoints, a continent.\n\n\tgroupId\t\t\t\t\t\t\tGroupId() const\t\t\t\t\t{ return m_groupId; }\n\n\n\n\t// Bounding box of this Area.\n\n\tconst BWAPI::TilePosition &\t\tTopLeft() const\t\t\t\t\t{ return m_topLeft ; }\n","file_path":"Source/bwem/area.h","rank":67,"score":42569.428153901914},{"content":"class Tile : public utils::Markable<Tile, int>, public utils::UserData\n\n{\n\npublic:\n\n\t// Corresponds to BWAPI::isBuildable\n\n\t// Note: BWEM enforces the relation buildable ==> walkable (Cf. MiniTile::Walkable)\n\n\tbool\t\t\t\tBuildable() const\t\t\t\t{ return m_bits.buildable; }\n\n\n\n\t// Tile::AreaId() somewhat aggregates the MiniTile::AreaId() values of the 4 x 4 sub-MiniTiles.\n\n\t// Let S be the set of MiniTile::AreaId() values for each walkable MiniTile in this Tile.\n\n\t// If empty(S), returns 0. Note: in this case, no contained MiniTile is walkable, so all of them have their AreaId() == 0.\n\n\t// If S = {a}, returns a (whether positive or negative).\n\n\t// If size(S) > 1 returns -1 (note that -1 is never returned by MiniTile::AreaId()).\n\n\tArea::id\t\t\tAreaId() const\t\t\t\t\t{ return m_areaId; }\n\n\n\n\t// Tile::MinAltitude() somewhat aggregates the MiniTile::Altitude() values of the 4 x 4 sub-MiniTiles.\n\n\t// Returns the minimum value.\n\n\taltitude_t\t\t\tMinAltitude() const\t\t\t\t{ return m_minAltitude; }\n\n\n\n\t// Tells if at least one of the sub-MiniTiles is Walkable.\n\n\tbool\t\t\t\tWalkable() const\t\t\t\t{ return m_areaId != 0; }\n","file_path":"Source/bwem/tiles.h","rank":68,"score":42569.428153901914},{"content":"class AutoUTFOutputStream {\n\n RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);\n\npublic:\n\n typedef CharType Ch;\n\n\n\n //! Constructor.\n\n /*!\n\n \\param os output stream to be wrapped.\n\n \\param type UTF encoding type.\n\n \\param putBOM Whether to write BOM at the beginning of the stream.\n\n */\n\n AutoUTFOutputStream(OutputByteStream& os, UTFType type, bool putBOM) : os_(&os), type_(type) {\n\n RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE);\n\n\n\n // Runtime check whether the size of character type is sufficient. It only perform checks with assertion.\n\n if (type_ == kUTF16LE || type_ == kUTF16BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 2);\n\n if (type_ == kUTF32LE || type_ == kUTF32BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 4);\n\n\n\n static const PutFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Put) };\n\n putFunc_ = f[type_];\n","file_path":"Source/rapidjson/encodedstream.h","rank":69,"score":41109.2264147653},{"content":"class AutoUTFInputStream {\n\n RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);\n\npublic:\n\n typedef CharType Ch;\n\n\n\n //! Constructor.\n\n /*!\n\n \\param is input stream to be wrapped.\n\n \\param type UTF encoding type if it is not detected from the stream.\n\n */\n\n AutoUTFInputStream(InputByteStream& is, UTFType type = kUTF8) : is_(&is), type_(type), hasBOM_(false) {\n\n RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE); \n\n DetectType();\n\n static const TakeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Take) };\n\n takeFunc_ = f[type_];\n\n current_ = takeFunc_(*is_);\n\n }\n\n\n\n UTFType GetType() const { return type_; }\n\n bool HasBOM() const { return hasBOM_; }\n","file_path":"Source/rapidjson/encodedstream.h","rank":70,"score":41109.2264147653},{"content":"enum class MacroCommandType\n\n\t{ None\n\n\t, Scout\n\n\t, ScoutIfNeeded\n\n\t, ScoutLocation\n\n\t, StartGas\n\n\t, StopGas\n\n\t, GasUntil\n\n\t, StealGas\n\n\t, ExtractorTrickDrone\n\n\t, ExtractorTrickZergling\n\n\t, Aggressive\n\n\t, Defensive\n\n\t, PullWorkers\n\n\t, PullWorkersLeaving\n\n\t, ReleaseWorkers\n\n\t, UntilFindEnemy\n\n\t, DroneEnemyNatural\n\n\t, IgnoreScoutWorker\n\n\t};\n\n\n","file_path":"Source/MacroCommand.h","rank":71,"score":41106.65276351931},{"content":"class ChokePoint : public utils::Markable<ChokePoint, int>, public utils::UserData\n\n{\n\npublic:\n\n\t// ChokePoint::middle denotes the \"middle\" MiniTile of Geometry(), while\n\n\t// ChokePoint::end1 and ChokePoint::end2 denote its \"ends\".\n\n\t// It is guaranteed that, among all the MiniTiles of Geometry(), ChokePoint::middle has the highest altitude value (Cf. MiniTile::Altitude()).\n\n\tenum node {end1, middle, end2, node_count};\n\n\n\n\t// Type of all the Paths used in BWEM (Cf. Map::GetPath).\n\n\t// See also the typedef CPPath.\n\n\ttypedef std::vector<const ChokePoint *> Path;\n\n\n\n\t// Tells whether this ChokePoint is a pseudo ChokePoint, i.e., it was created on top of a blocking Neutral.\n\n\tbool\t\t\t\t\t\t\t\t\tIsPseudo() const\t\t{ return m_pseudo; }\n\n\n\n\t// Returns the two Areas of this ChokePoint.\n\n\tconst std::pair<const Area *, const Area *> & GetAreas() const\t{ return m_Areas; }\n\n\n\n\t// Returns the center of this ChokePoint.\n\n\tconst BWAPI::WalkPosition &\t\t\t\tCenter() const\t\t\t{ return Pos(middle); }\n","file_path":"Source/bwem/cp.h","rank":72,"score":40613.45464539064},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n","file_path":"Source/rapidjson/rapidjson.h","rank":73,"score":39602.820891650474},{"content":"struct IsGenericValueImpl : FalseType {};\n\n\n\n// select candidates according to nested encoding and allocator types\n\ntemplate <typename T> struct IsGenericValueImpl<T, typename Void<typename T::EncodingType>::Type, typename Void<typename T::AllocatorType>::Type>\n\n : IsBaseOf<GenericValue<typename T::EncodingType, typename T::AllocatorType>, T>::Type {};\n\n\n\n// helper to match arbitrary GenericValue instantiations, including derived classes\n\ntemplate <typename T> struct IsGenericValue : IsGenericValueImpl<T>::Type {};\n\n\n\n} // namespace internal\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// GenericValue\n\n\n\n//! Represents a JSON value. Use Value for UTF8 encoding and default allocator.\n\n/*!\n\n A JSON value can be one of 7 types. This class is a variant type supporting\n\n these types.\n\n\n\n Use the Value if UTF8 and default allocator\n\n\n\n \\tparam Encoding Encoding of the value. (Even non-string values need to have the same encoding in a document)\n\n \\tparam Allocator Allocator type for allocating memory of object, array and string.\n\n*/\n\ntemplate <typename Encoding, typename Allocator = MemoryPoolAllocator<> > \n","file_path":"Source/rapidjson/document.h","rank":74,"score":39595.06440173808},{"content":"int GetIntFromString(const std::string & s);\n","file_path":"Source/Common.h","rank":75,"score":38212.563502770114},{"content":"#define _USE_MATH_DEFINES\n","file_path":"Source/Common.h","rank":76,"score":38193.09348343703},{"content":" double ToDouble() const {\n\n union {\n\n double d;\n\n uint64_t u64;\n\n }u;\n\n const uint64_t be = (e == kDpDenormalExponent && (f & kDpHiddenBit) == 0) ? 0 : \n\n static_cast<uint64_t>(e + kDpExponentBias);\n\n u.u64 = (f & kDpSignificandMask) | (be << kDpSignificandSize);\n\n return u.d;\n","file_path":"Source/rapidjson/internal/diyfp.h","rank":77,"score":38193.09348343703},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// Encoding\n\n\n\n/*! \\class rapidjson::Encoding\n\n \\brief Concept for encoding of Unicode characters.\n\n\n\n\\code\n\nconcept Encoding {\n\n typename Ch; //! Type of character. A \"character\" is actually a code unit in unicode's definition.\n\n\n\n enum { supportUnicode = 1 }; // or 0 if not supporting unicode\n\n\n\n //! \\brief Encode a Unicode codepoint to an output stream.\n\n //! \\param os Output stream.\n\n //! \\param codepoint An unicode codepoint, ranging from 0x0 to 0x10FFFF inclusively.\n\n template<typename OutputStream>\n\n static void Encode(OutputStream& os, unsigned codepoint);\n\n\n\n //! \\brief Decode a Unicode codepoint from an input stream.\n\n //! \\param is Input stream.\n\n //! \\param codepoint Output of the unicode codepoint.\n\n //! \\return true if a valid codepoint can be decoded from the stream.\n\n template <typename InputStream>\n\n static bool Decode(InputStream& is, unsigned* codepoint);\n\n\n\n //! \\brief Validate one Unicode codepoint from an encoded stream.\n\n //! \\param is Input stream to obtain codepoint.\n\n //! \\param os Output for copying one codepoint.\n\n //! \\return true if it is valid.\n\n //! \\note This function just validating and copying the codepoint without actually decode it.\n\n template <typename InputStream, typename OutputStream>\n\n static bool Validate(InputStream& is, OutputStream& os);\n\n\n\n // The following functions are deal with byte streams.\n\n\n\n //! Take a character from input byte stream, skip BOM if exist.\n\n template <typename InputByteStream>\n\n static CharType TakeBOM(InputByteStream& is);\n\n\n\n //! Take a character from input byte stream.\n\n template <typename InputByteStream>\n\n static Ch Take(InputByteStream& is);\n\n\n\n //! Put BOM to output byte stream.\n\n template <typename OutputByteStream>\n\n static void PutBOM(OutputByteStream& os);\n\n\n\n //! Put a character to output byte stream.\n\n template <typename OutputByteStream>\n\n static void Put(OutputByteStream& os, Ch c);\n\n};\n\n\\endcode\n\n*/\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// UTF8\n\n\n\n//! UTF-8 encoding.\n\n/*! http://en.wikipedia.org/wiki/UTF-8\n\n http://tools.ietf.org/html/rfc3629\n\n \\tparam CharType Code unit for storing 8-bit UTF-8 data. Default is char.\n\n \\note implements Encoding concept\n\n*/\n\ntemplate<typename CharType = char>\n\nstruct UTF8 {\n\n typedef CharType Ch;\n\n\n\n enum { supportUnicode = 1 };\n\n\n\n template<typename OutputStream>\n\n static void Encode(OutputStream& os, unsigned codepoint) {\n\n if (codepoint <= 0x7F) \n\n os.Put(static_cast<Ch>(codepoint & 0xFF));\n\n else if (codepoint <= 0x7FF) {\n\n os.Put(static_cast<Ch>(0xC0 | ((codepoint >> 6) & 0xFF)));\n\n os.Put(static_cast<Ch>(0x80 | ((codepoint & 0x3F))));\n\n }\n\n else if (codepoint <= 0xFFFF) {\n\n os.Put(static_cast<Ch>(0xE0 | ((codepoint >> 12) & 0xFF)));\n\n os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));\n\n os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));\n\n }\n\n else {\n\n RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);\n\n os.Put(static_cast<Ch>(0xF0 | ((codepoint >> 18) & 0xFF)));\n\n os.Put(static_cast<Ch>(0x80 | ((codepoint >> 12) & 0x3F)));\n\n os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));\n\n os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));\n\n }\n","file_path":"Source/rapidjson/encodings.h","rank":78,"score":38190.70239726967},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\n//! Computes integer powers of 10 in double (10.0^n).\n\n/*! This function uses lookup table for fast and accurate results.\n\n \\param n non-negative exponent. Must <= 308.\n\n \\return 10.0^n\n\n*/\n\ninline double Pow10(int n) {\n\n static const double e[] = { // 1e-0...1e308: 309 * 8 bytes = 2472 bytes\n\n 1e+0, \n\n 1e+1, 1e+2, 1e+3, 1e+4, 1e+5, 1e+6, 1e+7, 1e+8, 1e+9, 1e+10, 1e+11, 1e+12, 1e+13, 1e+14, 1e+15, 1e+16, 1e+17, 1e+18, 1e+19, 1e+20, \n\n 1e+21, 1e+22, 1e+23, 1e+24, 1e+25, 1e+26, 1e+27, 1e+28, 1e+29, 1e+30, 1e+31, 1e+32, 1e+33, 1e+34, 1e+35, 1e+36, 1e+37, 1e+38, 1e+39, 1e+40,\n\n 1e+41, 1e+42, 1e+43, 1e+44, 1e+45, 1e+46, 1e+47, 1e+48, 1e+49, 1e+50, 1e+51, 1e+52, 1e+53, 1e+54, 1e+55, 1e+56, 1e+57, 1e+58, 1e+59, 1e+60,\n\n 1e+61, 1e+62, 1e+63, 1e+64, 1e+65, 1e+66, 1e+67, 1e+68, 1e+69, 1e+70, 1e+71, 1e+72, 1e+73, 1e+74, 1e+75, 1e+76, 1e+77, 1e+78, 1e+79, 1e+80,\n\n 1e+81, 1e+82, 1e+83, 1e+84, 1e+85, 1e+86, 1e+87, 1e+88, 1e+89, 1e+90, 1e+91, 1e+92, 1e+93, 1e+94, 1e+95, 1e+96, 1e+97, 1e+98, 1e+99, 1e+100,\n\n 1e+101,1e+102,1e+103,1e+104,1e+105,1e+106,1e+107,1e+108,1e+109,1e+110,1e+111,1e+112,1e+113,1e+114,1e+115,1e+116,1e+117,1e+118,1e+119,1e+120,\n\n 1e+121,1e+122,1e+123,1e+124,1e+125,1e+126,1e+127,1e+128,1e+129,1e+130,1e+131,1e+132,1e+133,1e+134,1e+135,1e+136,1e+137,1e+138,1e+139,1e+140,\n\n 1e+141,1e+142,1e+143,1e+144,1e+145,1e+146,1e+147,1e+148,1e+149,1e+150,1e+151,1e+152,1e+153,1e+154,1e+155,1e+156,1e+157,1e+158,1e+159,1e+160,\n\n 1e+161,1e+162,1e+163,1e+164,1e+165,1e+166,1e+167,1e+168,1e+169,1e+170,1e+171,1e+172,1e+173,1e+174,1e+175,1e+176,1e+177,1e+178,1e+179,1e+180,\n\n 1e+181,1e+182,1e+183,1e+184,1e+185,1e+186,1e+187,1e+188,1e+189,1e+190,1e+191,1e+192,1e+193,1e+194,1e+195,1e+196,1e+197,1e+198,1e+199,1e+200,\n\n 1e+201,1e+202,1e+203,1e+204,1e+205,1e+206,1e+207,1e+208,1e+209,1e+210,1e+211,1e+212,1e+213,1e+214,1e+215,1e+216,1e+217,1e+218,1e+219,1e+220,\n\n 1e+221,1e+222,1e+223,1e+224,1e+225,1e+226,1e+227,1e+228,1e+229,1e+230,1e+231,1e+232,1e+233,1e+234,1e+235,1e+236,1e+237,1e+238,1e+239,1e+240,\n\n 1e+241,1e+242,1e+243,1e+244,1e+245,1e+246,1e+247,1e+248,1e+249,1e+250,1e+251,1e+252,1e+253,1e+254,1e+255,1e+256,1e+257,1e+258,1e+259,1e+260,\n\n 1e+261,1e+262,1e+263,1e+264,1e+265,1e+266,1e+267,1e+268,1e+269,1e+270,1e+271,1e+272,1e+273,1e+274,1e+275,1e+276,1e+277,1e+278,1e+279,1e+280,\n\n 1e+281,1e+282,1e+283,1e+284,1e+285,1e+286,1e+287,1e+288,1e+289,1e+290,1e+291,1e+292,1e+293,1e+294,1e+295,1e+296,1e+297,1e+298,1e+299,1e+300,\n\n 1e+301,1e+302,1e+303,1e+304,1e+305,1e+306,1e+307,1e+308\n\n };\n\n RAPIDJSON_ASSERT(n >= 0 && n <= 308);\n\n return e[n];\n\n}\n\n\n","file_path":"Source/rapidjson/internal/pow10.h","rank":79,"score":38181.47191615001},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\n#ifdef __GNUC__\n\nRAPIDJSON_DIAG_PUSH\n\nRAPIDJSON_DIAG_OFF(effc++)\n\n#endif\n\n\n\ninline void GrisuRound(char* buffer, int len, uint64_t delta, uint64_t rest, uint64_t ten_kappa, uint64_t wp_w) {\n\n while (rest < wp_w && delta - rest >= ten_kappa &&\n\n (rest + ten_kappa < wp_w || /// closer\n\n wp_w - rest > rest + ten_kappa - wp_w)) {\n\n buffer[len - 1]--;\n\n rest += ten_kappa;\n\n }\n\n}\n\n\n\ninline unsigned CountDecimalDigit32(uint32_t n) {\n\n // Simple pure C++ implementation was faster than __builtin_clz version in this situation.\n\n if (n < 10) return 1;\n\n if (n < 100) return 2;\n\n if (n < 1000) return 3;\n\n if (n < 10000) return 4;\n\n if (n < 100000) return 5;\n\n if (n < 1000000) return 6;\n\n if (n < 10000000) return 7;\n\n if (n < 100000000) return 8;\n\n // Will not reach 10 digits in DigitGen()\n\n //if (n < 1000000000) return 9;\n\n //return 10;\n\n return 9;\n\n}\n\n\n\ninline void DigitGen(const DiyFp& W, const DiyFp& Mp, uint64_t delta, char* buffer, int* len, int* K) {\n\n static const uint32_t kPow10[] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 };\n\n const DiyFp one(uint64_t(1) << -Mp.e, Mp.e);\n\n const DiyFp wp_w = Mp - W;\n\n uint32_t p1 = static_cast<uint32_t>(Mp.f >> -one.e);\n\n uint64_t p2 = Mp.f & (one.f - 1);\n\n int kappa = CountDecimalDigit32(p1); // kappa in [0, 9]\n\n *len = 0;\n\n\n\n while (kappa > 0) {\n\n uint32_t d = 0;\n\n switch (kappa) {\n\n case 9: d = p1 / 100000000; p1 %= 100000000; break;\n\n case 8: d = p1 / 10000000; p1 %= 10000000; break;\n\n case 7: d = p1 / 1000000; p1 %= 1000000; break;\n\n case 6: d = p1 / 100000; p1 %= 100000; break;\n\n case 5: d = p1 / 10000; p1 %= 10000; break;\n\n case 4: d = p1 / 1000; p1 %= 1000; break;\n\n case 3: d = p1 / 100; p1 %= 100; break;\n\n case 2: d = p1 / 10; p1 %= 10; break;\n\n case 1: d = p1; p1 = 0; break;\n\n default:;\n\n }\n\n if (d || *len)\n\n buffer[(*len)++] = static_cast<char>('0' + static_cast<char>(d));\n\n kappa--;\n\n uint64_t tmp = (static_cast<uint64_t>(p1) << -one.e) + p2;\n\n if (tmp <= delta) {\n\n *K += kappa;\n\n GrisuRound(buffer, *len, delta, tmp, static_cast<uint64_t>(kPow10[kappa]) << -one.e, wp_w.f);\n\n return;\n\n }\n\n }\n\n\n\n // kappa = 0\n\n for (;;) {\n\n p2 *= 10;\n\n delta *= 10;\n\n char d = static_cast<char>(p2 >> -one.e);\n\n if (d || *len)\n\n buffer[(*len)++] = static_cast<char>('0' + d);\n\n p2 &= one.f - 1;\n\n kappa--;\n\n if (p2 < delta) {\n\n *K += kappa;\n\n GrisuRound(buffer, *len, delta, p2, one.f, wp_w.f * kPow10[-kappa]);\n\n return;\n\n }\n\n }\n\n}\n\n\n\ninline void Grisu2(double value, char* buffer, int* length, int* K) {\n\n const DiyFp v(value);\n\n DiyFp w_m, w_p;\n\n v.NormalizedBoundaries(&w_m, &w_p);\n\n\n\n const DiyFp c_mk = GetCachedPower(w_p.e, K);\n\n const DiyFp W = v.Normalize() * c_mk;\n\n DiyFp Wp = w_p * c_mk;\n\n DiyFp Wm = w_m * c_mk;\n\n Wm.f++;\n\n Wp.f--;\n\n DigitGen(W, Wp, Wp.f - Wm.f, buffer, length, K);\n\n}\n\n\n\ninline char* WriteExponent(int K, char* buffer) {\n\n if (K < 0) {\n\n *buffer++ = '-';\n\n K = -K;\n\n }\n\n\n\n if (K >= 100) {\n\n *buffer++ = static_cast<char>('0' + static_cast<char>(K / 100));\n\n K %= 100;\n\n const char* d = GetDigitsLut() + K * 2;\n\n *buffer++ = d[0];\n\n *buffer++ = d[1];\n\n }\n\n else if (K >= 10) {\n\n const char* d = GetDigitsLut() + K * 2;\n\n *buffer++ = d[0];\n\n *buffer++ = d[1];\n\n }\n\n else\n\n *buffer++ = static_cast<char>('0' + static_cast<char>(K));\n\n\n\n return buffer;\n\n}\n\n\n\ninline char* Prettify(char* buffer, int length, int k) {\n\n const int kk = length + k; // 10^(kk-1) <= v < 10^kk\n\n\n\n if (length <= kk && kk <= 21) {\n\n // 1234e7 -> 12340000000\n\n for (int i = length; i < kk; i++)\n\n buffer[i] = '0';\n\n buffer[kk] = '.';\n\n buffer[kk + 1] = '0';\n\n return &buffer[kk + 2];\n\n }\n\n else if (0 < kk && kk <= 21) {\n\n // 1234e-2 -> 12.34\n\n std::memmove(&buffer[kk + 1], &buffer[kk], length - kk);\n\n buffer[kk] = '.';\n\n return &buffer[length + 1];\n\n }\n\n else if (-6 < kk && kk <= 0) {\n\n // 1234e-6 -> 0.001234\n\n const int offset = 2 - kk;\n\n std::memmove(&buffer[offset], &buffer[0], length);\n\n buffer[0] = '0';\n\n buffer[1] = '.';\n\n for (int i = 2; i < offset; i++)\n\n buffer[i] = '0';\n\n return &buffer[length + offset];\n\n }\n\n else if (length == 1) {\n\n // 1e30\n\n buffer[1] = 'e';\n\n return WriteExponent(kk - 1, &buffer[2]);\n\n }\n\n else {\n\n // 1234e30 -> 1.234e33\n\n std::memmove(&buffer[2], &buffer[1], length - 1);\n\n buffer[1] = '.';\n\n buffer[length + 1] = 'e';\n\n return WriteExponent(kk - 1, &buffer[0 + length + 2]);\n\n }\n\n}\n\n\n\ninline char* dtoa(double value, char* buffer) {\n\n Double d(value);\n\n if (d.IsZero()) {\n\n if (d.Sign())\n\n *buffer++ = '-'; // -0.0, Issue #289\n\n buffer[0] = '0';\n\n buffer[1] = '.';\n\n buffer[2] = '0';\n\n return &buffer[3];\n\n }\n\n else {\n\n if (value < 0) {\n\n *buffer++ = '-';\n\n value = -value;\n\n }\n\n int length, K;\n\n Grisu2(value, buffer, &length, &K);\n\n return Prettify(buffer, length, K);\n\n }\n\n}\n\n\n\n#ifdef __GNUC__\n\nRAPIDJSON_DIAG_POP\n\n#endif\n\n\n","file_path":"Source/rapidjson/internal/dtoa.h","rank":80,"score":38181.47191615001},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\ninline double FastPath(double significand, int exp) {\n\n if (exp < -308)\n\n return 0.0;\n\n else if (exp >= 0)\n\n return significand * internal::Pow10(exp);\n\n else\n\n return significand / internal::Pow10(-exp);\n\n}\n\n\n\ninline double StrtodNormalPrecision(double d, int p) {\n\n if (p < -308) {\n\n // Prevent expSum < -308, making Pow10(p) = 0\n\n d = FastPath(d, -308);\n\n d = FastPath(d, p + 308);\n\n }\n\n else\n\n d = FastPath(d, p);\n\n return d;\n\n}\n\n\n\ntemplate <typename T>\n\ninline T Min3(T a, T b, T c) {\n\n T m = a;\n\n if (m > b) m = b;\n\n if (m > c) m = c;\n\n return m;\n\n}\n\n\n\ninline int CheckWithinHalfULP(double b, const BigInteger& d, int dExp) {\n\n const Double db(b);\n\n const uint64_t bInt = db.IntegerSignificand();\n\n const int bExp = db.IntegerExponent();\n\n const int hExp = bExp - 1;\n\n\n\n int dS_Exp2 = 0, dS_Exp5 = 0, bS_Exp2 = 0, bS_Exp5 = 0, hS_Exp2 = 0, hS_Exp5 = 0;\n\n\n\n // Adjust for decimal exponent\n\n if (dExp >= 0) {\n\n dS_Exp2 += dExp;\n\n dS_Exp5 += dExp;\n\n }\n\n else {\n\n bS_Exp2 -= dExp;\n\n bS_Exp5 -= dExp;\n\n hS_Exp2 -= dExp;\n\n hS_Exp5 -= dExp;\n\n }\n\n\n\n // Adjust for binary exponent\n\n if (bExp >= 0)\n\n bS_Exp2 += bExp;\n\n else {\n\n dS_Exp2 -= bExp;\n\n hS_Exp2 -= bExp;\n\n }\n\n\n\n // Adjust for half ulp exponent\n\n if (hExp >= 0)\n\n hS_Exp2 += hExp;\n\n else {\n\n dS_Exp2 -= hExp;\n\n bS_Exp2 -= hExp;\n\n }\n\n\n\n // Remove common power of two factor from all three scaled values\n\n int common_Exp2 = Min3(dS_Exp2, bS_Exp2, hS_Exp2);\n\n dS_Exp2 -= common_Exp2;\n\n bS_Exp2 -= common_Exp2;\n\n hS_Exp2 -= common_Exp2;\n\n\n\n BigInteger dS = d;\n\n dS.MultiplyPow5(dS_Exp5) <<= dS_Exp2;\n\n\n\n BigInteger bS(bInt);\n\n bS.MultiplyPow5(bS_Exp5) <<= bS_Exp2;\n\n\n\n BigInteger hS(1);\n\n hS.MultiplyPow5(hS_Exp5) <<= hS_Exp2;\n\n\n\n BigInteger delta(0);\n\n dS.Difference(bS, &delta);\n\n\n\n return delta.Compare(hS);\n\n}\n\n\n\ninline bool StrtodFast(double d, int p, double* result) {\n\n // Use fast path for string-to-double conversion if possible\n\n // see http://www.exploringbinary.com/fast-path-decimal-to-floating-point-conversion/\n\n if (p > 22 && p < 22 + 16) {\n\n // Fast Path Cases In Disguise\n\n d *= internal::Pow10(p - 22);\n\n p = 22;\n\n }\n\n\n\n if (p >= -22 && p <= 22 && d <= 9007199254740991.0) { // 2^53 - 1\n\n *result = FastPath(d, p);\n\n return true;\n\n }\n\n else\n\n return false;\n\n}\n\n\n\n// Compute an approximation and see if it is within 1/2 ULP\n\ninline bool StrtodDiyFp(const char* decimals, size_t length, size_t decimalPosition, int exp, double* result) {\n\n uint64_t significand = 0;\n\n size_t i = 0; // 2^64 - 1 = 18446744073709551615, 1844674407370955161 = 0x1999999999999999 \n\n for (; i < length; i++) {\n\n if (significand > RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) ||\n\n (significand == RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) && decimals[i] > '5'))\n\n break;\n\n significand = significand * 10 + (decimals[i] - '0');\n\n }\n\n \n\n if (i < length && decimals[i] >= '5') // Rounding\n\n significand++;\n\n\n\n size_t remaining = length - i;\n\n const unsigned kUlpShift = 3;\n\n const unsigned kUlp = 1 << kUlpShift;\n\n int error = (remaining == 0) ? 0 : kUlp / 2;\n\n\n\n DiyFp v(significand, 0);\n\n v = v.Normalize();\n\n error <<= -v.e;\n\n\n\n const int dExp = (int)decimalPosition - (int)i + exp;\n\n\n\n int actualExp;\n\n DiyFp cachedPower = GetCachedPower10(dExp, &actualExp);\n\n if (actualExp != dExp) {\n\n static const DiyFp kPow10[] = {\n\n DiyFp(RAPIDJSON_UINT64_C2(0xa0000000, 00000000), -60), // 10^1\n\n DiyFp(RAPIDJSON_UINT64_C2(0xc8000000, 00000000), -57), // 10^2\n\n DiyFp(RAPIDJSON_UINT64_C2(0xfa000000, 00000000), -54), // 10^3\n\n DiyFp(RAPIDJSON_UINT64_C2(0x9c400000, 00000000), -50), // 10^4\n\n DiyFp(RAPIDJSON_UINT64_C2(0xc3500000, 00000000), -47), // 10^5\n\n DiyFp(RAPIDJSON_UINT64_C2(0xf4240000, 00000000), -44), // 10^6\n\n DiyFp(RAPIDJSON_UINT64_C2(0x98968000, 00000000), -40) // 10^7\n\n };\n\n int adjustment = dExp - actualExp - 1;\n\n RAPIDJSON_ASSERT(adjustment >= 0 && adjustment < 7);\n\n v = v * kPow10[adjustment];\n\n if (length + adjustment > 19) // has more digits than decimal digits in 64-bit\n\n error += kUlp / 2;\n\n }\n\n\n\n v = v * cachedPower;\n\n\n\n error += kUlp + (error == 0 ? 0 : 1);\n\n\n\n const int oldExp = v.e;\n\n v = v.Normalize();\n\n error <<= oldExp - v.e;\n\n\n\n const unsigned effectiveSignificandSize = Double::EffectiveSignificandSize(64 + v.e);\n\n unsigned precisionSize = 64 - effectiveSignificandSize;\n\n if (precisionSize + kUlpShift >= 64) {\n\n unsigned scaleExp = (precisionSize + kUlpShift) - 63;\n\n v.f >>= scaleExp;\n\n v.e += scaleExp; \n\n error = (error >> scaleExp) + 1 + kUlp;\n\n precisionSize -= scaleExp;\n\n }\n\n\n\n DiyFp rounded(v.f >> precisionSize, v.e + precisionSize);\n\n const uint64_t precisionBits = (v.f & ((uint64_t(1) << precisionSize) - 1)) * kUlp;\n\n const uint64_t halfWay = (uint64_t(1) << (precisionSize - 1)) * kUlp;\n\n if (precisionBits >= halfWay + error) {\n\n rounded.f++;\n\n if (rounded.f & (DiyFp::kDpHiddenBit << 1)) { // rounding overflows mantissa (issue #340)\n\n rounded.f >>= 1;\n\n rounded.e++;\n\n }\n\n }\n\n\n\n *result = rounded.ToDouble();\n\n\n\n return halfWay - error >= precisionBits || precisionBits >= halfWay + error;\n\n}\n\n\n\ninline double StrtodBigInteger(double approx, const char* decimals, size_t length, size_t decimalPosition, int exp) {\n\n const BigInteger dInt(decimals, length);\n\n const int dExp = (int)decimalPosition - (int)length + exp;\n\n Double a(approx);\n\n int cmp = CheckWithinHalfULP(a.Value(), dInt, dExp);\n\n if (cmp < 0)\n\n return a.Value(); // within half ULP\n\n else if (cmp == 0) {\n\n // Round towards even\n\n if (a.Significand() & 1)\n\n return a.NextPositiveDouble();\n\n else\n\n return a.Value();\n\n }\n\n else // adjustment\n\n return a.NextPositiveDouble();\n\n}\n\n\n\ninline double StrtodFullPrecision(double d, int p, const char* decimals, size_t length, size_t decimalPosition, int exp) {\n\n RAPIDJSON_ASSERT(d >= 0.0);\n\n RAPIDJSON_ASSERT(length >= 1);\n\n\n\n double result;\n\n if (StrtodFast(d, p, &result))\n\n return result;\n\n\n\n // Trim leading zeros\n\n while (*decimals == '0' && length > 1) {\n\n length--;\n\n decimals++;\n\n decimalPosition--;\n\n }\n\n\n\n // Trim trailing zeros\n\n while (decimals[length - 1] == '0' && length > 1) {\n\n length--;\n\n decimalPosition--;\n\n exp++;\n\n }\n\n\n\n // Trim right-most digits\n\n const int kMaxDecimalDigit = 780;\n\n if ((int)length > kMaxDecimalDigit) {\n\n int delta = (int(length) - kMaxDecimalDigit);\n\n exp += delta;\n\n decimalPosition -= delta;\n\n length = kMaxDecimalDigit;\n\n }\n\n\n\n // If too small, underflow to zero\n\n if (int(length) + exp < -324)\n\n return 0.0;\n\n\n\n if (StrtodDiyFp(decimals, length, decimalPosition, exp, &result))\n\n return result;\n\n\n\n // Use approximation from StrtodDiyFp and make adjustment with BigInteger comparison\n\n return StrtodBigInteger(result, decimals, length, decimalPosition, exp);\n\n}\n\n\n","file_path":"Source/rapidjson/internal/strtod.h","rank":81,"score":38181.47191615001},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\n//! Custom strlen() which works on different character types.\n\n/*! \\tparam Ch Character type (e.g. char, wchar_t, short)\n\n \\param s Null-terminated input string.\n\n \\return Number of characters in the string. \n\n \\note This has the same semantics as strlen(), the return value is not number of Unicode codepoints.\n\n*/\n\ntemplate <typename Ch>\n\ninline SizeType StrLen(const Ch* s) {\n\n const Ch* p = s;\n\n while (*p) ++p;\n\n return SizeType(p - s);\n\n}\n\n\n","file_path":"Source/rapidjson/internal/strfunc.h","rank":82,"score":38181.47191615001},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\n// Helper to wrap/convert arbitrary types to void, useful for arbitrary type matching\n\ntemplate <typename T> struct Void { typedef void Type; };\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// BoolType, TrueType, FalseType\n\n//\n\ntemplate <bool Cond> struct BoolType {\n\n static const bool Value = Cond;\n\n typedef BoolType Type;\n\n};\n\ntypedef BoolType<true> TrueType;\n\ntypedef BoolType<false> FalseType;\n\n\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// SelectIf, BoolExpr, NotExpr, AndExpr, OrExpr\n\n//\n\n\n\ntemplate <bool C> struct SelectIfImpl { template <typename T1, typename T2> struct Apply { typedef T1 Type; }; };\n\ntemplate <> struct SelectIfImpl<false> { template <typename T1, typename T2> struct Apply { typedef T2 Type; }; };\n\ntemplate <bool C, typename T1, typename T2> struct SelectIfCond : SelectIfImpl<C>::template Apply<T1,T2> {};\n\ntemplate <typename C, typename T1, typename T2> struct SelectIf : SelectIfCond<C::Value, T1, T2> {};\n\n\n\ntemplate <bool Cond1, bool Cond2> struct AndExprCond : FalseType {};\n\ntemplate <> struct AndExprCond<true, true> : TrueType {};\n\ntemplate <bool Cond1, bool Cond2> struct OrExprCond : TrueType {};\n\ntemplate <> struct OrExprCond<false, false> : FalseType {};\n\n\n\ntemplate <typename C> struct BoolExpr : SelectIf<C,TrueType,FalseType>::Type {};\n\ntemplate <typename C> struct NotExpr : SelectIf<C,FalseType,TrueType>::Type {};\n\ntemplate <typename C1, typename C2> struct AndExpr : AndExprCond<C1::Value, C2::Value>::Type {};\n\ntemplate <typename C1, typename C2> struct OrExpr : OrExprCond<C1::Value, C2::Value>::Type {};\n\n\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// AddConst, MaybeAddConst, RemoveConst\n\ntemplate <typename T> struct AddConst { typedef const T Type; };\n\ntemplate <bool Constify, typename T> struct MaybeAddConst : SelectIfCond<Constify, const T, T> {};\n\ntemplate <typename T> struct RemoveConst { typedef T Type; };\n\ntemplate <typename T> struct RemoveConst<const T> { typedef T Type; };\n\n\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// IsSame, IsConst, IsMoreConst, IsPointer\n\n//\n\ntemplate <typename T, typename U> struct IsSame : FalseType {};\n\ntemplate <typename T> struct IsSame<T, T> : TrueType {};\n\n\n\ntemplate <typename T> struct IsConst : FalseType {};\n\ntemplate <typename T> struct IsConst<const T> : TrueType {};\n\n\n\ntemplate <typename CT, typename T>\n\nstruct IsMoreConst\n\n : AndExpr<IsSame<typename RemoveConst<CT>::Type, typename RemoveConst<T>::Type>,\n\n BoolType<IsConst<CT>::Value >= IsConst<T>::Value> >::Type {};\n\n\n\ntemplate <typename T> struct IsPointer : FalseType {};\n\ntemplate <typename T> struct IsPointer<T*> : TrueType {};\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// IsBaseOf\n\n//\n\n#if RAPIDJSON_HAS_CXX11_TYPETRAITS\n\n\n\ntemplate <typename B, typename D> struct IsBaseOf\n\n : BoolType< ::std::is_base_of<B,D>::value> {};\n\n\n\n#else // simplified version adopted from Boost\n\n\n\ntemplate<typename B, typename D> struct IsBaseOfImpl {\n\n RAPIDJSON_STATIC_ASSERT(sizeof(B) != 0);\n\n RAPIDJSON_STATIC_ASSERT(sizeof(D) != 0);\n\n\n\n typedef char (&Yes)[1];\n\n typedef char (&No) [2];\n\n\n\n template <typename T>\n\n static Yes Check(const D*, T);\n\n static No Check(const B*, int);\n\n\n\n struct Host {\n\n operator const B*() const;\n\n operator const D*();\n\n };\n\n\n\n enum { Value = (sizeof(Check(Host(), 0)) == sizeof(Yes)) };\n\n};\n\n\n\ntemplate <typename B, typename D> struct IsBaseOf\n\n : OrExpr<IsSame<B, D>, BoolExpr<IsBaseOfImpl<B, D> > >::Type {};\n\n\n\n#endif // RAPIDJSON_HAS_CXX11_TYPETRAITS\n\n\n\n\n\n//////////////////////////////////////////////////////////////////////////\n\n// EnableIf / DisableIf\n\n//\n\ntemplate <bool Condition, typename T = void> struct EnableIfCond { typedef T Type; };\n\ntemplate <typename T> struct EnableIfCond<false, T> { /* empty */ };\n\n\n\ntemplate <bool Condition, typename T = void> struct DisableIfCond { typedef T Type; };\n\ntemplate <typename T> struct DisableIfCond<true, T> { /* empty */ };\n\n\n\ntemplate <typename Condition, typename T = void>\n\nstruct EnableIf : EnableIfCond<Condition::Value, T> {};\n\n\n\ntemplate <typename Condition, typename T = void>\n\nstruct DisableIf : DisableIfCond<Condition::Value, T> {};\n\n\n\n// SFINAE helpers\n\nstruct SfinaeTag {};\n\ntemplate <typename T> struct RemoveSfinaeTag;\n","file_path":"Source/rapidjson/internal/meta.h","rank":83,"score":38181.47191615001},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\n#ifdef __GNUC__\n\nRAPIDJSON_DIAG_PUSH\n\nRAPIDJSON_DIAG_OFF(effc++)\n\n#endif\n\n\n\nstruct DiyFp {\n\n DiyFp() {}\n\n\n\n DiyFp(uint64_t fp, int exp) : f(fp), e(exp) {}\n\n\n\n explicit DiyFp(double d) {\n\n union {\n\n double d;\n\n uint64_t u64;\n\n } u = { d };\n\n\n\n int biased_e = static_cast<int>((u.u64 & kDpExponentMask) >> kDpSignificandSize);\n\n uint64_t significand = (u.u64 & kDpSignificandMask);\n\n if (biased_e != 0) {\n\n f = significand + kDpHiddenBit;\n\n e = biased_e - kDpExponentBias;\n\n } \n\n else {\n\n f = significand;\n\n e = kDpMinExponent + 1;\n\n }\n","file_path":"Source/rapidjson/internal/diyfp.h","rank":84,"score":38181.47191615001},{"content":"RAPIDJSON_NAMESPACE_BEGIN\n\nnamespace internal {\n\n\n\ninline const char* GetDigitsLut() {\n\n static const char cDigitsLut[200] = {\n\n '0','0','0','1','0','2','0','3','0','4','0','5','0','6','0','7','0','8','0','9',\n\n '1','0','1','1','1','2','1','3','1','4','1','5','1','6','1','7','1','8','1','9',\n\n '2','0','2','1','2','2','2','3','2','4','2','5','2','6','2','7','2','8','2','9',\n\n '3','0','3','1','3','2','3','3','3','4','3','5','3','6','3','7','3','8','3','9',\n\n '4','0','4','1','4','2','4','3','4','4','4','5','4','6','4','7','4','8','4','9',\n\n '5','0','5','1','5','2','5','3','5','4','5','5','5','6','5','7','5','8','5','9',\n\n '6','0','6','1','6','2','6','3','6','4','6','5','6','6','6','7','6','8','6','9',\n\n '7','0','7','1','7','2','7','3','7','4','7','5','7','6','7','7','7','8','7','9',\n\n '8','0','8','1','8','2','8','3','8','4','8','5','8','6','8','7','8','8','8','9',\n\n '9','0','9','1','9','2','9','3','9','4','9','5','9','6','9','7','9','8','9','9'\n\n };\n\n return cDigitsLut;\n\n}\n\n\n\ninline char* u32toa(uint32_t value, char* buffer) {\n\n const char* cDigitsLut = GetDigitsLut();\n\n\n\n if (value < 10000) {\n\n const uint32_t d1 = (value / 100) << 1;\n\n const uint32_t d2 = (value % 100) << 1;\n\n \n\n if (value >= 1000)\n\n *buffer++ = cDigitsLut[d1];\n\n if (value >= 100)\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n if (value >= 10)\n\n *buffer++ = cDigitsLut[d2];\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n }\n\n else if (value < 100000000) {\n\n // value = bbbbcccc\n\n const uint32_t b = value / 10000;\n\n const uint32_t c = value % 10000;\n\n \n\n const uint32_t d1 = (b / 100) << 1;\n\n const uint32_t d2 = (b % 100) << 1;\n\n \n\n const uint32_t d3 = (c / 100) << 1;\n\n const uint32_t d4 = (c % 100) << 1;\n\n \n\n if (value >= 10000000)\n\n *buffer++ = cDigitsLut[d1];\n\n if (value >= 1000000)\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n if (value >= 100000)\n\n *buffer++ = cDigitsLut[d2];\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n \n\n *buffer++ = cDigitsLut[d3];\n\n *buffer++ = cDigitsLut[d3 + 1];\n\n *buffer++ = cDigitsLut[d4];\n\n *buffer++ = cDigitsLut[d4 + 1];\n\n }\n\n else {\n\n // value = aabbbbcccc in decimal\n\n \n\n const uint32_t a = value / 100000000; // 1 to 42\n\n value %= 100000000;\n\n \n\n if (a >= 10) {\n\n const unsigned i = a << 1;\n\n *buffer++ = cDigitsLut[i];\n\n *buffer++ = cDigitsLut[i + 1];\n\n }\n\n else\n\n *buffer++ = static_cast<char>('0' + static_cast<char>(a));\n\n\n\n const uint32_t b = value / 10000; // 0 to 9999\n\n const uint32_t c = value % 10000; // 0 to 9999\n\n \n\n const uint32_t d1 = (b / 100) << 1;\n\n const uint32_t d2 = (b % 100) << 1;\n\n \n\n const uint32_t d3 = (c / 100) << 1;\n\n const uint32_t d4 = (c % 100) << 1;\n\n \n\n *buffer++ = cDigitsLut[d1];\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n *buffer++ = cDigitsLut[d2];\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n *buffer++ = cDigitsLut[d3];\n\n *buffer++ = cDigitsLut[d3 + 1];\n\n *buffer++ = cDigitsLut[d4];\n\n *buffer++ = cDigitsLut[d4 + 1];\n\n }\n\n return buffer;\n\n}\n\n\n\ninline char* i32toa(int32_t value, char* buffer) {\n\n uint32_t u = static_cast<uint32_t>(value);\n\n if (value < 0) {\n\n *buffer++ = '-';\n\n u = ~u + 1;\n\n }\n\n\n\n return u32toa(u, buffer);\n\n}\n\n\n\ninline char* u64toa(uint64_t value, char* buffer) {\n\n const char* cDigitsLut = GetDigitsLut();\n\n const uint64_t kTen8 = 100000000;\n\n const uint64_t kTen9 = kTen8 * 10;\n\n const uint64_t kTen10 = kTen8 * 100;\n\n const uint64_t kTen11 = kTen8 * 1000;\n\n const uint64_t kTen12 = kTen8 * 10000;\n\n const uint64_t kTen13 = kTen8 * 100000;\n\n const uint64_t kTen14 = kTen8 * 1000000;\n\n const uint64_t kTen15 = kTen8 * 10000000;\n\n const uint64_t kTen16 = kTen8 * kTen8;\n\n \n\n if (value < kTen8) {\n\n uint32_t v = static_cast<uint32_t>(value);\n\n if (v < 10000) {\n\n const uint32_t d1 = (v / 100) << 1;\n\n const uint32_t d2 = (v % 100) << 1;\n\n \n\n if (v >= 1000)\n\n *buffer++ = cDigitsLut[d1];\n\n if (v >= 100)\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n if (v >= 10)\n\n *buffer++ = cDigitsLut[d2];\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n }\n\n else {\n\n // value = bbbbcccc\n\n const uint32_t b = v / 10000;\n\n const uint32_t c = v % 10000;\n\n \n\n const uint32_t d1 = (b / 100) << 1;\n\n const uint32_t d2 = (b % 100) << 1;\n\n \n\n const uint32_t d3 = (c / 100) << 1;\n\n const uint32_t d4 = (c % 100) << 1;\n\n \n\n if (value >= 10000000)\n\n *buffer++ = cDigitsLut[d1];\n\n if (value >= 1000000)\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n if (value >= 100000)\n\n *buffer++ = cDigitsLut[d2];\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n \n\n *buffer++ = cDigitsLut[d3];\n\n *buffer++ = cDigitsLut[d3 + 1];\n\n *buffer++ = cDigitsLut[d4];\n\n *buffer++ = cDigitsLut[d4 + 1];\n\n }\n\n }\n\n else if (value < kTen16) {\n\n const uint32_t v0 = static_cast<uint32_t>(value / kTen8);\n\n const uint32_t v1 = static_cast<uint32_t>(value % kTen8);\n\n \n\n const uint32_t b0 = v0 / 10000;\n\n const uint32_t c0 = v0 % 10000;\n\n \n\n const uint32_t d1 = (b0 / 100) << 1;\n\n const uint32_t d2 = (b0 % 100) << 1;\n\n \n\n const uint32_t d3 = (c0 / 100) << 1;\n\n const uint32_t d4 = (c0 % 100) << 1;\n\n\n\n const uint32_t b1 = v1 / 10000;\n\n const uint32_t c1 = v1 % 10000;\n\n \n\n const uint32_t d5 = (b1 / 100) << 1;\n\n const uint32_t d6 = (b1 % 100) << 1;\n\n \n\n const uint32_t d7 = (c1 / 100) << 1;\n\n const uint32_t d8 = (c1 % 100) << 1;\n\n\n\n if (value >= kTen15)\n\n *buffer++ = cDigitsLut[d1];\n\n if (value >= kTen14)\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n if (value >= kTen13)\n\n *buffer++ = cDigitsLut[d2];\n\n if (value >= kTen12)\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n if (value >= kTen11)\n\n *buffer++ = cDigitsLut[d3];\n\n if (value >= kTen10)\n\n *buffer++ = cDigitsLut[d3 + 1];\n\n if (value >= kTen9)\n\n *buffer++ = cDigitsLut[d4];\n\n if (value >= kTen8)\n\n *buffer++ = cDigitsLut[d4 + 1];\n\n \n\n *buffer++ = cDigitsLut[d5];\n\n *buffer++ = cDigitsLut[d5 + 1];\n\n *buffer++ = cDigitsLut[d6];\n\n *buffer++ = cDigitsLut[d6 + 1];\n\n *buffer++ = cDigitsLut[d7];\n\n *buffer++ = cDigitsLut[d7 + 1];\n\n *buffer++ = cDigitsLut[d8];\n\n *buffer++ = cDigitsLut[d8 + 1];\n\n }\n\n else {\n\n const uint32_t a = static_cast<uint32_t>(value / kTen16); // 1 to 1844\n\n value %= kTen16;\n\n \n\n if (a < 10)\n\n *buffer++ = static_cast<char>('0' + static_cast<char>(a));\n\n else if (a < 100) {\n\n const uint32_t i = a << 1;\n\n *buffer++ = cDigitsLut[i];\n\n *buffer++ = cDigitsLut[i + 1];\n\n }\n\n else if (a < 1000) {\n\n *buffer++ = static_cast<char>('0' + static_cast<char>(a / 100));\n\n \n\n const uint32_t i = (a % 100) << 1;\n\n *buffer++ = cDigitsLut[i];\n\n *buffer++ = cDigitsLut[i + 1];\n\n }\n\n else {\n\n const uint32_t i = (a / 100) << 1;\n\n const uint32_t j = (a % 100) << 1;\n\n *buffer++ = cDigitsLut[i];\n\n *buffer++ = cDigitsLut[i + 1];\n\n *buffer++ = cDigitsLut[j];\n\n *buffer++ = cDigitsLut[j + 1];\n\n }\n\n \n\n const uint32_t v0 = static_cast<uint32_t>(value / kTen8);\n\n const uint32_t v1 = static_cast<uint32_t>(value % kTen8);\n\n \n\n const uint32_t b0 = v0 / 10000;\n\n const uint32_t c0 = v0 % 10000;\n\n \n\n const uint32_t d1 = (b0 / 100) << 1;\n\n const uint32_t d2 = (b0 % 100) << 1;\n\n \n\n const uint32_t d3 = (c0 / 100) << 1;\n\n const uint32_t d4 = (c0 % 100) << 1;\n\n \n\n const uint32_t b1 = v1 / 10000;\n\n const uint32_t c1 = v1 % 10000;\n\n \n\n const uint32_t d5 = (b1 / 100) << 1;\n\n const uint32_t d6 = (b1 % 100) << 1;\n\n \n\n const uint32_t d7 = (c1 / 100) << 1;\n\n const uint32_t d8 = (c1 % 100) << 1;\n\n \n\n *buffer++ = cDigitsLut[d1];\n\n *buffer++ = cDigitsLut[d1 + 1];\n\n *buffer++ = cDigitsLut[d2];\n\n *buffer++ = cDigitsLut[d2 + 1];\n\n *buffer++ = cDigitsLut[d3];\n\n *buffer++ = cDigitsLut[d3 + 1];\n\n *buffer++ = cDigitsLut[d4];\n\n *buffer++ = cDigitsLut[d4 + 1];\n\n *buffer++ = cDigitsLut[d5];\n\n *buffer++ = cDigitsLut[d5 + 1];\n\n *buffer++ = cDigitsLut[d6];\n\n *buffer++ = cDigitsLut[d6 + 1];\n\n *buffer++ = cDigitsLut[d7];\n\n *buffer++ = cDigitsLut[d7 + 1];\n\n *buffer++ = cDigitsLut[d8];\n\n *buffer++ = cDigitsLut[d8 + 1];\n\n }\n\n \n\n return buffer;\n\n}\n\n\n\ninline char* i64toa(int64_t value, char* buffer) {\n\n uint64_t u = static_cast<uint64_t>(value);\n\n if (value < 0) {\n\n *buffer++ = '-';\n\n u = ~u + 1;\n\n }\n\n\n\n return u64toa(u, buffer);\n\n}\n\n\n","file_path":"Source/rapidjson/internal/itoa.h","rank":85,"score":38181.47191615001},{"content":" static unsigned char GetRange(unsigned char c) {\n\n // Referring to DFA of http://bjoern.hoehrmann.de/utf-8/decoder/dfa/\n\n // With new mapping 1 -> 0x10, 7 -> 0x20, 9 -> 0x40, such that AND operation can test multiple types.\n\n static const unsigned char type[] = {\n\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n\n 0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,\n\n 0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,\n\n 0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,\n\n 0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,\n\n 8,8,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,\n\n 10,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3, 11,6,6,6,5,8,8,8,8,8,8,8,8,8,8,8,\n\n };\n\n return type[c];\n","file_path":"Source/rapidjson/encodings.h","rank":86,"score":38138.109447878516},{"content":"","file_path":"Source/StateManager.h","rank":87,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":88,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":89,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":90,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":91,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":92,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":93,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":94,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":95,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":96,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":97,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":98,"score":38001.30954510052},{"content":"","file_path":"Source/StateManager.h","rank":99,"score":38001.30954510052}],"string":"[\n {\n \"content\": \"// Unit choices for main unit mix and tech target.\\n\\n// This deliberately omits support units like queens and defilers.\\n\\nenum class TechUnit : int\\n\\n\\t{ None\\n\\n\\t, Zerglings\\n\\n\\t, Hydralisks\\n\\n\\t, Lurkers\\n\\n\\t, Mutalisks\\n\\n\\t, Ultralisks\\n\\n\\t, Guardians\\n\\n\\t, Devourers\\n\\n\\t, Size\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Source/StrategyBossZerg.h\",\n \"rank\": 0,\n \"score\": 97105.6186361545\n },\n {\n \"content\": \" friend bool operator==(ParseErrorCode code, const ParseResult & err) { return code == err.code_; }\\n\",\n \"file_path\": \"Source/rapidjson/error/error.h\",\n \"rank\": 1,\n \"score\": 73195.34718891876\n },\n {\n \"content\": \"namespace XBot\\n\\n{\\n\\nnamespace UnitUtil\\n\\n{ \\n\\n\\tbool IsMorphedBuildingType(BWAPI::UnitType unitType);\\n\\n\\t\\n\\n\\tbool IsCombatSimUnit(BWAPI::UnitType type);\\n\\n\\tbool IsCombatUnit(BWAPI::UnitType type);\\n\\n\\tbool IsCombatUnit(BWAPI::Unit unit);\\n\\n bool IsValidUnit(BWAPI::Unit unit);\\n\\n \\n\\n\\tbool CanAttack(BWAPI::Unit attacker, BWAPI::Unit target);\\n\\n\\tbool CanAttack(BWAPI::UnitType attacker, BWAPI::UnitType target);\\n\\n\\tbool CanAttackAir(BWAPI::Unit attacker);\\n\\n\\tbool TypeCanAttackAir(BWAPI::UnitType attacker);\\n\\n\\tbool CanAttackGround(BWAPI::Unit attacker);\\n\\n\\tbool TypeCanAttackGround(BWAPI::UnitType attacker);\\n\\n\\tdouble CalculateLTD(BWAPI::Unit attacker, BWAPI::Unit target);\\n\\n\\tBWAPI::WeaponType GetWeapon(BWAPI::Unit attacker, BWAPI::Unit target);\\n\\n\\tBWAPI::WeaponType GetWeapon(BWAPI::UnitType attacker, BWAPI::Unit target);\\n\\n\\tBWAPI::WeaponType GetWeapon(BWAPI::UnitType attacker, BWAPI::UnitType target);\\n\\n\\tint GetAttackRange(BWAPI::Unit attacker, BWAPI::Unit target);\\n\\n\\tint GetAttackRangeAssumingUpgrades(BWAPI::UnitType attacker, BWAPI::UnitType target);\\n\\n\\t\\n\\n\\tint GetAllUnitCount(BWAPI::UnitType type);\\n\\n\\tint GetCompletedUnitCount(BWAPI::UnitType type);\\n\\n};\\n\",\n \"file_path\": \"Source/UnitUtil.h\",\n \"rank\": 2,\n \"score\": 73066.87243961479\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 3,\n \"score\": 71134.48540044519\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 4,\n \"score\": 71070.42466152788\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 5,\n \"score\": 71070.42466152788\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 6,\n \"score\": 71070.42466152788\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 7,\n \"score\": 71070.42466152788\n },\n {\n \"content\": \"enum WorkerData::WorkerJob WorkerData::getWorkerJob(BWAPI::Unit unit)\\n\\n{\\n\\n\\tif (!unit) { return Default; }\\n\\n\\n\\n\\tstd::map<BWAPI::Unit, enum WorkerJob>::iterator it = workerJobMap.find(unit);\\n\\n\\n\\n\\tif (it != workerJobMap.end())\\n\\n\\t{\\n\\n\\t\\treturn it->second;\\n\\n\\t}\\n\\n\\n\\n\\treturn Default;\\n\\n}\\n\\n\\n\\nbool WorkerData::depotIsFull(BWAPI::Unit depot)\\n\\n{\\n\\n\\tif (!depot) { return false; }\\n\\n\\n\\n\\tint assignedWorkers = getNumAssignedWorkers(depot);\\n\\n\\tint mineralsNearDepot = getMineralsNearDepot(depot);\\n\",\n \"file_path\": \"Source/WorkerData.cpp\",\n \"rank\": 8,\n \"score\": 62455.36619926634\n },\n {\n \"content\": \"class UnitData\\n\\n{\\n\\n UIMap unitMap;\\n\\n\\n\\n const bool badUnitInfo(const UnitInfo & ui) const;\\n\\n\\n\\n std::vector<int>\\t\\t\\t\\t\\t\\tnumUnits; // how many now\\n\\n\\tstd::vector<int>\\t\\t\\t\\t\\t\\tnumDeadUnits; // how many lost\\n\\n\\n\\n int\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmineralsLost;\\n\\n int\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tgasLost;\\n\\n\\n\\npublic:\\n\\n\\n\\n UnitData();\\n\\n\\n\\n void\\tupdateUnit(BWAPI::Unit unit);\\n\\n void\\tremoveUnit(BWAPI::Unit unit);\\n\\n void\\tremoveBadUnits();\\n\\n\\n\\n int\\t\\tgetGasLost() const;\\n\\n int\\t\\tgetMineralsLost() const;\\n\\n int\\t\\tgetNumUnits(BWAPI::UnitType t) const;\\n\\n int\\t\\tgetNumDeadUnits(BWAPI::UnitType t) const;\\n\\n const\\tstd::map<BWAPI::Unit,UnitInfo> & getUnits() const;\\n\\n\\tconst\\tUnitInfo * getUnit(BWAPI::Unit unit)\\t\\tconst;\\n\\n};\\n\\n}\",\n \"file_path\": \"Source/UnitData.h\",\n \"rank\": 9,\n \"score\": 56271.435437263855\n },\n {\n \"content\": \"struct UnitInfo\\n\\n{\\n\\n // we need to store all of this data because if the unit is not visible, we\\n\\n // can't reference it from the unit pointer\\n\\n\\n\\n int unitID;\\n\\n\\tint\\t\\t\\t\\tupdateFrame;\\n\\n int lastHealth;\\n\\n int lastShields;\\n\\n BWAPI::Player player;\\n\\n BWAPI::Unit unit;\\n\\n BWAPI::Position lastPosition;\\n\\n\\tBWAPI::TilePosition lastTilePosition;\\n\\n BWAPI::UnitType type;\\n\\n bool completed;\\n\\n\\n\\n UnitInfo()\\n\\n : unitID(0)\\n\\n\\t\\t, updateFrame(0)\\n\\n\\t\\t, lastHealth(0)\\n\",\n \"file_path\": \"Source/UnitData.h\",\n \"rank\": 10,\n \"score\": 56271.435437263855\n },\n {\n \"content\": \"\\tclass Graph &\\t\\t\\t\\tGetGraph()\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return m_Graph; }\\n\\n\\n\\n\\n\\n\\tconst vector<pair<pair<Area::id, Area::id>, BWAPI::WalkPosition>> &\\t\\tRawFrontier() const override\\t\\t{ return m_RawFrontier; }\\n\\n\\n\\n\\n\\n\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tOnMineralDestroyed(const Mineral * pMineral);\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tOnBlockingNeutralDestroyed(const Neutral * pBlocking);\\n\\n\\n\\nprivate:\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tReplaceAreaIds(BWAPI::WalkPosition p, Area::id newAreaId);\\n\\n\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tInitializeNeutrals();\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tLoadData();\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tDecideSeasOrLakes();\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tComputeAltitude();\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tProcessBlockingNeutrals();\\n\\n\\tvoid\\t\\t\\t\\t\\t\\tComputeAreas();\\n\\n\\tvector<pair<BWAPI::WalkPosition, MiniTile *>>\\n\",\n \"file_path\": \"Source/bwem/mapImpl.h\",\n \"rank\": 11,\n \"score\": 53691.5073949815\n },\n {\n \"content\": \"struct GenericMemberIterator<true,Encoding,Allocator> {\\n\\n //! use plain const pointer as iterator type\\n\\n typedef const GenericMember<Encoding,Allocator>* Iterator;\\n\\n};\\n\\n\\n\\n#endif // RAPIDJSON_NOMEMBERITERATORCLASS\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// GenericStringRef\\n\\n\\n\\n//! Reference to a constant string (not taking a copy)\\n\\n/*!\\n\\n \\\\tparam CharType character type of the string\\n\\n\\n\\n This helper class is used to automatically infer constant string\\n\\n references for string literals, especially from \\\\c const \\\\b (!)\\n\\n character arrays.\\n\\n\\n\\n The main use is for creating JSON string values without copying the\\n\\n source string via an \\\\ref Allocator. This requires that the referenced\\n\",\n \"file_path\": \"Source/rapidjson/document.h\",\n \"rank\": 12,\n \"score\": 53685.481801766015\n },\n {\n \"content\": \"class MicroRanged : public MicroManager\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tMicroRanged();\\n\\n\\tvoid executeMicro(const BWAPI::Unitset & targets);\\n\\n\\n\\n\\tBWAPI::Unit chooseTarget(BWAPI::Unit rangedUnit, const BWAPI::Unitset & targets, std::map<BWAPI::Unit, int> & numTargeting);\\n\\n\\n\\n\\tint getAttackPriority(BWAPI::Unit rangedUnit, BWAPI::Unit target);\\n\\n\\tBWAPI::Unit getTarget(BWAPI::Unit rangedUnit, const BWAPI::Unitset & targets);\\n\\n\\n\\n void assignTargets(const BWAPI::Unitset & targets);\\n\\n\\n\\n\\tbool stayHomeUntilReady(const BWAPI::Unit u) const;\\n\\n};\\n\\n}\",\n \"file_path\": \"Source/MicroRanged.h\",\n \"rank\": 13,\n \"score\": 52210.68997473142\n },\n {\n \"content\": \"#pragma once;\\n\\n\\n\\n#include <Common.h>\\n\\n#include \\\"MicroManager.h\\\"\\n\\n\\n\\nnamespace XBot\\n\\n{\\n\",\n \"file_path\": \"Source/MicroRanged.h\",\n \"rank\": 14,\n \"score\": 48459.494676786504\n },\n {\n \"content\": \"\\t\\t, lastShields(0)\\n\\n\\t\\t, player(nullptr)\\n\\n , unit(nullptr)\\n\\n , lastPosition(BWAPI::Positions::None)\\n\\n\\t\\t, lastTilePosition(BWAPI::TilePositions::None)\\n\\n , type(BWAPI::UnitTypes::None)\\n\\n , completed(false)\\n\\n\\t{\\n\\n }\\n\\n\\n\\n\\tUnitInfo(BWAPI::Unit unit)\\n\\n\\t\\t: unitID(unit->getID())\\n\\n\\t\\t, updateFrame(BWAPI::Broodwar->getFrameCount())\\n\\n\\t\\t, lastHealth(unit->getHitPoints())\\n\\n\\t\\t, lastShields(unit->getShields())\\n\\n\\t\\t, player(unit->getPlayer())\\n\\n\\t\\t, unit(unit)\\n\\n\\t\\t, lastPosition(unit->getPosition())\\n\\n\\t\\t, lastTilePosition(unit->getTilePosition())\\n\\n\\t\\t, type(unit->getType())\\n\",\n \"file_path\": \"Source/UnitData.h\",\n \"rank\": 15,\n \"score\": 48431.30028950554\n },\n {\n \"content\": \"\\t\\t, completed(unit->isCompleted())\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n const bool operator == (BWAPI::Unit unit) const\\n\\n {\\n\\n return unitID == unit->getID();\\n\\n }\\n\\n\\n\\n const bool operator == (const UnitInfo & rhs) const\\n\\n {\\n\\n return (unitID == rhs.unitID);\\n\\n }\\n\\n\\n\\n const bool operator < (const UnitInfo & rhs) const\\n\\n {\\n\\n return (unitID < rhs.unitID);\\n\\n }\\n\\n};\\n\\n\\n\\ntypedef std::vector<UnitInfo> UnitInfoVector;\\n\\ntypedef std::map<BWAPI::Unit,UnitInfo> UIMap;\\n\\n\\n\",\n \"file_path\": \"Source/UnitData.h\",\n \"rank\": 16,\n \"score\": 48425.147653345215\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Common.h\\\"\\n\\n#include \\\"BWTA.h\\\"\\n\\n\\n\\nnamespace XBot\\n\\n{\\n\",\n \"file_path\": \"Source/UnitData.h\",\n \"rank\": 17,\n \"score\": 48424.61279654068\n },\n {\n \"content\": \"\\tint bestScore = -999999;\\n\\n\\tBWAPI::Unit bestTarget = nullptr;\\n\\n\\n\\n\\tfor (const auto target : targets)\\n\\n\\t{\\n\\n\\t\\tint priority = getAttackPriority(rangedUnit, target); // 0..12\\n\\n\\t\\tint range = rangedUnit->getDistance(target); // 0..map size in pixels\\n\\n\\t\\tint toGoal = target->getDistance(order.getPosition()); // 0..map size in pixels\\n\\n\\n\\n\\t\\t// Let's say that 1 priority step is worth 160 pixels (5 tiles).\\n\\n\\t\\t// We care about unit-target range and target-order position distance.\\n\\n\\t\\tint score = 5 * 32 * priority - range - toGoal/2;\\n\\n\\n\\n\\t\\t// Adjust for special features.\\n\\n\\t\\t// This could adjust for relative speed and direction, so that we don't chase what we can't catch.\\n\\n\\t\\tif (rangedUnit->isInWeaponRange(target))\\n\\n\\t\\t{\\n\\n\\t\\t\\tscore += 4 * 32;\\n\\n\\t\\t}\\n\\n\\t\\telse if (!target->isMoving())\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 18,\n \"score\": 46395.20319950419\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\tif (target->getType().size() == BWAPI::UnitSizeTypes::Small)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tscore += 32;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tif (score > bestScore)\\n\\n\\t\\t{\\n\\n\\t\\t\\tbestScore = score;\\n\\n\\t\\t\\tbestTarget = target;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\t\\n\\n\\treturn bestTarget;\\n\\n}\\n\\n\\n\\n// get the attack priority of a target unit\\n\\nint MicroRanged::getAttackPriority(BWAPI::Unit rangedUnit, BWAPI::Unit target) \\n\\n{\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 19,\n \"score\": 46390.750631375406\n },\n {\n \"content\": \"#include \\\"MicroRanged.h\\\"\\n\\n#include \\\"UnitUtil.h\\\"\\n\\n\\n\\nusing namespace XBot;\\n\\n\\n\\nMicroRanged::MicroRanged()\\n\\n{ \\n\\n}\\n\\n\\n\\nvoid MicroRanged::executeMicro(const BWAPI::Unitset & targets) \\n\\n{\\n\\n\\tassignTargets(targets);\\n\\n}\\n\\n\\n\\nvoid MicroRanged::assignTargets(const BWAPI::Unitset & targets)\\n\\n{\\n\\n const BWAPI::Unitset & rangedUnits = getUnits();\\n\\n\\n\\n\\t// The set of potential targets.\\n\\n\\tBWAPI::Unitset rangedUnitTargets;\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 20,\n \"score\": 46390.29980219689\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\t// This includes proxy buildings, which deserve high priority.\\n\\n\\t\\t\\t// But when bases are close together, it can include innocent buildings.\\n\\n\\t\\t\\t// We also don't want to disrupt priorities in case of proxy buildings\\n\\n\\t\\t\\t// supported by units; we may want to target the units first.\\n\\n\\t\\t\\tif (UnitUtil::CanAttackGround(target) || UnitUtil::CanAttackAir(target))\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\treturn 10;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn 8;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n \\n\\n\\tif (rangedType.isFlyer()) {\\n\\n\\t\\t// Exceptions if we're a flyer (other than scourge, which is handled above).\\n\\n\\t\\tif (targetType == BWAPI::UnitTypes::Zerg_Scourge)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn 12;\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 21,\n \"score\": 46389.19678785186\n },\n {\n \"content\": \"\\t// Short circuit: Give bunkers a lower priority to reduce bunker obsession.\\n\\n\\tif (targetType == BWAPI::UnitTypes::Terran_Bunker)\\n\\n\\t{\\n\\n\\t\\treturn 9;\\n\\n\\t}\\n\\n\\n\\n\\t// Threats can attack us. Exception: Workers are not threats.\\n\\n\\tif (UnitUtil::CanAttack(targetType, rangedType) && !targetType.isWorker())\\n\\n\\t{\\n\\n\\t\\t// Enemy unit which is far enough outside its range is lower priority than a worker.\\n\\n\\t\\tif (rangedUnit->getDistance(target) > 48 + UnitUtil::GetAttackRange(target, rangedUnit))\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn 8;\\n\\n\\t\\t}\\n\\n\\t\\treturn 10;\\n\\n\\t}\\n\\n\\t// Droppers are as bad as threats. They may be loaded and are often isolated and safer to attack.\\n\\n\\tif (targetType == BWAPI::UnitTypes::Terran_Dropship ||\\n\\n\\t\\ttargetType == BWAPI::UnitTypes::Protoss_Shuttle)\\n\\n\\t{\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 22,\n \"score\": 46388.573937875175\n },\n {\n \"content\": \"\\tif (targetType.gasPrice() > 0)\\n\\n\\t{\\n\\n\\t\\treturn 4;\\n\\n\\t}\\n\\n\\tif (targetType.mineralPrice() > 0)\\n\\n\\t{\\n\\n\\t\\treturn 3;\\n\\n\\t}\\n\\n\\t// Finally everything else.\\n\\n\\treturn 1;\\n\\n}\\n\\n\\n\\n// Should the unit stay (or return) home until ready to move out?\\n\\nbool MicroRanged::stayHomeUntilReady(const BWAPI::Unit u) const\\n\\n{\\n\\n\\treturn\\n\\n\\t\\tu->getType() == BWAPI::UnitTypes::Protoss_Carrier && u->getInterceptorCount() < 4;\\n\\n}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 23,\n \"score\": 46388.418413187894\n },\n {\n \"content\": \"\\t\\t\\tBWAPI::Unit target = getTarget(rangedUnit, rangedUnitTargets);\\n\\n\\t\\t\\tif (target)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (Config::Debug::DrawUnitTargetInfo)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tBWAPI::Broodwar->drawLineMap(rangedUnit->getPosition(), rangedUnit->getTargetPosition(), BWAPI::Colors::Purple);\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t// attack it\\n\\n\\t\\t\\t\\tif (Config::Micro::KiteWithRangedUnits)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif (rangedUnit->getType() == BWAPI::UnitTypes::Zerg_Mutalisk || rangedUnit->getType() == BWAPI::UnitTypes::Terran_Vulture)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tMicro::MutaDanceTarget(rangedUnit, target);\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\telse\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tMicro::SmartKiteTarget(rangedUnit, target);\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 24,\n \"score\": 46387.009323541235\n },\n {\n \"content\": \"\\t\\t\\t\\telse\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tMicro::SmartAttackUnit(rangedUnit, target);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// No target found. If we're not near the order position, go there.\\n\\n\\t\\t\\t\\tif (rangedUnit->getDistance(order.getPosition()) > 100)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tMicro::SmartAttackMove(rangedUnit, order.getPosition());\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n// This could return null if no target is worth attacking, but doesn't happen to.\\n\\nBWAPI::Unit MicroRanged::getTarget(BWAPI::Unit rangedUnit, const BWAPI::Unitset & targets)\\n\\n{\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 25,\n \"score\": 46386.98562360152\n },\n {\n \"content\": \" std::copy_if(targets.begin(), targets.end(), std::inserter(rangedUnitTargets, rangedUnitTargets.end()),\\n\\n\\t\\t[](BWAPI::Unit u) {\\n\\n\\t\\treturn\\n\\n\\t\\t\\tu->isVisible() &&\\n\\n\\t\\t\\tu->isDetected() &&\\n\\n\\t\\t\\tu->getType() != BWAPI::UnitTypes::Zerg_Larva &&\\n\\n\\t\\t\\tu->getType() != BWAPI::UnitTypes::Zerg_Egg &&\\n\\n\\t\\t\\t!u->isStasised();\\n\\n\\t});\\n\\n\\n\\n for (const auto rangedUnit : rangedUnits)\\n\\n\\t{\\n\\n\\t\\tif (buildScarabOrInterceptor(rangedUnit))\\n\\n\\t\\t{\\n\\n\\t\\t\\t// If we started one, no further action this frame.\\n\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Special case for irradiated zerg air units.\\n\\n\\t\\tif (rangedUnit->isIrradiated() && rangedUnit->getType().getRace() == BWAPI::Races::Zerg)\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 26,\n \"score\": 46386.389261027245\n },\n {\n \"content\": \"\\t\\t\\n\\n\\t\\t// Prefer targets that are already hurt.\\n\\n\\t\\tif (target->getType().getRace() == BWAPI::Races::Protoss && target->getShields() == 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\tscore += 32;\\n\\n\\t\\t}\\n\\n\\t\\tif (target->getHitPoints() < target->getType().maxHitPoints())\\n\\n\\t\\t{\\n\\n\\t\\t\\tscore += 24;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tBWAPI::DamageType damage = UnitUtil::GetWeapon(rangedUnit, target).damageType();\\n\\n\\t\\tif (damage == BWAPI::DamageTypes::Explosive)\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (target->getType().size() == BWAPI::UnitSizeTypes::Large)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tscore += 32;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\telse if (damage == BWAPI::DamageTypes::Concussive)\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 27,\n \"score\": 46383.67900097899\n },\n {\n \"content\": \"\\t\\treturn 6;\\n\\n\\t}\\n\\n\\tif (targetType == BWAPI::UnitTypes::Protoss_Pylon)\\n\\n\\t{\\n\\n\\t\\treturn 5;\\n\\n\\t}\\n\\n\\tif (targetType == BWAPI::UnitTypes::Terran_Factory || targetType == BWAPI::UnitTypes::Terran_Armory)\\n\\n\\t{\\n\\n\\t\\treturn 5;\\n\\n\\t}\\n\\n\\t// Downgrade unfinished/unpowered buildings, with exceptions.\\n\\n\\tif (targetType.isBuilding() &&\\n\\n\\t\\t(!target->isCompleted() || !target->isPowered()) &&\\n\\n\\t\\t!(\\ttargetType.isResourceDepot() ||\\n\\n\\t\\t\\ttargetType.groundWeapon() != BWAPI::WeaponTypes::None ||\\n\\n\\t\\t\\ttargetType.airWeapon() != BWAPI::WeaponTypes::None ||\\n\\n\\t\\t\\ttargetType == BWAPI::UnitTypes::Terran_Bunker))\\n\\n\\t{\\n\\n\\t\\treturn 2;\\n\\n\\t}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 28,\n \"score\": 46383.55801973491\n },\n {\n \"content\": \"\\tconst BWAPI::UnitType rangedType = rangedUnit->getType();\\n\\n\\tconst BWAPI::UnitType targetType = target->getType();\\n\\n\\n\\n\\tif (rangedType == BWAPI::UnitTypes::Zerg_Scourge)\\n\\n {\\n\\n\\t\\tif (!targetType.isFlyer())\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Can't target it. Also, ignore lifted buildings.\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}\\n\\n\\t\\tif (targetType == BWAPI::UnitTypes::Zerg_Overlord ||\\n\\n\\t\\t\\ttargetType == BWAPI::UnitTypes::Zerg_Scourge ||\\n\\n\\t\\t\\ttargetType == BWAPI::UnitTypes::Protoss_Interceptor)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Usually not worth scourge at all.\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\t// Everything else is the same. Hit whatever's closest.\\n\\n\\t\\treturn 10;\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 29,\n \"score\": 46383.41145424937\n },\n {\n \"content\": \"\\t// Spellcasters are as important as key buildings.\\n\\n\\t// Also remember to target other non-threat combat units.\\n\\n\\tif (targetType.isSpellcaster() ||\\n\\n\\t\\ttargetType.groundWeapon() != BWAPI::WeaponTypes::None ||\\n\\n\\t\\ttargetType.airWeapon() != BWAPI::WeaponTypes::None)\\n\\n\\t{\\n\\n\\t\\treturn 7;\\n\\n\\t}\\n\\n\\t// Templar tech and spawning pool are more important.\\n\\n\\tif (targetType == BWAPI::UnitTypes::Protoss_Templar_Archives)\\n\\n\\t{\\n\\n\\t\\treturn 7;\\n\\n\\t}\\n\\n\\tif (targetType == BWAPI::UnitTypes::Zerg_Spawning_Pool)\\n\\n\\t{\\n\\n\\t\\treturn 7;\\n\\n\\t}\\n\\n\\t// Don't forget the nexus/cc/hatchery.\\n\\n\\tif (targetType.isResourceDepot())\\n\\n\\t{\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 30,\n \"score\": 46382.72086577251\n },\n {\n \"content\": \"\\t\\t// Carriers stay at home until they have enough interceptors to be useful,\\n\\n\\t\\t// or retreat toward home to rebuild them if they run low.\\n\\n\\t\\t// On attack-move so that they're not helpless, but that can cause problems too....\\n\\n\\t\\t// Potentially useful for other units.\\n\\n\\t\\t// NOTE Regrouping can cause the carriers to move away from home.\\n\\n\\t\\tif (stayHomeUntilReady(rangedUnit))\\n\\n\\t\\t{\\n\\n\\t\\t\\tBWAPI::Position fleeTo(InformationManager::Instance().getMyMainBaseLocation()->getPosition());\\n\\n\\t\\t\\tMicro::SmartAttackMove(rangedUnit, fleeTo);\\n\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tif (order.isCombatOrder())\\n\\n {\\n\\n\\t\\t\\tif (unstickStuckUnit(rangedUnit))\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t// If a target can be found.\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 31,\n \"score\": 46382.44138976413\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tif (rangedType == BWAPI::UnitTypes::Zerg_Devourer)\\n\\n\\t{\\n\\n\\t\\tif (!target->isFlying())\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Can't target it.\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}\\n\\n\\t\\tif (targetType.isBuilding())\\n\\n\\t\\t{\\n\\n\\t\\t\\t// A lifted building is less important.\\n\\n\\t\\t\\treturn 1;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Everything else is the same.\\n\\n\\t\\treturn 10;\\n\\n\\t}\\n\\n\\t\\n\\n\\tif (rangedType == BWAPI::UnitTypes::Zerg_Guardian && target->isFlying())\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 32,\n \"score\": 46382.38770157002\n },\n {\n \"content\": \"\\t\\treturn 10;\\n\\n\\t}\\n\\n\\t// Also as bad are other dangerous things.\\n\\n\\tif (targetType == BWAPI::UnitTypes::Terran_Science_Vessel ||\\n\\n\\t\\ttargetType == BWAPI::UnitTypes::Zerg_Scourge)\\n\\n\\t{\\n\\n\\t\\treturn 10;\\n\\n\\t}\\n\\n\\t// Next are workers.\\n\\n\\tif (targetType.isWorker()) \\n\\n\\t{\\n\\n if (rangedUnit->getType() == BWAPI::UnitTypes::Terran_Vulture)\\n\\n {\\n\\n return 11;\\n\\n }\\n\\n\\t\\t// Repairing or blocking a choke makes you critical.\\n\\n\\t\\tif (target->isRepairing() || unitNearChokepoint(target))\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn 11;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 33,\n \"score\": 46381.501905517856\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\tif (target->isSieged() ||\\n\\n\\t\\t\\t\\ttarget->getOrder() == BWAPI::Orders::Sieging ||\\n\\n\\t\\t\\t\\ttarget->getOrder() == BWAPI::Orders::Unsieging)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tscore += 48;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tscore += 24;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\telse if (target->isBraking())\\n\\n\\t\\t{\\n\\n\\t\\t\\tscore += 16;\\n\\n\\t\\t}\\n\\n\\t\\telse if (target->getType().topSpeed() >= rangedUnit->getType().topSpeed())\\n\\n\\t\\t{\\n\\n\\t\\t\\tscore -= 5 * 32;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 34,\n \"score\": 46379.134029896195\n },\n {\n \"content\": \"\\telse\\n\\n\\t{\\n\\n\\t\\t// Exceptions if we're a ground unit.\\n\\n\\t\\tif (targetType == BWAPI::UnitTypes::Terran_Vulture_Spider_Mine && !target->isBurrowed() ||\\n\\n\\t\\t\\ttargetType == BWAPI::UnitTypes::Zerg_Infested_Terran)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn 12;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tif (targetType == BWAPI::UnitTypes::Protoss_High_Templar)\\n\\n\\t{\\n\\n\\t\\treturn 12;\\n\\n\\t}\\n\\n\\n\\n\\tif (targetType == BWAPI::UnitTypes::Protoss_Reaver)\\n\\n\\t{\\n\\n\\t\\treturn 11;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 35,\n \"score\": 46377.92883209711\n },\n {\n \"content\": \"\\t\\t// SCVs constructing are also important.\\n\\n\\t\\tif (target->isConstructing())\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn 10;\\n\\n\\t\\t}\\n\\n\\n\\n \\t\\treturn 9;\\n\\n\\t}\\n\\n\\t// Important combat units that we may not have targeted above (esp. if we're a flyer).\\n\\n\\tif (targetType == BWAPI::UnitTypes::Protoss_Carrier ||\\n\\n\\t\\ttargetType == BWAPI::UnitTypes::Terran_Siege_Tank_Tank_Mode ||\\n\\n\\t\\ttargetType == BWAPI::UnitTypes::Terran_Siege_Tank_Siege_Mode)\\n\\n\\t{\\n\\n\\t\\treturn 8;\\n\\n\\t}\\n\\n\\t// Nydus canal is the most important building to kill.\\n\\n\\tif (targetType == BWAPI::UnitTypes::Zerg_Nydus_Canal)\\n\\n\\t{\\n\\n\\t\\treturn 9;\\n\\n\\t}\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 36,\n \"score\": 46377.46319076497\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\tif (rangedUnit->isFlying())\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (rangedUnit->getDistance(order.getPosition()) < 300)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tMicro::SmartAttackMove(rangedUnit, order.getPosition());\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\telse\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tMicro::SmartMove(rangedUnit, order.getPosition());\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (rangedUnit->canBurrow())\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\trangedUnit->burrow();\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 37,\n \"score\": 46376.11351309152\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\t// Can't target it.\\n\\n\\t\\treturn 0;\\n\\n\\t}\\n\\n\\n\\n\\t// An addon other than a completed comsat is boring.\\n\\n\\t// TODO should also check that it is attached\\n\\n\\tif (targetType.isAddon() && !(targetType == BWAPI::UnitTypes::Terran_Comsat_Station && target->isCompleted()))\\n\\n\\t{\\n\\n\\t\\treturn 1;\\n\\n\\t}\\n\\n\\n\\n // if the target is building something near our base something is fishy\\n\\n BWAPI::Position ourBasePosition = BWAPI::Position(InformationManager::Instance().getMyMainBaseLocation()->getPosition());\\n\\n\\tif (target->getDistance(ourBasePosition) < 1200) {\\n\\n\\t\\tif (target->getType().isWorker() && (target->isConstructing() || target->isRepairing()))\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn 12;\\n\\n\\t\\t}\\n\\n\\t\\tif (target->getType().isBuilding())\\n\",\n \"file_path\": \"Source/MicroRanged.cpp\",\n \"rank\": 38,\n \"score\": 46374.821599824456\n },\n {\n \"content\": \"#include \\\"Common.h\\\"\\n\\n#include \\\"UnitData.h\\\"\\n\\n\\n\\nusing namespace XBot;\\n\\n\\n\\nUnitData::UnitData() \\n\\n\\t: mineralsLost(0)\\n\\n\\t, gasLost(0)\\n\\n{\\n\\n\\tint maxTypeID(0);\\n\\n\\tfor (const BWAPI::UnitType & t : BWAPI::UnitTypes::allUnitTypes())\\n\\n\\t{\\n\\n\\t\\tmaxTypeID = maxTypeID > t.getID() ? maxTypeID : t.getID();\\n\\n\\t}\\n\\n\\n\\n\\tnumUnits\\t\\t= std::vector<int>(maxTypeID + 1, 0);\\n\\n\\tnumDeadUnits\\t= std::vector<int>(maxTypeID + 1, 0);\\n\\n}\\n\\n\\n\\nvoid UnitData::updateUnit(BWAPI::Unit unit)\\n\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 49,\n \"score\": 46354.27581661133\n },\n {\n \"content\": \"{\\n\\n\\tif (!unit) { return; }\\n\\n\\n\\n bool firstSeen = false;\\n\\n auto & it = unitMap.find(unit);\\n\\n if (it == unitMap.end())\\n\\n {\\n\\n firstSeen = true;\\n\\n unitMap[unit] = UnitInfo();\\n\\n }\\n\\n \\n\\n\\tUnitInfo & ui = unitMap[unit];\\n\\n ui.unit = unit;\\n\\n\\tui.updateFrame\\t= BWAPI::Broodwar->getFrameCount();\\n\\n ui.player = unit->getPlayer();\\n\\n\\tui.lastPosition = unit->getPosition();\\n\\n\\tui.lastTilePosition = unit->getTilePosition();\\n\\n\\tui.lastHealth = unit->getHitPoints();\\n\\n ui.lastShields = unit->getShields();\\n\\n\\tui.unitID = unit->getID();\\n\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 56,\n \"score\": 46344.66420100084\n },\n {\n \"content\": \"const bool UnitData::badUnitInfo(const UnitInfo & ui) const\\n\\n{\\n\\n if (!ui.unit)\\n\\n {\\n\\n return false;\\n\\n }\\n\\n\\n\\n\\t// Cull away any refineries/assimilators/extractors that were destroyed and reverted to vespene geysers\\n\\n\\tif (ui.unit->getType() == BWAPI::UnitTypes::Resource_Vespene_Geyser)\\n\\n\\t{ \\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\t// If the unit is a building and we can currently see its position and it is not there.\\n\\n\\t// NOTE A terran building could have lifted off and moved away.\\n\\n\\tif (ui.type.isBuilding() && BWAPI::Broodwar->isVisible(ui.lastPosition.x/32, ui.lastPosition.y/32) && !ui.unit->isVisible())\\n\\n\\t{\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 57,\n \"score\": 46344.431224355074\n },\n {\n \"content\": \"\\t// NOTE This assert fails, so the unit counts cannot be trusted. :-(\\n\\n\\t// UAB_ASSERT(numUnits[unit->getType().getID()] >= 0, \\\"negative units\\\");\\n\\n}\\n\\n\\n\\nvoid UnitData::removeBadUnits()\\n\\n{\\n\\n\\tfor (auto iter(unitMap.begin()); iter != unitMap.end();)\\n\\n\\t{\\n\\n\\t\\tif (badUnitInfo(iter->second))\\n\\n\\t\\t{\\n\\n\\t\\t\\tnumUnits[iter->second.type.getID()]--;\\n\\n\\t\\t\\titer = unitMap.erase(iter);\\n\\n\\t\\t}\\n\\n\\t\\telse\\n\\n\\t\\t{\\n\\n\\t\\t\\titer++;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 59,\n \"score\": 46343.15368789241\n },\n {\n \"content\": \"\\treturn false;\\n\\n}\\n\\n\\n\\nint UnitData::getGasLost() const \\n\\n{ \\n\\n return gasLost; \\n\\n}\\n\\n\\n\\nint UnitData::getMineralsLost() const \\n\\n{ \\n\\n return mineralsLost; \\n\\n}\\n\\n\\n\\nint UnitData::getNumUnits(BWAPI::UnitType t) const \\n\\n{ \\n\\n return numUnits[t.getID()]; \\n\\n}\\n\\n\\n\\nint UnitData::getNumDeadUnits(BWAPI::UnitType t) const \\n\\n{ \\n\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 60,\n \"score\": 46342.91219198512\n },\n {\n \"content\": \"\\tui.type = unit->getType();\\n\\n ui.completed = unit->isCompleted();\\n\\n\\n\\n if (firstSeen)\\n\\n {\\n\\n numUnits[unit->getType().getID()]++;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid UnitData::removeUnit(BWAPI::Unit unit)\\n\\n{\\n\\n\\tif (!unit) { return; }\\n\\n\\n\\n\\tmineralsLost += unit->getType().mineralPrice();\\n\\n\\tgasLost += unit->getType().gasPrice();\\n\\n\\t--numUnits[unit->getType().getID()];\\n\\n\\t++numDeadUnits[unit->getType().getID()];\\n\\n\\t\\n\\n\\tunitMap.erase(unit);\\n\\n\\n\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 61,\n \"score\": 46338.30108266939\n },\n {\n \"content\": \" return numDeadUnits[t.getID()]; \\n\\n}\\n\\n\\n\\nconst std::map<BWAPI::Unit,UnitInfo> & UnitData::getUnits() const \\n\\n{ \\n\\n return unitMap; \\n\\n}\\n\\n\\n\\nconst UnitInfo * UnitData::getUnit(BWAPI::Unit unit) const\\n\\n{\\n\\n\\tif (unitMap.find(unit) != unitMap.end())\\n\\n\\t{\\n\\n\\t\\treturn &unitMap.at(unit);\\n\\n\\t}\\n\\n\\treturn nullptr;\\n\\n}\",\n \"file_path\": \"Source/UnitData.cpp\",\n \"rank\": 62,\n \"score\": 46336.63464265848\n },\n {\n \"content\": \"enum class ExtractorTrick { None, Start, ExtractorOrdered, UnitOrdered, MakeUnitBypass };\\n\\n\\n\",\n \"file_path\": \"Source/ProductionManager.h\",\n \"rank\": 63,\n \"score\": 44594.43919522029\n },\n {\n \"content\": \"class Double {\\n\\npublic:\\n\\n Double() {}\\n\\n Double(double d) : d_(d) {}\\n\\n Double(uint64_t u) : u_(u) {}\\n\\n\\n\\n double Value() const { return d_; }\\n\\n uint64_t Uint64Value() const { return u_; }\\n\\n\\n\\n double NextPositiveDouble() const {\\n\\n RAPIDJSON_ASSERT(!Sign());\\n\\n return Double(u_ + 1).Value();\\n\\n }\\n\\n\\n\\n bool Sign() const { return (u_ & kSignMask) != 0; }\\n\\n uint64_t Significand() const { return u_ & kSignificandMask; }\\n\\n int Exponent() const { return static_cast<int>(((u_ & kExponentMask) >> kSignificandSize) - kExponentBias); }\\n\\n\\n\\n bool IsNan() const { return (u_ & kExponentMask) == kExponentMask && Significand() != 0; }\\n\\n bool IsInf() const { return (u_ & kExponentMask) == kExponentMask && Significand() == 0; }\\n\",\n \"file_path\": \"Source/rapidjson/internal/ieee754.h\",\n \"rank\": 64,\n \"score\": 44507.477484396084\n },\n {\n \"content\": \"class UnitToAssign\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tBWAPI::Unit unit;\\n\\n\\tbool isAssigned;\\n\\n\\n\\n\\tUnitToAssign(BWAPI::Unit u)\\n\\n\\t{\\n\\n\\t\\tunit = u;\\n\\n\\t\\tisAssigned = false;\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Source/GameCommander.h\",\n \"rank\": 65,\n \"score\": 44411.32461346539\n },\n {\n \"content\": \" class NumberStream<InputStream, true> : public NumberStream<InputStream, false> {\\n\\n typedef NumberStream<InputStream, false> Base;\\n\\n public:\\n\\n NumberStream(GenericReader& reader, InputStream& is) : NumberStream<InputStream, false>(reader, is), stackStream(reader.stack_) {}\\n\\n ~NumberStream() {}\\n\\n\\n\\n RAPIDJSON_FORCEINLINE Ch TakePush() {\\n\\n stackStream.Put((char)Base::is.Peek());\\n\\n return Base::is.Take();\\n\\n }\\n\\n\\n\\n size_t Length() { return stackStream.Length(); }\\n\\n\\n\\n const char* Pop() {\\n\\n stackStream.Put('\\\\0');\\n\\n return stackStream.Pop();\\n\\n }\\n\\n\\n\\n private:\\n\\n StackStream<char> stackStream;\\n\",\n \"file_path\": \"Source/rapidjson/reader.h\",\n \"rank\": 66,\n \"score\": 43366.10040762825\n },\n {\n \"content\": \"class Area : public utils::Markable<Area, int>, public utils::UserData\\n\\n{\\n\\npublic:\\n\\n\\ttypedef int16_t\\t\\t\\t\\t\\tid;\\n\\n\\n\\n\\ttypedef int16_t\\t\\t\\t\\t\\tgroupId;\\n\\n\\n\\n\\t// Unique id > 0 of this Area. Range = 1 .. Map::Areas().size()\\n\\n\\t// this == Map::GetArea(Id())\\n\\n\\t// Id() == Map::GetMiniTile(w).AreaId() for each walkable MiniTile w in this Area.\\n\\n\\t// Area::ids are guaranteed to remain unchanged.\\n\\n\\tid\\t\\t\\t\\t\\t\\t\\t\\tId() const\\t\\t\\t\\t\\t\\t{ return m_id; }\\n\\n\\n\\n\\t// Unique id > 0 of the group of Areas which are accessible from this Area.\\n\\n\\t// For each pair (a, b) of Areas: a->GroupId() == b->GroupId() <==> a->AccessibleFrom(b)\\n\\n\\t// A groupId uniquely identifies a maximum set of mutually accessible Areas, that is, in the absence of blocking ChokePoints, a continent.\\n\\n\\tgroupId\\t\\t\\t\\t\\t\\t\\tGroupId() const\\t\\t\\t\\t\\t{ return m_groupId; }\\n\\n\\n\\n\\t// Bounding box of this Area.\\n\\n\\tconst BWAPI::TilePosition &\\t\\tTopLeft() const\\t\\t\\t\\t\\t{ return m_topLeft ; }\\n\",\n \"file_path\": \"Source/bwem/area.h\",\n \"rank\": 67,\n \"score\": 42569.428153901914\n },\n {\n \"content\": \"class Tile : public utils::Markable<Tile, int>, public utils::UserData\\n\\n{\\n\\npublic:\\n\\n\\t// Corresponds to BWAPI::isBuildable\\n\\n\\t// Note: BWEM enforces the relation buildable ==> walkable (Cf. MiniTile::Walkable)\\n\\n\\tbool\\t\\t\\t\\tBuildable() const\\t\\t\\t\\t{ return m_bits.buildable; }\\n\\n\\n\\n\\t// Tile::AreaId() somewhat aggregates the MiniTile::AreaId() values of the 4 x 4 sub-MiniTiles.\\n\\n\\t// Let S be the set of MiniTile::AreaId() values for each walkable MiniTile in this Tile.\\n\\n\\t// If empty(S), returns 0. Note: in this case, no contained MiniTile is walkable, so all of them have their AreaId() == 0.\\n\\n\\t// If S = {a}, returns a (whether positive or negative).\\n\\n\\t// If size(S) > 1 returns -1 (note that -1 is never returned by MiniTile::AreaId()).\\n\\n\\tArea::id\\t\\t\\tAreaId() const\\t\\t\\t\\t\\t{ return m_areaId; }\\n\\n\\n\\n\\t// Tile::MinAltitude() somewhat aggregates the MiniTile::Altitude() values of the 4 x 4 sub-MiniTiles.\\n\\n\\t// Returns the minimum value.\\n\\n\\taltitude_t\\t\\t\\tMinAltitude() const\\t\\t\\t\\t{ return m_minAltitude; }\\n\\n\\n\\n\\t// Tells if at least one of the sub-MiniTiles is Walkable.\\n\\n\\tbool\\t\\t\\t\\tWalkable() const\\t\\t\\t\\t{ return m_areaId != 0; }\\n\",\n \"file_path\": \"Source/bwem/tiles.h\",\n \"rank\": 68,\n \"score\": 42569.428153901914\n },\n {\n \"content\": \"class AutoUTFOutputStream {\\n\\n RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);\\n\\npublic:\\n\\n typedef CharType Ch;\\n\\n\\n\\n //! Constructor.\\n\\n /*!\\n\\n \\\\param os output stream to be wrapped.\\n\\n \\\\param type UTF encoding type.\\n\\n \\\\param putBOM Whether to write BOM at the beginning of the stream.\\n\\n */\\n\\n AutoUTFOutputStream(OutputByteStream& os, UTFType type, bool putBOM) : os_(&os), type_(type) {\\n\\n RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE);\\n\\n\\n\\n // Runtime check whether the size of character type is sufficient. It only perform checks with assertion.\\n\\n if (type_ == kUTF16LE || type_ == kUTF16BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 2);\\n\\n if (type_ == kUTF32LE || type_ == kUTF32BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 4);\\n\\n\\n\\n static const PutFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Put) };\\n\\n putFunc_ = f[type_];\\n\",\n \"file_path\": \"Source/rapidjson/encodedstream.h\",\n \"rank\": 69,\n \"score\": 41109.2264147653\n },\n {\n \"content\": \"class AutoUTFInputStream {\\n\\n RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);\\n\\npublic:\\n\\n typedef CharType Ch;\\n\\n\\n\\n //! Constructor.\\n\\n /*!\\n\\n \\\\param is input stream to be wrapped.\\n\\n \\\\param type UTF encoding type if it is not detected from the stream.\\n\\n */\\n\\n AutoUTFInputStream(InputByteStream& is, UTFType type = kUTF8) : is_(&is), type_(type), hasBOM_(false) {\\n\\n RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE); \\n\\n DetectType();\\n\\n static const TakeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Take) };\\n\\n takeFunc_ = f[type_];\\n\\n current_ = takeFunc_(*is_);\\n\\n }\\n\\n\\n\\n UTFType GetType() const { return type_; }\\n\\n bool HasBOM() const { return hasBOM_; }\\n\",\n \"file_path\": \"Source/rapidjson/encodedstream.h\",\n \"rank\": 70,\n \"score\": 41109.2264147653\n },\n {\n \"content\": \"enum class MacroCommandType\\n\\n\\t{ None\\n\\n\\t, Scout\\n\\n\\t, ScoutIfNeeded\\n\\n\\t, ScoutLocation\\n\\n\\t, StartGas\\n\\n\\t, StopGas\\n\\n\\t, GasUntil\\n\\n\\t, StealGas\\n\\n\\t, ExtractorTrickDrone\\n\\n\\t, ExtractorTrickZergling\\n\\n\\t, Aggressive\\n\\n\\t, Defensive\\n\\n\\t, PullWorkers\\n\\n\\t, PullWorkersLeaving\\n\\n\\t, ReleaseWorkers\\n\\n\\t, UntilFindEnemy\\n\\n\\t, DroneEnemyNatural\\n\\n\\t, IgnoreScoutWorker\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Source/MacroCommand.h\",\n \"rank\": 71,\n \"score\": 41106.65276351931\n },\n {\n \"content\": \"class ChokePoint : public utils::Markable<ChokePoint, int>, public utils::UserData\\n\\n{\\n\\npublic:\\n\\n\\t// ChokePoint::middle denotes the \\\"middle\\\" MiniTile of Geometry(), while\\n\\n\\t// ChokePoint::end1 and ChokePoint::end2 denote its \\\"ends\\\".\\n\\n\\t// It is guaranteed that, among all the MiniTiles of Geometry(), ChokePoint::middle has the highest altitude value (Cf. MiniTile::Altitude()).\\n\\n\\tenum node {end1, middle, end2, node_count};\\n\\n\\n\\n\\t// Type of all the Paths used in BWEM (Cf. Map::GetPath).\\n\\n\\t// See also the typedef CPPath.\\n\\n\\ttypedef std::vector<const ChokePoint *> Path;\\n\\n\\n\\n\\t// Tells whether this ChokePoint is a pseudo ChokePoint, i.e., it was created on top of a blocking Neutral.\\n\\n\\tbool\\t\\t\\t\\t\\t\\t\\t\\t\\tIsPseudo() const\\t\\t{ return m_pseudo; }\\n\\n\\n\\n\\t// Returns the two Areas of this ChokePoint.\\n\\n\\tconst std::pair<const Area *, const Area *> & GetAreas() const\\t{ return m_Areas; }\\n\\n\\n\\n\\t// Returns the center of this ChokePoint.\\n\\n\\tconst BWAPI::WalkPosition &\\t\\t\\t\\tCenter() const\\t\\t\\t{ return Pos(middle); }\\n\",\n \"file_path\": \"Source/bwem/cp.h\",\n \"rank\": 72,\n \"score\": 40613.45464539064\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\",\n \"file_path\": \"Source/rapidjson/rapidjson.h\",\n \"rank\": 73,\n \"score\": 39602.820891650474\n },\n {\n \"content\": \"struct IsGenericValueImpl : FalseType {};\\n\\n\\n\\n// select candidates according to nested encoding and allocator types\\n\\ntemplate <typename T> struct IsGenericValueImpl<T, typename Void<typename T::EncodingType>::Type, typename Void<typename T::AllocatorType>::Type>\\n\\n : IsBaseOf<GenericValue<typename T::EncodingType, typename T::AllocatorType>, T>::Type {};\\n\\n\\n\\n// helper to match arbitrary GenericValue instantiations, including derived classes\\n\\ntemplate <typename T> struct IsGenericValue : IsGenericValueImpl<T>::Type {};\\n\\n\\n\\n} // namespace internal\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// GenericValue\\n\\n\\n\\n//! Represents a JSON value. Use Value for UTF8 encoding and default allocator.\\n\\n/*!\\n\\n A JSON value can be one of 7 types. This class is a variant type supporting\\n\\n these types.\\n\\n\\n\\n Use the Value if UTF8 and default allocator\\n\\n\\n\\n \\\\tparam Encoding Encoding of the value. (Even non-string values need to have the same encoding in a document)\\n\\n \\\\tparam Allocator Allocator type for allocating memory of object, array and string.\\n\\n*/\\n\\ntemplate <typename Encoding, typename Allocator = MemoryPoolAllocator<> > \\n\",\n \"file_path\": \"Source/rapidjson/document.h\",\n \"rank\": 74,\n \"score\": 39595.06440173808\n },\n {\n \"content\": \"int GetIntFromString(const std::string & s);\\n\",\n \"file_path\": \"Source/Common.h\",\n \"rank\": 75,\n \"score\": 38212.563502770114\n },\n {\n \"content\": \"#define _USE_MATH_DEFINES\\n\",\n \"file_path\": \"Source/Common.h\",\n \"rank\": 76,\n \"score\": 38193.09348343703\n },\n {\n \"content\": \" double ToDouble() const {\\n\\n union {\\n\\n double d;\\n\\n uint64_t u64;\\n\\n }u;\\n\\n const uint64_t be = (e == kDpDenormalExponent && (f & kDpHiddenBit) == 0) ? 0 : \\n\\n static_cast<uint64_t>(e + kDpExponentBias);\\n\\n u.u64 = (f & kDpSignificandMask) | (be << kDpSignificandSize);\\n\\n return u.d;\\n\",\n \"file_path\": \"Source/rapidjson/internal/diyfp.h\",\n \"rank\": 77,\n \"score\": 38193.09348343703\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// Encoding\\n\\n\\n\\n/*! \\\\class rapidjson::Encoding\\n\\n \\\\brief Concept for encoding of Unicode characters.\\n\\n\\n\\n\\\\code\\n\\nconcept Encoding {\\n\\n typename Ch; //! Type of character. A \\\"character\\\" is actually a code unit in unicode's definition.\\n\\n\\n\\n enum { supportUnicode = 1 }; // or 0 if not supporting unicode\\n\\n\\n\\n //! \\\\brief Encode a Unicode codepoint to an output stream.\\n\\n //! \\\\param os Output stream.\\n\\n //! \\\\param codepoint An unicode codepoint, ranging from 0x0 to 0x10FFFF inclusively.\\n\\n template<typename OutputStream>\\n\\n static void Encode(OutputStream& os, unsigned codepoint);\\n\\n\\n\\n //! \\\\brief Decode a Unicode codepoint from an input stream.\\n\\n //! \\\\param is Input stream.\\n\\n //! \\\\param codepoint Output of the unicode codepoint.\\n\\n //! \\\\return true if a valid codepoint can be decoded from the stream.\\n\\n template <typename InputStream>\\n\\n static bool Decode(InputStream& is, unsigned* codepoint);\\n\\n\\n\\n //! \\\\brief Validate one Unicode codepoint from an encoded stream.\\n\\n //! \\\\param is Input stream to obtain codepoint.\\n\\n //! \\\\param os Output for copying one codepoint.\\n\\n //! \\\\return true if it is valid.\\n\\n //! \\\\note This function just validating and copying the codepoint without actually decode it.\\n\\n template <typename InputStream, typename OutputStream>\\n\\n static bool Validate(InputStream& is, OutputStream& os);\\n\\n\\n\\n // The following functions are deal with byte streams.\\n\\n\\n\\n //! Take a character from input byte stream, skip BOM if exist.\\n\\n template <typename InputByteStream>\\n\\n static CharType TakeBOM(InputByteStream& is);\\n\\n\\n\\n //! Take a character from input byte stream.\\n\\n template <typename InputByteStream>\\n\\n static Ch Take(InputByteStream& is);\\n\\n\\n\\n //! Put BOM to output byte stream.\\n\\n template <typename OutputByteStream>\\n\\n static void PutBOM(OutputByteStream& os);\\n\\n\\n\\n //! Put a character to output byte stream.\\n\\n template <typename OutputByteStream>\\n\\n static void Put(OutputByteStream& os, Ch c);\\n\\n};\\n\\n\\\\endcode\\n\\n*/\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// UTF8\\n\\n\\n\\n//! UTF-8 encoding.\\n\\n/*! http://en.wikipedia.org/wiki/UTF-8\\n\\n http://tools.ietf.org/html/rfc3629\\n\\n \\\\tparam CharType Code unit for storing 8-bit UTF-8 data. Default is char.\\n\\n \\\\note implements Encoding concept\\n\\n*/\\n\\ntemplate<typename CharType = char>\\n\\nstruct UTF8 {\\n\\n typedef CharType Ch;\\n\\n\\n\\n enum { supportUnicode = 1 };\\n\\n\\n\\n template<typename OutputStream>\\n\\n static void Encode(OutputStream& os, unsigned codepoint) {\\n\\n if (codepoint <= 0x7F) \\n\\n os.Put(static_cast<Ch>(codepoint & 0xFF));\\n\\n else if (codepoint <= 0x7FF) {\\n\\n os.Put(static_cast<Ch>(0xC0 | ((codepoint >> 6) & 0xFF)));\\n\\n os.Put(static_cast<Ch>(0x80 | ((codepoint & 0x3F))));\\n\\n }\\n\\n else if (codepoint <= 0xFFFF) {\\n\\n os.Put(static_cast<Ch>(0xE0 | ((codepoint >> 12) & 0xFF)));\\n\\n os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));\\n\\n os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));\\n\\n }\\n\\n else {\\n\\n RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);\\n\\n os.Put(static_cast<Ch>(0xF0 | ((codepoint >> 18) & 0xFF)));\\n\\n os.Put(static_cast<Ch>(0x80 | ((codepoint >> 12) & 0x3F)));\\n\\n os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));\\n\\n os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));\\n\\n }\\n\",\n \"file_path\": \"Source/rapidjson/encodings.h\",\n \"rank\": 78,\n \"score\": 38190.70239726967\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\n//! Computes integer powers of 10 in double (10.0^n).\\n\\n/*! This function uses lookup table for fast and accurate results.\\n\\n \\\\param n non-negative exponent. Must <= 308.\\n\\n \\\\return 10.0^n\\n\\n*/\\n\\ninline double Pow10(int n) {\\n\\n static const double e[] = { // 1e-0...1e308: 309 * 8 bytes = 2472 bytes\\n\\n 1e+0, \\n\\n 1e+1, 1e+2, 1e+3, 1e+4, 1e+5, 1e+6, 1e+7, 1e+8, 1e+9, 1e+10, 1e+11, 1e+12, 1e+13, 1e+14, 1e+15, 1e+16, 1e+17, 1e+18, 1e+19, 1e+20, \\n\\n 1e+21, 1e+22, 1e+23, 1e+24, 1e+25, 1e+26, 1e+27, 1e+28, 1e+29, 1e+30, 1e+31, 1e+32, 1e+33, 1e+34, 1e+35, 1e+36, 1e+37, 1e+38, 1e+39, 1e+40,\\n\\n 1e+41, 1e+42, 1e+43, 1e+44, 1e+45, 1e+46, 1e+47, 1e+48, 1e+49, 1e+50, 1e+51, 1e+52, 1e+53, 1e+54, 1e+55, 1e+56, 1e+57, 1e+58, 1e+59, 1e+60,\\n\\n 1e+61, 1e+62, 1e+63, 1e+64, 1e+65, 1e+66, 1e+67, 1e+68, 1e+69, 1e+70, 1e+71, 1e+72, 1e+73, 1e+74, 1e+75, 1e+76, 1e+77, 1e+78, 1e+79, 1e+80,\\n\\n 1e+81, 1e+82, 1e+83, 1e+84, 1e+85, 1e+86, 1e+87, 1e+88, 1e+89, 1e+90, 1e+91, 1e+92, 1e+93, 1e+94, 1e+95, 1e+96, 1e+97, 1e+98, 1e+99, 1e+100,\\n\\n 1e+101,1e+102,1e+103,1e+104,1e+105,1e+106,1e+107,1e+108,1e+109,1e+110,1e+111,1e+112,1e+113,1e+114,1e+115,1e+116,1e+117,1e+118,1e+119,1e+120,\\n\\n 1e+121,1e+122,1e+123,1e+124,1e+125,1e+126,1e+127,1e+128,1e+129,1e+130,1e+131,1e+132,1e+133,1e+134,1e+135,1e+136,1e+137,1e+138,1e+139,1e+140,\\n\\n 1e+141,1e+142,1e+143,1e+144,1e+145,1e+146,1e+147,1e+148,1e+149,1e+150,1e+151,1e+152,1e+153,1e+154,1e+155,1e+156,1e+157,1e+158,1e+159,1e+160,\\n\\n 1e+161,1e+162,1e+163,1e+164,1e+165,1e+166,1e+167,1e+168,1e+169,1e+170,1e+171,1e+172,1e+173,1e+174,1e+175,1e+176,1e+177,1e+178,1e+179,1e+180,\\n\\n 1e+181,1e+182,1e+183,1e+184,1e+185,1e+186,1e+187,1e+188,1e+189,1e+190,1e+191,1e+192,1e+193,1e+194,1e+195,1e+196,1e+197,1e+198,1e+199,1e+200,\\n\\n 1e+201,1e+202,1e+203,1e+204,1e+205,1e+206,1e+207,1e+208,1e+209,1e+210,1e+211,1e+212,1e+213,1e+214,1e+215,1e+216,1e+217,1e+218,1e+219,1e+220,\\n\\n 1e+221,1e+222,1e+223,1e+224,1e+225,1e+226,1e+227,1e+228,1e+229,1e+230,1e+231,1e+232,1e+233,1e+234,1e+235,1e+236,1e+237,1e+238,1e+239,1e+240,\\n\\n 1e+241,1e+242,1e+243,1e+244,1e+245,1e+246,1e+247,1e+248,1e+249,1e+250,1e+251,1e+252,1e+253,1e+254,1e+255,1e+256,1e+257,1e+258,1e+259,1e+260,\\n\\n 1e+261,1e+262,1e+263,1e+264,1e+265,1e+266,1e+267,1e+268,1e+269,1e+270,1e+271,1e+272,1e+273,1e+274,1e+275,1e+276,1e+277,1e+278,1e+279,1e+280,\\n\\n 1e+281,1e+282,1e+283,1e+284,1e+285,1e+286,1e+287,1e+288,1e+289,1e+290,1e+291,1e+292,1e+293,1e+294,1e+295,1e+296,1e+297,1e+298,1e+299,1e+300,\\n\\n 1e+301,1e+302,1e+303,1e+304,1e+305,1e+306,1e+307,1e+308\\n\\n };\\n\\n RAPIDJSON_ASSERT(n >= 0 && n <= 308);\\n\\n return e[n];\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/rapidjson/internal/pow10.h\",\n \"rank\": 79,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\n#ifdef __GNUC__\\n\\nRAPIDJSON_DIAG_PUSH\\n\\nRAPIDJSON_DIAG_OFF(effc++)\\n\\n#endif\\n\\n\\n\\ninline void GrisuRound(char* buffer, int len, uint64_t delta, uint64_t rest, uint64_t ten_kappa, uint64_t wp_w) {\\n\\n while (rest < wp_w && delta - rest >= ten_kappa &&\\n\\n (rest + ten_kappa < wp_w || /// closer\\n\\n wp_w - rest > rest + ten_kappa - wp_w)) {\\n\\n buffer[len - 1]--;\\n\\n rest += ten_kappa;\\n\\n }\\n\\n}\\n\\n\\n\\ninline unsigned CountDecimalDigit32(uint32_t n) {\\n\\n // Simple pure C++ implementation was faster than __builtin_clz version in this situation.\\n\\n if (n < 10) return 1;\\n\\n if (n < 100) return 2;\\n\\n if (n < 1000) return 3;\\n\\n if (n < 10000) return 4;\\n\\n if (n < 100000) return 5;\\n\\n if (n < 1000000) return 6;\\n\\n if (n < 10000000) return 7;\\n\\n if (n < 100000000) return 8;\\n\\n // Will not reach 10 digits in DigitGen()\\n\\n //if (n < 1000000000) return 9;\\n\\n //return 10;\\n\\n return 9;\\n\\n}\\n\\n\\n\\ninline void DigitGen(const DiyFp& W, const DiyFp& Mp, uint64_t delta, char* buffer, int* len, int* K) {\\n\\n static const uint32_t kPow10[] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 };\\n\\n const DiyFp one(uint64_t(1) << -Mp.e, Mp.e);\\n\\n const DiyFp wp_w = Mp - W;\\n\\n uint32_t p1 = static_cast<uint32_t>(Mp.f >> -one.e);\\n\\n uint64_t p2 = Mp.f & (one.f - 1);\\n\\n int kappa = CountDecimalDigit32(p1); // kappa in [0, 9]\\n\\n *len = 0;\\n\\n\\n\\n while (kappa > 0) {\\n\\n uint32_t d = 0;\\n\\n switch (kappa) {\\n\\n case 9: d = p1 / 100000000; p1 %= 100000000; break;\\n\\n case 8: d = p1 / 10000000; p1 %= 10000000; break;\\n\\n case 7: d = p1 / 1000000; p1 %= 1000000; break;\\n\\n case 6: d = p1 / 100000; p1 %= 100000; break;\\n\\n case 5: d = p1 / 10000; p1 %= 10000; break;\\n\\n case 4: d = p1 / 1000; p1 %= 1000; break;\\n\\n case 3: d = p1 / 100; p1 %= 100; break;\\n\\n case 2: d = p1 / 10; p1 %= 10; break;\\n\\n case 1: d = p1; p1 = 0; break;\\n\\n default:;\\n\\n }\\n\\n if (d || *len)\\n\\n buffer[(*len)++] = static_cast<char>('0' + static_cast<char>(d));\\n\\n kappa--;\\n\\n uint64_t tmp = (static_cast<uint64_t>(p1) << -one.e) + p2;\\n\\n if (tmp <= delta) {\\n\\n *K += kappa;\\n\\n GrisuRound(buffer, *len, delta, tmp, static_cast<uint64_t>(kPow10[kappa]) << -one.e, wp_w.f);\\n\\n return;\\n\\n }\\n\\n }\\n\\n\\n\\n // kappa = 0\\n\\n for (;;) {\\n\\n p2 *= 10;\\n\\n delta *= 10;\\n\\n char d = static_cast<char>(p2 >> -one.e);\\n\\n if (d || *len)\\n\\n buffer[(*len)++] = static_cast<char>('0' + d);\\n\\n p2 &= one.f - 1;\\n\\n kappa--;\\n\\n if (p2 < delta) {\\n\\n *K += kappa;\\n\\n GrisuRound(buffer, *len, delta, p2, one.f, wp_w.f * kPow10[-kappa]);\\n\\n return;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\ninline void Grisu2(double value, char* buffer, int* length, int* K) {\\n\\n const DiyFp v(value);\\n\\n DiyFp w_m, w_p;\\n\\n v.NormalizedBoundaries(&w_m, &w_p);\\n\\n\\n\\n const DiyFp c_mk = GetCachedPower(w_p.e, K);\\n\\n const DiyFp W = v.Normalize() * c_mk;\\n\\n DiyFp Wp = w_p * c_mk;\\n\\n DiyFp Wm = w_m * c_mk;\\n\\n Wm.f++;\\n\\n Wp.f--;\\n\\n DigitGen(W, Wp, Wp.f - Wm.f, buffer, length, K);\\n\\n}\\n\\n\\n\\ninline char* WriteExponent(int K, char* buffer) {\\n\\n if (K < 0) {\\n\\n *buffer++ = '-';\\n\\n K = -K;\\n\\n }\\n\\n\\n\\n if (K >= 100) {\\n\\n *buffer++ = static_cast<char>('0' + static_cast<char>(K / 100));\\n\\n K %= 100;\\n\\n const char* d = GetDigitsLut() + K * 2;\\n\\n *buffer++ = d[0];\\n\\n *buffer++ = d[1];\\n\\n }\\n\\n else if (K >= 10) {\\n\\n const char* d = GetDigitsLut() + K * 2;\\n\\n *buffer++ = d[0];\\n\\n *buffer++ = d[1];\\n\\n }\\n\\n else\\n\\n *buffer++ = static_cast<char>('0' + static_cast<char>(K));\\n\\n\\n\\n return buffer;\\n\\n}\\n\\n\\n\\ninline char* Prettify(char* buffer, int length, int k) {\\n\\n const int kk = length + k; // 10^(kk-1) <= v < 10^kk\\n\\n\\n\\n if (length <= kk && kk <= 21) {\\n\\n // 1234e7 -> 12340000000\\n\\n for (int i = length; i < kk; i++)\\n\\n buffer[i] = '0';\\n\\n buffer[kk] = '.';\\n\\n buffer[kk + 1] = '0';\\n\\n return &buffer[kk + 2];\\n\\n }\\n\\n else if (0 < kk && kk <= 21) {\\n\\n // 1234e-2 -> 12.34\\n\\n std::memmove(&buffer[kk + 1], &buffer[kk], length - kk);\\n\\n buffer[kk] = '.';\\n\\n return &buffer[length + 1];\\n\\n }\\n\\n else if (-6 < kk && kk <= 0) {\\n\\n // 1234e-6 -> 0.001234\\n\\n const int offset = 2 - kk;\\n\\n std::memmove(&buffer[offset], &buffer[0], length);\\n\\n buffer[0] = '0';\\n\\n buffer[1] = '.';\\n\\n for (int i = 2; i < offset; i++)\\n\\n buffer[i] = '0';\\n\\n return &buffer[length + offset];\\n\\n }\\n\\n else if (length == 1) {\\n\\n // 1e30\\n\\n buffer[1] = 'e';\\n\\n return WriteExponent(kk - 1, &buffer[2]);\\n\\n }\\n\\n else {\\n\\n // 1234e30 -> 1.234e33\\n\\n std::memmove(&buffer[2], &buffer[1], length - 1);\\n\\n buffer[1] = '.';\\n\\n buffer[length + 1] = 'e';\\n\\n return WriteExponent(kk - 1, &buffer[0 + length + 2]);\\n\\n }\\n\\n}\\n\\n\\n\\ninline char* dtoa(double value, char* buffer) {\\n\\n Double d(value);\\n\\n if (d.IsZero()) {\\n\\n if (d.Sign())\\n\\n *buffer++ = '-'; // -0.0, Issue #289\\n\\n buffer[0] = '0';\\n\\n buffer[1] = '.';\\n\\n buffer[2] = '0';\\n\\n return &buffer[3];\\n\\n }\\n\\n else {\\n\\n if (value < 0) {\\n\\n *buffer++ = '-';\\n\\n value = -value;\\n\\n }\\n\\n int length, K;\\n\\n Grisu2(value, buffer, &length, &K);\\n\\n return Prettify(buffer, length, K);\\n\\n }\\n\\n}\\n\\n\\n\\n#ifdef __GNUC__\\n\\nRAPIDJSON_DIAG_POP\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Source/rapidjson/internal/dtoa.h\",\n \"rank\": 80,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\ninline double FastPath(double significand, int exp) {\\n\\n if (exp < -308)\\n\\n return 0.0;\\n\\n else if (exp >= 0)\\n\\n return significand * internal::Pow10(exp);\\n\\n else\\n\\n return significand / internal::Pow10(-exp);\\n\\n}\\n\\n\\n\\ninline double StrtodNormalPrecision(double d, int p) {\\n\\n if (p < -308) {\\n\\n // Prevent expSum < -308, making Pow10(p) = 0\\n\\n d = FastPath(d, -308);\\n\\n d = FastPath(d, p + 308);\\n\\n }\\n\\n else\\n\\n d = FastPath(d, p);\\n\\n return d;\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline T Min3(T a, T b, T c) {\\n\\n T m = a;\\n\\n if (m > b) m = b;\\n\\n if (m > c) m = c;\\n\\n return m;\\n\\n}\\n\\n\\n\\ninline int CheckWithinHalfULP(double b, const BigInteger& d, int dExp) {\\n\\n const Double db(b);\\n\\n const uint64_t bInt = db.IntegerSignificand();\\n\\n const int bExp = db.IntegerExponent();\\n\\n const int hExp = bExp - 1;\\n\\n\\n\\n int dS_Exp2 = 0, dS_Exp5 = 0, bS_Exp2 = 0, bS_Exp5 = 0, hS_Exp2 = 0, hS_Exp5 = 0;\\n\\n\\n\\n // Adjust for decimal exponent\\n\\n if (dExp >= 0) {\\n\\n dS_Exp2 += dExp;\\n\\n dS_Exp5 += dExp;\\n\\n }\\n\\n else {\\n\\n bS_Exp2 -= dExp;\\n\\n bS_Exp5 -= dExp;\\n\\n hS_Exp2 -= dExp;\\n\\n hS_Exp5 -= dExp;\\n\\n }\\n\\n\\n\\n // Adjust for binary exponent\\n\\n if (bExp >= 0)\\n\\n bS_Exp2 += bExp;\\n\\n else {\\n\\n dS_Exp2 -= bExp;\\n\\n hS_Exp2 -= bExp;\\n\\n }\\n\\n\\n\\n // Adjust for half ulp exponent\\n\\n if (hExp >= 0)\\n\\n hS_Exp2 += hExp;\\n\\n else {\\n\\n dS_Exp2 -= hExp;\\n\\n bS_Exp2 -= hExp;\\n\\n }\\n\\n\\n\\n // Remove common power of two factor from all three scaled values\\n\\n int common_Exp2 = Min3(dS_Exp2, bS_Exp2, hS_Exp2);\\n\\n dS_Exp2 -= common_Exp2;\\n\\n bS_Exp2 -= common_Exp2;\\n\\n hS_Exp2 -= common_Exp2;\\n\\n\\n\\n BigInteger dS = d;\\n\\n dS.MultiplyPow5(dS_Exp5) <<= dS_Exp2;\\n\\n\\n\\n BigInteger bS(bInt);\\n\\n bS.MultiplyPow5(bS_Exp5) <<= bS_Exp2;\\n\\n\\n\\n BigInteger hS(1);\\n\\n hS.MultiplyPow5(hS_Exp5) <<= hS_Exp2;\\n\\n\\n\\n BigInteger delta(0);\\n\\n dS.Difference(bS, &delta);\\n\\n\\n\\n return delta.Compare(hS);\\n\\n}\\n\\n\\n\\ninline bool StrtodFast(double d, int p, double* result) {\\n\\n // Use fast path for string-to-double conversion if possible\\n\\n // see http://www.exploringbinary.com/fast-path-decimal-to-floating-point-conversion/\\n\\n if (p > 22 && p < 22 + 16) {\\n\\n // Fast Path Cases In Disguise\\n\\n d *= internal::Pow10(p - 22);\\n\\n p = 22;\\n\\n }\\n\\n\\n\\n if (p >= -22 && p <= 22 && d <= 9007199254740991.0) { // 2^53 - 1\\n\\n *result = FastPath(d, p);\\n\\n return true;\\n\\n }\\n\\n else\\n\\n return false;\\n\\n}\\n\\n\\n\\n// Compute an approximation and see if it is within 1/2 ULP\\n\\ninline bool StrtodDiyFp(const char* decimals, size_t length, size_t decimalPosition, int exp, double* result) {\\n\\n uint64_t significand = 0;\\n\\n size_t i = 0; // 2^64 - 1 = 18446744073709551615, 1844674407370955161 = 0x1999999999999999 \\n\\n for (; i < length; i++) {\\n\\n if (significand > RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) ||\\n\\n (significand == RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) && decimals[i] > '5'))\\n\\n break;\\n\\n significand = significand * 10 + (decimals[i] - '0');\\n\\n }\\n\\n \\n\\n if (i < length && decimals[i] >= '5') // Rounding\\n\\n significand++;\\n\\n\\n\\n size_t remaining = length - i;\\n\\n const unsigned kUlpShift = 3;\\n\\n const unsigned kUlp = 1 << kUlpShift;\\n\\n int error = (remaining == 0) ? 0 : kUlp / 2;\\n\\n\\n\\n DiyFp v(significand, 0);\\n\\n v = v.Normalize();\\n\\n error <<= -v.e;\\n\\n\\n\\n const int dExp = (int)decimalPosition - (int)i + exp;\\n\\n\\n\\n int actualExp;\\n\\n DiyFp cachedPower = GetCachedPower10(dExp, &actualExp);\\n\\n if (actualExp != dExp) {\\n\\n static const DiyFp kPow10[] = {\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0xa0000000, 00000000), -60), // 10^1\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0xc8000000, 00000000), -57), // 10^2\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0xfa000000, 00000000), -54), // 10^3\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0x9c400000, 00000000), -50), // 10^4\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0xc3500000, 00000000), -47), // 10^5\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0xf4240000, 00000000), -44), // 10^6\\n\\n DiyFp(RAPIDJSON_UINT64_C2(0x98968000, 00000000), -40) // 10^7\\n\\n };\\n\\n int adjustment = dExp - actualExp - 1;\\n\\n RAPIDJSON_ASSERT(adjustment >= 0 && adjustment < 7);\\n\\n v = v * kPow10[adjustment];\\n\\n if (length + adjustment > 19) // has more digits than decimal digits in 64-bit\\n\\n error += kUlp / 2;\\n\\n }\\n\\n\\n\\n v = v * cachedPower;\\n\\n\\n\\n error += kUlp + (error == 0 ? 0 : 1);\\n\\n\\n\\n const int oldExp = v.e;\\n\\n v = v.Normalize();\\n\\n error <<= oldExp - v.e;\\n\\n\\n\\n const unsigned effectiveSignificandSize = Double::EffectiveSignificandSize(64 + v.e);\\n\\n unsigned precisionSize = 64 - effectiveSignificandSize;\\n\\n if (precisionSize + kUlpShift >= 64) {\\n\\n unsigned scaleExp = (precisionSize + kUlpShift) - 63;\\n\\n v.f >>= scaleExp;\\n\\n v.e += scaleExp; \\n\\n error = (error >> scaleExp) + 1 + kUlp;\\n\\n precisionSize -= scaleExp;\\n\\n }\\n\\n\\n\\n DiyFp rounded(v.f >> precisionSize, v.e + precisionSize);\\n\\n const uint64_t precisionBits = (v.f & ((uint64_t(1) << precisionSize) - 1)) * kUlp;\\n\\n const uint64_t halfWay = (uint64_t(1) << (precisionSize - 1)) * kUlp;\\n\\n if (precisionBits >= halfWay + error) {\\n\\n rounded.f++;\\n\\n if (rounded.f & (DiyFp::kDpHiddenBit << 1)) { // rounding overflows mantissa (issue #340)\\n\\n rounded.f >>= 1;\\n\\n rounded.e++;\\n\\n }\\n\\n }\\n\\n\\n\\n *result = rounded.ToDouble();\\n\\n\\n\\n return halfWay - error >= precisionBits || precisionBits >= halfWay + error;\\n\\n}\\n\\n\\n\\ninline double StrtodBigInteger(double approx, const char* decimals, size_t length, size_t decimalPosition, int exp) {\\n\\n const BigInteger dInt(decimals, length);\\n\\n const int dExp = (int)decimalPosition - (int)length + exp;\\n\\n Double a(approx);\\n\\n int cmp = CheckWithinHalfULP(a.Value(), dInt, dExp);\\n\\n if (cmp < 0)\\n\\n return a.Value(); // within half ULP\\n\\n else if (cmp == 0) {\\n\\n // Round towards even\\n\\n if (a.Significand() & 1)\\n\\n return a.NextPositiveDouble();\\n\\n else\\n\\n return a.Value();\\n\\n }\\n\\n else // adjustment\\n\\n return a.NextPositiveDouble();\\n\\n}\\n\\n\\n\\ninline double StrtodFullPrecision(double d, int p, const char* decimals, size_t length, size_t decimalPosition, int exp) {\\n\\n RAPIDJSON_ASSERT(d >= 0.0);\\n\\n RAPIDJSON_ASSERT(length >= 1);\\n\\n\\n\\n double result;\\n\\n if (StrtodFast(d, p, &result))\\n\\n return result;\\n\\n\\n\\n // Trim leading zeros\\n\\n while (*decimals == '0' && length > 1) {\\n\\n length--;\\n\\n decimals++;\\n\\n decimalPosition--;\\n\\n }\\n\\n\\n\\n // Trim trailing zeros\\n\\n while (decimals[length - 1] == '0' && length > 1) {\\n\\n length--;\\n\\n decimalPosition--;\\n\\n exp++;\\n\\n }\\n\\n\\n\\n // Trim right-most digits\\n\\n const int kMaxDecimalDigit = 780;\\n\\n if ((int)length > kMaxDecimalDigit) {\\n\\n int delta = (int(length) - kMaxDecimalDigit);\\n\\n exp += delta;\\n\\n decimalPosition -= delta;\\n\\n length = kMaxDecimalDigit;\\n\\n }\\n\\n\\n\\n // If too small, underflow to zero\\n\\n if (int(length) + exp < -324)\\n\\n return 0.0;\\n\\n\\n\\n if (StrtodDiyFp(decimals, length, decimalPosition, exp, &result))\\n\\n return result;\\n\\n\\n\\n // Use approximation from StrtodDiyFp and make adjustment with BigInteger comparison\\n\\n return StrtodBigInteger(result, decimals, length, decimalPosition, exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/rapidjson/internal/strtod.h\",\n \"rank\": 81,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\n//! Custom strlen() which works on different character types.\\n\\n/*! \\\\tparam Ch Character type (e.g. char, wchar_t, short)\\n\\n \\\\param s Null-terminated input string.\\n\\n \\\\return Number of characters in the string. \\n\\n \\\\note This has the same semantics as strlen(), the return value is not number of Unicode codepoints.\\n\\n*/\\n\\ntemplate <typename Ch>\\n\\ninline SizeType StrLen(const Ch* s) {\\n\\n const Ch* p = s;\\n\\n while (*p) ++p;\\n\\n return SizeType(p - s);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/rapidjson/internal/strfunc.h\",\n \"rank\": 82,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\n// Helper to wrap/convert arbitrary types to void, useful for arbitrary type matching\\n\\ntemplate <typename T> struct Void { typedef void Type; };\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// BoolType, TrueType, FalseType\\n\\n//\\n\\ntemplate <bool Cond> struct BoolType {\\n\\n static const bool Value = Cond;\\n\\n typedef BoolType Type;\\n\\n};\\n\\ntypedef BoolType<true> TrueType;\\n\\ntypedef BoolType<false> FalseType;\\n\\n\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// SelectIf, BoolExpr, NotExpr, AndExpr, OrExpr\\n\\n//\\n\\n\\n\\ntemplate <bool C> struct SelectIfImpl { template <typename T1, typename T2> struct Apply { typedef T1 Type; }; };\\n\\ntemplate <> struct SelectIfImpl<false> { template <typename T1, typename T2> struct Apply { typedef T2 Type; }; };\\n\\ntemplate <bool C, typename T1, typename T2> struct SelectIfCond : SelectIfImpl<C>::template Apply<T1,T2> {};\\n\\ntemplate <typename C, typename T1, typename T2> struct SelectIf : SelectIfCond<C::Value, T1, T2> {};\\n\\n\\n\\ntemplate <bool Cond1, bool Cond2> struct AndExprCond : FalseType {};\\n\\ntemplate <> struct AndExprCond<true, true> : TrueType {};\\n\\ntemplate <bool Cond1, bool Cond2> struct OrExprCond : TrueType {};\\n\\ntemplate <> struct OrExprCond<false, false> : FalseType {};\\n\\n\\n\\ntemplate <typename C> struct BoolExpr : SelectIf<C,TrueType,FalseType>::Type {};\\n\\ntemplate <typename C> struct NotExpr : SelectIf<C,FalseType,TrueType>::Type {};\\n\\ntemplate <typename C1, typename C2> struct AndExpr : AndExprCond<C1::Value, C2::Value>::Type {};\\n\\ntemplate <typename C1, typename C2> struct OrExpr : OrExprCond<C1::Value, C2::Value>::Type {};\\n\\n\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// AddConst, MaybeAddConst, RemoveConst\\n\\ntemplate <typename T> struct AddConst { typedef const T Type; };\\n\\ntemplate <bool Constify, typename T> struct MaybeAddConst : SelectIfCond<Constify, const T, T> {};\\n\\ntemplate <typename T> struct RemoveConst { typedef T Type; };\\n\\ntemplate <typename T> struct RemoveConst<const T> { typedef T Type; };\\n\\n\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// IsSame, IsConst, IsMoreConst, IsPointer\\n\\n//\\n\\ntemplate <typename T, typename U> struct IsSame : FalseType {};\\n\\ntemplate <typename T> struct IsSame<T, T> : TrueType {};\\n\\n\\n\\ntemplate <typename T> struct IsConst : FalseType {};\\n\\ntemplate <typename T> struct IsConst<const T> : TrueType {};\\n\\n\\n\\ntemplate <typename CT, typename T>\\n\\nstruct IsMoreConst\\n\\n : AndExpr<IsSame<typename RemoveConst<CT>::Type, typename RemoveConst<T>::Type>,\\n\\n BoolType<IsConst<CT>::Value >= IsConst<T>::Value> >::Type {};\\n\\n\\n\\ntemplate <typename T> struct IsPointer : FalseType {};\\n\\ntemplate <typename T> struct IsPointer<T*> : TrueType {};\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// IsBaseOf\\n\\n//\\n\\n#if RAPIDJSON_HAS_CXX11_TYPETRAITS\\n\\n\\n\\ntemplate <typename B, typename D> struct IsBaseOf\\n\\n : BoolType< ::std::is_base_of<B,D>::value> {};\\n\\n\\n\\n#else // simplified version adopted from Boost\\n\\n\\n\\ntemplate<typename B, typename D> struct IsBaseOfImpl {\\n\\n RAPIDJSON_STATIC_ASSERT(sizeof(B) != 0);\\n\\n RAPIDJSON_STATIC_ASSERT(sizeof(D) != 0);\\n\\n\\n\\n typedef char (&Yes)[1];\\n\\n typedef char (&No) [2];\\n\\n\\n\\n template <typename T>\\n\\n static Yes Check(const D*, T);\\n\\n static No Check(const B*, int);\\n\\n\\n\\n struct Host {\\n\\n operator const B*() const;\\n\\n operator const D*();\\n\\n };\\n\\n\\n\\n enum { Value = (sizeof(Check(Host(), 0)) == sizeof(Yes)) };\\n\\n};\\n\\n\\n\\ntemplate <typename B, typename D> struct IsBaseOf\\n\\n : OrExpr<IsSame<B, D>, BoolExpr<IsBaseOfImpl<B, D> > >::Type {};\\n\\n\\n\\n#endif // RAPIDJSON_HAS_CXX11_TYPETRAITS\\n\\n\\n\\n\\n\\n//////////////////////////////////////////////////////////////////////////\\n\\n// EnableIf / DisableIf\\n\\n//\\n\\ntemplate <bool Condition, typename T = void> struct EnableIfCond { typedef T Type; };\\n\\ntemplate <typename T> struct EnableIfCond<false, T> { /* empty */ };\\n\\n\\n\\ntemplate <bool Condition, typename T = void> struct DisableIfCond { typedef T Type; };\\n\\ntemplate <typename T> struct DisableIfCond<true, T> { /* empty */ };\\n\\n\\n\\ntemplate <typename Condition, typename T = void>\\n\\nstruct EnableIf : EnableIfCond<Condition::Value, T> {};\\n\\n\\n\\ntemplate <typename Condition, typename T = void>\\n\\nstruct DisableIf : DisableIfCond<Condition::Value, T> {};\\n\\n\\n\\n// SFINAE helpers\\n\\nstruct SfinaeTag {};\\n\\ntemplate <typename T> struct RemoveSfinaeTag;\\n\",\n \"file_path\": \"Source/rapidjson/internal/meta.h\",\n \"rank\": 83,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\n#ifdef __GNUC__\\n\\nRAPIDJSON_DIAG_PUSH\\n\\nRAPIDJSON_DIAG_OFF(effc++)\\n\\n#endif\\n\\n\\n\\nstruct DiyFp {\\n\\n DiyFp() {}\\n\\n\\n\\n DiyFp(uint64_t fp, int exp) : f(fp), e(exp) {}\\n\\n\\n\\n explicit DiyFp(double d) {\\n\\n union {\\n\\n double d;\\n\\n uint64_t u64;\\n\\n } u = { d };\\n\\n\\n\\n int biased_e = static_cast<int>((u.u64 & kDpExponentMask) >> kDpSignificandSize);\\n\\n uint64_t significand = (u.u64 & kDpSignificandMask);\\n\\n if (biased_e != 0) {\\n\\n f = significand + kDpHiddenBit;\\n\\n e = biased_e - kDpExponentBias;\\n\\n } \\n\\n else {\\n\\n f = significand;\\n\\n e = kDpMinExponent + 1;\\n\\n }\\n\",\n \"file_path\": \"Source/rapidjson/internal/diyfp.h\",\n \"rank\": 84,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \"RAPIDJSON_NAMESPACE_BEGIN\\n\\nnamespace internal {\\n\\n\\n\\ninline const char* GetDigitsLut() {\\n\\n static const char cDigitsLut[200] = {\\n\\n '0','0','0','1','0','2','0','3','0','4','0','5','0','6','0','7','0','8','0','9',\\n\\n '1','0','1','1','1','2','1','3','1','4','1','5','1','6','1','7','1','8','1','9',\\n\\n '2','0','2','1','2','2','2','3','2','4','2','5','2','6','2','7','2','8','2','9',\\n\\n '3','0','3','1','3','2','3','3','3','4','3','5','3','6','3','7','3','8','3','9',\\n\\n '4','0','4','1','4','2','4','3','4','4','4','5','4','6','4','7','4','8','4','9',\\n\\n '5','0','5','1','5','2','5','3','5','4','5','5','5','6','5','7','5','8','5','9',\\n\\n '6','0','6','1','6','2','6','3','6','4','6','5','6','6','6','7','6','8','6','9',\\n\\n '7','0','7','1','7','2','7','3','7','4','7','5','7','6','7','7','7','8','7','9',\\n\\n '8','0','8','1','8','2','8','3','8','4','8','5','8','6','8','7','8','8','8','9',\\n\\n '9','0','9','1','9','2','9','3','9','4','9','5','9','6','9','7','9','8','9','9'\\n\\n };\\n\\n return cDigitsLut;\\n\\n}\\n\\n\\n\\ninline char* u32toa(uint32_t value, char* buffer) {\\n\\n const char* cDigitsLut = GetDigitsLut();\\n\\n\\n\\n if (value < 10000) {\\n\\n const uint32_t d1 = (value / 100) << 1;\\n\\n const uint32_t d2 = (value % 100) << 1;\\n\\n \\n\\n if (value >= 1000)\\n\\n *buffer++ = cDigitsLut[d1];\\n\\n if (value >= 100)\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n if (value >= 10)\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n }\\n\\n else if (value < 100000000) {\\n\\n // value = bbbbcccc\\n\\n const uint32_t b = value / 10000;\\n\\n const uint32_t c = value % 10000;\\n\\n \\n\\n const uint32_t d1 = (b / 100) << 1;\\n\\n const uint32_t d2 = (b % 100) << 1;\\n\\n \\n\\n const uint32_t d3 = (c / 100) << 1;\\n\\n const uint32_t d4 = (c % 100) << 1;\\n\\n \\n\\n if (value >= 10000000)\\n\\n *buffer++ = cDigitsLut[d1];\\n\\n if (value >= 1000000)\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n if (value >= 100000)\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n \\n\\n *buffer++ = cDigitsLut[d3];\\n\\n *buffer++ = cDigitsLut[d3 + 1];\\n\\n *buffer++ = cDigitsLut[d4];\\n\\n *buffer++ = cDigitsLut[d4 + 1];\\n\\n }\\n\\n else {\\n\\n // value = aabbbbcccc in decimal\\n\\n \\n\\n const uint32_t a = value / 100000000; // 1 to 42\\n\\n value %= 100000000;\\n\\n \\n\\n if (a >= 10) {\\n\\n const unsigned i = a << 1;\\n\\n *buffer++ = cDigitsLut[i];\\n\\n *buffer++ = cDigitsLut[i + 1];\\n\\n }\\n\\n else\\n\\n *buffer++ = static_cast<char>('0' + static_cast<char>(a));\\n\\n\\n\\n const uint32_t b = value / 10000; // 0 to 9999\\n\\n const uint32_t c = value % 10000; // 0 to 9999\\n\\n \\n\\n const uint32_t d1 = (b / 100) << 1;\\n\\n const uint32_t d2 = (b % 100) << 1;\\n\\n \\n\\n const uint32_t d3 = (c / 100) << 1;\\n\\n const uint32_t d4 = (c % 100) << 1;\\n\\n \\n\\n *buffer++ = cDigitsLut[d1];\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n *buffer++ = cDigitsLut[d3];\\n\\n *buffer++ = cDigitsLut[d3 + 1];\\n\\n *buffer++ = cDigitsLut[d4];\\n\\n *buffer++ = cDigitsLut[d4 + 1];\\n\\n }\\n\\n return buffer;\\n\\n}\\n\\n\\n\\ninline char* i32toa(int32_t value, char* buffer) {\\n\\n uint32_t u = static_cast<uint32_t>(value);\\n\\n if (value < 0) {\\n\\n *buffer++ = '-';\\n\\n u = ~u + 1;\\n\\n }\\n\\n\\n\\n return u32toa(u, buffer);\\n\\n}\\n\\n\\n\\ninline char* u64toa(uint64_t value, char* buffer) {\\n\\n const char* cDigitsLut = GetDigitsLut();\\n\\n const uint64_t kTen8 = 100000000;\\n\\n const uint64_t kTen9 = kTen8 * 10;\\n\\n const uint64_t kTen10 = kTen8 * 100;\\n\\n const uint64_t kTen11 = kTen8 * 1000;\\n\\n const uint64_t kTen12 = kTen8 * 10000;\\n\\n const uint64_t kTen13 = kTen8 * 100000;\\n\\n const uint64_t kTen14 = kTen8 * 1000000;\\n\\n const uint64_t kTen15 = kTen8 * 10000000;\\n\\n const uint64_t kTen16 = kTen8 * kTen8;\\n\\n \\n\\n if (value < kTen8) {\\n\\n uint32_t v = static_cast<uint32_t>(value);\\n\\n if (v < 10000) {\\n\\n const uint32_t d1 = (v / 100) << 1;\\n\\n const uint32_t d2 = (v % 100) << 1;\\n\\n \\n\\n if (v >= 1000)\\n\\n *buffer++ = cDigitsLut[d1];\\n\\n if (v >= 100)\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n if (v >= 10)\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n }\\n\\n else {\\n\\n // value = bbbbcccc\\n\\n const uint32_t b = v / 10000;\\n\\n const uint32_t c = v % 10000;\\n\\n \\n\\n const uint32_t d1 = (b / 100) << 1;\\n\\n const uint32_t d2 = (b % 100) << 1;\\n\\n \\n\\n const uint32_t d3 = (c / 100) << 1;\\n\\n const uint32_t d4 = (c % 100) << 1;\\n\\n \\n\\n if (value >= 10000000)\\n\\n *buffer++ = cDigitsLut[d1];\\n\\n if (value >= 1000000)\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n if (value >= 100000)\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n \\n\\n *buffer++ = cDigitsLut[d3];\\n\\n *buffer++ = cDigitsLut[d3 + 1];\\n\\n *buffer++ = cDigitsLut[d4];\\n\\n *buffer++ = cDigitsLut[d4 + 1];\\n\\n }\\n\\n }\\n\\n else if (value < kTen16) {\\n\\n const uint32_t v0 = static_cast<uint32_t>(value / kTen8);\\n\\n const uint32_t v1 = static_cast<uint32_t>(value % kTen8);\\n\\n \\n\\n const uint32_t b0 = v0 / 10000;\\n\\n const uint32_t c0 = v0 % 10000;\\n\\n \\n\\n const uint32_t d1 = (b0 / 100) << 1;\\n\\n const uint32_t d2 = (b0 % 100) << 1;\\n\\n \\n\\n const uint32_t d3 = (c0 / 100) << 1;\\n\\n const uint32_t d4 = (c0 % 100) << 1;\\n\\n\\n\\n const uint32_t b1 = v1 / 10000;\\n\\n const uint32_t c1 = v1 % 10000;\\n\\n \\n\\n const uint32_t d5 = (b1 / 100) << 1;\\n\\n const uint32_t d6 = (b1 % 100) << 1;\\n\\n \\n\\n const uint32_t d7 = (c1 / 100) << 1;\\n\\n const uint32_t d8 = (c1 % 100) << 1;\\n\\n\\n\\n if (value >= kTen15)\\n\\n *buffer++ = cDigitsLut[d1];\\n\\n if (value >= kTen14)\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n if (value >= kTen13)\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n if (value >= kTen12)\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n if (value >= kTen11)\\n\\n *buffer++ = cDigitsLut[d3];\\n\\n if (value >= kTen10)\\n\\n *buffer++ = cDigitsLut[d3 + 1];\\n\\n if (value >= kTen9)\\n\\n *buffer++ = cDigitsLut[d4];\\n\\n if (value >= kTen8)\\n\\n *buffer++ = cDigitsLut[d4 + 1];\\n\\n \\n\\n *buffer++ = cDigitsLut[d5];\\n\\n *buffer++ = cDigitsLut[d5 + 1];\\n\\n *buffer++ = cDigitsLut[d6];\\n\\n *buffer++ = cDigitsLut[d6 + 1];\\n\\n *buffer++ = cDigitsLut[d7];\\n\\n *buffer++ = cDigitsLut[d7 + 1];\\n\\n *buffer++ = cDigitsLut[d8];\\n\\n *buffer++ = cDigitsLut[d8 + 1];\\n\\n }\\n\\n else {\\n\\n const uint32_t a = static_cast<uint32_t>(value / kTen16); // 1 to 1844\\n\\n value %= kTen16;\\n\\n \\n\\n if (a < 10)\\n\\n *buffer++ = static_cast<char>('0' + static_cast<char>(a));\\n\\n else if (a < 100) {\\n\\n const uint32_t i = a << 1;\\n\\n *buffer++ = cDigitsLut[i];\\n\\n *buffer++ = cDigitsLut[i + 1];\\n\\n }\\n\\n else if (a < 1000) {\\n\\n *buffer++ = static_cast<char>('0' + static_cast<char>(a / 100));\\n\\n \\n\\n const uint32_t i = (a % 100) << 1;\\n\\n *buffer++ = cDigitsLut[i];\\n\\n *buffer++ = cDigitsLut[i + 1];\\n\\n }\\n\\n else {\\n\\n const uint32_t i = (a / 100) << 1;\\n\\n const uint32_t j = (a % 100) << 1;\\n\\n *buffer++ = cDigitsLut[i];\\n\\n *buffer++ = cDigitsLut[i + 1];\\n\\n *buffer++ = cDigitsLut[j];\\n\\n *buffer++ = cDigitsLut[j + 1];\\n\\n }\\n\\n \\n\\n const uint32_t v0 = static_cast<uint32_t>(value / kTen8);\\n\\n const uint32_t v1 = static_cast<uint32_t>(value % kTen8);\\n\\n \\n\\n const uint32_t b0 = v0 / 10000;\\n\\n const uint32_t c0 = v0 % 10000;\\n\\n \\n\\n const uint32_t d1 = (b0 / 100) << 1;\\n\\n const uint32_t d2 = (b0 % 100) << 1;\\n\\n \\n\\n const uint32_t d3 = (c0 / 100) << 1;\\n\\n const uint32_t d4 = (c0 % 100) << 1;\\n\\n \\n\\n const uint32_t b1 = v1 / 10000;\\n\\n const uint32_t c1 = v1 % 10000;\\n\\n \\n\\n const uint32_t d5 = (b1 / 100) << 1;\\n\\n const uint32_t d6 = (b1 % 100) << 1;\\n\\n \\n\\n const uint32_t d7 = (c1 / 100) << 1;\\n\\n const uint32_t d8 = (c1 % 100) << 1;\\n\\n \\n\\n *buffer++ = cDigitsLut[d1];\\n\\n *buffer++ = cDigitsLut[d1 + 1];\\n\\n *buffer++ = cDigitsLut[d2];\\n\\n *buffer++ = cDigitsLut[d2 + 1];\\n\\n *buffer++ = cDigitsLut[d3];\\n\\n *buffer++ = cDigitsLut[d3 + 1];\\n\\n *buffer++ = cDigitsLut[d4];\\n\\n *buffer++ = cDigitsLut[d4 + 1];\\n\\n *buffer++ = cDigitsLut[d5];\\n\\n *buffer++ = cDigitsLut[d5 + 1];\\n\\n *buffer++ = cDigitsLut[d6];\\n\\n *buffer++ = cDigitsLut[d6 + 1];\\n\\n *buffer++ = cDigitsLut[d7];\\n\\n *buffer++ = cDigitsLut[d7 + 1];\\n\\n *buffer++ = cDigitsLut[d8];\\n\\n *buffer++ = cDigitsLut[d8 + 1];\\n\\n }\\n\\n \\n\\n return buffer;\\n\\n}\\n\\n\\n\\ninline char* i64toa(int64_t value, char* buffer) {\\n\\n uint64_t u = static_cast<uint64_t>(value);\\n\\n if (value < 0) {\\n\\n *buffer++ = '-';\\n\\n u = ~u + 1;\\n\\n }\\n\\n\\n\\n return u64toa(u, buffer);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/rapidjson/internal/itoa.h\",\n \"rank\": 85,\n \"score\": 38181.47191615001\n },\n {\n \"content\": \" static unsigned char GetRange(unsigned char c) {\\n\\n // Referring to DFA of http://bjoern.hoehrmann.de/utf-8/decoder/dfa/\\n\\n // With new mapping 1 -> 0x10, 7 -> 0x20, 9 -> 0x40, such that AND operation can test multiple types.\\n\\n static const unsigned char type[] = {\\n\\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\\n\\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\\n\\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\\n\\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\\n\\n 0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,\\n\\n 0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,\\n\\n 0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,\\n\\n 0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,\\n\\n 8,8,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,\\n\\n 10,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3, 11,6,6,6,5,8,8,8,8,8,8,8,8,8,8,8,\\n\\n };\\n\\n return type[c];\\n\",\n \"file_path\": \"Source/rapidjson/encodings.h\",\n \"rank\": 86,\n \"score\": 38138.109447878516\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 87,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 88,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 89,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 90,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 91,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 92,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 93,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 94,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 95,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 96,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 97,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 98,\n \"score\": 38001.30954510052\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/StateManager.h\",\n \"rank\": 99,\n \"score\": 38001.30954510052\n }\n]","isConversational":false}}},{"rowIdx":75,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"wrappers/8.1.1/vtkSPHQuinticKernelWrap.cc"},"repo_name":{"kind":"string","value":"axkibe/node-vtk"},"commit":{"kind":"string","value":"900ad7b5500f672519da5aa24c99aa5a96466ef3"},"file_code":{"kind":"string","value":"\n\n#define VTK_WRAPPING_CXX\n#define VTK_STREAMS_FWD_ONLY\n#include <nan.h>\n\n#include \"vtkSPHKernelWrap.h\"\n#include \"vtkSPHQuinticKernelWrap.h\"\n#include \"vtkObjectBaseWrap.h\"\n#include \"vtkAbstractPointLocatorWrap.h\"\n#include \"vtkDataSetWrap.h\"\n#include \"vtkPointDataWrap.h\"\n#include \"../../plus/plus.h\"\n\nusing namespace v8;\n\nextern Nan::Persistent<v8::Object> vtkNodeJsNoWrap;\nNan::Persistent<v8::FunctionTemplate> VtkSPHQuinticKernelWrap::ptpl;\n\nVtkSPHQuinticKernelWrap::VtkSPHQuinticKernelWrap()\n{ }\n\nVtkSPHQuinticKernelWrap::VtkSPHQuinticKernelWrap(vtkSmartPointer<vtkSPHQuinticKernel> _native)\n{ native = _native; }\n\nVtkSPHQuinticKernelWrap::~VtkSPHQuinticKernelWrap()\n{ }\n\nvoid VtkSPHQuinticKernelWrap::Init(v8::Local<v8::Object> exports)\n{\n\tNan::SetAccessor(exports, Nan::New(\"vtkSPHQuinticKernel\").ToLocalChecked(), ConstructorGetter);\n\tNan::SetAccessor(exports, Nan::New(\"SPHQuinticKernel\").ToLocalChecked(), ConstructorGetter);\n}\n\nvoid VtkSPHQuinticKernelWrap::ConstructorGetter(\n\tv8::Local<v8::String> property,\n\tconst Nan::PropertyCallbackInfo<v8::Value>& info)\n{\n\tInitPtpl();\n\tinfo.GetReturnValue().Set(Nan::New(ptpl)->GetFunction());\n}\n\nvoid VtkSPHQuinticKernelWrap::InitPtpl()\n{\n\tif (!ptpl.IsEmpty()) return;\n\tv8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n\tVtkSPHKernelWrap::InitPtpl( );\n\ttpl->Inherit(Nan::New<FunctionTemplate>(VtkSPHKernelWrap::ptpl));\n\ttpl->SetClassName(Nan::New(\"VtkSPHQuinticKernelWrap\").ToLocalChecked());\n\ttpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n\tNan::SetPrototypeMethod(tpl, \"ComputeDerivWeight\", ComputeDerivWeight);\n\tNan::SetPrototypeMethod(tpl, \"computeDerivWeight\", ComputeDerivWeight);\n\n\tNan::SetPrototypeMethod(tpl, \"ComputeFunctionWeight\", ComputeFunctionWeight);\n\tNan::SetPrototypeMethod(tpl, \"computeFunctionWeight\", ComputeFunctionWeight);\n\n\tNan::SetPrototypeMethod(tpl, \"Initialize\", Initialize);\n\tNan::SetPrototypeMethod(tpl, \"initialize\", Initialize);\n\n\tNan::SetPrototypeMethod(tpl, \"NewInstance\", NewInstance);\n\tNan::SetPrototypeMethod(tpl, \"newInstance\", NewInstance);\n\n\tNan::SetPrototypeMethod(tpl, \"SafeDownCast\", SafeDownCast);\n\tNan::SetPrototypeMethod(tpl, \"safeDownCast\", SafeDownCast);\n\n#ifdef VTK_NODE_PLUS_VTKSPHQUINTICKERNELWRAP_INITPTPL\n\tVTK_NODE_PLUS_VTKSPHQUINTICKERNELWRAP_INITPTPL\n#endif\n\tptpl.Reset( tpl );\n}\n\nvoid VtkSPHQuinticKernelWrap::New(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tif(!info.IsConstructCall())\n\t{\n\t\tNan::ThrowError(\"Constructor not called in a construct call.\");\n\t\treturn;\n\t}\n\n\tif(info.Length() == 0)\n\t{\n\t\tvtkSmartPointer<vtkSPHQuinticKernel> native = vtkSmartPointer<vtkSPHQuinticKernel>::New();\n\t\tVtkSPHQuinticKernelWrap* obj = new VtkSPHQuinticKernelWrap(native);\n\t\tobj->Wrap(info.This());\n\t}\n\telse\n\t{\n\t\tif(info[0]->ToObject() != vtkNodeJsNoWrap )\n\t\t{\n\t\t\tNan::ThrowError(\"Parameter Error\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\tinfo.GetReturnValue().Set(info.This());\n}\n\nvoid VtkSPHQuinticKernelWrap::ComputeDerivWeight(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsNumber())\n\t{\n\t\tdouble r;\n\t\tif(info.Length() != 1)\n\t\t{\n\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\treturn;\n\t\t}\n\t\tr = native->ComputeDerivWeight(\n\t\t\tinfo[0]->NumberValue()\n\t\t);\n\t\tinfo.GetReturnValue().Set(Nan::New(r));\n\t\treturn;\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\nvoid VtkSPHQuinticKernelWrap::ComputeFunctionWeight(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsNumber())\n\t{\n\t\tdouble r;\n\t\tif(info.Length() != 1)\n\t\t{\n\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\treturn;\n\t\t}\n\t\tr = native->ComputeFunctionWeight(\n\t\t\tinfo[0]->NumberValue()\n\t\t);\n\t\tinfo.GetReturnValue().Set(Nan::New(r));\n\t\treturn;\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\nvoid VtkSPHQuinticKernelWrap::Initialize(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsObject() && (Nan::New(VtkAbstractPointLocatorWrap::ptpl))->HasInstance(info[0]))\n\t{\n\t\tVtkAbstractPointLocatorWrap *a0 = ObjectWrap::Unwrap<VtkAbstractPointLocatorWrap>(info[0]->ToObject());\n\t\tif(info.Length() > 1 && info[1]->IsObject() && (Nan::New(VtkDataSetWrap::ptpl))->HasInstance(info[1]))\n\t\t{\n\t\t\tVtkDataSetWrap *a1 = ObjectWrap::Unwrap<VtkDataSetWrap>(info[1]->ToObject());\n\t\t\tif(info.Length() > 2 && info[2]->IsObject() && (Nan::New(VtkPointDataWrap::ptpl))->HasInstance(info[2]))\n\t\t\t{\n\t\t\t\tVtkPointDataWrap *a2 = ObjectWrap::Unwrap<VtkPointDataWrap>(info[2]->ToObject());\n\t\t\t\t\t\t\t\tif(info.Length() != 3)\n\t\t\t\t{\n\t\t\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tnative->Initialize(\n\t\t\t\t\t(vtkAbstractPointLocator *) a0->native.GetPointer(),\n\t\t\t\t\t(vtkDataSet *) a1->native.GetPointer(),\n\t\t\t\t\t(vtkPointData *) a2->native.GetPointer()\n\t\t\t\t);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\nvoid VtkSPHQuinticKernelWrap::NewInstance(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tvtkSPHQuinticKernel * r;\n\tif(info.Length() != 0)\n\t{\n\t\tNan::ThrowError(\"Too many parameters.\");\n\t\treturn;\n\t}\n\tr = native->NewInstance();\n\tVtkSPHQuinticKernelWrap::InitPtpl();\n\tv8::Local<v8::Value> argv[1] =\n\t\t{ Nan::New(vtkNodeJsNoWrap) };\n\tv8::Local<v8::Function> cons =\n\t\tNan::New<v8::FunctionTemplate>(VtkSPHQuinticKernelWrap::ptpl)->GetFunction();\n\tv8::Local<v8::Object> wo = cons->NewInstance(1, argv);\n\tVtkSPHQuinticKernelWrap *w = new VtkSPHQuinticKernelWrap();\n\tw->native = r;\n\tw->Wrap(wo);\n\tinfo.GetReturnValue().Set(wo);\n}\n\nvoid VtkSPHQuinticKernelWrap::SafeDownCast(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsObject() && (Nan::New(VtkObjectBaseWrap::ptpl))->HasInstance(info[0]))\n\t{\n\t\tVtkObjectBaseWrap *a0 = ObjectWrap::Unwrap<VtkObjectBaseWrap>(info[0]->ToObject());\n\t\tvtkSPHQuinticKernel * r;\n\t\tif(info.Length() != 1)\n\t\t{\n\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\treturn;\n\t\t}\n\t\tr = native->SafeDownCast(\n\t\t\t(vtkObjectBase *) a0->native.GetPointer()\n\t\t);\n\t\tVtkSPHQuinticKernelWrap::InitPtpl();\n\t\tv8::Local<v8::Value> argv[1] =\n\t\t\t{ Nan::New(vtkNodeJsNoWrap) };\n\t\tv8::Local<v8::Function> cons =\n\t\t\tNan::New<v8::FunctionTemplate>(VtkSPHQuinticKernelWrap::ptpl)->GetFunction();\n\t\tv8::Local<v8::Object> wo = cons->NewInstance(1, argv);\n\t\tVtkSPHQuinticKernelWrap *w = new VtkSPHQuinticKernelWrap();\n\t\tw->native = r;\n\t\tw->Wrap(wo);\n\t\tinfo.GetReturnValue().Set(wo);\n\t\treturn;\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\n"},"prefix":{"kind":"string","value":"\n\n#define VTK_WRAPPING_CXX\n#define VTK_STREAMS_FWD_ONLY\n#include <nan.h>\n\n#include \"vtkSPHKernelWrap.h\"\n#include \"vtkSPHQuinticKernelWrap.h\"\n#include \"vtkObjectBaseWrap.h\"\n#include \"vtkAbstractPointLocatorWrap.h\"\n#include \"vtkDataSetWrap.h\"\n#include \"vtkPointDataWrap.h\"\n#include \"../../plus/plus.h\"\n\nusing namespace v8;\n\nextern Nan::Persistent<v8::Object> vtkNodeJsNoWrap;\nNan::Persistent<v8::FunctionTemplate> VtkSPHQuinticKernelWrap::ptpl;\n\nVtkSPHQuinticKernelWrap::VtkSPHQuinticKernelWrap()\n{ }\n\nVtkSPHQuinticKernelWrap::VtkSPHQuinticKernelWrap(vtkSmartPointer<vtkSPHQuinticKernel> _native)\n{ native = _native; }\n\nVtkSPHQuinticKernelWrap::~VtkSPHQuinticKernelWrap()\n{ }\n\nvoid VtkSPHQuinticKernelWrap::Init(v8::Local<v8::Object> exports)\n{\n\tNan::SetAccessor(exports, Nan::New(\"vtkSPHQuinticKernel\").ToLocalChecked(), ConstructorGetter);\n\tNan::SetAccessor(exports, Nan::New(\"SPHQuinticKernel\").ToLocalChecked(), ConstructorGetter);\n}\n\nvoid VtkSPHQuinticKernelWrap::ConstructorGetter(\n\tv8::Local<v8::String> property,\n\tconst Nan::PropertyCallbackInfo<v8::Value>& info)\n{\n\tInitPtpl();\n\tinfo.GetReturnValue().Set(Nan::New(ptpl)->GetFunction());\n}\n\nvoid VtkSPHQuinticKernelWrap::InitPtpl()\n{\n\tif (!ptpl.IsEmpty()) return;\n\tv8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n\tVtkSPHKernelWrap::InitPtpl( );\n\ttpl->Inherit(Nan::New<FunctionTemplate>(VtkSPHKernelWrap::ptpl));\n\ttpl->SetClassName(Nan::New(\"VtkSPHQuinticKernelWrap\").ToLocalChecked());\n\ttpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n\tNan::SetPrototypeMethod(tpl, \"ComputeDerivWeight\", ComputeDerivWeight);\n\tNan::SetPrototypeMethod(tpl, \"computeDerivWeight\", ComputeDerivWeight);\n\n\tNan::SetPrototypeMethod(tpl, \"ComputeFunctionWeight\", ComputeFunctionWeight);\n\tNan::SetPrototypeMethod(tpl, \"computeFunctionWeight\", ComputeFunctionWeight);\n\n\tNan::SetPrototypeMethod(tpl, \"Initialize\", Initialize);\n\tNan::SetPrototypeMethod(tpl, \"initialize\", Initialize);\n\n\tNan::SetPrototypeMethod(tpl, \"NewInstance\", NewInstance);\n\tNan::SetPrototypeMethod(tpl, \"newInstance\", NewInstance);\n\n\tNan::SetPrototypeMethod(tpl, \"SafeDownCast\", SafeDownCast);\n\tNan::SetPrototypeMethod(tpl, \"safeDownCast\", SafeDownCast);\n\n#ifdef VTK_NODE_PLUS_VTKSPHQUINTICKERNELWRAP_INITPTPL\n\tVTK_NODE_PLUS_VTKSPHQUINTICKERNEL"},"suffix":{"kind":"string","value":"et(wo);\n\t\treturn;\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\n"},"middle":{"kind":"string","value":"WRAP_INITPTPL\n#endif\n\tptpl.Reset( tpl );\n}\n\nvoid VtkSPHQuinticKernelWrap::New(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tif(!info.IsConstructCall())\n\t{\n\t\tNan::ThrowError(\"Constructor not called in a construct call.\");\n\t\treturn;\n\t}\n\n\tif(info.Length() == 0)\n\t{\n\t\tvtkSmartPointer<vtkSPHQuinticKernel> native = vtkSmartPointer<vtkSPHQuinticKernel>::New();\n\t\tVtkSPHQuinticKernelWrap* obj = new VtkSPHQuinticKernelWrap(native);\n\t\tobj->Wrap(info.This());\n\t}\n\telse\n\t{\n\t\tif(info[0]->ToObject() != vtkNodeJsNoWrap )\n\t\t{\n\t\t\tNan::ThrowError(\"Parameter Error\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\tinfo.GetReturnValue().Set(info.This());\n}\n\nvoid VtkSPHQuinticKernelWrap::ComputeDerivWeight(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsNumber())\n\t{\n\t\tdouble r;\n\t\tif(info.Length() != 1)\n\t\t{\n\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\treturn;\n\t\t}\n\t\tr = native->ComputeDerivWeight(\n\t\t\tinfo[0]->NumberValue()\n\t\t);\n\t\tinfo.GetReturnValue().Set(Nan::New(r));\n\t\treturn;\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\nvoid VtkSPHQuinticKernelWrap::ComputeFunctionWeight(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsNumber())\n\t{\n\t\tdouble r;\n\t\tif(info.Length() != 1)\n\t\t{\n\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\treturn;\n\t\t}\n\t\tr = native->ComputeFunctionWeight(\n\t\t\tinfo[0]->NumberValue()\n\t\t);\n\t\tinfo.GetReturnValue().Set(Nan::New(r));\n\t\treturn;\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\nvoid VtkSPHQuinticKernelWrap::Initialize(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsObject() && (Nan::New(VtkAbstractPointLocatorWrap::ptpl))->HasInstance(info[0]))\n\t{\n\t\tVtkAbstractPointLocatorWrap *a0 = ObjectWrap::Unwrap<VtkAbstractPointLocatorWrap>(info[0]->ToObject());\n\t\tif(info.Length() > 1 && info[1]->IsObject() && (Nan::New(VtkDataSetWrap::ptpl))->HasInstance(info[1]))\n\t\t{\n\t\t\tVtkDataSetWrap *a1 = ObjectWrap::Unwrap<VtkDataSetWrap>(info[1]->ToObject());\n\t\t\tif(info.Length() > 2 && info[2]->IsObject() && (Nan::New(VtkPointDataWrap::ptpl))->HasInstance(info[2]))\n\t\t\t{\n\t\t\t\tVtkPointDataWrap *a2 = ObjectWrap::Unwrap<VtkPointDataWrap>(info[2]->ToObject());\n\t\t\t\t\t\t\t\tif(info.Length() != 3)\n\t\t\t\t{\n\t\t\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tnative->Initialize(\n\t\t\t\t\t(vtkAbstractPointLocator *) a0->native.GetPointer(),\n\t\t\t\t\t(vtkDataSet *) a1->native.GetPointer(),\n\t\t\t\t\t(vtkPointData *) a2->native.GetPointer()\n\t\t\t\t);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\tNan::ThrowError(\"Parameter mismatch\");\n}\n\nvoid VtkSPHQuinticKernelWrap::NewInstance(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tvtkSPHQuinticKernel * r;\n\tif(info.Length() != 0)\n\t{\n\t\tNan::ThrowError(\"Too many parameters.\");\n\t\treturn;\n\t}\n\tr = native->NewInstance();\n\tVtkSPHQuinticKernelWrap::InitPtpl();\n\tv8::Local<v8::Value> argv[1] =\n\t\t{ Nan::New(vtkNodeJsNoWrap) };\n\tv8::Local<v8::Function> cons =\n\t\tNan::New<v8::FunctionTemplate>(VtkSPHQuinticKernelWrap::ptpl)->GetFunction();\n\tv8::Local<v8::Object> wo = cons->NewInstance(1, argv);\n\tVtkSPHQuinticKernelWrap *w = new VtkSPHQuinticKernelWrap();\n\tw->native = r;\n\tw->Wrap(wo);\n\tinfo.GetReturnValue().Set(wo);\n}\n\nvoid VtkSPHQuinticKernelWrap::SafeDownCast(const Nan::FunctionCallbackInfo<v8::Value>& info)\n{\n\tVtkSPHQuinticKernelWrap *wrapper = ObjectWrap::Unwrap<VtkSPHQuinticKernelWrap>(info.Holder());\n\tvtkSPHQuinticKernel *native = (vtkSPHQuinticKernel *)wrapper->native.GetPointer();\n\tif(info.Length() > 0 && info[0]->IsObject() && (Nan::New(VtkObjectBaseWrap::ptpl))->HasInstance(info[0]))\n\t{\n\t\tVtkObjectBaseWrap *a0 = ObjectWrap::Unwrap<VtkObjectBaseWrap>(info[0]->ToObject());\n\t\tvtkSPHQuinticKernel * r;\n\t\tif(info.Length() != 1)\n\t\t{\n\t\t\tNan::ThrowError(\"Too many parameters.\");\n\t\t\treturn;\n\t\t}\n\t\tr = native->SafeDownCast(\n\t\t\t(vtkObjectBase *) a0->native.GetPointer()\n\t\t);\n\t\tVtkSPHQuinticKernelWrap::InitPtpl();\n\t\tv8::Local<v8::Value> argv[1] =\n\t\t\t{ Nan::New(vtkNodeJsNoWrap) };\n\t\tv8::Local<v8::Function> cons =\n\t\t\tNan::New<v8::FunctionTemplate>(VtkSPHQuinticKernelWrap::ptpl)->GetFunction();\n\t\tv8::Local<v8::Object> wo = cons->NewInstance(1, argv);\n\t\tVtkSPHQuinticKernelWrap *w = new VtkSPHQuinticKernelWrap();\n\t\tw->native = r;\n\t\tw->Wrap(wo);\n\t\tinfo.GetReturnValue().S"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":76,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Engine/qxtcheckcombobox.cpp"},"repo_name":{"kind":"string","value":"vadkasevas/BAS"},"commit":{"kind":"string","value":"657f62794451c564c77d6f92b2afa9f5daf2f517"},"file_code":{"kind":"string","value":"\n#include \"qxtcheckcombobox.h\"\n#include <QKeyEvent>\n#include <QDebug>\n#include <QStylePainter>\n\nbool QxtCheckComboBox::eventFilter(QObject* receiver, QEvent* event)\n{\n if(event->type() == QEvent::MouseButtonPress && receiver == Edit)\n {\n if(Edit->underMouse())\n {\n showPopup();\n }\n else\n {\n hidePopup();\n }\n return true;\n }\n\n switch (event->type())\n {\n case QEvent::KeyPress:\n case QEvent::KeyRelease:\n {\n QKeyEvent* keyEvent = static_cast<QKeyEvent*>(event);\n if (receiver == this && (keyEvent->key() == Qt::Key_Up || keyEvent->key() == Qt::Key_Down))\n {\n showPopup();\n return true;\n }\n else if (keyEvent->key() == Qt::Key_Enter ||\n keyEvent->key() == Qt::Key_Return ||\n keyEvent->key() == Qt::Key_Escape)\n {\n \n QComboBox::hidePopup();\n if (keyEvent->key() != Qt::Key_Escape)\n return true;\n }\n }\n case QEvent::MouseButtonPress:\n containerMousePress = (receiver == view()->window());\n break;\n case QEvent::MouseButtonRelease:\n\n containerMousePress = false;\n break;\n default:\n break;\n }\n return false;\n}\n\nvoid QxtCheckComboBox::updateCheckedItems()\n{\n QStringList items = checkedItems();\n QList<int> indexes = checkedIndexes();\n if (items.isEmpty())\n {\n \n setEditText(_defaultText);\n }\n else\n {\n \n setEditText(items.join(_separator));\n }\n\n \n\n emit checkedItemsChanged(items);\n QList<int> New = indexes,Old = LastItemsSelected;\n LastItemsSelected = indexes;\n\n emit checkedIndexesChanged(Old,New);\n}\n\nvoid QxtCheckComboBox::toggleCheckState(int index)\n{\n QVariant value = itemData(index, Qt::CheckStateRole);\n if (value.isValid())\n {\n Qt::CheckState state = static_cast<Qt::CheckState>(value.toInt());\n setItemData(index, (state == Qt::Unchecked ? Qt::Checked : Qt::Unchecked), Qt::CheckStateRole);\n }\n}\n\nQxtCheckComboModel::QxtCheckComboModel(QObject* parent)\n : QStandardItemModel(0, 1, parent) \n{\n}\n\nQt::ItemFlags QxtCheckComboModel::flags(const QModelIndex& index) const\n{\n return QStandardItemModel::flags(index) | Qt::ItemIsUserCheckable;\n\n}\n\nQVariant QxtCheckComboModel::data(const QModelIndex& index, int role) const\n{\n QVariant value = QStandardItemModel::data(index, role);\n if (index.isValid() && role == Qt::CheckStateRole && !value.isValid())\n value = Qt::Unchecked;\n return value;\n}\n\nbool QxtCheckComboModel::setData(const QModelIndex& index, const QVariant& value, int role)\n{\n bool ok = QStandardItemModel::setData(index, value, role);\n if (ok && role == Qt::CheckStateRole)\n {\n emit dataChanged(index, index);\n emit checkStateChanged();\n }\n return ok;\n}\n\nQxtCheckComboBox::QxtCheckComboBox(QWidget* parent) : QComboBox(parent), mDisplayRectDelta(4, 1, -25, 0)\n{\n QListView * listView = new QListView(this);\n\n QPalette palette;\n\n palette.setColor(QPalette::Window, QColor( 200 , 200 , 200 ));\n\n palette.setColor(QPalette::Base, QColor( 55, 55 , 55 ));\n\n listView->setPalette(palette);\n setView(listView);\n\n _separator = QLatin1String(\",\");\n setModel(new QxtCheckComboModel(this));\n connect(this, SIGNAL(activated(int)), this, SLOT(toggleCheckState(int)));\n connect(model(), SIGNAL(checkStateChanged()), this, SLOT(updateCheckedItems()));\n connect(model(), SIGNAL(rowsInserted(const QModelIndex &, int, int)), this, SLOT(updateCheckedItems()));\n connect(model(), SIGNAL(rowsRemoved(const QModelIndex &, int, int)), this, SLOT(updateCheckedItems()));\n\n \n Edit = new QLineEdit(this);\n Edit->setReadOnly(true);\n setLineEdit(Edit);\n Edit->disconnect(this);\n Edit->installEventFilter(this);\n Edit->setEnabled(false);\n setInsertPolicy(QComboBox::NoInsert);\n\n view()->installEventFilter(this);\n view()->window()->installEventFilter(this);\n view()->viewport()->installEventFilter(this);\n this->installEventFilter(this);\n}\n\nQxtCheckComboBox::~QxtCheckComboBox()\n{\n}\n\nvoid QxtCheckComboBox::hidePopup()\n{\n if (containerMousePress)\n {\n QComboBox::hidePopup();\n }\n}\nvoid QxtCheckComboBox::showPopup()\n{\n QComboBox::showPopup();\n}\n\nQt::CheckState QxtCheckComboBox::itemCheckState(int index) const\n{\n return static_cast<Qt::CheckState>(itemData(index, Qt::CheckStateRole).toInt());\n}\n\nvoid QxtCheckComboBox::setItemCheckState(int index, Qt::CheckState state)\n{\n setItemData(index, state, Qt::CheckStateRole);\n}\n\nQStringList QxtCheckComboBox::checkedItems() const\n{\n QStringList items;\n if (model())\n {\n QModelIndex index = model()->index(0, modelColumn(), rootModelIndex());\n QModelIndexList indexes = model()->match(index, Qt::CheckStateRole, Qt::Checked, -1, Qt::MatchExactly);\n foreach(const QModelIndex& index, indexes)\n items += index.data().toString();\n }\n return items;\n}\n\nQStringList QxtCheckComboBox::checkedData() const\n{\n QStringList items;\n if (model())\n {\n QModelIndex index = model()->index(0, modelColumn(), rootModelIndex());\n QModelIndexList indexes = model()->match(index, Qt::CheckStateRole, Qt::Checked, -1, Qt::MatchExactly);\n foreach(const QModelIndex& index, indexes)\n items += index.data(Qt::UserRole).toString();\n }\n return items;\n}\n\nQList<int> QxtCheckComboBox::checkedIndexes()\n{\n QList<int> items;\n if (model())\n {\n QModelIndex index = model()->index(0, modelColumn(), rootModelIndex());\n QModelIndexList indexes = model()->match(index, Qt::CheckStateRole, Qt::Checked, -1, Qt::MatchExactly);\n foreach(const QModelIndex& index, indexes)\n items += index.row();\n }\n return items;\n}\n\nvoid QxtCheckComboBox::setCheckedItems(const QStringList& items)\n{\n \n \n foreach(const QString& text, items)\n {\n const int index = findText(text);\n setItemCheckState(index, index != -1 ? Qt::Checked : Qt::Unchecked);\n }\n}\n\nvoid QxtCheckComboBox::setCheckedData(const QStringList& items)\n{\n foreach(const QString& text, items)\n {\n const int index = findData(text);\n setItemCheckState(index, index != -1 ? Qt::Checked : Qt::Unchecked);\n }\n}\n\nvoid QxtCheckComboBox::setCheckedIndexes(const QList<int>& indexes)\n{\n\n for(int index = 0;index<model()->rowCount();index ++)\n {\n setItemCheckState(index, indexes.contains(index) ? Qt::Checked : Qt::Unchecked);\n }\n LastItemsSelected = indexes;\n}\n\nQList<int> QxtCheckComboBox::currentIndexes()\n{\n return LastItemsSelected;\n}\n\nQString QxtCheckComboBox::defaultText() const\n{\n return _defaultText;\n}\n\nvoid QxtCheckComboBox::setDefaultText(const QString& text)\n{\n if (_defaultText != text)\n {\n _defaultText = text;\n this->updateCheckedItems();\n }\n}\n\nQString QxtCheckComboBox::separator() const\n{\n return _separator;\n}\n\nvoid QxtCheckComboBox::setSeparator(const QString& separator)\n{\n if (_separator != separator)\n {\n _separator = separator;\n updateCheckedItems();\n }\n}\n"},"prefix":{"kind":"string","value":"\n#include \"qxtcheckcombobox.h\"\n#include <QKeyEvent>\n#include <QDebug>\n#include <QStylePainter>\n\nbool QxtCheckComboBox::eventFilter(QObject* receiver, QEvent* event)\n{\n if(event->type() == QEvent::MouseButtonPress && receiver == Edit)\n {\n if(Edit->underMouse())\n {\n showPopup();\n }\n else\n {\n hidePopup();\n }\n return true;\n }\n\n switch (event->type())\n {\n case QEvent::KeyPress:\n case QEvent::KeyRelease:\n {\n QKeyEvent* keyEvent = static_cast<QKeyEvent*>(event);\n if (receiver == this && (keyEvent->key() == Qt::Key_Up || keyEvent->key() == Qt::Key_Down))\n {\n showPopup();\n return true;\n }\n else if (keyEvent->key() == Qt::Key_Enter ||\n keyEvent->key() == Qt::Key_Return ||\n keyEvent->key() == Qt::Key_Escape)\n {\n \n QComboBox::hidePopup();\n if (keyEvent->key() != Qt::Key_Escape)\n return true;\n }\n }\n case QEvent::MouseButtonPress:\n containerMousePress = (receiver == view()->window());\n break;\n case QEvent::MouseButtonRelease:\n\n containerMousePress = false;\n break;\n default:\n break;\n }\n return false;\n}\n\nvoid QxtCheckComboBox::updateCheckedItems()\n{\n QStringList items = checkedItems();\n QList<int> indexes = checkedIndexes();\n if (items.isEmpty())\n {\n \n setEditText(_defaultText);\n }\n else\n {\n \n setEditText(items.join(_separator));\n }\n\n \n\n emit checkedItemsChanged(items);\n QList<int> New = indexes,Old = LastItemsSelected;\n LastItemsSelected = indexes;\n\n emit checkedIndexesChanged(Old,New);\n}\n\nvoid QxtCheckComboBox::toggleCheckState(int index)\n{\n QVariant value = itemData(index, Qt::CheckStateRole);\n if (value.isValid())\n {\n Qt::CheckState state = static_cast<Qt::CheckState>(value.toInt());\n setItemData(index, (state == Qt::Unchecked ? Qt::Checked : Qt::Unchecked), Qt::CheckStateRole);\n }\n}\n\nQxtCheckComboModel::QxtCheckComboModel(QObject* parent)\n : QStandardItemModel(0, 1, parent) \n{\n}\n\nQt::ItemFlags QxtCheckComboModel::flags(const QModelIndex& index) const\n{\n return QStandardItemModel::flags(index) | Qt::ItemIsUserCheckable;\n\n}\n\nQVariant QxtCheckComboModel::data(const QModelIndex& index, int role) const\n{\n QVariant value = QStandardItemModel::data(index, role);\n if (index.isValid() && role == Qt::CheckStateRole && !value.isValid())\n value = Qt::Unchecked;\n return value;\n}\n\nbool QxtCheckComboModel::setData(const QModelIndex& index, const QVariant& value, int role)\n{\n bool ok = QStandardItemModel::setData(index, value, role);\n if (ok && role == Qt::CheckStateRole)\n {\n emit dataChanged(index, index);\n emit checkStateChanged();\n }\n return ok;\n}\n\nQxtCheckComboBox::QxtCheckComboBox(QWidget* parent) : QComboBox(parent), mDisplayRectDelta(4, 1, -25, 0)\n{\n QListView * listView = new QListView(this);\n\n QPalette palette;\n\n palette.setColor(QPalette::Window, QColor( 200 , 200 , 200 ));\n\n palette.setColor(QPalette::Base, QColor( 55, 55 , 55 ));\n\n listView->setPalette(palette);\n setView(listView);\n\n _separator = QLatin1String(\",\");\n setModel(new QxtCheckComboModel(this));\n connect(this, SIGNAL(activated(int)), this, SLOT(toggleCheckState(int)));\n connect(model(), SIGNAL(checkStateChanged()), this, SLOT(updateCheckedItems()));\n connect(model(), SIGNAL(rowsInserted(const QModelIndex &, int, int)), this, SLOT(updateCheckedItems()));\n connect(model(), SIGNAL(rowsRemoved(const QModelIndex &, int, int)), this, SLOT(updateCheckedItems()));\n\n \n Edit = new QLineEdit(this);\n Edit->setReadOnly(true);\n setLineEdit(Edit);\n Edit->disconnect(this);\n Edit->installEventFilter(this);\n Edit->setEnabled(false);\n "},"suffix":{"kind":"string","value":"\n\nQxtCheckComboBox::~QxtCheckComboBox()\n{\n}\n\nvoid QxtCheckComboBox::hidePopup()\n{\n if (containerMousePress)\n {\n QComboBox::hidePopup();\n }\n}\nvoid QxtCheckComboBox::showPopup()\n{\n QComboBox::showPopup();\n}\n\nQt::CheckState QxtCheckComboBox::itemCheckState(int index) const\n{\n return static_cast<Qt::CheckState>(itemData(index, Qt::CheckStateRole).toInt());\n}\n\nvoid QxtCheckComboBox::setItemCheckState(int index, Qt::CheckState state)\n{\n setItemData(index, state, Qt::CheckStateRole);\n}\n\nQStringList QxtCheckComboBox::checkedItems() const\n{\n QStringList items;\n if (model())\n {\n QModelIndex index = model()->index(0, modelColumn(), rootModelIndex());\n QModelIndexList indexes = model()->match(index, Qt::CheckStateRole, Qt::Checked, -1, Qt::MatchExactly);\n foreach(const QModelIndex& index, indexes)\n items += index.data().toString();\n }\n return items;\n}\n\nQStringList QxtCheckComboBox::checkedData() const\n{\n QStringList items;\n if (model())\n {\n QModelIndex index = model()->index(0, modelColumn(), rootModelIndex());\n QModelIndexList indexes = model()->match(index, Qt::CheckStateRole, Qt::Checked, -1, Qt::MatchExactly);\n foreach(const QModelIndex& index, indexes)\n items += index.data(Qt::UserRole).toString();\n }\n return items;\n}\n\nQList<int> QxtCheckComboBox::checkedIndexes()\n{\n QList<int> items;\n if (model())\n {\n QModelIndex index = model()->index(0, modelColumn(), rootModelIndex());\n QModelIndexList indexes = model()->match(index, Qt::CheckStateRole, Qt::Checked, -1, Qt::MatchExactly);\n foreach(const QModelIndex& index, indexes)\n items += index.row();\n }\n return items;\n}\n\nvoid QxtCheckComboBox::setCheckedItems(const QStringList& items)\n{\n \n \n foreach(const QString& text, items)\n {\n const int index = findText(text);\n setItemCheckState(index, index != -1 ? Qt::Checked : Qt::Unchecked);\n }\n}\n\nvoid QxtCheckComboBox::setCheckedData(const QStringList& items)\n{\n foreach(const QString& text, items)\n {\n const int index = findData(text);\n setItemCheckState(index, index != -1 ? Qt::Checked : Qt::Unchecked);\n }\n}\n\nvoid QxtCheckComboBox::setCheckedIndexes(const QList<int>& indexes)\n{\n\n for(int index = 0;index<model()->rowCount();index ++)\n {\n setItemCheckState(index, indexes.contains(index) ? Qt::Checked : Qt::Unchecked);\n }\n LastItemsSelected = indexes;\n}\n\nQList<int> QxtCheckComboBox::currentIndexes()\n{\n return LastItemsSelected;\n}\n\nQString QxtCheckComboBox::defaultText() const\n{\n return _defaultText;\n}\n\nvoid QxtCheckComboBox::setDefaultText(const QString& text)\n{\n if (_defaultText != text)\n {\n _defaultText = text;\n this->updateCheckedItems();\n }\n}\n\nQString QxtCheckComboBox::separator() const\n{\n return _separator;\n}\n\nvoid QxtCheckComboBox::setSeparator(const QString& separator)\n{\n if (_separator != separator)\n {\n _separator = separator;\n updateCheckedItems();\n }\n}\n"},"middle":{"kind":"string","value":"setInsertPolicy(QComboBox::NoInsert);\n\n view()->installEventFilter(this);\n view()->window()->installEventFilter(this);\n view()->viewport()->installEventFilter(this);\n this->installEventFilter(this);\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"var Index = GetInputConstructorValue(\"Index\", loader);\n","file_path":"Modules/List/js/get_list_element_by_index_select.js","rank":0,"score":107529.92272205185},{"content":"class DatabaseAdminItemEdit;\n\n}\n\nusing namespace BrowserAutomationStudioFramework;\n","file_path":"Engine/databaseadminitemedit.h","rank":1,"score":105654.5356569789},{"content":"local void zip64local_putValue_inmemory OF((void* dest, ZPOS64_T x, int nbByte));\n","file_path":"Engine/zip/zip.c","rank":2,"score":100719.33099010467},{"content":"local void zip64local_putValue_inmemory OF((void* dest, ZPOS64_T x, int nbByte));\n","file_path":"Updater/zip/zip.c","rank":3,"score":100719.33099010467},{"content":"local int unz64local_getByte OF((\n","file_path":"Updater/zip/unzip.c","rank":4,"score":100647.94641337525},{"content":"local int unz64local_getByte OF((\n","file_path":"Engine/zip/unzip.c","rank":5,"score":100647.94641337525},{"content":"local int zip64local_getLong64 OF((const zlib_filefunc64_32_def* pzlib_filefunc_def, voidpf filestream, ZPOS64_T *pX));\n","file_path":"Updater/zip/zip.c","rank":6,"score":100642.47172968116},{"content":"local int zip64local_getLong64 OF((const zlib_filefunc64_32_def* pzlib_filefunc_def, voidpf filestream, ZPOS64_T *pX));\n","file_path":"Engine/zip/zip.c","rank":7,"score":100642.47172968116},{"content":"local void zip64local_putValue_inmemory OF((void* dest, ZPOS64_T x, int nbByte));\n","file_path":"RemoteExecuteScript/zip/zip.c","rank":8,"score":97321.69593421812},{"content":"local int unz64local_getByte OF((\n","file_path":"RemoteExecuteScript/zip/unzip.c","rank":9,"score":97251.24585410111},{"content":"local int zip64local_getLong64 OF((const zlib_filefunc64_32_def* pzlib_filefunc_def, voidpf filestream, ZPOS64_T *pX));\n","file_path":"RemoteExecuteScript/zip/zip.c","rank":10,"score":97245.77117040701},{"content":"class DatabaseAdminItemEdit : public QDialog\n\n{\n\n Q_OBJECT\n\n QHash<int,QWidget *> Widgets;\n\n QList<DatabaseColumn> Columns;\n\n\n\npublic:\n\n explicit DatabaseAdminItemEdit(QWidget *parent = 0);\n\n ~DatabaseAdminItemEdit();\n\n void SetColumns(QList<DatabaseColumn> Columns);\n\n void SetGroupList(QStringList Groups);\n\n void SetSelectedGroup(int index);\n\n int GetSelectedIndex();\n\n void HideGroupBox();\n\n DatabaseItem GetDatabaseItem();\n\n void SetDatabaseItem(DatabaseItem Item);\n\nprivate:\n\n Ui::DatabaseAdminItemEdit *ui;\n\n};\n\n\n\n#endif // DATABASEADMINITEMEDIT_H\n","file_path":"Engine/databaseadminitemedit.h","rank":11,"score":95084.47661727692},{"content":"#ifdef LODEPNG_COMPILE_PNG\n\nclass State : public LodePNGState\n\n{\n\n public:\n\n State();\n\n State(const State& other);\n\n virtual ~State();\n\n State& operator=(const State& other);\n\n};\n\n\n\n#ifdef LODEPNG_COMPILE_DECODER\n\n/* Same as other lodepng::decode, but using a State for more settings and information. */\n\nunsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h,\n\n State& state,\n\n const unsigned char* in, size_t insize);\n\nunsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h,\n\n State& state,\n\n const std::vector<unsigned char>& in);\n\n#endif /*LODEPNG_COMPILE_DECODER*/\n\n\n\n#ifdef LODEPNG_COMPILE_ENCODER\n","file_path":"ChromeWorker/png/lodepng.h","rank":12,"score":95049.04685941734},{"content":"var els = $(\"*[data-table-id=\" + Table + \"]\")\n","file_path":"Modules/Database/js/database_insert_record_select.js","rank":13,"score":93000.63835306438},{"content":"var els = $(\"*[data-table-id=\" + Table + \"]\")\n","file_path":"Modules/Database/js/database_update_record_select.js","rank":14,"score":93000.63835306438},{"content":"var Index = GetInputConstructorValue(\"Index\", loader);\n","file_path":"Modules/List/js/insert_element_to_list_select.js","rank":15,"score":92987.60745450656},{"content":"var Index = GetInputConstructorValue(\"Index\", loader);\n","file_path":"Modules/List/js/list_set_element_select.js","rank":16,"score":92987.60745450656},{"content":"var Value = GetInputConstructorValue(\"Value\", loader);\n","file_path":"Modules/List/js/delete_by_index_select.js","rank":17,"score":89112.54011689377},{"content":"var Value = GetInputConstructorValue(\"Value\", loader);\n","file_path":"Modules/List/js/get_index_from_list_select.js","rank":18,"score":86411.09007047981},{"content":"11. state settings reference\n\n----------------------------\n\n\n\nA quick reference of some settings to set on the LodePNGState\n\n\n\nFor decoding:\n\n\n\nstate.decoder.zlibsettings.ignore_adler32: ignore ADLER32 checksums\n\nstate.decoder.zlibsettings.custom_...: use custom inflate function\n\nstate.decoder.ignore_crc: ignore CRC checksums\n\nstate.decoder.color_convert: convert internal PNG color to chosen one\n\nstate.decoder.read_text_chunks: whether to read in text metadata chunks\n\nstate.decoder.remember_unknown_chunks: whether to read in unknown chunks\n\nstate.info_raw.colortype: desired color type for decoded image\n\nstate.info_raw.bitdepth: desired bit depth for decoded image\n\nstate.info_raw....: more color settings, see struct LodePNGColorMode\n\nstate.info_png....: no settings for decoder but ouput, see struct LodePNGInfo\n\n\n\nFor encoding:\n\n\n","file_path":"ChromeWorker/png/lodepng.h","rank":19,"score":85019.3226670419},{"content":"class bool_array\n\n{\n\npublic:\n\n#if (defined(__x86_64) || defined(__ia64) || defined(__ppc64__) || \\\n\n defined(_WIN64) || defined(_M_IA64)) && \\\n\n !(defined(_LP64) || defined(__lp64))\n\n /** Type of array indices. */\n\n typedef unsigned long long size_type;\n\n#else\n\n /** Type of array indices. */\n\n typedef unsigned long size_type;\n\n#endif\n\n\n\nprivate:\n\n /** Private definition of byte to avoid polluting the global namespace. */\n\n typedef unsigned char byte;\n\n\n\n /** Class to represent a reference to an array element. */\n\n template <typename _Byte_type>\n","file_path":"Engine/debug_memory/bool_array.h","rank":20,"score":65697.39776177352},{"content":"class bool_array\n\n{\n\npublic:\n\n#if (defined(__x86_64) || defined(__ia64) || defined(__ppc64__) || \\\n\n defined(_WIN64) || defined(_M_IA64)) && \\\n\n !(defined(_LP64) || defined(__lp64))\n\n /** Type of array indices. */\n\n typedef unsigned long long size_type;\n\n#else\n\n /** Type of array indices. */\n\n typedef unsigned long size_type;\n\n#endif\n\n\n\nprivate:\n\n /** Private definition of byte to avoid polluting the global namespace. */\n\n typedef unsigned char byte;\n\n\n\n /** Class to represent a reference to an array element. */\n\n template <typename _Byte_type>\n","file_path":"Studio/debug_memory/bool_array.h","rank":21,"score":65697.39776177352},{"content":"class debug_new_recorder\n\n{\n\n const char* _M_file;\n\n const int _M_line;\n\n void _M_process(void* ptr);\n\npublic:\n\n /**\n\n * Constructor to remember the call context. The information will\n\n * be used in debug_new_recorder::operator->*.\n\n */\n\n debug_new_recorder(const char* file, int line)\n\n : _M_file(file), _M_line(line) {}\n\n /**\n\n * Operator to write the context information to memory.\n\n * <code>operator->*</code> is chosen because it has the right\n\n * precedence, it is rarely used, and it looks good: so people can\n\n * tell the special usage more quickly.\n\n */\n\n template <class _Tp> _Tp* operator->*(_Tp* ptr)\n\n { _M_process(ptr); return ptr; }\n","file_path":"Engine/debug_memory/debug_new.h","rank":22,"score":64192.76177119041},{"content":"class debug_new_counter\n\n{\n\n static int _S_count;\n\npublic:\n\n debug_new_counter();\n\n ~debug_new_counter();\n\n};\n\n/** Counting object for each file including debug_new.h. */\n\nstatic debug_new_counter __debug_new_count;\n\n\n\nNVWA_NAMESPACE_END\n\n\n\n#endif // NVWA_DEBUG_NEW_H\n","file_path":"Engine/debug_memory/debug_new.h","rank":23,"score":64192.76177119041},{"content":"class debug_new_counter\n\n{\n\n static int _S_count;\n\npublic:\n\n debug_new_counter();\n\n ~debug_new_counter();\n\n};\n\n/** Counting object for each file including debug_new.h. */\n\nstatic debug_new_counter __debug_new_count;\n\n\n\nNVWA_NAMESPACE_END\n\n\n\n#endif // NVWA_DEBUG_NEW_H\n","file_path":"Studio/debug_memory/debug_new.h","rank":24,"score":64192.76177119041},{"content":"class debug_new_recorder\n\n{\n\n const char* _M_file;\n\n const int _M_line;\n\n void _M_process(void* ptr);\n\npublic:\n\n /**\n\n * Constructor to remember the call context. The information will\n\n * be used in debug_new_recorder::operator->*.\n\n */\n\n debug_new_recorder(const char* file, int line)\n\n : _M_file(file), _M_line(line) {}\n\n /**\n\n * Operator to write the context information to memory.\n\n * <code>operator->*</code> is chosen because it has the right\n\n * precedence, it is rarely used, and it looks good: so people can\n\n * tell the special usage more quickly.\n\n */\n\n template <class _Tp> _Tp* operator->*(_Tp* ptr)\n\n { _M_process(ptr); return ptr; }\n","file_path":"Studio/debug_memory/debug_new.h","rank":25,"score":64192.76177119041},{"content":"struct BufferAndFilter{std::string *Buffer; const QString* Filter;};\n","file_path":"Engine/QtCUrl.h","rank":26,"score":63835.055166312515},{"content":" class ENGINESHARED_EXPORT DatabaseState : public IDatabaseState\n\n {\n\n Q_OBJECT\n\n QList<DatabaseTable> Tables;\n\n QHash<int, QList<DatabaseColumn> > Columns;\n\n QHash<int, QList<DatabaseGroup> > Groups;\n\n IDatabaseConnector *DatabaseConnector;\n\n public:\n\n explicit DatabaseState(QObject *parent = 0);\n\n virtual QList<DatabaseTable> GetDatabaseTables();\n\n virtual QList<DatabaseColumn> GetColumns(int TableId);\n\n virtual QList<DatabaseGroup> GetGroups(int TableId);\n\n virtual QString ToJson();\n\n void SetDatabaseConnector(IDatabaseConnector *DatabaseConnector);\n\n signals:\n\n\n\n public slots:\n\n void Reload();\n\n };\n\n}\n\n\n\n#endif // DATABASESTATE_H\n","file_path":"Engine/databasestate.h","rank":27,"score":62856.45170620578},{"content":"struct new_ptr_list_t\n\n{\n\n new_ptr_list_t* next; ///< Pointer to the next memory block\n\n new_ptr_list_t* prev; ///< Pointer to the previous memory block\n\n size_t size; ///< Size of the memory block\n\n union\n\n {\n\n#if _DEBUG_NEW_FILENAME_LEN == 0\n\n const char* file; ///< Pointer to the file name of the caller\n\n#else\n\n char file[_DEBUG_NEW_FILENAME_LEN]; ///< File name of the caller\n\n#endif\n\n void* addr; ///< Address of the caller to \\e new\n\n };\n\n unsigned line :31; ///< Line number of the caller; or \\c 0\n\n unsigned is_array:1; ///< Non-zero iff <em>new[]</em> is used\n\n unsigned magic; ///< Magic number for error detection\n\n};\n\n\n\n/**\n","file_path":"Studio/debug_memory/debug_new.cpp","rank":28,"score":62777.6238909477},{"content":"struct new_ptr_list_t\n\n{\n\n new_ptr_list_t* next; ///< Pointer to the next memory block\n\n new_ptr_list_t* prev; ///< Pointer to the previous memory block\n\n size_t size; ///< Size of the memory block\n\n union\n\n {\n\n#if _DEBUG_NEW_FILENAME_LEN == 0\n\n const char* file; ///< Pointer to the file name of the caller\n\n#else\n\n char file[_DEBUG_NEW_FILENAME_LEN]; ///< File name of the caller\n\n#endif\n\n void* addr; ///< Address of the caller to \\e new\n\n };\n\n unsigned line :31; ///< Line number of the caller; or \\c 0\n\n unsigned is_array:1; ///< Non-zero iff <em>new[]</em> is used\n\n unsigned magic; ///< Magic number for error detection\n\n};\n\n\n\n/**\n","file_path":"Engine/debug_memory/debug_new.cpp","rank":29,"score":62777.6238909477},{"content":"var Value = GetInputConstructorValue(\"Value\", loader);\n","file_path":"Modules/List/js/delete_by_value_select.js","rank":30,"score":60177.65156049259},{"content":"function creates a new chunk with the given parameters and appends it. Type is the 4-letter\n\nname of the chunk.\n\n\n","file_path":"ChromeWorker/png/lodepng.h","rank":31,"score":55884.114830104794},{"content":"class QDropEvent;\n\n\n","file_path":"Engine/dragwidget.h","rank":32,"score":54862.931178905936},{"content":"struct KeyState\n\n{\n\n bool IsShift;\n\n bool IsAlt;\n\n bool IsCtrl;\n\n KeyState();\n\n void Clear();\n\n bool IsClear();\n\n};\n","file_path":"ChromeWorker/browsereventsemulator.h","rank":33,"score":54859.54670868923},{"content":"class DatabaseStateDialog;\n\n}\n\n\n","file_path":"Studio/databasestatedialog.h","rank":34,"score":54859.54670868923},{"content":"7. error values\n\n---------------\n\n\n\nAll functions in LodePNG that return an error code, return 0 if everything went\n\nOK, or a non-zero code if there was an error.\n\n\n\nThe meaning of the LodePNG error values can be retrieved with the function\n\nlodepng_error_text: given the numerical error code, it returns a description\n\nof the error in English as a string.\n\n\n\nCheck the implementation of lodepng_error_text to see the meaning of each code.\n\n\n\n\n","file_path":"ChromeWorker/png/lodepng.h","rank":35,"score":54837.24586352779},{"content":" class value {\n\n public:\n\n typedef std::vector<value> array;\n\n typedef std::map<std::string, value> object;\n\n union _storage {\n\n bool boolean_;\n\n double number_;\n\n#ifdef PICOJSON_USE_INT64\n\n int64_t int64_;\n\n#endif\n\n std::string* string_;\n\n array* array_;\n\n object* object_;\n\n };\n\n protected:\n\n int type_;\n\n _storage u_;\n\n public:\n\n value();\n\n value(int type, bool);\n","file_path":"ChromeWorker/json/picojson.h","rank":36,"score":54837.24586352779},{"content":"template <typename _Byte_type>\n\ninline bool_array::_Element<_Byte_type>::_Element(\n\n _Byte_type* ptr,\n\n size_type pos)\n\n{\n\n _M_byte_ptr = ptr;\n\n _M_byte_pos = (size_t)(pos / 8);\n\n _M_bit_pos = (size_t)(pos % 8);\n\n}\n\n\n\n/**\n\n * Assigns a new boolean value to an array element.\n\n *\n\n * @param value the new boolean value\n\n * @return the assigned boolean value\n\n */\n\ntemplate <typename _Byte_type>\n\ninline bool bool_array::_Element<_Byte_type>::operator=(bool value)\n\n{\n\n if (value)\n","file_path":"Studio/debug_memory/bool_array.h","rank":37,"score":54829.29914643171},{"content":"template <typename _Byte_type>\n\ninline bool_array::_Element<_Byte_type>::_Element(\n\n _Byte_type* ptr,\n\n size_type pos)\n\n{\n\n _M_byte_ptr = ptr;\n\n _M_byte_pos = (size_t)(pos / 8);\n\n _M_bit_pos = (size_t)(pos % 8);\n\n}\n\n\n\n/**\n\n * Assigns a new boolean value to an array element.\n\n *\n\n * @param value the new boolean value\n\n * @return the assigned boolean value\n\n */\n\ntemplate <typename _Byte_type>\n\ninline bool bool_array::_Element<_Byte_type>::operator=(bool value)\n\n{\n\n if (value)\n","file_path":"Engine/debug_memory/bool_array.h","rank":38,"score":54829.29914643171},{"content":"\n\n size_type size() const _NOEXCEPT;\n\n size_type count() const _NOEXCEPT;\n\n size_type count(size_type begin, size_type end = npos) const;\n\n size_type find(bool value, size_type offset = 0) const;\n\n size_type find(bool value, size_type offset, size_type count) const;\n\n size_type find_until(bool value, size_type begin, size_type end) const;\n\n\n\n void flip() _NOEXCEPT;\n\n void swap(bool_array& rhs) _NOEXCEPT;\n\n void merge_and(const bool_array& rhs,\n\n size_type begin = 0,\n\n size_type end = npos,\n\n size_type offset = 0);\n\n void merge_or (const bool_array& rhs,\n\n size_type begin = 0,\n\n size_type end = npos,\n\n size_type offset = 0);\n\n void copy_to_bitmap(void* dest, size_type begin = 0, size_type end = npos);\n\n\n","file_path":"Engine/debug_memory/bool_array.h","rank":39,"score":54828.65478836206},{"content":"\n\n size_type size() const _NOEXCEPT;\n\n size_type count() const _NOEXCEPT;\n\n size_type count(size_type begin, size_type end = npos) const;\n\n size_type find(bool value, size_type offset = 0) const;\n\n size_type find(bool value, size_type offset, size_type count) const;\n\n size_type find_until(bool value, size_type begin, size_type end) const;\n\n\n\n void flip() _NOEXCEPT;\n\n void swap(bool_array& rhs) _NOEXCEPT;\n\n void merge_and(const bool_array& rhs,\n\n size_type begin = 0,\n\n size_type end = npos,\n\n size_type offset = 0);\n\n void merge_or (const bool_array& rhs,\n\n size_type begin = 0,\n\n size_type end = npos,\n\n size_type offset = 0);\n\n void copy_to_bitmap(void* dest, size_type begin = 0, size_type end = npos);\n\n\n","file_path":"Studio/debug_memory/bool_array.h","rank":40,"score":54828.65478836206},{"content":" static const size_type npos = (size_type)-1;\n\n#endif\n\n\n\n bool_array() _NOEXCEPT;\n\n explicit bool_array(size_type size);\n\n bool_array(const void* ptr, size_type size);\n\n ~bool_array();\n\n\n\n bool_array(const bool_array& rhs);\n\n bool_array& operator=(const bool_array& rhs);\n\n\n\n bool create(size_type size) _NOEXCEPT;\n\n void initialize(bool value) _NOEXCEPT;\n\n\n\n reference operator[](size_type pos);\n\n const_reference operator[](size_type pos) const;\n\n\n\n bool at(size_type pos) const;\n\n void reset(size_type pos);\n\n void set(size_type pos);\n","file_path":"Engine/debug_memory/bool_array.h","rank":41,"score":54827.765325889915},{"content":" static const size_type npos = (size_type)-1;\n\n#endif\n\n\n\n bool_array() _NOEXCEPT;\n\n explicit bool_array(size_type size);\n\n bool_array(const void* ptr, size_type size);\n\n ~bool_array();\n\n\n\n bool_array(const bool_array& rhs);\n\n bool_array& operator=(const bool_array& rhs);\n\n\n\n bool create(size_type size) _NOEXCEPT;\n\n void initialize(bool value) _NOEXCEPT;\n\n\n\n reference operator[](size_type pos);\n\n const_reference operator[](size_type pos) const;\n\n\n\n bool at(size_type pos) const;\n\n void reset(size_type pos);\n\n void set(size_type pos);\n","file_path":"Studio/debug_memory/bool_array.h","rank":42,"score":54827.765325889915},{"content":" *(_M_byte_ptr + _M_byte_pos) |= 1 << _M_bit_pos;\n\n else\n\n *(_M_byte_ptr + _M_byte_pos) &= ~(1 << _M_bit_pos);\n\n return value;\n\n}\n\n\n\n/**\n\n * Reads the boolean value from an array element.\n\n *\n\n * @return the boolean value of the accessed array element\n\n */\n\ntemplate <typename _Byte_type>\n\ninline bool_array::_Element<_Byte_type>::operator bool() const\n\n{\n\n return *(_M_byte_ptr + _M_byte_pos) & (1 << _M_bit_pos) ? true : false;\n\n}\n\n\n\n/**\n\n * Constructs an empty bool_array.\n\n */\n","file_path":"Studio/debug_memory/bool_array.h","rank":43,"score":54826.32204116386},{"content":" *(_M_byte_ptr + _M_byte_pos) |= 1 << _M_bit_pos;\n\n else\n\n *(_M_byte_ptr + _M_byte_pos) &= ~(1 << _M_bit_pos);\n\n return value;\n\n}\n\n\n\n/**\n\n * Reads the boolean value from an array element.\n\n *\n\n * @return the boolean value of the accessed array element\n\n */\n\ntemplate <typename _Byte_type>\n\ninline bool_array::_Element<_Byte_type>::operator bool() const\n\n{\n\n return *(_M_byte_ptr + _M_byte_pos) & (1 << _M_bit_pos) ? true : false;\n\n}\n\n\n\n/**\n\n * Constructs an empty bool_array.\n\n */\n","file_path":"Engine/debug_memory/bool_array.h","rank":44,"score":54826.32204116386},{"content":"#include <stdlib.h> // exit/free/NULL\n\n#include <new> // std::bad_alloc\n\n#include <stdexcept> // std::out_of_range\n\n#include <string> // for exception constructors\n\n#include \"_nvwa.h\" // NVWA_NAMESPACE_*\n\n#include \"c++11.h\" // _NOEXCEPT\n\n\n\nNVWA_NAMESPACE_BEGIN\n\n\n\n/**\n\n * Class to represent a packed boolean array.\n\n *\n\n * This was first written in April 1995, before I knew of any existing\n\n * implementation of this kind of classes. Of course, the C++ Standard\n\n * Template Library now demands an implementation of packed boolean\n\n * array as \\c vector<bool>, but the code here should still be\n\n * useful for the following reasons:\n\n *\n\n * -# Some compilers (like MSVC 6) did not implement this\n\n * specialization (and they may not have a \\c bit_vector either);\n\n * -# I included some additional member functions, like \\e #initialize,\n\n * \\e #count, and \\e #find, which should be useful;\n\n * -# My tests show that the code here is significantly FASTER\n\n * than \\c vector<bool> (and the normal boolean array)\n\n * under MSVC versions 6/8/9 and GCC versions before 4.3 (while\n\n * the \\c vector<bool> implementations of MSVC 7.1 and\n\n * GCC 4.3 have performance similar to that of \\c bool_array).\n\n */\n","file_path":"Engine/debug_memory/bool_array.h","rank":45,"score":54825.36648540233},{"content":"#include <stdlib.h> // exit/free/NULL\n\n#include <new> // std::bad_alloc\n\n#include <stdexcept> // std::out_of_range\n\n#include <string> // for exception constructors\n\n#include \"_nvwa.h\" // NVWA_NAMESPACE_*\n\n#include \"c++11.h\" // _NOEXCEPT\n\n\n\nNVWA_NAMESPACE_BEGIN\n\n\n\n/**\n\n * Class to represent a packed boolean array.\n\n *\n\n * This was first written in April 1995, before I knew of any existing\n\n * implementation of this kind of classes. Of course, the C++ Standard\n\n * Template Library now demands an implementation of packed boolean\n\n * array as \\c vector<bool>, but the code here should still be\n\n * useful for the following reasons:\n\n *\n\n * -# Some compilers (like MSVC 6) did not implement this\n\n * specialization (and they may not have a \\c bit_vector either);\n\n * -# I included some additional member functions, like \\e #initialize,\n\n * \\e #count, and \\e #find, which should be useful;\n\n * -# My tests show that the code here is significantly FASTER\n\n * than \\c vector<bool> (and the normal boolean array)\n\n * under MSVC versions 6/8/9 and GCC versions before 4.3 (while\n\n * the \\c vector<bool> implementations of MSVC 7.1 and\n\n * GCC 4.3 have performance similar to that of \\c bool_array).\n\n */\n","file_path":"Studio/debug_memory/bool_array.h","rank":46,"score":54825.36648540233},{"content":" * @throw out_of_range \\a pos is greater than the size of the array\n\n */\n\ninline void bool_array::reset(size_type pos)\n\n{\n\n size_t byte_pos, bit_pos;\n\n if (pos >= _M_length)\n\n throw std::out_of_range(\"invalid bool_array position\");\n\n byte_pos = (size_t)(pos / 8);\n\n bit_pos = (size_t)(pos % 8);\n\n *(_M_byte_ptr + byte_pos) &= ~(1 << bit_pos);\n\n}\n\n\n\n/**\n\n * Sets an array element to \\c true at a specified position.\n\n *\n\n * @param pos position of the array element to access\n\n * @throw out_of_range \\a pos is greater than the size of the array\n\n */\n\ninline void bool_array::set(size_type pos)\n\n{\n","file_path":"Studio/debug_memory/bool_array.h","rank":47,"score":54824.44925704722},{"content":" * @throw out_of_range \\a pos is greater than the size of the array\n\n */\n\ninline void bool_array::reset(size_type pos)\n\n{\n\n size_t byte_pos, bit_pos;\n\n if (pos >= _M_length)\n\n throw std::out_of_range(\"invalid bool_array position\");\n\n byte_pos = (size_t)(pos / 8);\n\n bit_pos = (size_t)(pos % 8);\n\n *(_M_byte_ptr + byte_pos) &= ~(1 << bit_pos);\n\n}\n\n\n\n/**\n\n * Sets an array element to \\c true at a specified position.\n\n *\n\n * @param pos position of the array element to access\n\n * @throw out_of_range \\a pos is greater than the size of the array\n\n */\n\ninline void bool_array::set(size_type pos)\n\n{\n","file_path":"Engine/debug_memory/bool_array.h","rank":48,"score":54824.44925704722},{"content":" * Reads the boolean value of an array element at a specified position.\n\n *\n\n * @param pos position of the array element to access\n\n * @return the boolean value of the accessed array element\n\n * @throw out_of_range \\a pos is greater than the size of the array\n\n */\n\ninline bool bool_array::at(size_type pos) const\n\n{\n\n size_t byte_pos, bit_pos;\n\n if (pos >= _M_length)\n\n throw std::out_of_range(\"invalid bool_array position\");\n\n byte_pos = (size_t)(pos / 8);\n\n bit_pos = (size_t)(pos % 8);\n\n return *(_M_byte_ptr + byte_pos) & (1 << bit_pos) ? true : false;\n\n}\n\n\n\n/**\n\n * Resets an array element to \\c false at a specified position.\n\n *\n\n * @param pos position of the array element to access\n","file_path":"Studio/debug_memory/bool_array.h","rank":49,"score":54824.08082935222},{"content":" * Reads the boolean value of an array element at a specified position.\n\n *\n\n * @param pos position of the array element to access\n\n * @return the boolean value of the accessed array element\n\n * @throw out_of_range \\a pos is greater than the size of the array\n\n */\n\ninline bool bool_array::at(size_type pos) const\n\n{\n\n size_t byte_pos, bit_pos;\n\n if (pos >= _M_length)\n\n throw std::out_of_range(\"invalid bool_array position\");\n\n byte_pos = (size_t)(pos / 8);\n\n bit_pos = (size_t)(pos % 8);\n\n return *(_M_byte_ptr + byte_pos) & (1 << bit_pos) ? true : false;\n\n}\n\n\n\n/**\n\n * Resets an array element to \\c false at a specified position.\n\n *\n\n * @param pos position of the array element to access\n","file_path":"Engine/debug_memory/bool_array.h","rank":50,"score":54824.08082935222},{"content":" * the specified position (default to beginning) to the end.\n\n *\n\n * @param offset the position at which the search is to begin\n\n * @param value the boolean value to find\n\n * @return position of the first value found if successful; \\c #npos\n\n * otherwise\n\n */\n\ninline bool_array::size_type bool_array::find(\n\n bool value,\n\n size_type offset) const\n\n{\n\n return find_until(value, offset, _M_length);\n\n}\n\n\n\n/**\n\n * Searches for the specified boolean value. This function accepts a\n\n * range expressed in {position, count}.\n\n *\n\n * @param offset the position at which the search is to begin\n\n * @param count the number of bits to search\n","file_path":"Studio/debug_memory/bool_array.h","rank":51,"score":54823.84247856542},{"content":" * the specified position (default to beginning) to the end.\n\n *\n\n * @param offset the position at which the search is to begin\n\n * @param value the boolean value to find\n\n * @return position of the first value found if successful; \\c #npos\n\n * otherwise\n\n */\n\ninline bool_array::size_type bool_array::find(\n\n bool value,\n\n size_type offset) const\n\n{\n\n return find_until(value, offset, _M_length);\n\n}\n\n\n\n/**\n\n * Searches for the specified boolean value. This function accepts a\n\n * range expressed in {position, count}.\n\n *\n\n * @param offset the position at which the search is to begin\n\n * @param count the number of bits to search\n","file_path":"Engine/debug_memory/bool_array.h","rank":52,"score":54823.84247856542},{"content":" * @param value the boolean value to find\n\n * @return position of the first value found if successful;\n\n * \\c #npos otherwise\n\n * @throw out_of_range \\a offset and/or \\a count is too big\n\n */\n\ninline bool_array::size_type bool_array::find(\n\n bool value,\n\n size_type offset,\n\n size_type count) const\n\n{\n\n return find_until(value, offset, offset + count);\n\n}\n\n\n\n/**\n\n * Converts the number of bits to number of bytes.\n\n *\n\n * @param num_bits number of bits\n\n * @return number of bytes needed to store \\a num_bits bits\n\n */\n\ninline size_t bool_array::get_num_bytes_from_bits(size_type num_bits)\n","file_path":"Studio/debug_memory/bool_array.h","rank":53,"score":54823.78631548724},{"content":" * @param value the boolean value to find\n\n * @return position of the first value found if successful;\n\n * \\c #npos otherwise\n\n * @throw out_of_range \\a offset and/or \\a count is too big\n\n */\n\ninline bool_array::size_type bool_array::find(\n\n bool value,\n\n size_type offset,\n\n size_type count) const\n\n{\n\n return find_until(value, offset, offset + count);\n\n}\n\n\n\n/**\n\n * Converts the number of bits to number of bytes.\n\n *\n\n * @param num_bits number of bits\n\n * @return number of bytes needed to store \\a num_bits bits\n\n */\n\ninline size_t bool_array::get_num_bytes_from_bits(size_type num_bits)\n","file_path":"Engine/debug_memory/bool_array.h","rank":54,"score":54823.78631548724},{"content":"{\n\n return (size_t)((num_bits + 7) / 8);\n\n}\n\n\n\n/**\n\n * Exchanges the content of two bool_arrays.\n\n *\n\n * @param lhs the first bool_array to exchange\n\n * @param rhs the second bool_array to exchange\n\n */\n\ninline void swap(bool_array& lhs, bool_array& rhs) _NOEXCEPT\n\n{\n\n lhs.swap(rhs);\n\n}\n\n\n\nNVWA_NAMESPACE_END\n\n\n\n#endif // NVWA_BOOL_ARRAY_H\n","file_path":"Studio/debug_memory/bool_array.h","rank":55,"score":54822.43836624876},{"content":"{\n\n return (size_t)((num_bits + 7) / 8);\n\n}\n\n\n\n/**\n\n * Exchanges the content of two bool_arrays.\n\n *\n\n * @param lhs the first bool_array to exchange\n\n * @param rhs the second bool_array to exchange\n\n */\n\ninline void swap(bool_array& lhs, bool_array& rhs) _NOEXCEPT\n\n{\n\n lhs.swap(rhs);\n\n}\n\n\n\nNVWA_NAMESPACE_END\n\n\n\n#endif // NVWA_BOOL_ARRAY_H\n","file_path":"Engine/debug_memory/bool_array.h","rank":56,"score":54822.43836624876},{"content":" * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n *\n\n * This file is part of Stones of Nvwa:\n\n * http://sourceforge.net/projects/nvwa\n\n *\n\n */\n\n\n\n/**\n\n * @file bool_array.h\n\n *\n\n * Header file for class bool_array (packed boolean array).\n\n *\n\n * @date 2013-10-06\n\n */\n\n\n\n#ifndef NVWA_BOOL_ARRAY_H\n\n#define NVWA_BOOL_ARRAY_H\n\n\n\n#include <assert.h> // assert\n","file_path":"Engine/debug_memory/bool_array.h","rank":57,"score":54822.02498313789},{"content":" * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n *\n\n * This file is part of Stones of Nvwa:\n\n * http://sourceforge.net/projects/nvwa\n\n *\n\n */\n\n\n\n/**\n\n * @file bool_array.h\n\n *\n\n * Header file for class bool_array (packed boolean array).\n\n *\n\n * @date 2013-10-06\n\n */\n\n\n\n#ifndef NVWA_BOOL_ARRAY_H\n\n#define NVWA_BOOL_ARRAY_H\n\n\n\n#include <assert.h> // assert\n","file_path":"Studio/debug_memory/bool_array.h","rank":58,"score":54822.02498313789},{"content":" size_t byte_pos, bit_pos;\n\n if (pos >= _M_length)\n\n throw std::out_of_range(\"invalid bool_array position\");\n\n byte_pos = (size_t)(pos / 8);\n\n bit_pos = (size_t)(pos % 8);\n\n *(_M_byte_ptr + byte_pos) |= 1 << bit_pos;\n\n}\n\n\n\n/**\n\n * Gets the size of the bool_array.\n\n *\n\n * @return the number of bits of the bool_array\n\n */\n\ninline bool_array::size_type bool_array::size() const _NOEXCEPT\n\n{\n\n return _M_length;\n\n}\n\n\n\n/**\n\n * Searches for the specified boolean value. This function seaches from\n","file_path":"Engine/debug_memory/bool_array.h","rank":59,"score":54821.430094967734},{"content":" size_t byte_pos, bit_pos;\n\n if (pos >= _M_length)\n\n throw std::out_of_range(\"invalid bool_array position\");\n\n byte_pos = (size_t)(pos / 8);\n\n bit_pos = (size_t)(pos % 8);\n\n *(_M_byte_ptr + byte_pos) |= 1 << bit_pos;\n\n}\n\n\n\n/**\n\n * Gets the size of the bool_array.\n\n *\n\n * @return the number of bits of the bool_array\n\n */\n\ninline bool_array::size_type bool_array::size() const _NOEXCEPT\n\n{\n\n return _M_length;\n\n}\n\n\n\n/**\n\n * Searches for the specified boolean value. This function seaches from\n","file_path":"Studio/debug_memory/bool_array.h","rank":60,"score":54821.430094967734},{"content":"inline bool_array::bool_array() _NOEXCEPT : _M_byte_ptr(NULL), _M_length(0)\n\n{\n\n}\n\n\n\n/**\n\n * Destroys the bool_array and releases memory.\n\n */\n\ninline bool_array::~bool_array()\n\n{\n\n if (_M_byte_ptr != NULL)\n\n free(_M_byte_ptr);\n\n}\n\n\n\n/**\n\n * Creates a reference to an array element.\n\n *\n\n * @param pos position of the array element to access\n\n * @return reference to the specified element\n\n */\n\ninline bool_array::reference bool_array::operator[](size_type pos)\n","file_path":"Studio/debug_memory/bool_array.h","rank":61,"score":54818.328652451135},{"content":"inline bool_array::bool_array() _NOEXCEPT : _M_byte_ptr(NULL), _M_length(0)\n\n{\n\n}\n\n\n\n/**\n\n * Destroys the bool_array and releases memory.\n\n */\n\ninline bool_array::~bool_array()\n\n{\n\n if (_M_byte_ptr != NULL)\n\n free(_M_byte_ptr);\n\n}\n\n\n\n/**\n\n * Creates a reference to an array element.\n\n *\n\n * @param pos position of the array element to access\n\n * @return reference to the specified element\n\n */\n\ninline bool_array::reference bool_array::operator[](size_type pos)\n","file_path":"Engine/debug_memory/bool_array.h","rank":62,"score":54818.328652451135},{"content":"// -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*-\n\n// vim:tabstop=4:shiftwidth=4:expandtab:\n\n\n\n/*\n\n * Copyright (C) 2004-2013 Wu Yongwei <adah at users dot sourceforge dot net>\n\n *\n\n * This software is provided 'as-is', without any express or implied\n\n * warranty. In no event will the authors be held liable for any\n\n * damages arising from the use of this software.\n\n *\n\n * Permission is granted to anyone to use this software for any purpose,\n\n * including commercial applications, and to alter it and redistribute\n\n * it freely, subject to the following restrictions:\n\n *\n\n * 1. The origin of this software must not be misrepresented; you must\n\n * not claim that you wrote the original software. If you use this\n\n * software in a product, an acknowledgement in the product\n\n * documentation would be appreciated but is not required.\n\n * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n","file_path":"Studio/debug_memory/bool_array.h","rank":63,"score":54816.890274846315},{"content":"// -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*-\n\n// vim:tabstop=4:shiftwidth=4:expandtab:\n\n\n\n/*\n\n * Copyright (C) 2004-2013 Wu Yongwei <adah at users dot sourceforge dot net>\n\n *\n\n * This software is provided 'as-is', without any express or implied\n\n * warranty. In no event will the authors be held liable for any\n\n * damages arising from the use of this software.\n\n *\n\n * Permission is granted to anyone to use this software for any purpose,\n\n * including commercial applications, and to alter it and redistribute\n\n * it freely, subject to the following restrictions:\n\n *\n\n * 1. The origin of this software must not be misrepresented; you must\n\n * not claim that you wrote the original software. If you use this\n\n * software in a product, an acknowledgement in the product\n\n * documentation would be appreciated but is not required.\n\n * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n","file_path":"Engine/debug_memory/bool_array.h","rank":64,"score":54816.890274846315},{"content":"{\n\n assert(_M_byte_ptr);\n\n assert(pos < _M_length);\n\n return reference(_M_byte_ptr, pos);\n\n}\n\n\n\n/**\n\n * Creates a const reference to an array element.\n\n *\n\n * @param pos position of the array element to access\n\n * @return const reference to the specified element\n\n */\n\ninline bool_array::const_reference bool_array::operator[](size_type pos) const\n\n{\n\n assert(_M_byte_ptr);\n\n assert(pos < _M_length);\n\n return const_reference(_M_byte_ptr, pos);\n\n}\n\n\n\n/**\n","file_path":"Engine/debug_memory/bool_array.h","rank":65,"score":54816.2409487314},{"content":"{\n\n assert(_M_byte_ptr);\n\n assert(pos < _M_length);\n\n return reference(_M_byte_ptr, pos);\n\n}\n\n\n\n/**\n\n * Creates a const reference to an array element.\n\n *\n\n * @param pos position of the array element to access\n\n * @return const reference to the specified element\n\n */\n\ninline bool_array::const_reference bool_array::operator[](size_type pos) const\n\n{\n\n assert(_M_byte_ptr);\n\n assert(pos < _M_length);\n\n return const_reference(_M_byte_ptr, pos);\n\n}\n\n\n\n/**\n","file_path":"Studio/debug_memory/bool_array.h","rank":66,"score":54816.2409487314},{"content":"#include <stdio.h> // FILE\n\n#include \"_nvwa.h\" // NVWA_NAMESPACE_*\n\n#include \"c++11.h\" // _NOEXCEPT\n\n\n\n/* Special allocation/deallocation functions in the global scope */\n\nvoid* operator new(size_t size, const char* file, int line);\n\nvoid* operator new[](size_t size, const char* file, int line);\n\nvoid operator delete(void* ptr, const char* file, int line) _NOEXCEPT;\n\nvoid operator delete[](void* ptr, const char* file, int line) _NOEXCEPT;\n\n\n\nNVWA_NAMESPACE_BEGIN\n\n\n\n/**\n\n * @def _DEBUG_NEW_REDEFINE_NEW\n\n *\n\n * Macro to indicate whether redefinition of \\c new is wanted. If one\n\n * wants to define one's own <code>operator new</code>, or to call\n\n * <code>operator new</code> directly, it should be defined to \\c 0 to\n\n * alter the default behaviour. Unless, of course, one is willing to\n\n * take the trouble to write something like:\n","file_path":"Engine/debug_memory/debug_new.h","rank":67,"score":54814.385796934825},{"content":"#include <stdio.h> // FILE\n\n#include \"_nvwa.h\" // NVWA_NAMESPACE_*\n\n#include \"c++11.h\" // _NOEXCEPT\n\n\n\n/* Special allocation/deallocation functions in the global scope */\n\nvoid* operator new(size_t size, const char* file, int line);\n\nvoid* operator new[](size_t size, const char* file, int line);\n\nvoid operator delete(void* ptr, const char* file, int line) _NOEXCEPT;\n\nvoid operator delete[](void* ptr, const char* file, int line) _NOEXCEPT;\n\n\n\nNVWA_NAMESPACE_BEGIN\n\n\n\n/**\n\n * @def _DEBUG_NEW_REDEFINE_NEW\n\n *\n\n * Macro to indicate whether redefinition of \\c new is wanted. If one\n\n * wants to define one's own <code>operator new</code>, or to call\n\n * <code>operator new</code> directly, it should be defined to \\c 0 to\n\n * alter the default behaviour. Unless, of course, one is willing to\n\n * take the trouble to write something like:\n","file_path":"Studio/debug_memory/debug_new.h","rank":68,"score":54814.385796934825},{"content":" static size_t get_num_bytes_from_bits(size_type num_bits);\n\n\n\nprivate:\n\n byte get_8bits(size_type offset, size_type end) const;\n\n\n\n byte* _M_byte_ptr;\n\n size_type _M_length;\n\n static byte _S_bit_count[256];\n\n static byte _S_bit_ordinal[256];\n\n};\n\n\n\n\n\n/* Inline functions */\n\n\n\n/**\n\n * Constructs a reference to an array element.\n\n *\n\n * @param ptr ptr to the interal boolean data\n\n * @param pos position of the array element to access\n\n */\n","file_path":"Engine/debug_memory/bool_array.h","rank":69,"score":54810.9597530575},{"content":" static size_t get_num_bytes_from_bits(size_type num_bits);\n\n\n\nprivate:\n\n byte get_8bits(size_type offset, size_type end) const;\n\n\n\n byte* _M_byte_ptr;\n\n size_type _M_length;\n\n static byte _S_bit_count[256];\n\n static byte _S_bit_ordinal[256];\n\n};\n\n\n\n\n\n/* Inline functions */\n\n\n\n/**\n\n * Constructs a reference to an array element.\n\n *\n\n * @param ptr ptr to the interal boolean data\n\n * @param pos position of the array element to access\n\n */\n","file_path":"Studio/debug_memory/bool_array.h","rank":70,"score":54810.9597530575},{"content":"/**\n\n * @def _DEBUG_NEW_TYPE\n\n *\n\n * Macro to indicate which variant of #DEBUG_NEW is wanted. The\n\n * default value \\c 1 allows the use of placement new (like\n\n * <code>%new(std::nothrow)</code>), but the verbose output (when\n\n * nvwa#new_verbose_flag is \\c true) looks worse than some older\n\n * versions (no file/line information for allocations). Define it\n\n * to \\c 2 to revert to the old behaviour that records file and line\n\n * information directly on the call to <code>operator new</code>.\n\n */\n\n#ifndef _DEBUG_NEW_TYPE\n\n#define _DEBUG_NEW_TYPE 1\n\n#endif\n\n\n\n/* Prototypes */\n\nint check_leaks();\n\nint check_mem_corruption();\n\n\n\n/* Control variables */\n","file_path":"Engine/debug_memory/debug_new.h","rank":71,"score":54809.13761721055},{"content":"/**\n\n * @def _DEBUG_NEW_TYPE\n\n *\n\n * Macro to indicate which variant of #DEBUG_NEW is wanted. The\n\n * default value \\c 1 allows the use of placement new (like\n\n * <code>%new(std::nothrow)</code>), but the verbose output (when\n\n * nvwa#new_verbose_flag is \\c true) looks worse than some older\n\n * versions (no file/line information for allocations). Define it\n\n * to \\c 2 to revert to the old behaviour that records file and line\n\n * information directly on the call to <code>operator new</code>.\n\n */\n\n#ifndef _DEBUG_NEW_TYPE\n\n#define _DEBUG_NEW_TYPE 1\n\n#endif\n\n\n\n/* Prototypes */\n\nint check_leaks();\n\nint check_mem_corruption();\n\n\n\n/* Control variables */\n","file_path":"Studio/debug_memory/debug_new.h","rank":72,"score":54809.13761721055},{"content":"# define new DEBUG_NEW\n\n# endif\n\n# ifdef _DEBUG_NEW_EMULATE_MALLOC\n\n# include <stdlib.h>\n\n# ifdef new\n\n# define malloc(s) ((void*)(new char[s]))\n\n# else\n\n# define malloc(s) ((void*)(DEBUG_NEW char[s]))\n\n# endif\n\n# define free(p) delete[] (char*)(p)\n\n# endif\n\n\n\n/**\n\n * Recorder class to remember the call context.\n\n *\n\n * The idea comes from <a href=\"http://groups.google.com/group/comp.lang.c++.moderated/browse_thread/thread/7089382e3bc1c489/85f9107a1dc79ee9?#85f9107a1dc79ee9\">Greg Herlihy's post</a> in comp.lang.c++.moderated.\n\n */\n","file_path":"Engine/debug_memory/debug_new.h","rank":73,"score":54806.47693853767},{"content":"# define new DEBUG_NEW\n\n# endif\n\n# ifdef _DEBUG_NEW_EMULATE_MALLOC\n\n# include <stdlib.h>\n\n# ifdef new\n\n# define malloc(s) ((void*)(new char[s]))\n\n# else\n\n# define malloc(s) ((void*)(DEBUG_NEW char[s]))\n\n# endif\n\n# define free(p) delete[] (char*)(p)\n\n# endif\n\n\n\n/**\n\n * Recorder class to remember the call context.\n\n *\n\n * The idea comes from <a href=\"http://groups.google.com/group/comp.lang.c++.moderated/browse_thread/thread/7089382e3bc1c489/85f9107a1dc79ee9?#85f9107a1dc79ee9\">Greg Herlihy's post</a> in comp.lang.c++.moderated.\n\n */\n","file_path":"Studio/debug_memory/debug_new.h","rank":74,"score":54806.47693853767},{"content":"extern bool new_autocheck_flag; // default to true: call check_leaks() on exit\n\nextern bool new_verbose_flag; // default to false: no verbose information\n\nextern FILE* new_output_fp; // default to stderr: output to console\n\nextern const char* new_progname;// default to NULL; should be assigned argv[0]\n\n\n\n/**\n\n * @def DEBUG_NEW\n\n *\n\n * Macro to catch file/line information on allocation. If\n\n * #_DEBUG_NEW_REDEFINE_NEW is \\c 0, one can use this macro directly;\n\n * otherwise \\c new will be defined to it, and one must use \\c new\n\n * instead.\n\n */\n\n# if _DEBUG_NEW_TYPE == 1\n\n# define DEBUG_NEW NVWA::debug_new_recorder(__FILE__, __LINE__) ->* new\n\n# else\n\n# define DEBUG_NEW new(__FILE__, __LINE__)\n\n# endif\n\n\n\n# if _DEBUG_NEW_REDEFINE_NEW\n","file_path":"Engine/debug_memory/debug_new.h","rank":75,"score":54805.78791710394},{"content":"\n\n Qt::CheckState itemCheckState(int index) const;\n\n void setItemCheckState(int index, Qt::CheckState state);\n\n\n\n QString separator() const;\n\n void setSeparator(const QString& separator);\n\n\n\n QStringList checkedItems() const;\n\n QStringList checkedData() const;\n\n\n\n QList<int> checkedIndexes();\n\n\n\n\n\n bool eventFilter(QObject* receiver, QEvent* event);\n\n QString _separator;\n\n QString _defaultText;\n\n bool containerMousePress;\n\n\n\n //virtual void paintEvent(QPaintEvent *event);\n\n\n","file_path":"Engine/qxtcheckcombobox.h","rank":76,"score":46.479770076673894},{"content":" int index = 0;\n\n foreach (DatabaseColumn Column, Columns)\n\n {\n\n QVariant val;\n\n QWidget*DataItem = Widgets[Column.Id];\n\n switch(Column.Type)\n\n {\n\n case DatabaseColumn::String: val = qobject_cast<QLineEdit*>(DataItem)->text(); break;\n\n case DatabaseColumn::Int: val = qobject_cast<QSpinBox*>(DataItem)->value(); break;\n\n case DatabaseColumn::Bool: val = qobject_cast<QCheckBox*>(DataItem)->isChecked(); break;\n\n case DatabaseColumn::Date: val = qobject_cast<QDateTimeEdit*>(DataItem)->dateTime(); break;\n\n\n\n }\n\n res.Data[Column.Id] = val;\n\n index++;\n\n }\n\n return res;\n\n}\n\n\n\nvoid DatabaseAdminItemEdit::SetDatabaseItem(DatabaseItem Item)\n","file_path":"Engine/databaseadminitemedit.cpp","rank":78,"score":42.19681964769058},{"content":" {\n\n QLabel *Label = new QLabel(this);\n\n Label->setText(Column.Description);\n\n QWidget *DataItem;\n\n switch(Column.Type)\n\n {\n\n case DatabaseColumn::String: {QLineEdit* e = new QLineEdit(this);e->setMaxLength(2147483647); DataItem = e;} break;\n\n case DatabaseColumn::Int: {QSpinBox * w = new QSpinBox(this);w->setMinimum(-1000000);w->setMaximum(1000000);DataItem = w;} break;\n\n case DatabaseColumn::Bool: DataItem = new QCheckBox(this); break;\n\n case DatabaseColumn::Date: DataItem = new QDateTimeEdit(this); break;\n\n\n\n }\n\n Widgets[Column.Id] = DataItem;\n\n ui->MainLayout->addRow(Label,DataItem);\n\n }\n\n}\n\n\n\nvoid DatabaseAdminItemEdit::HideGroupBox()\n\n{\n\n ui->comboBox->setVisible(false);\n","file_path":"Engine/databaseadminitemedit.cpp","rank":81,"score":39.28948896391996},{"content":" {\n\n i.next();\n\n std::string column = QString::number(i.key()).toStdString();\n\n switch(i.value().type())\n\n {\n\n case QVariant::Int:\n\n {\n\n ItemBuild.append(column,i.value().toInt());\n\n }break;\n\n case QVariant::String:\n\n {\n\n ItemBuild.append(column,i.value().toString().toStdString());\n\n }break;\n\n case QVariant::Bool:\n\n {\n\n ItemBuild.append(column,i.value().toBool());\n\n }break;\n\n case QVariant::DateTime:\n\n {\n\n ItemBuild.append(column,Date_t(i.value().toDateTime().toMSecsSinceEpoch()));\n","file_path":"Engine/mongodatabaseconnector.cpp","rank":82,"score":38.0277790571506},{"content":" item.Id = id;\n\n item.IsNull = false;\n\n\n\n for(int i = 0;i<Params.length() - 1;i+=2)\n\n {\n\n int ColumnIndex = Params.at(i).toInt();\n\n QString val = Params.at(i+1);\n\n\n\n QVariant VariantParam;\n\n foreach(DatabaseColumn Column, Columns)\n\n {\n\n if(ColumnIndex == Column.Id)\n\n {\n\n switch(Column.Type)\n\n {\n\n case DatabaseColumn::Int: VariantParam = QVariant(val.toInt());break;\n\n case DatabaseColumn::String: VariantParam = QVariant(val);break;\n\n case DatabaseColumn::Bool: VariantParam = QVariant(val == \"true\");break;\n\n case DatabaseColumn::Date:\n\n {\n","file_path":"Engine/engineresourcestringbox.cpp","rank":83,"score":37.36104226344257},{"content":" {\n\n case DatabaseColumn::String: qobject_cast<QLineEdit*>(DataItem)->setText(val.toString()); break;\n\n case DatabaseColumn::Int: qobject_cast<QSpinBox*>(DataItem)->setValue(val.toInt()); break;\n\n case DatabaseColumn::Bool: qobject_cast<QCheckBox*>(DataItem)->setChecked(val.toBool()); break;\n\n case DatabaseColumn::Date: qobject_cast<QDateTimeEdit*>(DataItem)->setDateTime(val.toDateTime()); break;\n\n\n\n }\n\n }\n\n\n\n\n\n }\n\n}\n\n\n\nDatabaseAdminItemEdit::~DatabaseAdminItemEdit()\n\n{\n\n delete ui;\n\n}\n","file_path":"Engine/databaseadminitemedit.cpp","rank":84,"score":36.77955417559164},{"content":" emit Done(\"Closed by user\",id,false);\n\n this->deleteLater();\n\n }\n\n\n\n void SingleCaptchaWidget::on_pushButton_clicked()\n\n {\n\n emit Done(ui->lineEdit->text(),id,true);\n\n this->deleteLater();\n\n }\n\n\n\n void SingleCaptchaWidget::on_lineEdit_returnPressed()\n\n {\n\n emit Done(ui->lineEdit->text(),id,true);\n\n this->deleteLater();\n\n }\n\n\n\n void SingleCaptchaWidget::changeEvent(QEvent *e)\n\n {\n\n QWidget::changeEvent(e);\n\n switch (e->type()) {\n","file_path":"Engine/singlecaptchawidget.cpp","rank":85,"score":35.997168804264916},{"content":" state = Disconnected;\n\n}\n\n\n\nvoid QxtPop3Private::socketRead()\n\n{\n\n buffer += socket->readAll();\n\n while (true)\n\n {\n\n int pos = buffer.indexOf(\"\\r\\n\");\n\n if (pos < 0) return;\n\n QByteArray line = buffer.left(pos);\n\n buffer = buffer.mid(pos + 2);\n\n// qDebug(\"QxtPop3Private::socketRead: received %s\", line.data());\n\n switch (state)\n\n {\n\n case StartState: // we expect a greetings line, beginning with \"+OK\"\n\n if (!QxtPop3ReplyImpl::isAnswerOK(line))\n\n {\n\n q_func()->disconnectFromHost();\n\n }\n","file_path":"Engine/mail/mailpop3.cpp","rank":86,"score":35.64543978789018},{"content":"\n\n void UserResourceWrapper::VisibilityTriggerChanged(const QString& Value)\n\n {\n\n QStringList list = GetVisibilityConditionValue().split(QRegExp(\"[\\\\|\\\\;\\\\,]\"));\n\n bool res = false;\n\n foreach(QString item, list)\n\n {\n\n if(Value.contains(item))\n\n {\n\n res = true;\n\n break;\n\n }\n\n }\n\n IsVisibleAccordingToTrigger = res;\n\n emit RequiresValidationStateChanged(IsVisible && IsVisibleAccordingToTrigger && DependendVisibilityParentVisible);\n\n\n\n if(res)\n\n {\n\n Widget->SetVisibleToUser(IsVisible && DependendVisibilityParentVisible && IsAdvancedVisible);\n\n emit VisibilityChanged(IsVisible && DependendVisibilityParentVisible && IsAdvancedVisible);\n","file_path":"Engine/userresourcewrapper.cpp","rank":87,"score":35.450326053854084},{"content":" return QWidget::eventFilter(obj, event);\n\n}\n\n\n\nvoid UIConstructor::EditUnit(int index)\n\n{\n\n QDialog d;\n\n d.setMinimumWidth(400);\n\n d.setWindowTitle(tr(\"Edit resource\"));\n\n d.setLayout(new QVBoxLayout(&d));\n\n d.layout()->setAlignment(Qt::AlignTop);\n\n QWidget *WidgetResource = Data[CurrentTab][index].WidgetEdit;\n\n QWidget *WidgetParent = WidgetResource->parentWidget();\n\n QVBoxLayout *LayoutParent = dynamic_cast<QVBoxLayout *>(WidgetParent->layout());\n\n int Index = LayoutParent->indexOf(WidgetResource);\n\n QScrollArea *Scroll = new QScrollArea(&d);\n\n Scroll->setWidgetResizable(true);\n\n QWidget *ScrollWidget = new QWidget(Scroll);\n\n ScrollWidget->setLayout(new QVBoxLayout(ScrollWidget));\n\n ScrollWidget->layout()->addWidget(WidgetResource);\n\n ScrollWidget->layout()->addItem(new QSpacerItem(10, 10, QSizePolicy::Expanding, QSizePolicy::Expanding));\n","file_path":"Engine/uiconstructor.cpp","rank":88,"score":35.33094006532995},{"content":" typedef value::object object;\n\n \n\n inline value::value() : type_(null_type) {}\n\n \n\n inline value::value(int type, bool) : type_(type) {\n\n switch (type) {\n\n#define INIT(p, v) case p##type: u_.p = v; break\n\n INIT(boolean_, false);\n\n INIT(number_, 0.0);\n\n#ifdef PICOJSON_USE_INT64\n\n INIT(int64_, 0);\n\n#endif\n\n INIT(string_, new std::string());\n\n INIT(array_, new array());\n\n INIT(object_, new object());\n\n#undef INIT\n\n default: break;\n\n }\n\n }\n\n \n","file_path":"ChromeWorker/json/picojson.h","rank":89,"score":35.02916299160572},{"content":"\n\n\n\n\n\nQWidget* DesignChooserResourceWidget::GetTemplateWidgetByIndex(int index)\n\n{\n\n return ui->stackedWidget->widget(index);\n\n}\n\n\n\nvoid DesignChooserResourceWidget::changeEvent(QEvent *e)\n\n{\n\n QWidget::changeEvent(e);\n\n switch (e->type()) {\n\n case QEvent::LanguageChange:\n\n ui->retranslateUi(this);\n\n break;\n\n default:\n\n break;\n\n }\n\n}\n\n\n","file_path":"Engine/designchooserresourcewidget.cpp","rank":90,"score":35.000525270605195},{"content":" {\n\n ui->ComboType->addItem(tr(\"Is True\"));\n\n ui->ComboType->addItem(tr(\"Is False\"));\n\n }break;\n\n }\n\n}\n\n\n\nvoid DatabaseAdminFilterCreate::on_ComboType_currentIndexChanged(int index)\n\n{\n\n if(Widget)\n\n {\n\n delete Widget;\n\n Widget = 0;\n\n }\n\n DatabaseColumn Column = Columns[ui->ComboColumn->currentIndex()];\n\n switch(Column.Type)\n\n {\n\n case DatabaseColumn::String:\n\n {\n\n if(index == 2)\n","file_path":"Engine/databaseadminfiltercreate.cpp","rank":91,"score":34.93993837027039},{"content":" {\n\n case DatabaseColumn::Int:\n\n {\n\n ItemBuild.append(column_name,Item.toInt());\n\n }break;\n\n case DatabaseColumn::String:\n\n {\n\n ItemBuild.append(column_name,Item.toStdString());\n\n }break;\n\n case DatabaseColumn::Bool:\n\n {\n\n ItemBuild.append(column_name,Item == \"true\");\n\n }break;\n\n case DatabaseColumn::Date:\n\n {\n\n ItemBuild.append(column_name,Date_t(QDateTime::fromString(\"yyyy-MM-dd HH:mm:ss\").toMSecsSinceEpoch()));\n\n }break;\n\n\n\n }\n\n index++;\n","file_path":"Engine/mongodatabaseconnector.cpp","rank":92,"score":34.81466846196093},{"content":"\n\n\n\n void DesignResourceWidget::changeEvent(QEvent *e)\n\n {\n\n QGroupBox::changeEvent(e);\n\n switch (e->type()) {\n\n case QEvent::LanguageChange:\n\n {\n\n int index = ui->comboBox->currentIndex();\n\n ui->retranslateUi(this);\n\n ui->comboBox->setCurrentIndex(index);\n\n DescriptionChanged(DescriptionTextBox->GetCurrentText());\n\n break;\n\n }\n\n default:\n\n break;\n\n }\n\n }\n\n\n\n\n","file_path":"Engine/designresourcewidget.cpp","rank":93,"score":34.27579166687983},{"content":"public Q_SLOTS:\n\n void setCheckedItems(const QStringList& items);\n\n void setCheckedData(const QStringList& items);\n\n void setCheckedIndexes(const QList<int>& indexes);\n\n QList<int> currentIndexes();\n\n\n\n void updateCheckedItems();\n\n void toggleCheckState(int index);\n\n\n\nQ_SIGNALS:\n\n void checkedItemsChanged(const QStringList& items);\n\n void checkedIndexesChanged(const QList<int>& itemsLast,const QList<int>& itemsNew);\n\n};\n\n\n\n#endif // QXTCHECKCOMBOBOX_H\n","file_path":"Engine/qxtcheckcombobox.h","rank":94,"score":34.099838573441815},{"content":" virtual bool IsValid() = 0;\n\n virtual bool GetRequiresValidation() = 0;\n\n\n\n virtual bool GetIsAdvancedVisible() = 0;\n\n\n\n virtual void SetVisibleAdvanced(bool Visible) = 0;\n\n\n\n signals:\n\n void Up(int index);\n\n void Down(int index);\n\n void VariableNameChanged(QString name);\n\n void ResourceDestroyed();\n\n void VisibilityChanged(bool Visible);\n\n void ValidationStateChanged();\n\n void RequiresValidationStateChanged(bool Visible);\n\n public slots:\n\n virtual void VisibilityTriggerChanged(const QString& Value) = 0;\n\n virtual void VisibilityParentChanged(bool Visible) = 0;\n\n virtual void VisibilityAdvancedChanged(bool Visible) = 0;\n\n };\n\n}\n\n\n\n#endif // IRESOURCEWIDGET_H\n","file_path":"Engine/iresourcewidget.h","rank":95,"score":33.92772862319036},{"content":"void DatabaseAdminTable::SingleItemEdit(QString Index)\n\n{\n\n DatabaseAdminItemEdit d;\n\n\n\n d.HideGroupBox();\n\n QList<DatabaseColumn> columns = DatabaseConnector->GetColumns(TableId);\n\n\n\n d.SetColumns(columns);\n\n\n\n bool found = false;\n\n DatabaseItem Item;\n\n foreach(DatabaseItem i, CurrentItems)\n\n {\n\n if(i.Id == Index)\n\n {\n\n Item = i;\n\n found = true;\n\n break;\n\n }\n\n }\n","file_path":"Engine/databaseadmintable.cpp","rank":97,"score":33.731558432727546},{"content":" dataStream >> text >> offset;\n\n\n\n\n\n\n\n QLabel *newIcon = new QLabel(this);\n\n newIcon->setText(text);\n\n\n\n int index = 0;\n\n\n\n while(index < Layout->count())\n\n {\n\n QLayoutItem* item = Layout->itemAt(index);\n\n if(item)\n\n {\n\n if(!item->widget())\n\n {\n\n break;\n\n }\n\n if(!((event->pos() - offset).y() > item->widget()->pos().y()))\n\n {\n","file_path":"Engine/dragwidget.cpp","rank":99,"score":33.24865800299428}],"string":"[\n {\n \"content\": \"var Index = GetInputConstructorValue(\\\"Index\\\", loader);\\n\",\n \"file_path\": \"Modules/List/js/get_list_element_by_index_select.js\",\n \"rank\": 0,\n \"score\": 107529.92272205185\n },\n {\n \"content\": \"class DatabaseAdminItemEdit;\\n\\n}\\n\\nusing namespace BrowserAutomationStudioFramework;\\n\",\n \"file_path\": \"Engine/databaseadminitemedit.h\",\n \"rank\": 1,\n \"score\": 105654.5356569789\n },\n {\n \"content\": \"local void zip64local_putValue_inmemory OF((void* dest, ZPOS64_T x, int nbByte));\\n\",\n \"file_path\": \"Engine/zip/zip.c\",\n \"rank\": 2,\n \"score\": 100719.33099010467\n },\n {\n \"content\": \"local void zip64local_putValue_inmemory OF((void* dest, ZPOS64_T x, int nbByte));\\n\",\n \"file_path\": \"Updater/zip/zip.c\",\n \"rank\": 3,\n \"score\": 100719.33099010467\n },\n {\n \"content\": \"local int unz64local_getByte OF((\\n\",\n \"file_path\": \"Updater/zip/unzip.c\",\n \"rank\": 4,\n \"score\": 100647.94641337525\n },\n {\n \"content\": \"local int unz64local_getByte OF((\\n\",\n \"file_path\": \"Engine/zip/unzip.c\",\n \"rank\": 5,\n \"score\": 100647.94641337525\n },\n {\n \"content\": \"local int zip64local_getLong64 OF((const zlib_filefunc64_32_def* pzlib_filefunc_def, voidpf filestream, ZPOS64_T *pX));\\n\",\n \"file_path\": \"Updater/zip/zip.c\",\n \"rank\": 6,\n \"score\": 100642.47172968116\n },\n {\n \"content\": \"local int zip64local_getLong64 OF((const zlib_filefunc64_32_def* pzlib_filefunc_def, voidpf filestream, ZPOS64_T *pX));\\n\",\n \"file_path\": \"Engine/zip/zip.c\",\n \"rank\": 7,\n \"score\": 100642.47172968116\n },\n {\n \"content\": \"local void zip64local_putValue_inmemory OF((void* dest, ZPOS64_T x, int nbByte));\\n\",\n \"file_path\": \"RemoteExecuteScript/zip/zip.c\",\n \"rank\": 8,\n \"score\": 97321.69593421812\n },\n {\n \"content\": \"local int unz64local_getByte OF((\\n\",\n \"file_path\": \"RemoteExecuteScript/zip/unzip.c\",\n \"rank\": 9,\n \"score\": 97251.24585410111\n },\n {\n \"content\": \"local int zip64local_getLong64 OF((const zlib_filefunc64_32_def* pzlib_filefunc_def, voidpf filestream, ZPOS64_T *pX));\\n\",\n \"file_path\": \"RemoteExecuteScript/zip/zip.c\",\n \"rank\": 10,\n \"score\": 97245.77117040701\n },\n {\n \"content\": \"class DatabaseAdminItemEdit : public QDialog\\n\\n{\\n\\n Q_OBJECT\\n\\n QHash<int,QWidget *> Widgets;\\n\\n QList<DatabaseColumn> Columns;\\n\\n\\n\\npublic:\\n\\n explicit DatabaseAdminItemEdit(QWidget *parent = 0);\\n\\n ~DatabaseAdminItemEdit();\\n\\n void SetColumns(QList<DatabaseColumn> Columns);\\n\\n void SetGroupList(QStringList Groups);\\n\\n void SetSelectedGroup(int index);\\n\\n int GetSelectedIndex();\\n\\n void HideGroupBox();\\n\\n DatabaseItem GetDatabaseItem();\\n\\n void SetDatabaseItem(DatabaseItem Item);\\n\\nprivate:\\n\\n Ui::DatabaseAdminItemEdit *ui;\\n\\n};\\n\\n\\n\\n#endif // DATABASEADMINITEMEDIT_H\\n\",\n \"file_path\": \"Engine/databaseadminitemedit.h\",\n \"rank\": 11,\n \"score\": 95084.47661727692\n },\n {\n \"content\": \"#ifdef LODEPNG_COMPILE_PNG\\n\\nclass State : public LodePNGState\\n\\n{\\n\\n public:\\n\\n State();\\n\\n State(const State& other);\\n\\n virtual ~State();\\n\\n State& operator=(const State& other);\\n\\n};\\n\\n\\n\\n#ifdef LODEPNG_COMPILE_DECODER\\n\\n/* Same as other lodepng::decode, but using a State for more settings and information. */\\n\\nunsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h,\\n\\n State& state,\\n\\n const unsigned char* in, size_t insize);\\n\\nunsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h,\\n\\n State& state,\\n\\n const std::vector<unsigned char>& in);\\n\\n#endif /*LODEPNG_COMPILE_DECODER*/\\n\\n\\n\\n#ifdef LODEPNG_COMPILE_ENCODER\\n\",\n \"file_path\": \"ChromeWorker/png/lodepng.h\",\n \"rank\": 12,\n \"score\": 95049.04685941734\n },\n {\n \"content\": \"var els = $(\\\"*[data-table-id=\\\" + Table + \\\"]\\\")\\n\",\n \"file_path\": \"Modules/Database/js/database_insert_record_select.js\",\n \"rank\": 13,\n \"score\": 93000.63835306438\n },\n {\n \"content\": \"var els = $(\\\"*[data-table-id=\\\" + Table + \\\"]\\\")\\n\",\n \"file_path\": \"Modules/Database/js/database_update_record_select.js\",\n \"rank\": 14,\n \"score\": 93000.63835306438\n },\n {\n \"content\": \"var Index = GetInputConstructorValue(\\\"Index\\\", loader);\\n\",\n \"file_path\": \"Modules/List/js/insert_element_to_list_select.js\",\n \"rank\": 15,\n \"score\": 92987.60745450656\n },\n {\n \"content\": \"var Index = GetInputConstructorValue(\\\"Index\\\", loader);\\n\",\n \"file_path\": \"Modules/List/js/list_set_element_select.js\",\n \"rank\": 16,\n \"score\": 92987.60745450656\n },\n {\n \"content\": \"var Value = GetInputConstructorValue(\\\"Value\\\", loader);\\n\",\n \"file_path\": \"Modules/List/js/delete_by_index_select.js\",\n \"rank\": 17,\n \"score\": 89112.54011689377\n },\n {\n \"content\": \"var Value = GetInputConstructorValue(\\\"Value\\\", loader);\\n\",\n \"file_path\": \"Modules/List/js/get_index_from_list_select.js\",\n \"rank\": 18,\n \"score\": 86411.09007047981\n },\n {\n \"content\": \"11. state settings reference\\n\\n----------------------------\\n\\n\\n\\nA quick reference of some settings to set on the LodePNGState\\n\\n\\n\\nFor decoding:\\n\\n\\n\\nstate.decoder.zlibsettings.ignore_adler32: ignore ADLER32 checksums\\n\\nstate.decoder.zlibsettings.custom_...: use custom inflate function\\n\\nstate.decoder.ignore_crc: ignore CRC checksums\\n\\nstate.decoder.color_convert: convert internal PNG color to chosen one\\n\\nstate.decoder.read_text_chunks: whether to read in text metadata chunks\\n\\nstate.decoder.remember_unknown_chunks: whether to read in unknown chunks\\n\\nstate.info_raw.colortype: desired color type for decoded image\\n\\nstate.info_raw.bitdepth: desired bit depth for decoded image\\n\\nstate.info_raw....: more color settings, see struct LodePNGColorMode\\n\\nstate.info_png....: no settings for decoder but ouput, see struct LodePNGInfo\\n\\n\\n\\nFor encoding:\\n\\n\\n\",\n \"file_path\": \"ChromeWorker/png/lodepng.h\",\n \"rank\": 19,\n \"score\": 85019.3226670419\n },\n {\n \"content\": \"class bool_array\\n\\n{\\n\\npublic:\\n\\n#if (defined(__x86_64) || defined(__ia64) || defined(__ppc64__) || \\\\\\n\\n defined(_WIN64) || defined(_M_IA64)) && \\\\\\n\\n !(defined(_LP64) || defined(__lp64))\\n\\n /** Type of array indices. */\\n\\n typedef unsigned long long size_type;\\n\\n#else\\n\\n /** Type of array indices. */\\n\\n typedef unsigned long size_type;\\n\\n#endif\\n\\n\\n\\nprivate:\\n\\n /** Private definition of byte to avoid polluting the global namespace. */\\n\\n typedef unsigned char byte;\\n\\n\\n\\n /** Class to represent a reference to an array element. */\\n\\n template <typename _Byte_type>\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 20,\n \"score\": 65697.39776177352\n },\n {\n \"content\": \"class bool_array\\n\\n{\\n\\npublic:\\n\\n#if (defined(__x86_64) || defined(__ia64) || defined(__ppc64__) || \\\\\\n\\n defined(_WIN64) || defined(_M_IA64)) && \\\\\\n\\n !(defined(_LP64) || defined(__lp64))\\n\\n /** Type of array indices. */\\n\\n typedef unsigned long long size_type;\\n\\n#else\\n\\n /** Type of array indices. */\\n\\n typedef unsigned long size_type;\\n\\n#endif\\n\\n\\n\\nprivate:\\n\\n /** Private definition of byte to avoid polluting the global namespace. */\\n\\n typedef unsigned char byte;\\n\\n\\n\\n /** Class to represent a reference to an array element. */\\n\\n template <typename _Byte_type>\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 21,\n \"score\": 65697.39776177352\n },\n {\n \"content\": \"class debug_new_recorder\\n\\n{\\n\\n const char* _M_file;\\n\\n const int _M_line;\\n\\n void _M_process(void* ptr);\\n\\npublic:\\n\\n /**\\n\\n * Constructor to remember the call context. The information will\\n\\n * be used in debug_new_recorder::operator->*.\\n\\n */\\n\\n debug_new_recorder(const char* file, int line)\\n\\n : _M_file(file), _M_line(line) {}\\n\\n /**\\n\\n * Operator to write the context information to memory.\\n\\n * <code>operator->*</code> is chosen because it has the right\\n\\n * precedence, it is rarely used, and it looks good: so people can\\n\\n * tell the special usage more quickly.\\n\\n */\\n\\n template <class _Tp> _Tp* operator->*(_Tp* ptr)\\n\\n { _M_process(ptr); return ptr; }\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.h\",\n \"rank\": 22,\n \"score\": 64192.76177119041\n },\n {\n \"content\": \"class debug_new_counter\\n\\n{\\n\\n static int _S_count;\\n\\npublic:\\n\\n debug_new_counter();\\n\\n ~debug_new_counter();\\n\\n};\\n\\n/** Counting object for each file including debug_new.h. */\\n\\nstatic debug_new_counter __debug_new_count;\\n\\n\\n\\nNVWA_NAMESPACE_END\\n\\n\\n\\n#endif // NVWA_DEBUG_NEW_H\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.h\",\n \"rank\": 23,\n \"score\": 64192.76177119041\n },\n {\n \"content\": \"class debug_new_counter\\n\\n{\\n\\n static int _S_count;\\n\\npublic:\\n\\n debug_new_counter();\\n\\n ~debug_new_counter();\\n\\n};\\n\\n/** Counting object for each file including debug_new.h. */\\n\\nstatic debug_new_counter __debug_new_count;\\n\\n\\n\\nNVWA_NAMESPACE_END\\n\\n\\n\\n#endif // NVWA_DEBUG_NEW_H\\n\",\n \"file_path\": \"Studio/debug_memory/debug_new.h\",\n \"rank\": 24,\n \"score\": 64192.76177119041\n },\n {\n \"content\": \"class debug_new_recorder\\n\\n{\\n\\n const char* _M_file;\\n\\n const int _M_line;\\n\\n void _M_process(void* ptr);\\n\\npublic:\\n\\n /**\\n\\n * Constructor to remember the call context. The information will\\n\\n * be used in debug_new_recorder::operator->*.\\n\\n */\\n\\n debug_new_recorder(const char* file, int line)\\n\\n : _M_file(file), _M_line(line) {}\\n\\n /**\\n\\n * Operator to write the context information to memory.\\n\\n * <code>operator->*</code> is chosen because it has the right\\n\\n * precedence, it is rarely used, and it looks good: so people can\\n\\n * tell the special usage more quickly.\\n\\n */\\n\\n template <class _Tp> _Tp* operator->*(_Tp* ptr)\\n\\n { _M_process(ptr); return ptr; }\\n\",\n \"file_path\": \"Studio/debug_memory/debug_new.h\",\n \"rank\": 25,\n \"score\": 64192.76177119041\n },\n {\n \"content\": \"struct BufferAndFilter{std::string *Buffer; const QString* Filter;};\\n\",\n \"file_path\": \"Engine/QtCUrl.h\",\n \"rank\": 26,\n \"score\": 63835.055166312515\n },\n {\n \"content\": \" class ENGINESHARED_EXPORT DatabaseState : public IDatabaseState\\n\\n {\\n\\n Q_OBJECT\\n\\n QList<DatabaseTable> Tables;\\n\\n QHash<int, QList<DatabaseColumn> > Columns;\\n\\n QHash<int, QList<DatabaseGroup> > Groups;\\n\\n IDatabaseConnector *DatabaseConnector;\\n\\n public:\\n\\n explicit DatabaseState(QObject *parent = 0);\\n\\n virtual QList<DatabaseTable> GetDatabaseTables();\\n\\n virtual QList<DatabaseColumn> GetColumns(int TableId);\\n\\n virtual QList<DatabaseGroup> GetGroups(int TableId);\\n\\n virtual QString ToJson();\\n\\n void SetDatabaseConnector(IDatabaseConnector *DatabaseConnector);\\n\\n signals:\\n\\n\\n\\n public slots:\\n\\n void Reload();\\n\\n };\\n\\n}\\n\\n\\n\\n#endif // DATABASESTATE_H\\n\",\n \"file_path\": \"Engine/databasestate.h\",\n \"rank\": 27,\n \"score\": 62856.45170620578\n },\n {\n \"content\": \"struct new_ptr_list_t\\n\\n{\\n\\n new_ptr_list_t* next; ///< Pointer to the next memory block\\n\\n new_ptr_list_t* prev; ///< Pointer to the previous memory block\\n\\n size_t size; ///< Size of the memory block\\n\\n union\\n\\n {\\n\\n#if _DEBUG_NEW_FILENAME_LEN == 0\\n\\n const char* file; ///< Pointer to the file name of the caller\\n\\n#else\\n\\n char file[_DEBUG_NEW_FILENAME_LEN]; ///< File name of the caller\\n\\n#endif\\n\\n void* addr; ///< Address of the caller to \\\\e new\\n\\n };\\n\\n unsigned line :31; ///< Line number of the caller; or \\\\c 0\\n\\n unsigned is_array:1; ///< Non-zero iff <em>new[]</em> is used\\n\\n unsigned magic; ///< Magic number for error detection\\n\\n};\\n\\n\\n\\n/**\\n\",\n \"file_path\": \"Studio/debug_memory/debug_new.cpp\",\n \"rank\": 28,\n \"score\": 62777.6238909477\n },\n {\n \"content\": \"struct new_ptr_list_t\\n\\n{\\n\\n new_ptr_list_t* next; ///< Pointer to the next memory block\\n\\n new_ptr_list_t* prev; ///< Pointer to the previous memory block\\n\\n size_t size; ///< Size of the memory block\\n\\n union\\n\\n {\\n\\n#if _DEBUG_NEW_FILENAME_LEN == 0\\n\\n const char* file; ///< Pointer to the file name of the caller\\n\\n#else\\n\\n char file[_DEBUG_NEW_FILENAME_LEN]; ///< File name of the caller\\n\\n#endif\\n\\n void* addr; ///< Address of the caller to \\\\e new\\n\\n };\\n\\n unsigned line :31; ///< Line number of the caller; or \\\\c 0\\n\\n unsigned is_array:1; ///< Non-zero iff <em>new[]</em> is used\\n\\n unsigned magic; ///< Magic number for error detection\\n\\n};\\n\\n\\n\\n/**\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.cpp\",\n \"rank\": 29,\n \"score\": 62777.6238909477\n },\n {\n \"content\": \"var Value = GetInputConstructorValue(\\\"Value\\\", loader);\\n\",\n \"file_path\": \"Modules/List/js/delete_by_value_select.js\",\n \"rank\": 30,\n \"score\": 60177.65156049259\n },\n {\n \"content\": \"function creates a new chunk with the given parameters and appends it. Type is the 4-letter\\n\\nname of the chunk.\\n\\n\\n\",\n \"file_path\": \"ChromeWorker/png/lodepng.h\",\n \"rank\": 31,\n \"score\": 55884.114830104794\n },\n {\n \"content\": \"class QDropEvent;\\n\\n\\n\",\n \"file_path\": \"Engine/dragwidget.h\",\n \"rank\": 32,\n \"score\": 54862.931178905936\n },\n {\n \"content\": \"struct KeyState\\n\\n{\\n\\n bool IsShift;\\n\\n bool IsAlt;\\n\\n bool IsCtrl;\\n\\n KeyState();\\n\\n void Clear();\\n\\n bool IsClear();\\n\\n};\\n\",\n \"file_path\": \"ChromeWorker/browsereventsemulator.h\",\n \"rank\": 33,\n \"score\": 54859.54670868923\n },\n {\n \"content\": \"class DatabaseStateDialog;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Studio/databasestatedialog.h\",\n \"rank\": 34,\n \"score\": 54859.54670868923\n },\n {\n \"content\": \"7. error values\\n\\n---------------\\n\\n\\n\\nAll functions in LodePNG that return an error code, return 0 if everything went\\n\\nOK, or a non-zero code if there was an error.\\n\\n\\n\\nThe meaning of the LodePNG error values can be retrieved with the function\\n\\nlodepng_error_text: given the numerical error code, it returns a description\\n\\nof the error in English as a string.\\n\\n\\n\\nCheck the implementation of lodepng_error_text to see the meaning of each code.\\n\\n\\n\\n\\n\",\n \"file_path\": \"ChromeWorker/png/lodepng.h\",\n \"rank\": 35,\n \"score\": 54837.24586352779\n },\n {\n \"content\": \" class value {\\n\\n public:\\n\\n typedef std::vector<value> array;\\n\\n typedef std::map<std::string, value> object;\\n\\n union _storage {\\n\\n bool boolean_;\\n\\n double number_;\\n\\n#ifdef PICOJSON_USE_INT64\\n\\n int64_t int64_;\\n\\n#endif\\n\\n std::string* string_;\\n\\n array* array_;\\n\\n object* object_;\\n\\n };\\n\\n protected:\\n\\n int type_;\\n\\n _storage u_;\\n\\n public:\\n\\n value();\\n\\n value(int type, bool);\\n\",\n \"file_path\": \"ChromeWorker/json/picojson.h\",\n \"rank\": 36,\n \"score\": 54837.24586352779\n },\n {\n \"content\": \"template <typename _Byte_type>\\n\\ninline bool_array::_Element<_Byte_type>::_Element(\\n\\n _Byte_type* ptr,\\n\\n size_type pos)\\n\\n{\\n\\n _M_byte_ptr = ptr;\\n\\n _M_byte_pos = (size_t)(pos / 8);\\n\\n _M_bit_pos = (size_t)(pos % 8);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Assigns a new boolean value to an array element.\\n\\n *\\n\\n * @param value the new boolean value\\n\\n * @return the assigned boolean value\\n\\n */\\n\\ntemplate <typename _Byte_type>\\n\\ninline bool bool_array::_Element<_Byte_type>::operator=(bool value)\\n\\n{\\n\\n if (value)\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 37,\n \"score\": 54829.29914643171\n },\n {\n \"content\": \"template <typename _Byte_type>\\n\\ninline bool_array::_Element<_Byte_type>::_Element(\\n\\n _Byte_type* ptr,\\n\\n size_type pos)\\n\\n{\\n\\n _M_byte_ptr = ptr;\\n\\n _M_byte_pos = (size_t)(pos / 8);\\n\\n _M_bit_pos = (size_t)(pos % 8);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Assigns a new boolean value to an array element.\\n\\n *\\n\\n * @param value the new boolean value\\n\\n * @return the assigned boolean value\\n\\n */\\n\\ntemplate <typename _Byte_type>\\n\\ninline bool bool_array::_Element<_Byte_type>::operator=(bool value)\\n\\n{\\n\\n if (value)\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 38,\n \"score\": 54829.29914643171\n },\n {\n \"content\": \"\\n\\n size_type size() const _NOEXCEPT;\\n\\n size_type count() const _NOEXCEPT;\\n\\n size_type count(size_type begin, size_type end = npos) const;\\n\\n size_type find(bool value, size_type offset = 0) const;\\n\\n size_type find(bool value, size_type offset, size_type count) const;\\n\\n size_type find_until(bool value, size_type begin, size_type end) const;\\n\\n\\n\\n void flip() _NOEXCEPT;\\n\\n void swap(bool_array& rhs) _NOEXCEPT;\\n\\n void merge_and(const bool_array& rhs,\\n\\n size_type begin = 0,\\n\\n size_type end = npos,\\n\\n size_type offset = 0);\\n\\n void merge_or (const bool_array& rhs,\\n\\n size_type begin = 0,\\n\\n size_type end = npos,\\n\\n size_type offset = 0);\\n\\n void copy_to_bitmap(void* dest, size_type begin = 0, size_type end = npos);\\n\\n\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 39,\n \"score\": 54828.65478836206\n },\n {\n \"content\": \"\\n\\n size_type size() const _NOEXCEPT;\\n\\n size_type count() const _NOEXCEPT;\\n\\n size_type count(size_type begin, size_type end = npos) const;\\n\\n size_type find(bool value, size_type offset = 0) const;\\n\\n size_type find(bool value, size_type offset, size_type count) const;\\n\\n size_type find_until(bool value, size_type begin, size_type end) const;\\n\\n\\n\\n void flip() _NOEXCEPT;\\n\\n void swap(bool_array& rhs) _NOEXCEPT;\\n\\n void merge_and(const bool_array& rhs,\\n\\n size_type begin = 0,\\n\\n size_type end = npos,\\n\\n size_type offset = 0);\\n\\n void merge_or (const bool_array& rhs,\\n\\n size_type begin = 0,\\n\\n size_type end = npos,\\n\\n size_type offset = 0);\\n\\n void copy_to_bitmap(void* dest, size_type begin = 0, size_type end = npos);\\n\\n\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 40,\n \"score\": 54828.65478836206\n },\n {\n \"content\": \" static const size_type npos = (size_type)-1;\\n\\n#endif\\n\\n\\n\\n bool_array() _NOEXCEPT;\\n\\n explicit bool_array(size_type size);\\n\\n bool_array(const void* ptr, size_type size);\\n\\n ~bool_array();\\n\\n\\n\\n bool_array(const bool_array& rhs);\\n\\n bool_array& operator=(const bool_array& rhs);\\n\\n\\n\\n bool create(size_type size) _NOEXCEPT;\\n\\n void initialize(bool value) _NOEXCEPT;\\n\\n\\n\\n reference operator[](size_type pos);\\n\\n const_reference operator[](size_type pos) const;\\n\\n\\n\\n bool at(size_type pos) const;\\n\\n void reset(size_type pos);\\n\\n void set(size_type pos);\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 41,\n \"score\": 54827.765325889915\n },\n {\n \"content\": \" static const size_type npos = (size_type)-1;\\n\\n#endif\\n\\n\\n\\n bool_array() _NOEXCEPT;\\n\\n explicit bool_array(size_type size);\\n\\n bool_array(const void* ptr, size_type size);\\n\\n ~bool_array();\\n\\n\\n\\n bool_array(const bool_array& rhs);\\n\\n bool_array& operator=(const bool_array& rhs);\\n\\n\\n\\n bool create(size_type size) _NOEXCEPT;\\n\\n void initialize(bool value) _NOEXCEPT;\\n\\n\\n\\n reference operator[](size_type pos);\\n\\n const_reference operator[](size_type pos) const;\\n\\n\\n\\n bool at(size_type pos) const;\\n\\n void reset(size_type pos);\\n\\n void set(size_type pos);\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 42,\n \"score\": 54827.765325889915\n },\n {\n \"content\": \" *(_M_byte_ptr + _M_byte_pos) |= 1 << _M_bit_pos;\\n\\n else\\n\\n *(_M_byte_ptr + _M_byte_pos) &= ~(1 << _M_bit_pos);\\n\\n return value;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Reads the boolean value from an array element.\\n\\n *\\n\\n * @return the boolean value of the accessed array element\\n\\n */\\n\\ntemplate <typename _Byte_type>\\n\\ninline bool_array::_Element<_Byte_type>::operator bool() const\\n\\n{\\n\\n return *(_M_byte_ptr + _M_byte_pos) & (1 << _M_bit_pos) ? true : false;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Constructs an empty bool_array.\\n\\n */\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 43,\n \"score\": 54826.32204116386\n },\n {\n \"content\": \" *(_M_byte_ptr + _M_byte_pos) |= 1 << _M_bit_pos;\\n\\n else\\n\\n *(_M_byte_ptr + _M_byte_pos) &= ~(1 << _M_bit_pos);\\n\\n return value;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Reads the boolean value from an array element.\\n\\n *\\n\\n * @return the boolean value of the accessed array element\\n\\n */\\n\\ntemplate <typename _Byte_type>\\n\\ninline bool_array::_Element<_Byte_type>::operator bool() const\\n\\n{\\n\\n return *(_M_byte_ptr + _M_byte_pos) & (1 << _M_bit_pos) ? true : false;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Constructs an empty bool_array.\\n\\n */\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 44,\n \"score\": 54826.32204116386\n },\n {\n \"content\": \"#include <stdlib.h> // exit/free/NULL\\n\\n#include <new> // std::bad_alloc\\n\\n#include <stdexcept> // std::out_of_range\\n\\n#include <string> // for exception constructors\\n\\n#include \\\"_nvwa.h\\\" // NVWA_NAMESPACE_*\\n\\n#include \\\"c++11.h\\\" // _NOEXCEPT\\n\\n\\n\\nNVWA_NAMESPACE_BEGIN\\n\\n\\n\\n/**\\n\\n * Class to represent a packed boolean array.\\n\\n *\\n\\n * This was first written in April 1995, before I knew of any existing\\n\\n * implementation of this kind of classes. Of course, the C++ Standard\\n\\n * Template Library now demands an implementation of packed boolean\\n\\n * array as \\\\c vector<bool>, but the code here should still be\\n\\n * useful for the following reasons:\\n\\n *\\n\\n * -# Some compilers (like MSVC 6) did not implement this\\n\\n * specialization (and they may not have a \\\\c bit_vector either);\\n\\n * -# I included some additional member functions, like \\\\e #initialize,\\n\\n * \\\\e #count, and \\\\e #find, which should be useful;\\n\\n * -# My tests show that the code here is significantly FASTER\\n\\n * than \\\\c vector<bool> (and the normal boolean array)\\n\\n * under MSVC versions 6/8/9 and GCC versions before 4.3 (while\\n\\n * the \\\\c vector<bool> implementations of MSVC 7.1 and\\n\\n * GCC 4.3 have performance similar to that of \\\\c bool_array).\\n\\n */\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 45,\n \"score\": 54825.36648540233\n },\n {\n \"content\": \"#include <stdlib.h> // exit/free/NULL\\n\\n#include <new> // std::bad_alloc\\n\\n#include <stdexcept> // std::out_of_range\\n\\n#include <string> // for exception constructors\\n\\n#include \\\"_nvwa.h\\\" // NVWA_NAMESPACE_*\\n\\n#include \\\"c++11.h\\\" // _NOEXCEPT\\n\\n\\n\\nNVWA_NAMESPACE_BEGIN\\n\\n\\n\\n/**\\n\\n * Class to represent a packed boolean array.\\n\\n *\\n\\n * This was first written in April 1995, before I knew of any existing\\n\\n * implementation of this kind of classes. Of course, the C++ Standard\\n\\n * Template Library now demands an implementation of packed boolean\\n\\n * array as \\\\c vector<bool>, but the code here should still be\\n\\n * useful for the following reasons:\\n\\n *\\n\\n * -# Some compilers (like MSVC 6) did not implement this\\n\\n * specialization (and they may not have a \\\\c bit_vector either);\\n\\n * -# I included some additional member functions, like \\\\e #initialize,\\n\\n * \\\\e #count, and \\\\e #find, which should be useful;\\n\\n * -# My tests show that the code here is significantly FASTER\\n\\n * than \\\\c vector<bool> (and the normal boolean array)\\n\\n * under MSVC versions 6/8/9 and GCC versions before 4.3 (while\\n\\n * the \\\\c vector<bool> implementations of MSVC 7.1 and\\n\\n * GCC 4.3 have performance similar to that of \\\\c bool_array).\\n\\n */\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 46,\n \"score\": 54825.36648540233\n },\n {\n \"content\": \" * @throw out_of_range \\\\a pos is greater than the size of the array\\n\\n */\\n\\ninline void bool_array::reset(size_type pos)\\n\\n{\\n\\n size_t byte_pos, bit_pos;\\n\\n if (pos >= _M_length)\\n\\n throw std::out_of_range(\\\"invalid bool_array position\\\");\\n\\n byte_pos = (size_t)(pos / 8);\\n\\n bit_pos = (size_t)(pos % 8);\\n\\n *(_M_byte_ptr + byte_pos) &= ~(1 << bit_pos);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Sets an array element to \\\\c true at a specified position.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @throw out_of_range \\\\a pos is greater than the size of the array\\n\\n */\\n\\ninline void bool_array::set(size_type pos)\\n\\n{\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 47,\n \"score\": 54824.44925704722\n },\n {\n \"content\": \" * @throw out_of_range \\\\a pos is greater than the size of the array\\n\\n */\\n\\ninline void bool_array::reset(size_type pos)\\n\\n{\\n\\n size_t byte_pos, bit_pos;\\n\\n if (pos >= _M_length)\\n\\n throw std::out_of_range(\\\"invalid bool_array position\\\");\\n\\n byte_pos = (size_t)(pos / 8);\\n\\n bit_pos = (size_t)(pos % 8);\\n\\n *(_M_byte_ptr + byte_pos) &= ~(1 << bit_pos);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Sets an array element to \\\\c true at a specified position.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @throw out_of_range \\\\a pos is greater than the size of the array\\n\\n */\\n\\ninline void bool_array::set(size_type pos)\\n\\n{\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 48,\n \"score\": 54824.44925704722\n },\n {\n \"content\": \" * Reads the boolean value of an array element at a specified position.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @return the boolean value of the accessed array element\\n\\n * @throw out_of_range \\\\a pos is greater than the size of the array\\n\\n */\\n\\ninline bool bool_array::at(size_type pos) const\\n\\n{\\n\\n size_t byte_pos, bit_pos;\\n\\n if (pos >= _M_length)\\n\\n throw std::out_of_range(\\\"invalid bool_array position\\\");\\n\\n byte_pos = (size_t)(pos / 8);\\n\\n bit_pos = (size_t)(pos % 8);\\n\\n return *(_M_byte_ptr + byte_pos) & (1 << bit_pos) ? true : false;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Resets an array element to \\\\c false at a specified position.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 49,\n \"score\": 54824.08082935222\n },\n {\n \"content\": \" * Reads the boolean value of an array element at a specified position.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @return the boolean value of the accessed array element\\n\\n * @throw out_of_range \\\\a pos is greater than the size of the array\\n\\n */\\n\\ninline bool bool_array::at(size_type pos) const\\n\\n{\\n\\n size_t byte_pos, bit_pos;\\n\\n if (pos >= _M_length)\\n\\n throw std::out_of_range(\\\"invalid bool_array position\\\");\\n\\n byte_pos = (size_t)(pos / 8);\\n\\n bit_pos = (size_t)(pos % 8);\\n\\n return *(_M_byte_ptr + byte_pos) & (1 << bit_pos) ? true : false;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Resets an array element to \\\\c false at a specified position.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 50,\n \"score\": 54824.08082935222\n },\n {\n \"content\": \" * the specified position (default to beginning) to the end.\\n\\n *\\n\\n * @param offset the position at which the search is to begin\\n\\n * @param value the boolean value to find\\n\\n * @return position of the first value found if successful; \\\\c #npos\\n\\n * otherwise\\n\\n */\\n\\ninline bool_array::size_type bool_array::find(\\n\\n bool value,\\n\\n size_type offset) const\\n\\n{\\n\\n return find_until(value, offset, _M_length);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Searches for the specified boolean value. This function accepts a\\n\\n * range expressed in {position, count}.\\n\\n *\\n\\n * @param offset the position at which the search is to begin\\n\\n * @param count the number of bits to search\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 51,\n \"score\": 54823.84247856542\n },\n {\n \"content\": \" * the specified position (default to beginning) to the end.\\n\\n *\\n\\n * @param offset the position at which the search is to begin\\n\\n * @param value the boolean value to find\\n\\n * @return position of the first value found if successful; \\\\c #npos\\n\\n * otherwise\\n\\n */\\n\\ninline bool_array::size_type bool_array::find(\\n\\n bool value,\\n\\n size_type offset) const\\n\\n{\\n\\n return find_until(value, offset, _M_length);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Searches for the specified boolean value. This function accepts a\\n\\n * range expressed in {position, count}.\\n\\n *\\n\\n * @param offset the position at which the search is to begin\\n\\n * @param count the number of bits to search\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 52,\n \"score\": 54823.84247856542\n },\n {\n \"content\": \" * @param value the boolean value to find\\n\\n * @return position of the first value found if successful;\\n\\n * \\\\c #npos otherwise\\n\\n * @throw out_of_range \\\\a offset and/or \\\\a count is too big\\n\\n */\\n\\ninline bool_array::size_type bool_array::find(\\n\\n bool value,\\n\\n size_type offset,\\n\\n size_type count) const\\n\\n{\\n\\n return find_until(value, offset, offset + count);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Converts the number of bits to number of bytes.\\n\\n *\\n\\n * @param num_bits number of bits\\n\\n * @return number of bytes needed to store \\\\a num_bits bits\\n\\n */\\n\\ninline size_t bool_array::get_num_bytes_from_bits(size_type num_bits)\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 53,\n \"score\": 54823.78631548724\n },\n {\n \"content\": \" * @param value the boolean value to find\\n\\n * @return position of the first value found if successful;\\n\\n * \\\\c #npos otherwise\\n\\n * @throw out_of_range \\\\a offset and/or \\\\a count is too big\\n\\n */\\n\\ninline bool_array::size_type bool_array::find(\\n\\n bool value,\\n\\n size_type offset,\\n\\n size_type count) const\\n\\n{\\n\\n return find_until(value, offset, offset + count);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Converts the number of bits to number of bytes.\\n\\n *\\n\\n * @param num_bits number of bits\\n\\n * @return number of bytes needed to store \\\\a num_bits bits\\n\\n */\\n\\ninline size_t bool_array::get_num_bytes_from_bits(size_type num_bits)\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 54,\n \"score\": 54823.78631548724\n },\n {\n \"content\": \"{\\n\\n return (size_t)((num_bits + 7) / 8);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Exchanges the content of two bool_arrays.\\n\\n *\\n\\n * @param lhs the first bool_array to exchange\\n\\n * @param rhs the second bool_array to exchange\\n\\n */\\n\\ninline void swap(bool_array& lhs, bool_array& rhs) _NOEXCEPT\\n\\n{\\n\\n lhs.swap(rhs);\\n\\n}\\n\\n\\n\\nNVWA_NAMESPACE_END\\n\\n\\n\\n#endif // NVWA_BOOL_ARRAY_H\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 55,\n \"score\": 54822.43836624876\n },\n {\n \"content\": \"{\\n\\n return (size_t)((num_bits + 7) / 8);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Exchanges the content of two bool_arrays.\\n\\n *\\n\\n * @param lhs the first bool_array to exchange\\n\\n * @param rhs the second bool_array to exchange\\n\\n */\\n\\ninline void swap(bool_array& lhs, bool_array& rhs) _NOEXCEPT\\n\\n{\\n\\n lhs.swap(rhs);\\n\\n}\\n\\n\\n\\nNVWA_NAMESPACE_END\\n\\n\\n\\n#endif // NVWA_BOOL_ARRAY_H\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 56,\n \"score\": 54822.43836624876\n },\n {\n \"content\": \" * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n *\\n\\n * This file is part of Stones of Nvwa:\\n\\n * http://sourceforge.net/projects/nvwa\\n\\n *\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file bool_array.h\\n\\n *\\n\\n * Header file for class bool_array (packed boolean array).\\n\\n *\\n\\n * @date 2013-10-06\\n\\n */\\n\\n\\n\\n#ifndef NVWA_BOOL_ARRAY_H\\n\\n#define NVWA_BOOL_ARRAY_H\\n\\n\\n\\n#include <assert.h> // assert\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 57,\n \"score\": 54822.02498313789\n },\n {\n \"content\": \" * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n *\\n\\n * This file is part of Stones of Nvwa:\\n\\n * http://sourceforge.net/projects/nvwa\\n\\n *\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file bool_array.h\\n\\n *\\n\\n * Header file for class bool_array (packed boolean array).\\n\\n *\\n\\n * @date 2013-10-06\\n\\n */\\n\\n\\n\\n#ifndef NVWA_BOOL_ARRAY_H\\n\\n#define NVWA_BOOL_ARRAY_H\\n\\n\\n\\n#include <assert.h> // assert\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 58,\n \"score\": 54822.02498313789\n },\n {\n \"content\": \" size_t byte_pos, bit_pos;\\n\\n if (pos >= _M_length)\\n\\n throw std::out_of_range(\\\"invalid bool_array position\\\");\\n\\n byte_pos = (size_t)(pos / 8);\\n\\n bit_pos = (size_t)(pos % 8);\\n\\n *(_M_byte_ptr + byte_pos) |= 1 << bit_pos;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Gets the size of the bool_array.\\n\\n *\\n\\n * @return the number of bits of the bool_array\\n\\n */\\n\\ninline bool_array::size_type bool_array::size() const _NOEXCEPT\\n\\n{\\n\\n return _M_length;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Searches for the specified boolean value. This function seaches from\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 59,\n \"score\": 54821.430094967734\n },\n {\n \"content\": \" size_t byte_pos, bit_pos;\\n\\n if (pos >= _M_length)\\n\\n throw std::out_of_range(\\\"invalid bool_array position\\\");\\n\\n byte_pos = (size_t)(pos / 8);\\n\\n bit_pos = (size_t)(pos % 8);\\n\\n *(_M_byte_ptr + byte_pos) |= 1 << bit_pos;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Gets the size of the bool_array.\\n\\n *\\n\\n * @return the number of bits of the bool_array\\n\\n */\\n\\ninline bool_array::size_type bool_array::size() const _NOEXCEPT\\n\\n{\\n\\n return _M_length;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Searches for the specified boolean value. This function seaches from\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 60,\n \"score\": 54821.430094967734\n },\n {\n \"content\": \"inline bool_array::bool_array() _NOEXCEPT : _M_byte_ptr(NULL), _M_length(0)\\n\\n{\\n\\n}\\n\\n\\n\\n/**\\n\\n * Destroys the bool_array and releases memory.\\n\\n */\\n\\ninline bool_array::~bool_array()\\n\\n{\\n\\n if (_M_byte_ptr != NULL)\\n\\n free(_M_byte_ptr);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Creates a reference to an array element.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @return reference to the specified element\\n\\n */\\n\\ninline bool_array::reference bool_array::operator[](size_type pos)\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 61,\n \"score\": 54818.328652451135\n },\n {\n \"content\": \"inline bool_array::bool_array() _NOEXCEPT : _M_byte_ptr(NULL), _M_length(0)\\n\\n{\\n\\n}\\n\\n\\n\\n/**\\n\\n * Destroys the bool_array and releases memory.\\n\\n */\\n\\ninline bool_array::~bool_array()\\n\\n{\\n\\n if (_M_byte_ptr != NULL)\\n\\n free(_M_byte_ptr);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Creates a reference to an array element.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @return reference to the specified element\\n\\n */\\n\\ninline bool_array::reference bool_array::operator[](size_type pos)\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 62,\n \"score\": 54818.328652451135\n },\n {\n \"content\": \"// -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*-\\n\\n// vim:tabstop=4:shiftwidth=4:expandtab:\\n\\n\\n\\n/*\\n\\n * Copyright (C) 2004-2013 Wu Yongwei <adah at users dot sourceforge dot net>\\n\\n *\\n\\n * This software is provided 'as-is', without any express or implied\\n\\n * warranty. In no event will the authors be held liable for any\\n\\n * damages arising from the use of this software.\\n\\n *\\n\\n * Permission is granted to anyone to use this software for any purpose,\\n\\n * including commercial applications, and to alter it and redistribute\\n\\n * it freely, subject to the following restrictions:\\n\\n *\\n\\n * 1. The origin of this software must not be misrepresented; you must\\n\\n * not claim that you wrote the original software. If you use this\\n\\n * software in a product, an acknowledgement in the product\\n\\n * documentation would be appreciated but is not required.\\n\\n * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 63,\n \"score\": 54816.890274846315\n },\n {\n \"content\": \"// -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*-\\n\\n// vim:tabstop=4:shiftwidth=4:expandtab:\\n\\n\\n\\n/*\\n\\n * Copyright (C) 2004-2013 Wu Yongwei <adah at users dot sourceforge dot net>\\n\\n *\\n\\n * This software is provided 'as-is', without any express or implied\\n\\n * warranty. In no event will the authors be held liable for any\\n\\n * damages arising from the use of this software.\\n\\n *\\n\\n * Permission is granted to anyone to use this software for any purpose,\\n\\n * including commercial applications, and to alter it and redistribute\\n\\n * it freely, subject to the following restrictions:\\n\\n *\\n\\n * 1. The origin of this software must not be misrepresented; you must\\n\\n * not claim that you wrote the original software. If you use this\\n\\n * software in a product, an acknowledgement in the product\\n\\n * documentation would be appreciated but is not required.\\n\\n * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 64,\n \"score\": 54816.890274846315\n },\n {\n \"content\": \"{\\n\\n assert(_M_byte_ptr);\\n\\n assert(pos < _M_length);\\n\\n return reference(_M_byte_ptr, pos);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Creates a const reference to an array element.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @return const reference to the specified element\\n\\n */\\n\\ninline bool_array::const_reference bool_array::operator[](size_type pos) const\\n\\n{\\n\\n assert(_M_byte_ptr);\\n\\n assert(pos < _M_length);\\n\\n return const_reference(_M_byte_ptr, pos);\\n\\n}\\n\\n\\n\\n/**\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 65,\n \"score\": 54816.2409487314\n },\n {\n \"content\": \"{\\n\\n assert(_M_byte_ptr);\\n\\n assert(pos < _M_length);\\n\\n return reference(_M_byte_ptr, pos);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Creates a const reference to an array element.\\n\\n *\\n\\n * @param pos position of the array element to access\\n\\n * @return const reference to the specified element\\n\\n */\\n\\ninline bool_array::const_reference bool_array::operator[](size_type pos) const\\n\\n{\\n\\n assert(_M_byte_ptr);\\n\\n assert(pos < _M_length);\\n\\n return const_reference(_M_byte_ptr, pos);\\n\\n}\\n\\n\\n\\n/**\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 66,\n \"score\": 54816.2409487314\n },\n {\n \"content\": \"#include <stdio.h> // FILE\\n\\n#include \\\"_nvwa.h\\\" // NVWA_NAMESPACE_*\\n\\n#include \\\"c++11.h\\\" // _NOEXCEPT\\n\\n\\n\\n/* Special allocation/deallocation functions in the global scope */\\n\\nvoid* operator new(size_t size, const char* file, int line);\\n\\nvoid* operator new[](size_t size, const char* file, int line);\\n\\nvoid operator delete(void* ptr, const char* file, int line) _NOEXCEPT;\\n\\nvoid operator delete[](void* ptr, const char* file, int line) _NOEXCEPT;\\n\\n\\n\\nNVWA_NAMESPACE_BEGIN\\n\\n\\n\\n/**\\n\\n * @def _DEBUG_NEW_REDEFINE_NEW\\n\\n *\\n\\n * Macro to indicate whether redefinition of \\\\c new is wanted. If one\\n\\n * wants to define one's own <code>operator new</code>, or to call\\n\\n * <code>operator new</code> directly, it should be defined to \\\\c 0 to\\n\\n * alter the default behaviour. Unless, of course, one is willing to\\n\\n * take the trouble to write something like:\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.h\",\n \"rank\": 67,\n \"score\": 54814.385796934825\n },\n {\n \"content\": \"#include <stdio.h> // FILE\\n\\n#include \\\"_nvwa.h\\\" // NVWA_NAMESPACE_*\\n\\n#include \\\"c++11.h\\\" // _NOEXCEPT\\n\\n\\n\\n/* Special allocation/deallocation functions in the global scope */\\n\\nvoid* operator new(size_t size, const char* file, int line);\\n\\nvoid* operator new[](size_t size, const char* file, int line);\\n\\nvoid operator delete(void* ptr, const char* file, int line) _NOEXCEPT;\\n\\nvoid operator delete[](void* ptr, const char* file, int line) _NOEXCEPT;\\n\\n\\n\\nNVWA_NAMESPACE_BEGIN\\n\\n\\n\\n/**\\n\\n * @def _DEBUG_NEW_REDEFINE_NEW\\n\\n *\\n\\n * Macro to indicate whether redefinition of \\\\c new is wanted. If one\\n\\n * wants to define one's own <code>operator new</code>, or to call\\n\\n * <code>operator new</code> directly, it should be defined to \\\\c 0 to\\n\\n * alter the default behaviour. Unless, of course, one is willing to\\n\\n * take the trouble to write something like:\\n\",\n \"file_path\": \"Studio/debug_memory/debug_new.h\",\n \"rank\": 68,\n \"score\": 54814.385796934825\n },\n {\n \"content\": \" static size_t get_num_bytes_from_bits(size_type num_bits);\\n\\n\\n\\nprivate:\\n\\n byte get_8bits(size_type offset, size_type end) const;\\n\\n\\n\\n byte* _M_byte_ptr;\\n\\n size_type _M_length;\\n\\n static byte _S_bit_count[256];\\n\\n static byte _S_bit_ordinal[256];\\n\\n};\\n\\n\\n\\n\\n\\n/* Inline functions */\\n\\n\\n\\n/**\\n\\n * Constructs a reference to an array element.\\n\\n *\\n\\n * @param ptr ptr to the interal boolean data\\n\\n * @param pos position of the array element to access\\n\\n */\\n\",\n \"file_path\": \"Engine/debug_memory/bool_array.h\",\n \"rank\": 69,\n \"score\": 54810.9597530575\n },\n {\n \"content\": \" static size_t get_num_bytes_from_bits(size_type num_bits);\\n\\n\\n\\nprivate:\\n\\n byte get_8bits(size_type offset, size_type end) const;\\n\\n\\n\\n byte* _M_byte_ptr;\\n\\n size_type _M_length;\\n\\n static byte _S_bit_count[256];\\n\\n static byte _S_bit_ordinal[256];\\n\\n};\\n\\n\\n\\n\\n\\n/* Inline functions */\\n\\n\\n\\n/**\\n\\n * Constructs a reference to an array element.\\n\\n *\\n\\n * @param ptr ptr to the interal boolean data\\n\\n * @param pos position of the array element to access\\n\\n */\\n\",\n \"file_path\": \"Studio/debug_memory/bool_array.h\",\n \"rank\": 70,\n \"score\": 54810.9597530575\n },\n {\n \"content\": \"/**\\n\\n * @def _DEBUG_NEW_TYPE\\n\\n *\\n\\n * Macro to indicate which variant of #DEBUG_NEW is wanted. The\\n\\n * default value \\\\c 1 allows the use of placement new (like\\n\\n * <code>%new(std::nothrow)</code>), but the verbose output (when\\n\\n * nvwa#new_verbose_flag is \\\\c true) looks worse than some older\\n\\n * versions (no file/line information for allocations). Define it\\n\\n * to \\\\c 2 to revert to the old behaviour that records file and line\\n\\n * information directly on the call to <code>operator new</code>.\\n\\n */\\n\\n#ifndef _DEBUG_NEW_TYPE\\n\\n#define _DEBUG_NEW_TYPE 1\\n\\n#endif\\n\\n\\n\\n/* Prototypes */\\n\\nint check_leaks();\\n\\nint check_mem_corruption();\\n\\n\\n\\n/* Control variables */\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.h\",\n \"rank\": 71,\n \"score\": 54809.13761721055\n },\n {\n \"content\": \"/**\\n\\n * @def _DEBUG_NEW_TYPE\\n\\n *\\n\\n * Macro to indicate which variant of #DEBUG_NEW is wanted. The\\n\\n * default value \\\\c 1 allows the use of placement new (like\\n\\n * <code>%new(std::nothrow)</code>), but the verbose output (when\\n\\n * nvwa#new_verbose_flag is \\\\c true) looks worse than some older\\n\\n * versions (no file/line information for allocations). Define it\\n\\n * to \\\\c 2 to revert to the old behaviour that records file and line\\n\\n * information directly on the call to <code>operator new</code>.\\n\\n */\\n\\n#ifndef _DEBUG_NEW_TYPE\\n\\n#define _DEBUG_NEW_TYPE 1\\n\\n#endif\\n\\n\\n\\n/* Prototypes */\\n\\nint check_leaks();\\n\\nint check_mem_corruption();\\n\\n\\n\\n/* Control variables */\\n\",\n \"file_path\": \"Studio/debug_memory/debug_new.h\",\n \"rank\": 72,\n \"score\": 54809.13761721055\n },\n {\n \"content\": \"# define new DEBUG_NEW\\n\\n# endif\\n\\n# ifdef _DEBUG_NEW_EMULATE_MALLOC\\n\\n# include <stdlib.h>\\n\\n# ifdef new\\n\\n# define malloc(s) ((void*)(new char[s]))\\n\\n# else\\n\\n# define malloc(s) ((void*)(DEBUG_NEW char[s]))\\n\\n# endif\\n\\n# define free(p) delete[] (char*)(p)\\n\\n# endif\\n\\n\\n\\n/**\\n\\n * Recorder class to remember the call context.\\n\\n *\\n\\n * The idea comes from <a href=\\\"http://groups.google.com/group/comp.lang.c++.moderated/browse_thread/thread/7089382e3bc1c489/85f9107a1dc79ee9?#85f9107a1dc79ee9\\\">Greg Herlihy's post</a> in comp.lang.c++.moderated.\\n\\n */\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.h\",\n \"rank\": 73,\n \"score\": 54806.47693853767\n },\n {\n \"content\": \"# define new DEBUG_NEW\\n\\n# endif\\n\\n# ifdef _DEBUG_NEW_EMULATE_MALLOC\\n\\n# include <stdlib.h>\\n\\n# ifdef new\\n\\n# define malloc(s) ((void*)(new char[s]))\\n\\n# else\\n\\n# define malloc(s) ((void*)(DEBUG_NEW char[s]))\\n\\n# endif\\n\\n# define free(p) delete[] (char*)(p)\\n\\n# endif\\n\\n\\n\\n/**\\n\\n * Recorder class to remember the call context.\\n\\n *\\n\\n * The idea comes from <a href=\\\"http://groups.google.com/group/comp.lang.c++.moderated/browse_thread/thread/7089382e3bc1c489/85f9107a1dc79ee9?#85f9107a1dc79ee9\\\">Greg Herlihy's post</a> in comp.lang.c++.moderated.\\n\\n */\\n\",\n \"file_path\": \"Studio/debug_memory/debug_new.h\",\n \"rank\": 74,\n \"score\": 54806.47693853767\n },\n {\n \"content\": \"extern bool new_autocheck_flag; // default to true: call check_leaks() on exit\\n\\nextern bool new_verbose_flag; // default to false: no verbose information\\n\\nextern FILE* new_output_fp; // default to stderr: output to console\\n\\nextern const char* new_progname;// default to NULL; should be assigned argv[0]\\n\\n\\n\\n/**\\n\\n * @def DEBUG_NEW\\n\\n *\\n\\n * Macro to catch file/line information on allocation. If\\n\\n * #_DEBUG_NEW_REDEFINE_NEW is \\\\c 0, one can use this macro directly;\\n\\n * otherwise \\\\c new will be defined to it, and one must use \\\\c new\\n\\n * instead.\\n\\n */\\n\\n# if _DEBUG_NEW_TYPE == 1\\n\\n# define DEBUG_NEW NVWA::debug_new_recorder(__FILE__, __LINE__) ->* new\\n\\n# else\\n\\n# define DEBUG_NEW new(__FILE__, __LINE__)\\n\\n# endif\\n\\n\\n\\n# if _DEBUG_NEW_REDEFINE_NEW\\n\",\n \"file_path\": \"Engine/debug_memory/debug_new.h\",\n \"rank\": 75,\n \"score\": 54805.78791710394\n },\n {\n \"content\": \"\\n\\n Qt::CheckState itemCheckState(int index) const;\\n\\n void setItemCheckState(int index, Qt::CheckState state);\\n\\n\\n\\n QString separator() const;\\n\\n void setSeparator(const QString& separator);\\n\\n\\n\\n QStringList checkedItems() const;\\n\\n QStringList checkedData() const;\\n\\n\\n\\n QList<int> checkedIndexes();\\n\\n\\n\\n\\n\\n bool eventFilter(QObject* receiver, QEvent* event);\\n\\n QString _separator;\\n\\n QString _defaultText;\\n\\n bool containerMousePress;\\n\\n\\n\\n //virtual void paintEvent(QPaintEvent *event);\\n\\n\\n\",\n \"file_path\": \"Engine/qxtcheckcombobox.h\",\n \"rank\": 76,\n \"score\": 46.479770076673894\n },\n {\n \"content\": \" int index = 0;\\n\\n foreach (DatabaseColumn Column, Columns)\\n\\n {\\n\\n QVariant val;\\n\\n QWidget*DataItem = Widgets[Column.Id];\\n\\n switch(Column.Type)\\n\\n {\\n\\n case DatabaseColumn::String: val = qobject_cast<QLineEdit*>(DataItem)->text(); break;\\n\\n case DatabaseColumn::Int: val = qobject_cast<QSpinBox*>(DataItem)->value(); break;\\n\\n case DatabaseColumn::Bool: val = qobject_cast<QCheckBox*>(DataItem)->isChecked(); break;\\n\\n case DatabaseColumn::Date: val = qobject_cast<QDateTimeEdit*>(DataItem)->dateTime(); break;\\n\\n\\n\\n }\\n\\n res.Data[Column.Id] = val;\\n\\n index++;\\n\\n }\\n\\n return res;\\n\\n}\\n\\n\\n\\nvoid DatabaseAdminItemEdit::SetDatabaseItem(DatabaseItem Item)\\n\",\n \"file_path\": \"Engine/databaseadminitemedit.cpp\",\n \"rank\": 78,\n \"score\": 42.19681964769058\n },\n {\n \"content\": \" {\\n\\n QLabel *Label = new QLabel(this);\\n\\n Label->setText(Column.Description);\\n\\n QWidget *DataItem;\\n\\n switch(Column.Type)\\n\\n {\\n\\n case DatabaseColumn::String: {QLineEdit* e = new QLineEdit(this);e->setMaxLength(2147483647); DataItem = e;} break;\\n\\n case DatabaseColumn::Int: {QSpinBox * w = new QSpinBox(this);w->setMinimum(-1000000);w->setMaximum(1000000);DataItem = w;} break;\\n\\n case DatabaseColumn::Bool: DataItem = new QCheckBox(this); break;\\n\\n case DatabaseColumn::Date: DataItem = new QDateTimeEdit(this); break;\\n\\n\\n\\n }\\n\\n Widgets[Column.Id] = DataItem;\\n\\n ui->MainLayout->addRow(Label,DataItem);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid DatabaseAdminItemEdit::HideGroupBox()\\n\\n{\\n\\n ui->comboBox->setVisible(false);\\n\",\n \"file_path\": \"Engine/databaseadminitemedit.cpp\",\n \"rank\": 81,\n \"score\": 39.28948896391996\n },\n {\n \"content\": \" {\\n\\n i.next();\\n\\n std::string column = QString::number(i.key()).toStdString();\\n\\n switch(i.value().type())\\n\\n {\\n\\n case QVariant::Int:\\n\\n {\\n\\n ItemBuild.append(column,i.value().toInt());\\n\\n }break;\\n\\n case QVariant::String:\\n\\n {\\n\\n ItemBuild.append(column,i.value().toString().toStdString());\\n\\n }break;\\n\\n case QVariant::Bool:\\n\\n {\\n\\n ItemBuild.append(column,i.value().toBool());\\n\\n }break;\\n\\n case QVariant::DateTime:\\n\\n {\\n\\n ItemBuild.append(column,Date_t(i.value().toDateTime().toMSecsSinceEpoch()));\\n\",\n \"file_path\": \"Engine/mongodatabaseconnector.cpp\",\n \"rank\": 82,\n \"score\": 38.0277790571506\n },\n {\n \"content\": \" item.Id = id;\\n\\n item.IsNull = false;\\n\\n\\n\\n for(int i = 0;i<Params.length() - 1;i+=2)\\n\\n {\\n\\n int ColumnIndex = Params.at(i).toInt();\\n\\n QString val = Params.at(i+1);\\n\\n\\n\\n QVariant VariantParam;\\n\\n foreach(DatabaseColumn Column, Columns)\\n\\n {\\n\\n if(ColumnIndex == Column.Id)\\n\\n {\\n\\n switch(Column.Type)\\n\\n {\\n\\n case DatabaseColumn::Int: VariantParam = QVariant(val.toInt());break;\\n\\n case DatabaseColumn::String: VariantParam = QVariant(val);break;\\n\\n case DatabaseColumn::Bool: VariantParam = QVariant(val == \\\"true\\\");break;\\n\\n case DatabaseColumn::Date:\\n\\n {\\n\",\n \"file_path\": \"Engine/engineresourcestringbox.cpp\",\n \"rank\": 83,\n \"score\": 37.36104226344257\n },\n {\n \"content\": \" {\\n\\n case DatabaseColumn::String: qobject_cast<QLineEdit*>(DataItem)->setText(val.toString()); break;\\n\\n case DatabaseColumn::Int: qobject_cast<QSpinBox*>(DataItem)->setValue(val.toInt()); break;\\n\\n case DatabaseColumn::Bool: qobject_cast<QCheckBox*>(DataItem)->setChecked(val.toBool()); break;\\n\\n case DatabaseColumn::Date: qobject_cast<QDateTimeEdit*>(DataItem)->setDateTime(val.toDateTime()); break;\\n\\n\\n\\n }\\n\\n }\\n\\n\\n\\n\\n\\n }\\n\\n}\\n\\n\\n\\nDatabaseAdminItemEdit::~DatabaseAdminItemEdit()\\n\\n{\\n\\n delete ui;\\n\\n}\\n\",\n \"file_path\": \"Engine/databaseadminitemedit.cpp\",\n \"rank\": 84,\n \"score\": 36.77955417559164\n },\n {\n \"content\": \" emit Done(\\\"Closed by user\\\",id,false);\\n\\n this->deleteLater();\\n\\n }\\n\\n\\n\\n void SingleCaptchaWidget::on_pushButton_clicked()\\n\\n {\\n\\n emit Done(ui->lineEdit->text(),id,true);\\n\\n this->deleteLater();\\n\\n }\\n\\n\\n\\n void SingleCaptchaWidget::on_lineEdit_returnPressed()\\n\\n {\\n\\n emit Done(ui->lineEdit->text(),id,true);\\n\\n this->deleteLater();\\n\\n }\\n\\n\\n\\n void SingleCaptchaWidget::changeEvent(QEvent *e)\\n\\n {\\n\\n QWidget::changeEvent(e);\\n\\n switch (e->type()) {\\n\",\n \"file_path\": \"Engine/singlecaptchawidget.cpp\",\n \"rank\": 85,\n \"score\": 35.997168804264916\n },\n {\n \"content\": \" state = Disconnected;\\n\\n}\\n\\n\\n\\nvoid QxtPop3Private::socketRead()\\n\\n{\\n\\n buffer += socket->readAll();\\n\\n while (true)\\n\\n {\\n\\n int pos = buffer.indexOf(\\\"\\\\r\\\\n\\\");\\n\\n if (pos < 0) return;\\n\\n QByteArray line = buffer.left(pos);\\n\\n buffer = buffer.mid(pos + 2);\\n\\n// qDebug(\\\"QxtPop3Private::socketRead: received %s\\\", line.data());\\n\\n switch (state)\\n\\n {\\n\\n case StartState: // we expect a greetings line, beginning with \\\"+OK\\\"\\n\\n if (!QxtPop3ReplyImpl::isAnswerOK(line))\\n\\n {\\n\\n q_func()->disconnectFromHost();\\n\\n }\\n\",\n \"file_path\": \"Engine/mail/mailpop3.cpp\",\n \"rank\": 86,\n \"score\": 35.64543978789018\n },\n {\n \"content\": \"\\n\\n void UserResourceWrapper::VisibilityTriggerChanged(const QString& Value)\\n\\n {\\n\\n QStringList list = GetVisibilityConditionValue().split(QRegExp(\\\"[\\\\\\\\|\\\\\\\\;\\\\\\\\,]\\\"));\\n\\n bool res = false;\\n\\n foreach(QString item, list)\\n\\n {\\n\\n if(Value.contains(item))\\n\\n {\\n\\n res = true;\\n\\n break;\\n\\n }\\n\\n }\\n\\n IsVisibleAccordingToTrigger = res;\\n\\n emit RequiresValidationStateChanged(IsVisible && IsVisibleAccordingToTrigger && DependendVisibilityParentVisible);\\n\\n\\n\\n if(res)\\n\\n {\\n\\n Widget->SetVisibleToUser(IsVisible && DependendVisibilityParentVisible && IsAdvancedVisible);\\n\\n emit VisibilityChanged(IsVisible && DependendVisibilityParentVisible && IsAdvancedVisible);\\n\",\n \"file_path\": \"Engine/userresourcewrapper.cpp\",\n \"rank\": 87,\n \"score\": 35.450326053854084\n },\n {\n \"content\": \" return QWidget::eventFilter(obj, event);\\n\\n}\\n\\n\\n\\nvoid UIConstructor::EditUnit(int index)\\n\\n{\\n\\n QDialog d;\\n\\n d.setMinimumWidth(400);\\n\\n d.setWindowTitle(tr(\\\"Edit resource\\\"));\\n\\n d.setLayout(new QVBoxLayout(&d));\\n\\n d.layout()->setAlignment(Qt::AlignTop);\\n\\n QWidget *WidgetResource = Data[CurrentTab][index].WidgetEdit;\\n\\n QWidget *WidgetParent = WidgetResource->parentWidget();\\n\\n QVBoxLayout *LayoutParent = dynamic_cast<QVBoxLayout *>(WidgetParent->layout());\\n\\n int Index = LayoutParent->indexOf(WidgetResource);\\n\\n QScrollArea *Scroll = new QScrollArea(&d);\\n\\n Scroll->setWidgetResizable(true);\\n\\n QWidget *ScrollWidget = new QWidget(Scroll);\\n\\n ScrollWidget->setLayout(new QVBoxLayout(ScrollWidget));\\n\\n ScrollWidget->layout()->addWidget(WidgetResource);\\n\\n ScrollWidget->layout()->addItem(new QSpacerItem(10, 10, QSizePolicy::Expanding, QSizePolicy::Expanding));\\n\",\n \"file_path\": \"Engine/uiconstructor.cpp\",\n \"rank\": 88,\n \"score\": 35.33094006532995\n },\n {\n \"content\": \" typedef value::object object;\\n\\n \\n\\n inline value::value() : type_(null_type) {}\\n\\n \\n\\n inline value::value(int type, bool) : type_(type) {\\n\\n switch (type) {\\n\\n#define INIT(p, v) case p##type: u_.p = v; break\\n\\n INIT(boolean_, false);\\n\\n INIT(number_, 0.0);\\n\\n#ifdef PICOJSON_USE_INT64\\n\\n INIT(int64_, 0);\\n\\n#endif\\n\\n INIT(string_, new std::string());\\n\\n INIT(array_, new array());\\n\\n INIT(object_, new object());\\n\\n#undef INIT\\n\\n default: break;\\n\\n }\\n\\n }\\n\\n \\n\",\n \"file_path\": \"ChromeWorker/json/picojson.h\",\n \"rank\": 89,\n \"score\": 35.02916299160572\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\nQWidget* DesignChooserResourceWidget::GetTemplateWidgetByIndex(int index)\\n\\n{\\n\\n return ui->stackedWidget->widget(index);\\n\\n}\\n\\n\\n\\nvoid DesignChooserResourceWidget::changeEvent(QEvent *e)\\n\\n{\\n\\n QWidget::changeEvent(e);\\n\\n switch (e->type()) {\\n\\n case QEvent::LanguageChange:\\n\\n ui->retranslateUi(this);\\n\\n break;\\n\\n default:\\n\\n break;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Engine/designchooserresourcewidget.cpp\",\n \"rank\": 90,\n \"score\": 35.000525270605195\n },\n {\n \"content\": \" {\\n\\n ui->ComboType->addItem(tr(\\\"Is True\\\"));\\n\\n ui->ComboType->addItem(tr(\\\"Is False\\\"));\\n\\n }break;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid DatabaseAdminFilterCreate::on_ComboType_currentIndexChanged(int index)\\n\\n{\\n\\n if(Widget)\\n\\n {\\n\\n delete Widget;\\n\\n Widget = 0;\\n\\n }\\n\\n DatabaseColumn Column = Columns[ui->ComboColumn->currentIndex()];\\n\\n switch(Column.Type)\\n\\n {\\n\\n case DatabaseColumn::String:\\n\\n {\\n\\n if(index == 2)\\n\",\n \"file_path\": \"Engine/databaseadminfiltercreate.cpp\",\n \"rank\": 91,\n \"score\": 34.93993837027039\n },\n {\n \"content\": \" {\\n\\n case DatabaseColumn::Int:\\n\\n {\\n\\n ItemBuild.append(column_name,Item.toInt());\\n\\n }break;\\n\\n case DatabaseColumn::String:\\n\\n {\\n\\n ItemBuild.append(column_name,Item.toStdString());\\n\\n }break;\\n\\n case DatabaseColumn::Bool:\\n\\n {\\n\\n ItemBuild.append(column_name,Item == \\\"true\\\");\\n\\n }break;\\n\\n case DatabaseColumn::Date:\\n\\n {\\n\\n ItemBuild.append(column_name,Date_t(QDateTime::fromString(\\\"yyyy-MM-dd HH:mm:ss\\\").toMSecsSinceEpoch()));\\n\\n }break;\\n\\n\\n\\n }\\n\\n index++;\\n\",\n \"file_path\": \"Engine/mongodatabaseconnector.cpp\",\n \"rank\": 92,\n \"score\": 34.81466846196093\n },\n {\n \"content\": \"\\n\\n\\n\\n void DesignResourceWidget::changeEvent(QEvent *e)\\n\\n {\\n\\n QGroupBox::changeEvent(e);\\n\\n switch (e->type()) {\\n\\n case QEvent::LanguageChange:\\n\\n {\\n\\n int index = ui->comboBox->currentIndex();\\n\\n ui->retranslateUi(this);\\n\\n ui->comboBox->setCurrentIndex(index);\\n\\n DescriptionChanged(DescriptionTextBox->GetCurrentText());\\n\\n break;\\n\\n }\\n\\n default:\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n\\n\",\n \"file_path\": \"Engine/designresourcewidget.cpp\",\n \"rank\": 93,\n \"score\": 34.27579166687983\n },\n {\n \"content\": \"public Q_SLOTS:\\n\\n void setCheckedItems(const QStringList& items);\\n\\n void setCheckedData(const QStringList& items);\\n\\n void setCheckedIndexes(const QList<int>& indexes);\\n\\n QList<int> currentIndexes();\\n\\n\\n\\n void updateCheckedItems();\\n\\n void toggleCheckState(int index);\\n\\n\\n\\nQ_SIGNALS:\\n\\n void checkedItemsChanged(const QStringList& items);\\n\\n void checkedIndexesChanged(const QList<int>& itemsLast,const QList<int>& itemsNew);\\n\\n};\\n\\n\\n\\n#endif // QXTCHECKCOMBOBOX_H\\n\",\n \"file_path\": \"Engine/qxtcheckcombobox.h\",\n \"rank\": 94,\n \"score\": 34.099838573441815\n },\n {\n \"content\": \" virtual bool IsValid() = 0;\\n\\n virtual bool GetRequiresValidation() = 0;\\n\\n\\n\\n virtual bool GetIsAdvancedVisible() = 0;\\n\\n\\n\\n virtual void SetVisibleAdvanced(bool Visible) = 0;\\n\\n\\n\\n signals:\\n\\n void Up(int index);\\n\\n void Down(int index);\\n\\n void VariableNameChanged(QString name);\\n\\n void ResourceDestroyed();\\n\\n void VisibilityChanged(bool Visible);\\n\\n void ValidationStateChanged();\\n\\n void RequiresValidationStateChanged(bool Visible);\\n\\n public slots:\\n\\n virtual void VisibilityTriggerChanged(const QString& Value) = 0;\\n\\n virtual void VisibilityParentChanged(bool Visible) = 0;\\n\\n virtual void VisibilityAdvancedChanged(bool Visible) = 0;\\n\\n };\\n\\n}\\n\\n\\n\\n#endif // IRESOURCEWIDGET_H\\n\",\n \"file_path\": \"Engine/iresourcewidget.h\",\n \"rank\": 95,\n \"score\": 33.92772862319036\n },\n {\n \"content\": \"void DatabaseAdminTable::SingleItemEdit(QString Index)\\n\\n{\\n\\n DatabaseAdminItemEdit d;\\n\\n\\n\\n d.HideGroupBox();\\n\\n QList<DatabaseColumn> columns = DatabaseConnector->GetColumns(TableId);\\n\\n\\n\\n d.SetColumns(columns);\\n\\n\\n\\n bool found = false;\\n\\n DatabaseItem Item;\\n\\n foreach(DatabaseItem i, CurrentItems)\\n\\n {\\n\\n if(i.Id == Index)\\n\\n {\\n\\n Item = i;\\n\\n found = true;\\n\\n break;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"Engine/databaseadmintable.cpp\",\n \"rank\": 97,\n \"score\": 33.731558432727546\n },\n {\n \"content\": \" dataStream >> text >> offset;\\n\\n\\n\\n\\n\\n\\n\\n QLabel *newIcon = new QLabel(this);\\n\\n newIcon->setText(text);\\n\\n\\n\\n int index = 0;\\n\\n\\n\\n while(index < Layout->count())\\n\\n {\\n\\n QLayoutItem* item = Layout->itemAt(index);\\n\\n if(item)\\n\\n {\\n\\n if(!item->widget())\\n\\n {\\n\\n break;\\n\\n }\\n\\n if(!((event->pos() - offset).y() > item->widget()->pos().y()))\\n\\n {\\n\",\n \"file_path\": \"Engine/dragwidget.cpp\",\n \"rank\": 99,\n \"score\": 33.24865800299428\n }\n]","isConversational":false}}},{"rowIdx":77,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"wrappers/src/object-store/tests/results.cpp"},"repo_name":{"kind":"string","value":"drungrin/realm-dotnet"},"commit":{"kind":"string","value":"ebf18e8493fc730bfef694957a00b7890fc360c8"},"file_code":{"kind":"string","value":"#include \"catch.hpp\"\n\n#include \"util/test_file.hpp\"\n\n#include \"impl/realm_coordinator.hpp\"\n#include \"object_schema.hpp\"\n#include \"property.hpp\"\n#include \"results.hpp\"\n#include \"schema.hpp\"\n\n#include <realm/commit_log.hpp>\n#include <realm/group_shared.hpp>\n#include <realm/link_view.hpp>\n\nusing namespace realm;\n\nTEST_CASE(\"Results\") {\n InMemoryTestFile config;\n config.cache = false;\n config.automatic_change_notifications = false;\n config.schema = std::make_unique<Schema>(Schema{\n {\"object\", \"\", {\n {\"value\", PropertyTypeInt},\n {\"link\", PropertyTypeObject, \"linked to object\", false, false, true}\n }},\n {\"other object\", \"\", {\n {\"value\", PropertyTypeInt}\n }},\n {\"linking object\", \"\", {\n {\"link\", PropertyTypeObject, \"object\", false, false, true}\n }},\n {\"linked to object\", \"\", {\n {\"value\", PropertyTypeInt}\n }}\n });\n\n auto r = Realm::get_shared_realm(config);\n auto coordinator = _impl::RealmCoordinator::get_existing_coordinator(config.path);\n auto table = r->read_group()->get_table(\"class_object\");\n\n r->begin_transaction();\n table->add_empty_row(10);\n for (int i = 0; i < 10; ++i)\n table->set_int(0, i, i);\n r->commit_transaction();\n\n Results results(r, *config.schema->find(\"object\"), table->where().greater(0, 0).less(0, 5));\n\n SECTION(\"notifications\") {\n int notification_calls = 0;\n auto token = results.async([&](std::exception_ptr err) {\n REQUIRE_FALSE(err);\n ++notification_calls;\n });\n\n coordinator->on_change();\n r->notify();\n\n SECTION(\"initial results are delivered\") {\n REQUIRE(notification_calls == 1);\n }\n\n SECTION(\"modifying the table sends a notification asynchronously\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"modifying a linked-to table send a notification\") {\n r->begin_transaction();\n r->read_group()->get_table(\"class_linked to object\")->add_empty_row();\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"modifying a a linking table sends a notification\") {\n r->begin_transaction();\n r->read_group()->get_table(\"class_linking object\")->add_empty_row();\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"modifying a an unrelated table does not send a notification\") {\n r->begin_transaction();\n r->read_group()->get_table(\"class_other object\")->add_empty_row();\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 1);\n }\n\n SECTION(\"modifications from multiple transactions are collapsed\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n r->begin_transaction();\n table->set_int(0, 1, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"notifications are not delivered when the token is destroyed before they are calculated\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n token = {};\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 1);\n }\n\n SECTION(\"notifications are not delivered when the token is destroyed before they are delivered\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n token = {};\n r->notify();\n REQUIRE(notification_calls == 1);\n }\n }\n}\n"},"prefix":{"kind":"string","value":"#include \"catch.hpp\"\n\n#include \"util/test_file.hpp\"\n\n#include \"impl/realm_coordinator.hpp\"\n#include \"object_schema.hpp\"\n#include \"property.hpp\"\n#include \"results.hpp\"\n#include \"schema.hpp\"\n\n#include <realm/commit_log.hpp>\n#include <realm/group_shared.hpp>\n#include <realm/link_view.hpp>\n\nusing namespace realm;\n\nTEST_CASE(\"Results\") {\n InMemoryTestFile config;\n config.cache = false;\n config.automatic_change_notifications = false;\n config.schema = std::make_unique<Schema>(Schema{\n {\"object\", \"\", {\n {\"value\", PropertyTypeInt},\n {\"link\", PropertyTypeObject, \"linked to object\", false, false, true}\n }},\n {\"other object\", \"\", {\n {\"value\", PropertyTypeInt}\n }},\n {\"linking object\", \"\", {\n {\"link\", PropertyTypeObject, \"object\", false, false, true}\n }},\n {\"linked to object\", \"\", {\n {\"value\", PropertyTypeInt}\n }}\n });\n\n auto r = Realm::get_shared_realm(config);\n auto coordinator = _impl::RealmCoordinator::get_existing_coordinator(config.path);\n auto table = r->read_group()->get_table(\"class_object\");\n\n r->begin_transaction();\n table->add_empty_row(10);\n for (int i = 0; i < 10; ++i)\n table->set_int(0, i, i);\n r->commit_transaction();\n\n Results results(r, *config.schema->find(\"object\"), table->where().greater(0, 0).less(0, 5));\n\n SECTION(\"notifications\") {\n int notification_calls = 0;\n auto token = results.async([&](std::exception_ptr err) {\n REQUIRE_FALSE(err);\n ++notification_calls;\n });\n\n coordinator->on_change();\n r->notify();\n\n SECTION(\"initial results are delivered\") {\n REQUIRE(notification_calls == 1);\n }\n\n SECTION(\"modifying the table sends a notification asynchronously\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"modifying a linked-to table send a notification\") {\n r->begin_transaction();\n r->read_group()->get_table(\"class_linked to object\")->add_empty_row();\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"modifying a a linking table sends a notification\") {\n r->begin_transaction();\n "},"suffix":{"kind":"string","value":"();\n REQUIRE(notification_calls == 1);\n }\n\n SECTION(\"modifications from multiple transactions are collapsed\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n r->begin_transaction();\n table->set_int(0, 1, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"notifications are not delivered when the token is destroyed before they are calculated\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n token = {};\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 1);\n }\n\n SECTION(\"notifications are not delivered when the token is destroyed before they are delivered\") {\n r->begin_transaction();\n table->set_int(0, 0, 0);\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n token = {};\n r->notify();\n REQUIRE(notification_calls == 1);\n }\n }\n}\n"},"middle":{"kind":"string","value":" r->read_group()->get_table(\"class_linking object\")->add_empty_row();\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify();\n REQUIRE(notification_calls == 2);\n }\n\n SECTION(\"modifying a an unrelated table does not send a notification\") {\n r->begin_transaction();\n r->read_group()->get_table(\"class_other object\")->add_empty_row();\n r->commit_transaction();\n\n REQUIRE(notification_calls == 1);\n coordinator->on_change();\n r->notify"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct ValueGetter<Int, TableGetter> {\n\n static Int convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.long_for_argument(stot<int>(value.s));\n\n }\n\n return stot<long long>(value.s);\n\n }\n\n};\n\n\n\ntemplate <typename TableGetter>\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":0,"score":171603.5841718181},{"content":"class Results;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":1,"score":166494.91037915432},{"content":"struct TestFile : realm::Realm::Config {\n\n TestFile();\n\n ~TestFile();\n\n};\n\n\n","file_path":"wrappers/src/object-store/tests/util/test_file.hpp","rank":2,"score":159108.45091983024},{"content":"struct AsyncQueryCancelationToken;\n\n\n\nnamespace _impl {\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":3,"score":155139.7666355736},{"content":"struct true_value : pegtl_istring_t(\"true\") {};\n","file_path":"wrappers/src/object-store/src/parser/parser.cpp","rank":4,"score":147700.97269541209},{"content":"// RealmCoordinator manages the weak cache of Realm instances and communication\n\n// between per-thread Realm instances for a given file\n\nclass RealmCoordinator : public std::enable_shared_from_this<RealmCoordinator> {\n\npublic:\n\n // Get the coordinator for the given path, creating it if neccesary\n\n static std::shared_ptr<RealmCoordinator> get_coordinator(StringData path);\n\n // Get the coordinator for the given path, or null if there is none\n\n static std::shared_ptr<RealmCoordinator> get_existing_coordinator(StringData path);\n\n\n\n // Get a thread-local shared Realm with the given configuration\n\n // If the Realm is already open on another thread, validates that the given\n\n // configuration is compatible with the existing one\n\n std::shared_ptr<Realm> get_realm(Realm::Config config);\n\n std::shared_ptr<Realm> get_realm();\n\n\n\n const Schema* get_schema() const noexcept;\n\n uint64_t get_schema_version() const noexcept { return m_config.schema_version; }\n\n const std::string& get_path() const noexcept { return m_config.path; }\n\n const std::vector<char>& get_encryption_key() const noexcept { return m_config.encryption_key; }\n\n bool is_in_memory() const noexcept { return m_config.in_memory; }\n\n\n\n // Asynchronously call notify() on every Realm instance for this coordinator's\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":5,"score":142543.49181552642},{"content":" class RealmCoordinator;\n\n }\n\n\n","file_path":"wrappers/src/object-store/src/shared_realm.hpp","rank":6,"score":134338.9082635727},{"content":"// FIXME: TrueExpression and FalseExpression should be supported by core in some way\n\nstruct TrueExpression : realm::Expression {\n\n size_t find_first(size_t start, size_t end) const override\n\n {\n\n if (start != end)\n\n return start;\n\n\n\n return realm::not_found;\n\n }\n\n void set_base_table(const Table*) override {}\n\n const Table* get_base_table() const override { return nullptr; }\n\n std::unique_ptr<Expression> clone(QueryNodeHandoverPatches*) const override\n\n {\n\n return std::unique_ptr<Expression>(new TrueExpression(*this));\n\n }\n\n};\n\n\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":7,"score":130488.83623084967},{"content":"class WeakRealmNotifier;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":8,"score":128773.28248804285},{"content":" // path, including those in other processes\n\n void send_commit_notifications();\n\n\n\n // Clear the weak Realm cache for all paths\n\n // Should only be called in test code, as continuing to use the previously\n\n // cached instances will have odd results\n\n static void clear_cache();\n\n\n\n // Clears all caches on existing coordinators\n\n static void clear_all_caches();\n\n\n\n // Explicit constructor/destructor needed for the unique_ptrs to forward-declared types\n\n RealmCoordinator();\n\n ~RealmCoordinator();\n\n\n\n // Called by Realm's destructor to ensure the cache is cleaned up promptly\n\n // Do not call directly\n\n void unregister_realm(Realm* realm);\n\n\n\n // Called by m_notifier when there's a new commit to send notifications for\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":9,"score":126599.42023404858},{"content":"#include \"impl/async_query.hpp\"\n\n#include \"impl/weak_realm_notifier.hpp\"\n\n#include \"impl/external_commit_helper.hpp\"\n\n#include \"impl/transact_log_handler.hpp\"\n\n#include \"object_store.hpp\"\n\n#include \"schema.hpp\"\n\n\n\n#include <realm/commit_log.hpp>\n\n#include <realm/group_shared.hpp>\n\n#include <realm/lang_bind_helper.hpp>\n\n#include <realm/query.hpp>\n\n#include <realm/table_view.hpp>\n\n\n\n#include <cassert>\n\n#include <unordered_map>\n\n\n\nusing namespace realm;\n\nusing namespace realm::_impl;\n\n\n\nstatic std::mutex s_coordinator_mutex;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":10,"score":126596.92501506646},{"content":" coordinator->clear_cache();\n\n }\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::send_commit_notifications()\n\n{\n\n REALM_ASSERT(!m_config.read_only);\n\n if (m_notifier) {\n\n m_notifier->notify_others();\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::pin_version(uint_fast64_t version, uint_fast32_t index)\n\n{\n\n if (m_async_error) {\n\n return;\n\n }\n\n\n\n SharedGroup::VersionID versionid(version, index);\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":11,"score":126592.17076040943},{"content":"////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Copyright 2015 Realm Inc.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n////////////////////////////////////////////////////////////////////////////\n\n\n\n#ifndef REALM_COORDINATOR_HPP\n\n#define REALM_COORDINATOR_HPP\n\n\n\n#include \"shared_realm.hpp\"\n\n\n\n#include <realm/string_data.hpp>\n\n#include <mutex>\n\n\n\nnamespace realm {\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":12,"score":126590.43438180596},{"content":"\n\n auto realm = std::make_shared<Realm>(std::move(config));\n\n realm->init(shared_from_this());\n\n m_weak_realm_notifiers.emplace_back(realm, m_config.cache);\n\n return realm;\n\n}\n\n\n\nstd::shared_ptr<Realm> RealmCoordinator::get_realm()\n\n{\n\n return get_realm(m_config);\n\n}\n\n\n\nconst Schema* RealmCoordinator::get_schema() const noexcept\n\n{\n\n return m_weak_realm_notifiers.empty() ? nullptr : m_config.schema.get();\n\n}\n\n\n\nvoid RealmCoordinator::update_schema(Schema const& schema)\n\n{\n\n // FIXME: this should probably be doing some sort of validation and\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":13,"score":126589.55347675926},{"content":" // then updated m_config with any tables present in config but not in\n\n // it\n\n // Public API currently doesn't make it possible to have non-matching\n\n // schemata so it's not a huge issue\n\n if ((false) && m_config.schema != config.schema) {\n\n throw MismatchedConfigException(\"Realm at path already opened with different schema\");\n\n }\n\n }\n\n\n\n if (config.cache) {\n\n for (auto& cachedRealm : m_weak_realm_notifiers) {\n\n if (cachedRealm.is_cached_for_current_thread()) {\n\n // can be null if we jumped in between ref count hitting zero and\n\n // unregister_realm() getting the lock\n\n if (auto realm = cachedRealm.realm()) {\n\n return realm;\n\n }\n\n }\n\n }\n\n }\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":14,"score":126588.97521873185},{"content":" // notifying all Realm instances of the new schema in some way\n\n m_config.schema = std::make_unique<Schema>(schema);\n\n}\n\n\n\nRealmCoordinator::RealmCoordinator() = default;\n\n\n\nRealmCoordinator::~RealmCoordinator()\n\n{\n\n std::lock_guard<std::mutex> coordinator_lock(s_coordinator_mutex);\n\n for (auto it = s_coordinators_per_path.begin(); it != s_coordinators_per_path.end(); ) {\n\n if (it->second.expired()) {\n\n it = s_coordinators_per_path.erase(it);\n\n }\n\n else {\n\n ++it;\n\n }\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::unregister_realm(Realm* realm)\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":15,"score":126588.67301881687},{"content":" return it == s_coordinators_per_path.end() ? nullptr : it->second.lock();\n\n}\n\n\n\nstd::shared_ptr<Realm> RealmCoordinator::get_realm(Realm::Config config)\n\n{\n\n std::lock_guard<std::mutex> lock(m_realm_mutex);\n\n if ((!m_config.read_only && !m_notifier) || (m_config.read_only && m_weak_realm_notifiers.empty())) {\n\n m_config = config;\n\n if (!config.read_only && !m_notifier && config.automatic_change_notifications) {\n\n try {\n\n m_notifier = std::make_unique<ExternalCommitHelper>(*this);\n\n }\n\n catch (std::system_error const& ex) {\n\n throw RealmFileException(RealmFileException::Kind::AccessError, config.path, ex.code().message());\n\n }\n\n }\n\n }\n\n else {\n\n if (m_config.read_only != config.read_only) {\n\n throw MismatchedConfigException(\"Realm at path already opened with different read permissions.\");\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":16,"score":126588.37555488684},{"content":" }\n\n\n\n for (auto& query : queries) {\n\n query->call_callbacks();\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::process_available_async(Realm& realm)\n\n{\n\n auto& sg = Realm::Internal::get_shared_group(realm);\n\n decltype(m_queries) queries;\n\n {\n\n std::lock_guard<std::mutex> lock(m_query_mutex);\n\n for (auto& query : m_queries) {\n\n if (query->deliver(sg, m_async_error)) {\n\n queries.push_back(query);\n\n }\n\n }\n\n }\n\n\n\n for (auto& query : queries) {\n\n query->call_callbacks();\n\n }\n\n}\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":17,"score":126587.4504532688},{"content":"\n\n for (auto& weak_coordinator : s_coordinators_per_path) {\n\n auto coordinator = weak_coordinator.second.lock();\n\n if (!coordinator) {\n\n continue;\n\n }\n\n\n\n coordinator->m_notifier = nullptr;\n\n\n\n // Gather a list of all of the realms which will be removed\n\n for (auto& weak_realm_notifier : coordinator->m_weak_realm_notifiers) {\n\n if (auto realm = weak_realm_notifier.realm()) {\n\n realms_to_close.push_back(realm);\n\n }\n\n }\n\n }\n\n\n\n s_coordinators_per_path.clear();\n\n }\n\n\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":18,"score":126586.9683499873},{"content":" // Close all of the previously cached Realms. This can't be done while\n\n // s_coordinator_mutex is held as it may try to re-lock it.\n\n for (auto& weak_realm : realms_to_close) {\n\n if (auto realm = weak_realm.lock()) {\n\n realm->close();\n\n }\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::clear_all_caches()\n\n{\n\n std::vector<std::weak_ptr<RealmCoordinator>> to_clear;\n\n {\n\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\n\n for (auto iter : s_coordinators_per_path) {\n\n to_clear.push_back(iter.second);\n\n }\n\n }\n\n for (auto weak_coordinator : to_clear) {\n\n if (auto coordinator = weak_coordinator.lock()) {\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":19,"score":126586.59921166494},{"content":"static std::unordered_map<std::string, std::weak_ptr<RealmCoordinator>> s_coordinators_per_path;\n\n\n\nstd::shared_ptr<RealmCoordinator> RealmCoordinator::get_coordinator(StringData path)\n\n{\n\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\n\n\n\n auto& weak_coordinator = s_coordinators_per_path[path];\n\n if (auto coordinator = weak_coordinator.lock()) {\n\n return coordinator;\n\n }\n\n\n\n auto coordinator = std::make_shared<RealmCoordinator>();\n\n weak_coordinator = coordinator;\n\n return coordinator;\n\n}\n\n\n\nstd::shared_ptr<RealmCoordinator> RealmCoordinator::get_existing_coordinator(StringData path)\n\n{\n\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\n\n auto it = s_coordinators_per_path.find(path);\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":20,"score":126586.06926895019},{"content":" }\n\n if (m_config.in_memory != config.in_memory) {\n\n throw MismatchedConfigException(\"Realm at path already opened with different inMemory settings.\");\n\n }\n\n if (m_config.encryption_key != config.encryption_key) {\n\n std::stringstream msg;\n\n msg << \"Realm at path \" << config.path << \" already opened with a different encryption key.\" << std::hex;\n\n for (char c : m_config.encryption_key)\n\n msg << c << ' ';\n\n msg << \"\\n---\\n\";\n\n for (char c : config.encryption_key)\n\n msg << c << ' ';\n\n throw MismatchedConfigException(msg.str());\n\n// throw MismatchedConfigException(\"Realm at path already opened with a different encryption key.\");\n\n }\n\n if (m_config.schema_version != config.schema_version && config.schema_version != ObjectStore::NotVersioned) {\n\n throw MismatchedConfigException(\"Realm at path already opened with different schema version.\");\n\n }\n\n // FIXME: verify that schema is compatible\n\n // Needs to verify that all tables present in both are identical, and\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":21,"score":126585.6624025909},{"content":" m_advancer_sg->end_read();\n\n m_advancer_sg->begin_read(versionid);\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::register_query(std::shared_ptr<AsyncQuery> query)\n\n{\n\n auto version = query->version();\n\n auto& self = Realm::Internal::get_coordinator(query->get_realm());\n\n {\n\n std::lock_guard<std::mutex> lock(self.m_query_mutex);\n\n self.pin_version(version.version, version.index);\n\n self.m_new_queries.push_back(std::move(query));\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::clean_up_dead_queries()\n\n{\n\n auto swap_remove = [&](auto& container) {\n\n bool did_remove = false;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":22,"score":126584.44167442931},{"content":"\n\n move_new_queries_to_main();\n\n m_advancer_sg->end_read();\n\n}\n\n\n\nvoid RealmCoordinator::advance_to_ready(Realm& realm)\n\n{\n\n decltype(m_queries) queries;\n\n\n\n auto& sg = Realm::Internal::get_shared_group(realm);\n\n\n\n auto get_query_version = [&] {\n\n for (auto& query : m_queries) {\n\n auto version = query->version();\n\n if (version != SharedGroup::VersionID{}) {\n\n return version;\n\n }\n\n }\n\n return SharedGroup::VersionID{};\n\n };\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":23,"score":126583.76173555509},{"content":"////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Copyright 2015 Realm Inc.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n////////////////////////////////////////////////////////////////////////////\n\n\n\n#include \"impl/realm_coordinator.hpp\"\n\n\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":24,"score":126583.5665108331},{"content":" void open_helper_shared_group();\n\n void move_new_queries_to_main();\n\n void advance_helper_shared_group_to_latest();\n\n void clean_up_dead_queries();\n\n};\n\n\n\n} // namespace _impl\n\n} // namespace realm\n\n\n\n#endif /* REALM_COORDINATOR_HPP */\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":25,"score":126583.18646239185},{"content":"{\n\n std::lock_guard<std::mutex> lock(m_realm_mutex);\n\n for (size_t i = 0; i < m_weak_realm_notifiers.size(); ++i) {\n\n auto& weak_realm_notifier = m_weak_realm_notifiers[i];\n\n if (!weak_realm_notifier.expired() && !weak_realm_notifier.is_for_realm(realm)) {\n\n continue;\n\n }\n\n\n\n if (i + 1 < m_weak_realm_notifiers.size()) {\n\n weak_realm_notifier = std::move(m_weak_realm_notifiers.back());\n\n }\n\n m_weak_realm_notifiers.pop_back();\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::clear_cache()\n\n{\n\n std::vector<WeakRealm> realms_to_close;\n\n {\n\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":26,"score":126582.42662212723},{"content":"\n\n clean_up_dead_queries();\n\n}\n\n\n\nvoid RealmCoordinator::open_helper_shared_group()\n\n{\n\n if (!m_query_sg) {\n\n try {\n\n std::unique_ptr<Group> read_only_group;\n\n Realm::open_with_config(m_config, m_query_history, m_query_sg, read_only_group);\n\n REALM_ASSERT(!read_only_group);\n\n m_query_sg->begin_read();\n\n }\n\n catch (...) {\n\n // Store the error to be passed to the async queries\n\n m_async_error = std::current_exception();\n\n m_query_sg = nullptr;\n\n m_query_history = nullptr;\n\n }\n\n }\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":27,"score":126581.86635893796},{"content":" // may end up calling user code (in did_change() notifications)\n\n transaction::advance(sg, realm.m_binding_context.get(), version);\n\n\n\n // Reacquire the lock and recheck the query version, as the queries may\n\n // have advanced to a later version while we didn't hold the lock. If\n\n // so, we need to release the lock and re-advance\n\n std::lock_guard<std::mutex> lock(m_query_mutex);\n\n version = get_query_version();\n\n if (version.version == std::numeric_limits<uint_fast64_t>::max())\n\n return;\n\n if (version != sg.get_version_of_current_transaction())\n\n continue;\n\n\n\n // Query version now matches the SG version, so we can deliver them\n\n for (auto& query : m_queries) {\n\n if (query->deliver(sg, m_async_error)) {\n\n queries.push_back(query);\n\n }\n\n }\n\n break;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":28,"score":126581.77992776605},{"content":" // groups is expensive\n\n if (m_queries.empty() && m_query_sg) {\n\n m_query_sg->end_read();\n\n }\n\n }\n\n if (swap_remove(m_new_queries)) {\n\n if (m_new_queries.empty() && m_advancer_sg) {\n\n m_advancer_sg->end_read();\n\n }\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::on_change()\n\n{\n\n run_async_queries();\n\n\n\n std::lock_guard<std::mutex> lock(m_realm_mutex);\n\n for (auto& realm : m_weak_realm_notifiers) {\n\n realm.notify();\n\n }\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":29,"score":126581.77883793744},{"content":" void on_change();\n\n\n\n // Update the schema in the cached config\n\n void update_schema(Schema const& new_schema);\n\n\n\n static void register_query(std::shared_ptr<AsyncQuery> query);\n\n\n\n // Advance the Realm to the most recent transaction version which all async\n\n // work is complete for\n\n void advance_to_ready(Realm& realm);\n\n void process_available_async(Realm& realm);\n\n\n\nprivate:\n\n Realm::Config m_config;\n\n\n\n std::mutex m_realm_mutex;\n\n std::vector<WeakRealmNotifier> m_weak_realm_notifiers;\n\n\n\n std::mutex m_query_mutex;\n\n std::vector<std::shared_ptr<_impl::AsyncQuery>> m_new_queries;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":30,"score":126579.13485281267},{"content":"\n\n SharedGroup::VersionID version;\n\n {\n\n std::lock_guard<std::mutex> lock(m_query_mutex);\n\n version = get_query_version();\n\n }\n\n\n\n // no async queries; just advance to latest\n\n if (version.version == std::numeric_limits<uint_fast64_t>::max()) {\n\n transaction::advance(sg, realm.m_binding_context.get());\n\n return;\n\n }\n\n\n\n // async results are out of date; ignore\n\n if (version < sg.get_version_of_current_transaction()) {\n\n return;\n\n }\n\n\n\n while (true) {\n\n // Advance to the ready version without holding any locks because it\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":31,"score":126578.69076864712},{"content":" else if (m_queries.empty()) {\n\n m_query_sg->begin_read();\n\n }\n\n}\n\n\n\nvoid RealmCoordinator::move_new_queries_to_main()\n\n{\n\n m_queries.reserve(m_queries.size() + m_new_queries.size());\n\n std::move(m_new_queries.begin(), m_new_queries.end(), std::back_inserter(m_queries));\n\n m_new_queries.clear();\n\n}\n\n\n\nvoid RealmCoordinator::advance_helper_shared_group_to_latest()\n\n{\n\n if (m_new_queries.empty()) {\n\n LangBindHelper::advance_read(*m_query_sg);\n\n return;\n\n }\n\n\n\n // Sort newly added queries by their source version so that we can pull them\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":32,"score":126577.06457230657},{"content":" if (!m_advancer_sg) {\n\n try {\n\n std::unique_ptr<Group> read_only_group;\n\n Realm::open_with_config(m_config, m_advancer_history, m_advancer_sg, read_only_group);\n\n REALM_ASSERT(!read_only_group);\n\n m_advancer_sg->begin_read(versionid);\n\n }\n\n catch (...) {\n\n m_async_error = std::current_exception();\n\n m_advancer_sg = nullptr;\n\n m_advancer_history = nullptr;\n\n }\n\n }\n\n else if (m_new_queries.empty()) {\n\n // If this is the first query then we don't already have a read transaction\n\n m_advancer_sg->begin_read(versionid);\n\n }\n\n else if (versionid < m_advancer_sg->get_version_of_current_transaction()) {\n\n // Ensure we're holding a readlock on the oldest version we have a\n\n // handover object for, as handover objects don't\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":33,"score":126576.80744404714},{"content":"}\n\n\n\nvoid RealmCoordinator::run_async_queries()\n\n{\n\n std::unique_lock<std::mutex> lock(m_query_mutex);\n\n\n\n clean_up_dead_queries();\n\n\n\n if (m_queries.empty() && m_new_queries.empty()) {\n\n return;\n\n }\n\n\n\n if (!m_async_error) {\n\n open_helper_shared_group();\n\n }\n\n\n\n if (m_async_error) {\n\n move_new_queries_to_main();\n\n return;\n\n }\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":34,"score":126575.94475168914},{"content":"\n\n advance_helper_shared_group_to_latest();\n\n\n\n // Make a copy of the queries vector so that we can release the lock while\n\n // we run the queries\n\n auto queries_to_run = m_queries;\n\n lock.unlock();\n\n\n\n for (auto& query : queries_to_run) {\n\n query->run();\n\n }\n\n\n\n // Reacquire the lock while updating the fields that are actually read on\n\n // other threads\n\n {\n\n lock.lock();\n\n for (auto& query : queries_to_run) {\n\n query->prepare_handover();\n\n }\n\n }\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":35,"score":126573.3825575404},{"content":" // all forward to the latest version in a single pass over the transaction log\n\n std::sort(m_new_queries.begin(), m_new_queries.end(), [](auto const& lft, auto const& rgt) {\n\n return lft->version() < rgt->version();\n\n });\n\n\n\n // Import all newly added queries to our helper SG\n\n for (auto& query : m_new_queries) {\n\n LangBindHelper::advance_read(*m_advancer_sg, query->version());\n\n query->attach_to(*m_advancer_sg);\n\n }\n\n\n\n // Advance both SGs to the newest version\n\n LangBindHelper::advance_read(*m_advancer_sg);\n\n LangBindHelper::advance_read(*m_query_sg, m_advancer_sg->get_version_of_current_transaction());\n\n\n\n // Transfer all new queries over to the main SG\n\n for (auto& query : m_new_queries) {\n\n query->detatch();\n\n query->attach_to(*m_query_sg);\n\n }\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":36,"score":126573.09025340127},{"content":" std::vector<std::shared_ptr<_impl::AsyncQuery>> m_queries;\n\n\n\n // SharedGroup used for actually running async queries\n\n // Will have a read transaction iff m_queries is non-empty\n\n std::unique_ptr<Replication> m_query_history;\n\n std::unique_ptr<SharedGroup> m_query_sg;\n\n\n\n // SharedGroup used to advance queries in m_new_queries to the main shared\n\n // group's transaction version\n\n // Will have a read transaction iff m_new_queries is non-empty\n\n std::unique_ptr<Replication> m_advancer_history;\n\n std::unique_ptr<SharedGroup> m_advancer_sg;\n\n std::exception_ptr m_async_error;\n\n\n\n std::unique_ptr<_impl::ExternalCommitHelper> m_notifier;\n\n\n\n // must be called with m_query_mutex locked\n\n void pin_version(uint_fast64_t version, uint_fast32_t index);\n\n\n\n void run_async_queries();\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":37,"score":126571.6167292231},{"content":" for (size_t i = 0; i < container.size(); ++i) {\n\n if (container[i]->is_alive())\n\n continue;\n\n\n\n // Ensure the query is destroyed here even if there's lingering refs\n\n // to the async query elsewhere\n\n container[i]->release_query();\n\n\n\n if (container.size() > i + 1)\n\n container[i] = std::move(container.back());\n\n container.pop_back();\n\n --i;\n\n did_remove = true;\n\n }\n\n return did_remove;\n\n };\n\n\n\n if (swap_remove(m_queries)) {\n\n // Make sure we aren't holding on to read versions needlessly if there\n\n // are no queries left, but don't close them entirely as opening shared\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.cpp","rank":38,"score":126571.45893748602},{"content":"// A token which keeps an asynchronous query alive\n\nstruct AsyncQueryCancelationToken {\n\n AsyncQueryCancelationToken() = default;\n\n AsyncQueryCancelationToken(std::shared_ptr<_impl::AsyncQuery> query, size_t token);\n\n ~AsyncQueryCancelationToken();\n\n\n\n AsyncQueryCancelationToken(AsyncQueryCancelationToken&&);\n\n AsyncQueryCancelationToken& operator=(AsyncQueryCancelationToken&&);\n\n\n\n AsyncQueryCancelationToken(AsyncQueryCancelationToken const&) = delete;\n\n AsyncQueryCancelationToken& operator=(AsyncQueryCancelationToken const&) = delete;\n\n\n\nprivate:\n\n util::AtomicSharedPtr<_impl::AsyncQuery> m_query;\n\n size_t m_token;\n\n};\n\n\n","file_path":"wrappers/src/object-store/src/results.hpp","rank":39,"score":124944.57382635515},{"content":"class Schema;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":40,"score":123411.35808220456},{"content":"class Replication;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":41,"score":123411.35808220456},{"content":"class SharedGroup;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":42,"score":120408.87735105006},{"content":"class AsyncQuery;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":43,"score":120408.87735105006},{"content":"class AsyncQueryCallback;\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":44,"score":117549.02167780974},{"content":"class ExternalCommitHelper;\n\n\n","file_path":"wrappers/src/object-store/src/impl/realm_coordinator.hpp","rank":45,"score":117549.02167780974},{"content":" class Realm;\n","file_path":"wrappers/src/object-store/src/shared_realm.hpp","rank":46,"score":116605.73899319385},{"content":"struct ValueGetter<Float, TableGetter> {\n\n static Float convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.float_for_argument(stot<int>(value.s));\n\n }\n\n return stot<float>(value.s);\n\n }\n\n};\n\n\n\ntemplate <typename TableGetter>\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":47,"score":116575.41835758643},{"content":"struct ValueGetter<bool, TableGetter> {\n\n static bool convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.bool_for_argument(stot<int>(value.s));\n\n }\n\n if (value.type != parser::Expression::Type::True && value.type != parser::Expression::Type::False) {\n\n throw std::runtime_error(\"Attempting to compare bool property to a non-bool value\");\n\n }\n\n return value.type == parser::Expression::Type::True;\n\n }\n\n};\n\n\n\ntemplate <typename TableGetter>\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":48,"score":116575.41835758643},{"content":"struct ValueGetter<Binary, TableGetter> {\n\n static std::string convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.binary_for_argument(stot<int>(value.s));\n\n }\n\n throw std::runtime_error(\"Binary properties must be compared against a binary argument.\");\n\n }\n\n};\n\n\n\ntemplate <typename RetType, typename Value, typename TableGetter>\n\nauto value_of_type_for_query(TableGetter&& tables, Value&& value, Arguments &args)\n\n{\n\n const bool isColumn = std::is_same<PropertyExpression, typename std::remove_reference<Value>::type>::value;\n\n using helper = std::conditional_t<isColumn, ColumnGetter<RetType, TableGetter>, ValueGetter<RetType, TableGetter>>;\n\n return helper::convert(tables, value, args);\n\n}\n\n\n\ntemplate <typename A, typename B>\n\nvoid do_add_comparison_to_query(Query &query, const Schema &schema, const ObjectSchema &object_schema, Predicate::Comparison cmp,\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":49,"score":116575.41835758643},{"content":"struct ValueGetter<Double, TableGetter> {\n\n static Double convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.double_for_argument(stot<int>(value.s));\n\n }\n\n return stot<double>(value.s);\n\n }\n\n};\n\n\n\ntemplate <typename TableGetter>\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":50,"score":116575.41835758643},{"content":"struct ValueGetter<Timestamp, TableGetter> {\n\n static Timestamp convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type != parser::Expression::Type::Argument) {\n\n throw std::runtime_error(\"You must pass in a date argument to compare\");\n\n }\n\n return args.timestamp_for_argument(stot<int>(value.s));\n\n }\n\n};\n\n\n\ntemplate <typename TableGetter>\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":51,"score":116575.41835758643},{"content":"struct ValueGetter<String, TableGetter> {\n\n static std::string convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.string_for_argument(stot<int>(value.s));\n\n }\n\n if (value.type != parser::Expression::Type::String) {\n\n throw std::runtime_error(\"Attempting to compare String property to a non-String value\");\n\n }\n\n return value.s;\n\n }\n\n};\n\n\n\ntemplate <typename TableGetter>\n","file_path":"wrappers/src/object-store/src/parser/query_builder.cpp","rank":52,"score":116575.41835758643},{"content":"class RealmCoordinator;\n\n\n","file_path":"wrappers/src/object-store/src/impl/apple/external_commit_helper.hpp","rank":53,"score":114821.86428532735},{"content":"class RealmCoordinator;\n\n\n","file_path":"wrappers/src/object-store/src/impl/android/external_commit_helper.hpp","rank":54,"score":114821.86428532735},{"content":"class RealmCoordinator;\n\n\n","file_path":"wrappers/src/object-store/src/impl/generic/external_commit_helper.hpp","rank":55,"score":114821.86428532735},{"content":"// expressions and operators\n\nstruct expr : sor< dq_string, sq_string, number, argument, true_value, false_value, key_path > {};\n","file_path":"wrappers/src/object-store/src/parser/parser.cpp","rank":56,"score":112020.61349159316},{"content":"class Realm;\n\n\n\nnamespace _impl {\n\n\n","file_path":"wrappers/src/object-store/src/impl/android/weak_realm_notifier.hpp","rank":57,"score":111224.69475457053},{"content":"class Realm;\n\n\n\nnamespace _impl {\n\n\n","file_path":"wrappers/src/object-store/src/impl/weak_realm_notifier_base.hpp","rank":58,"score":111224.69475457053},{"content":"class Realm;\n\n\n\nnamespace _impl {\n\n\n","file_path":"wrappers/src/object-store/src/impl/apple/weak_realm_notifier.hpp","rank":59,"score":111224.69475457053},{"content":"class Realm;\n\n\n\nnamespace _impl {\n\n\n","file_path":"wrappers/src/object-store/src/impl/generic/weak_realm_notifier.hpp","rank":60,"score":111224.69475457053},{"content":" class MismatchedConfigException : public std::runtime_error {\n\n public:\n\n MismatchedConfigException(std::string message) : std::runtime_error(message) {}\n\n };\n\n\n","file_path":"wrappers/src/object-store/src/shared_realm.hpp","rank":61,"score":109805.06709170752},{"content":" class Realm : public std::enable_shared_from_this<Realm> {\n\n public:\n\n typedef std::function<void(SharedRealm old_realm, SharedRealm realm)> MigrationFunction;\n\n\n\n struct Config {\n\n std::string path;\n\n // User-supplied encryption key. Must be either empty or 64 bytes.\n\n std::vector<char> encryption_key;\n\n\n\n // Optional schema for the file. If nullptr, the existing schema\n\n // from the file opened will be used. If present, the file will be\n\n // migrated to the schema if needed.\n\n std::unique_ptr<Schema> schema;\n\n uint64_t schema_version;\n\n\n\n MigrationFunction migration_function;\n\n\n\n bool read_only = false;\n\n bool in_memory = false;\n\n\n","file_path":"wrappers/src/object-store/src/shared_realm.hpp","rank":62,"score":109682.97869016336},{"content":"class Realm;\n","file_path":"wrappers/src/object-store/src/list.hpp","rank":63,"score":108017.3462494512},{"content":" {\n\n NativeTable.clear_link(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n else\n\n {\n\n if (!value.IsManaged)\n\n _realm.Manage(value);\n\n NativeTable.set_link(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, (IntPtr)value.RowHandle.RowIndex);\n\n }\n\n }\n\n\n\n #endregion\n\n\n\n /**\n\n * Shared factory to make an object in the realm from a known row\n\n * @param rowPtr may be null if a relationship lookup has failed.\n\n */\n\n internal RealmObject MakeRealmObject(Type objectType, IntPtr rowPtr) {\n\n if (rowPtr == IntPtr.Zero)\n\n return null; // typically no related object\n","file_path":"Realm.Shared/RealmObject.cs","rank":64,"score":101367.08161588392},{"content":" protected T GetObjectValue<T>(string propertyName) where T : RealmObject\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n var linkedRowPtr = NativeTable.get_link (_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n return (T)MakeRealmObject(typeof(T), linkedRowPtr);\n\n }\n\n\n\n #endregion\n\n\n\n #region Setters\n\n\n\n protected void SetStringValue(string propertyName, string value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":65,"score":101365.72858346124},{"content":"\n\n protected DateTimeOffset? GetNullableDateTimeOffsetValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n long unixTimeMS = 0;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, ref unixTimeMS));\n\n return hasValue ? DateTimeOffsetExtensions.FromRealmUnixTimeMilliseconds(unixTimeMS) : (DateTimeOffset?)null;\n\n }\n\n\n\n protected RealmList<T> GetListValue<T>(string propertyName) where T : RealmObject\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var listHandle = _metadata.Table.TableLinkList (_metadata.ColumnIndices[propertyName], _rowHandle);\n\n return new RealmList<T>(this, listHandle);\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":66,"score":101362.91024460361},{"content":"\n\n if (value.HasValue)\n\n {\n\n var marshalledValue = value.Value.ToRealmUnixTimeMilliseconds();\n\n NativeTable.set_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, marshalledValue);\n\n }\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n // TODO make not generic\n\n protected void SetObjectValue<T>(string propertyName, T value) where T : RealmObject\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n if (value == null)\n","file_path":"Realm.Shared/RealmObject.cs","rank":67,"score":101362.68407896494},{"content":" NativeTable.set_string_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value, (IntPtr)value.Length);\n\n }\n\n\n\n protected void SetCharValue(string propertyName, char value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetCharValueUnique(string propertyName, char value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n","file_path":"Realm.Shared/RealmObject.cs","rank":68,"score":101362.0315149458},{"content":" NativeTable.set_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n protected void SetDoubleValue(string propertyName, double value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableDoubleValue(string propertyName, double? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n","file_path":"Realm.Shared/RealmObject.cs","rank":69,"score":101361.76347608081},{"content":" var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value != null)\n\n NativeTable.set_string(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value, (IntPtr)value.Length);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n protected void SetStringValueUnique(string propertyName, string value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n if (value == null)\n\n throw new ArgumentException(\"Object identifiers cannot be null\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":70,"score":101361.57360874528},{"content":" protected void SetInt32Value(string propertyName, int value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetInt32ValueUnique(string propertyName, int value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n","file_path":"Realm.Shared/RealmObject.cs","rank":71,"score":101361.3308045598},{"content":" {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0L;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\n\n return hasValue ? (short)retVal : (short?) null;\n\n }\n\n\n\n protected int GetInt32Value(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n return (int) value;\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":72,"score":101361.11668623352},{"content":"\n\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableInt32Value(string propertyName, int? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n protected void SetInt64Value(string propertyName, long value)\n","file_path":"Realm.Shared/RealmObject.cs","rank":73,"score":101361.00818083288},{"content":" protected int? GetNullableInt32Value(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0L;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\n\n return hasValue ? (int)retVal : (int?) null;\n\n }\n\n\n\n protected long GetInt64Value(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n return NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":74,"score":101360.71590314338},{"content":"\n\n NativeTable.set_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, MarshalHelpers.BoolToIntPtr(value));\n\n }\n\n\n\n protected void SetNullableBooleanValue(string propertyName, bool? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, MarshalHelpers.BoolToIntPtr(value.Value));\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n protected void SetDateTimeOffsetValue(string propertyName, DateTimeOffset value)\n","file_path":"Realm.Shared/RealmObject.cs","rank":75,"score":101360.61044502202},{"content":" throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableCharValue(string propertyName, char? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n","file_path":"Realm.Shared/RealmObject.cs","rank":76,"score":101360.58484064469},{"content":" NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableInt64Value(string propertyName, long? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n protected void SetSingleValue(string propertyName, float value)\n\n {\n","file_path":"Realm.Shared/RealmObject.cs","rank":77,"score":101360.58011111806},{"content":" var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableInt16Value(string propertyName, short? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":78,"score":101360.56614339435},{"content":"\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableByteValue(string propertyName, byte? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n","file_path":"Realm.Shared/RealmObject.cs","rank":79,"score":101360.56614339435},{"content":"\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n\n NativeTable.set_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\n\n else\n\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n\n protected void SetBooleanValue(string propertyName, bool value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n","file_path":"Realm.Shared/RealmObject.cs","rank":80,"score":101360.51090369337},{"content":" Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0L;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\n\n return hasValue ? (byte)retVal : (byte?) null;\n\n }\n\n\n\n protected short GetInt16Value(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n return (short) value;\n\n }\n\n\n\n protected short? GetNullableInt16Value(string propertyName)\n","file_path":"Realm.Shared/RealmObject.cs","rank":81,"score":101360.09311728484},{"content":" protected double? GetNullableDoubleValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0.0d;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, ref retVal));\n\n return hasValue ? retVal : (double?) null;\n\n }\n\n\n\n protected bool GetBooleanValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n return MarshalHelpers.IntPtrToBool(NativeTable.get_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex));\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":82,"score":101360.00949157015},{"content":" Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetNullableSingleValue(string propertyName, float? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n if (value.HasValue)\n","file_path":"Realm.Shared/RealmObject.cs","rank":83,"score":101359.93887054872},{"content":" protected float? GetNullableSingleValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0.0f;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\n\n return hasValue ? retVal : (float?) null;\n\n }\n\n\n\n protected double GetDoubleValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n return NativeTable.get_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":84,"score":101359.91798696436},{"content":" }\n\n\n\n protected void SetByteValue(string propertyName, byte value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetByteValueUnique(string propertyName, byte value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n","file_path":"Realm.Shared/RealmObject.cs","rank":85,"score":101359.86890483489},{"content":"\n\n protected void SetInt16Value(string propertyName, short value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetInt16ValueUnique(string propertyName, short value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":86,"score":101359.86890483489},{"content":" protected long? GetNullableInt64Value(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0L;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\n\n return hasValue ? retVal : (long?) null;\n\n }\n\n\n\n protected float GetSingleValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n return NativeTable.get_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n }\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":87,"score":101359.8495901375},{"content":" {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\n\n }\n\n\n\n protected void SetInt64ValueUnique(string propertyName, long value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":88,"score":101359.73538611352},{"content":" protected bool? GetNullableBooleanValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = IntPtr.Zero;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, ref retVal));\n\n return hasValue ? MarshalHelpers.IntPtrToBool(retVal) : (bool?) null;\n\n }\n\n\n\n protected DateTimeOffset GetDateTimeOffsetValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var unixTimeMS = NativeTable.get_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n return DateTimeOffsetExtensions.FromRealmUnixTimeMilliseconds(unixTimeMS);\n\n }\n","file_path":"Realm.Shared/RealmObject.cs","rank":89,"score":101359.67804537655},{"content":" {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var marshalledValue = value.ToRealmUnixTimeMilliseconds();\n\n NativeTable.set_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, marshalledValue);\n\n }\n\n\n\n protected void SetNullableDateTimeOffsetValue(string propertyName, DateTimeOffset? value)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n if (!_realm.IsInTransaction)\n\n throw new RealmOutsideTransactionException(\"Cannot set values outside transaction\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n","file_path":"Realm.Shared/RealmObject.cs","rank":90,"score":101359.35770448783},{"content":" return \"\";\n\n }\n\n\n\n return Marshal.PtrToStringUni(_realm.stringGetBuffer, bytesRead);\n\n // leaving buffer sitting allocated for quick reuse next time we read a string \n\n } // GetStringValue\n\n\n\n protected char GetCharValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n return (char) value;\n\n }\n\n\n\n protected char? GetNullableCharValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n","file_path":"Realm.Shared/RealmObject.cs","rank":91,"score":101358.71085773301},{"content":"\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var retVal = 0L;\n\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\n\n return hasValue ? (char)retVal : (char?) null;\n\n }\n\n\n\n protected byte GetByteValue(string propertyName)\n\n {\n\n Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n\n\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\n\n return (byte) value;\n\n }\n\n\n\n protected byte? GetNullableByteValue(string propertyName)\n\n {\n","file_path":"Realm.Shared/RealmObject.cs","rank":92,"score":101358.18262332006},{"content":"/* Copyright 2015 Realm Inc - All Rights Reserved\n\n * Proprietary and Confidential\n\n */\n\n\n\nusing System;\n\nusing System.Collections;\n\nusing System.Collections.Generic;\n\nusing System.Diagnostics;\n\nusing System.Linq;\n\nusing System.Reflection;\n\nusing System.Runtime.InteropServices;\n\n\n\nnamespace Realms\n\n{\n\n /// <summary>\n\n /// Base for any object that can be persisted in a Realm.\n\n /// </summary>\n\n public class RealmObject\n\n {\n\n private Realm _realm;\n","file_path":"Realm.Shared/RealmObject.cs","rank":93,"score":101357.10345309741},{"content":" Debug.Assert(_realm != null, \"Object is not managed, but managed access was attempted\");\n\n\n\n var rowIndex = _rowHandle.RowIndex;\n\n var badUTF8msg = $\"Corrupted string UTF8 in {propertyName}\";\n\n\n\n int bufferSizeNeededChars = 128;\n\n // First alloc this thread\n\n if (_realm.stringGetBuffer==IntPtr.Zero) { // first get of a string in this Realm\n\n _realm.stringGetBuffer = Marshal.AllocHGlobal((IntPtr)(bufferSizeNeededChars * sizeof(char)));\n\n _realm.stringGetBufferLen = bufferSizeNeededChars;\n\n } \n\n\n\n bool isNull = false;\n\n\n\n // try to read\n\n int bytesRead = (int)NativeTable.get_string(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, _realm.stringGetBuffer,\n\n (IntPtr)_realm.stringGetBufferLen, out isNull);\n\n if (bytesRead == -1)\n\n {\n\n // bad UTF-8 data unable to transcode, vastly unlikely error but could be corrupt file\n","file_path":"Realm.Shared/RealmObject.cs","rank":94,"score":101354.14666705804},{"content":" throw new RealmInvalidDatabaseException(badUTF8msg);\n\n }\n\n if (bytesRead > _realm.stringGetBufferLen) // need a bigger buffer\n\n {\n\n Marshal.FreeHGlobal(_realm.stringGetBuffer);\n\n _realm.stringGetBuffer = Marshal.AllocHGlobal((IntPtr)(bytesRead * sizeof(char)));\n\n _realm.stringGetBufferLen = bytesRead;\n\n // try to read with big buffer\n\n bytesRead = (int)NativeTable.get_string(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, _realm.stringGetBuffer,\n\n (IntPtr)_realm.stringGetBufferLen, out isNull);\n\n if (bytesRead == -1) // bad UTF-8 in full string\n\n throw new RealmInvalidDatabaseException(badUTF8msg);\n\n Debug.Assert(bytesRead <= _realm.stringGetBufferLen);\n\n } // needed re-read with expanded buffer\n\n\n\n if (bytesRead == 0)\n\n {\n\n if (isNull)\n\n return null;\n\n \n","file_path":"Realm.Shared/RealmObject.cs","rank":95,"score":101350.9753351533},{"content":"\n\n // Optimization for a common success case. \n\n if (ReferenceEquals(this, obj))\n\n {\n\n return true;\n\n }\n\n\n\n // If run-time types are not exactly the same, return false. \n\n if (this.GetType() != obj.GetType())\n\n return false;\n\n\n\n // Return true if the fields match. \n\n // Note that the base class is not invoked because it is \n\n // System.Object, which defines Equals as reference equality. \n\n return RowHandle.Equals(((RealmObject)obj).RowHandle);\n\n }\n\n\n\n }\n\n}\n","file_path":"Realm.Shared/RealmObject.cs","rank":96,"score":101350.78311926237},{"content":" internal TableHandle Table;\n\n\n\n internal Weaving.IRealmObjectHelper Helper;\n\n\n\n internal Dictionary<string, IntPtr> ColumnIndices;\n\n }\n\n\n\n internal void _CopyDataFromBackingFieldsToRow()\n\n {\n\n Debug.Assert(this.IsManaged);\n\n\n\n var thisType = this.GetType();\n\n var wovenProperties = from prop in thisType.GetProperties()\n\n let backingField = prop.GetCustomAttributes(false)\n\n .OfType<WovenPropertyAttribute>()\n\n .Select(a => a.BackingFieldName)\n\n .SingleOrDefault()\n\n where backingField != null\n\n select new { Info = prop, Field = thisType.GetField(backingField, BindingFlags.Instance | BindingFlags.NonPublic) };\n\n\n","file_path":"Realm.Shared/RealmObject.cs","rank":97,"score":101350.48212690349},{"content":" var ret = _realm.Metadata[objectType].Helper.CreateInstance();\n\n var relatedHandle = Realm.CreateRowHandle (rowPtr, _realm.SharedRealmHandle);\n\n ret._Manage(_realm, relatedHandle);\n\n return ret;\n\n }\n\n\n\n\n\n /// <summary>\n\n /// Compare objects with identity query for persistent objects.\n\n /// </summary>\n\n /// <remarks>Persisted RealmObjects map their properties directly to the realm with no caching so multiple instances of a given object always refer to the same store.</remarks>\n\n /// <param name=\"obj\"></param>\n\n /// <returns>True when objects are the same memory object or refer to the same persisted object.</returns>\n\n public override bool Equals(object obj)\n\n {\n\n // If parameter is null, return false. \n\n if (ReferenceEquals(obj, null))\n\n {\n\n return false;\n\n }\n","file_path":"Realm.Shared/RealmObject.cs","rank":98,"score":101349.13548432136},{"content":" foreach (var prop in wovenProperties)\n\n {\n\n var value = prop.Field.GetValue(this);\n\n if (prop.Info.PropertyType.IsGenericType)\n\n {\n\n var genericType = prop.Info.PropertyType.GetGenericTypeDefinition();\n\n if (genericType == typeof(RealmList<>))\n\n {\n\n continue;\n\n }\n\n }\n\n\n\n prop.Info.SetValue(this, value, null);\n\n }\n\n }\n\n\n\n\n\n #region Getters\n\n protected string GetStringValue(string propertyName)\n\n {\n","file_path":"Realm.Shared/RealmObject.cs","rank":99,"score":101345.80220394004}],"string":"[\n {\n \"content\": \"struct ValueGetter<Int, TableGetter> {\\n\\n static Int convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type == parser::Expression::Type::Argument) {\\n\\n return args.long_for_argument(stot<int>(value.s));\\n\\n }\\n\\n return stot<long long>(value.s);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename TableGetter>\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 0,\n \"score\": 171603.5841718181\n },\n {\n \"content\": \"class Results;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 1,\n \"score\": 166494.91037915432\n },\n {\n \"content\": \"struct TestFile : realm::Realm::Config {\\n\\n TestFile();\\n\\n ~TestFile();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/tests/util/test_file.hpp\",\n \"rank\": 2,\n \"score\": 159108.45091983024\n },\n {\n \"content\": \"struct AsyncQueryCancelationToken;\\n\\n\\n\\nnamespace _impl {\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 3,\n \"score\": 155139.7666355736\n },\n {\n \"content\": \"struct true_value : pegtl_istring_t(\\\"true\\\") {};\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/parser.cpp\",\n \"rank\": 4,\n \"score\": 147700.97269541209\n },\n {\n \"content\": \"// RealmCoordinator manages the weak cache of Realm instances and communication\\n\\n// between per-thread Realm instances for a given file\\n\\nclass RealmCoordinator : public std::enable_shared_from_this<RealmCoordinator> {\\n\\npublic:\\n\\n // Get the coordinator for the given path, creating it if neccesary\\n\\n static std::shared_ptr<RealmCoordinator> get_coordinator(StringData path);\\n\\n // Get the coordinator for the given path, or null if there is none\\n\\n static std::shared_ptr<RealmCoordinator> get_existing_coordinator(StringData path);\\n\\n\\n\\n // Get a thread-local shared Realm with the given configuration\\n\\n // If the Realm is already open on another thread, validates that the given\\n\\n // configuration is compatible with the existing one\\n\\n std::shared_ptr<Realm> get_realm(Realm::Config config);\\n\\n std::shared_ptr<Realm> get_realm();\\n\\n\\n\\n const Schema* get_schema() const noexcept;\\n\\n uint64_t get_schema_version() const noexcept { return m_config.schema_version; }\\n\\n const std::string& get_path() const noexcept { return m_config.path; }\\n\\n const std::vector<char>& get_encryption_key() const noexcept { return m_config.encryption_key; }\\n\\n bool is_in_memory() const noexcept { return m_config.in_memory; }\\n\\n\\n\\n // Asynchronously call notify() on every Realm instance for this coordinator's\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 5,\n \"score\": 142543.49181552642\n },\n {\n \"content\": \" class RealmCoordinator;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/shared_realm.hpp\",\n \"rank\": 6,\n \"score\": 134338.9082635727\n },\n {\n \"content\": \"// FIXME: TrueExpression and FalseExpression should be supported by core in some way\\n\\nstruct TrueExpression : realm::Expression {\\n\\n size_t find_first(size_t start, size_t end) const override\\n\\n {\\n\\n if (start != end)\\n\\n return start;\\n\\n\\n\\n return realm::not_found;\\n\\n }\\n\\n void set_base_table(const Table*) override {}\\n\\n const Table* get_base_table() const override { return nullptr; }\\n\\n std::unique_ptr<Expression> clone(QueryNodeHandoverPatches*) const override\\n\\n {\\n\\n return std::unique_ptr<Expression>(new TrueExpression(*this));\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 7,\n \"score\": 130488.83623084967\n },\n {\n \"content\": \"class WeakRealmNotifier;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 8,\n \"score\": 128773.28248804285\n },\n {\n \"content\": \" // path, including those in other processes\\n\\n void send_commit_notifications();\\n\\n\\n\\n // Clear the weak Realm cache for all paths\\n\\n // Should only be called in test code, as continuing to use the previously\\n\\n // cached instances will have odd results\\n\\n static void clear_cache();\\n\\n\\n\\n // Clears all caches on existing coordinators\\n\\n static void clear_all_caches();\\n\\n\\n\\n // Explicit constructor/destructor needed for the unique_ptrs to forward-declared types\\n\\n RealmCoordinator();\\n\\n ~RealmCoordinator();\\n\\n\\n\\n // Called by Realm's destructor to ensure the cache is cleaned up promptly\\n\\n // Do not call directly\\n\\n void unregister_realm(Realm* realm);\\n\\n\\n\\n // Called by m_notifier when there's a new commit to send notifications for\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 9,\n \"score\": 126599.42023404858\n },\n {\n \"content\": \"#include \\\"impl/async_query.hpp\\\"\\n\\n#include \\\"impl/weak_realm_notifier.hpp\\\"\\n\\n#include \\\"impl/external_commit_helper.hpp\\\"\\n\\n#include \\\"impl/transact_log_handler.hpp\\\"\\n\\n#include \\\"object_store.hpp\\\"\\n\\n#include \\\"schema.hpp\\\"\\n\\n\\n\\n#include <realm/commit_log.hpp>\\n\\n#include <realm/group_shared.hpp>\\n\\n#include <realm/lang_bind_helper.hpp>\\n\\n#include <realm/query.hpp>\\n\\n#include <realm/table_view.hpp>\\n\\n\\n\\n#include <cassert>\\n\\n#include <unordered_map>\\n\\n\\n\\nusing namespace realm;\\n\\nusing namespace realm::_impl;\\n\\n\\n\\nstatic std::mutex s_coordinator_mutex;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 10,\n \"score\": 126596.92501506646\n },\n {\n \"content\": \" coordinator->clear_cache();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::send_commit_notifications()\\n\\n{\\n\\n REALM_ASSERT(!m_config.read_only);\\n\\n if (m_notifier) {\\n\\n m_notifier->notify_others();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::pin_version(uint_fast64_t version, uint_fast32_t index)\\n\\n{\\n\\n if (m_async_error) {\\n\\n return;\\n\\n }\\n\\n\\n\\n SharedGroup::VersionID versionid(version, index);\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 11,\n \"score\": 126592.17076040943\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Copyright 2015 Realm Inc.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#ifndef REALM_COORDINATOR_HPP\\n\\n#define REALM_COORDINATOR_HPP\\n\\n\\n\\n#include \\\"shared_realm.hpp\\\"\\n\\n\\n\\n#include <realm/string_data.hpp>\\n\\n#include <mutex>\\n\\n\\n\\nnamespace realm {\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 12,\n \"score\": 126590.43438180596\n },\n {\n \"content\": \"\\n\\n auto realm = std::make_shared<Realm>(std::move(config));\\n\\n realm->init(shared_from_this());\\n\\n m_weak_realm_notifiers.emplace_back(realm, m_config.cache);\\n\\n return realm;\\n\\n}\\n\\n\\n\\nstd::shared_ptr<Realm> RealmCoordinator::get_realm()\\n\\n{\\n\\n return get_realm(m_config);\\n\\n}\\n\\n\\n\\nconst Schema* RealmCoordinator::get_schema() const noexcept\\n\\n{\\n\\n return m_weak_realm_notifiers.empty() ? nullptr : m_config.schema.get();\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::update_schema(Schema const& schema)\\n\\n{\\n\\n // FIXME: this should probably be doing some sort of validation and\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 13,\n \"score\": 126589.55347675926\n },\n {\n \"content\": \" // then updated m_config with any tables present in config but not in\\n\\n // it\\n\\n // Public API currently doesn't make it possible to have non-matching\\n\\n // schemata so it's not a huge issue\\n\\n if ((false) && m_config.schema != config.schema) {\\n\\n throw MismatchedConfigException(\\\"Realm at path already opened with different schema\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n if (config.cache) {\\n\\n for (auto& cachedRealm : m_weak_realm_notifiers) {\\n\\n if (cachedRealm.is_cached_for_current_thread()) {\\n\\n // can be null if we jumped in between ref count hitting zero and\\n\\n // unregister_realm() getting the lock\\n\\n if (auto realm = cachedRealm.realm()) {\\n\\n return realm;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 14,\n \"score\": 126588.97521873185\n },\n {\n \"content\": \" // notifying all Realm instances of the new schema in some way\\n\\n m_config.schema = std::make_unique<Schema>(schema);\\n\\n}\\n\\n\\n\\nRealmCoordinator::RealmCoordinator() = default;\\n\\n\\n\\nRealmCoordinator::~RealmCoordinator()\\n\\n{\\n\\n std::lock_guard<std::mutex> coordinator_lock(s_coordinator_mutex);\\n\\n for (auto it = s_coordinators_per_path.begin(); it != s_coordinators_per_path.end(); ) {\\n\\n if (it->second.expired()) {\\n\\n it = s_coordinators_per_path.erase(it);\\n\\n }\\n\\n else {\\n\\n ++it;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::unregister_realm(Realm* realm)\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 15,\n \"score\": 126588.67301881687\n },\n {\n \"content\": \" return it == s_coordinators_per_path.end() ? nullptr : it->second.lock();\\n\\n}\\n\\n\\n\\nstd::shared_ptr<Realm> RealmCoordinator::get_realm(Realm::Config config)\\n\\n{\\n\\n std::lock_guard<std::mutex> lock(m_realm_mutex);\\n\\n if ((!m_config.read_only && !m_notifier) || (m_config.read_only && m_weak_realm_notifiers.empty())) {\\n\\n m_config = config;\\n\\n if (!config.read_only && !m_notifier && config.automatic_change_notifications) {\\n\\n try {\\n\\n m_notifier = std::make_unique<ExternalCommitHelper>(*this);\\n\\n }\\n\\n catch (std::system_error const& ex) {\\n\\n throw RealmFileException(RealmFileException::Kind::AccessError, config.path, ex.code().message());\\n\\n }\\n\\n }\\n\\n }\\n\\n else {\\n\\n if (m_config.read_only != config.read_only) {\\n\\n throw MismatchedConfigException(\\\"Realm at path already opened with different read permissions.\\\");\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 16,\n \"score\": 126588.37555488684\n },\n {\n \"content\": \" }\\n\\n\\n\\n for (auto& query : queries) {\\n\\n query->call_callbacks();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::process_available_async(Realm& realm)\\n\\n{\\n\\n auto& sg = Realm::Internal::get_shared_group(realm);\\n\\n decltype(m_queries) queries;\\n\\n {\\n\\n std::lock_guard<std::mutex> lock(m_query_mutex);\\n\\n for (auto& query : m_queries) {\\n\\n if (query->deliver(sg, m_async_error)) {\\n\\n queries.push_back(query);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n for (auto& query : queries) {\\n\\n query->call_callbacks();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 17,\n \"score\": 126587.4504532688\n },\n {\n \"content\": \"\\n\\n for (auto& weak_coordinator : s_coordinators_per_path) {\\n\\n auto coordinator = weak_coordinator.second.lock();\\n\\n if (!coordinator) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n coordinator->m_notifier = nullptr;\\n\\n\\n\\n // Gather a list of all of the realms which will be removed\\n\\n for (auto& weak_realm_notifier : coordinator->m_weak_realm_notifiers) {\\n\\n if (auto realm = weak_realm_notifier.realm()) {\\n\\n realms_to_close.push_back(realm);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n s_coordinators_per_path.clear();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 18,\n \"score\": 126586.9683499873\n },\n {\n \"content\": \" // Close all of the previously cached Realms. This can't be done while\\n\\n // s_coordinator_mutex is held as it may try to re-lock it.\\n\\n for (auto& weak_realm : realms_to_close) {\\n\\n if (auto realm = weak_realm.lock()) {\\n\\n realm->close();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::clear_all_caches()\\n\\n{\\n\\n std::vector<std::weak_ptr<RealmCoordinator>> to_clear;\\n\\n {\\n\\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\\n\\n for (auto iter : s_coordinators_per_path) {\\n\\n to_clear.push_back(iter.second);\\n\\n }\\n\\n }\\n\\n for (auto weak_coordinator : to_clear) {\\n\\n if (auto coordinator = weak_coordinator.lock()) {\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 19,\n \"score\": 126586.59921166494\n },\n {\n \"content\": \"static std::unordered_map<std::string, std::weak_ptr<RealmCoordinator>> s_coordinators_per_path;\\n\\n\\n\\nstd::shared_ptr<RealmCoordinator> RealmCoordinator::get_coordinator(StringData path)\\n\\n{\\n\\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\\n\\n\\n\\n auto& weak_coordinator = s_coordinators_per_path[path];\\n\\n if (auto coordinator = weak_coordinator.lock()) {\\n\\n return coordinator;\\n\\n }\\n\\n\\n\\n auto coordinator = std::make_shared<RealmCoordinator>();\\n\\n weak_coordinator = coordinator;\\n\\n return coordinator;\\n\\n}\\n\\n\\n\\nstd::shared_ptr<RealmCoordinator> RealmCoordinator::get_existing_coordinator(StringData path)\\n\\n{\\n\\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\\n\\n auto it = s_coordinators_per_path.find(path);\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 20,\n \"score\": 126586.06926895019\n },\n {\n \"content\": \" }\\n\\n if (m_config.in_memory != config.in_memory) {\\n\\n throw MismatchedConfigException(\\\"Realm at path already opened with different inMemory settings.\\\");\\n\\n }\\n\\n if (m_config.encryption_key != config.encryption_key) {\\n\\n std::stringstream msg;\\n\\n msg << \\\"Realm at path \\\" << config.path << \\\" already opened with a different encryption key.\\\" << std::hex;\\n\\n for (char c : m_config.encryption_key)\\n\\n msg << c << ' ';\\n\\n msg << \\\"\\\\n---\\\\n\\\";\\n\\n for (char c : config.encryption_key)\\n\\n msg << c << ' ';\\n\\n throw MismatchedConfigException(msg.str());\\n\\n// throw MismatchedConfigException(\\\"Realm at path already opened with a different encryption key.\\\");\\n\\n }\\n\\n if (m_config.schema_version != config.schema_version && config.schema_version != ObjectStore::NotVersioned) {\\n\\n throw MismatchedConfigException(\\\"Realm at path already opened with different schema version.\\\");\\n\\n }\\n\\n // FIXME: verify that schema is compatible\\n\\n // Needs to verify that all tables present in both are identical, and\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 21,\n \"score\": 126585.6624025909\n },\n {\n \"content\": \" m_advancer_sg->end_read();\\n\\n m_advancer_sg->begin_read(versionid);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::register_query(std::shared_ptr<AsyncQuery> query)\\n\\n{\\n\\n auto version = query->version();\\n\\n auto& self = Realm::Internal::get_coordinator(query->get_realm());\\n\\n {\\n\\n std::lock_guard<std::mutex> lock(self.m_query_mutex);\\n\\n self.pin_version(version.version, version.index);\\n\\n self.m_new_queries.push_back(std::move(query));\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::clean_up_dead_queries()\\n\\n{\\n\\n auto swap_remove = [&](auto& container) {\\n\\n bool did_remove = false;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 22,\n \"score\": 126584.44167442931\n },\n {\n \"content\": \"\\n\\n move_new_queries_to_main();\\n\\n m_advancer_sg->end_read();\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::advance_to_ready(Realm& realm)\\n\\n{\\n\\n decltype(m_queries) queries;\\n\\n\\n\\n auto& sg = Realm::Internal::get_shared_group(realm);\\n\\n\\n\\n auto get_query_version = [&] {\\n\\n for (auto& query : m_queries) {\\n\\n auto version = query->version();\\n\\n if (version != SharedGroup::VersionID{}) {\\n\\n return version;\\n\\n }\\n\\n }\\n\\n return SharedGroup::VersionID{};\\n\\n };\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 23,\n \"score\": 126583.76173555509\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Copyright 2015 Realm Inc.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#include \\\"impl/realm_coordinator.hpp\\\"\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 24,\n \"score\": 126583.5665108331\n },\n {\n \"content\": \" void open_helper_shared_group();\\n\\n void move_new_queries_to_main();\\n\\n void advance_helper_shared_group_to_latest();\\n\\n void clean_up_dead_queries();\\n\\n};\\n\\n\\n\\n} // namespace _impl\\n\\n} // namespace realm\\n\\n\\n\\n#endif /* REALM_COORDINATOR_HPP */\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 25,\n \"score\": 126583.18646239185\n },\n {\n \"content\": \"{\\n\\n std::lock_guard<std::mutex> lock(m_realm_mutex);\\n\\n for (size_t i = 0; i < m_weak_realm_notifiers.size(); ++i) {\\n\\n auto& weak_realm_notifier = m_weak_realm_notifiers[i];\\n\\n if (!weak_realm_notifier.expired() && !weak_realm_notifier.is_for_realm(realm)) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n if (i + 1 < m_weak_realm_notifiers.size()) {\\n\\n weak_realm_notifier = std::move(m_weak_realm_notifiers.back());\\n\\n }\\n\\n m_weak_realm_notifiers.pop_back();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::clear_cache()\\n\\n{\\n\\n std::vector<WeakRealm> realms_to_close;\\n\\n {\\n\\n std::lock_guard<std::mutex> lock(s_coordinator_mutex);\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 26,\n \"score\": 126582.42662212723\n },\n {\n \"content\": \"\\n\\n clean_up_dead_queries();\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::open_helper_shared_group()\\n\\n{\\n\\n if (!m_query_sg) {\\n\\n try {\\n\\n std::unique_ptr<Group> read_only_group;\\n\\n Realm::open_with_config(m_config, m_query_history, m_query_sg, read_only_group);\\n\\n REALM_ASSERT(!read_only_group);\\n\\n m_query_sg->begin_read();\\n\\n }\\n\\n catch (...) {\\n\\n // Store the error to be passed to the async queries\\n\\n m_async_error = std::current_exception();\\n\\n m_query_sg = nullptr;\\n\\n m_query_history = nullptr;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 27,\n \"score\": 126581.86635893796\n },\n {\n \"content\": \" // may end up calling user code (in did_change() notifications)\\n\\n transaction::advance(sg, realm.m_binding_context.get(), version);\\n\\n\\n\\n // Reacquire the lock and recheck the query version, as the queries may\\n\\n // have advanced to a later version while we didn't hold the lock. If\\n\\n // so, we need to release the lock and re-advance\\n\\n std::lock_guard<std::mutex> lock(m_query_mutex);\\n\\n version = get_query_version();\\n\\n if (version.version == std::numeric_limits<uint_fast64_t>::max())\\n\\n return;\\n\\n if (version != sg.get_version_of_current_transaction())\\n\\n continue;\\n\\n\\n\\n // Query version now matches the SG version, so we can deliver them\\n\\n for (auto& query : m_queries) {\\n\\n if (query->deliver(sg, m_async_error)) {\\n\\n queries.push_back(query);\\n\\n }\\n\\n }\\n\\n break;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 28,\n \"score\": 126581.77992776605\n },\n {\n \"content\": \" // groups is expensive\\n\\n if (m_queries.empty() && m_query_sg) {\\n\\n m_query_sg->end_read();\\n\\n }\\n\\n }\\n\\n if (swap_remove(m_new_queries)) {\\n\\n if (m_new_queries.empty() && m_advancer_sg) {\\n\\n m_advancer_sg->end_read();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::on_change()\\n\\n{\\n\\n run_async_queries();\\n\\n\\n\\n std::lock_guard<std::mutex> lock(m_realm_mutex);\\n\\n for (auto& realm : m_weak_realm_notifiers) {\\n\\n realm.notify();\\n\\n }\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 29,\n \"score\": 126581.77883793744\n },\n {\n \"content\": \" void on_change();\\n\\n\\n\\n // Update the schema in the cached config\\n\\n void update_schema(Schema const& new_schema);\\n\\n\\n\\n static void register_query(std::shared_ptr<AsyncQuery> query);\\n\\n\\n\\n // Advance the Realm to the most recent transaction version which all async\\n\\n // work is complete for\\n\\n void advance_to_ready(Realm& realm);\\n\\n void process_available_async(Realm& realm);\\n\\n\\n\\nprivate:\\n\\n Realm::Config m_config;\\n\\n\\n\\n std::mutex m_realm_mutex;\\n\\n std::vector<WeakRealmNotifier> m_weak_realm_notifiers;\\n\\n\\n\\n std::mutex m_query_mutex;\\n\\n std::vector<std::shared_ptr<_impl::AsyncQuery>> m_new_queries;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 30,\n \"score\": 126579.13485281267\n },\n {\n \"content\": \"\\n\\n SharedGroup::VersionID version;\\n\\n {\\n\\n std::lock_guard<std::mutex> lock(m_query_mutex);\\n\\n version = get_query_version();\\n\\n }\\n\\n\\n\\n // no async queries; just advance to latest\\n\\n if (version.version == std::numeric_limits<uint_fast64_t>::max()) {\\n\\n transaction::advance(sg, realm.m_binding_context.get());\\n\\n return;\\n\\n }\\n\\n\\n\\n // async results are out of date; ignore\\n\\n if (version < sg.get_version_of_current_transaction()) {\\n\\n return;\\n\\n }\\n\\n\\n\\n while (true) {\\n\\n // Advance to the ready version without holding any locks because it\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 31,\n \"score\": 126578.69076864712\n },\n {\n \"content\": \" else if (m_queries.empty()) {\\n\\n m_query_sg->begin_read();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::move_new_queries_to_main()\\n\\n{\\n\\n m_queries.reserve(m_queries.size() + m_new_queries.size());\\n\\n std::move(m_new_queries.begin(), m_new_queries.end(), std::back_inserter(m_queries));\\n\\n m_new_queries.clear();\\n\\n}\\n\\n\\n\\nvoid RealmCoordinator::advance_helper_shared_group_to_latest()\\n\\n{\\n\\n if (m_new_queries.empty()) {\\n\\n LangBindHelper::advance_read(*m_query_sg);\\n\\n return;\\n\\n }\\n\\n\\n\\n // Sort newly added queries by their source version so that we can pull them\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 32,\n \"score\": 126577.06457230657\n },\n {\n \"content\": \" if (!m_advancer_sg) {\\n\\n try {\\n\\n std::unique_ptr<Group> read_only_group;\\n\\n Realm::open_with_config(m_config, m_advancer_history, m_advancer_sg, read_only_group);\\n\\n REALM_ASSERT(!read_only_group);\\n\\n m_advancer_sg->begin_read(versionid);\\n\\n }\\n\\n catch (...) {\\n\\n m_async_error = std::current_exception();\\n\\n m_advancer_sg = nullptr;\\n\\n m_advancer_history = nullptr;\\n\\n }\\n\\n }\\n\\n else if (m_new_queries.empty()) {\\n\\n // If this is the first query then we don't already have a read transaction\\n\\n m_advancer_sg->begin_read(versionid);\\n\\n }\\n\\n else if (versionid < m_advancer_sg->get_version_of_current_transaction()) {\\n\\n // Ensure we're holding a readlock on the oldest version we have a\\n\\n // handover object for, as handover objects don't\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 33,\n \"score\": 126576.80744404714\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid RealmCoordinator::run_async_queries()\\n\\n{\\n\\n std::unique_lock<std::mutex> lock(m_query_mutex);\\n\\n\\n\\n clean_up_dead_queries();\\n\\n\\n\\n if (m_queries.empty() && m_new_queries.empty()) {\\n\\n return;\\n\\n }\\n\\n\\n\\n if (!m_async_error) {\\n\\n open_helper_shared_group();\\n\\n }\\n\\n\\n\\n if (m_async_error) {\\n\\n move_new_queries_to_main();\\n\\n return;\\n\\n }\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 34,\n \"score\": 126575.94475168914\n },\n {\n \"content\": \"\\n\\n advance_helper_shared_group_to_latest();\\n\\n\\n\\n // Make a copy of the queries vector so that we can release the lock while\\n\\n // we run the queries\\n\\n auto queries_to_run = m_queries;\\n\\n lock.unlock();\\n\\n\\n\\n for (auto& query : queries_to_run) {\\n\\n query->run();\\n\\n }\\n\\n\\n\\n // Reacquire the lock while updating the fields that are actually read on\\n\\n // other threads\\n\\n {\\n\\n lock.lock();\\n\\n for (auto& query : queries_to_run) {\\n\\n query->prepare_handover();\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 35,\n \"score\": 126573.3825575404\n },\n {\n \"content\": \" // all forward to the latest version in a single pass over the transaction log\\n\\n std::sort(m_new_queries.begin(), m_new_queries.end(), [](auto const& lft, auto const& rgt) {\\n\\n return lft->version() < rgt->version();\\n\\n });\\n\\n\\n\\n // Import all newly added queries to our helper SG\\n\\n for (auto& query : m_new_queries) {\\n\\n LangBindHelper::advance_read(*m_advancer_sg, query->version());\\n\\n query->attach_to(*m_advancer_sg);\\n\\n }\\n\\n\\n\\n // Advance both SGs to the newest version\\n\\n LangBindHelper::advance_read(*m_advancer_sg);\\n\\n LangBindHelper::advance_read(*m_query_sg, m_advancer_sg->get_version_of_current_transaction());\\n\\n\\n\\n // Transfer all new queries over to the main SG\\n\\n for (auto& query : m_new_queries) {\\n\\n query->detatch();\\n\\n query->attach_to(*m_query_sg);\\n\\n }\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 36,\n \"score\": 126573.09025340127\n },\n {\n \"content\": \" std::vector<std::shared_ptr<_impl::AsyncQuery>> m_queries;\\n\\n\\n\\n // SharedGroup used for actually running async queries\\n\\n // Will have a read transaction iff m_queries is non-empty\\n\\n std::unique_ptr<Replication> m_query_history;\\n\\n std::unique_ptr<SharedGroup> m_query_sg;\\n\\n\\n\\n // SharedGroup used to advance queries in m_new_queries to the main shared\\n\\n // group's transaction version\\n\\n // Will have a read transaction iff m_new_queries is non-empty\\n\\n std::unique_ptr<Replication> m_advancer_history;\\n\\n std::unique_ptr<SharedGroup> m_advancer_sg;\\n\\n std::exception_ptr m_async_error;\\n\\n\\n\\n std::unique_ptr<_impl::ExternalCommitHelper> m_notifier;\\n\\n\\n\\n // must be called with m_query_mutex locked\\n\\n void pin_version(uint_fast64_t version, uint_fast32_t index);\\n\\n\\n\\n void run_async_queries();\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 37,\n \"score\": 126571.6167292231\n },\n {\n \"content\": \" for (size_t i = 0; i < container.size(); ++i) {\\n\\n if (container[i]->is_alive())\\n\\n continue;\\n\\n\\n\\n // Ensure the query is destroyed here even if there's lingering refs\\n\\n // to the async query elsewhere\\n\\n container[i]->release_query();\\n\\n\\n\\n if (container.size() > i + 1)\\n\\n container[i] = std::move(container.back());\\n\\n container.pop_back();\\n\\n --i;\\n\\n did_remove = true;\\n\\n }\\n\\n return did_remove;\\n\\n };\\n\\n\\n\\n if (swap_remove(m_queries)) {\\n\\n // Make sure we aren't holding on to read versions needlessly if there\\n\\n // are no queries left, but don't close them entirely as opening shared\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.cpp\",\n \"rank\": 38,\n \"score\": 126571.45893748602\n },\n {\n \"content\": \"// A token which keeps an asynchronous query alive\\n\\nstruct AsyncQueryCancelationToken {\\n\\n AsyncQueryCancelationToken() = default;\\n\\n AsyncQueryCancelationToken(std::shared_ptr<_impl::AsyncQuery> query, size_t token);\\n\\n ~AsyncQueryCancelationToken();\\n\\n\\n\\n AsyncQueryCancelationToken(AsyncQueryCancelationToken&&);\\n\\n AsyncQueryCancelationToken& operator=(AsyncQueryCancelationToken&&);\\n\\n\\n\\n AsyncQueryCancelationToken(AsyncQueryCancelationToken const&) = delete;\\n\\n AsyncQueryCancelationToken& operator=(AsyncQueryCancelationToken const&) = delete;\\n\\n\\n\\nprivate:\\n\\n util::AtomicSharedPtr<_impl::AsyncQuery> m_query;\\n\\n size_t m_token;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/results.hpp\",\n \"rank\": 39,\n \"score\": 124944.57382635515\n },\n {\n \"content\": \"class Schema;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 40,\n \"score\": 123411.35808220456\n },\n {\n \"content\": \"class Replication;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 41,\n \"score\": 123411.35808220456\n },\n {\n \"content\": \"class SharedGroup;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 42,\n \"score\": 120408.87735105006\n },\n {\n \"content\": \"class AsyncQuery;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 43,\n \"score\": 120408.87735105006\n },\n {\n \"content\": \"class AsyncQueryCallback;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 44,\n \"score\": 117549.02167780974\n },\n {\n \"content\": \"class ExternalCommitHelper;\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/realm_coordinator.hpp\",\n \"rank\": 45,\n \"score\": 117549.02167780974\n },\n {\n \"content\": \" class Realm;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/shared_realm.hpp\",\n \"rank\": 46,\n \"score\": 116605.73899319385\n },\n {\n \"content\": \"struct ValueGetter<Float, TableGetter> {\\n\\n static Float convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type == parser::Expression::Type::Argument) {\\n\\n return args.float_for_argument(stot<int>(value.s));\\n\\n }\\n\\n return stot<float>(value.s);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename TableGetter>\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 47,\n \"score\": 116575.41835758643\n },\n {\n \"content\": \"struct ValueGetter<bool, TableGetter> {\\n\\n static bool convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type == parser::Expression::Type::Argument) {\\n\\n return args.bool_for_argument(stot<int>(value.s));\\n\\n }\\n\\n if (value.type != parser::Expression::Type::True && value.type != parser::Expression::Type::False) {\\n\\n throw std::runtime_error(\\\"Attempting to compare bool property to a non-bool value\\\");\\n\\n }\\n\\n return value.type == parser::Expression::Type::True;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename TableGetter>\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 48,\n \"score\": 116575.41835758643\n },\n {\n \"content\": \"struct ValueGetter<Binary, TableGetter> {\\n\\n static std::string convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type == parser::Expression::Type::Argument) {\\n\\n return args.binary_for_argument(stot<int>(value.s));\\n\\n }\\n\\n throw std::runtime_error(\\\"Binary properties must be compared against a binary argument.\\\");\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename RetType, typename Value, typename TableGetter>\\n\\nauto value_of_type_for_query(TableGetter&& tables, Value&& value, Arguments &args)\\n\\n{\\n\\n const bool isColumn = std::is_same<PropertyExpression, typename std::remove_reference<Value>::type>::value;\\n\\n using helper = std::conditional_t<isColumn, ColumnGetter<RetType, TableGetter>, ValueGetter<RetType, TableGetter>>;\\n\\n return helper::convert(tables, value, args);\\n\\n}\\n\\n\\n\\ntemplate <typename A, typename B>\\n\\nvoid do_add_comparison_to_query(Query &query, const Schema &schema, const ObjectSchema &object_schema, Predicate::Comparison cmp,\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 49,\n \"score\": 116575.41835758643\n },\n {\n \"content\": \"struct ValueGetter<Double, TableGetter> {\\n\\n static Double convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type == parser::Expression::Type::Argument) {\\n\\n return args.double_for_argument(stot<int>(value.s));\\n\\n }\\n\\n return stot<double>(value.s);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename TableGetter>\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 50,\n \"score\": 116575.41835758643\n },\n {\n \"content\": \"struct ValueGetter<Timestamp, TableGetter> {\\n\\n static Timestamp convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type != parser::Expression::Type::Argument) {\\n\\n throw std::runtime_error(\\\"You must pass in a date argument to compare\\\");\\n\\n }\\n\\n return args.timestamp_for_argument(stot<int>(value.s));\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename TableGetter>\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 51,\n \"score\": 116575.41835758643\n },\n {\n \"content\": \"struct ValueGetter<String, TableGetter> {\\n\\n static std::string convert(TableGetter&&, const parser::Expression & value, Arguments &args)\\n\\n {\\n\\n if (value.type == parser::Expression::Type::Argument) {\\n\\n return args.string_for_argument(stot<int>(value.s));\\n\\n }\\n\\n if (value.type != parser::Expression::Type::String) {\\n\\n throw std::runtime_error(\\\"Attempting to compare String property to a non-String value\\\");\\n\\n }\\n\\n return value.s;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename TableGetter>\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/query_builder.cpp\",\n \"rank\": 52,\n \"score\": 116575.41835758643\n },\n {\n \"content\": \"class RealmCoordinator;\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/apple/external_commit_helper.hpp\",\n \"rank\": 53,\n \"score\": 114821.86428532735\n },\n {\n \"content\": \"class RealmCoordinator;\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/android/external_commit_helper.hpp\",\n \"rank\": 54,\n \"score\": 114821.86428532735\n },\n {\n \"content\": \"class RealmCoordinator;\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/generic/external_commit_helper.hpp\",\n \"rank\": 55,\n \"score\": 114821.86428532735\n },\n {\n \"content\": \"// expressions and operators\\n\\nstruct expr : sor< dq_string, sq_string, number, argument, true_value, false_value, key_path > {};\\n\",\n \"file_path\": \"wrappers/src/object-store/src/parser/parser.cpp\",\n \"rank\": 56,\n \"score\": 112020.61349159316\n },\n {\n \"content\": \"class Realm;\\n\\n\\n\\nnamespace _impl {\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/android/weak_realm_notifier.hpp\",\n \"rank\": 57,\n \"score\": 111224.69475457053\n },\n {\n \"content\": \"class Realm;\\n\\n\\n\\nnamespace _impl {\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/weak_realm_notifier_base.hpp\",\n \"rank\": 58,\n \"score\": 111224.69475457053\n },\n {\n \"content\": \"class Realm;\\n\\n\\n\\nnamespace _impl {\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/apple/weak_realm_notifier.hpp\",\n \"rank\": 59,\n \"score\": 111224.69475457053\n },\n {\n \"content\": \"class Realm;\\n\\n\\n\\nnamespace _impl {\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/impl/generic/weak_realm_notifier.hpp\",\n \"rank\": 60,\n \"score\": 111224.69475457053\n },\n {\n \"content\": \" class MismatchedConfigException : public std::runtime_error {\\n\\n public:\\n\\n MismatchedConfigException(std::string message) : std::runtime_error(message) {}\\n\\n };\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/shared_realm.hpp\",\n \"rank\": 61,\n \"score\": 109805.06709170752\n },\n {\n \"content\": \" class Realm : public std::enable_shared_from_this<Realm> {\\n\\n public:\\n\\n typedef std::function<void(SharedRealm old_realm, SharedRealm realm)> MigrationFunction;\\n\\n\\n\\n struct Config {\\n\\n std::string path;\\n\\n // User-supplied encryption key. Must be either empty or 64 bytes.\\n\\n std::vector<char> encryption_key;\\n\\n\\n\\n // Optional schema for the file. If nullptr, the existing schema\\n\\n // from the file opened will be used. If present, the file will be\\n\\n // migrated to the schema if needed.\\n\\n std::unique_ptr<Schema> schema;\\n\\n uint64_t schema_version;\\n\\n\\n\\n MigrationFunction migration_function;\\n\\n\\n\\n bool read_only = false;\\n\\n bool in_memory = false;\\n\\n\\n\",\n \"file_path\": \"wrappers/src/object-store/src/shared_realm.hpp\",\n \"rank\": 62,\n \"score\": 109682.97869016336\n },\n {\n \"content\": \"class Realm;\\n\",\n \"file_path\": \"wrappers/src/object-store/src/list.hpp\",\n \"rank\": 63,\n \"score\": 108017.3462494512\n },\n {\n \"content\": \" {\\n\\n NativeTable.clear_link(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n else\\n\\n {\\n\\n if (!value.IsManaged)\\n\\n _realm.Manage(value);\\n\\n NativeTable.set_link(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, (IntPtr)value.RowHandle.RowIndex);\\n\\n }\\n\\n }\\n\\n\\n\\n #endregion\\n\\n\\n\\n /**\\n\\n * Shared factory to make an object in the realm from a known row\\n\\n * @param rowPtr may be null if a relationship lookup has failed.\\n\\n */\\n\\n internal RealmObject MakeRealmObject(Type objectType, IntPtr rowPtr) {\\n\\n if (rowPtr == IntPtr.Zero)\\n\\n return null; // typically no related object\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 64,\n \"score\": 101367.08161588392\n },\n {\n \"content\": \" protected T GetObjectValue<T>(string propertyName) where T : RealmObject\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n var linkedRowPtr = NativeTable.get_link (_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n return (T)MakeRealmObject(typeof(T), linkedRowPtr);\\n\\n }\\n\\n\\n\\n #endregion\\n\\n\\n\\n #region Setters\\n\\n\\n\\n protected void SetStringValue(string propertyName, string value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 65,\n \"score\": 101365.72858346124\n },\n {\n \"content\": \"\\n\\n protected DateTimeOffset? GetNullableDateTimeOffsetValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n long unixTimeMS = 0;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, ref unixTimeMS));\\n\\n return hasValue ? DateTimeOffsetExtensions.FromRealmUnixTimeMilliseconds(unixTimeMS) : (DateTimeOffset?)null;\\n\\n }\\n\\n\\n\\n protected RealmList<T> GetListValue<T>(string propertyName) where T : RealmObject\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var listHandle = _metadata.Table.TableLinkList (_metadata.ColumnIndices[propertyName], _rowHandle);\\n\\n return new RealmList<T>(this, listHandle);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 66,\n \"score\": 101362.91024460361\n },\n {\n \"content\": \"\\n\\n if (value.HasValue)\\n\\n {\\n\\n var marshalledValue = value.Value.ToRealmUnixTimeMilliseconds();\\n\\n NativeTable.set_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, marshalledValue);\\n\\n }\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n // TODO make not generic\\n\\n protected void SetObjectValue<T>(string propertyName, T value) where T : RealmObject\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n if (value == null)\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 67,\n \"score\": 101362.68407896494\n },\n {\n \"content\": \" NativeTable.set_string_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value, (IntPtr)value.Length);\\n\\n }\\n\\n\\n\\n protected void SetCharValue(string propertyName, char value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetCharValueUnique(string propertyName, char value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 68,\n \"score\": 101362.0315149458\n },\n {\n \"content\": \" NativeTable.set_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n protected void SetDoubleValue(string propertyName, double value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableDoubleValue(string propertyName, double? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 69,\n \"score\": 101361.76347608081\n },\n {\n \"content\": \" var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value != null)\\n\\n NativeTable.set_string(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value, (IntPtr)value.Length);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n protected void SetStringValueUnique(string propertyName, string value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n if (value == null)\\n\\n throw new ArgumentException(\\\"Object identifiers cannot be null\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 70,\n \"score\": 101361.57360874528\n },\n {\n \"content\": \" protected void SetInt32Value(string propertyName, int value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetInt32ValueUnique(string propertyName, int value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 71,\n \"score\": 101361.3308045598\n },\n {\n \"content\": \" {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0L;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\\n\\n return hasValue ? (short)retVal : (short?) null;\\n\\n }\\n\\n\\n\\n protected int GetInt32Value(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n return (int) value;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 72,\n \"score\": 101361.11668623352\n },\n {\n \"content\": \"\\n\\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableInt32Value(string propertyName, int? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n protected void SetInt64Value(string propertyName, long value)\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 73,\n \"score\": 101361.00818083288\n },\n {\n \"content\": \" protected int? GetNullableInt32Value(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0L;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\\n\\n return hasValue ? (int)retVal : (int?) null;\\n\\n }\\n\\n\\n\\n protected long GetInt64Value(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n return NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 74,\n \"score\": 101360.71590314338\n },\n {\n \"content\": \"\\n\\n NativeTable.set_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, MarshalHelpers.BoolToIntPtr(value));\\n\\n }\\n\\n\\n\\n protected void SetNullableBooleanValue(string propertyName, bool? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, MarshalHelpers.BoolToIntPtr(value.Value));\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n protected void SetDateTimeOffsetValue(string propertyName, DateTimeOffset value)\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 75,\n \"score\": 101360.61044502202\n },\n {\n \"content\": \" throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableCharValue(string propertyName, char? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 76,\n \"score\": 101360.58484064469\n },\n {\n \"content\": \" NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableInt64Value(string propertyName, long? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n protected void SetSingleValue(string propertyName, float value)\\n\\n {\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 77,\n \"score\": 101360.58011111806\n },\n {\n \"content\": \" var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableInt16Value(string propertyName, short? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 78,\n \"score\": 101360.56614339435\n },\n {\n \"content\": \"\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64_unique(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableByteValue(string propertyName, byte? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 79,\n \"score\": 101360.56614339435\n },\n {\n \"content\": \"\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\\n NativeTable.set_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value.Value);\\n\\n else\\n\\n NativeTable.set_null(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\\n protected void SetBooleanValue(string propertyName, bool value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 80,\n \"score\": 101360.51090369337\n },\n {\n \"content\": \" Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0L;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\\n\\n return hasValue ? (byte)retVal : (byte?) null;\\n\\n }\\n\\n\\n\\n protected short GetInt16Value(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n return (short) value;\\n\\n }\\n\\n\\n\\n protected short? GetNullableInt16Value(string propertyName)\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 81,\n \"score\": 101360.09311728484\n },\n {\n \"content\": \" protected double? GetNullableDoubleValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0.0d;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, ref retVal));\\n\\n return hasValue ? retVal : (double?) null;\\n\\n }\\n\\n\\n\\n protected bool GetBooleanValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n return MarshalHelpers.IntPtrToBool(NativeTable.get_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 82,\n \"score\": 101360.00949157015\n },\n {\n \"content\": \" Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetNullableSingleValue(string propertyName, float? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n if (value.HasValue)\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 83,\n \"score\": 101359.93887054872\n },\n {\n \"content\": \" protected float? GetNullableSingleValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0.0f;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\\n\\n return hasValue ? retVal : (float?) null;\\n\\n }\\n\\n\\n\\n protected double GetDoubleValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n return NativeTable.get_double(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 84,\n \"score\": 101359.91798696436\n },\n {\n \"content\": \" }\\n\\n\\n\\n protected void SetByteValue(string propertyName, byte value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetByteValueUnique(string propertyName, byte value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 85,\n \"score\": 101359.86890483489\n },\n {\n \"content\": \"\\n\\n protected void SetInt16Value(string propertyName, short value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetInt16ValueUnique(string propertyName, short value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 86,\n \"score\": 101359.86890483489\n },\n {\n \"content\": \" protected long? GetNullableInt64Value(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0L;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\\n\\n return hasValue ? retVal : (long?) null;\\n\\n }\\n\\n\\n\\n protected float GetSingleValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n return NativeTable.get_float(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 87,\n \"score\": 101359.8495901375\n },\n {\n \"content\": \" {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n NativeTable.set_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, value);\\n\\n }\\n\\n\\n\\n protected void SetInt64ValueUnique(string propertyName, long value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 88,\n \"score\": 101359.73538611352\n },\n {\n \"content\": \" protected bool? GetNullableBooleanValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = IntPtr.Zero;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_bool(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, ref retVal));\\n\\n return hasValue ? MarshalHelpers.IntPtrToBool(retVal) : (bool?) null;\\n\\n }\\n\\n\\n\\n protected DateTimeOffset GetDateTimeOffsetValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var unixTimeMS = NativeTable.get_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n return DateTimeOffsetExtensions.FromRealmUnixTimeMilliseconds(unixTimeMS);\\n\\n }\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 89,\n \"score\": 101359.67804537655\n },\n {\n \"content\": \" {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var marshalledValue = value.ToRealmUnixTimeMilliseconds();\\n\\n NativeTable.set_timestamp_milliseconds(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, marshalledValue);\\n\\n }\\n\\n\\n\\n protected void SetNullableDateTimeOffsetValue(string propertyName, DateTimeOffset? value)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n if (!_realm.IsInTransaction)\\n\\n throw new RealmOutsideTransactionException(\\\"Cannot set values outside transaction\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 90,\n \"score\": 101359.35770448783\n },\n {\n \"content\": \" return \\\"\\\";\\n\\n }\\n\\n\\n\\n return Marshal.PtrToStringUni(_realm.stringGetBuffer, bytesRead);\\n\\n // leaving buffer sitting allocated for quick reuse next time we read a string \\n\\n } // GetStringValue\\n\\n\\n\\n protected char GetCharValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n return (char) value;\\n\\n }\\n\\n\\n\\n protected char? GetNullableCharValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 91,\n \"score\": 101358.71085773301\n },\n {\n \"content\": \"\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var retVal = 0L;\\n\\n var hasValue = MarshalHelpers.IntPtrToBool(NativeTable.get_nullable_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr) rowIndex, ref retVal));\\n\\n return hasValue ? (char)retVal : (char?) null;\\n\\n }\\n\\n\\n\\n protected byte GetByteValue(string propertyName)\\n\\n {\\n\\n Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n\\n\\n var value = NativeTable.get_int64(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex);\\n\\n return (byte) value;\\n\\n }\\n\\n\\n\\n protected byte? GetNullableByteValue(string propertyName)\\n\\n {\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 92,\n \"score\": 101358.18262332006\n },\n {\n \"content\": \"/* Copyright 2015 Realm Inc - All Rights Reserved\\n\\n * Proprietary and Confidential\\n\\n */\\n\\n\\n\\nusing System;\\n\\nusing System.Collections;\\n\\nusing System.Collections.Generic;\\n\\nusing System.Diagnostics;\\n\\nusing System.Linq;\\n\\nusing System.Reflection;\\n\\nusing System.Runtime.InteropServices;\\n\\n\\n\\nnamespace Realms\\n\\n{\\n\\n /// <summary>\\n\\n /// Base for any object that can be persisted in a Realm.\\n\\n /// </summary>\\n\\n public class RealmObject\\n\\n {\\n\\n private Realm _realm;\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 93,\n \"score\": 101357.10345309741\n },\n {\n \"content\": \" Debug.Assert(_realm != null, \\\"Object is not managed, but managed access was attempted\\\");\\n\\n\\n\\n var rowIndex = _rowHandle.RowIndex;\\n\\n var badUTF8msg = $\\\"Corrupted string UTF8 in {propertyName}\\\";\\n\\n\\n\\n int bufferSizeNeededChars = 128;\\n\\n // First alloc this thread\\n\\n if (_realm.stringGetBuffer==IntPtr.Zero) { // first get of a string in this Realm\\n\\n _realm.stringGetBuffer = Marshal.AllocHGlobal((IntPtr)(bufferSizeNeededChars * sizeof(char)));\\n\\n _realm.stringGetBufferLen = bufferSizeNeededChars;\\n\\n } \\n\\n\\n\\n bool isNull = false;\\n\\n\\n\\n // try to read\\n\\n int bytesRead = (int)NativeTable.get_string(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, _realm.stringGetBuffer,\\n\\n (IntPtr)_realm.stringGetBufferLen, out isNull);\\n\\n if (bytesRead == -1)\\n\\n {\\n\\n // bad UTF-8 data unable to transcode, vastly unlikely error but could be corrupt file\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 94,\n \"score\": 101354.14666705804\n },\n {\n \"content\": \" throw new RealmInvalidDatabaseException(badUTF8msg);\\n\\n }\\n\\n if (bytesRead > _realm.stringGetBufferLen) // need a bigger buffer\\n\\n {\\n\\n Marshal.FreeHGlobal(_realm.stringGetBuffer);\\n\\n _realm.stringGetBuffer = Marshal.AllocHGlobal((IntPtr)(bytesRead * sizeof(char)));\\n\\n _realm.stringGetBufferLen = bytesRead;\\n\\n // try to read with big buffer\\n\\n bytesRead = (int)NativeTable.get_string(_metadata.Table, _metadata.ColumnIndices[propertyName], (IntPtr)rowIndex, _realm.stringGetBuffer,\\n\\n (IntPtr)_realm.stringGetBufferLen, out isNull);\\n\\n if (bytesRead == -1) // bad UTF-8 in full string\\n\\n throw new RealmInvalidDatabaseException(badUTF8msg);\\n\\n Debug.Assert(bytesRead <= _realm.stringGetBufferLen);\\n\\n } // needed re-read with expanded buffer\\n\\n\\n\\n if (bytesRead == 0)\\n\\n {\\n\\n if (isNull)\\n\\n return null;\\n\\n \\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 95,\n \"score\": 101350.9753351533\n },\n {\n \"content\": \"\\n\\n // Optimization for a common success case. \\n\\n if (ReferenceEquals(this, obj))\\n\\n {\\n\\n return true;\\n\\n }\\n\\n\\n\\n // If run-time types are not exactly the same, return false. \\n\\n if (this.GetType() != obj.GetType())\\n\\n return false;\\n\\n\\n\\n // Return true if the fields match. \\n\\n // Note that the base class is not invoked because it is \\n\\n // System.Object, which defines Equals as reference equality. \\n\\n return RowHandle.Equals(((RealmObject)obj).RowHandle);\\n\\n }\\n\\n\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 96,\n \"score\": 101350.78311926237\n },\n {\n \"content\": \" internal TableHandle Table;\\n\\n\\n\\n internal Weaving.IRealmObjectHelper Helper;\\n\\n\\n\\n internal Dictionary<string, IntPtr> ColumnIndices;\\n\\n }\\n\\n\\n\\n internal void _CopyDataFromBackingFieldsToRow()\\n\\n {\\n\\n Debug.Assert(this.IsManaged);\\n\\n\\n\\n var thisType = this.GetType();\\n\\n var wovenProperties = from prop in thisType.GetProperties()\\n\\n let backingField = prop.GetCustomAttributes(false)\\n\\n .OfType<WovenPropertyAttribute>()\\n\\n .Select(a => a.BackingFieldName)\\n\\n .SingleOrDefault()\\n\\n where backingField != null\\n\\n select new { Info = prop, Field = thisType.GetField(backingField, BindingFlags.Instance | BindingFlags.NonPublic) };\\n\\n\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 97,\n \"score\": 101350.48212690349\n },\n {\n \"content\": \" var ret = _realm.Metadata[objectType].Helper.CreateInstance();\\n\\n var relatedHandle = Realm.CreateRowHandle (rowPtr, _realm.SharedRealmHandle);\\n\\n ret._Manage(_realm, relatedHandle);\\n\\n return ret;\\n\\n }\\n\\n\\n\\n\\n\\n /// <summary>\\n\\n /// Compare objects with identity query for persistent objects.\\n\\n /// </summary>\\n\\n /// <remarks>Persisted RealmObjects map their properties directly to the realm with no caching so multiple instances of a given object always refer to the same store.</remarks>\\n\\n /// <param name=\\\"obj\\\"></param>\\n\\n /// <returns>True when objects are the same memory object or refer to the same persisted object.</returns>\\n\\n public override bool Equals(object obj)\\n\\n {\\n\\n // If parameter is null, return false. \\n\\n if (ReferenceEquals(obj, null))\\n\\n {\\n\\n return false;\\n\\n }\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 98,\n \"score\": 101349.13548432136\n },\n {\n \"content\": \" foreach (var prop in wovenProperties)\\n\\n {\\n\\n var value = prop.Field.GetValue(this);\\n\\n if (prop.Info.PropertyType.IsGenericType)\\n\\n {\\n\\n var genericType = prop.Info.PropertyType.GetGenericTypeDefinition();\\n\\n if (genericType == typeof(RealmList<>))\\n\\n {\\n\\n continue;\\n\\n }\\n\\n }\\n\\n\\n\\n prop.Info.SetValue(this, value, null);\\n\\n }\\n\\n }\\n\\n\\n\\n\\n\\n #region Getters\\n\\n protected string GetStringValue(string propertyName)\\n\\n {\\n\",\n \"file_path\": \"Realm.Shared/RealmObject.cs\",\n \"rank\": 99,\n \"score\": 101345.80220394004\n }\n]","isConversational":false}}},{"rowIdx":78,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"dev/Code/Tools/RC/ResourceCompilerPC/CGA/ControllerPQ.cpp"},"repo_name":{"kind":"string","value":"crazyskateface/lumberyard"},"commit":{"kind":"string","value":"164512f8d415d6bdf37e195af319ffe5f96a8f0b"},"file_code":{"kind":"string","value":"\n\n#include \"stdafx.h\"\n\n#include \"AnimationLoader.h\"\n#include \"AnimationManager.h\"\n#include \"Wavelets/Compression.h\"\n\n#include <float.h>\n\nnamespace ControllerHelper\n{\n uint32 GetPositionsFormatSizeOf(uint32 format)\n {\n switch (format)\n {\n case eNoCompress:\n case eNoCompressVec3:\n {\n return sizeof (NoCompressVec3);\n }\n }\n return 0;\n }\n\n uint32 GetRotationFormatSizeOf(uint32 format)\n {\n switch (format)\n {\n case eNoCompress:\n case eNoCompressQuat:\n return sizeof(NoCompressQuat);\n\n \n \n\n case eSmallTree48BitQuat:\n return sizeof(SmallTree48BitQuat);\n\n case eSmallTree64BitQuat:\n return sizeof(SmallTree64BitQuat);\n\n case eSmallTree64BitExtQuat:\n return sizeof(SmallTree64BitExtQuat);\n }\n return 0;\n }\n\n uint32 GetKeyTimesFormatSizeOf(uint32 format)\n {\n switch (format)\n {\n case eF32:\n return sizeof(float);\n\n case eUINT16:\n return sizeof(uint16);\n\n case eByte:\n return sizeof(uint8);\n\n case eF32StartStop:\n return sizeof(float);\n\n case eUINT16StartStop:\n return sizeof(uint16);\n\n case eByteStartStop:\n return sizeof(uint8);\n\n case eBitset:\n return sizeof(uint16);\n }\n\n return 0;\n }\n\n ITrackPositionStorage* GetPositionControllerPtr(ECompressionFormat format)\n {\n switch (format)\n {\n case eNoCompress:\n case eNoCompressVec3:\n {\n \n \n \n \n \n return new NoCompressPosition;\n }\n }\n return 0;\n \n }\n\n ITrackRotationStorage* GetRotationControllerPtr(ECompressionFormat format)\n {\n switch (format)\n {\n \n case eNoCompress:\n case eNoCompressQuat:\n return new NoCompressRotation;\n\n \n\n \n \n \n \n \n\n \n \n\n \n \n\n case eSmallTree48BitQuat:\n \n return new SmallTree48BitQuatRotation;\n\n case eSmallTree64BitQuat:\n \n return new SmallTree64BitQuatRotation;\n\n \n \n\n case eSmallTree64BitExtQuat:\n \n return new SmallTree64BitExtQuatRotation;\n }\n return 0;\n }\n\n IKeyTimesInformation* GetKeyTimesControllerPtr(uint32 format)\n {\n switch (format)\n {\n case eF32:\n return new F32KeyTimesInformation;\n\n case eUINT16:\n return new UINT16KeyTimesInformation;\n\n case eByte:\n return new ByteKeyTimesInformation;\n\n \n \n\n \n \n\n \n \n\n case eBitset:\n return new CKeyTimesInformationBitSet;\n }\n return 0;\n }\n \n \n const uint8 m_byteLowBit[byteArraySize] _ALIGN(16) = {\n 8, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0\n };\n \n \n const uint8 m_byteHighBit[byteArraySize] _ALIGN(16) = {\n 16, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3,\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7\n };\n};\n\nuint8 CKeyTimesInformationBitSet::m_bTable[256] = {\n 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,\n 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3,\n 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3,\n 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3,\n 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5,\n 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5,\n 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8\n};\n"},"prefix":{"kind":"string","value":"\n\n#include \"stdafx.h\"\n\n#include \"AnimationLoader.h\"\n#include \"AnimationManager.h\"\n#include \"Wavelets/Compression.h\"\n\n#include <float.h>\n\nnamespace ControllerHelper\n{\n uint32 GetPositionsFormatSizeOf(uint32 format)\n {\n switch (format)\n {\n case eNoCompress:\n case eNoCompressVec3:\n {\n return sizeof (NoCompressVec3);\n }\n }\n return 0;\n }\n\n uint32 GetRotationFormatSizeOf(uint32 format)\n {\n switch (format)\n {\n case eNoCompress:\n case eNoCompressQuat:\n return sizeof(NoCompressQuat);\n\n \n \n\n case eSmallTree48BitQuat:\n return sizeof(SmallTree48BitQuat);\n\n case eSmallTree64BitQuat:\n return sizeof(SmallTree64BitQuat);\n\n case eSmallTree64BitExtQuat:\n return sizeof(SmallTree64BitExtQuat);\n }\n return 0;\n }\n\n uint32 GetKeyTimesFormatSizeOf(uint32 format)\n {\n switc"},"suffix":{"kind":"string","value":"ation;\n\n case eByte:\n return new ByteKeyTimesInformation;\n\n \n \n\n \n \n\n \n \n\n case eBitset:\n return new CKeyTimesInformationBitSet;\n }\n return 0;\n }\n \n \n const uint8 m_byteLowBit[byteArraySize] _ALIGN(16) = {\n 8, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,\n 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0\n };\n \n \n const uint8 m_byteHighBit[byteArraySize] _ALIGN(16) = {\n 16, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3,\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,\n 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7\n };\n};\n\nuint8 CKeyTimesInformationBitSet::m_bTable[256] = {\n 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,\n 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3,\n 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3,\n 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3,\n 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5,\n 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5,\n 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8\n};\n"},"middle":{"kind":"string","value":"h (format)\n {\n case eF32:\n return sizeof(float);\n\n case eUINT16:\n return sizeof(uint16);\n\n case eByte:\n return sizeof(uint8);\n\n case eF32StartStop:\n return sizeof(float);\n\n case eUINT16StartStop:\n return sizeof(uint16);\n\n case eByteStartStop:\n return sizeof(uint8);\n\n case eBitset:\n return sizeof(uint16);\n }\n\n return 0;\n }\n\n ITrackPositionStorage* GetPositionControllerPtr(ECompressionFormat format)\n {\n switch (format)\n {\n case eNoCompress:\n case eNoCompressVec3:\n {\n \n \n \n \n \n return new NoCompressPosition;\n }\n }\n return 0;\n \n }\n\n ITrackRotationStorage* GetRotationControllerPtr(ECompressionFormat format)\n {\n switch (format)\n {\n \n case eNoCompress:\n case eNoCompressQuat:\n return new NoCompressRotation;\n\n \n\n \n \n \n \n \n\n \n \n\n \n \n\n case eSmallTree48BitQuat:\n \n return new SmallTree48BitQuatRotation;\n\n case eSmallTree64BitQuat:\n \n return new SmallTree64BitQuatRotation;\n\n \n \n\n case eSmallTree64BitExtQuat:\n \n return new SmallTree64BitExtQuatRotation;\n }\n return 0;\n }\n\n IKeyTimesInformation* GetKeyTimesControllerPtr(uint32 format)\n {\n switch (format)\n {\n case eF32:\n return new F32KeyTimesInformation;\n\n case eUINT16:\n return new UINT16KeyTimesInform"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":79,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"qtmultimedia/src/plugins/gstreamer/camerabin/camerabinrecorder.cpp"},"repo_name":{"kind":"string","value":"wgnet/wds_qt"},"commit":{"kind":"string","value":"8db722fd367d2d0744decf99ac7bafaba8b8a3d3"},"file_code":{"kind":"string","value":"\n\n#include \"camerabinrecorder.h\"\n#include \"camerabincontrol.h\"\n#include \"camerabinresourcepolicy.h\"\n#include \"camerabinaudioencoder.h\"\n#include \"camerabinvideoencoder.h\"\n#include \"camerabincontainer.h\"\n#include <QtCore/QDebug>\n\nQT_BEGIN_NAMESPACE\n\nCameraBinRecorder::CameraBinRecorder(CameraBinSession *session)\n :QMediaRecorderControl(session),\n m_session(session),\n m_state(QMediaRecorder::StoppedState),\n m_status(QMediaRecorder::UnloadedStatus)\n{\n connect(m_session, SIGNAL(statusChanged(QCamera::Status)), SLOT(updateStatus()));\n connect(m_session, SIGNAL(pendingStateChanged(QCamera::State)), SLOT(updateStatus()));\n connect(m_session, SIGNAL(busyChanged(bool)), SLOT(updateStatus()));\n\n connect(m_session, SIGNAL(durationChanged(qint64)), SIGNAL(durationChanged(qint64)));\n connect(m_session, SIGNAL(mutedChanged(bool)), this, SIGNAL(mutedChanged(bool)));\n connect(m_session->cameraControl()->resourcePolicy(), SIGNAL(canCaptureChanged()),\n this, SLOT(updateStatus()));\n}\n\nCameraBinRecorder::~CameraBinRecorder()\n{\n}\n\nQUrl CameraBinRecorder::outputLocation() const\n{\n return m_session->outputLocation();\n}\n\nbool CameraBinRecorder::setOutputLocation(const QUrl &sink)\n{\n m_session->setOutputLocation(sink);\n return true;\n}\n\nQMediaRecorder::State CameraBinRecorder::state() const\n{\n return m_state;\n}\n\nQMediaRecorder::Status CameraBinRecorder::status() const\n{\n return m_status;\n}\n\nvoid CameraBinRecorder::updateStatus()\n{\n QCamera::Status sessionStatus = m_session->status();\n\n QMediaRecorder::State oldState = m_state;\n QMediaRecorder::Status oldStatus = m_status;\n\n if (sessionStatus == QCamera::ActiveStatus &&\n m_session->captureMode().testFlag(QCamera::CaptureVideo)) {\n\n if (!m_session->cameraControl()->resourcePolicy()->canCapture()) {\n m_status = QMediaRecorder::UnavailableStatus;\n m_state = QMediaRecorder::StoppedState;\n m_session->stopVideoRecording();\n } else if (m_state == QMediaRecorder::RecordingState) {\n m_status = QMediaRecorder::RecordingStatus;\n } else {\n m_status = m_session->isBusy() ?\n QMediaRecorder::FinalizingStatus :\n QMediaRecorder::LoadedStatus;\n }\n } else {\n if (m_state == QMediaRecorder::RecordingState) {\n m_state = QMediaRecorder::StoppedState;\n m_session->stopVideoRecording();\n }\n m_status = m_session->pendingState() == QCamera::ActiveState\n && m_session->captureMode().testFlag(QCamera::CaptureVideo)\n ? QMediaRecorder::LoadingStatus\n : QMediaRecorder::UnloadedStatus;\n }\n\n if (m_state != oldState)\n emit stateChanged(m_state);\n\n if (m_status != oldStatus)\n emit statusChanged(m_status);\n}\n\nqint64 CameraBinRecorder::duration() const\n{\n return m_session->duration();\n}\n\nvoid CameraBinRecorder::applySettings()\n{\n#ifdef HAVE_GST_ENCODING_PROFILES\n CameraBinContainer *containerControl = m_session->mediaContainerControl();\n CameraBinAudioEncoder *audioEncoderControl = m_session->audioEncodeControl();\n CameraBinVideoEncoder *videoEncoderControl = m_session->videoEncodeControl();\n\n containerControl->resetActualContainerFormat();\n audioEncoderControl->resetActualSettings();\n videoEncoderControl->resetActualSettings();\n\n \n \n \n if (containerControl->containerFormat().isEmpty() &&\n audioEncoderControl->audioSettings().codec().isEmpty() &&\n videoEncoderControl->videoSettings().codec().isEmpty()) {\n\n QList<QStringList> candidates;\n candidates.append(QStringList() << \"video/x-matroska\" << \"video/x-h264\" << \"audio/mpeg, mpegversion=(int)4\");\n candidates.append(QStringList() << \"video/webm\" << \"video/x-vp8\" << \"audio/x-vorbis\");\n candidates.append(QStringList() << \"application/ogg\" << \"video/x-theora\" << \"audio/x-vorbis\");\n candidates.append(QStringList() << \"video/quicktime\" << \"video/x-h264\" << \"audio/mpeg, mpegversion=(int)4\");\n candidates.append(QStringList() << \"video/quicktime\" << \"video/x-h264\" << \"audio/mpeg\");\n candidates.append(QStringList() << \"video/x-msvideo\" << \"video/x-divx\" << \"audio/mpeg\");\n\n foreach (const QStringList &candidate, candidates) {\n if (containerControl->supportedContainers().contains(candidate[0]) &&\n videoEncoderControl->supportedVideoCodecs().contains(candidate[1]) &&\n audioEncoderControl->supportedAudioCodecs().contains(candidate[2])) {\n containerControl->setActualContainerFormat(candidate[0]);\n\n QVideoEncoderSettings videoSettings = videoEncoderControl->videoSettings();\n videoSettings.setCodec(candidate[1]);\n videoEncoderControl->setActualVideoSettings(videoSettings);\n\n QAudioEncoderSettings audioSettings = audioEncoderControl->audioSettings();\n audioSettings.setCodec(candidate[2]);\n audioEncoderControl->setActualAudioSettings(audioSettings);\n\n break;\n }\n }\n }\n#endif\n}\n\n#ifdef HAVE_GST_ENCODING_PROFILES\n\nGstEncodingContainerProfile *CameraBinRecorder::videoProfile()\n{\n GstEncodingContainerProfile *containerProfile = m_session->mediaContainerControl()->createProfile();\n\n if (containerProfile) {\n GstEncodingProfile *audioProfile = m_session->audioEncodeControl()->createProfile();\n GstEncodingProfile *videoProfile = m_session->videoEncodeControl()->createProfile();\n\n if (audioProfile) {\n if (!gst_encoding_container_profile_add_profile(containerProfile, audioProfile))\n gst_encoding_profile_unref(audioProfile);\n }\n if (videoProfile) {\n if (!gst_encoding_container_profile_add_profile(containerProfile, videoProfile))\n gst_encoding_profile_unref(videoProfile);\n }\n }\n\n return containerProfile;\n}\n\n#endif\n\nvoid CameraBinRecorder::setState(QMediaRecorder::State state)\n{\n if (m_state == state)\n return;\n\n QMediaRecorder::State oldState = m_state;\n QMediaRecorder::Status oldStatus = m_status;\n\n switch (state) {\n case QMediaRecorder::StoppedState:\n m_state = state;\n m_status = QMediaRecorder::FinalizingStatus;\n m_session->stopVideoRecording();\n break;\n case QMediaRecorder::PausedState:\n emit error(QMediaRecorder::ResourceError, tr(\"QMediaRecorder::pause() is not supported by camerabin2.\"));\n break;\n case QMediaRecorder::RecordingState:\n\n if (m_session->status() != QCamera::ActiveStatus) {\n emit error(QMediaRecorder::ResourceError, tr(\"Service has not been started\"));\n } else if (!m_session->cameraControl()->resourcePolicy()->canCapture()) {\n emit error(QMediaRecorder::ResourceError, tr(\"Recording permissions are not available\"));\n } else {\n m_session->recordVideo();\n m_state = state;\n m_status = QMediaRecorder::RecordingStatus;\n emit actualLocationChanged(m_session->outputLocation());\n }\n }\n\n if (m_state != oldState)\n emit stateChanged(m_state);\n\n if (m_status != oldStatus)\n emit statusChanged(m_status);\n}\n\nbool CameraBinRecorder::isMuted() const\n{\n return m_session->isMuted();\n}\n\nqreal CameraBinRecorder::volume() const\n{\n return 1.0;\n}\n\nvoid CameraBinRecorder::setMuted(bool muted)\n{\n m_session->setMuted(muted);\n}\n\nvoid CameraBinRecorder::setVolume(qreal volume)\n{\n if (!qFuzzyCompare(volume, qreal(1.0)))\n qWarning() << \"Media service doesn't support recorder audio gain.\";\n}\n\nQT_END_NAMESPACE\n\n"},"prefix":{"kind":"string","value":"\n\n#include \"camerabinrecorder.h\"\n#include \"camerabincontrol.h\"\n#include \"camerabinresourcepolicy.h\"\n#include \"camerabinaudioencoder.h\"\n#include \"camerabinvideoencoder.h\"\n#include \"camerabincontainer.h\"\n#include <QtCore/QDebug>\n\nQT_BEGIN_NAMESPACE\n\nCameraBinRecorder::CameraBinRecorder(CameraBinSession *session)\n :QMediaRecorderControl(session),\n m_session(session),\n m_state(QMediaRecorder::StoppedState),\n m_status(QMediaRecorder::UnloadedStatus)\n{\n connect(m_session, SIGNAL(statusChanged(QCamera::Status)), SLOT(updateStatus()));\n connect(m_session, SIGNAL(pendingStateChanged(QCamera::State)), SLOT(updateStatus()));\n connect(m_session, SIGNAL(busyChanged(bool)), SLOT(updateStatus()));\n\n connect(m_session, SIGNAL(durationChanged(qint64)), SIGNAL(durationChanged(qint64)));\n connect(m_session, SIGNAL(mutedChanged(bool)), this, SIGNAL(mutedChanged(bool)));\n connect(m_session->cameraControl()->resourcePolicy(), SIGNAL(canCaptureChanged()),\n this, SLOT(updateStatus()));\n}\n\nCameraBinRecorder::~CameraBinRecorder()\n{\n}\n\nQUrl CameraBinRecorder::outputLocation() const\n{\n return m_session->outputLocation();\n}\n\nbool CameraBinRecorder::setOutputLocation(const QUrl &sink)\n{\n m_session->setOutputLocation(sink);\n return true;\n}\n\nQMediaRecorder::State CameraBinRecorder::state() const\n{\n return m_state;\n}\n\nQMediaRecorder::Status CameraBinRecorder::status() const\n{\n return m_status;\n}\n\nvoid CameraBinRecorder::updateStatus()\n{\n QCamera::Status sessionStatus = m_session->status();\n\n QMediaRecorder::State oldState = m_state;\n QMediaRecorder::Status oldStatus = m_status;\n\n if (sessionStatus == QCamera::ActiveStatus &&\n m_session->captureMode().testFlag(QCamera::CaptureVideo)) {\n\n if (!m_session->cameraControl()->resourcePolicy()->canCapture()) {\n m_status = QMediaRecorder::UnavailableStatus;\n m_state = QMediaRecorder::StoppedState;\n m_session->stopVideoRecording();\n } else if (m_state == QMediaRecorder::RecordingState) {\n m_status = QMediaRecorder::RecordingStatus;\n } else {\n m_status = m_session->isBusy() ?\n QMediaRecorder::FinalizingStatus :\n QMediaRecorder::LoadedStatus;\n }\n } else {\n if (m_state == QMediaRecorder::RecordingState) {\n m_state = QMediaRecorder::StoppedState;\n m_session->stopVideoRecording();\n }\n m_status = m_session->pendingState() == QCamera::ActiveState\n && m_session->captureMode().testFlag(QCamera::CaptureVideo)\n ? QMediaRecorder::LoadingStatus\n : QMediaRecorder::UnloadedStatus;\n }\n\n if (m_state != oldState)\n emit stateChanged(m_state);\n\n if (m_status != oldStatus)\n emit statusChanged(m_status);\n}\n\nqint64 CameraBinRecorder::duration() const\n{\n return m_session->duration();\n}\n\nvoid CameraBinRecorder::applySettings()\n{\n#ifdef HAVE_GST_ENCODING_PROFILES\n CameraBinContainer *containerControl = m_session->mediaContainerControl();\n CameraBinAudioEncoder *audioEncoderControl = m_session->audioEncodeControl();\n CameraBinVideoEncoder *videoEncoderControl = m_session->videoEncodeControl();\n\n containerControl->resetActualContainerFormat();\n audioEncoderControl->resetActualSettings();\n videoEncoderControl->resetActualSettings();\n\n \n \n \n if (containerControl->containerFormat().isEmpty() &&\n audioEncoderControl->audioSettings().codec().isEmpty() &&\n videoEncoderControl->videoSettings().codec().isEmpty()) {\n\n QList<QStringList> candidates;\n candidates.append(QStringList() << \"video/x-matroska\" << \"video/x-h264\" << \"audio/mpeg, mpegversion=(int)4\");\n candidates.append(QStringList() << \"video/webm\" << \"video/x-vp8\" << \"audio/x-vorbis\");\n candidates.append(QStringList() << \"application/ogg\" << \"video/x-theora\" << \"audio/x-vorbis\");\n candidates.append(QStringList() << \"video/quicktime\" << \"video/x-h264\" << \"audio/mpeg, mpegversion=(int)4\");\n candidates.append(QStringList() << \"video/quicktime\" << \"video/x-h264\" << \"audio/mpeg\");\n candidates.append(QStringList() << \"video/x-msvideo\" << \"video/x-divx\" << \"audio/mpeg\");\n\n foreach (const QStringList &candidate, candidates) {\n if (containerControl->supportedContainers().contains(candidate[0]) &&\n videoEncoderControl->supportedVideoCodecs().contains(candidate[1]) &&\n audioEncoderControl->supportedAudioCodecs().contains(candidate[2])) {\n containerControl->setActualContainerFormat(candidate[0]);\n\n QVideoEncoderSettings videoSettings = videoEncoderControl->videoSettings();\n videoSettings.setCodec(candidate[1]);\n videoEncoderControl->setActualVideoSettings(videoSettings);\n\n QAudioEncoderSettings audioSettings = audioEncoderControl->audioSettings();\n audioSettings.setCodec(candidate[2]);\n audioEncoderControl->setActualAudioSettings(audioSettings);\n\n break;\n }\n }\n }\n#endif\n}\n\n#ifdef HAVE_GST_ENCODING_PROFILES\n\nGstEncodingContainerProfile *CameraBinRecorder::videoProfile()\n{\n GstEncodingContainerProfile *containerProfile = m_session->mediaContainerControl()->createProfile();\n\n if (containerProfile) {\n GstEncodingProfile *audioProfile = m_session->audioEncodeControl()->createProfile();\n GstEncodingProfile *videoProfile = m_session->videoEncodeControl()->createProfile();\n\n if (audioProfile) {\n if (!gst_encoding_container_profile_add_profile(containerProfile, audioProfile))\n gst_encoding_profile_unref(audioProfile);\n }\n if (videoProfile) {\n if (!gst_encoding_container_profile_add_profile(containerProfile, videoProfile))\n gst_encoding_profile_unref(videoProfile);\n }\n }\n\n return containerProfile;\n}\n\n#endif\n\nvoid CameraBinRecorder::setState(QMediaRecorder::State state)\n{\n if (m_state == state)\n return;\n\n QMediaRecorder::State oldState = m_state;\n QMediaRecorder::Status oldStatus = m_status;\n\n switch (state) {\n case QMediaRecorder::StoppedState:\n m_state = state;\n m_status = QMediaRecorder::FinalizingStatus;\n m_session->stopVideoRecording();\n break;\n case QMediaRecorder::PausedState:\n emit error(QMediaRecorder::ResourceError, tr(\"QMediaRecorder::pause() is not supported by camerabin2.\"));\n break;\n case QMediaRecorder::RecordingState:\n\n "},"suffix":{"kind":"string","value":"\n }\n\n if (m_state != oldState)\n emit stateChanged(m_state);\n\n if (m_status != oldStatus)\n emit statusChanged(m_status);\n}\n\nbool CameraBinRecorder::isMuted() const\n{\n return m_session->isMuted();\n}\n\nqreal CameraBinRecorder::volume() const\n{\n return 1.0;\n}\n\nvoid CameraBinRecorder::setMuted(bool muted)\n{\n m_session->setMuted(muted);\n}\n\nvoid CameraBinRecorder::setVolume(qreal volume)\n{\n if (!qFuzzyCompare(volume, qreal(1.0)))\n qWarning() << \"Media service doesn't support recorder audio gain.\";\n}\n\nQT_END_NAMESPACE\n\n"},"middle":{"kind":"string","value":"if (m_session->status() != QCamera::ActiveStatus) {\n emit error(QMediaRecorder::ResourceError, tr(\"Service has not been started\"));\n } else if (!m_session->cameraControl()->resourcePolicy()->canCapture()) {\n emit error(QMediaRecorder::ResourceError, tr(\"Recording permissions are not available\"));\n } else {\n m_session->recordVideo();\n m_state = state;\n m_status = QMediaRecorder::RecordingStatus;\n emit actualLocationChanged(m_session->outputLocation());\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":80,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"camera/hal/test/v4l2/src/pipeline_test.cpp"},"repo_name":{"kind":"string","value":"openharmony-gitee-mirror/drivers_peripheral"},"commit":{"kind":"string","value":"4ee6d41befdf54a97afeb5838be5fcd0b4888d56"},"file_code":{"kind":"string","value":"\n#include \"pipeline_test.h\"\n\nvoid UtestPipelineTest::SetUpTestCase(void)\n{}\nvoid UtestPipelineTest::TearDownTestCase(void)\n{}\nvoid UtestPipelineTest::SetUp(void)\n{\n if (display_ == nullptr)\n display_ = std::make_shared<TestDisplay>();\n display_->FBInit();\n display_->Init();\n}\nvoid UtestPipelineTest::TearDown(void)\n{\n display_->Close();\n}\n\nTEST_F(UtestPipelineTest, camera_ppl_0001)\n{\n std::cout << \"==========[test log] Check ppl: preview success.\" << std::endl;\n \n display_->AchieveStreamOperator();\n \n display_->intents = {Camera::PREVIEW};\n display_->StartStream(display_->intents);\n \n display_->StartCapture(display_->streamId_preview, display_->captureId_preview, false, true);\n \n display_->captureIds = {display_->captureId_preview};\n display_->streamIds = {display_->streamId_preview};\n display_->StopStream(display_->captureIds, display_->streamIds);\n}\n\nTEST_F(UtestPipelineTest, camera_ppl_0002)\n{\n std::cout << \"==========[test log] Check ppl: preview + capture success.\" << std::endl;\n \n display_->AchieveStreamOperator();\n \n display_->intents = {Camera::PREVIEW, Camera::STILL_CAPTURE};\n display_->StartStream(display_->intents);\n \n display_->StartCapture(display_->streamId_preview, display_->captureId_preview, false, true);\n display_->StartCapture(display_->streamId_capture, display_->captureId_capture, false, true);\n \n display_->captureIds = {display_->captureId_preview, display_->captureId_capture};\n display_->streamIds = {display_->streamId_preview, display_->streamId_capture};\n display_->StopStream(display_->captureIds, display_->streamIds);\n}\n\nTEST_F(UtestPipelineTest, camera_ppl_0003)\n{\n std::cout << \"==========[test log] Check ppl: preview + video success.\" << std::endl;\n \n display_->AchieveStreamOperator();\n \n display_->intents = {Camera::PREVIEW, Camera::VIDEO};\n display_->StartStream(display_->intents);\n \n display_->StartCapture(display_->streamId_preview, display_->captureId_preview, false, true);\n display_->StartCapture(display_->streamId_video, display_->captureId_video, false, true);\n \n display_->captureIds = {display_->captureId_preview, display_->captureId_video};\n display_->streamIds = {display_->streamId_preview, display_->streamId_video};\n display_->StopStream(display_->captureIds, display_->streamIds);\n}\n\nTEST_F(UtestPipelineTest, camera_ppl_0004)\n{\n std::cout << \"==========[test log] Video mode without preview, system not support, \";\n std::cout << \"expected return fail.\" << std::endl;\n\n EXPECT_EQ(true, display_->cameraDevice != nullptr);\n display_->AchieveStreamOperator();\n \n std::vector<std::shared_ptr<StreamInfo>> streamInfos;\n std::shared_ptr<IBufferProducer> producer = IBufferProducer::CreateBufferQueue();\n producer->SetQueueSize(8); \n if (producer->GetQueueSize() != 8) { \n std::cout << \"~~~~~~~\" << std::endl;\n }\n auto callback = [this](std::shared_ptr<SurfaceBuffer> b) {\n display_->BufferCallback(b, display_->video_mode);\n return;\n };\n producer->SetCallback(callback);\n display_->streamInfo = std::make_shared<OHOS::Camera::StreamInfo>();\n display_->streamInfo->streamId_ = display_->streamId_video;\n display_->streamInfo->width_ = 640; \n display_->streamInfo->height_ = 480; \n display_->streamInfo->format_ = CAMERA_FORMAT_YUYV_422_PKG;\n display_->streamInfo->datasapce_ = 10; \n display_->streamInfo->intent_ = Camera::VIDEO;\n display_->streamInfo->tunneledMode_ = 5; \n display_->streamInfo->bufferQueue_ = producer;\n std::vector<std::shared_ptr<OHOS::Camera::StreamInfo>>().swap(streamInfos);\n streamInfos.push_back(display_->streamInfo);\n display_->rc = display_->streamOperator->CreateStreams(streamInfos);\n EXPECT_EQ(false, display_->rc == Camera::METHOD_NOT_SUPPORTED);\n if (display_->rc == Camera::METHOD_NOT_SUPPORTED) {\n std::cout << \"==========[test log] CreateStreams METHOD_NOT_SUPPORTED, streamId = \";\n std::cout << display_->streamId_video <<\", intent = Camera::VIDEO\" << std::endl;\n } else {\n std::cout << \"==========[test log] CreateStreams fail, rc = \" << display_->rc << std::endl;\n }\n\n display_->rc = display_->streamOperator->CommitStreams(Camera::NORMAL, nullptr);\n EXPECT_EQ(false, display_->rc == Camera::NO_ERROR);\n if (display_->rc == Camera::NO_ERROR) {\n std::cout << \"==========[test log] CommitStreams success.\" << std::endl;\n } else {\n std::cout << \"==========[test log] CommitStreams fail, rc = .\" << display_->rc << std::endl;\n }\n}"},"prefix":{"kind":"string","value":"\n#include \"pipeline_test.h\"\n\nvoid UtestPipelineTest::SetUpTestCase(void)\n{}\nvoid UtestPipelineTest::TearDownTestCase(void)\n{}\nvoid UtestPipelineTest::SetUp(void)\n{\n if (display_ == nullptr)\n display_ = std::make_shared<TestDisplay>();\n display_->FBInit();\n display_->Init();\n}\nvoid UtestPipelineTest::TearDown(void)\n{\n display_->Close();\n}\n\n"},"suffix":{"kind":"string","value":"\n\nTEST_F(UtestPipelineTest, camera_ppl_0002)\n{\n std::cout << \"==========[test log] Check ppl: preview + capture success.\" << std::endl;\n \n display_->AchieveStreamOperator();\n \n display_->intents = {Camera::PREVIEW, Camera::STILL_CAPTURE};\n display_->StartStream(display_->intents);\n \n display_->StartCapture(display_->streamId_preview, display_->captureId_preview, false, true);\n display_->StartCapture(display_->streamId_capture, display_->captureId_capture, false, true);\n \n display_->captureIds = {display_->captureId_preview, display_->captureId_capture};\n display_->streamIds = {display_->streamId_preview, display_->streamId_capture};\n display_->StopStream(display_->captureIds, display_->streamIds);\n}\n\nTEST_F(UtestPipelineTest, camera_ppl_0003)\n{\n std::cout << \"==========[test log] Check ppl: preview + video success.\" << std::endl;\n \n display_->AchieveStreamOperator();\n \n display_->intents = {Camera::PREVIEW, Camera::VIDEO};\n display_->StartStream(display_->intents);\n \n display_->StartCapture(display_->streamId_preview, display_->captureId_preview, false, true);\n display_->StartCapture(display_->streamId_video, display_->captureId_video, false, true);\n \n display_->captureIds = {display_->captureId_preview, display_->captureId_video};\n display_->streamIds = {display_->streamId_preview, display_->streamId_video};\n display_->StopStream(display_->captureIds, display_->streamIds);\n}\n\nTEST_F(UtestPipelineTest, camera_ppl_0004)\n{\n std::cout << \"==========[test log] Video mode without preview, system not support, \";\n std::cout << \"expected return fail.\" << std::endl;\n\n EXPECT_EQ(true, display_->cameraDevice != nullptr);\n display_->AchieveStreamOperator();\n \n std::vector<std::shared_ptr<StreamInfo>> streamInfos;\n std::shared_ptr<IBufferProducer> producer = IBufferProducer::CreateBufferQueue();\n producer->SetQueueSize(8); \n if (producer->GetQueueSize() != 8) { \n std::cout << \"~~~~~~~\" << std::endl;\n }\n auto callback = [this](std::shared_ptr<SurfaceBuffer> b) {\n display_->BufferCallback(b, display_->video_mode);\n return;\n };\n producer->SetCallback(callback);\n display_->streamInfo = std::make_shared<OHOS::Camera::StreamInfo>();\n display_->streamInfo->streamId_ = display_->streamId_video;\n display_->streamInfo->width_ = 640; \n display_->streamInfo->height_ = 480; \n display_->streamInfo->format_ = CAMERA_FORMAT_YUYV_422_PKG;\n display_->streamInfo->datasapce_ = 10; \n display_->streamInfo->intent_ = Camera::VIDEO;\n display_->streamInfo->tunneledMode_ = 5; \n display_->streamInfo->bufferQueue_ = producer;\n std::vector<std::shared_ptr<OHOS::Camera::StreamInfo>>().swap(streamInfos);\n streamInfos.push_back(display_->streamInfo);\n display_->rc = display_->streamOperator->CreateStreams(streamInfos);\n EXPECT_EQ(false, display_->rc == Camera::METHOD_NOT_SUPPORTED);\n if (display_->rc == Camera::METHOD_NOT_SUPPORTED) {\n std::cout << \"==========[test log] CreateStreams METHOD_NOT_SUPPORTED, streamId = \";\n std::cout << display_->streamId_video <<\", intent = Camera::VIDEO\" << std::endl;\n } else {\n std::cout << \"==========[test log] CreateStreams fail, rc = \" << display_->rc << std::endl;\n }\n\n display_->rc = display_->streamOperator->CommitStreams(Camera::NORMAL, nullptr);\n EXPECT_EQ(false, display_->rc == Camera::NO_ERROR);\n if (display_->rc == Camera::NO_ERROR) {\n std::cout << \"==========[test log] CommitStreams success.\" << std::endl;\n } else {\n std::cout << \"==========[test log] CommitStreams fail, rc = .\" << display_->rc << std::endl;\n }\n}"},"middle":{"kind":"string","value":"TEST_F(UtestPipelineTest, camera_ppl_0001)\n{\n std::cout << \"==========[test log] Check ppl: preview success.\" << std::endl;\n \n display_->AchieveStreamOperator();\n \n display_->intents = {Camera::PREVIEW};\n display_->StartStream(display_->intents);\n \n display_->StartCapture(display_->streamId_preview, display_->captureId_preview, false, true);\n \n display_->captureIds = {display_->captureId_preview};\n display_->streamIds = {display_->streamId_preview};\n display_->StopStream(display_->captureIds, display_->streamIds);\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"struct IWiFi *g_wifi = nullptr;\n\nconst int32_t WLAN_TX_POWER = 160;\n\nconst uint32_t WLAN_MIN_CHIPID = 0;\n\nconst uint32_t WLAN_MAX_CHIPID = 2;\n\nconst uint32_t IFNAME_MIN_NUM = 0;\n\nconst uint32_t IFNAME_MAX_NUM = 32;\n\nconst uint32_t MAX_IF_NAME_LENGTH = 16;\n\nconst uint32_t SIZE = 4;\n\n\n","file_path":"wlan/test/unittest/common/wifi_hal_test.cpp","rank":0,"score":80817.08703279891},{"content":"struct IWiFi *g_wifi = nullptr;\n\nconst int32_t USEC_TIME = 1000000;\n\nconst int32_t MSEC_TIME = 1000;\n\nconst int32_t COMMON_TIME = 3000;\n\nconst int32_t MEDIUM_TIME = 20000;\n\nconst int32_t LONG_TIME = 200000;\n\nconst int32_t WLAN_BAND_2G = 0;\n\nconst int32_t WLAN_FREQ_MAX_NUM = 14;\n\nconst int32_t WLAN_MAX_NUM_STA_WITH_AP = 4;\n\nconst uint32_t DEFAULT_COMBO_SIZE = 10;\n\nconst uint32_t RESET_TIME = 20;\n\nconst uint32_t WLAN_MIN_CHIPID = 0;\n\nconst uint32_t WLAN_MAX_CHIPID = 2;\n\n\n\nstatic int32_t g_resetStatus = -1;\n\n\n","file_path":"wlan/test/performance/common/hdf_wlan_performance_test.cpp","rank":1,"score":79850.32426108514},{"content":"struct AcmDevice * SetUpAcmDevice(void)\n\n{\n\n int32_t ret;\n\n\n\n struct AcmDevice *acmDevice = nullptr;\n\n struct UsbFnDescriptorData descData;\n\n descData.type = USBFN_DESC_DATA_TYPE_DESC;\n\n descData.descriptor = &g_acmFnDevice;\n\n acmDevice = (struct AcmDevice *)OsalMemCalloc(sizeof(*acmDevice));\n\n if (acmDevice == nullptr) {\n\n return nullptr;\n\n }\n\n acmDevice->fnDev = (struct UsbFnDevice *)UsbFnCreateDevice(\"100e0000.hidwc3_0\", &descData);\n\n if (acmDevice->fnDev == nullptr) {\n\n return nullptr;\n\n }\n\n acmDevice->port = (struct Serial *)SerialAlloc();\n\n if (acmDevice->port == nullptr) {\n\n return nullptr;\n\n }\n","file_path":"usb/test/unittest/device_sdk/usb_device_cdcacm_test.cpp","rank":2,"score":77143.47501789978},{"content":" virtual int32_t GetSequenceId() const = 0;\n\n virtual int32_t GetFenceId() const = 0;\n\n virtual EsFrameInfo GetEsFrameInfo() const = 0;\n\n virtual int32_t GetEncodeType() const = 0;\n\n virtual int32_t GetStreamId() const = 0;\n\n\n\n virtual void SetIndex(const int32_t index) = 0;\n\n virtual void SetWidth(const uint32_t width) = 0;\n\n virtual void SetHeight(const uint32_t height) = 0;\n\n virtual void SetStride(const uint32_t stride) = 0;\n\n virtual void SetFormat(const int32_t format) = 0;\n\n virtual void SetSize(const uint32_t size) = 0;\n\n virtual void SetUsage(const uint64_t usage) = 0;\n\n virtual void SetVirAddress(const void* addr) = 0;\n\n virtual void SetPhyAddress(const uint64_t addr) = 0;\n\n virtual void SetFileDescriptor(const int32_t fd) = 0;\n\n virtual void SetTimestamp(const uint64_t timestamp) = 0;\n\n virtual void SetFrameNumber(const uint64_t frameNumber) = 0;\n\n virtual void SetPoolId(const int64_t id) = 0;\n\n virtual void SetCaptureId(const int32_t id) = 0;\n","file_path":"camera/hal/include/ibuffer.h","rank":3,"score":63349.93315361182},{"content":" virtual void SetBufferStatus(const CameraBufferStatus flag) = 0;\n\n virtual void SetSequenceId(const int32_t sequence) = 0;\n\n virtual void SetFenceId(const int32_t fence) = 0;\n\n virtual void SetEncodeType(const int32_t type) = 0;\n\n virtual void SetEsFrameSize(const int32_t frameSize) = 0;\n\n virtual void SetEsTimestamp(const int64_t timeStamp) = 0;\n\n virtual void SetEsKeyFrame(const int32_t isKey) = 0;\n\n virtual void SetEsFrameNum(const int32_t frameNum) = 0;\n\n virtual void SetStreamId(const int32_t streamId) = 0;\n\n\n\n virtual void Free() = 0;\n\n\n\n virtual bool operator==(const IBuffer& u) = 0;\n\n};\n\n} // namespace OHOS::Camera\n\n#endif\n\n\n","file_path":"camera/hal/include/ibuffer.h","rank":4,"score":63349.849849742044},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_IBUFFER_H\n\n#define HOS_CAMERA_IBUFFER_H\n\n\n\n#include \"camera.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/ibuffer.h","rank":5,"score":63346.47170655384},{"content":"struct DevHandle *(*AudioSmartPaTest::BindServiceRenderSo)(const char *) = nullptr;\n\nint32_t (*AudioSmartPaTest::InterfaceLibOutputRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\n\nint32_t (*AudioSmartPaTest::InterfaceLibCtlRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\n\nvoid (*AudioSmartPaTest::CloseServiceRenderSo)(struct DevHandle *) = nullptr;\n\nvoid *AudioSmartPaTest::PtrHandle = nullptr;\n\nusing THREAD_FUNC = void *(*)(void *);\n\n\n\nvoid AudioSmartPaTest::SetUpTestCase(void)\n\n{\n\n char absPath[PATH_MAX] = {0};\n\n if (realpath(RESOLVED_PATH.c_str(), absPath) == nullptr) {\n\n return;\n\n }\n\n handleSo = dlopen(absPath, RTLD_LAZY);\n\n if (handleSo == nullptr) {\n\n return;\n\n }\n\n GetAudioManager = (TestAudioManager *(*)())(dlsym(handleSo, FUNCTION_NAME.c_str()));\n\n if (GetAudioManager == nullptr) {\n\n return;\n","file_path":"audio/test/systemtest/audio_function/audio_smartpa/src/audio_smartpa_test.cpp","rank":6,"score":63099.424477775014},{"content":"struct DevHandle *(*AudioLibRenderTest::BindServiceRenderSo)(const char *) = nullptr;\n\nint32_t (*AudioLibRenderTest::InterfaceLibOutputRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\n\nint32_t (*AudioLibRenderTest::InterfaceLibCtlRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\n\nvoid (*AudioLibRenderTest::CloseServiceRenderSo)(struct DevHandle *) = nullptr;\n\nvoid *AudioLibRenderTest::PtrHandle = nullptr;\n\n#ifdef AUDIO_MPI_SO\n\n int32_t (*AudioLibRenderTest::SdkInit)() = nullptr;\n\n void (*AudioLibRenderTest::SdkExit)() = nullptr;\n\n#endif\n\n\n\nvoid AudioLibRenderTest::SetUpTestCase(void)\n\n{\n\n#ifdef __LITEOS__\n\n char resolvedPath[] = \"/usr/lib/libhdi_audio_interface_lib_render.so\";\n\n#else\n\n char resolvedPath[] = \"//system/lib/libhdi_audio_interface_lib_render.z.so\";\n\n#endif\n\n PtrHandle = dlopen(resolvedPath, RTLD_LAZY);\n\n if (PtrHandle == nullptr) {\n\n return;\n","file_path":"audio/test/systemtest/adm_interface_lib/render/src/audio_librender_test.cpp","rank":7,"score":63099.424477775014},{"content":"struct DevHandle *(*AudioLibCaptureTest::BindServiceCaptureSo)(const char *) = nullptr;\n\nint32_t (*AudioLibCaptureTest::InterfaceLibOutputCapture)(struct DevHandle *, int,\n\n struct AudioHwCaptureParam *) = nullptr;\n\nint32_t (*AudioLibCaptureTest::InterfaceLibCtlCapture)(struct DevHandle *, int, struct AudioHwCaptureParam *) = nullptr;\n\nvoid (*AudioLibCaptureTest::CloseServiceCaptureSo)(struct DevHandle *) = nullptr;\n\n#ifdef AUDIO_MPI_SO\n\n int32_t (*AudioLibCaptureTest::SdkInit)() = nullptr;\n\n void (*AudioLibCaptureTest::SdkExit)() = nullptr;\n\n#endif\n\nvoid *AudioLibCaptureTest::PtrHandle = nullptr;\n\n\n\nvoid AudioLibCaptureTest::SetUpTestCase(void)\n\n{\n\n#ifdef __LITEOS__\n\n char resolvedPath[] = \"/usr/lib/libhdi_audio_interface_lib_capture.so\";\n\n#else\n\n char resolvedPath[] = \"//system/lib/libhdi_audio_interface_lib_capture.z.so\";\n\n#endif\n\n PtrHandle = dlopen(resolvedPath, RTLD_LAZY);\n\n if (PtrHandle == nullptr) {\n","file_path":"audio/test/systemtest/adm_interface_lib/capture/src/audio_libcapture_test.cpp","rank":8,"score":63099.424477775014},{"content":"\n\nprivate:\n\n int32_t index_ = -1;\n\n uint32_t width_ = 0;\n\n uint32_t height_ = 0;\n\n uint32_t stride_ = 0;\n\n uint32_t format_ = CAMERA_FORMAT_INVALID;\n\n uint32_t size_ = 0;\n\n uint64_t usage_ = 0;\n\n void* virAddr_ = nullptr;\n\n uint64_t phyAddr_ = 0;\n\n int32_t fd_ = -1;\n\n int32_t sourceType_ = CAMERA_BUFFER_SOURCE_TYPE_NONE;\n\n uint64_t frameNumber_ = 0;\n\n uint64_t timeStamp_ = 0;\n\n int64_t poolId_ = -1;\n\n int32_t captureId_ = -1;\n\n CameraBufferStatus status_ = CAMERA_BUFFER_STATUS_OK;\n\n int32_t sequenceId_ = -1;\n\n int32_t fenceId_ = -1;\n\n int32_t encodeType_ = 0;\n\n EsFrameInfo esInfo_ = {-1, -1, -1, -1, -1};\n\n int32_t streamId_ = -1;\n\n std::mutex l_;\n\n};\n\n} // namespace OHOS::Camera\n\n#endif\n\n\n","file_path":"camera/hal/include/image_buffer.h","rank":9,"score":62086.359061116375},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_CAMERA_DEVICE_CLIENT_INF_H\n\n#define HDI_CAMERA_DEVICE_CLIENT_INF_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"types.h\"\n\n#include \"icamera_device_callback.h\"\n\n#include \"istream_operator.h\"\n\n#include \"istream_operator_callback.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/icamera_device.h","rank":10,"score":62086.030734961714},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_STREAM_OPERATOR_CLIENT_INF_H\n\n#define HDI_STREAM_OPERATOR_CLIENT_INF_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"istream_operator_callback.h\"\n\n#include \"ioffline_stream_operator.h\"\n\n#include \"types.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/istream_operator.h","rank":11,"score":62085.983647172405},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_CAMERA_HOST_CLIENT_INF_H\n\n#define HDI_CAMERA_HOST_CLIENT_INF_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"icamera_device_callback.h\"\n\n#include \"types.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/icamera_host.h","rank":12,"score":62085.9339957456},{"content":" virtual void SetUsage(const uint64_t usage) override;\n\n virtual void SetVirAddress(const void* addr) override;\n\n virtual void SetPhyAddress(const uint64_t addr) override;\n\n virtual void SetFileDescriptor(const int32_t fd) override;\n\n virtual void SetTimestamp(const uint64_t timestamp) override;\n\n virtual void SetFrameNumber(const uint64_t frameNumber) override;\n\n virtual void SetPoolId(const int64_t id) override;\n\n virtual void SetCaptureId(const int32_t id) override;\n\n virtual void SetBufferStatus(const CameraBufferStatus flag) override;\n\n virtual void SetSequenceId(const int32_t sequence) override;\n\n virtual void SetFenceId(const int32_t fence) override;\n\n virtual void SetEncodeType(const int32_t type) override;\n\n virtual void SetEsFrameSize(const int32_t frameSize) override;\n\n virtual void SetEsTimestamp(const int64_t timeStamp) override;\n\n virtual void SetEsKeyFrame(const int32_t isKey) override;\n\n virtual void SetEsFrameNum(const int32_t frameNum) override;\n\n virtual void SetStreamId(const int32_t streamId) override;\n\n\n\n virtual void Free() override;\n\n virtual bool operator==(const IBuffer& u) override;\n","file_path":"camera/hal/include/image_buffer.h","rank":13,"score":62085.90936485609},{"content":" virtual std::shared_ptr<IBuffer> AcquireBuffer(int timeout) = 0;\n\n std::shared_ptr<IBuffer> AcquireBuffer()\n\n {\n\n return AcquireBuffer(0);\n\n }\n\n\n\n // return a buffer to pool.\n\n virtual RetCode ReturnBuffer(std::shared_ptr<IBuffer>& buffer) = 0;\n\n\n\n // enable tracking buffers of pool\n\n virtual void EnableTracking(const int32_t id) = 0;\n\n virtual void SetId(const int64_t id) = 0;\n\n virtual void NotifyStop() = 0;\n\n virtual void NotifyStart() = 0;\n\n virtual void ClearBuffers() = 0;\n\n virtual uint32_t GetIdleBufferCount() = 0;\n\n};\n\n} // namespace OHOS::Camera\n\n\n\n#endif\n","file_path":"camera/hal/include/ibuffer_pool.h","rank":14,"score":62085.27498680663},{"content":"#include <map>\n\n#include <string>\n\n\n\nnamespace OHOS::Camera {\n\nenum {\n\n INVALID_TRACKING_ID = -1,\n\n NODE_IS_EMPTY,\n\n NODE_IS_NOT_EMPTY,\n\n};\n\n\n","file_path":"camera/hal/include/buffer_trace.h","rank":15,"score":62085.11193267465},{"content":" static void ReportBufferLocation(const std::shared_ptr<BufferTrackingMessage>& message);\n\n\n\n // start a thread to tracking buffers of a stream.\n\n static void StartTracking();\n\n\n\n // stop stacking\n\n static void StopTracking();\n\n\n\n // check if there are buffers in a specific node.\n\n static int32_t IsNodeEmpty(const int32_t id, const std::string node);\n\n\n\n // check if there are buffers from beginNode to endNode.\n\n static int32_t IsNodeEmpty(const int32_t id, const std::string beginNode, const std::string endNode);\n\n\n\n static void DumpBufferTrace(const int32_t id, BufferTraceGraph& graph);\n\n};\n\n} // namespace OHOS::Camera\n\n#endif\n","file_path":"camera/hal/include/buffer_tracking.h","rank":16,"score":62084.91422456556},{"content":" virtual uint64_t GetPhyAddress() const override;\n\n virtual int32_t GetFileDescriptor() const override;\n\n virtual int32_t GetSourceType() const override;\n\n virtual uint64_t GetTimestamp() const override;\n\n virtual uint64_t GetFrameNumber() const override;\n\n virtual int64_t GetPoolId() const override;\n\n virtual int32_t GetCaptureId() const override;\n\n virtual CameraBufferStatus GetBufferStatus() const override;\n\n virtual int32_t GetSequenceId() const override;\n\n virtual int32_t GetFenceId() const override;\n\n virtual EsFrameInfo GetEsFrameInfo() const override;\n\n virtual int32_t GetEncodeType() const override;\n\n virtual int32_t GetStreamId() const override;\n\n\n\n virtual void SetIndex(const int32_t index) override;\n\n virtual void SetWidth(const uint32_t width) override;\n\n virtual void SetHeight(const uint32_t height) override;\n\n virtual void SetStride(const uint32_t stride) override;\n\n virtual void SetFormat(const int32_t format) override;\n\n virtual void SetSize(const uint32_t size) override;\n","file_path":"camera/hal/include/image_buffer.h","rank":17,"score":62084.910038309485},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_BUFFER_MANAGER_H\n\n#define HOS_CAMERA_BUFFER_MANAGER_H\n\n\n\n#include \"ibuffer_pool.h\"\n\n#include <map>\n\n#include <memory>\n\n#include <mutex>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/buffer_manager.h","rank":18,"score":62084.87872841601},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_BUFFER_TRACKING_H\n\n#define HOS_BUFFER_TRACKING_H\n\n\n\n#include \"buffer_trace.h\"\n\n#include <memory>\n","file_path":"camera/hal/include/buffer_tracking.h","rank":19,"score":62083.86495505552},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_BUFFER_TRACE_H\n\n#define HOS_CAMERA_BUFFER_TRACE_H\n\n\n\n#include \"camera.h\"\n\n#include <list>\n","file_path":"camera/hal/include/buffer_trace.h","rank":20,"score":62083.84557649773},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_IBUFFER_ALLOCATOR_H\n\n#define HOS_IBUFFER_ALLOCATOR_H\n\n\n\n#include \"camera.h\"\n\n#include \"memory\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/ibuffer_allocator.h","rank":21,"score":62083.826324104106},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_IBUFFER_POOL_H\n\n#define HOS_CAMERA_IBUFFER_POOL_H\n\n\n\n#include \"ibuffer.h\"\n\n#include <memory>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/ibuffer_pool.h","rank":22,"score":62083.78819291282},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_IMAGE_BUFFER_H\n\n#define HOS_CAMERA_IMAGE_BUFFER_H\n\n\n\n#include \"ibuffer.h\"\n\n#include <mutex>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/image_buffer.h","rank":23,"score":62083.78819291282},{"content":" * @param results Indicates the metadata for which reporting is to be disabled.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode DisableResult(const std::vector<MetaType> &results) = 0;\n\n\n\n /**\n\n * @brief Closes the camera device.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void Close() = 0;\n\n};\n\n}\n\n#endif // HDI_CAMERA_DEVICE_CLIENT_INF_H","file_path":"camera/interfaces/include/icamera_device.h","rank":24,"score":62082.93099635565},{"content":" const OHOS::sptr<IStreamOperatorCallback> &callback,\n\n OHOS::sptr<IStreamOperator> &streamOperator) = 0;\n\n\n\n /**\n\n * @brief Updates camera device control parameters.\n\n *\n\n * @param settings Indicates the camera parameters, including the sensor frame rate and 3A parameters. 3A stands for automatic focus (AF), automatic exposure (AE), and automatic white-balance (AWB).\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode UpdateSettings(const std::shared_ptr<CameraSetting> &settings) = 0;\n\n\n\n /**\n\n * @brief Sets the metadata reporting mode.\n\n *\n\n * @param mode Indicates the metadata reporting mode to set, which can be frame-by-frame reporting or reporting upon device status change. For details, see {@link ResultCallbackMode}.\n\n *\n","file_path":"camera/interfaces/include/icamera_device.h","rank":25,"score":62081.92660162625},{"content":" * @param mode Indicates the operation mode of the stream. For details, see {@link OperationMode}.\n\n * @param modeSetting Indicates the stream configuration parameters, including the frame rate and zoom information.\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode CommitStreams(OperationMode mode,\n\n const std::shared_ptr<CameraStandard::CameraMetadata> &modeSetting) = 0;\n\n\n\n /**\n\n * @brief Obtains stream attributes.\n\n *\n\n * @param attributes Indicates the obtained stream attributes.\n\n * Stream information passed by the <b>streamInfos</b> parameter in {@link CreateStreams}\n\n * may be overridden. Therefore, the stream attributes obtained by using this function may be\n\n * different from the stream information passed in {@link CreateStreams}.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n","file_path":"camera/interfaces/include/istream_operator.h","rank":26,"score":62081.891652242324},{"content":" * If the streams can be created only after the upper-layer service or application stops capturing all streams,\n\n * <b>type</b> is set to <b>RE_CONFIGURED_REQUIRED</b>.\n\n * If the streams are not supported, <b>type</b> is set to <b>NOT_SUPPORTED</b>.\n\n * This function must be called prior to {@link CreateStreams}.\n\n *\n\n * @param mode Indicates the operation mode of the streams. For details, see {@link OperationMode}.\n\n * @param modeSetting Indicates the stream configuration parameters, including the frame rate and 3A.\n\n * 3A stands for automatic focus (AF), automatic exposure (AE), and automatic white-balance (AWB).\n\n * @param info Indicates the stream configuration information. For details, see {@link StreamInfo}.\n\n * @param type Indicates the support type of the dynamically created stream.\n\n * The supported types are defined in {@link StreamSupportType}.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode IsStreamsSupported(\n\n OperationMode mode,\n","file_path":"camera/interfaces/include/istream_operator.h","rank":27,"score":62081.74166014088},{"content":" virtual CamRetCode GetCameraIds(std::vector<std::string> &cameraIds) = 0;\n\n\n\n /**\n\n * @brief Obtains the abilities of a camera device.\n\n *\n\n * @param cameraId Indicates the ID of the camera device, which can be obtained by calling {@link GetCameraIds}.\n\n *\n\n * @param ability Returns the abilities of the camera device.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode GetCameraAbility(const std::string &cameraId,\n\n std::shared_ptr<CameraAbility> &ability) = 0;\n\n\n\n /**\n\n * @brief Opens a camera device.\n\n *\n","file_path":"camera/interfaces/include/icamera_host.h","rank":28,"score":62077.93131932017},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file icamera_host.h\n\n *\n\n * @brief Management class of the camera service that provides Hardware Driver Interfaces (HDIs) for the upper layer.\n\n *\n","file_path":"camera/interfaces/include/icamera_host.h","rank":29,"score":62077.93131932017},{"content":" * Due to the limited processing capability, some devices may spend a long period of time on\n\n * algorithm processing during photographing, causing the capture requests to stack in the module.\n\n * Converting to an offline stream enables the bottom-layer device to close and\n\n * the offline stream to take over for subsequent processing.\n\n *\n\n * @param streamIds Indicates the IDs of the streams to be converted.\n\n * @param callback Indicates the callback for conversion to offline streams.\n\n * @param offlineOperator Indicates the offline stream after conversion.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode ChangeToOfflineStream(const std::vector<int> &streamIds,\n\n OHOS::sptr<IStreamOperatorCallback> &callback,\n\n OHOS::sptr<IOfflineStreamOperator> &offlineOperator) = 0;\n\n};\n\n}\n\n#endif // HDI_STREAM_OPERATOR_CLIENT_INF_H","file_path":"camera/interfaces/include/istream_operator.h","rank":30,"score":62077.93131932017},{"content":" * By calling this function, you can obtain the <b>ICameraDevice</b> instance and operate the specific camera device mapping to the instance.\n\n *\n\n * @param cameraId Indicates the ID of the camera device, which can be obtained by calling {@link GetCameraIds}.\n\n * @param callback Indicates the callback related to the camera. For details, see {@link ICameraDeviceCallback}.\n\n * @param device Indicates the <b>ICameraDevice</b> instance corresponding to the ID of the camera device.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode OpenCamera(const std::string &cameraId,\n\n const OHOS::sptr<ICameraDeviceCallback> &callback,\n\n OHOS::sptr<ICameraDevice> &device) = 0;\n\n\n\n /**\n\n * @brief Turns on or off the flash.\n\n *\n\n * This function can be used only by the caller who has opened the camera device specified by <b>cameraId</b>.\n\n *\n","file_path":"camera/interfaces/include/icamera_host.h","rank":31,"score":62077.93131932017},{"content":" * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode SetResultMode(const ResultCallbackMode &mode) = 0;\n\n\n\n /**\n\n * @brief Obtains enabled metadata.\n\n *\n\n * Metadata to be reported is enabled by calling {@link EnableResult}.\n\n *\n\n * @param results Indicates all enabled metadata.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode GetEnabledResults(std::vector<MetaType> &results) = 0;\n","file_path":"camera/interfaces/include/icamera_device.h","rank":32,"score":62077.93131932017},{"content":" * @param cameraId Indicates the ID of the camera whose flash is to be turned on or off.\n\n * @param isEnable Specifies whether to turn on or off the flash. The value <b>true</b> means to turn on the flash, and <b>false</b> means the opposite.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode SetFlashlight(const std::string &cameraId, bool &isEnable) = 0;\n\n};\n\n}\n\n#endif // HDI_CAMERA_HOST_CLIENT_INF_H","file_path":"camera/interfaces/include/icamera_host.h","rank":33,"score":62077.93131932017},{"content":" * such as the number of captured frames.\n\n * <b>enableShutterCallback_</b> in {@link CaptureInfo} is used to enable the callback for each capture.\n\n * After the callback is enabled, {@link OnFrameShutter} is called upon each capture.\n\n * In the scenario where multiple streams are captured at the same time, this module ensures that\n\n * the captured data of multiple streams is reported simultaneously.\n\n *\n\n * @param captureId Indicates the ID of the capture request. You must ensure that the ID of the\n\n * capture request is unique when the camera is started.\n\n * @param info Indicates the capture request configuration information. For details, see {@link CaptureInfo}.\n\n * @param isStreaming Specifies whether to continuously capture images.\n\n * The value <b>true</b> means to continuously capture images, and <b>false</b> means the opposite.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode Capture(int captureId,\n\n const std::shared_ptr<CaptureInfo> &info, bool isStreaming) = 0;\n","file_path":"camera/interfaces/include/istream_operator.h","rank":34,"score":62077.93131932017},{"content":"\n\n /**\n\n * @brief Cancels a capture.\n\n *\n\n * {@link OnCaptureEnded} is called when a continuous capture is canceled.\n\n *\n\n * @param captureId Indicates the ID of the capture request to cancel.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode CancelCapture(int captureId) = 0;\n\n\n\n /**\n\n * @brief Converts a specific stream to an offline stream.\n\n *\n\n * Only photographing streams can be converted into offline streams.\n","file_path":"camera/interfaces/include/istream_operator.h","rank":35,"score":62077.93131932017},{"content":"\n\n#define PIPELINE_REPORT_BUFFER_LOCATION(I, F, N) TRACKING_REPORT_BUFFER_LOCATION(I, F, N, false);\n\n\n\n#define POOL_REPORT_BUFFER_LOCATION(I, F) TRACKING_REPORT_BUFFER_LOCATION(I, F, \"\", true);\n\n\n\n#define TRACKING_REPORT_BUFFER_LOCATION(I, F, N, R) \\\n\n do { \\\n\n auto m = std::make_shared<BufferTrackingMessage>(); \\\n\n m->trackingId = I; \\\n\n m->frameNumber = F; \\\n\n m->nodeName = N; \\\n\n m->isReturnBack = R; \\\n\n BufferTracking::ReportBufferLocation(m); \\\n\n } while (0);\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/buffer_tracking.h","rank":36,"score":62077.93131932017},{"content":"\n\n /**\n\n * @brief Enables metadata reporting.\n\n *\n\n * Only metadata that is enabled can be reported by using {@link OnResult}.\n\n *\n\n * @param results Indicates the metadata for which reporting is to be enabled.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode EnableResult(const std::vector<MetaType> &results) = 0;\n\n\n\n /**\n\n * @brief Disables metadata reporting.\n\n *\n\n * After metadata reporting is disabled, the metadata is not reported by calling {@link OnResult}. To enable metadata reporting, you must call {@link EnableResult}.\n\n *\n","file_path":"camera/interfaces/include/icamera_device.h","rank":37,"score":62077.93131932017},{"content":" * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode GetStreamAttributes(\n\n std::vector<std::shared_ptr<StreamAttribute>> &attributes) = 0;\n\n\n\n /**\n\n * @brief Attaches a producer handle to a stream.\n\n *\n\n * If a producer handle has been specified during stream creation (by {@link CreateStreams}),\n\n * you do not need to call this function. If you want to attach a new procedure handle,\n\n * call {@link DetachBufferQueue} to detach the existing procedure handle and then\n\n * call this function to attach the new one.\n\n * You do not need to attach a procedure handle for IoT devices that do not support or require\n\n * image data caching and transferring of preview streams.\n\n * In this case, set <b>bufferQueue_</b> in the {@link StreamInfo} parameter of {@link CreateStreams}\n\n * to <b>null</b>,\n\n * and set <b>tunneledMode_</b> to <b>false</b>.\n","file_path":"camera/interfaces/include/istream_operator.h","rank":38,"score":62077.93131932017},{"content":" virtual CamRetCode CreateStreams(const std::vector<std::shared_ptr<StreamInfo>> &streamInfos) = 0;\n\n\n\n /**\n\n * @brief Releases streams.\n\n *\n\n * @param streamIds Indicates the IDs of the streams to release.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode ReleaseStreams(const std::vector<int> &streamIds) = 0;\n\n\n\n /**\n\n * @brief Configures a stream.\n\n *\n\n * This function must be called after {@link CreateStreams}.\n\n *\n","file_path":"camera/interfaces/include/istream_operator.h","rank":39,"score":62077.93131932017},{"content":" *\n\n * @param callback Indicates the callbacks to set.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode SetCallback(const OHOS::sptr<ICameraHostCallback> &callback) = 0;\n\n\n\n /**\n\n * @brief Obtains the IDs of available camera devices.\n\n *\n\n * @param cameraIds Indicates the IDs of available camera devices.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n","file_path":"camera/interfaces/include/icamera_host.h","rank":40,"score":62077.93131932017},{"content":" const std::shared_ptr<CameraStandard::CameraMetadata> &modeSetting,\n\n const std::vector<std::shared_ptr<StreamInfo>> &info,\n\n StreamSupportType &type) = 0;\n\n\n\n /**\n\n * @brief Creates streams.\n\n *\n\n * Before calling this function, you must use {@link IsStreamsSupported} to check whether the hardware\n\n * abstraction layer (HAL) supports the streams to create.\n\n *\n\n * @param streamInfos Indicates the list of stream information, which is defined by {@link StreamInfo}.\n\n * The passed stream information may be changed. Therefore, you can run {@link GetStreamAttributes} to\n\n * obtain the latest stream attributes after the stream is created.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n","file_path":"camera/interfaces/include/istream_operator.h","rank":41,"score":62077.93131932017},{"content":"class IBuffer {\n\npublic:\n\n virtual ~IBuffer(){};\n\n\n\n virtual int32_t GetIndex() const = 0;\n\n virtual uint32_t GetWidth() const = 0;\n\n virtual uint32_t GetHeight() const = 0;\n\n virtual uint32_t GetStride() const = 0;\n\n virtual int32_t GetFormat() const = 0;\n\n virtual uint32_t GetSize() const = 0;\n\n virtual uint64_t GetUsage() const = 0;\n\n virtual void* GetVirAddress() const = 0;\n\n virtual uint64_t GetPhyAddress() const = 0;\n\n virtual int32_t GetFileDescriptor() const = 0;\n\n virtual int32_t GetSourceType() const = 0;\n\n virtual uint64_t GetTimestamp() const = 0;\n\n virtual uint64_t GetFrameNumber() const = 0;\n\n virtual int64_t GetPoolId() const = 0;\n\n virtual int32_t GetCaptureId() const = 0;\n\n virtual CameraBufferStatus GetBufferStatus() const = 0;\n","file_path":"camera/hal/include/ibuffer.h","rank":42,"score":62077.93131932017},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode DetachBufferQueue(int streamId) = 0;\n\n\n\n /**\n\n * @brief Captures an image.\n\n *\n\n * This function must be called after {@link CommitStreams}.\n\n * There are two image capture modes: continuous capture and single capture.\n\n * A continuous capture is performed inside the module after being triggered,\n\n * and the consumer can continuously receive captured image data after calling this function only once.\n\n * If this function is called again, the current capture is stopped, the capture request configuration is updated,\n\n * and a new capture is performed.\n\n * This mode is mainly used in preview, video recording, or continuous shooting scenarios.\n\n * After a single capture is triggered, only one frame of image data is captured.\n\n * This mode applies to the single shooting scenario.\n\n * When the capture is started, {@link OnCaptureStarted} is called to notify of the start.\n\n * To stop a continuous capture, call {@link CancelCapture}.\n\n * When the capture ends, {@link OnCaptureEnded} is called to notify the caller of the information\n","file_path":"camera/interfaces/include/istream_operator.h","rank":43,"score":62077.93131932017},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file icamera_device.h\n\n *\n\n * @brief Declares APIs for camera device operations.\n\n *\n","file_path":"camera/interfaces/include/icamera_device.h","rank":44,"score":62077.93131932017},{"content":" *\n\n * @param streamId Indicates the ID of the stream to which the procedure handle is to be attached.\n\n * @param producer Indicates the producer handle to be attached.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode AttachBufferQueue(int streamId, const OHOS::sptr<OHOS::IBufferProducer> &producer) = 0;\n\n\n\n /**\n\n * @brief Detaches the producer handle from a stream.\n\n *\n\n * @param streamId Indicates the ID of the stream from which the procedure handle is to be detached.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\n\n * returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n","file_path":"camera/interfaces/include/istream_operator.h","rank":45,"score":62077.93131932017},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file istream_operator.h\n\n *\n\n * @brief Declares APIs for stream operations.\n\n *\n","file_path":"camera/interfaces/include/istream_operator.h","rank":46,"score":62077.93131932017},{"content":" running_ = false;\n\n if (consumerThread_ != nullptr) {\n\n consumerThread_->join();\n\n delete consumerThread_;\n\n }\n\n }\n\n public:\n\n std::atomic<uint64_t> shotCount_ = 0;\n\n std::mutex l_;\n\n std::condition_variable cv_;\n\n bool running_ = true;\n\n#ifdef CAMERA_BUILT_ON_OHOS_LITE\n\n std::shared_ptr<OHOS::Surface> consumer_ = nullptr;\n\n std::function<void(OHOS::SurfaceBuffer*)> callback_ = nullptr;\n\n#else\n\n OHOS::sptr<OHOS::Surface> consumer_ = nullptr;\n\n std::function<void(void*, uint32_t)> callback_ = nullptr;\n\n#endif\n\n std::thread* consumerThread_ = nullptr;\n\n };\n\n};\n\n\n","file_path":"camera/hal/test/mpi/include/common.h","rank":47,"score":60877.352085204286},{"content":"#include <iostream>\n\n#include <climits>\n\n#include <sys/stat.h>\n\n#include <fcntl.h>\n\n#include <unistd.h>\n\n#include <sys/ioctl.h>\n\n#include <sys/wait.h>\n\n#include <thread>\n\n#include <stdio.h>\n\n#include <sys/time.h>\n\n#include <vector>\n\n#include <map>\n\n#include \"utils.h\"\n\n#include \"camera.h\"\n\n#include \"camera_host.h\"\n\n#include \"types.h\"\n\n#include <surface.h>\n\n#include \"idevice_manager.h\"\n\n#include \"camera_metadata_info.h\"\n\n#include \"ibuffer.h\"\n","file_path":"camera/hal/test/mpi/include/common.h","rank":48,"score":60871.77061370636},{"content":"#include <display_type.h>\n\n#include <hdf_log.h>\n\n#include <osal_mem.h>\n\n#include \"securec.h\"\n\n#include \"icamera_host.h\"\n\n#include \"icamera_device.h\"\n\n#include \"istream_operator.h\"\n\n#include \"ioffline_stream_operator.h\"\n\n#include \"camera_host_callback.h\"\n\n#include \"camera_device_callback.h\"\n\n#include \"stream_operator_callback.h\"\n\n#include \"video_key_info.h\"\n\n#include \"type_common.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/test/mpi/include/common.h","rank":49,"score":60871.62060719702},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_STREAM_OPERATOR_CALLBACK_SERVER_H\n\n#define HDI_STREAM_OPERATOR_CALLBACK_SERVER_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"types.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/istream_operator_callback.h","rank":50,"score":60871.28254813265},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_CAMERA_DEVICE_CALLBACK_SERVER_H\n\n#define HDI_CAMERA_DEVICE_CALLBACK_SERVER_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"types.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/icamera_device_callback.h","rank":51,"score":60871.28254813265},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_CAMERA_HOST_CALLBACK_SERVER_H\n\n#define HDI_CAMERA_HOST_CALLBACK_SERVER_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"types.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/icamera_host_callback.h","rank":52,"score":60871.28254813265},{"content":" * @since 1.0\n\n * @version 1.0\n\n */\n\n\n\n#ifndef HDI_OFFLINE_STREAM_OPERATOR_CLIENT_INF_H\n\n#define HDI_OFFLINE_STREAM_OPERATOR_CLIENT_INF_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include \"types.h\"\n\n#include \"icamera_interface.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/interfaces/include/ioffline_stream_operator.h","rank":53,"score":60871.25942213042},{"content":" OHOS::sptr<StreamOperatorCallback> streamOperatorCallback = nullptr;\n\n OHOS::sptr<CameraHostCallback> hostCallback = nullptr;\n\n OHOS::sptr<CameraDeviceCallback> deviceCallback = nullptr;\n\n OHOS::sptr<IStreamOperator> streamOperator = nullptr;\n\n OHOS::sptr<Camera::IOfflineStreamOperator> offlineStreamOperator = nullptr;\n\n OHOS::sptr<IStreamOperatorCallback> offlineStreamOperatorCallback = nullptr;\n\n\n\n std::shared_ptr<OHOS::Camera::CaptureInfo> captureInfo = nullptr;\n\n std::vector<std::shared_ptr<OHOS::Camera::StreamInfo>> streamInfos;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo2 = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo_pre = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo_video = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo_capture = nullptr;\n\n std::vector<std::string> cameraIds;\n\n int streamId_preview = 1000;\n\n int streamId_preview_double = 1001;\n\n int streamId_capture = 1010;\n\n int streamId_video = 1020;\n\n int captureId_preview = 2000;\n","file_path":"camera/hal/test/mpi/include/common.h","rank":54,"score":60870.67930468062},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HDI_SAMPLE_CLIENT_CPP_INF_H\n\n#define HDI_SAMPLE_CLIENT_CPP_INF_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <hdf_log.h>\n\n#include <iservmgr_hdi.h>\n\n\n\nnamespace OHOS {\n\nnamespace HDI {\n\nnamespace WLAN {\n\nnamespace V1_0 {\n\n\n","file_path":"wlan/hdi_service/include/Iwifi_hal.h","rank":55,"score":60870.47601809776},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_BUFFER_ALLOCATOR_UTILS_H\n\n#define HOS_BUFFER_ALLOCATOR_UTILS_H\n\n\n\n#include \"camera.h\"\n\n#include \"ibuffer.h\"\n\n#include \"ibuffer_allocator.h\"\n\n#include <memory>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/include/buffer_allocator_utils.h","rank":56,"score":60870.29253798874},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n#ifndef CAMERA_TEST_COMMON_H\n\n#define CAMERA_TEST_COMMON_H\n\n\n\n#include <stdlib.h>\n\n#include <limits.h>\n\n#include <gtest/gtest.h>\n","file_path":"camera/hal/test/mpi/include/common.h","rank":57,"score":60869.95820300638},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_ICONTROLLER_H\n\n#define HOS_CAMERA_ICONTROLLER_H\n\n\n\n#include \"device_manager_adapter.h\"\n\n#include <mutex>\n\n#include <string>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/device_manager/include/icontroller.h","rank":58,"score":60869.89442555645},{"content":" int captureId_preview_double = 2001;\n\n int captureId_capture = 3000;\n\n int captureId_video = 4000;\n\n std::vector<int> captureIds;\n\n std::vector<int> streamIds;\n\n std::vector<Camera::StreamIntent> intents;\n\n OHOS::Camera::CamRetCode rc;\n\n\n\n#ifdef CAMERA_BUILT_ON_OHOS_LITE\n\n std::shared_ptr<OHOS::Camera::CameraHost> service = nullptr;\n\n std::shared_ptr<ICameraDevice> cameraDevice = nullptr;\n\n#else\n\n OHOS::sptr<OHOS::Camera::ICameraHost> service = nullptr;\n\n OHOS::sptr<ICameraDevice> cameraDevice = nullptr;\n\n#endif\n\n std::shared_ptr<CameraAbility> ability = nullptr;\n\n\n\n bool status;\n\n bool onCameraStatusFlag;\n\n bool onFlashlightStatusFlag;\n\n bool onErrorFlag;\n\n bool onResultFlag;\n\n bool captureStartFlag;\n\n bool captureEndFlag;\n\n bool captureErrorFlag;\n\n bool frameShutterFlag;\n\n int previewBufCnt = 0;\n\n int32_t videoFd = -1;\n","file_path":"camera/hal/test/mpi/include/common.h","rank":59,"score":60869.88336579769},{"content":" return RC_OK;\n\n };\n\n virtual void SetAbilityMetaDataTag(std::vector<int32_t> abilityMetaDataTag) {};\n\n virtual void SetAbilityMetaDataTag(std::vector<int32_t> abilityMetaDataTag, std::string hardwareName) {};\n\n virtual RetCode GetAbilityMetaData(std::shared_ptr<CameraStandard::CameraMetadata> meta)\n\n {\n\n return RC_OK;\n\n };\n\n virtual RetCode GetAbilityMetaData(std::shared_ptr<CameraStandard::CameraMetadata> meta, std::string hardwareName)\n\n {\n\n return RC_OK;\n\n };\n\n virtual bool GetMetaDataFlag()\n\n {\n\n return false;\n\n };\n\n virtual void SetMetaDataFlag(bool metaDataFlag) {};\n\n\n\nprivate:\n\n ManagerId managerID_;\n\n};\n\n} // namespace OHOS::Camera\n\n#endif","file_path":"camera/hal/device_manager/include/imanager.h","rank":60,"score":60869.53417326704},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_ISENSOR_H\n\n#define HOS_CAMERA_ISENSOR_H\n\n\n\n#include \"device_manager_adapter.h\"\n\n#include <string>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/device_manager/include/isensor.h","rank":61,"score":60869.202002485545},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_IMANAGER_H\n\n#define HOS_CAMERA_IMANAGER_H\n\n\n\n#include \"icontroller.h\"\n\n#include \"device_manager_adapter.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/device_manager/include/imanager.h","rank":62,"score":60869.202002485545},{"content":" * @param captureId Indicates the ID of the capture request corresponding to the callback.\n\n * @param infos Indicates information related to the capture when it ends.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void OnCaptureEnded(int32_t captureId,\n\n const std::vector<std::shared_ptr<CaptureEndedInfo>> &infos) = 0;\n\n\n\n /**\n\n * @brief Called when an error occurs during the capture.\n\n *\n\n * @param captureId Indicates the ID of the capture request corresponding to the callback.\n\n * @param infos Indicates a list of capture error messages.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void OnCaptureError(int32_t captureId,\n\n const std::vector<std::shared_ptr<CaptureErrorInfo>> &infos) = 0;\n","file_path":"camera/interfaces/include/istream_operator_callback.h","rank":63,"score":60869.16792658114},{"content":" test_->captureErrorFlag = true;\n\n }\n\n virtual void OnFrameShutter(int32_t captureId,\n\n const std::vector<int32_t> &streamId, uint64_t timestamp) override\n\n {\n\n test_->frameShutterFlag = true;\n\n }\n\n};\n\n}\n\n#endif\n","file_path":"camera/hal/test/mpi/include/common.h","rank":64,"score":60869.00252428402},{"content":" *\n\n * @param timestamp Indicates the timestamp when the metadata is reported.\n\n * @param result Indicates the metadata reported. The reported metadata is specified by {@link EnableResult}.\n\n * You can call {@link GetEnabledResults} to obtain enabled metadata and\n\n * call {@link DisableResult} to disable metadata reporting.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void OnResult(uint64_t timestamp, const std::shared_ptr<CameraStandard::CameraMetadata> &result) = 0;\n\n};\n\n}\n\n#endif // HDI_CAMERA_DEVICE_CALLBACK_SERVER_H","file_path":"camera/interfaces/include/icamera_device_callback.h","rank":65,"score":60868.13276707636},{"content":"\n\n /**\n\n * @brief Called when a frame is captured.\n\n *\n\n * This callback is enabled by using <b>enableShutterCallback_</b> in the {@link CaptureInfo} parameter of {@link Capture}.\n\n * When <b>enableShutterCallback_</b> is set to <b>true</b>,\n\n * this callback is triggered each time a frame is captured.\n\n *\n\n * @param captureId Indicates the ID of the capture request corresponding to the callback.\n\n * @param streamIds Indicates the IDs of the streams corresponding to the callback.\n\n * @param timestamp Indicates the timestamp when the callback is invoked.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void OnFrameShutter(int32_t captureId,\n\n const std::vector<int32_t> &streamIds, uint64_t timestamp) = 0;\n\n};\n\n}\n\n#endif // HDI_STREAM_OPERATOR_CALLBACK_SERVER_H\n","file_path":"camera/interfaces/include/istream_operator_callback.h","rank":66,"score":60867.73696459509},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file icamera_host_callback.h\n\n *\n\n * @brief Declares callbacks for status changes of cameras and flashes. The caller needs to implement the callbacks.\n\n *\n","file_path":"camera/interfaces/include/icamera_host_callback.h","rank":67,"score":60863.34512889289},{"content":" return RC_OK;\n\n };\n\n virtual RetCode CreateController(ControllerId controllerId, std::string hardwareName)\n\n {\n\n return RC_OK;\n\n };\n\n virtual RetCode PowerUp(CameraId cameraId)\n\n {\n\n return RC_OK;\n\n };\n\n virtual RetCode PowerDown(CameraId cameraId)\n\n {\n\n return RC_OK;\n\n };\n\n virtual RetCode PowerUp(std::string hardwareName)\n\n {\n\n return RC_OK;\n\n };\n\n virtual RetCode PowerDown(std::string hardwareName)\n\n {\n","file_path":"camera/hal/device_manager/include/imanager.h","rank":68,"score":60863.34512889289},{"content":"\n\n // flush the buffer\n\n static RetCode FlushCache(std::shared_ptr<IBuffer>& buffer);\n\n\n\n // invalidate the cache, update cache from memory\n\n static RetCode InvalidateCache(std::shared_ptr<IBuffer>& buffer);\n\nprivate:\n\n static std::shared_ptr<IBufferAllocator> GetBufferAllocator(const int32_t source);\n\n};\n\n} // namespace OHOS::Camera\n\n#endif\n","file_path":"camera/hal/include/buffer_allocator_utils.h","rank":69,"score":60863.34512889289},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file icamera_device_callback.h\n\n *\n\n * @brief Declares callbacks for reporting camera device errors and metadata.\n\n *\n","file_path":"camera/interfaces/include/icamera_device_callback.h","rank":70,"score":60863.34512889289},{"content":"class IBuffer;\n","file_path":"camera/hal/include/ibuffer_allocator.h","rank":71,"score":60863.34512889289},{"content":" virtual int32_t getNetworkIfaceName(std::shared_ptr<WifiFeatureInfo> ifeature) = 0;\n\n virtual int32_t getFeatureType(std::shared_ptr<WifiFeatureInfo> ifeature) = 0;\n\n virtual int32_t setMacAddress(std::shared_ptr<WifiFeatureInfo> ifeature, std::vector<uint8_t>& mac) = 0;\n\n virtual int32_t getDeviceMacAddress(std::shared_ptr<WifiFeatureInfo> ifeature, std::vector<uint8_t>& mac,\n\n uint8_t len) = 0;\n\n virtual int32_t getFreqsWithBand(std::shared_ptr<WifiFeatureInfo> ifeature, int32_t band,\n\n std::vector<int32_t> freq, uint32_t count, uint32_t& num) = 0;\n\n virtual int32_t setTxPower(std::shared_ptr<WifiFeatureInfo> ifeature, int32_t power) = 0;\n\n virtual int32_t getChipId(std::shared_ptr<WifiFeatureInfo> ifeature, uint8_t& chipId) = 0;\n\n virtual int32_t getIfNamesByChipId(const uint8_t chipId, std::string& ifNames, uint32_t& num) = 0;\n\n virtual int32_t setScanningMacAddress(std::shared_ptr<WifiFeatureInfo> ifeature, std::vector<uint8_t>& scanMac,\n\n uint8_t len) = 0;\n\n};\n\n\n\n}\n\n}\n\n}\n\n}\n\n\n\n#endif","file_path":"wlan/hdi_service/include/Iwifi_hal.h","rank":72,"score":60863.34512889289},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file istream_operator_callback.h\n\n *\n\n * @brief Declares callbacks related to {@link IStreamOperator}. The caller needs to implement these callbacks.\n\n *\n","file_path":"camera/interfaces/include/istream_operator_callback.h","rank":73,"score":60863.34512889289},{"content":" *\n\n * @param streamIds Indicates the IDs of the offline streams to release.\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode ReleaseStreams(const std::vector<int> &streamIds) = 0;\n\n\n\n /**\n\n * @brief Releases all offline streams.\n\n *\n\n *\n\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\n\n *\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual CamRetCode Release() = 0;\n\n};\n\n}\n\n#endif // HDI_OFFLINE_STREAM_OPERATOR_CLIENT_INF_H","file_path":"camera/interfaces/include/ioffline_stream_operator.h","rank":74,"score":60863.34512889289},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n/**\n\n * @file ioffline_stream_operator.h\n\n *\n\n * @brief Declares APIs for offline stream operations.\n\n *\n","file_path":"camera/interfaces/include/ioffline_stream_operator.h","rank":75,"score":60863.34512889289},{"content":" CameraHost& operator=(CameraHost&& other) = delete;\n\n\n\nprivate:\n\n CamRetCode Init();\n\n\n\nprivate:\n\n void* handler_ = nullptr;\n\n CameraHostCIF* host_ = nullptr;\n\n};\n\n} // end namespace OHOS::Camera\n\n#endif // CAMERA_HOST_CAMERA_HOST_H\n","file_path":"camera/hal_c/hdi_cif/include/camera_host.h","rank":76,"score":59707.59859481342},{"content":" return nullptr;\n\n };\n\n virtual RetCode PowerUp(CameraId cameraId) = 0;\n\n virtual RetCode PowerDown(CameraId cameraId) = 0;\n\n virtual RetCode Init() = 0;\n\n virtual std::shared_ptr<ISensor> GetSensor(CameraId cameraId) = 0;\n\n virtual std::vector<CameraId> GetCameraId() = 0;\n\n virtual RetCode Connect(std::string controller,\n\n std::string portNum, std::string connectController, std::string connectPortNum)\n\n {\n\n (void)controller;\n\n (void)portNum;\n\n (void)connectController;\n\n (void)connectPortNum;\n\n return RC_OK;\n\n };\n\n virtual RetCode UnConnect(std::string controller,\n\n std::string portNum, std::string connectController, std::string connectPortNum)\n\n {\n\n (void)controller;\n","file_path":"camera/hal/device_manager/include/idevice_manager.h","rank":77,"score":59706.130872675945},{"content":"#include \"ibuffer.h\"\n\n#include <algorithm>\n\n#include <assert.h>\n\n#include <errno.h>\n\n#include <getopt.h>\n\n#include <linux/fb.h>\n\n#include <linux/videodev2.h>\n\n#include <mutex>\n\n#include <pthread.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <sys/mman.h>\n\n#include <sys/stat.h>\n\n#include <sys/time.h>\n\n#include <vector>\n\n#include <iostream>\n\n#include <cstring>\n\n#include <cerrno>\n\n#include <securec.h>\n\n#include <surface_buffer.h>\n\n#include <ibuffer_producer.h>\n\n#include <fstream>\n\n#define PATH_MAX 128\n\n#define BUFFERSCOUNT 8\n\n#define CAMERA_BUFFER_QUEUE_IPC 654320\n\n#define RANGE_LIMIT(x) (x > 255 ? 255 : (x < 0 ? 0 : x))\n\n\n","file_path":"camera/hal/test/v4l2/include/test_display.h","rank":78,"score":59703.76771367318},{"content":"#include \"stream_operator.h\"\n\n#include \"camera_device.h\"\n\n#include \"utils.h\"\n\n#include <thread>\n\n#include <map>\n\n#include <stdio.h>\n\n#include <climits>\n\n#include \"types.h\"\n\n#include \"camera_device_impl.h\"\n\n#include \"stream_operator_impl.h\"\n\n#include \"idevice_manager.h\"\n\n#include \"camera_metadata_info.h\"\n\n#include <display_type.h>\n\n#include <fcntl.h>\n\n#include <unistd.h>\n\n#include <sys/ioctl.h>\n\n#include <sys/wait.h>\n\n#include \"buffer_queue_producer.h\"\n\n#include \"buffer_manager.h\"\n\n#include \"test_stream_operator_impl.h\"\n","file_path":"camera/hal/test/v4l2/include/test_display.h","rank":79,"score":59703.76132911076},{"content":"#include \"Iwifi_hal.h\"\n\n#include <iremote_proxy.h>\n\n#include <hdf_log.h>\n\n#include <iservmgr_hdi.h>\n\n#include <ipc_object_stub.h>\n\n\n\nnamespace OHOS {\n\nnamespace HDI {\n\nnamespace WLAN {\n\nnamespace V1_0 {\n\n\n","file_path":"wlan/hdi_service/include/wlan_hal_proxy.h","rank":80,"score":59703.27748510421},{"content":" void ProcessImage(const unsigned char* p, unsigned char* fbp);\n\n void LcdDrawScreen(unsigned char* displayBuf_, unsigned char* addr);\n\n void BufferCallback(std::shared_ptr<SurfaceBuffer> buffer, int choice);\n\n void Init();\n\n void UsbInit();\n\n void Close();\n\n void OpenCamera();\n\n void AchieveStreamOperator();\n\n void StartStream(std::vector<OHOS::Camera::StreamIntent> intents);\n\n void StopStream(std::vector<int>& captureIds, std::vector<int>& streamIds);\n\n void StartCapture(int streamId, int captureId, bool shutterCallback, bool isStreaming);\n\n float calTime(struct timeval start, struct timeval end);\n\n};\n\n#endif","file_path":"camera/hal/test/v4l2/include/test_display.h","rank":81,"score":59703.27624368714},{"content":" (void)portNum;\n\n (void)connectController;\n\n (void)connectPortNum;\n\n return RC_OK;\n\n };\n\n virtual void BufferCallback(std::shared_ptr<FrameSpec> buffer)\n\n {\n\n (void)buffer;\n\n return;\n\n };\n\n virtual void SetAbilityMetaDataTag(std::vector<int32_t> abilityMetaDataTag)\n\n {\n\n (void)abilityMetaDataTag;\n\n return;\n\n };\n\n virtual RetCode SendFrameBuffer(std::shared_ptr<FrameSpec> buffer, CameraId cameraId = CAMERA_MAX)\n\n {\n\n (void)buffer;\n\n (void)cameraId;\n\n return RC_OK;\n","file_path":"camera/hal/device_manager/include/idevice_manager.h","rank":82,"score":59703.25733890847},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef I_NODE_H\n\n#define I_NODE_H\n\n#include <string>\n\n#include <thread>\n\n#include <list>\n\n#include \"stream_pipeline_data_structure.h\"\n\n#include \"object_factory.h\"\n\n#include \"no_copyable.h\"\n\n#include \"ibuffer.h\"\n\n#include \"ibuffer_pool.h\"\n\n#include \"camera_metadata_info.h\"\n\n#include <functional>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/pipeline_core/nodes/include/inode.h","rank":83,"score":59703.22315970012},{"content":" };\n\n virtual void SetNodeCallBack(const NodeBufferCb cb, CameraId cameraId = CAMERA_MAX)\n\n {\n\n (void)cb;\n\n (void)cameraId;\n\n return;\n\n };\n\n virtual void SetMetaDataCallBack(const MetaDataCb cb, CameraId cameraId = CAMERA_MAX)\n\n {\n\n (void)cb;\n\n (void)cameraId;\n\n return;\n\n };\n\n virtual void SetDevStatusCallBack(const DeviceStatusCb cb)\n\n {\n\n (void)cb;\n\n return;\n\n };\n\n virtual RetCode SetFlashlight(FlashMode flashMode, bool enable, CameraId cameraId = CAMERA_MAX) = 0;\n\n virtual void Configure(std::shared_ptr<CameraStandard::CameraMetadata> meta) = 0;\n","file_path":"camera/hal/device_manager/include/idevice_manager.h","rank":84,"score":59703.13689694335},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_BUFFER_POOL_H\n\n#define HOS_CAMERA_BUFFER_POOL_H\n\n\n\n#include \"buffer_allocator_factory.h\"\n\n#include \"ibuffer.h\"\n\n#include \"ibuffer_pool.h\"\n\n#include <condition_variable>\n\n#include <list>\n\n#include <memory>\n\n#include <mutex>\n\n#include <utility>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/buffer_manager/include/buffer_pool.h","rank":85,"score":59703.027371899436},{"content":" virtual void SetHotplugDevCallBack(HotplugDevCb cb)\n\n {\n\n (void)cb;\n\n return;\n\n };\n\n virtual RetCode PreConfig(const ModeMeta& meta, const std::vector<DeviceStreamSetting>& settings)\n\n {\n\n (void)meta;\n\n (void)settings;\n\n return RC_OK;\n\n }\n\n virtual RetCode Flush(int32_t streamId)\n\n {\n\n (void)streamId;\n\n return RC_OK;\n\n }\n\n virtual RetCode StartRecvFrame(int32_t streamId)\n\n {\n\n (void)streamId;\n\n return RC_OK;\n","file_path":"camera/hal/device_manager/include/idevice_manager.h","rank":86,"score":59702.991177019554},{"content":" }\n\n virtual RetCode StopRecvFrame(int32_t streamId)\n\n {\n\n (void)streamId;\n\n return RC_OK;\n\n }\n\n virtual void SetSendflag(bool flag)\n\n {\n\n (void)flag;\n\n return;\n\n }\n\n};\n\n} // namespace OHOS::Camera\n\n#endif\n","file_path":"camera/hal/device_manager/include/idevice_manager.h","rank":87,"score":59702.76202855506},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef I_PIPELINE_CORE_H\n\n#define I_PIPELINE_CORE_H\n\n\n\n#include <stdint.h>\n\n#include <cstdio>\n\n#include \"istream_pipeline_core.h\"\n\n#include \"no_copyable.h\"\n\n#include \"idevice_manager.h\"\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/pipeline_core/include/ipipeline_core.h","rank":88,"score":59702.619867320594},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_CAMERA_IDEVICED_MANAGER_H\n\n#define HOS_CAMERA_IDEVICED_MANAGER_H\n\n\n\n#include \"icontroller.h\"\n\n#include \"imanager.h\"\n\n#include \"device_manager_adapter.h\"\n\n#include \"isensor.h\"\n\n#include <vector>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/device_manager/include/idevice_manager.h","rank":89,"score":59702.58525116059},{"content":" std::vector<std::shared_ptr<OHOS::Camera::StreamInfo>> streamInfos;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfoPre = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfoVideo = nullptr;\n\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfoCapture = nullptr;\n\n std::shared_ptr<IBufferProducer> producer = nullptr;\n\n std::shared_ptr<IBufferProducer> producerCapture = nullptr;\n\n std::shared_ptr<IBufferProducer> producerVideo = nullptr;\n\n std::shared_ptr<OHOS::Camera::CameraHost> cameraHost = nullptr;\n\n std::shared_ptr<OHOS::Camera::ICameraDevice> cameraDevice = nullptr;\n\n std::shared_ptr<CameraAbility> ability = nullptr;\n\n std::vector<int> captureIds;\n\n std::vector<std::string> cameraIds;\n\n std::vector<int> streamIds;\n\n std::vector<OHOS::Camera::StreamIntent> intents;\n\n enum {\n\n streamId_preview = 1000, // 1000:preview streamID\n\n streamId_capture,\n\n streamId_video,\n\n captureId_preview = 2000, // 2000:preview captureId\n","file_path":"camera/hal/test/v4l2/include/test_display.h","rank":90,"score":59702.57177291322},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef OHOS_CAMERA_METADATA_UTILS_H\n\n#define OHOS_CAMERA_METADATA_UTILS_H\n\n\n\n#include <list>\n\n#include <map>\n\n#include <vector>\n\n#include <iostream>\n\n#include \"camera_metadata_info.h\"\n\n\n\nnamespace OHOS {\n\nnamespace CameraStandard {\n","file_path":"camera/hal/utils/metadata/include/metadata_utils.h","rank":91,"score":59702.56235690794},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef CAMERA_DEVICE_CAMERA_DEVICE_H\n\n#define CAMERA_DEVICE_CAMERA_DEVICE_H\n\n\n\n#include \"camera_device_c_if.h\"\n\n#include \"camera_metadata_c_if.h\"\n\n#include \"camera_types_c_if.h\"\n\n#include \"icamera_device.h\"\n\n#include \"camera_device_stub.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal_c/hdi_cif/include/camera_device.h","rank":92,"score":59702.5396075817},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef CAMERA_HOST_CAMERA_HOST_H\n\n#define CAMERA_HOST_CAMERA_HOST_H\n\n\n\n#include \"camera_host_c_if.h\"\n\n#include \"camera_device_c_if.h\"\n\n#include \"icamera_host_callback.h\"\n\n#include \"icamera_device_callback.h\"\n\n#include \"icamera_device.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal_c/hdi_cif/include/camera_host.h","rank":93,"score":59702.52828683661},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HOS_BUFFER_ALLOCATOR_H\n\n#define HOS_BUFFER_ALLOCATOR_H\n\n\n\n#include \"buffer_allocator_factory.h\"\n\n#include \"ibuffer.h\"\n\n#include \"ibuffer_allocator.h\"\n\n#include <memory>\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal/buffer_manager/include/buffer_allocator.h","rank":94,"score":59702.32227222425},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef HDI_PARCEL_UTILS_V1_0_H \n\n#define HDI_PARCEL_UTILS_V1_0_H\n\n\n\n#include <message_parcel.h>\n\n#include \"hdf_sbuf_ipc.h\"\n\n#include \"display_type.h\"\n\n#include \"hdf_log.h\"\n\n\n\nnamespace OHOS {\n\nnamespace HDI {\n\nnamespace Display {\n\nnamespace V1_0 {\n","file_path":"display/hdi_service/gralloc/include/parcel_utils.h","rank":95,"score":59702.2043691727},{"content":" virtual void DeliverBuffers(std::vector<std::shared_ptr<IBuffer>>& buffers) = 0;\n\n virtual void SetCallBack(BufferCb c) = 0;\n\n\n\n virtual RetCode ProvideBuffers(std::shared_ptr<FrameSpec> frameSpec) = 0;\n\n virtual void DeliverBuffers(std::shared_ptr<FrameSpec> frameSpec) = 0;\n\n virtual void DeliverBuffers(std::vector<std::shared_ptr<FrameSpec>> mergeVec) = 0;\n\n};\n\n\n\n\n\nusing NodeFactory = RegisterFactoty<INode, const std::string&, const std::string&>;\n\n\n\n#define REGISTERNODE(cls, ...) \\\n\nnamespace { \\\n\n static std::string g_##cls = NodeFactory::Instance().DoRegister<cls>(__VA_ARGS__, \\\n\n [](const std::string& name, const std::string& type) {return std::make_shared<cls>(name, type);}); \\\n\n}\n\n}\n\n#endif\n","file_path":"camera/hal/pipeline_core/nodes/include/inode.h","rank":96,"score":59702.14827709708},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef TEST_DISPLAY_H\n\n#define TEST_DISPLAY_H\n\n#include <gtest/gtest.h>\n\n#include \"camera.h\"\n\n#include \"camera_host.h\"\n","file_path":"camera/hal/test/v4l2/include/test_display.h","rank":97,"score":59702.004076162},{"content":"/*\n\n * Copyright (c) 2021 Huawei Device Co., Ltd.\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef STREAM_OPERATOR_STREAM_OPERATOR_H\n\n#define STREAM_OPERATOR_STREAM_OPERATOR_H\n\n\n\n#include \"istream_operator.h\"\n\n#include \"stream_operator_c_if.h\"\n\n#include \"stream_operator_stub.h\"\n\n\n\nnamespace OHOS::Camera {\n","file_path":"camera/hal_c/hdi_cif/include/stream_operator.h","rank":98,"score":59701.86160074956},{"content":" *\n\n * @param handle Indicates the reference to the buffer of the memory to map.\n\n *\n\n * @return Returns the pointer to a valid address if the operation is successful; returns <b>NULL</b> otherwise.\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void *Mmap(const BufferHandle &handle) const = 0;\n\n\n\n /**\n\n * @brief Maps memory to memory with cache in the process's address space.\n\n *\n\n * @param handle Indicates the reference to the buffer of the memory to map.\n\n *\n\n * @return Returns the pointer to a valid address if the operation is successful; returns <b>NULL</b> otherwise.\n\n * @since 1.0\n\n * @version 1.0\n\n */\n\n virtual void *MmapCache(const BufferHandle &buffer) const = 0;\n\n\n","file_path":"display/hdi_service/gralloc/include/idisplay_gralloc.h","rank":99,"score":59701.53527654348}],"string":"[\n {\n \"content\": \"struct IWiFi *g_wifi = nullptr;\\n\\nconst int32_t WLAN_TX_POWER = 160;\\n\\nconst uint32_t WLAN_MIN_CHIPID = 0;\\n\\nconst uint32_t WLAN_MAX_CHIPID = 2;\\n\\nconst uint32_t IFNAME_MIN_NUM = 0;\\n\\nconst uint32_t IFNAME_MAX_NUM = 32;\\n\\nconst uint32_t MAX_IF_NAME_LENGTH = 16;\\n\\nconst uint32_t SIZE = 4;\\n\\n\\n\",\n \"file_path\": \"wlan/test/unittest/common/wifi_hal_test.cpp\",\n \"rank\": 0,\n \"score\": 80817.08703279891\n },\n {\n \"content\": \"struct IWiFi *g_wifi = nullptr;\\n\\nconst int32_t USEC_TIME = 1000000;\\n\\nconst int32_t MSEC_TIME = 1000;\\n\\nconst int32_t COMMON_TIME = 3000;\\n\\nconst int32_t MEDIUM_TIME = 20000;\\n\\nconst int32_t LONG_TIME = 200000;\\n\\nconst int32_t WLAN_BAND_2G = 0;\\n\\nconst int32_t WLAN_FREQ_MAX_NUM = 14;\\n\\nconst int32_t WLAN_MAX_NUM_STA_WITH_AP = 4;\\n\\nconst uint32_t DEFAULT_COMBO_SIZE = 10;\\n\\nconst uint32_t RESET_TIME = 20;\\n\\nconst uint32_t WLAN_MIN_CHIPID = 0;\\n\\nconst uint32_t WLAN_MAX_CHIPID = 2;\\n\\n\\n\\nstatic int32_t g_resetStatus = -1;\\n\\n\\n\",\n \"file_path\": \"wlan/test/performance/common/hdf_wlan_performance_test.cpp\",\n \"rank\": 1,\n \"score\": 79850.32426108514\n },\n {\n \"content\": \"struct AcmDevice * SetUpAcmDevice(void)\\n\\n{\\n\\n int32_t ret;\\n\\n\\n\\n struct AcmDevice *acmDevice = nullptr;\\n\\n struct UsbFnDescriptorData descData;\\n\\n descData.type = USBFN_DESC_DATA_TYPE_DESC;\\n\\n descData.descriptor = &g_acmFnDevice;\\n\\n acmDevice = (struct AcmDevice *)OsalMemCalloc(sizeof(*acmDevice));\\n\\n if (acmDevice == nullptr) {\\n\\n return nullptr;\\n\\n }\\n\\n acmDevice->fnDev = (struct UsbFnDevice *)UsbFnCreateDevice(\\\"100e0000.hidwc3_0\\\", &descData);\\n\\n if (acmDevice->fnDev == nullptr) {\\n\\n return nullptr;\\n\\n }\\n\\n acmDevice->port = (struct Serial *)SerialAlloc();\\n\\n if (acmDevice->port == nullptr) {\\n\\n return nullptr;\\n\\n }\\n\",\n \"file_path\": \"usb/test/unittest/device_sdk/usb_device_cdcacm_test.cpp\",\n \"rank\": 2,\n \"score\": 77143.47501789978\n },\n {\n \"content\": \" virtual int32_t GetSequenceId() const = 0;\\n\\n virtual int32_t GetFenceId() const = 0;\\n\\n virtual EsFrameInfo GetEsFrameInfo() const = 0;\\n\\n virtual int32_t GetEncodeType() const = 0;\\n\\n virtual int32_t GetStreamId() const = 0;\\n\\n\\n\\n virtual void SetIndex(const int32_t index) = 0;\\n\\n virtual void SetWidth(const uint32_t width) = 0;\\n\\n virtual void SetHeight(const uint32_t height) = 0;\\n\\n virtual void SetStride(const uint32_t stride) = 0;\\n\\n virtual void SetFormat(const int32_t format) = 0;\\n\\n virtual void SetSize(const uint32_t size) = 0;\\n\\n virtual void SetUsage(const uint64_t usage) = 0;\\n\\n virtual void SetVirAddress(const void* addr) = 0;\\n\\n virtual void SetPhyAddress(const uint64_t addr) = 0;\\n\\n virtual void SetFileDescriptor(const int32_t fd) = 0;\\n\\n virtual void SetTimestamp(const uint64_t timestamp) = 0;\\n\\n virtual void SetFrameNumber(const uint64_t frameNumber) = 0;\\n\\n virtual void SetPoolId(const int64_t id) = 0;\\n\\n virtual void SetCaptureId(const int32_t id) = 0;\\n\",\n \"file_path\": \"camera/hal/include/ibuffer.h\",\n \"rank\": 3,\n \"score\": 63349.93315361182\n },\n {\n \"content\": \" virtual void SetBufferStatus(const CameraBufferStatus flag) = 0;\\n\\n virtual void SetSequenceId(const int32_t sequence) = 0;\\n\\n virtual void SetFenceId(const int32_t fence) = 0;\\n\\n virtual void SetEncodeType(const int32_t type) = 0;\\n\\n virtual void SetEsFrameSize(const int32_t frameSize) = 0;\\n\\n virtual void SetEsTimestamp(const int64_t timeStamp) = 0;\\n\\n virtual void SetEsKeyFrame(const int32_t isKey) = 0;\\n\\n virtual void SetEsFrameNum(const int32_t frameNum) = 0;\\n\\n virtual void SetStreamId(const int32_t streamId) = 0;\\n\\n\\n\\n virtual void Free() = 0;\\n\\n\\n\\n virtual bool operator==(const IBuffer& u) = 0;\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"camera/hal/include/ibuffer.h\",\n \"rank\": 4,\n \"score\": 63349.849849742044\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_IBUFFER_H\\n\\n#define HOS_CAMERA_IBUFFER_H\\n\\n\\n\\n#include \\\"camera.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/ibuffer.h\",\n \"rank\": 5,\n \"score\": 63346.47170655384\n },\n {\n \"content\": \"struct DevHandle *(*AudioSmartPaTest::BindServiceRenderSo)(const char *) = nullptr;\\n\\nint32_t (*AudioSmartPaTest::InterfaceLibOutputRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\\n\\nint32_t (*AudioSmartPaTest::InterfaceLibCtlRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\\n\\nvoid (*AudioSmartPaTest::CloseServiceRenderSo)(struct DevHandle *) = nullptr;\\n\\nvoid *AudioSmartPaTest::PtrHandle = nullptr;\\n\\nusing THREAD_FUNC = void *(*)(void *);\\n\\n\\n\\nvoid AudioSmartPaTest::SetUpTestCase(void)\\n\\n{\\n\\n char absPath[PATH_MAX] = {0};\\n\\n if (realpath(RESOLVED_PATH.c_str(), absPath) == nullptr) {\\n\\n return;\\n\\n }\\n\\n handleSo = dlopen(absPath, RTLD_LAZY);\\n\\n if (handleSo == nullptr) {\\n\\n return;\\n\\n }\\n\\n GetAudioManager = (TestAudioManager *(*)())(dlsym(handleSo, FUNCTION_NAME.c_str()));\\n\\n if (GetAudioManager == nullptr) {\\n\\n return;\\n\",\n \"file_path\": \"audio/test/systemtest/audio_function/audio_smartpa/src/audio_smartpa_test.cpp\",\n \"rank\": 6,\n \"score\": 63099.424477775014\n },\n {\n \"content\": \"struct DevHandle *(*AudioLibRenderTest::BindServiceRenderSo)(const char *) = nullptr;\\n\\nint32_t (*AudioLibRenderTest::InterfaceLibOutputRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\\n\\nint32_t (*AudioLibRenderTest::InterfaceLibCtlRender)(struct DevHandle *, int, struct AudioHwRenderParam *) = nullptr;\\n\\nvoid (*AudioLibRenderTest::CloseServiceRenderSo)(struct DevHandle *) = nullptr;\\n\\nvoid *AudioLibRenderTest::PtrHandle = nullptr;\\n\\n#ifdef AUDIO_MPI_SO\\n\\n int32_t (*AudioLibRenderTest::SdkInit)() = nullptr;\\n\\n void (*AudioLibRenderTest::SdkExit)() = nullptr;\\n\\n#endif\\n\\n\\n\\nvoid AudioLibRenderTest::SetUpTestCase(void)\\n\\n{\\n\\n#ifdef __LITEOS__\\n\\n char resolvedPath[] = \\\"/usr/lib/libhdi_audio_interface_lib_render.so\\\";\\n\\n#else\\n\\n char resolvedPath[] = \\\"//system/lib/libhdi_audio_interface_lib_render.z.so\\\";\\n\\n#endif\\n\\n PtrHandle = dlopen(resolvedPath, RTLD_LAZY);\\n\\n if (PtrHandle == nullptr) {\\n\\n return;\\n\",\n \"file_path\": \"audio/test/systemtest/adm_interface_lib/render/src/audio_librender_test.cpp\",\n \"rank\": 7,\n \"score\": 63099.424477775014\n },\n {\n \"content\": \"struct DevHandle *(*AudioLibCaptureTest::BindServiceCaptureSo)(const char *) = nullptr;\\n\\nint32_t (*AudioLibCaptureTest::InterfaceLibOutputCapture)(struct DevHandle *, int,\\n\\n struct AudioHwCaptureParam *) = nullptr;\\n\\nint32_t (*AudioLibCaptureTest::InterfaceLibCtlCapture)(struct DevHandle *, int, struct AudioHwCaptureParam *) = nullptr;\\n\\nvoid (*AudioLibCaptureTest::CloseServiceCaptureSo)(struct DevHandle *) = nullptr;\\n\\n#ifdef AUDIO_MPI_SO\\n\\n int32_t (*AudioLibCaptureTest::SdkInit)() = nullptr;\\n\\n void (*AudioLibCaptureTest::SdkExit)() = nullptr;\\n\\n#endif\\n\\nvoid *AudioLibCaptureTest::PtrHandle = nullptr;\\n\\n\\n\\nvoid AudioLibCaptureTest::SetUpTestCase(void)\\n\\n{\\n\\n#ifdef __LITEOS__\\n\\n char resolvedPath[] = \\\"/usr/lib/libhdi_audio_interface_lib_capture.so\\\";\\n\\n#else\\n\\n char resolvedPath[] = \\\"//system/lib/libhdi_audio_interface_lib_capture.z.so\\\";\\n\\n#endif\\n\\n PtrHandle = dlopen(resolvedPath, RTLD_LAZY);\\n\\n if (PtrHandle == nullptr) {\\n\",\n \"file_path\": \"audio/test/systemtest/adm_interface_lib/capture/src/audio_libcapture_test.cpp\",\n \"rank\": 8,\n \"score\": 63099.424477775014\n },\n {\n \"content\": \"\\n\\nprivate:\\n\\n int32_t index_ = -1;\\n\\n uint32_t width_ = 0;\\n\\n uint32_t height_ = 0;\\n\\n uint32_t stride_ = 0;\\n\\n uint32_t format_ = CAMERA_FORMAT_INVALID;\\n\\n uint32_t size_ = 0;\\n\\n uint64_t usage_ = 0;\\n\\n void* virAddr_ = nullptr;\\n\\n uint64_t phyAddr_ = 0;\\n\\n int32_t fd_ = -1;\\n\\n int32_t sourceType_ = CAMERA_BUFFER_SOURCE_TYPE_NONE;\\n\\n uint64_t frameNumber_ = 0;\\n\\n uint64_t timeStamp_ = 0;\\n\\n int64_t poolId_ = -1;\\n\\n int32_t captureId_ = -1;\\n\\n CameraBufferStatus status_ = CAMERA_BUFFER_STATUS_OK;\\n\\n int32_t sequenceId_ = -1;\\n\\n int32_t fenceId_ = -1;\\n\\n int32_t encodeType_ = 0;\\n\\n EsFrameInfo esInfo_ = {-1, -1, -1, -1, -1};\\n\\n int32_t streamId_ = -1;\\n\\n std::mutex l_;\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"camera/hal/include/image_buffer.h\",\n \"rank\": 9,\n \"score\": 62086.359061116375\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_CAMERA_DEVICE_CLIENT_INF_H\\n\\n#define HDI_CAMERA_DEVICE_CLIENT_INF_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_device_callback.h\\\"\\n\\n#include \\\"istream_operator.h\\\"\\n\\n#include \\\"istream_operator_callback.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device.h\",\n \"rank\": 10,\n \"score\": 62086.030734961714\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_STREAM_OPERATOR_CLIENT_INF_H\\n\\n#define HDI_STREAM_OPERATOR_CLIENT_INF_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"istream_operator_callback.h\\\"\\n\\n#include \\\"ioffline_stream_operator.h\\\"\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 11,\n \"score\": 62085.983647172405\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_CAMERA_HOST_CLIENT_INF_H\\n\\n#define HDI_CAMERA_HOST_CLIENT_INF_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"icamera_device_callback.h\\\"\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host.h\",\n \"rank\": 12,\n \"score\": 62085.9339957456\n },\n {\n \"content\": \" virtual void SetUsage(const uint64_t usage) override;\\n\\n virtual void SetVirAddress(const void* addr) override;\\n\\n virtual void SetPhyAddress(const uint64_t addr) override;\\n\\n virtual void SetFileDescriptor(const int32_t fd) override;\\n\\n virtual void SetTimestamp(const uint64_t timestamp) override;\\n\\n virtual void SetFrameNumber(const uint64_t frameNumber) override;\\n\\n virtual void SetPoolId(const int64_t id) override;\\n\\n virtual void SetCaptureId(const int32_t id) override;\\n\\n virtual void SetBufferStatus(const CameraBufferStatus flag) override;\\n\\n virtual void SetSequenceId(const int32_t sequence) override;\\n\\n virtual void SetFenceId(const int32_t fence) override;\\n\\n virtual void SetEncodeType(const int32_t type) override;\\n\\n virtual void SetEsFrameSize(const int32_t frameSize) override;\\n\\n virtual void SetEsTimestamp(const int64_t timeStamp) override;\\n\\n virtual void SetEsKeyFrame(const int32_t isKey) override;\\n\\n virtual void SetEsFrameNum(const int32_t frameNum) override;\\n\\n virtual void SetStreamId(const int32_t streamId) override;\\n\\n\\n\\n virtual void Free() override;\\n\\n virtual bool operator==(const IBuffer& u) override;\\n\",\n \"file_path\": \"camera/hal/include/image_buffer.h\",\n \"rank\": 13,\n \"score\": 62085.90936485609\n },\n {\n \"content\": \" virtual std::shared_ptr<IBuffer> AcquireBuffer(int timeout) = 0;\\n\\n std::shared_ptr<IBuffer> AcquireBuffer()\\n\\n {\\n\\n return AcquireBuffer(0);\\n\\n }\\n\\n\\n\\n // return a buffer to pool.\\n\\n virtual RetCode ReturnBuffer(std::shared_ptr<IBuffer>& buffer) = 0;\\n\\n\\n\\n // enable tracking buffers of pool\\n\\n virtual void EnableTracking(const int32_t id) = 0;\\n\\n virtual void SetId(const int64_t id) = 0;\\n\\n virtual void NotifyStop() = 0;\\n\\n virtual void NotifyStart() = 0;\\n\\n virtual void ClearBuffers() = 0;\\n\\n virtual uint32_t GetIdleBufferCount() = 0;\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"camera/hal/include/ibuffer_pool.h\",\n \"rank\": 14,\n \"score\": 62085.27498680663\n },\n {\n \"content\": \"#include <map>\\n\\n#include <string>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\\nenum {\\n\\n INVALID_TRACKING_ID = -1,\\n\\n NODE_IS_EMPTY,\\n\\n NODE_IS_NOT_EMPTY,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"camera/hal/include/buffer_trace.h\",\n \"rank\": 15,\n \"score\": 62085.11193267465\n },\n {\n \"content\": \" static void ReportBufferLocation(const std::shared_ptr<BufferTrackingMessage>& message);\\n\\n\\n\\n // start a thread to tracking buffers of a stream.\\n\\n static void StartTracking();\\n\\n\\n\\n // stop stacking\\n\\n static void StopTracking();\\n\\n\\n\\n // check if there are buffers in a specific node.\\n\\n static int32_t IsNodeEmpty(const int32_t id, const std::string node);\\n\\n\\n\\n // check if there are buffers from beginNode to endNode.\\n\\n static int32_t IsNodeEmpty(const int32_t id, const std::string beginNode, const std::string endNode);\\n\\n\\n\\n static void DumpBufferTrace(const int32_t id, BufferTraceGraph& graph);\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n#endif\\n\",\n \"file_path\": \"camera/hal/include/buffer_tracking.h\",\n \"rank\": 16,\n \"score\": 62084.91422456556\n },\n {\n \"content\": \" virtual uint64_t GetPhyAddress() const override;\\n\\n virtual int32_t GetFileDescriptor() const override;\\n\\n virtual int32_t GetSourceType() const override;\\n\\n virtual uint64_t GetTimestamp() const override;\\n\\n virtual uint64_t GetFrameNumber() const override;\\n\\n virtual int64_t GetPoolId() const override;\\n\\n virtual int32_t GetCaptureId() const override;\\n\\n virtual CameraBufferStatus GetBufferStatus() const override;\\n\\n virtual int32_t GetSequenceId() const override;\\n\\n virtual int32_t GetFenceId() const override;\\n\\n virtual EsFrameInfo GetEsFrameInfo() const override;\\n\\n virtual int32_t GetEncodeType() const override;\\n\\n virtual int32_t GetStreamId() const override;\\n\\n\\n\\n virtual void SetIndex(const int32_t index) override;\\n\\n virtual void SetWidth(const uint32_t width) override;\\n\\n virtual void SetHeight(const uint32_t height) override;\\n\\n virtual void SetStride(const uint32_t stride) override;\\n\\n virtual void SetFormat(const int32_t format) override;\\n\\n virtual void SetSize(const uint32_t size) override;\\n\",\n \"file_path\": \"camera/hal/include/image_buffer.h\",\n \"rank\": 17,\n \"score\": 62084.910038309485\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_BUFFER_MANAGER_H\\n\\n#define HOS_CAMERA_BUFFER_MANAGER_H\\n\\n\\n\\n#include \\\"ibuffer_pool.h\\\"\\n\\n#include <map>\\n\\n#include <memory>\\n\\n#include <mutex>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/buffer_manager.h\",\n \"rank\": 18,\n \"score\": 62084.87872841601\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_BUFFER_TRACKING_H\\n\\n#define HOS_BUFFER_TRACKING_H\\n\\n\\n\\n#include \\\"buffer_trace.h\\\"\\n\\n#include <memory>\\n\",\n \"file_path\": \"camera/hal/include/buffer_tracking.h\",\n \"rank\": 19,\n \"score\": 62083.86495505552\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_BUFFER_TRACE_H\\n\\n#define HOS_CAMERA_BUFFER_TRACE_H\\n\\n\\n\\n#include \\\"camera.h\\\"\\n\\n#include <list>\\n\",\n \"file_path\": \"camera/hal/include/buffer_trace.h\",\n \"rank\": 20,\n \"score\": 62083.84557649773\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_IBUFFER_ALLOCATOR_H\\n\\n#define HOS_IBUFFER_ALLOCATOR_H\\n\\n\\n\\n#include \\\"camera.h\\\"\\n\\n#include \\\"memory\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/ibuffer_allocator.h\",\n \"rank\": 21,\n \"score\": 62083.826324104106\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_IBUFFER_POOL_H\\n\\n#define HOS_CAMERA_IBUFFER_POOL_H\\n\\n\\n\\n#include \\\"ibuffer.h\\\"\\n\\n#include <memory>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/ibuffer_pool.h\",\n \"rank\": 22,\n \"score\": 62083.78819291282\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_IMAGE_BUFFER_H\\n\\n#define HOS_CAMERA_IMAGE_BUFFER_H\\n\\n\\n\\n#include \\\"ibuffer.h\\\"\\n\\n#include <mutex>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/image_buffer.h\",\n \"rank\": 23,\n \"score\": 62083.78819291282\n },\n {\n \"content\": \" * @param results Indicates the metadata for which reporting is to be disabled.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode DisableResult(const std::vector<MetaType> &results) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Closes the camera device.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void Close() = 0;\\n\\n};\\n\\n}\\n\\n#endif // HDI_CAMERA_DEVICE_CLIENT_INF_H\",\n \"file_path\": \"camera/interfaces/include/icamera_device.h\",\n \"rank\": 24,\n \"score\": 62082.93099635565\n },\n {\n \"content\": \" const OHOS::sptr<IStreamOperatorCallback> &callback,\\n\\n OHOS::sptr<IStreamOperator> &streamOperator) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Updates camera device control parameters.\\n\\n *\\n\\n * @param settings Indicates the camera parameters, including the sensor frame rate and 3A parameters. 3A stands for automatic focus (AF), automatic exposure (AE), and automatic white-balance (AWB).\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode UpdateSettings(const std::shared_ptr<CameraSetting> &settings) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Sets the metadata reporting mode.\\n\\n *\\n\\n * @param mode Indicates the metadata reporting mode to set, which can be frame-by-frame reporting or reporting upon device status change. For details, see {@link ResultCallbackMode}.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device.h\",\n \"rank\": 25,\n \"score\": 62081.92660162625\n },\n {\n \"content\": \" * @param mode Indicates the operation mode of the stream. For details, see {@link OperationMode}.\\n\\n * @param modeSetting Indicates the stream configuration parameters, including the frame rate and zoom information.\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode CommitStreams(OperationMode mode,\\n\\n const std::shared_ptr<CameraStandard::CameraMetadata> &modeSetting) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Obtains stream attributes.\\n\\n *\\n\\n * @param attributes Indicates the obtained stream attributes.\\n\\n * Stream information passed by the <b>streamInfos</b> parameter in {@link CreateStreams}\\n\\n * may be overridden. Therefore, the stream attributes obtained by using this function may be\\n\\n * different from the stream information passed in {@link CreateStreams}.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 26,\n \"score\": 62081.891652242324\n },\n {\n \"content\": \" * If the streams can be created only after the upper-layer service or application stops capturing all streams,\\n\\n * <b>type</b> is set to <b>RE_CONFIGURED_REQUIRED</b>.\\n\\n * If the streams are not supported, <b>type</b> is set to <b>NOT_SUPPORTED</b>.\\n\\n * This function must be called prior to {@link CreateStreams}.\\n\\n *\\n\\n * @param mode Indicates the operation mode of the streams. For details, see {@link OperationMode}.\\n\\n * @param modeSetting Indicates the stream configuration parameters, including the frame rate and 3A.\\n\\n * 3A stands for automatic focus (AF), automatic exposure (AE), and automatic white-balance (AWB).\\n\\n * @param info Indicates the stream configuration information. For details, see {@link StreamInfo}.\\n\\n * @param type Indicates the support type of the dynamically created stream.\\n\\n * The supported types are defined in {@link StreamSupportType}.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode IsStreamsSupported(\\n\\n OperationMode mode,\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 27,\n \"score\": 62081.74166014088\n },\n {\n \"content\": \" virtual CamRetCode GetCameraIds(std::vector<std::string> &cameraIds) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Obtains the abilities of a camera device.\\n\\n *\\n\\n * @param cameraId Indicates the ID of the camera device, which can be obtained by calling {@link GetCameraIds}.\\n\\n *\\n\\n * @param ability Returns the abilities of the camera device.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode GetCameraAbility(const std::string &cameraId,\\n\\n std::shared_ptr<CameraAbility> &ability) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Opens a camera device.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host.h\",\n \"rank\": 28,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file icamera_host.h\\n\\n *\\n\\n * @brief Management class of the camera service that provides Hardware Driver Interfaces (HDIs) for the upper layer.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host.h\",\n \"rank\": 29,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * Due to the limited processing capability, some devices may spend a long period of time on\\n\\n * algorithm processing during photographing, causing the capture requests to stack in the module.\\n\\n * Converting to an offline stream enables the bottom-layer device to close and\\n\\n * the offline stream to take over for subsequent processing.\\n\\n *\\n\\n * @param streamIds Indicates the IDs of the streams to be converted.\\n\\n * @param callback Indicates the callback for conversion to offline streams.\\n\\n * @param offlineOperator Indicates the offline stream after conversion.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode ChangeToOfflineStream(const std::vector<int> &streamIds,\\n\\n OHOS::sptr<IStreamOperatorCallback> &callback,\\n\\n OHOS::sptr<IOfflineStreamOperator> &offlineOperator) = 0;\\n\\n};\\n\\n}\\n\\n#endif // HDI_STREAM_OPERATOR_CLIENT_INF_H\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 30,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * By calling this function, you can obtain the <b>ICameraDevice</b> instance and operate the specific camera device mapping to the instance.\\n\\n *\\n\\n * @param cameraId Indicates the ID of the camera device, which can be obtained by calling {@link GetCameraIds}.\\n\\n * @param callback Indicates the callback related to the camera. For details, see {@link ICameraDeviceCallback}.\\n\\n * @param device Indicates the <b>ICameraDevice</b> instance corresponding to the ID of the camera device.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode OpenCamera(const std::string &cameraId,\\n\\n const OHOS::sptr<ICameraDeviceCallback> &callback,\\n\\n OHOS::sptr<ICameraDevice> &device) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Turns on or off the flash.\\n\\n *\\n\\n * This function can be used only by the caller who has opened the camera device specified by <b>cameraId</b>.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host.h\",\n \"rank\": 31,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode SetResultMode(const ResultCallbackMode &mode) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Obtains enabled metadata.\\n\\n *\\n\\n * Metadata to be reported is enabled by calling {@link EnableResult}.\\n\\n *\\n\\n * @param results Indicates all enabled metadata.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode GetEnabledResults(std::vector<MetaType> &results) = 0;\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device.h\",\n \"rank\": 32,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * @param cameraId Indicates the ID of the camera whose flash is to be turned on or off.\\n\\n * @param isEnable Specifies whether to turn on or off the flash. The value <b>true</b> means to turn on the flash, and <b>false</b> means the opposite.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode SetFlashlight(const std::string &cameraId, bool &isEnable) = 0;\\n\\n};\\n\\n}\\n\\n#endif // HDI_CAMERA_HOST_CLIENT_INF_H\",\n \"file_path\": \"camera/interfaces/include/icamera_host.h\",\n \"rank\": 33,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * such as the number of captured frames.\\n\\n * <b>enableShutterCallback_</b> in {@link CaptureInfo} is used to enable the callback for each capture.\\n\\n * After the callback is enabled, {@link OnFrameShutter} is called upon each capture.\\n\\n * In the scenario where multiple streams are captured at the same time, this module ensures that\\n\\n * the captured data of multiple streams is reported simultaneously.\\n\\n *\\n\\n * @param captureId Indicates the ID of the capture request. You must ensure that the ID of the\\n\\n * capture request is unique when the camera is started.\\n\\n * @param info Indicates the capture request configuration information. For details, see {@link CaptureInfo}.\\n\\n * @param isStreaming Specifies whether to continuously capture images.\\n\\n * The value <b>true</b> means to continuously capture images, and <b>false</b> means the opposite.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode Capture(int captureId,\\n\\n const std::shared_ptr<CaptureInfo> &info, bool isStreaming) = 0;\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 34,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Cancels a capture.\\n\\n *\\n\\n * {@link OnCaptureEnded} is called when a continuous capture is canceled.\\n\\n *\\n\\n * @param captureId Indicates the ID of the capture request to cancel.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode CancelCapture(int captureId) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Converts a specific stream to an offline stream.\\n\\n *\\n\\n * Only photographing streams can be converted into offline streams.\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 35,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"\\n\\n#define PIPELINE_REPORT_BUFFER_LOCATION(I, F, N) TRACKING_REPORT_BUFFER_LOCATION(I, F, N, false);\\n\\n\\n\\n#define POOL_REPORT_BUFFER_LOCATION(I, F) TRACKING_REPORT_BUFFER_LOCATION(I, F, \\\"\\\", true);\\n\\n\\n\\n#define TRACKING_REPORT_BUFFER_LOCATION(I, F, N, R) \\\\\\n\\n do { \\\\\\n\\n auto m = std::make_shared<BufferTrackingMessage>(); \\\\\\n\\n m->trackingId = I; \\\\\\n\\n m->frameNumber = F; \\\\\\n\\n m->nodeName = N; \\\\\\n\\n m->isReturnBack = R; \\\\\\n\\n BufferTracking::ReportBufferLocation(m); \\\\\\n\\n } while (0);\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/buffer_tracking.h\",\n \"rank\": 36,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Enables metadata reporting.\\n\\n *\\n\\n * Only metadata that is enabled can be reported by using {@link OnResult}.\\n\\n *\\n\\n * @param results Indicates the metadata for which reporting is to be enabled.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode EnableResult(const std::vector<MetaType> &results) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Disables metadata reporting.\\n\\n *\\n\\n * After metadata reporting is disabled, the metadata is not reported by calling {@link OnResult}. To enable metadata reporting, you must call {@link EnableResult}.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device.h\",\n \"rank\": 37,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode GetStreamAttributes(\\n\\n std::vector<std::shared_ptr<StreamAttribute>> &attributes) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Attaches a producer handle to a stream.\\n\\n *\\n\\n * If a producer handle has been specified during stream creation (by {@link CreateStreams}),\\n\\n * you do not need to call this function. If you want to attach a new procedure handle,\\n\\n * call {@link DetachBufferQueue} to detach the existing procedure handle and then\\n\\n * call this function to attach the new one.\\n\\n * You do not need to attach a procedure handle for IoT devices that do not support or require\\n\\n * image data caching and transferring of preview streams.\\n\\n * In this case, set <b>bufferQueue_</b> in the {@link StreamInfo} parameter of {@link CreateStreams}\\n\\n * to <b>null</b>,\\n\\n * and set <b>tunneledMode_</b> to <b>false</b>.\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 38,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" virtual CamRetCode CreateStreams(const std::vector<std::shared_ptr<StreamInfo>> &streamInfos) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Releases streams.\\n\\n *\\n\\n * @param streamIds Indicates the IDs of the streams to release.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode ReleaseStreams(const std::vector<int> &streamIds) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Configures a stream.\\n\\n *\\n\\n * This function must be called after {@link CreateStreams}.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 39,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" *\\n\\n * @param callback Indicates the callbacks to set.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode SetCallback(const OHOS::sptr<ICameraHostCallback> &callback) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Obtains the IDs of available camera devices.\\n\\n *\\n\\n * @param cameraIds Indicates the IDs of available camera devices.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host.h\",\n \"rank\": 40,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" const std::shared_ptr<CameraStandard::CameraMetadata> &modeSetting,\\n\\n const std::vector<std::shared_ptr<StreamInfo>> &info,\\n\\n StreamSupportType &type) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Creates streams.\\n\\n *\\n\\n * Before calling this function, you must use {@link IsStreamsSupported} to check whether the hardware\\n\\n * abstraction layer (HAL) supports the streams to create.\\n\\n *\\n\\n * @param streamInfos Indicates the list of stream information, which is defined by {@link StreamInfo}.\\n\\n * The passed stream information may be changed. Therefore, you can run {@link GetStreamAttributes} to\\n\\n * obtain the latest stream attributes after the stream is created.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 41,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"class IBuffer {\\n\\npublic:\\n\\n virtual ~IBuffer(){};\\n\\n\\n\\n virtual int32_t GetIndex() const = 0;\\n\\n virtual uint32_t GetWidth() const = 0;\\n\\n virtual uint32_t GetHeight() const = 0;\\n\\n virtual uint32_t GetStride() const = 0;\\n\\n virtual int32_t GetFormat() const = 0;\\n\\n virtual uint32_t GetSize() const = 0;\\n\\n virtual uint64_t GetUsage() const = 0;\\n\\n virtual void* GetVirAddress() const = 0;\\n\\n virtual uint64_t GetPhyAddress() const = 0;\\n\\n virtual int32_t GetFileDescriptor() const = 0;\\n\\n virtual int32_t GetSourceType() const = 0;\\n\\n virtual uint64_t GetTimestamp() const = 0;\\n\\n virtual uint64_t GetFrameNumber() const = 0;\\n\\n virtual int64_t GetPoolId() const = 0;\\n\\n virtual int32_t GetCaptureId() const = 0;\\n\\n virtual CameraBufferStatus GetBufferStatus() const = 0;\\n\",\n \"file_path\": \"camera/hal/include/ibuffer.h\",\n \"rank\": 42,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode DetachBufferQueue(int streamId) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Captures an image.\\n\\n *\\n\\n * This function must be called after {@link CommitStreams}.\\n\\n * There are two image capture modes: continuous capture and single capture.\\n\\n * A continuous capture is performed inside the module after being triggered,\\n\\n * and the consumer can continuously receive captured image data after calling this function only once.\\n\\n * If this function is called again, the current capture is stopped, the capture request configuration is updated,\\n\\n * and a new capture is performed.\\n\\n * This mode is mainly used in preview, video recording, or continuous shooting scenarios.\\n\\n * After a single capture is triggered, only one frame of image data is captured.\\n\\n * This mode applies to the single shooting scenario.\\n\\n * When the capture is started, {@link OnCaptureStarted} is called to notify of the start.\\n\\n * To stop a continuous capture, call {@link CancelCapture}.\\n\\n * When the capture ends, {@link OnCaptureEnded} is called to notify the caller of the information\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 43,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file icamera_device.h\\n\\n *\\n\\n * @brief Declares APIs for camera device operations.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device.h\",\n \"rank\": 44,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" *\\n\\n * @param streamId Indicates the ID of the stream to which the procedure handle is to be attached.\\n\\n * @param producer Indicates the producer handle to be attached.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode AttachBufferQueue(int streamId, const OHOS::sptr<OHOS::IBufferProducer> &producer) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Detaches the producer handle from a stream.\\n\\n *\\n\\n * @param streamId Indicates the ID of the stream from which the procedure handle is to be detached.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful;\\n\\n * returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 45,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file istream_operator.h\\n\\n *\\n\\n * @brief Declares APIs for stream operations.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator.h\",\n \"rank\": 46,\n \"score\": 62077.93131932017\n },\n {\n \"content\": \" running_ = false;\\n\\n if (consumerThread_ != nullptr) {\\n\\n consumerThread_->join();\\n\\n delete consumerThread_;\\n\\n }\\n\\n }\\n\\n public:\\n\\n std::atomic<uint64_t> shotCount_ = 0;\\n\\n std::mutex l_;\\n\\n std::condition_variable cv_;\\n\\n bool running_ = true;\\n\\n#ifdef CAMERA_BUILT_ON_OHOS_LITE\\n\\n std::shared_ptr<OHOS::Surface> consumer_ = nullptr;\\n\\n std::function<void(OHOS::SurfaceBuffer*)> callback_ = nullptr;\\n\\n#else\\n\\n OHOS::sptr<OHOS::Surface> consumer_ = nullptr;\\n\\n std::function<void(void*, uint32_t)> callback_ = nullptr;\\n\\n#endif\\n\\n std::thread* consumerThread_ = nullptr;\\n\\n };\\n\\n};\\n\\n\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 47,\n \"score\": 60877.352085204286\n },\n {\n \"content\": \"#include <iostream>\\n\\n#include <climits>\\n\\n#include <sys/stat.h>\\n\\n#include <fcntl.h>\\n\\n#include <unistd.h>\\n\\n#include <sys/ioctl.h>\\n\\n#include <sys/wait.h>\\n\\n#include <thread>\\n\\n#include <stdio.h>\\n\\n#include <sys/time.h>\\n\\n#include <vector>\\n\\n#include <map>\\n\\n#include \\\"utils.h\\\"\\n\\n#include \\\"camera.h\\\"\\n\\n#include \\\"camera_host.h\\\"\\n\\n#include \\\"types.h\\\"\\n\\n#include <surface.h>\\n\\n#include \\\"idevice_manager.h\\\"\\n\\n#include \\\"camera_metadata_info.h\\\"\\n\\n#include \\\"ibuffer.h\\\"\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 48,\n \"score\": 60871.77061370636\n },\n {\n \"content\": \"#include <display_type.h>\\n\\n#include <hdf_log.h>\\n\\n#include <osal_mem.h>\\n\\n#include \\\"securec.h\\\"\\n\\n#include \\\"icamera_host.h\\\"\\n\\n#include \\\"icamera_device.h\\\"\\n\\n#include \\\"istream_operator.h\\\"\\n\\n#include \\\"ioffline_stream_operator.h\\\"\\n\\n#include \\\"camera_host_callback.h\\\"\\n\\n#include \\\"camera_device_callback.h\\\"\\n\\n#include \\\"stream_operator_callback.h\\\"\\n\\n#include \\\"video_key_info.h\\\"\\n\\n#include \\\"type_common.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 49,\n \"score\": 60871.62060719702\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_STREAM_OPERATOR_CALLBACK_SERVER_H\\n\\n#define HDI_STREAM_OPERATOR_CALLBACK_SERVER_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator_callback.h\",\n \"rank\": 50,\n \"score\": 60871.28254813265\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_CAMERA_DEVICE_CALLBACK_SERVER_H\\n\\n#define HDI_CAMERA_DEVICE_CALLBACK_SERVER_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device_callback.h\",\n \"rank\": 51,\n \"score\": 60871.28254813265\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_CAMERA_HOST_CALLBACK_SERVER_H\\n\\n#define HDI_CAMERA_HOST_CALLBACK_SERVER_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host_callback.h\",\n \"rank\": 52,\n \"score\": 60871.28254813265\n },\n {\n \"content\": \" * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n\\n\\n#ifndef HDI_OFFLINE_STREAM_OPERATOR_CLIENT_INF_H\\n\\n#define HDI_OFFLINE_STREAM_OPERATOR_CLIENT_INF_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"icamera_interface.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/interfaces/include/ioffline_stream_operator.h\",\n \"rank\": 53,\n \"score\": 60871.25942213042\n },\n {\n \"content\": \" OHOS::sptr<StreamOperatorCallback> streamOperatorCallback = nullptr;\\n\\n OHOS::sptr<CameraHostCallback> hostCallback = nullptr;\\n\\n OHOS::sptr<CameraDeviceCallback> deviceCallback = nullptr;\\n\\n OHOS::sptr<IStreamOperator> streamOperator = nullptr;\\n\\n OHOS::sptr<Camera::IOfflineStreamOperator> offlineStreamOperator = nullptr;\\n\\n OHOS::sptr<IStreamOperatorCallback> offlineStreamOperatorCallback = nullptr;\\n\\n\\n\\n std::shared_ptr<OHOS::Camera::CaptureInfo> captureInfo = nullptr;\\n\\n std::vector<std::shared_ptr<OHOS::Camera::StreamInfo>> streamInfos;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo2 = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo_pre = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo_video = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo_capture = nullptr;\\n\\n std::vector<std::string> cameraIds;\\n\\n int streamId_preview = 1000;\\n\\n int streamId_preview_double = 1001;\\n\\n int streamId_capture = 1010;\\n\\n int streamId_video = 1020;\\n\\n int captureId_preview = 2000;\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 54,\n \"score\": 60870.67930468062\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HDI_SAMPLE_CLIENT_CPP_INF_H\\n\\n#define HDI_SAMPLE_CLIENT_CPP_INF_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <hdf_log.h>\\n\\n#include <iservmgr_hdi.h>\\n\\n\\n\\nnamespace OHOS {\\n\\nnamespace HDI {\\n\\nnamespace WLAN {\\n\\nnamespace V1_0 {\\n\\n\\n\",\n \"file_path\": \"wlan/hdi_service/include/Iwifi_hal.h\",\n \"rank\": 55,\n \"score\": 60870.47601809776\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_BUFFER_ALLOCATOR_UTILS_H\\n\\n#define HOS_BUFFER_ALLOCATOR_UTILS_H\\n\\n\\n\\n#include \\\"camera.h\\\"\\n\\n#include \\\"ibuffer.h\\\"\\n\\n#include \\\"ibuffer_allocator.h\\\"\\n\\n#include <memory>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/include/buffer_allocator_utils.h\",\n \"rank\": 56,\n \"score\": 60870.29253798874\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n#ifndef CAMERA_TEST_COMMON_H\\n\\n#define CAMERA_TEST_COMMON_H\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <limits.h>\\n\\n#include <gtest/gtest.h>\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 57,\n \"score\": 60869.95820300638\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_ICONTROLLER_H\\n\\n#define HOS_CAMERA_ICONTROLLER_H\\n\\n\\n\\n#include \\\"device_manager_adapter.h\\\"\\n\\n#include <mutex>\\n\\n#include <string>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/device_manager/include/icontroller.h\",\n \"rank\": 58,\n \"score\": 60869.89442555645\n },\n {\n \"content\": \" int captureId_preview_double = 2001;\\n\\n int captureId_capture = 3000;\\n\\n int captureId_video = 4000;\\n\\n std::vector<int> captureIds;\\n\\n std::vector<int> streamIds;\\n\\n std::vector<Camera::StreamIntent> intents;\\n\\n OHOS::Camera::CamRetCode rc;\\n\\n\\n\\n#ifdef CAMERA_BUILT_ON_OHOS_LITE\\n\\n std::shared_ptr<OHOS::Camera::CameraHost> service = nullptr;\\n\\n std::shared_ptr<ICameraDevice> cameraDevice = nullptr;\\n\\n#else\\n\\n OHOS::sptr<OHOS::Camera::ICameraHost> service = nullptr;\\n\\n OHOS::sptr<ICameraDevice> cameraDevice = nullptr;\\n\\n#endif\\n\\n std::shared_ptr<CameraAbility> ability = nullptr;\\n\\n\\n\\n bool status;\\n\\n bool onCameraStatusFlag;\\n\\n bool onFlashlightStatusFlag;\\n\\n bool onErrorFlag;\\n\\n bool onResultFlag;\\n\\n bool captureStartFlag;\\n\\n bool captureEndFlag;\\n\\n bool captureErrorFlag;\\n\\n bool frameShutterFlag;\\n\\n int previewBufCnt = 0;\\n\\n int32_t videoFd = -1;\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 59,\n \"score\": 60869.88336579769\n },\n {\n \"content\": \" return RC_OK;\\n\\n };\\n\\n virtual void SetAbilityMetaDataTag(std::vector<int32_t> abilityMetaDataTag) {};\\n\\n virtual void SetAbilityMetaDataTag(std::vector<int32_t> abilityMetaDataTag, std::string hardwareName) {};\\n\\n virtual RetCode GetAbilityMetaData(std::shared_ptr<CameraStandard::CameraMetadata> meta)\\n\\n {\\n\\n return RC_OK;\\n\\n };\\n\\n virtual RetCode GetAbilityMetaData(std::shared_ptr<CameraStandard::CameraMetadata> meta, std::string hardwareName)\\n\\n {\\n\\n return RC_OK;\\n\\n };\\n\\n virtual bool GetMetaDataFlag()\\n\\n {\\n\\n return false;\\n\\n };\\n\\n virtual void SetMetaDataFlag(bool metaDataFlag) {};\\n\\n\\n\\nprivate:\\n\\n ManagerId managerID_;\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n#endif\",\n \"file_path\": \"camera/hal/device_manager/include/imanager.h\",\n \"rank\": 60,\n \"score\": 60869.53417326704\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_ISENSOR_H\\n\\n#define HOS_CAMERA_ISENSOR_H\\n\\n\\n\\n#include \\\"device_manager_adapter.h\\\"\\n\\n#include <string>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/device_manager/include/isensor.h\",\n \"rank\": 61,\n \"score\": 60869.202002485545\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_IMANAGER_H\\n\\n#define HOS_CAMERA_IMANAGER_H\\n\\n\\n\\n#include \\\"icontroller.h\\\"\\n\\n#include \\\"device_manager_adapter.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/device_manager/include/imanager.h\",\n \"rank\": 62,\n \"score\": 60869.202002485545\n },\n {\n \"content\": \" * @param captureId Indicates the ID of the capture request corresponding to the callback.\\n\\n * @param infos Indicates information related to the capture when it ends.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void OnCaptureEnded(int32_t captureId,\\n\\n const std::vector<std::shared_ptr<CaptureEndedInfo>> &infos) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Called when an error occurs during the capture.\\n\\n *\\n\\n * @param captureId Indicates the ID of the capture request corresponding to the callback.\\n\\n * @param infos Indicates a list of capture error messages.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void OnCaptureError(int32_t captureId,\\n\\n const std::vector<std::shared_ptr<CaptureErrorInfo>> &infos) = 0;\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator_callback.h\",\n \"rank\": 63,\n \"score\": 60869.16792658114\n },\n {\n \"content\": \" test_->captureErrorFlag = true;\\n\\n }\\n\\n virtual void OnFrameShutter(int32_t captureId,\\n\\n const std::vector<int32_t> &streamId, uint64_t timestamp) override\\n\\n {\\n\\n test_->frameShutterFlag = true;\\n\\n }\\n\\n};\\n\\n}\\n\\n#endif\\n\",\n \"file_path\": \"camera/hal/test/mpi/include/common.h\",\n \"rank\": 64,\n \"score\": 60869.00252428402\n },\n {\n \"content\": \" *\\n\\n * @param timestamp Indicates the timestamp when the metadata is reported.\\n\\n * @param result Indicates the metadata reported. The reported metadata is specified by {@link EnableResult}.\\n\\n * You can call {@link GetEnabledResults} to obtain enabled metadata and\\n\\n * call {@link DisableResult} to disable metadata reporting.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void OnResult(uint64_t timestamp, const std::shared_ptr<CameraStandard::CameraMetadata> &result) = 0;\\n\\n};\\n\\n}\\n\\n#endif // HDI_CAMERA_DEVICE_CALLBACK_SERVER_H\",\n \"file_path\": \"camera/interfaces/include/icamera_device_callback.h\",\n \"rank\": 65,\n \"score\": 60868.13276707636\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Called when a frame is captured.\\n\\n *\\n\\n * This callback is enabled by using <b>enableShutterCallback_</b> in the {@link CaptureInfo} parameter of {@link Capture}.\\n\\n * When <b>enableShutterCallback_</b> is set to <b>true</b>,\\n\\n * this callback is triggered each time a frame is captured.\\n\\n *\\n\\n * @param captureId Indicates the ID of the capture request corresponding to the callback.\\n\\n * @param streamIds Indicates the IDs of the streams corresponding to the callback.\\n\\n * @param timestamp Indicates the timestamp when the callback is invoked.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void OnFrameShutter(int32_t captureId,\\n\\n const std::vector<int32_t> &streamIds, uint64_t timestamp) = 0;\\n\\n};\\n\\n}\\n\\n#endif // HDI_STREAM_OPERATOR_CALLBACK_SERVER_H\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator_callback.h\",\n \"rank\": 66,\n \"score\": 60867.73696459509\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file icamera_host_callback.h\\n\\n *\\n\\n * @brief Declares callbacks for status changes of cameras and flashes. The caller needs to implement the callbacks.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_host_callback.h\",\n \"rank\": 67,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \" return RC_OK;\\n\\n };\\n\\n virtual RetCode CreateController(ControllerId controllerId, std::string hardwareName)\\n\\n {\\n\\n return RC_OK;\\n\\n };\\n\\n virtual RetCode PowerUp(CameraId cameraId)\\n\\n {\\n\\n return RC_OK;\\n\\n };\\n\\n virtual RetCode PowerDown(CameraId cameraId)\\n\\n {\\n\\n return RC_OK;\\n\\n };\\n\\n virtual RetCode PowerUp(std::string hardwareName)\\n\\n {\\n\\n return RC_OK;\\n\\n };\\n\\n virtual RetCode PowerDown(std::string hardwareName)\\n\\n {\\n\",\n \"file_path\": \"camera/hal/device_manager/include/imanager.h\",\n \"rank\": 68,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \"\\n\\n // flush the buffer\\n\\n static RetCode FlushCache(std::shared_ptr<IBuffer>& buffer);\\n\\n\\n\\n // invalidate the cache, update cache from memory\\n\\n static RetCode InvalidateCache(std::shared_ptr<IBuffer>& buffer);\\n\\nprivate:\\n\\n static std::shared_ptr<IBufferAllocator> GetBufferAllocator(const int32_t source);\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n#endif\\n\",\n \"file_path\": \"camera/hal/include/buffer_allocator_utils.h\",\n \"rank\": 69,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file icamera_device_callback.h\\n\\n *\\n\\n * @brief Declares callbacks for reporting camera device errors and metadata.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/icamera_device_callback.h\",\n \"rank\": 70,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \"class IBuffer;\\n\",\n \"file_path\": \"camera/hal/include/ibuffer_allocator.h\",\n \"rank\": 71,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \" virtual int32_t getNetworkIfaceName(std::shared_ptr<WifiFeatureInfo> ifeature) = 0;\\n\\n virtual int32_t getFeatureType(std::shared_ptr<WifiFeatureInfo> ifeature) = 0;\\n\\n virtual int32_t setMacAddress(std::shared_ptr<WifiFeatureInfo> ifeature, std::vector<uint8_t>& mac) = 0;\\n\\n virtual int32_t getDeviceMacAddress(std::shared_ptr<WifiFeatureInfo> ifeature, std::vector<uint8_t>& mac,\\n\\n uint8_t len) = 0;\\n\\n virtual int32_t getFreqsWithBand(std::shared_ptr<WifiFeatureInfo> ifeature, int32_t band,\\n\\n std::vector<int32_t> freq, uint32_t count, uint32_t& num) = 0;\\n\\n virtual int32_t setTxPower(std::shared_ptr<WifiFeatureInfo> ifeature, int32_t power) = 0;\\n\\n virtual int32_t getChipId(std::shared_ptr<WifiFeatureInfo> ifeature, uint8_t& chipId) = 0;\\n\\n virtual int32_t getIfNamesByChipId(const uint8_t chipId, std::string& ifNames, uint32_t& num) = 0;\\n\\n virtual int32_t setScanningMacAddress(std::shared_ptr<WifiFeatureInfo> ifeature, std::vector<uint8_t>& scanMac,\\n\\n uint8_t len) = 0;\\n\\n};\\n\\n\\n\\n}\\n\\n}\\n\\n}\\n\\n}\\n\\n\\n\\n#endif\",\n \"file_path\": \"wlan/hdi_service/include/Iwifi_hal.h\",\n \"rank\": 72,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file istream_operator_callback.h\\n\\n *\\n\\n * @brief Declares callbacks related to {@link IStreamOperator}. The caller needs to implement these callbacks.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/istream_operator_callback.h\",\n \"rank\": 73,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \" *\\n\\n * @param streamIds Indicates the IDs of the offline streams to release.\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode ReleaseStreams(const std::vector<int> &streamIds) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Releases all offline streams.\\n\\n *\\n\\n *\\n\\n * @return Returns <b>NO_ERROR</b> if the operation is successful; returns an error code defined in {@link CamRetCode} otherwise.\\n\\n *\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual CamRetCode Release() = 0;\\n\\n};\\n\\n}\\n\\n#endif // HDI_OFFLINE_STREAM_OPERATOR_CLIENT_INF_H\",\n \"file_path\": \"camera/interfaces/include/ioffline_stream_operator.h\",\n \"rank\": 74,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file ioffline_stream_operator.h\\n\\n *\\n\\n * @brief Declares APIs for offline stream operations.\\n\\n *\\n\",\n \"file_path\": \"camera/interfaces/include/ioffline_stream_operator.h\",\n \"rank\": 75,\n \"score\": 60863.34512889289\n },\n {\n \"content\": \" CameraHost& operator=(CameraHost&& other) = delete;\\n\\n\\n\\nprivate:\\n\\n CamRetCode Init();\\n\\n\\n\\nprivate:\\n\\n void* handler_ = nullptr;\\n\\n CameraHostCIF* host_ = nullptr;\\n\\n};\\n\\n} // end namespace OHOS::Camera\\n\\n#endif // CAMERA_HOST_CAMERA_HOST_H\\n\",\n \"file_path\": \"camera/hal_c/hdi_cif/include/camera_host.h\",\n \"rank\": 76,\n \"score\": 59707.59859481342\n },\n {\n \"content\": \" return nullptr;\\n\\n };\\n\\n virtual RetCode PowerUp(CameraId cameraId) = 0;\\n\\n virtual RetCode PowerDown(CameraId cameraId) = 0;\\n\\n virtual RetCode Init() = 0;\\n\\n virtual std::shared_ptr<ISensor> GetSensor(CameraId cameraId) = 0;\\n\\n virtual std::vector<CameraId> GetCameraId() = 0;\\n\\n virtual RetCode Connect(std::string controller,\\n\\n std::string portNum, std::string connectController, std::string connectPortNum)\\n\\n {\\n\\n (void)controller;\\n\\n (void)portNum;\\n\\n (void)connectController;\\n\\n (void)connectPortNum;\\n\\n return RC_OK;\\n\\n };\\n\\n virtual RetCode UnConnect(std::string controller,\\n\\n std::string portNum, std::string connectController, std::string connectPortNum)\\n\\n {\\n\\n (void)controller;\\n\",\n \"file_path\": \"camera/hal/device_manager/include/idevice_manager.h\",\n \"rank\": 77,\n \"score\": 59706.130872675945\n },\n {\n \"content\": \"#include \\\"ibuffer.h\\\"\\n\\n#include <algorithm>\\n\\n#include <assert.h>\\n\\n#include <errno.h>\\n\\n#include <getopt.h>\\n\\n#include <linux/fb.h>\\n\\n#include <linux/videodev2.h>\\n\\n#include <mutex>\\n\\n#include <pthread.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n#include <sys/mman.h>\\n\\n#include <sys/stat.h>\\n\\n#include <sys/time.h>\\n\\n#include <vector>\\n\\n#include <iostream>\\n\\n#include <cstring>\\n\\n#include <cerrno>\\n\\n#include <securec.h>\\n\\n#include <surface_buffer.h>\\n\\n#include <ibuffer_producer.h>\\n\\n#include <fstream>\\n\\n#define PATH_MAX 128\\n\\n#define BUFFERSCOUNT 8\\n\\n#define CAMERA_BUFFER_QUEUE_IPC 654320\\n\\n#define RANGE_LIMIT(x) (x > 255 ? 255 : (x < 0 ? 0 : x))\\n\\n\\n\",\n \"file_path\": \"camera/hal/test/v4l2/include/test_display.h\",\n \"rank\": 78,\n \"score\": 59703.76771367318\n },\n {\n \"content\": \"#include \\\"stream_operator.h\\\"\\n\\n#include \\\"camera_device.h\\\"\\n\\n#include \\\"utils.h\\\"\\n\\n#include <thread>\\n\\n#include <map>\\n\\n#include <stdio.h>\\n\\n#include <climits>\\n\\n#include \\\"types.h\\\"\\n\\n#include \\\"camera_device_impl.h\\\"\\n\\n#include \\\"stream_operator_impl.h\\\"\\n\\n#include \\\"idevice_manager.h\\\"\\n\\n#include \\\"camera_metadata_info.h\\\"\\n\\n#include <display_type.h>\\n\\n#include <fcntl.h>\\n\\n#include <unistd.h>\\n\\n#include <sys/ioctl.h>\\n\\n#include <sys/wait.h>\\n\\n#include \\\"buffer_queue_producer.h\\\"\\n\\n#include \\\"buffer_manager.h\\\"\\n\\n#include \\\"test_stream_operator_impl.h\\\"\\n\",\n \"file_path\": \"camera/hal/test/v4l2/include/test_display.h\",\n \"rank\": 79,\n \"score\": 59703.76132911076\n },\n {\n \"content\": \"#include \\\"Iwifi_hal.h\\\"\\n\\n#include <iremote_proxy.h>\\n\\n#include <hdf_log.h>\\n\\n#include <iservmgr_hdi.h>\\n\\n#include <ipc_object_stub.h>\\n\\n\\n\\nnamespace OHOS {\\n\\nnamespace HDI {\\n\\nnamespace WLAN {\\n\\nnamespace V1_0 {\\n\\n\\n\",\n \"file_path\": \"wlan/hdi_service/include/wlan_hal_proxy.h\",\n \"rank\": 80,\n \"score\": 59703.27748510421\n },\n {\n \"content\": \" void ProcessImage(const unsigned char* p, unsigned char* fbp);\\n\\n void LcdDrawScreen(unsigned char* displayBuf_, unsigned char* addr);\\n\\n void BufferCallback(std::shared_ptr<SurfaceBuffer> buffer, int choice);\\n\\n void Init();\\n\\n void UsbInit();\\n\\n void Close();\\n\\n void OpenCamera();\\n\\n void AchieveStreamOperator();\\n\\n void StartStream(std::vector<OHOS::Camera::StreamIntent> intents);\\n\\n void StopStream(std::vector<int>& captureIds, std::vector<int>& streamIds);\\n\\n void StartCapture(int streamId, int captureId, bool shutterCallback, bool isStreaming);\\n\\n float calTime(struct timeval start, struct timeval end);\\n\\n};\\n\\n#endif\",\n \"file_path\": \"camera/hal/test/v4l2/include/test_display.h\",\n \"rank\": 81,\n \"score\": 59703.27624368714\n },\n {\n \"content\": \" (void)portNum;\\n\\n (void)connectController;\\n\\n (void)connectPortNum;\\n\\n return RC_OK;\\n\\n };\\n\\n virtual void BufferCallback(std::shared_ptr<FrameSpec> buffer)\\n\\n {\\n\\n (void)buffer;\\n\\n return;\\n\\n };\\n\\n virtual void SetAbilityMetaDataTag(std::vector<int32_t> abilityMetaDataTag)\\n\\n {\\n\\n (void)abilityMetaDataTag;\\n\\n return;\\n\\n };\\n\\n virtual RetCode SendFrameBuffer(std::shared_ptr<FrameSpec> buffer, CameraId cameraId = CAMERA_MAX)\\n\\n {\\n\\n (void)buffer;\\n\\n (void)cameraId;\\n\\n return RC_OK;\\n\",\n \"file_path\": \"camera/hal/device_manager/include/idevice_manager.h\",\n \"rank\": 82,\n \"score\": 59703.25733890847\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef I_NODE_H\\n\\n#define I_NODE_H\\n\\n#include <string>\\n\\n#include <thread>\\n\\n#include <list>\\n\\n#include \\\"stream_pipeline_data_structure.h\\\"\\n\\n#include \\\"object_factory.h\\\"\\n\\n#include \\\"no_copyable.h\\\"\\n\\n#include \\\"ibuffer.h\\\"\\n\\n#include \\\"ibuffer_pool.h\\\"\\n\\n#include \\\"camera_metadata_info.h\\\"\\n\\n#include <functional>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/pipeline_core/nodes/include/inode.h\",\n \"rank\": 83,\n \"score\": 59703.22315970012\n },\n {\n \"content\": \" };\\n\\n virtual void SetNodeCallBack(const NodeBufferCb cb, CameraId cameraId = CAMERA_MAX)\\n\\n {\\n\\n (void)cb;\\n\\n (void)cameraId;\\n\\n return;\\n\\n };\\n\\n virtual void SetMetaDataCallBack(const MetaDataCb cb, CameraId cameraId = CAMERA_MAX)\\n\\n {\\n\\n (void)cb;\\n\\n (void)cameraId;\\n\\n return;\\n\\n };\\n\\n virtual void SetDevStatusCallBack(const DeviceStatusCb cb)\\n\\n {\\n\\n (void)cb;\\n\\n return;\\n\\n };\\n\\n virtual RetCode SetFlashlight(FlashMode flashMode, bool enable, CameraId cameraId = CAMERA_MAX) = 0;\\n\\n virtual void Configure(std::shared_ptr<CameraStandard::CameraMetadata> meta) = 0;\\n\",\n \"file_path\": \"camera/hal/device_manager/include/idevice_manager.h\",\n \"rank\": 84,\n \"score\": 59703.13689694335\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_BUFFER_POOL_H\\n\\n#define HOS_CAMERA_BUFFER_POOL_H\\n\\n\\n\\n#include \\\"buffer_allocator_factory.h\\\"\\n\\n#include \\\"ibuffer.h\\\"\\n\\n#include \\\"ibuffer_pool.h\\\"\\n\\n#include <condition_variable>\\n\\n#include <list>\\n\\n#include <memory>\\n\\n#include <mutex>\\n\\n#include <utility>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/buffer_manager/include/buffer_pool.h\",\n \"rank\": 85,\n \"score\": 59703.027371899436\n },\n {\n \"content\": \" virtual void SetHotplugDevCallBack(HotplugDevCb cb)\\n\\n {\\n\\n (void)cb;\\n\\n return;\\n\\n };\\n\\n virtual RetCode PreConfig(const ModeMeta& meta, const std::vector<DeviceStreamSetting>& settings)\\n\\n {\\n\\n (void)meta;\\n\\n (void)settings;\\n\\n return RC_OK;\\n\\n }\\n\\n virtual RetCode Flush(int32_t streamId)\\n\\n {\\n\\n (void)streamId;\\n\\n return RC_OK;\\n\\n }\\n\\n virtual RetCode StartRecvFrame(int32_t streamId)\\n\\n {\\n\\n (void)streamId;\\n\\n return RC_OK;\\n\",\n \"file_path\": \"camera/hal/device_manager/include/idevice_manager.h\",\n \"rank\": 86,\n \"score\": 59702.991177019554\n },\n {\n \"content\": \" }\\n\\n virtual RetCode StopRecvFrame(int32_t streamId)\\n\\n {\\n\\n (void)streamId;\\n\\n return RC_OK;\\n\\n }\\n\\n virtual void SetSendflag(bool flag)\\n\\n {\\n\\n (void)flag;\\n\\n return;\\n\\n }\\n\\n};\\n\\n} // namespace OHOS::Camera\\n\\n#endif\\n\",\n \"file_path\": \"camera/hal/device_manager/include/idevice_manager.h\",\n \"rank\": 87,\n \"score\": 59702.76202855506\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef I_PIPELINE_CORE_H\\n\\n#define I_PIPELINE_CORE_H\\n\\n\\n\\n#include <stdint.h>\\n\\n#include <cstdio>\\n\\n#include \\\"istream_pipeline_core.h\\\"\\n\\n#include \\\"no_copyable.h\\\"\\n\\n#include \\\"idevice_manager.h\\\"\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/pipeline_core/include/ipipeline_core.h\",\n \"rank\": 88,\n \"score\": 59702.619867320594\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_CAMERA_IDEVICED_MANAGER_H\\n\\n#define HOS_CAMERA_IDEVICED_MANAGER_H\\n\\n\\n\\n#include \\\"icontroller.h\\\"\\n\\n#include \\\"imanager.h\\\"\\n\\n#include \\\"device_manager_adapter.h\\\"\\n\\n#include \\\"isensor.h\\\"\\n\\n#include <vector>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/device_manager/include/idevice_manager.h\",\n \"rank\": 89,\n \"score\": 59702.58525116059\n },\n {\n \"content\": \" std::vector<std::shared_ptr<OHOS::Camera::StreamInfo>> streamInfos;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfo = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfoPre = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfoVideo = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::StreamInfo> streamInfoCapture = nullptr;\\n\\n std::shared_ptr<IBufferProducer> producer = nullptr;\\n\\n std::shared_ptr<IBufferProducer> producerCapture = nullptr;\\n\\n std::shared_ptr<IBufferProducer> producerVideo = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::CameraHost> cameraHost = nullptr;\\n\\n std::shared_ptr<OHOS::Camera::ICameraDevice> cameraDevice = nullptr;\\n\\n std::shared_ptr<CameraAbility> ability = nullptr;\\n\\n std::vector<int> captureIds;\\n\\n std::vector<std::string> cameraIds;\\n\\n std::vector<int> streamIds;\\n\\n std::vector<OHOS::Camera::StreamIntent> intents;\\n\\n enum {\\n\\n streamId_preview = 1000, // 1000:preview streamID\\n\\n streamId_capture,\\n\\n streamId_video,\\n\\n captureId_preview = 2000, // 2000:preview captureId\\n\",\n \"file_path\": \"camera/hal/test/v4l2/include/test_display.h\",\n \"rank\": 90,\n \"score\": 59702.57177291322\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef OHOS_CAMERA_METADATA_UTILS_H\\n\\n#define OHOS_CAMERA_METADATA_UTILS_H\\n\\n\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <iostream>\\n\\n#include \\\"camera_metadata_info.h\\\"\\n\\n\\n\\nnamespace OHOS {\\n\\nnamespace CameraStandard {\\n\",\n \"file_path\": \"camera/hal/utils/metadata/include/metadata_utils.h\",\n \"rank\": 91,\n \"score\": 59702.56235690794\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef CAMERA_DEVICE_CAMERA_DEVICE_H\\n\\n#define CAMERA_DEVICE_CAMERA_DEVICE_H\\n\\n\\n\\n#include \\\"camera_device_c_if.h\\\"\\n\\n#include \\\"camera_metadata_c_if.h\\\"\\n\\n#include \\\"camera_types_c_if.h\\\"\\n\\n#include \\\"icamera_device.h\\\"\\n\\n#include \\\"camera_device_stub.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal_c/hdi_cif/include/camera_device.h\",\n \"rank\": 92,\n \"score\": 59702.5396075817\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef CAMERA_HOST_CAMERA_HOST_H\\n\\n#define CAMERA_HOST_CAMERA_HOST_H\\n\\n\\n\\n#include \\\"camera_host_c_if.h\\\"\\n\\n#include \\\"camera_device_c_if.h\\\"\\n\\n#include \\\"icamera_host_callback.h\\\"\\n\\n#include \\\"icamera_device_callback.h\\\"\\n\\n#include \\\"icamera_device.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal_c/hdi_cif/include/camera_host.h\",\n \"rank\": 93,\n \"score\": 59702.52828683661\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HOS_BUFFER_ALLOCATOR_H\\n\\n#define HOS_BUFFER_ALLOCATOR_H\\n\\n\\n\\n#include \\\"buffer_allocator_factory.h\\\"\\n\\n#include \\\"ibuffer.h\\\"\\n\\n#include \\\"ibuffer_allocator.h\\\"\\n\\n#include <memory>\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal/buffer_manager/include/buffer_allocator.h\",\n \"rank\": 94,\n \"score\": 59702.32227222425\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef HDI_PARCEL_UTILS_V1_0_H \\n\\n#define HDI_PARCEL_UTILS_V1_0_H\\n\\n\\n\\n#include <message_parcel.h>\\n\\n#include \\\"hdf_sbuf_ipc.h\\\"\\n\\n#include \\\"display_type.h\\\"\\n\\n#include \\\"hdf_log.h\\\"\\n\\n\\n\\nnamespace OHOS {\\n\\nnamespace HDI {\\n\\nnamespace Display {\\n\\nnamespace V1_0 {\\n\",\n \"file_path\": \"display/hdi_service/gralloc/include/parcel_utils.h\",\n \"rank\": 95,\n \"score\": 59702.2043691727\n },\n {\n \"content\": \" virtual void DeliverBuffers(std::vector<std::shared_ptr<IBuffer>>& buffers) = 0;\\n\\n virtual void SetCallBack(BufferCb c) = 0;\\n\\n\\n\\n virtual RetCode ProvideBuffers(std::shared_ptr<FrameSpec> frameSpec) = 0;\\n\\n virtual void DeliverBuffers(std::shared_ptr<FrameSpec> frameSpec) = 0;\\n\\n virtual void DeliverBuffers(std::vector<std::shared_ptr<FrameSpec>> mergeVec) = 0;\\n\\n};\\n\\n\\n\\n\\n\\nusing NodeFactory = RegisterFactoty<INode, const std::string&, const std::string&>;\\n\\n\\n\\n#define REGISTERNODE(cls, ...) \\\\\\n\\nnamespace { \\\\\\n\\n static std::string g_##cls = NodeFactory::Instance().DoRegister<cls>(__VA_ARGS__, \\\\\\n\\n [](const std::string& name, const std::string& type) {return std::make_shared<cls>(name, type);}); \\\\\\n\\n}\\n\\n}\\n\\n#endif\\n\",\n \"file_path\": \"camera/hal/pipeline_core/nodes/include/inode.h\",\n \"rank\": 96,\n \"score\": 59702.14827709708\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef TEST_DISPLAY_H\\n\\n#define TEST_DISPLAY_H\\n\\n#include <gtest/gtest.h>\\n\\n#include \\\"camera.h\\\"\\n\\n#include \\\"camera_host.h\\\"\\n\",\n \"file_path\": \"camera/hal/test/v4l2/include/test_display.h\",\n \"rank\": 97,\n \"score\": 59702.004076162\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2021 Huawei Device Co., Ltd.\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef STREAM_OPERATOR_STREAM_OPERATOR_H\\n\\n#define STREAM_OPERATOR_STREAM_OPERATOR_H\\n\\n\\n\\n#include \\\"istream_operator.h\\\"\\n\\n#include \\\"stream_operator_c_if.h\\\"\\n\\n#include \\\"stream_operator_stub.h\\\"\\n\\n\\n\\nnamespace OHOS::Camera {\\n\",\n \"file_path\": \"camera/hal_c/hdi_cif/include/stream_operator.h\",\n \"rank\": 98,\n \"score\": 59701.86160074956\n },\n {\n \"content\": \" *\\n\\n * @param handle Indicates the reference to the buffer of the memory to map.\\n\\n *\\n\\n * @return Returns the pointer to a valid address if the operation is successful; returns <b>NULL</b> otherwise.\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void *Mmap(const BufferHandle &handle) const = 0;\\n\\n\\n\\n /**\\n\\n * @brief Maps memory to memory with cache in the process's address space.\\n\\n *\\n\\n * @param handle Indicates the reference to the buffer of the memory to map.\\n\\n *\\n\\n * @return Returns the pointer to a valid address if the operation is successful; returns <b>NULL</b> otherwise.\\n\\n * @since 1.0\\n\\n * @version 1.0\\n\\n */\\n\\n virtual void *MmapCache(const BufferHandle &buffer) const = 0;\\n\\n\\n\",\n \"file_path\": \"display/hdi_service/gralloc/include/idisplay_gralloc.h\",\n \"rank\": 99,\n \"score\": 59701.53527654348\n }\n]","isConversational":false}}},{"rowIdx":81,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/src/core/posix/child_process.cpp"},"repo_name":{"kind":"string","value":"akraino-edge-stack/iec"},"commit":{"kind":"string","value":"b01bce6165ef8368a607e17e1f3d4697b79db31b"},"file_code":{"kind":"string","value":"\n\n#include <core/posix/child_process.h>\n\n#ifndef ANDROID\n#include <boost/iostreams/device/file_descriptor.hpp>\n#include <boost/iostreams/stream.hpp>\n#endif\n\n#include <atomic>\n#include <fstream>\n#include <mutex>\n#include <unordered_map>\n\n#include <fcntl.h>\n#include <poll.h>\n#include <unistd.h>\n\n#include <sys/eventfd.h>\n#include <sys/signalfd.h>\n\n#include <assert.h>\n\n#include <sys/wait.h>\n\n#ifndef ANDROID\nnamespace io = boost::iostreams;\n#endif\n\nnamespace\n{\n\nstruct DeathObserverImpl : public core::posix::ChildProcess::DeathObserver\n{\n DeathObserverImpl(const std::shared_ptr<core::posix::SignalTrap>& trap)\n : on_sig_child_connection\n {\n trap->signal_raised().connect([this](core::posix::Signal signal)\n {\n switch (signal)\n {\n case core::posix::Signal::sig_chld:\n on_sig_child();\n break;\n default:\n break;\n }\n })\n }\n {\n if (!trap->has(core::posix::Signal::sig_chld))\n throw std::logic_error(\n \"DeathObserver::DeathObserverImpl: Given SignalTrap\"\n \" instance does not trap Signal::sig_chld.\");\n }\n\n bool add(const core::posix::ChildProcess& process) override\n {\n if (process.pid() == -1)\n return false;\n\n std::lock_guard<std::mutex> lg(guard);\n\n bool added = false;\n auto new_process = std::make_pair(process.pid(), process);\n std::tie(std::ignore, added) = children.insert(new_process);\n\n if (added)\n {\n \n \n int status{-1};\n if (::waitpid(process.pid(), &status, WNOHANG) != 0) \n {\n \n \n signals.child_died(new_process.second);\n children.erase(new_process.first);\n return false;\n }\n }\n\n return added;\n }\n\n bool has(const core::posix::ChildProcess& process) const override\n {\n std::lock_guard<std::mutex> lg(guard);\n return children.count(process.pid()) > 0;\n }\n\n const core::Signal<core::posix::ChildProcess>& child_died() const override\n {\n return signals.child_died;\n }\n\n void on_sig_child() override\n {\n pid_t pid{-1}; int status{-1};\n while (true)\n {\n pid = ::waitpid(0, &status, WNOHANG);\n\n if (pid == -1)\n {\n if (errno == ECHILD)\n {\n break; \n }\n continue; \n }\n else if (pid == 0)\n {\n break; \n }\n else\n {\n std::lock_guard<std::mutex> lg(guard);\n auto it = children.find(pid);\n\n if (it != children.end())\n {\n if (WIFSIGNALED(status) || WIFEXITED(status))\n {\n signals.child_died(it->second);\n children.erase(it);\n }\n }\n }\n }\n }\n\n mutable std::mutex guard;\n std::unordered_map<pid_t, core::posix::ChildProcess> children;\n core::ScopedConnection on_sig_child_connection;\n struct\n {\n core::Signal<core::posix::ChildProcess> child_died;\n } signals;\n};\n}\n\nstd::unique_ptr<core::posix::ChildProcess::DeathObserver>\ncore::posix::ChildProcess::DeathObserver::create_once_with_signal_trap(\n std::shared_ptr<core::posix::SignalTrap> trap)\n{\n static std::atomic<bool> has_been_created_once{false};\n\n if (has_been_created_once.exchange(true))\n throw std::runtime_error\n {\n \"DeathObserver::create_once_with_signal_trap: \"\n \"Cannot create more than one instance.\"\n };\n\n try\n {\n std::unique_ptr<core::posix::ChildProcess::DeathObserver> result\n {\n new DeathObserverImpl{trap}\n };\n\n return result;\n } catch(...)\n {\n \n \n has_been_created_once.store(false);\n\n std::rethrow_exception(std::current_exception());\n }\n\n assert(false && \"We should never reach here.\");\n\n \n return std::unique_ptr<core::posix::ChildProcess::DeathObserver>{};\n}\n\nnamespace core\n{\nnamespace posix\n{\nChildProcess::Pipe ChildProcess::Pipe::invalid()\n{\n static Pipe p;\n static std::once_flag flag;\n\n std::call_once(flag, [&]() { p.close_read_fd(); p.close_write_fd(); });\n\n return p;\n}\n\nChildProcess::Pipe::Pipe()\n{\n int rc = ::pipe(fds);\n\n if (rc == -1)\n throw std::system_error(errno, std::system_category());\n}\n\nChildProcess::Pipe::Pipe(const ChildProcess::Pipe& rhs) : fds{-1, -1}\n{\n if (rhs.fds[0] != -1)\n fds[0] = ::dup(rhs.fds[0]);\n\n if (rhs.fds[1] != -1)\n fds[1] = ::dup(rhs.fds[1]);\n}\n\nChildProcess::Pipe::~Pipe()\n{\n if (fds[0] != -1)\n ::close(fds[0]);\n if (fds[1] != -1)\n ::close(fds[1]);\n}\n\nint ChildProcess::Pipe::read_fd() const\n{\n return fds[0];\n}\n\nvoid ChildProcess::Pipe::close_read_fd()\n{\n if (fds[0] != -1)\n {\n ::close(fds[0]);\n fds[0] = -1;\n }\n}\n\nint ChildProcess::Pipe::write_fd() const\n{\n return fds[1];\n}\n\nvoid ChildProcess::Pipe::close_write_fd()\n{\n if (fds[1] != -1)\n {\n ::close(fds[1]);\n fds[1] = -1;\n }\n}\n\nChildProcess::Pipe& ChildProcess::Pipe::operator=(const ChildProcess::Pipe& rhs)\n{\n if (fds[0] != -1)\n ::close(fds[0]);\n if (fds[1] != -1)\n ::close(fds[1]);\n\n if (rhs.fds[0] != -1)\n fds[0] = ::dup(rhs.fds[0]);\n else\n fds[0] = -1;\n if (rhs.fds[1] != -1)\n fds[1] = ::dup(rhs.fds[1]);\n else\n fds[1] = -1;\n\n return *this;\n}\n\nstruct ChildProcess::Private\n{\n \n \n Private(pid_t pid,\n const ChildProcess::Pipe& stderr,\n const ChildProcess::Pipe& stdin,\n const ChildProcess::Pipe& stdout)\n : pipes{stderr, stdin, stdout},\n#ifndef ANDROID\n serr(pipes.stderr.read_fd(), io::never_close_handle),\n sin(pipes.stdin.write_fd(), io::never_close_handle),\n sout(pipes.stdout.read_fd(), io::never_close_handle),\n cerr(&serr),\n cin(&sin),\n cout(&sout),\n#endif\n original_parent_pid(::getpid()),\n original_child_pid(pid)\n {\n }\n\n ~Private()\n {\n \n if (original_parent_pid == getpid() && !dont_kill_on_cleanup)\n {\n \n \n if (original_child_pid != -1)\n ::kill(original_child_pid, SIGKILL);\n }\n }\n\n struct\n {\n ChildProcess::Pipe stdin;\n ChildProcess::Pipe stdout;\n ChildProcess::Pipe stderr;\n } pipes;\n\n#ifndef ANDROID\n io::stream_buffer<io::file_descriptor_source> serr;\n io::stream_buffer<io::file_descriptor_sink> sin;\n io::stream_buffer<io::file_descriptor_source> sout;\n std::istream cerr;\n std::ostream cin;\n std::istream cout;\n#endif\n\n \n \n \n pid_t original_parent_pid;\n pid_t original_child_pid;\n\n bool dont_kill_on_cleanup = false;\n};\n\nChildProcess ChildProcess::invalid()\n{\n \n static const pid_t invalid_pid = 1;\n return ChildProcess(invalid_pid, Pipe::invalid(), Pipe::invalid(), Pipe::invalid());\n}\n\nChildProcess::ChildProcess(pid_t pid,\n const ChildProcess::Pipe& stdin_pipe,\n const ChildProcess::Pipe& stdout_pipe,\n const ChildProcess::Pipe& stderr_pipe)\n : Process(pid),\n d(new Private{pid, stdin_pipe, stdout_pipe, stderr_pipe})\n{\n}\n\nChildProcess::~ChildProcess()\n{\n}\n\nwait::Result ChildProcess::wait_for(const wait::Flags& flags)\n{\n int status = -1;\n pid_t result_pid = ::waitpid(pid(), std::addressof(status), static_cast<int>(flags));\n\n if (result_pid == -1)\n throw std::system_error(errno, std::system_category());\n\n wait::Result result;\n\n if (result_pid == 0)\n {\n result.status = wait::Result::Status::no_state_change;\n return result;\n }\n\n if (WIFEXITED(status))\n {\n result.status = wait::Result::Status::exited;\n result.detail.if_exited.status = static_cast<exit::Status>(WEXITSTATUS(status));\n } else if (WIFSIGNALED(status))\n {\n result.status = wait::Result::Status::signaled;\n result.detail.if_signaled.signal = static_cast<Signal>(WTERMSIG(status));\n result.detail.if_signaled.core_dumped = WCOREDUMP(status);\n } else if (WIFSTOPPED(status))\n {\n result.status = wait::Result::Status::stopped;\n result.detail.if_stopped.signal = static_cast<Signal>(WSTOPSIG(status));\n }\n#ifndef ANDROID\n else if (WIFCONTINUED(status))\n {\n result.status = wait::Result::Status::continued;\n }\n#endif\n\n return result;\n}\n\nvoid ChildProcess::dont_kill_on_cleanup()\n{\n d->dont_kill_on_cleanup = true;\n}\n\n#ifndef ANDROID\nstd::istream& ChildProcess::cerr()\n{\n return d->cerr;\n}\n\nstd::ostream& ChildProcess::cin()\n{\n return d->cin;\n}\n\nstd::istream& ChildProcess::cout()\n{\n return d->cout;\n}\n#endif\n}\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <core/posix/child_process.h>\n\n#ifndef ANDROID\n#include <boost/iostreams/device/file_descriptor.hpp>\n#include <boost/iostreams/stream.hpp>\n#endif\n\n#include <atomic>\n#include <fstream>\n#include <mutex>\n#include <unordered_map>\n\n#include <fcntl.h>\n#include <poll.h>\n#include <unistd.h>\n\n#include <sys/eventfd.h>\n#include <sys/signalfd.h>\n\n#include <assert.h>\n\n#include <sys/wait.h>\n\n#ifndef ANDROID\nnamespace io = boost::iostreams;\n#endif\n\nnamespace\n{\n\nstruct DeathObserverImpl : public core::posix::ChildProcess::DeathObserver\n{\n "},"suffix":{"kind":"string","value":"\n\n bool add(const core::posix::ChildProcess& process) override\n {\n if (process.pid() == -1)\n return false;\n\n std::lock_guard<std::mutex> lg(guard);\n\n bool added = false;\n auto new_process = std::make_pair(process.pid(), process);\n std::tie(std::ignore, added) = children.insert(new_process);\n\n if (added)\n {\n \n \n int status{-1};\n if (::waitpid(process.pid(), &status, WNOHANG) != 0) \n {\n \n \n signals.child_died(new_process.second);\n children.erase(new_process.first);\n return false;\n }\n }\n\n return added;\n }\n\n bool has(const core::posix::ChildProcess& process) const override\n {\n std::lock_guard<std::mutex> lg(guard);\n return children.count(process.pid()) > 0;\n }\n\n const core::Signal<core::posix::ChildProcess>& child_died() const override\n {\n return signals.child_died;\n }\n\n void on_sig_child() override\n {\n pid_t pid{-1}; int status{-1};\n while (true)\n {\n pid = ::waitpid(0, &status, WNOHANG);\n\n if (pid == -1)\n {\n if (errno == ECHILD)\n {\n break; \n }\n continue; \n }\n else if (pid == 0)\n {\n break; \n }\n else\n {\n std::lock_guard<std::mutex> lg(guard);\n auto it = children.find(pid);\n\n if (it != children.end())\n {\n if (WIFSIGNALED(status) || WIFEXITED(status))\n {\n signals.child_died(it->second);\n children.erase(it);\n }\n }\n }\n }\n }\n\n mutable std::mutex guard;\n std::unordered_map<pid_t, core::posix::ChildProcess> children;\n core::ScopedConnection on_sig_child_connection;\n struct\n {\n core::Signal<core::posix::ChildProcess> child_died;\n } signals;\n};\n}\n\nstd::unique_ptr<core::posix::ChildProcess::DeathObserver>\ncore::posix::ChildProcess::DeathObserver::create_once_with_signal_trap(\n std::shared_ptr<core::posix::SignalTrap> trap)\n{\n static std::atomic<bool> has_been_created_once{false};\n\n if (has_been_created_once.exchange(true))\n throw std::runtime_error\n {\n \"DeathObserver::create_once_with_signal_trap: \"\n \"Cannot create more than one instance.\"\n };\n\n try\n {\n std::unique_ptr<core::posix::ChildProcess::DeathObserver> result\n {\n new DeathObserverImpl{trap}\n };\n\n return result;\n } catch(...)\n {\n \n \n has_been_created_once.store(false);\n\n std::rethrow_exception(std::current_exception());\n }\n\n assert(false && \"We should never reach here.\");\n\n \n return std::unique_ptr<core::posix::ChildProcess::DeathObserver>{};\n}\n\nnamespace core\n{\nnamespace posix\n{\nChildProcess::Pipe ChildProcess::Pipe::invalid()\n{\n static Pipe p;\n static std::once_flag flag;\n\n std::call_once(flag, [&]() { p.close_read_fd(); p.close_write_fd(); });\n\n return p;\n}\n\nChildProcess::Pipe::Pipe()\n{\n int rc = ::pipe(fds);\n\n if (rc == -1)\n throw std::system_error(errno, std::system_category());\n}\n\nChildProcess::Pipe::Pipe(const ChildProcess::Pipe& rhs) : fds{-1, -1}\n{\n if (rhs.fds[0] != -1)\n fds[0] = ::dup(rhs.fds[0]);\n\n if (rhs.fds[1] != -1)\n fds[1] = ::dup(rhs.fds[1]);\n}\n\nChildProcess::Pipe::~Pipe()\n{\n if (fds[0] != -1)\n ::close(fds[0]);\n if (fds[1] != -1)\n ::close(fds[1]);\n}\n\nint ChildProcess::Pipe::read_fd() const\n{\n return fds[0];\n}\n\nvoid ChildProcess::Pipe::close_read_fd()\n{\n if (fds[0] != -1)\n {\n ::close(fds[0]);\n fds[0] = -1;\n }\n}\n\nint ChildProcess::Pipe::write_fd() const\n{\n return fds[1];\n}\n\nvoid ChildProcess::Pipe::close_write_fd()\n{\n if (fds[1] != -1)\n {\n ::close(fds[1]);\n fds[1] = -1;\n }\n}\n\nChildProcess::Pipe& ChildProcess::Pipe::operator=(const ChildProcess::Pipe& rhs)\n{\n if (fds[0] != -1)\n ::close(fds[0]);\n if (fds[1] != -1)\n ::close(fds[1]);\n\n if (rhs.fds[0] != -1)\n fds[0] = ::dup(rhs.fds[0]);\n else\n fds[0] = -1;\n if (rhs.fds[1] != -1)\n fds[1] = ::dup(rhs.fds[1]);\n else\n fds[1] = -1;\n\n return *this;\n}\n\nstruct ChildProcess::Private\n{\n \n \n Private(pid_t pid,\n const ChildProcess::Pipe& stderr,\n const ChildProcess::Pipe& stdin,\n const ChildProcess::Pipe& stdout)\n : pipes{stderr, stdin, stdout},\n#ifndef ANDROID\n serr(pipes.stderr.read_fd(), io::never_close_handle),\n sin(pipes.stdin.write_fd(), io::never_close_handle),\n sout(pipes.stdout.read_fd(), io::never_close_handle),\n cerr(&serr),\n cin(&sin),\n cout(&sout),\n#endif\n original_parent_pid(::getpid()),\n original_child_pid(pid)\n {\n }\n\n ~Private()\n {\n \n if (original_parent_pid == getpid() && !dont_kill_on_cleanup)\n {\n \n \n if (original_child_pid != -1)\n ::kill(original_child_pid, SIGKILL);\n }\n }\n\n struct\n {\n ChildProcess::Pipe stdin;\n ChildProcess::Pipe stdout;\n ChildProcess::Pipe stderr;\n } pipes;\n\n#ifndef ANDROID\n io::stream_buffer<io::file_descriptor_source> serr;\n io::stream_buffer<io::file_descriptor_sink> sin;\n io::stream_buffer<io::file_descriptor_source> sout;\n std::istream cerr;\n std::ostream cin;\n std::istream cout;\n#endif\n\n \n \n \n pid_t original_parent_pid;\n pid_t original_child_pid;\n\n bool dont_kill_on_cleanup = false;\n};\n\nChildProcess ChildProcess::invalid()\n{\n \n static const pid_t invalid_pid = 1;\n return ChildProcess(invalid_pid, Pipe::invalid(), Pipe::invalid(), Pipe::invalid());\n}\n\nChildProcess::ChildProcess(pid_t pid,\n const ChildProcess::Pipe& stdin_pipe,\n const ChildProcess::Pipe& stdout_pipe,\n const ChildProcess::Pipe& stderr_pipe)\n : Process(pid),\n d(new Private{pid, stdin_pipe, stdout_pipe, stderr_pipe})\n{\n}\n\nChildProcess::~ChildProcess()\n{\n}\n\nwait::Result ChildProcess::wait_for(const wait::Flags& flags)\n{\n int status = -1;\n pid_t result_pid = ::waitpid(pid(), std::addressof(status), static_cast<int>(flags));\n\n if (result_pid == -1)\n throw std::system_error(errno, std::system_category());\n\n wait::Result result;\n\n if (result_pid == 0)\n {\n result.status = wait::Result::Status::no_state_change;\n return result;\n }\n\n if (WIFEXITED(status))\n {\n result.status = wait::Result::Status::exited;\n result.detail.if_exited.status = static_cast<exit::Status>(WEXITSTATUS(status));\n } else if (WIFSIGNALED(status))\n {\n result.status = wait::Result::Status::signaled;\n result.detail.if_signaled.signal = static_cast<Signal>(WTERMSIG(status));\n result.detail.if_signaled.core_dumped = WCOREDUMP(status);\n } else if (WIFSTOPPED(status))\n {\n result.status = wait::Result::Status::stopped;\n result.detail.if_stopped.signal = static_cast<Signal>(WSTOPSIG(status));\n }\n#ifndef ANDROID\n else if (WIFCONTINUED(status))\n {\n result.status = wait::Result::Status::continued;\n }\n#endif\n\n return result;\n}\n\nvoid ChildProcess::dont_kill_on_cleanup()\n{\n d->dont_kill_on_cleanup = true;\n}\n\n#ifndef ANDROID\nstd::istream& ChildProcess::cerr()\n{\n return d->cerr;\n}\n\nstd::ostream& ChildProcess::cin()\n{\n return d->cin;\n}\n\nstd::istream& ChildProcess::cout()\n{\n return d->cout;\n}\n#endif\n}\n}\n"},"middle":{"kind":"string","value":"DeathObserverImpl(const std::shared_ptr<core::posix::SignalTrap>& trap)\n : on_sig_child_connection\n {\n trap->signal_raised().connect([this](core::posix::Signal signal)\n {\n switch (signal)\n {\n case core::posix::Signal::sig_chld:\n on_sig_child();\n break;\n default:\n break;\n }\n })\n }\n {\n if (!trap->has(core::posix::Signal::sig_chld))\n throw std::logic_error(\n \"DeathObserver::DeathObserverImpl: Given SignalTrap\"\n \" instance does not trap Signal::sig_chld.\");\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"struct CORE_POSIX_DLL_PUBLIC Stat\n\n{\n\n pid_t pid = 1; ///< The process ID\n\n std::string executable; ///< The filename of the executable, in parentheses.\n\n State state = State::undefined; ///< State of the process.\n\n pid_t parent = -1; ///< The PID of the parent.\n\n pid_t process_group = -1; ///< The process group ID of the process.\n\n int session_id = -1; ///< The session ID of the process.\n\n int tty_nr = -1; ///< The controlling terminal of the process.\n\n int controlling_process_group = -1; ///< The ID of the foreground process group of the controlling terminal of the process.\n\n unsigned int kernel_flags = 0; ///< The kernel flags word of the process.\n\n long unsigned int minor_faults_count = 0; ///< The number of minor faults the process has made which have not required loading a memory page from disk.\n\n long unsigned int minor_faults_count_by_children = 0; ///< The number of minor faults that the process's waited-for children have made.\n\n long unsigned int major_faults_count = 0; ///< The number of major faults the process has made which have required loading a memory page from disk.\n\n long unsigned int major_faults_count_by_children = 0; ///< The number of major faults that the process's waited-for children have made.\n\n struct\n\n {\n\n long unsigned int user = 0; ///< Amount of time that this process has been scheduled in user mode, [clock ticks].\n\n long unsigned int system = 0; ///< Amount of time that this process has been scheduled in kernel mode, [clock ticks].\n\n long unsigned int user_for_children = 0; ///< Amount of time that this process's waited-for children have been scheduled in user mode, [clock ticks].\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/stat.h","rank":0,"score":222090.82454406342},{"content":"struct CORE_POSIX_DLL_PUBLIC OomAdj\n\n{\n\n /**\n\n * @brief Returns the value that makes a process \"invisible\" to the oom killer.\n\n * @return Returns the value that makes a process \"invisible\" to the oom killer.\n\n */\n\n static int disable_value();\n\n\n\n /**\n\n * @brief Returns the minimum valid value.\n\n * @return The minimum valid value that the OomAdj can be set to.\n\n */\n\n static int min_value();\n\n\n\n /**\n\n * @brief Returns the maximum valid value.\n\n * @return The maximum valid value that the OomAdj can be set to.\n\n */\n\n static int max_value();\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/oom_adj.h","rank":1,"score":217568.5732575133},{"content":"struct CORE_POSIX_DLL_PUBLIC OomScore\n\n{\n\n int value = 0; ///< Current OomScore as calculated by the kernel.\n\n};\n\n\n\n/**\n\n * \\brief Read the OomScore for a process instance.\n\n * \\throws std::runtime_error in case of errors.\n\n * \\param [in] process The process to read the score for.\n\n * \\param [out] score The destination to store the value in.\n\n */\n\nCORE_POSIX_DLL_PUBLIC const posix::Process& operator>>(const posix::Process& process, OomScore& score);\n\n}\n\n}\n\n}\n\n}\n\n}\n\n#endif // CORE_POSIX_LINUX_PROC_PROCESS_OOM_SCORE_H_\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/oom_score.h","rank":2,"score":217568.5732575133},{"content":"struct CORE_POSIX_DLL_PUBLIC OomScoreAdj\n\n{\n\n /**\n\n * @brief Returns the minimum valid value.\n\n * @return The minimum valid value that the Oom Score Adj can be set to.\n\n */\n\n static int min_value();\n\n\n\n /**\n\n * @brief Returns the maximum valid value.\n\n * @return The maximum valid value that the Oom Score Adj can be set to.\n\n */\n\n static int max_value();\n\n\n\n /**\n\n * @brief is_valid checks whether the contained value is within the predefined bounds.\n\n * @return true iff min_value() <= value <= max_value().\n\n */\n\n inline bool is_valid() const\n\n {\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/oom_score_adj.h","rank":3,"score":213251.78402233793},{"content":"struct egl_pbuffer_surface_t : public egl_surface_t {\n\n static egl_pbuffer_surface_t* create(EGLDisplay dpy, EGLConfig config,\n\n EGLint surfType, int32_t w, int32_t h, GLenum pixelFormat);\n\n\n\n virtual ~egl_pbuffer_surface_t();\n\n\n\n virtual void setSwapInterval(int interval) { (void)interval; }\n\n virtual EGLBoolean swapBuffers() { return EGL_TRUE; }\n\n\n\n uint32_t getRcColorBuffer() { return rcColorBuffer; }\n\n\n\nprivate:\n\n egl_pbuffer_surface_t(EGLDisplay dpy, EGLConfig config, EGLint surfType,\n\n int32_t w, int32_t h);\n\n EGLBoolean init(GLenum format);\n\n\n\n uint32_t rcColorBuffer;\n\n};\n\n\n\negl_pbuffer_surface_t::egl_pbuffer_surface_t(EGLDisplay dpy, EGLConfig config,\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/egl/egl.cpp","rank":4,"score":208640.26342689333},{"content":"struct egl_window_surface_t : public egl_surface_t {\n\n static egl_window_surface_t* create(\n\n EGLDisplay dpy, EGLConfig config, EGLint surfType,\n\n ANativeWindow* window);\n\n\n\n virtual ~egl_window_surface_t();\n\n\n\n virtual void setSwapInterval(int interval);\n\n virtual EGLBoolean swapBuffers();\n\n\n\nprivate:\n\n egl_window_surface_t(\n\n EGLDisplay dpy, EGLConfig config, EGLint surfType,\n\n ANativeWindow* window);\n\n EGLBoolean init();\n\n\n\n ANativeWindow* nativeWindow;\n\n android_native_buffer_t* buffer;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/egl/egl.cpp","rank":5,"score":208640.26342689333},{"content":"struct ResolvedTrace: public Trace {\n\n\n\n\tstruct SourceLoc {\n\n\t\tstd::string function;\n\n\t\tstd::string filename;\n\n\t\tunsigned line;\n\n\t\tunsigned col;\n\n\n\n\t\tSourceLoc(): line(0), col(0) {}\n\n\n\n\t\tbool operator==(const SourceLoc& b) const {\n\n\t\t\treturn function == b.function\n\n\t\t\t\t&& filename == b.filename\n\n\t\t\t\t&& line == b.line\n\n\t\t\t\t&& col == b.col;\n\n\t\t}\n\n\n\n\t\tbool operator!=(const SourceLoc& b) const {\n\n\t\t\treturn !(*this == b);\n\n\t\t}\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp","rank":6,"score":203027.64200824406},{"content":"// Wrapper class for threads. Does not use emugl::Thread intentionally.\n\n// Common data type used by the following tests below.\n\nstruct ThreadParams {\n\n ThreadParams() : mutex(), counter(0) {}\n\n\n\n Mutex mutex;\n\n int counter;\n\n};\n\n\n\n// This thread function uses Mutex::lock/unlock to synchronize a counter\n\n// increment operation.\n\nstatic void* threadFunction(void* param) {\n\n ThreadParams* p = static_cast<ThreadParams*>(param);\n\n\n\n p->mutex.lock();\n\n p->counter++;\n\n p->mutex.unlock();\n\n return NULL;\n\n}\n\n\n\nTEST(Mutex, Synchronization) {\n\n const size_t kNumThreads = 2000;\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/mutex_unittest.cpp","rank":7,"score":198444.11757226574},{"content":"struct BoostLogLogger : public anbox::Logger {\n\n BoostLogLogger() : initialized_(false) {}\n\n\n\n void Init(const anbox::Logger::Severity& severity = anbox::Logger::Severity::kWarning) override {\n\n if (initialized_)\n\n return;\n\n\n\n boost::log::formatter formatter =\n\n boost::log::expressions::stream\n\n << \"[\" << attrs::Severity << \" \"\n\n << boost::log::expressions::format_date_time<boost::posix_time::ptime>(\n\n \"Timestamp\", \"%Y-%m-%d %H:%M:%S\")\n\n << \"] \"\n\n << boost::log::expressions::if_(boost::log::expressions::has_attr(\n\n attrs::Location))[boost::log::expressions::stream\n\n << \"[\" << attrs::Location << \"] \"]\n\n << boost::log::expressions::smessage;\n\n\n\n boost::log::core::get()->remove_all_sinks();\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/logger.cpp","rank":8,"score":194612.73058538302},{"content":"class BufferedIOStream : public IOStream {\n\n public:\n\n static const size_t default_buffer_size{384};\n\n\n\n explicit BufferedIOStream(\n\n const std::shared_ptr<anbox::network::SocketMessenger> &messenger,\n\n size_t buffer_size = default_buffer_size);\n\n\n\n virtual ~BufferedIOStream();\n\n\n\n void *allocBuffer(size_t min_size) override;\n\n size_t commitBuffer(size_t size) override;\n\n const unsigned char *read(void *buf, size_t *inout_len) override;\n\n void forceStop() override;\n\n void post_data(Buffer &&data);\n\n\n\n bool needs_data();\n\n\n\n private:\n\n void thread_main();\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/buffered_io_stream.h","rank":9,"score":194413.6886367628},{"content":"struct Frame : public bt::Frame\n\n{\n\n struct Symbol : public bt::Frame::Symbol\n\n {\n\n Symbol(const char* symbol) : raw_(symbol)\n\n {\n\n auto first = raw_.find_first_of(\"(\");\n\n auto last = raw_.find_last_of(\")\");\n\n\n\n if (first != std::string::npos && last != std::string::npos)\n\n {\n\n auto mangled_symbol = raw_.substr(first+1,\n\n (last-1) - (first+1));\n\n\n\n auto plus = mangled_symbol.find_first_of(\"+\");\n\n if (plus != std::string::npos)\n\n mangled_symbol.erase(plus);\n\n\n\n std::tie(demangled_, is_cxx_) = demangle(mangled_symbol);\n\n if (!is_cxx_)\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/src/core/posix/backtrace.cpp","rank":10,"score":188880.3079810391},{"content":"struct AsioStrandDispatcher : public anbox::common::Dispatcher {\n\n public:\n\n AsioStrandDispatcher(const std::shared_ptr<anbox::Runtime>& rt)\n\n : rt{rt}, strand{rt->service()} {}\n\n\n\n void dispatch(const Task& task) override { strand.post(task); }\n\n\n\n private:\n\n std::shared_ptr<anbox::Runtime> rt;\n\n boost::asio::io_service::strand strand;\n\n};\n\n}\n\n\n\nstd::shared_ptr<anbox::common::Dispatcher>\n\nanbox::common::create_dispatcher_for_runtime(\n\n const std::shared_ptr<anbox::Runtime>& rt) {\n\n return std::make_shared<AsioStrandDispatcher>(rt);\n\n}\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/common/dispatcher.cpp","rank":11,"score":185899.17797578397},{"content":"class SocketStream : public IOStream {\n\npublic:\n\n typedef enum { ERR_INVALID_SOCKET = -1000 } SocketStreamError;\n\n\n\n explicit SocketStream(size_t bufsize = 10000);\n\n virtual ~SocketStream();\n\n\n\n virtual int listen(unsigned short port) = 0;\n\n virtual SocketStream *accept() = 0;\n\n virtual int connect(unsigned short port) = 0;\n\n\n\n virtual void *allocBuffer(size_t minSize);\n\n virtual int commitBuffer(size_t size);\n\n virtual const unsigned char *readFully(void *buf, size_t len);\n\n virtual const unsigned char *read(void *buf, size_t *inout_len);\n\n\n\n bool valid() { return m_sock >= 0; }\n\n virtual int recv(void *buf, size_t len);\n\n virtual int writeFully(const void *buf, size_t len);\n\n\n\nprotected:\n\n int m_sock;\n\n size_t m_bufsize;\n\n unsigned char *m_buf;\n\n\n\n SocketStream(int sock, size_t bufSize);\n\n};\n\n\n\n#endif /* __SOCKET_STREAM_H */\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/SocketStream.h","rank":13,"score":183805.24810516567},{"content":"class QemuPipeStream : public IOStream {\n\npublic:\n\n typedef enum { ERR_INVALID_SOCKET = -1000 } QemuPipeStreamError;\n\n\n\n explicit QemuPipeStream(size_t bufsize = 10000);\n\n ~QemuPipeStream();\n\n int connect(void);\n\n\n\n virtual void *allocBuffer(size_t minSize);\n\n virtual int commitBuffer(size_t size);\n\n virtual const unsigned char *readFully( void *buf, size_t len);\n\n virtual const unsigned char *read( void *buf, size_t *inout_len);\n\n\n\n bool valid() { return m_sock >= 0; }\n\n int recv(void *buf, size_t len);\n\n\n\n virtual int writeFully(const void *buf, size_t len);\n\n\n\nprivate:\n\n int m_sock;\n\n size_t m_bufsize;\n\n unsigned char *m_buf;\n\n QemuPipeStream(int sock, size_t bufSize);\n\n};\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/OpenglSystemCommon/QemuPipeStream.h","rank":14,"score":180413.66498049602},{"content":"class CORE_POSIX_DLL_PUBLIC Process : public Signalable\n\n{\n\npublic:\n\n /**\n\n * @brief Creates a process instance wrapping an existing process.\n\n * @throw Throw std::system_error if pid is invalid, i.e., pid < 0.\n\n * @param pid The process identifier of the existing process.\n\n */\n\n explicit Process(pid_t pid);\n\n\n\n /**\n\n * @brief Returns an invalid instance for testing purposes.\n\n * @return An invalid instance.\n\n */\n\n static Process invalid();\n\n\n\n /**\n\n * @brief Frees resources associated with the process.\n\n */\n\n virtual ~Process() noexcept;\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/process.h","rank":15,"score":179511.43312866765},{"content":"class IOStream {\n\npublic:\n\n\n\n IOStream(size_t bufSize) {\n\n m_buf = NULL;\n\n m_bufsize = bufSize;\n\n m_free = 0;\n\n }\n\n\n\n virtual void *allocBuffer(size_t minSize) = 0;\n\n virtual int commitBuffer(size_t size) = 0;\n\n virtual const unsigned char *readFully( void *buf, size_t len) = 0;\n\n virtual const unsigned char *read( void *buf, size_t *inout_len) = 0;\n\n virtual int writeFully(const void* buf, size_t len) = 0;\n\n\n\n virtual ~IOStream() {\n\n\n\n // NOTE: m_buf is 'owned' by the child class thus we expect it to be released by it\n\n }\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h","rank":16,"score":177961.21543588617},{"content":"class IOStream {\n\npublic:\n\n IOStream(size_t bufSize) {\n\n m_buf = NULL;\n\n m_bufsize = bufSize;\n\n m_free = 0;\n\n }\n\n\n\n virtual void *allocBuffer(size_t minSize) = 0;\n\n virtual size_t commitBuffer(size_t size) = 0;\n\n virtual const unsigned char *read(void *buf, size_t *inout_len) = 0;\n\n virtual void forceStop() = 0;\n\n\n\n virtual ~IOStream() {\n\n // NOTE: m_buf is 'owned' by the child class thus we expect it to be released by it\n\n }\n\n\n\n unsigned char *alloc(size_t len) {\n\n if (m_buf && len > m_free) {\n\n if (flush() < 0)\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h","rank":17,"score":176310.6235429296},{"content":"class CORE_POSIX_DLL_PUBLIC ChildProcess : public Process\n\n{\n\npublic:\n\n /**\n\n * @brief The DeathObserver class observes child process' states and emits a signal when a monitored child has died.\n\n *\n\n * Please note that the name of this class is morbid for a reason: Listening\n\n * for SIGCHLD is not enough to catch all dying children. Whenever a SIGCHLD is\n\n * received, we have to wait for all the children of this process and reap all\n\n * monitored ones. We are thus changing state and potentially race with other\n\n * wait operations on children.\n\n *\n\n */\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/child_process.h","rank":18,"score":176306.98362636007},{"content":"class CORE_POSIX_DLL_PUBLIC ProcessGroup : public Signalable\n\n{\n\npublic:\n\n /**\n\n * @brief Accesses the id of this process group.\n\n * @return The id of this process group.\n\n */\n\n virtual pid_t id() const;\n\n\n\n static ProcessGroup invalid();\n\n\n\nprotected:\n\n friend class Process;\n\n CORE_POSIX_DLL_LOCAL ProcessGroup(pid_t id);\n\n\n\nprivate:\n\n struct CORE_POSIX_DLL_LOCAL Private;\n\n std::shared_ptr<Private> d;\n\n};\n\n}\n\n}\n\n\n\n#endif // CORE_POSIX_PROCESS_GROUP_H_\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/process_group.h","rank":19,"score":176306.98362636007},{"content":"/*\n\n* Copyright (C) 2011 The Android Open Source Project\n\n*\n\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n\n* you may not use this file except in compliance with the License.\n\n* You may obtain a copy of the License at\n\n*\n\n* http://www.apache.org/licenses/LICENSE-2.0\n\n*\n\n* Unless required by applicable law or agreed to in writing, software\n\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n* See the License for the specific language governing permissions and\n\n* limitations under the License.\n\n*/\n\n#ifndef __IO_STREAM_H__\n\n#define __IO_STREAM_H__\n\n\n\n#include <stdlib.h>\n\n#include <stdio.h>\n\n\n\n#include \"ErrorLog.h\"\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h","rank":20,"score":167893.8780087823},{"content":" unsigned char *alloc(size_t len) {\n\n\n\n if (m_buf && len > m_free) {\n\n if (flush() < 0) {\n\n ERR(\"Failed to flush in alloc\\n\");\n\n return NULL; // we failed to flush so something is wrong\n\n }\n\n }\n\n\n\n if (!m_buf || len > m_bufsize) {\n\n int allocLen = m_bufsize < len ? len : m_bufsize;\n\n m_buf = (unsigned char *)allocBuffer(allocLen);\n\n if (!m_buf) {\n\n ERR(\"Alloc (%u bytes) failed\\n\", allocLen);\n\n return NULL;\n\n }\n\n m_bufsize = m_free = allocLen;\n\n }\n\n\n\n unsigned char *ptr;\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h","rank":21,"score":167878.7459518016},{"content":"\n\n ptr = m_buf + (m_bufsize - m_free);\n\n m_free -= len;\n\n\n\n return ptr;\n\n }\n\n\n\n int flush() {\n\n\n\n if (!m_buf || m_free == m_bufsize) return 0;\n\n\n\n int stat = commitBuffer(m_bufsize - m_free);\n\n m_buf = NULL;\n\n m_free = 0;\n\n return stat;\n\n }\n\n\n\n const unsigned char *readback(void *buf, size_t len) {\n\n flush();\n\n return readFully(buf, len);\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h","rank":22,"score":167878.7459518016},{"content":" }\n\n\n\n\n\nprivate:\n\n unsigned char *m_buf;\n\n size_t m_bufsize;\n\n size_t m_free;\n\n};\n\n\n\n//\n\n// When a client opens a connection to the renderer, it should\n\n// send unsigned int value indicating the \"clientFlags\".\n\n// The following are the bitmask of the clientFlags.\n\n// currently only one bit is used which flags the server\n\n// it should exit.\n\n//\n\n#define IOSTREAM_CLIENT_EXIT_SERVER 1\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h","rank":23,"score":167878.7459518016},{"content":"/*\n\n* Copyright (C) 2011 The Android Open Source Project\n\n*\n\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n\n* you may not use this file except in compliance with the License.\n\n* You may obtain a copy of the License at\n\n*\n\n* http://www.apache.org/licenses/LICENSE-2.0\n\n*\n\n* Unless required by applicable law or agreed to in writing, software\n\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n* See the License for the specific language governing permissions and\n\n* limitations under the License.\n\n*/\n\n#ifndef __IO_STREAM_H__\n\n#define __IO_STREAM_H__\n\n\n\n#include <stdlib.h>\n\n#include <stdio.h>\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h","rank":24,"score":166016.2675738681},{"content":" return NULL; // we failed to flush so something is wrong\n\n }\n\n\n\n if (!m_buf || len > m_bufsize) {\n\n int allocLen = m_bufsize < len ? len : m_bufsize;\n\n m_buf = static_cast<unsigned char *>(allocBuffer(allocLen));\n\n if (!m_buf)\n\n return NULL;\n\n m_bufsize = m_free = allocLen;\n\n }\n\n\n\n unsigned char *ptr;\n\n\n\n ptr = m_buf + (m_bufsize - m_free);\n\n m_free -= len;\n\n\n\n return ptr;\n\n }\n\n\n\n int flush() {\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h","rank":25,"score":166001.68943717133},{"content":" if (!m_buf || m_free == m_bufsize) return 0;\n\n\n\n int stat = commitBuffer(m_bufsize - m_free);\n\n m_buf = NULL;\n\n m_free = 0;\n\n return stat;\n\n }\n\n\n\nprivate:\n\n unsigned char *m_buf;\n\n size_t m_bufsize;\n\n size_t m_free;\n\n};\n\n\n\n//\n\n// When a client opens a connection to the renderer, it should\n\n// send unsigned int value indicating the \"clientFlags\".\n\n// The following are the bitmask of the clientFlags.\n\n// currently only one bit is used which flags the server\n\n// it should exit.\n\n//\n\n#define IOSTREAM_CLIENT_EXIT_SERVER 1\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h","rank":26,"score":166001.68943717136},{"content":"// Simple wrapper class for mutexes.\n\nclass Mutex {\n\npublic:\n\n // Constructor.\n\n Mutex() {\n\n#ifdef _WIN32\n\n ::InitializeCriticalSection(&mLock);\n\n#else\n\n ::pthread_mutex_init(&mLock, NULL);\n\n#endif\n\n }\n\n\n\n // Destructor.\n\n ~Mutex() {\n\n#ifdef _WIN32\n\n ::DeleteCriticalSection(&mLock);\n\n#else\n\n ::pthread_mutex_destroy(&mLock);\n\n#endif\n\n }\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/mutex.h","rank":27,"score":161184.416189796},{"content":"class EmulatedCamera3 : public camera3_device, public EmulatedBaseCamera {\n\npublic:\n\n /* Constructs EmulatedCamera3 instance.\n\n * Param:\n\n * cameraId - Zero based camera identifier, which is an index of the camera\n\n * instance in camera factory's array.\n\n * module - Emulated camera HAL module descriptor.\n\n */\n\n EmulatedCamera3(int cameraId,\n\n struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedCamera2 instance. */\n\n virtual ~EmulatedCamera3();\n\n\n\n /* List of all defined capabilities plus useful HW levels */\n\n enum AvailableCapabilities {\n\n BACKWARD_COMPATIBLE,\n\n MANUAL_SENSOR,\n\n MANUAL_POST_PROCESSING,\n\n RAW,\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCamera3.h","rank":28,"score":150868.77013997053},{"content":"class EmulatedCamera : public camera_device, public EmulatedBaseCamera {\n\npublic:\n\n /* Constructs EmulatedCamera instance.\n\n * Param:\n\n * cameraId - Zero based camera identifier, which is an index of the camera\n\n * instance in camera factory's array.\n\n * module - Emulated camera HAL module descriptor.\n\n */\n\n EmulatedCamera(int cameraId,\n\n struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedCamera instance. */\n\n virtual ~EmulatedCamera();\n\n\n\n /****************************************************************************\n\n * Abstract API\n\n ***************************************************************************/\n\n\n\npublic:\n\n /* Gets emulated camera device used by this instance of the emulated camera.\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCamera.h","rank":29,"score":150868.77013997053},{"content":"class EmulatedCamera2 : public camera2_device, public EmulatedBaseCamera {\n\npublic:\n\n /* Constructs EmulatedCamera2 instance.\n\n * Param:\n\n * cameraId - Zero based camera identifier, which is an index of the camera\n\n * instance in camera factory's array.\n\n * module - Emulated camera HAL module descriptor.\n\n */\n\n EmulatedCamera2(int cameraId,\n\n struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedCamera2 instance. */\n\n virtual ~EmulatedCamera2();\n\n\n\n /****************************************************************************\n\n * Abstract API\n\n ***************************************************************************/\n\n\n\npublic:\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCamera2.h","rank":30,"score":150868.77013997053},{"content":"struct HwcContext {\n\n hwc_composer_device_1_t device;\n\n\n\n // These 3 variables could be reduced to first_overlay only, however it makes\n\n // the conditions in the code more complicated. In order to keep things as\n\n // simple as possible, there are 3 major ways to display a frame.\n\n // 1. Show only the framebuffer.\n\n // 2. Show the framebuffer with some overlays above it.\n\n // 3. Show all overlays and hide the framebuffer.\n\n //\n\n // Since the framebuffer has no alpha channel and is opaque, it can only ever\n\n // be the rearmost layer that we end up putting on screen, otherwise it will\n\n // cover up all layers behind it, since its display frame is the whole window.\n\n //\n\n // Without framebuffer_visible, the condition of whether to display the\n\n // frambuffer becomes more complex and possibly if (numHwLayers == 0 ||\n\n // hwLayers[0]->compositionType != HWC_OVERLAY) but that might not be correct.\n\n //\n\n // The range [first_overlay, first_overlay+num_overlay) is a natural way to\n\n // structure the loop and prevents requiring state and iterating through all\n","file_path":"src/type3_AndroidCloud/anbox-master/android/hwcomposer/hwcomposer.cpp","rank":31,"score":150241.79590903246},{"content":"struct generic_stream_in {\n\n struct audio_stream_in stream;\n\n struct generic_audio_device *dev;\n\n audio_devices_t device;\n\n int fd;\n\n};\n\n\n\nstatic uint32_t out_get_sample_rate(const struct audio_stream *stream) {\n\n return OUT_SAMPLING_RATE;\n\n}\n\n\n\nstatic int out_set_sample_rate(struct audio_stream *stream, uint32_t rate) {\n\n return -ENOSYS;\n\n}\n\n\n\nstatic size_t out_get_buffer_size(const struct audio_stream *stream) {\n\n return OUT_BUFFER_SIZE;\n\n}\n\n\n\nstatic audio_channel_mask_t out_get_channels(const struct audio_stream *stream) {\n","file_path":"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp","rank":32,"score":148993.2406601911},{"content":"struct generic_stream_out {\n\n struct audio_stream_out stream;\n\n struct generic_audio_device *dev;\n\n audio_devices_t device;\n\n int fd;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp","rank":33,"score":148993.2406601911},{"content":"class CORE_POSIX_DLL_PUBLIC Signalable\n\n{\n\npublic:\n\n virtual ~Signalable() { }\n\n\n\n /**\n\n * @brief Sends a signal to this signalable object.\n\n * @throws std::system_error in case of problems.\n\n * @param [in] signal The signal to be sent to the process.\n\n */\n\n virtual void send_signal_or_throw(Signal signal);\n\n\n\n /**\n\n * @brief Sends a signal to this signalable object.\n\n * @param [in] signal The signal to be sent to the process.\n\n * @param [out] e Set to contain an error if an issue arises.\n\n */\n\n virtual void send_signal(Signal signal, std::error_code& e) noexcept(true);\n\n\n\nprotected:\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/signalable.h","rank":34,"score":148947.60425506212},{"content":"struct generic_audio_device {\n\n struct audio_hw_device device;\n\n pthread_mutex_t lock;\n\n struct audio_stream_out *output;\n\n struct audio_stream_in *input;\n\n bool mic_mute;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp","rank":35,"score":147772.721298119},{"content":"//\n\n// our private gralloc module structure\n\n//\n\nstruct private_module_t {\n\n gralloc_module_t base;\n\n};\n\n\n\n/* If not NULL, this is a pointer to the fallback module.\n\n * This really is gralloc.default, which we'll use if we detect\n\n * that the emulator we're running in does not support GPU emulation.\n\n */\n\nstatic gralloc_module_t* sFallback;\n\nstatic pthread_once_t sFallbackOnce = PTHREAD_ONCE_INIT;\n\n\n\nstatic void fallback_init(void); // forward\n\n\n\n\n\ntypedef struct _alloc_list_node {\n\n buffer_handle_t handle;\n\n _alloc_list_node *next;\n\n _alloc_list_node *prev;\n\n} AllocListNode;\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp","rank":36,"score":147772.721298119},{"content":"//\n\n// Our framebuffer device structure\n\n//\n\nstruct fb_device_t {\n\n framebuffer_device_t device;\n\n};\n\n\n\nstatic int map_buffer(cb_handle_t *cb, void **vaddr)\n\n{\n\n if (cb->fd < 0 || cb->ashmemSize <= 0) {\n\n return -EINVAL;\n\n }\n\n\n\n void *addr = mmap(0, cb->ashmemSize, PROT_READ | PROT_WRITE,\n\n MAP_SHARED, cb->fd, 0);\n\n if (addr == MAP_FAILED) {\n\n return -errno;\n\n }\n\n\n\n cb->ashmemBase = intptr_t(addr);\n\n cb->ashmemBasePid = getpid();\n\n\n\n *vaddr = addr;\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp","rank":37,"score":147772.721298119},{"content":"//\n\n// Our gralloc device structure (alloc interface)\n\n//\n\nstruct gralloc_device_t {\n\n alloc_device_t device;\n\n\n\n AllocListNode *allocListHead; // double linked list of allocated buffers\n\n pthread_mutex_t lock;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp","rank":38,"score":147772.721298119},{"content":"struct egl_surface_t {\n\n\n\n EGLDisplay dpy;\n\n EGLConfig config;\n\n\n\n\n\n egl_surface_t(EGLDisplay dpy, EGLConfig config, EGLint surfaceType);\n\n virtual ~egl_surface_t();\n\n\n\n virtual void setSwapInterval(int interval) = 0;\n\n virtual EGLBoolean swapBuffers() = 0;\n\n\n\n EGLint getSwapBehavior() const;\n\n uint32_t getRcSurface() { return rcSurface; }\n\n EGLint getSurfaceType() { return surfaceType; }\n\n\n\n EGLint getWidth(){ return width; }\n\n EGLint getHeight(){ return height; }\n\n void setTextureFormat(EGLint _texFormat) { texFormat = _texFormat; }\n\n EGLint getTextureFormat() { return texFormat; }\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/egl/egl.cpp","rank":39,"score":147772.721298119},{"content":"class CORE_POSIX_DLL_PUBLIC SignalTrap\n\n{\n\npublic:\n\n SignalTrap(const SignalTrap&) = delete;\n\n virtual ~SignalTrap() = default;\n\n\n\n SignalTrap& operator=(const SignalTrap&) = delete;\n\n bool operator==(const SignalTrap&) const = delete;\n\n\n\n /**\n\n * @brief Returns true if the given signal is trapped by this instance.\n\n */\n\n virtual bool has(Signal signal) = 0;\n\n\n\n /**\n\n * @brief Starts observation of incoming signals, relaying them via\n\n * signal_raised(). The call blocks until stop is called.\n\n */\n\n virtual void run() = 0;\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/signal.h","rank":40,"score":147132.069276885},{"content":"struct EmulatedCameraHotplugThread;\n\n\n\n/*\n\n * Contains declaration of a class EmulatedCameraFactory that manages cameras\n\n * available for the emulation. A global instance of this class is statically\n\n * instantiated and initialized when camera emulation HAL is loaded.\n\n */\n\n\n\n/* Class EmulatedCameraFactoryManages cameras available for the emulation.\n\n *\n\n * When the global static instance of this class is created on the module load,\n\n * it enumerates cameras available for the emulation by connecting to the\n\n * emulator's 'camera' service. For every camera found out there it creates an\n\n * instance of an appropriate class, and stores it an in array of emulated\n\n * cameras. In addition to the cameras reported by the emulator, a fake camera\n\n * emulator is always created, so there is always at least one camera that is\n\n * available.\n\n *\n\n * Instance of this class is also used as the entry point for the camera HAL API,\n\n * including:\n\n * - hw_module_methods_t::open entry point\n\n * - camera_module_t::get_number_of_cameras entry point\n\n * - camera_module_t::get_camera_info entry point\n\n *\n\n */\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraFactory.h","rank":41,"score":146579.26079607772},{"content":"// Helper union to store a socket address.\n\nstruct SockAddr {\n\n socklen_t len;\n\n union {\n\n sockaddr generic;\n\n sockaddr_in inet;\n\n#ifndef _WIN32\n\n sockaddr_un local;\n\n#endif\n\n };\n\n\n\n int getFamily() const { return generic.sa_family; }\n\n\n\n void initEmpty() {\n\n ::memset(this, 0, sizeof(*this));\n\n this->len = static_cast<socklen_t>(sizeof(*this));\n\n }\n\n\n\n int initFromInet(uint32_t ip_address, int port) {\n\n if (port < 0 || port >= 65536)\n\n return -EINVAL;\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/sockets.cpp","rank":42,"score":145411.92858152583},{"content":"struct BufferData {\n\n BufferData();\n\n BufferData(GLsizeiptr size, void * data);\n\n GLsizeiptr m_size;\n\n FixedBuffer m_fixedBuffer; \n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/GLSharedGroup.h","rank":43,"score":144269.83773947274},{"content":"struct ShaderData {\n\n typedef android::List<android::String8> StringList;\n\n StringList samplerExternalNames;\n\n int refcount;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/GLSharedGroup.h","rank":44,"score":144269.83773947274},{"content":"struct UnpackerT {};\n\n\n\ntemplate <typename T, typename S>\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/OpenglCodecCommon/ProtocolUtils.h","rank":45,"score":144269.83773947274},{"content":"// The following is the shared structure between all threads.\n\nstruct MultiState {\n\n MultiState(LazyInstance<StaticCounter>* staticCounter) :\n\n mMutex(), mStaticCounter(staticCounter), mCount(0) {}\n\n\n\n enum {\n\n kMaxThreads = 1000,\n\n };\n\n\n\n Mutex mMutex;\n\n LazyInstance<StaticCounter>* mStaticCounter;\n\n size_t mCount;\n\n void* mValues[kMaxThreads];\n\n TestThread* mThreads[kMaxThreads];\n\n};\n\n\n\n// The thread function for the test below.\n\nstatic void* threadFunc(void* param) {\n\n MultiState* state = static_cast<MultiState*>(param);\n\n Mutex::AutoLock lock(state->mMutex);\n\n if (state->mCount < MultiState::kMaxThreads) {\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/lazy_instance_unittest.cpp","rank":46,"score":143152.1424188509},{"content":"// NotCopyable deletes the copy c'tor and the assignment operator.\n\nstruct NotCopyable\n\n{\n\n NotCopyable() = default;\n\n NotCopyable(const NotCopyable&) = delete;\n\n virtual ~NotCopyable() = default;\n\n NotCopyable& operator=(const NotCopyable&) = delete;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/xdg/xdg.h","rank":47,"score":142495.39752184373},{"content":"// NotMoveable deletes the move c'tor and the move assignment operator.\n\nstruct NotMoveable\n\n{\n\n NotMoveable() = default;\n\n NotMoveable(NotMoveable&&) = delete;\n\n virtual ~NotMoveable() = default;\n\n NotMoveable& operator=(NotMoveable&&) = delete;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/xdg/xdg.h","rank":48,"score":142495.39752184373},{"content":"struct PingPongState {\n\n MessageChannel<std::string, 3U> in;\n\n MessageChannel<std::string, 3U> out;\n\n};\n\n\n\nvoid* pingPongFunction(void* param) {\n\n for (;;) {\n\n PingPongState* s = static_cast<PingPongState*>(param);\n\n std::string str;\n\n s->in.receive(&str);\n\n s->out.send(str);\n\n if (str == \"quit\") {\n\n break;\n\n }\n\n }\n\n return 0;\n\n}\n\n\n\n} // namespace\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/message_channel_unittest.cpp","rank":49,"score":142058.0354247275},{"content":"class CORE_POSIX_DLL_PUBLIC CrossProcessSync\n\n{\n\n public:\n\n struct Error\n\n {\n\n Error() = delete;\n\n ~Error() = delete;\n\n\n\n /**\n\n * @brief Thrown if any of the *_for functions times out.\n\n */\n\n struct Timeout : public std::runtime_error\n\n {\n\n Timeout() : std::runtime_error(\"Timeout while waiting for event to happen.\")\n\n {\n\n }\n\n };\n\n };\n\n\n\n /**\n","file_path":"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/testing/cross_process_sync.h","rank":50,"score":141941.65275312006},{"content":"struct Event {\n\n std::uint16_t type;\n\n std::uint16_t code;\n\n std::int32_t value;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/input/device.h","rank":51,"score":141011.18816619407},{"content":"struct deleter {\n\n\ttemplate <typename U>\n\n\t\tvoid operator()(U& ptr) const {\n\n\t\t\t(*F)(ptr);\n\n\t\t}\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp","rank":52,"score":139567.07057306488},{"content":"struct demangler:\n\n\tpublic demangler_impl<system_tag::current_tag> {};\n\n\n\n} // namespace details\n\n\n\n/*************** A TRACE ***************/\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp","rank":53,"score":139567.07057306488},{"content":"struct Configuration {\n\n graphics::Rect display_frame = graphics::Rect::Invalid;\n\n bool single_window = false;\n\n bool no_touch_emulation = false;\n\n bool server_side_decoration = false;\n\n};\n\n\n\nstd::shared_ptr<BasePlatform> create(const std::string &name,\n\n const std::shared_ptr<input::Manager> &input_manager,\n\n const Configuration &config);\n\n} // namespace platform\n\n} // namespace anbox\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/platform/base_platform.h","rank":54,"score":139567.07057306488},{"content":"struct Trace {\n\n\tvoid* addr;\n\n\tsize_t idx;\n\n\n\n\tTrace():\n\n\t\taddr(nullptr), idx(0) {}\n\n\n\n\texplicit Trace(void* _addr, size_t _idx):\n\n\t\taddr(_addr), idx(_idx) {}\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp","rank":55,"score":139567.07057306488},{"content":"class SocketMessenger : public MessageSender, public MessageReceiver {\n\n public:\n\n virtual Credentials creds() const = 0;\n\n virtual unsigned short local_port() const = 0;\n\n virtual void set_no_delay() = 0;\n\n virtual void close() = 0;\n\n};\n\n} // namespace network\n\n} // namespace anbox\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/network/socket_messenger.h","rank":56,"score":139266.8840682224},{"content":"class PublishedSocketConnector : public DoNotCopyOrMove, public Connector {\n\n public:\n\n explicit PublishedSocketConnector(\n\n const std::string& socket_file, const std::shared_ptr<Runtime>& rt,\n\n const std::shared_ptr<ConnectionCreator<\n\n boost::asio::local::stream_protocol>>& connection_creator);\n\n ~PublishedSocketConnector() noexcept;\n\n\n\n std::string socket_file() const { return socket_file_; }\n\n\n\n private:\n\n void start_accept();\n\n void on_new_connection(\n\n std::shared_ptr<boost::asio::local::stream_protocol::socket> const& socket,\n\n boost::system::error_code const& err);\n\n\n\n const std::string socket_file_;\n\n std::shared_ptr<Runtime> runtime_;\n\n std::shared_ptr<ConnectionCreator<boost::asio::local::stream_protocol>>\n\n connection_creator_;\n\n boost::asio::local::stream_protocol::acceptor acceptor_;\n\n};\n\n} // namespace network\n\n} // namespace anbox\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/network/published_socket_connector.h","rank":57,"score":138218.00647272263},{"content":"class TcpSocketConnector : public DoNotCopyOrMove, public Connector {\n\n public:\n\n explicit TcpSocketConnector(\n\n const boost::asio::ip::address_v4 &address, unsigned short port,\n\n const std::shared_ptr<Runtime> &rt,\n\n const std::shared_ptr<ConnectionCreator<boost::asio::ip::tcp>>\n\n &connection_creator);\n\n ~TcpSocketConnector() noexcept;\n\n\n\n unsigned short port() const { return port_; }\n\n\n\n private:\n\n void start_accept();\n\n void on_new_connection(\n\n std::shared_ptr<boost::asio::ip::tcp::socket> const &socket,\n\n boost::system::error_code const &err);\n\n\n\n boost::asio::ip::address_v4 address_;\n\n unsigned short port_;\n\n std::shared_ptr<Runtime> runtime_;\n\n std::shared_ptr<ConnectionCreator<boost::asio::ip::tcp>> connection_creator_;\n\n boost::asio::ip::tcp::acceptor acceptor_;\n\n};\n\n} // namespace network\n\n} // namespace anbox\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/network/tcp_socket_connector.h","rank":58,"score":138218.00647272263},{"content":"struct RendererWindow;\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.h","rank":59,"score":138161.44193990383},{"content":"struct FuncDelete {\n\n explicit FuncDelete(Func f = {}) : mF(f) {}\n\n\n\n FuncDelete(const FuncDelete& other) = default;\n\n FuncDelete(FuncDelete&& other) = default;\n\n FuncDelete& operator=(const FuncDelete& other) = default;\n\n FuncDelete& operator=(FuncDelete&& other) = default;\n\n\n\n // To be able to copy/move from all compatible template instantiations.\n\n template <class U>\n\n friend struct FuncDelete;\n\n\n\n // Template constructors and move assignment from compatible instantiations.\n\n template <class U>\n\n FuncDelete(const FuncDelete<U>& other) : mF(other.mF) {}\n\n template <class U>\n\n FuncDelete(FuncDelete<U>&& other) : mF(std::move(other.mF)) {}\n\n template <class U>\n\n FuncDelete& operator=(const FuncDelete<U>& other) {\n\n mF = other.mF;\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/common/scope_ptr.h","rank":60,"score":138161.44193990383},{"content":"struct IntOwnedFd {\n\n int int_owned_fd;\n\n};\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/common/fd.h","rank":61,"score":138161.44193990383},{"content":"// A structure used to list the capabilities of the underlying EGL\n\n// implementation that the FrameBuffer instance depends on.\n\n// |has_eglimage_texture_2d| is true iff the EGL_KHR_gl_texture_2D_image\n\n// extension is supported.\n\n// |has_eglimage_renderbuffer| is true iff the EGL_KHR_gl_renderbuffer_image\n\n// extension is supported.\n\n// |eglMajor| and |eglMinor| are the major and minor version numbers of\n\n// the underlying EGL implementation.\n\nstruct RendererCaps {\n\n bool has_eglimage_texture_2d;\n\n bool has_eglimage_renderbuffer;\n\n EGLint eglMajor;\n\n EGLint eglMinor;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.h","rank":62,"score":138161.44193990383},{"content":"struct default_delete {\n\n\tvoid operator()(T& ptr) const {\n\n\t\tdelete ptr;\n\n\t}\n\n};\n\n\n\ntemplate <typename T, typename Deleter = deleter<void, void*, &::free> >\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp","rank":63,"score":138161.44193990383},{"content":"struct demangler_impl {\n\n\tstatic std::string demangle(const char* funcname) {\n\n\t\treturn funcname;\n\n\t}\n\n};\n\n\n\n#if defined(BACKWARD_SYSTEM_LINUX) || defined(BACKWARD_SYSTEM_DARWIN)\n\n\n\ntemplate <>\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp","rank":64,"score":138161.44193990383},{"content":"struct FreeDelete {\n\n template <class T>\n\n void operator()(T ptr) const {\n\n free(ptr);\n\n }\n\n};\n\n\n\ntemplate <class Func>\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/common/scope_ptr.h","rank":65,"score":138161.44193990383},{"content":"struct audio_module HAL_MODULE_INFO_SYM = {\n\n .common = {\n\n .tag = HARDWARE_MODULE_TAG,\n\n .module_api_version = AUDIO_MODULE_API_VERSION_0_1,\n\n .hal_api_version = HARDWARE_HAL_API_VERSION,\n\n .id = AUDIO_HARDWARE_MODULE_ID,\n\n .name = \"Anbox audio HW HAL\",\n\n .author = \"The Android Open Source Project\",\n\n .methods = &hal_module_methods,\n\n },\n\n};\n","file_path":"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp","rank":66,"score":137724.18876417686},{"content":"struct ColorBufferRef {\n\n ColorBufferPtr cb;\n\n uint32_t refcount; // number of client-side references\n\n};\n\ntypedef std::map<HandleType, RenderContextPtr> RenderContextMap;\n\ntypedef std::map<HandleType, std::pair<WindowSurfacePtr, HandleType>>\n\n WindowSurfaceMap;\n\ntypedef std::map<HandleType, ColorBufferRef> ColorBufferMap;\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.h","rank":67,"score":136792.78377713138},{"content":"// Hard-coded arrays of vertex information.\n\nstruct Vertex {\n\n float pos[3];\n\n float coord[2];\n\n};\n\n\n\nconst Vertex kVertices[] = {\n\n {{+1, -1, +0}, {+1, +1}},\n\n {{+1, +1, +0}, {+1, +0}},\n\n {{-1, +1, +0}, {+0, +0}},\n\n {{-1, -1, +0}, {+0, +1}},\n\n};\n\n\n\nconst GLubyte kIndices[] = {0, 1, 2, 2, 3, 0};\n\nconst GLint kIndicesLen = sizeof(kIndices) / sizeof(kIndices[0]);\n\n\n\n} // namespace\n\n\n\nTextureDraw::TextureDraw(EGLDisplay)\n\n : mVertexShader(0),\n\n mFragmentShader(0),\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/TextureDraw.cpp","rank":68,"score":136792.78377713138},{"content":"struct TestBase {\n\n\tconst char* name;\n\n\tTestStatus expected_status;\n\n\n\n\tvirtual ~TestBase() {}\n\n\tTestBase(const char*, TestStatus);\n\n\tvirtual void do_test() = 0;\n\n\n\n\tTestStatus run() {\n\n\t\ttry {\n\n\t\t\tdo_test();\n\n\t\t\treturn SUCCESS;\n\n\t\t} catch(const AssertFailedError& e) {\n\n\t\t\tprintf(\"!! %s\\n\", e.what());\n\n\t\t\treturn ASSERT_FAIL;\n\n\t\t} catch(const std::exception& e) {\n\n\t\t\tprintf(\"!! exception: %s\\n\", e.what());\n\n\t\t\treturn EXCEPTION_UNCAUGHT;\n\n\t\t} catch(...) {\n\n\t\t\tprintf(\"!! unknown exception\\n\");\n","file_path":"src/type3_AndroidCloud/anbox-master/external/backward-cpp/test/test.hpp","rank":69,"score":136792.78377713138},{"content":"struct result_ptr_t {\n\n typedef ::google::protobuf::MessageLite* type;\n\n};\n\n\n\n// Boiler plate for unpacking a parameter message, invoking a server function,\n\n// and\n\n// sending the result message. Assumes the existence of Self::send_response().\n\ntemplate <class Self, class Bridge, class BridgeX, class ParameterMessage,\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/rpc/template_message_processor.h","rank":70,"score":136792.78377713138},{"content":"struct RendererWindow {\n\n EGLNativeWindowType native_window = 0;\n\n EGLSurface surface = EGL_NO_SURFACE;\n\n anbox::graphics::Rect viewport;\n\n glm::mat4 screen_to_gl_coords = glm::mat4(1.0f);\n\n glm::mat4 display_transform = glm::mat4(1.0f);\n\n};\n\n\n\nRendererWindow *Renderer::createNativeWindow(\n\n EGLNativeWindowType native_window) {\n\n m_lock.lock();\n\n\n\n auto window = new RendererWindow;\n\n window->native_window = native_window;\n\n window->surface = s_egl.eglCreateWindowSurface(\n\n m_eglDisplay, m_eglConfig, window->native_window, nullptr);\n\n if (window->surface == EGL_NO_SURFACE) {\n\n delete window;\n\n m_lock.unlock();\n\n return nullptr;\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.cpp","rank":71,"score":136792.78377713138},{"content":"struct private_module_t HAL_MODULE_INFO_SYM = {\n\n base: {\n\n common: {\n\n tag: HARDWARE_MODULE_TAG,\n\n module_api_version: GRALLOC_MODULE_API_VERSION_0_2,\n\n hal_api_version: 0,\n\n id: GRALLOC_HARDWARE_MODULE_ID,\n\n name: \"Graphics Memory Allocator Module\",\n\n author: \"The Android Open Source Project\",\n\n methods: &gralloc_module_methods,\n\n dso: NULL,\n\n reserved: {0, }\n\n },\n\n registerBuffer: gralloc_register_buffer,\n\n unregisterBuffer: gralloc_unregister_buffer,\n\n lock: gralloc_lock,\n\n unlock: gralloc_unlock,\n\n perform: NULL,\n\n lock_ycbcr: gralloc_lock_ycbcr,\n\n }\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp","rank":72,"score":136606.49344355502},{"content":" class WorkerThread : public Thread {\n\n\n\n /****************************************************************************\n\n * Public API\n\n ***************************************************************************/\n\n\n\n public:\n\n inline explicit WorkerThread(EmulatedCameraDevice* camera_dev)\n\n : Thread(true), // Callbacks may involve Java calls.\n\n mCameraDevice(camera_dev),\n\n mThreadControl(-1),\n\n mControlFD(-1)\n\n {\n\n }\n\n\n\n inline ~WorkerThread()\n\n {\n\n ALOGW_IF(mThreadControl >= 0 || mControlFD >= 0,\n\n \"%s: Control FDs are opened in the destructor\",\n\n __FUNCTION__);\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraDevice.h","rank":73,"score":135497.34025889696},{"content":" // 3A management thread (auto-exposure, focus, white balance)\n\n class ControlThread: public Thread {\n\n public:\n\n ControlThread(EmulatedFakeCamera2 *parent);\n\n ~ControlThread();\n\n\n\n status_t readyToRun();\n\n\n\n status_t waitUntilRunning();\n\n\n\n // Interpret request's control parameters and override\n\n // capture settings as needed\n\n status_t processRequest(camera_metadata_t *request);\n\n\n\n status_t triggerAction(uint32_t msgType,\n\n int32_t ext1, int32_t ext2);\n\n private:\n\n ControlThread(const ControlThread &t);\n\n ControlThread& operator=(const ControlThread &t);\n\n\n\n // Constants controlling fake 3A behavior\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera2.h","rank":74,"score":135497.34025889696},{"content":" class ConfigureThread: public Thread {\n\n public:\n\n ConfigureThread(EmulatedFakeCamera2 *parent);\n\n ~ConfigureThread();\n\n\n\n status_t waitUntilRunning();\n\n status_t newRequestAvailable();\n\n status_t readyToRun();\n\n\n\n bool isStreamInUse(uint32_t id);\n\n int getInProgressCount();\n\n private:\n\n EmulatedFakeCamera2 *mParent;\n\n static const nsecs_t kWaitPerLoop = 10000000L; // 10 ms\n\n\n\n bool mRunning;\n\n bool threadLoop();\n\n\n\n bool setupCapture();\n\n bool setupReprocess();\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera2.h","rank":75,"score":135497.34025889696},{"content":"class IPlatformService : public IInterface {\n\npublic:\n\n DECLARE_META_INTERFACE(PlatformService);\n\n\n\n enum {\n\n // Keep this synchronized with frameworks/base/services/java/com/android/server/wm/AnboxPlatformServiceProxy.java\n\n BOOT_FINISHED = IBinder::FIRST_CALL_TRANSACTION,\n\n UPDATE_WINDOW_STATE = IBinder::FIRST_CALL_TRANSACTION + 1,\n\n UPDATE_APPLICATION_LIST = IBinder::FIRST_CALL_TRANSACTION + 2,\n\n SET_CLIPBOARD_DATA = IBinder::FIRST_CALL_TRANSACTION + 3,\n\n GET_CLIPBOARD_DATA = IBinder::FIRST_CALL_TRANSACTION + 4,\n\n };\n\n\n\n virtual status_t boot_finished() = 0;\n\n virtual status_t update_window_state(const Parcel &data) = 0;\n\n virtual status_t update_application_list(const Parcel &data) = 0;\n\n virtual status_t set_clipboard_data(const Parcel &data) = 0;\n\n virtual status_t get_clipboard_data(const Parcel &data, Parcel *reply) = 0;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/service/platform_service_interface.h","rank":76,"score":135497.34025889696},{"content":"class IActivityManager : public IInterface {\n\npublic:\n\n DECLARE_META_INTERFACE(ActivityManager);\n\n\n\n enum {\n\n // This needs to stay synchronized with frameworks/base/core/java/android/app/IActivityManager.java\n\n SET_FOCUSED_TASK = IBinder::FIRST_CALL_TRANSACTION + 130,\n\n REMOVE_TASK = IBinder::FIRST_CALL_TRANSACTION + 131,\n\n RESIZE_TASK = IBinder::FIRST_CALL_TRANSACTION + 285,\n\n };\n\n\n\n virtual status_t setFocusedTask(int32_t id) = 0;\n\n virtual status_t removeTask(int32_t id) = 0;\n\n virtual status_t resizeTask(int32_t id, const anbox::graphics::Rect &rect, int resize_mode) = 0;\n\n};\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/service/activity_manager_interface.h","rank":77,"score":135497.34025889696},{"content":"class CameraQemuClient : public QemuClient {\n\npublic:\n\n /* Constructs CameraQemuClient instance. */\n\n CameraQemuClient();\n\n\n\n /* Destructs CameraQemuClient instance. */\n\n ~CameraQemuClient();\n\n\n\n /****************************************************************************\n\n * Public API\n\n ***************************************************************************/\n\n\n\npublic:\n\n /* Queries camera connection.\n\n * Return:\n\n * NO_ERROR on success, or an appropriate error status on failure.\n\n */\n\n status_t queryConnect();\n\n\n\n /* Queries camera disconnection.\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/QemuClient.h","rank":78,"score":134330.6907576609},{"content":"class PlatformService : public BnPlatformService {\n\npublic:\n\n static const char* service_name() { return \"org.anbox.PlatformService\"; }\n\n\n\n PlatformService(const std::shared_ptr<anbox::PlatformApiStub> &platform_api_stub);\n\n\n\n status_t boot_finished() override;\n\n status_t update_window_state(const Parcel &data) override;\n\n status_t update_application_list(const Parcel &data) override;\n\n status_t set_clipboard_data(const Parcel &data) override;\n\n status_t get_clipboard_data(const Parcel &data, Parcel *reply) override;\n\n\n\nprivate:\n\n anbox::PlatformApiStub::WindowStateUpdate::Window unpack_window_state(const Parcel &data);\n\n std::shared_ptr<anbox::PlatformApiStub> platform_api_stub_;\n\n};\n\n} // namespace android\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/android/service/platform_service.h","rank":79,"score":134330.6907576609},{"content":"class FactoryQemuClient : public QemuClient {\n\npublic:\n\n /* Constructs FactoryQemuClient instance. */\n\n FactoryQemuClient();\n\n\n\n /* Destructs FactoryQemuClient instance. */\n\n ~FactoryQemuClient();\n\n\n\n /****************************************************************************\n\n * Public API\n\n ***************************************************************************/\n\n\n\npublic:\n\n /* Lists camera devices connected to the host.\n\n * Param:\n\n * list - Upon success contains a list of cameras connected to the host. The\n\n * list returned here is represented as a string, containing multiple\n\n * lines separated with '\\n', where each line represents a camera. Each\n\n * camera line is formatted as such:\n\n *\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/QemuClient.h","rank":80,"score":134330.6907576609},{"content":"struct Features {\n\n bool a = false;\n\n bool b = false;\n\n bool c = false;\n\n};\n\n\n\nDECLARE_SETTER(Features, a)\n\nDECLARE_SETTER(Features, b)\n\nDECLARE_SETTER(Features, c)\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/external/cpu_features/test/linux_features_aggregator_test.cc","rank":81,"score":134160.6940581074},{"content":"class EmulatedFakeCamera2 : public EmulatedCamera2 {\n\npublic:\n\n /* Constructs EmulatedFakeCamera instance. */\n\n EmulatedFakeCamera2(int cameraId, bool facingBack, struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedFakeCamera instance. */\n\n ~EmulatedFakeCamera2();\n\n\n\n /****************************************************************************\n\n * EmulatedCamera2 virtual overrides.\n\n ***************************************************************************/\n\n\n\npublic:\n\n /* Initializes EmulatedFakeCamera2 instance. */\n\n status_t Initialize();\n\n\n\n /****************************************************************************\n\n * Camera Module API and generic hardware device API implementation\n\n ***************************************************************************/\n\npublic:\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera2.h","rank":82,"score":133189.26535392334},{"content":"class EmulatedQemuCamera2 : public EmulatedCamera2 {\n\npublic:\n\n /* Constructs EmulatedFakeCamera instance. */\n\n EmulatedQemuCamera2(int cameraId, bool facingBack, struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedFakeCamera instance. */\n\n ~EmulatedQemuCamera2();\n\n\n\n /****************************************************************************\n\n * EmulatedCamera2 virtual overrides.\n\n ***************************************************************************/\n\n\n\npublic:\n\n /* Initializes EmulatedQemuCamera2 instance. */\n\n status_t Initialize();\n\n\n\n /****************************************************************************\n\n * EmulatedCamera abstract API implementation.\n\n ***************************************************************************/\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedQemuCamera2.h","rank":83,"score":133189.26535392334},{"content":"class EmulatedQemuCamera : public EmulatedCamera {\n\npublic:\n\n /* Constructs EmulatedQemuCamera instance. */\n\n EmulatedQemuCamera(int cameraId, struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedQemuCamera instance. */\n\n ~EmulatedQemuCamera();\n\n\n\n /***************************************************************************\n\n * EmulatedCamera virtual overrides.\n\n **************************************************************************/\n\n\n\npublic:\n\n /* Initializes EmulatedQemuCamera instance. */\n\n status_t Initialize(const char* device_name,\n\n const char* frame_dims,\n\n const char* facing_dir);\n\n\n\n /***************************************************************************\n\n * EmulatedCamera abstract API implementation.\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedQemuCamera.h","rank":84,"score":133189.26535392334},{"content":"class EmulatedFakeCamera : public EmulatedCamera {\n\npublic:\n\n /* Constructs EmulatedFakeCamera instance. */\n\n EmulatedFakeCamera(int cameraId, bool facingBack, struct hw_module_t* module);\n\n\n\n /* Destructs EmulatedFakeCamera instance. */\n\n ~EmulatedFakeCamera();\n\n\n\n /****************************************************************************\n\n * EmulatedCamera virtual overrides.\n\n ***************************************************************************/\n\n\n\npublic:\n\n /* Initializes EmulatedFakeCamera instance. */\n\n status_t Initialize();\n\n\n\n /****************************************************************************\n\n * EmulatedCamera abstract API implementation.\n\n ***************************************************************************/\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera.h","rank":85,"score":133189.26535392334},{"content":"class EmulatedFakeCamera3 : public EmulatedCamera3,\n\n private Sensor::SensorListener {\n\npublic:\n\n\n\n EmulatedFakeCamera3(int cameraId, bool facingBack,\n\n struct hw_module_t* module);\n\n\n\n virtual ~EmulatedFakeCamera3();\n\n\n\n /****************************************************************************\n\n * EmulatedCamera3 virtual overrides\n\n ***************************************************************************/\n\n\n\npublic:\n\n\n\n virtual status_t Initialize();\n\n\n\n /****************************************************************************\n\n * Camera module API and generic hardware device API implementation\n\n ***************************************************************************/\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera3.h","rank":86,"score":133189.26535392334},{"content":"class EmulatedCameraHotplugThread : public Thread {\n\n public:\n\n EmulatedCameraHotplugThread(const int* cameraIdArray, size_t size);\n\n ~EmulatedCameraHotplugThread();\n\n\n\n virtual void requestExit();\n\n virtual status_t requestExitAndWait();\n\n\n\n private:\n\n\n\n\n\n virtual status_t readyToRun();\n\n virtual bool threadLoop();\n\n\n\n struct SubscriberInfo {\n\n int CameraID;\n\n int WatchID;\n\n };\n\n\n\n bool addWatch(int cameraId);\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraHotplugThread.h","rank":87,"score":132072.21884410054},{"content":"class Window : public std::enable_shared_from_this<Window>, public wm::Window {\n\n public:\n\n typedef std::int32_t Id;\n\n static Id Invalid;\n\n\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/platform/sdl/window.h","rank":88,"score":131499.99304664764},{"content":"class MessageProcessor : public rpc::MessageProcessor {\n\npublic:\n\n MessageProcessor(const std::shared_ptr<network::MessageSender> &sender,\n\n const std::shared_ptr<rpc::PendingCallCache> &pending_calls,\n\n const std::shared_ptr<AndroidApiSkeleton> &platform_api);\n\n ~MessageProcessor();\n\n\n\n void dispatch(rpc::Invocation const& invocation) override;\n\n void process_event_sequence(const std::string &event) override;\n\n\n\nprivate:\n\n std::shared_ptr<AndroidApiSkeleton> platform_api_;\n\n};\n\n} // namespace network\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/android/service/message_processor.h","rank":89,"score":131131.45035466045},{"content":"class TcpStream : public SocketStream {\n\npublic:\n\n explicit TcpStream(size_t bufsize = 10000);\n\n virtual int listen(unsigned short port);\n\n virtual SocketStream *accept();\n\n virtual int connect(unsigned short port);\n\n int connect(const char* hostname, unsigned short port);\n\nprivate:\n\n TcpStream(int sock, size_t bufSize);\n\n};\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/TcpStream.h","rank":90,"score":130978.74464878492},{"content":"class AndroidApiStub : public anbox::application::Manager {\n\n public:\n\n AndroidApiStub();\n\n ~AndroidApiStub();\n\n\n\n void set_rpc_channel(const std::shared_ptr<rpc::Channel> &channel);\n\n void reset_rpc_channel();\n\n\n\n void set_focused_task(const std::int32_t &id);\n\n void remove_task(const std::int32_t &id);\n\n void resize_task(const std::int32_t &id, const anbox::graphics::Rect &rect,\n\n const std::int32_t &resize_mode);\n\n\n\n void launch(const android::Intent &intent,\n\n const graphics::Rect &launch_bounds = graphics::Rect::Invalid,\n\n const wm::Stack::Id &stack = wm::Stack::Id::Default) override;\n\n\n\n core::Property<bool>& ready() override;\n\n\n\n private:\n","file_path":"src/type3_AndroidCloud/anbox-master/src/anbox/bridge/android_api_stub.h","rank":91,"score":130734.100405643},{"content":"class PodVector : public PodVectorBase {\n\npublic:\n\n // Default constructor for an empty PodVector<T>\n\n PodVector() : PodVectorBase() {}\n\n\n\n // Copy constructor. This copies all items from |other| into\n\n // the new instance with ::memmove().\n\n PodVector(const PodVector& other) : PodVectorBase(other) {}\n\n\n\n // Assignment operator.\n\n PodVector& operator=(const PodVector& other) {\n\n this->assignFrom(other);\n\n return *this;\n\n }\n\n\n\n // Destructor, this simply releases the internal storage block that\n\n // holds all the items, but doesn't touch them otherwise.\n\n ~PodVector() {}\n\n\n\n // Return true iff the PodVector<T> instance is empty, i.e. does not\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/pod_vector.h","rank":92,"score":129908.07257721908},{"content":"class EmulatedFakeCameraDevice : public EmulatedCameraDevice {\n\npublic:\n\n /* Constructs EmulatedFakeCameraDevice instance. */\n\n explicit EmulatedFakeCameraDevice(EmulatedFakeCamera* camera_hal);\n\n\n\n /* Destructs EmulatedFakeCameraDevice instance. */\n\n ~EmulatedFakeCameraDevice();\n\n\n\n /***************************************************************************\n\n * Emulated camera device abstract interface implementation.\n\n * See declarations of these methods in EmulatedCameraDevice class for\n\n * information on each of these methods.\n\n **************************************************************************/\n\n\n\npublic:\n\n /* Connects to the camera device.\n\n * Since there is no real device to connect to, this method does nothing,\n\n * but changes the state.\n\n */\n\n status_t connectDevice();\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCameraDevice.h","rank":93,"score":129908.07257721908},{"content":"class MessageChannel : public MessageChannelBase {\n\npublic:\n\n MessageChannel() : MessageChannelBase(CAPACITY) {}\n\n\n\n void send(const T& msg) {\n\n size_t pos = beforeWrite();\n\n mItems[pos] = msg;\n\n afterWrite();\n\n }\n\n\n\n void receive(T* msg) {\n\n size_t pos = beforeRead();\n\n *msg = mItems[pos];\n\n afterRead();\n\n }\n\n\n\nprivate:\n\n T mItems[CAPACITY];\n\n};\n\n\n\n} // namespace emugl\n\n\n\n#endif // EMUGL_COMMON_MESSAGE_CHANNEL_H\n","file_path":"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/message_channel.h","rank":94,"score":129908.07257721908},{"content":"class GL2Encoder : public gl2_encoder_context_t {\n\npublic:\n\n GL2Encoder(IOStream *stream, ChecksumCalculator* protocol);\n\n virtual ~GL2Encoder();\n\n void setClientState(GLClientState *state) {\n\n m_state = state;\n\n }\n\n void setSharedGroup(GLSharedGroupPtr shared){ m_shared = shared; }\n\n const GLClientState *state() { return m_state; }\n\n const GLSharedGroupPtr shared() { return m_shared; }\n\n void flush() { m_stream->flush(); }\n\n\n\n void setInitialized(){ m_initialized = true; };\n\n bool isInitialized(){ return m_initialized; };\n\n\n\n virtual void setError(GLenum error){ m_error = error; };\n\n virtual GLenum getError() { return m_error; };\n\n\n\n void override2DTextureTarget(GLenum target);\n\n void restore2DTextureTarget();\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/GLESv2_enc/GL2Encoder.h","rank":95,"score":129908.07257721908},{"content":"class EmulatedQemuCameraDevice : public EmulatedCameraDevice {\n\npublic:\n\n /* Constructs EmulatedQemuCameraDevice instance. */\n\n explicit EmulatedQemuCameraDevice(EmulatedQemuCamera* camera_hal);\n\n\n\n /* Destructs EmulatedQemuCameraDevice instance. */\n\n ~EmulatedQemuCameraDevice();\n\n\n\n /***************************************************************************\n\n * Public API\n\n **************************************************************************/\n\n\n\npublic:\n\n /* Initializes EmulatedQemuCameraDevice instance.\n\n * Param:\n\n * device_name - Name of the camera device connected to the host. The name\n\n * that is used here must have been reported by the 'factory' camera\n\n * service when it listed camera devices connected to the host.\n\n * Return:\n\n * NO_ERROR on success, or an appropriate error status.\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedQemuCameraDevice.h","rank":96,"score":129908.07257721908},{"content":"class GLEncoder : public gl_encoder_context_t {\n\n\n\npublic:\n\n GLEncoder(IOStream *stream, ChecksumCalculator* protocol);\n\n virtual ~GLEncoder();\n\n void setClientState(GLClientState *state) {\n\n m_state = state;\n\n }\n\n void setSharedGroup(GLSharedGroupPtr shared) { m_shared = shared; }\n\n void flush() { m_stream->flush(); }\n\n size_t pixelDataSize(GLsizei width, GLsizei height, GLenum format, GLenum type, int pack);\n\n\n\n void setInitialized(){ m_initialized = true; };\n\n bool isInitialized(){ return m_initialized; };\n\n\n\n virtual void setError(GLenum error){ m_error = error; };\n\n virtual GLenum getError() { return m_error; };\n\n\n\n void override2DTextureTarget(GLenum target);\n\n void restore2DTextureTarget();\n","file_path":"src/type3_AndroidCloud/anbox-master/android/opengl/system/GLESv1_enc/GLEncoder.h","rank":97,"score":129908.07257721908},{"content":"struct hw_module_methods_t EmulatedCameraFactory::mCameraModuleMethods = {\n\n open: EmulatedCameraFactory::device_open\n\n};\n\n\n\n}; /* namespace android */\n","file_path":"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraFactory.cpp","rank":98,"score":128955.11722247464},{"content":"class LocalSocketConnection : public network::MessageSender {\n\npublic:\n\n LocalSocketConnection(const std::string &path);\n\n ~LocalSocketConnection();\n\n\n\n ssize_t read_all(std::uint8_t *buffer, const size_t &size);\n\n void send(char const* data, size_t length) override;\n\n ssize_t send_raw(char const* data, size_t length) override;\n\n\n\nprivate:\n\n Fd fd_;\n\n};\n\n} // namespace anbox\n\n\n\n#endif\n","file_path":"src/type3_AndroidCloud/anbox-master/android/service/local_socket_connection.h","rank":99,"score":128872.97844110007}],"string":"[\n {\n \"content\": \"struct CORE_POSIX_DLL_PUBLIC Stat\\n\\n{\\n\\n pid_t pid = 1; ///< The process ID\\n\\n std::string executable; ///< The filename of the executable, in parentheses.\\n\\n State state = State::undefined; ///< State of the process.\\n\\n pid_t parent = -1; ///< The PID of the parent.\\n\\n pid_t process_group = -1; ///< The process group ID of the process.\\n\\n int session_id = -1; ///< The session ID of the process.\\n\\n int tty_nr = -1; ///< The controlling terminal of the process.\\n\\n int controlling_process_group = -1; ///< The ID of the foreground process group of the controlling terminal of the process.\\n\\n unsigned int kernel_flags = 0; ///< The kernel flags word of the process.\\n\\n long unsigned int minor_faults_count = 0; ///< The number of minor faults the process has made which have not required loading a memory page from disk.\\n\\n long unsigned int minor_faults_count_by_children = 0; ///< The number of minor faults that the process's waited-for children have made.\\n\\n long unsigned int major_faults_count = 0; ///< The number of major faults the process has made which have required loading a memory page from disk.\\n\\n long unsigned int major_faults_count_by_children = 0; ///< The number of major faults that the process's waited-for children have made.\\n\\n struct\\n\\n {\\n\\n long unsigned int user = 0; ///< Amount of time that this process has been scheduled in user mode, [clock ticks].\\n\\n long unsigned int system = 0; ///< Amount of time that this process has been scheduled in kernel mode, [clock ticks].\\n\\n long unsigned int user_for_children = 0; ///< Amount of time that this process's waited-for children have been scheduled in user mode, [clock ticks].\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/stat.h\",\n \"rank\": 0,\n \"score\": 222090.82454406342\n },\n {\n \"content\": \"struct CORE_POSIX_DLL_PUBLIC OomAdj\\n\\n{\\n\\n /**\\n\\n * @brief Returns the value that makes a process \\\"invisible\\\" to the oom killer.\\n\\n * @return Returns the value that makes a process \\\"invisible\\\" to the oom killer.\\n\\n */\\n\\n static int disable_value();\\n\\n\\n\\n /**\\n\\n * @brief Returns the minimum valid value.\\n\\n * @return The minimum valid value that the OomAdj can be set to.\\n\\n */\\n\\n static int min_value();\\n\\n\\n\\n /**\\n\\n * @brief Returns the maximum valid value.\\n\\n * @return The maximum valid value that the OomAdj can be set to.\\n\\n */\\n\\n static int max_value();\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/oom_adj.h\",\n \"rank\": 1,\n \"score\": 217568.5732575133\n },\n {\n \"content\": \"struct CORE_POSIX_DLL_PUBLIC OomScore\\n\\n{\\n\\n int value = 0; ///< Current OomScore as calculated by the kernel.\\n\\n};\\n\\n\\n\\n/**\\n\\n * \\\\brief Read the OomScore for a process instance.\\n\\n * \\\\throws std::runtime_error in case of errors.\\n\\n * \\\\param [in] process The process to read the score for.\\n\\n * \\\\param [out] score The destination to store the value in.\\n\\n */\\n\\nCORE_POSIX_DLL_PUBLIC const posix::Process& operator>>(const posix::Process& process, OomScore& score);\\n\\n}\\n\\n}\\n\\n}\\n\\n}\\n\\n}\\n\\n#endif // CORE_POSIX_LINUX_PROC_PROCESS_OOM_SCORE_H_\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/oom_score.h\",\n \"rank\": 2,\n \"score\": 217568.5732575133\n },\n {\n \"content\": \"struct CORE_POSIX_DLL_PUBLIC OomScoreAdj\\n\\n{\\n\\n /**\\n\\n * @brief Returns the minimum valid value.\\n\\n * @return The minimum valid value that the Oom Score Adj can be set to.\\n\\n */\\n\\n static int min_value();\\n\\n\\n\\n /**\\n\\n * @brief Returns the maximum valid value.\\n\\n * @return The maximum valid value that the Oom Score Adj can be set to.\\n\\n */\\n\\n static int max_value();\\n\\n\\n\\n /**\\n\\n * @brief is_valid checks whether the contained value is within the predefined bounds.\\n\\n * @return true iff min_value() <= value <= max_value().\\n\\n */\\n\\n inline bool is_valid() const\\n\\n {\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/linux/proc/process/oom_score_adj.h\",\n \"rank\": 3,\n \"score\": 213251.78402233793\n },\n {\n \"content\": \"struct egl_pbuffer_surface_t : public egl_surface_t {\\n\\n static egl_pbuffer_surface_t* create(EGLDisplay dpy, EGLConfig config,\\n\\n EGLint surfType, int32_t w, int32_t h, GLenum pixelFormat);\\n\\n\\n\\n virtual ~egl_pbuffer_surface_t();\\n\\n\\n\\n virtual void setSwapInterval(int interval) { (void)interval; }\\n\\n virtual EGLBoolean swapBuffers() { return EGL_TRUE; }\\n\\n\\n\\n uint32_t getRcColorBuffer() { return rcColorBuffer; }\\n\\n\\n\\nprivate:\\n\\n egl_pbuffer_surface_t(EGLDisplay dpy, EGLConfig config, EGLint surfType,\\n\\n int32_t w, int32_t h);\\n\\n EGLBoolean init(GLenum format);\\n\\n\\n\\n uint32_t rcColorBuffer;\\n\\n};\\n\\n\\n\\negl_pbuffer_surface_t::egl_pbuffer_surface_t(EGLDisplay dpy, EGLConfig config,\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/egl/egl.cpp\",\n \"rank\": 4,\n \"score\": 208640.26342689333\n },\n {\n \"content\": \"struct egl_window_surface_t : public egl_surface_t {\\n\\n static egl_window_surface_t* create(\\n\\n EGLDisplay dpy, EGLConfig config, EGLint surfType,\\n\\n ANativeWindow* window);\\n\\n\\n\\n virtual ~egl_window_surface_t();\\n\\n\\n\\n virtual void setSwapInterval(int interval);\\n\\n virtual EGLBoolean swapBuffers();\\n\\n\\n\\nprivate:\\n\\n egl_window_surface_t(\\n\\n EGLDisplay dpy, EGLConfig config, EGLint surfType,\\n\\n ANativeWindow* window);\\n\\n EGLBoolean init();\\n\\n\\n\\n ANativeWindow* nativeWindow;\\n\\n android_native_buffer_t* buffer;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/egl/egl.cpp\",\n \"rank\": 5,\n \"score\": 208640.26342689333\n },\n {\n \"content\": \"struct ResolvedTrace: public Trace {\\n\\n\\n\\n\\tstruct SourceLoc {\\n\\n\\t\\tstd::string function;\\n\\n\\t\\tstd::string filename;\\n\\n\\t\\tunsigned line;\\n\\n\\t\\tunsigned col;\\n\\n\\n\\n\\t\\tSourceLoc(): line(0), col(0) {}\\n\\n\\n\\n\\t\\tbool operator==(const SourceLoc& b) const {\\n\\n\\t\\t\\treturn function == b.function\\n\\n\\t\\t\\t\\t&& filename == b.filename\\n\\n\\t\\t\\t\\t&& line == b.line\\n\\n\\t\\t\\t\\t&& col == b.col;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tbool operator!=(const SourceLoc& b) const {\\n\\n\\t\\t\\treturn !(*this == b);\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp\",\n \"rank\": 6,\n \"score\": 203027.64200824406\n },\n {\n \"content\": \"// Wrapper class for threads. Does not use emugl::Thread intentionally.\\n\\n// Common data type used by the following tests below.\\n\\nstruct ThreadParams {\\n\\n ThreadParams() : mutex(), counter(0) {}\\n\\n\\n\\n Mutex mutex;\\n\\n int counter;\\n\\n};\\n\\n\\n\\n// This thread function uses Mutex::lock/unlock to synchronize a counter\\n\\n// increment operation.\\n\\nstatic void* threadFunction(void* param) {\\n\\n ThreadParams* p = static_cast<ThreadParams*>(param);\\n\\n\\n\\n p->mutex.lock();\\n\\n p->counter++;\\n\\n p->mutex.unlock();\\n\\n return NULL;\\n\\n}\\n\\n\\n\\nTEST(Mutex, Synchronization) {\\n\\n const size_t kNumThreads = 2000;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/mutex_unittest.cpp\",\n \"rank\": 7,\n \"score\": 198444.11757226574\n },\n {\n \"content\": \"struct BoostLogLogger : public anbox::Logger {\\n\\n BoostLogLogger() : initialized_(false) {}\\n\\n\\n\\n void Init(const anbox::Logger::Severity& severity = anbox::Logger::Severity::kWarning) override {\\n\\n if (initialized_)\\n\\n return;\\n\\n\\n\\n boost::log::formatter formatter =\\n\\n boost::log::expressions::stream\\n\\n << \\\"[\\\" << attrs::Severity << \\\" \\\"\\n\\n << boost::log::expressions::format_date_time<boost::posix_time::ptime>(\\n\\n \\\"Timestamp\\\", \\\"%Y-%m-%d %H:%M:%S\\\")\\n\\n << \\\"] \\\"\\n\\n << boost::log::expressions::if_(boost::log::expressions::has_attr(\\n\\n attrs::Location))[boost::log::expressions::stream\\n\\n << \\\"[\\\" << attrs::Location << \\\"] \\\"]\\n\\n << boost::log::expressions::smessage;\\n\\n\\n\\n boost::log::core::get()->remove_all_sinks();\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/logger.cpp\",\n \"rank\": 8,\n \"score\": 194612.73058538302\n },\n {\n \"content\": \"class BufferedIOStream : public IOStream {\\n\\n public:\\n\\n static const size_t default_buffer_size{384};\\n\\n\\n\\n explicit BufferedIOStream(\\n\\n const std::shared_ptr<anbox::network::SocketMessenger> &messenger,\\n\\n size_t buffer_size = default_buffer_size);\\n\\n\\n\\n virtual ~BufferedIOStream();\\n\\n\\n\\n void *allocBuffer(size_t min_size) override;\\n\\n size_t commitBuffer(size_t size) override;\\n\\n const unsigned char *read(void *buf, size_t *inout_len) override;\\n\\n void forceStop() override;\\n\\n void post_data(Buffer &&data);\\n\\n\\n\\n bool needs_data();\\n\\n\\n\\n private:\\n\\n void thread_main();\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/buffered_io_stream.h\",\n \"rank\": 9,\n \"score\": 194413.6886367628\n },\n {\n \"content\": \"struct Frame : public bt::Frame\\n\\n{\\n\\n struct Symbol : public bt::Frame::Symbol\\n\\n {\\n\\n Symbol(const char* symbol) : raw_(symbol)\\n\\n {\\n\\n auto first = raw_.find_first_of(\\\"(\\\");\\n\\n auto last = raw_.find_last_of(\\\")\\\");\\n\\n\\n\\n if (first != std::string::npos && last != std::string::npos)\\n\\n {\\n\\n auto mangled_symbol = raw_.substr(first+1,\\n\\n (last-1) - (first+1));\\n\\n\\n\\n auto plus = mangled_symbol.find_first_of(\\\"+\\\");\\n\\n if (plus != std::string::npos)\\n\\n mangled_symbol.erase(plus);\\n\\n\\n\\n std::tie(demangled_, is_cxx_) = demangle(mangled_symbol);\\n\\n if (!is_cxx_)\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/src/core/posix/backtrace.cpp\",\n \"rank\": 10,\n \"score\": 188880.3079810391\n },\n {\n \"content\": \"struct AsioStrandDispatcher : public anbox::common::Dispatcher {\\n\\n public:\\n\\n AsioStrandDispatcher(const std::shared_ptr<anbox::Runtime>& rt)\\n\\n : rt{rt}, strand{rt->service()} {}\\n\\n\\n\\n void dispatch(const Task& task) override { strand.post(task); }\\n\\n\\n\\n private:\\n\\n std::shared_ptr<anbox::Runtime> rt;\\n\\n boost::asio::io_service::strand strand;\\n\\n};\\n\\n}\\n\\n\\n\\nstd::shared_ptr<anbox::common::Dispatcher>\\n\\nanbox::common::create_dispatcher_for_runtime(\\n\\n const std::shared_ptr<anbox::Runtime>& rt) {\\n\\n return std::make_shared<AsioStrandDispatcher>(rt);\\n\\n}\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/common/dispatcher.cpp\",\n \"rank\": 11,\n \"score\": 185899.17797578397\n },\n {\n \"content\": \"class SocketStream : public IOStream {\\n\\npublic:\\n\\n typedef enum { ERR_INVALID_SOCKET = -1000 } SocketStreamError;\\n\\n\\n\\n explicit SocketStream(size_t bufsize = 10000);\\n\\n virtual ~SocketStream();\\n\\n\\n\\n virtual int listen(unsigned short port) = 0;\\n\\n virtual SocketStream *accept() = 0;\\n\\n virtual int connect(unsigned short port) = 0;\\n\\n\\n\\n virtual void *allocBuffer(size_t minSize);\\n\\n virtual int commitBuffer(size_t size);\\n\\n virtual const unsigned char *readFully(void *buf, size_t len);\\n\\n virtual const unsigned char *read(void *buf, size_t *inout_len);\\n\\n\\n\\n bool valid() { return m_sock >= 0; }\\n\\n virtual int recv(void *buf, size_t len);\\n\\n virtual int writeFully(const void *buf, size_t len);\\n\\n\\n\\nprotected:\\n\\n int m_sock;\\n\\n size_t m_bufsize;\\n\\n unsigned char *m_buf;\\n\\n\\n\\n SocketStream(int sock, size_t bufSize);\\n\\n};\\n\\n\\n\\n#endif /* __SOCKET_STREAM_H */\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/SocketStream.h\",\n \"rank\": 13,\n \"score\": 183805.24810516567\n },\n {\n \"content\": \"class QemuPipeStream : public IOStream {\\n\\npublic:\\n\\n typedef enum { ERR_INVALID_SOCKET = -1000 } QemuPipeStreamError;\\n\\n\\n\\n explicit QemuPipeStream(size_t bufsize = 10000);\\n\\n ~QemuPipeStream();\\n\\n int connect(void);\\n\\n\\n\\n virtual void *allocBuffer(size_t minSize);\\n\\n virtual int commitBuffer(size_t size);\\n\\n virtual const unsigned char *readFully( void *buf, size_t len);\\n\\n virtual const unsigned char *read( void *buf, size_t *inout_len);\\n\\n\\n\\n bool valid() { return m_sock >= 0; }\\n\\n int recv(void *buf, size_t len);\\n\\n\\n\\n virtual int writeFully(const void *buf, size_t len);\\n\\n\\n\\nprivate:\\n\\n int m_sock;\\n\\n size_t m_bufsize;\\n\\n unsigned char *m_buf;\\n\\n QemuPipeStream(int sock, size_t bufSize);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/OpenglSystemCommon/QemuPipeStream.h\",\n \"rank\": 14,\n \"score\": 180413.66498049602\n },\n {\n \"content\": \"class CORE_POSIX_DLL_PUBLIC Process : public Signalable\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * @brief Creates a process instance wrapping an existing process.\\n\\n * @throw Throw std::system_error if pid is invalid, i.e., pid < 0.\\n\\n * @param pid The process identifier of the existing process.\\n\\n */\\n\\n explicit Process(pid_t pid);\\n\\n\\n\\n /**\\n\\n * @brief Returns an invalid instance for testing purposes.\\n\\n * @return An invalid instance.\\n\\n */\\n\\n static Process invalid();\\n\\n\\n\\n /**\\n\\n * @brief Frees resources associated with the process.\\n\\n */\\n\\n virtual ~Process() noexcept;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/process.h\",\n \"rank\": 15,\n \"score\": 179511.43312866765\n },\n {\n \"content\": \"class IOStream {\\n\\npublic:\\n\\n\\n\\n IOStream(size_t bufSize) {\\n\\n m_buf = NULL;\\n\\n m_bufsize = bufSize;\\n\\n m_free = 0;\\n\\n }\\n\\n\\n\\n virtual void *allocBuffer(size_t minSize) = 0;\\n\\n virtual int commitBuffer(size_t size) = 0;\\n\\n virtual const unsigned char *readFully( void *buf, size_t len) = 0;\\n\\n virtual const unsigned char *read( void *buf, size_t *inout_len) = 0;\\n\\n virtual int writeFully(const void* buf, size_t len) = 0;\\n\\n\\n\\n virtual ~IOStream() {\\n\\n\\n\\n // NOTE: m_buf is 'owned' by the child class thus we expect it to be released by it\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 16,\n \"score\": 177961.21543588617\n },\n {\n \"content\": \"class IOStream {\\n\\npublic:\\n\\n IOStream(size_t bufSize) {\\n\\n m_buf = NULL;\\n\\n m_bufsize = bufSize;\\n\\n m_free = 0;\\n\\n }\\n\\n\\n\\n virtual void *allocBuffer(size_t minSize) = 0;\\n\\n virtual size_t commitBuffer(size_t size) = 0;\\n\\n virtual const unsigned char *read(void *buf, size_t *inout_len) = 0;\\n\\n virtual void forceStop() = 0;\\n\\n\\n\\n virtual ~IOStream() {\\n\\n // NOTE: m_buf is 'owned' by the child class thus we expect it to be released by it\\n\\n }\\n\\n\\n\\n unsigned char *alloc(size_t len) {\\n\\n if (m_buf && len > m_free) {\\n\\n if (flush() < 0)\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 17,\n \"score\": 176310.6235429296\n },\n {\n \"content\": \"class CORE_POSIX_DLL_PUBLIC ChildProcess : public Process\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * @brief The DeathObserver class observes child process' states and emits a signal when a monitored child has died.\\n\\n *\\n\\n * Please note that the name of this class is morbid for a reason: Listening\\n\\n * for SIGCHLD is not enough to catch all dying children. Whenever a SIGCHLD is\\n\\n * received, we have to wait for all the children of this process and reap all\\n\\n * monitored ones. We are thus changing state and potentially race with other\\n\\n * wait operations on children.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/child_process.h\",\n \"rank\": 18,\n \"score\": 176306.98362636007\n },\n {\n \"content\": \"class CORE_POSIX_DLL_PUBLIC ProcessGroup : public Signalable\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * @brief Accesses the id of this process group.\\n\\n * @return The id of this process group.\\n\\n */\\n\\n virtual pid_t id() const;\\n\\n\\n\\n static ProcessGroup invalid();\\n\\n\\n\\nprotected:\\n\\n friend class Process;\\n\\n CORE_POSIX_DLL_LOCAL ProcessGroup(pid_t id);\\n\\n\\n\\nprivate:\\n\\n struct CORE_POSIX_DLL_LOCAL Private;\\n\\n std::shared_ptr<Private> d;\\n\\n};\\n\\n}\\n\\n}\\n\\n\\n\\n#endif // CORE_POSIX_PROCESS_GROUP_H_\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/process_group.h\",\n \"rank\": 19,\n \"score\": 176306.98362636007\n },\n {\n \"content\": \"/*\\n\\n* Copyright (C) 2011 The Android Open Source Project\\n\\n*\\n\\n* Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n* you may not use this file except in compliance with the License.\\n\\n* You may obtain a copy of the License at\\n\\n*\\n\\n* http://www.apache.org/licenses/LICENSE-2.0\\n\\n*\\n\\n* Unless required by applicable law or agreed to in writing, software\\n\\n* distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n* See the License for the specific language governing permissions and\\n\\n* limitations under the License.\\n\\n*/\\n\\n#ifndef __IO_STREAM_H__\\n\\n#define __IO_STREAM_H__\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <stdio.h>\\n\\n\\n\\n#include \\\"ErrorLog.h\\\"\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 20,\n \"score\": 167893.8780087823\n },\n {\n \"content\": \" unsigned char *alloc(size_t len) {\\n\\n\\n\\n if (m_buf && len > m_free) {\\n\\n if (flush() < 0) {\\n\\n ERR(\\\"Failed to flush in alloc\\\\n\\\");\\n\\n return NULL; // we failed to flush so something is wrong\\n\\n }\\n\\n }\\n\\n\\n\\n if (!m_buf || len > m_bufsize) {\\n\\n int allocLen = m_bufsize < len ? len : m_bufsize;\\n\\n m_buf = (unsigned char *)allocBuffer(allocLen);\\n\\n if (!m_buf) {\\n\\n ERR(\\\"Alloc (%u bytes) failed\\\\n\\\", allocLen);\\n\\n return NULL;\\n\\n }\\n\\n m_bufsize = m_free = allocLen;\\n\\n }\\n\\n\\n\\n unsigned char *ptr;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 21,\n \"score\": 167878.7459518016\n },\n {\n \"content\": \"\\n\\n ptr = m_buf + (m_bufsize - m_free);\\n\\n m_free -= len;\\n\\n\\n\\n return ptr;\\n\\n }\\n\\n\\n\\n int flush() {\\n\\n\\n\\n if (!m_buf || m_free == m_bufsize) return 0;\\n\\n\\n\\n int stat = commitBuffer(m_bufsize - m_free);\\n\\n m_buf = NULL;\\n\\n m_free = 0;\\n\\n return stat;\\n\\n }\\n\\n\\n\\n const unsigned char *readback(void *buf, size_t len) {\\n\\n flush();\\n\\n return readFully(buf, len);\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 22,\n \"score\": 167878.7459518016\n },\n {\n \"content\": \" }\\n\\n\\n\\n\\n\\nprivate:\\n\\n unsigned char *m_buf;\\n\\n size_t m_bufsize;\\n\\n size_t m_free;\\n\\n};\\n\\n\\n\\n//\\n\\n// When a client opens a connection to the renderer, it should\\n\\n// send unsigned int value indicating the \\\"clientFlags\\\".\\n\\n// The following are the bitmask of the clientFlags.\\n\\n// currently only one bit is used which flags the server\\n\\n// it should exit.\\n\\n//\\n\\n#define IOSTREAM_CLIENT_EXIT_SERVER 1\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 23,\n \"score\": 167878.7459518016\n },\n {\n \"content\": \"/*\\n\\n* Copyright (C) 2011 The Android Open Source Project\\n\\n*\\n\\n* Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n* you may not use this file except in compliance with the License.\\n\\n* You may obtain a copy of the License at\\n\\n*\\n\\n* http://www.apache.org/licenses/LICENSE-2.0\\n\\n*\\n\\n* Unless required by applicable law or agreed to in writing, software\\n\\n* distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n* See the License for the specific language governing permissions and\\n\\n* limitations under the License.\\n\\n*/\\n\\n#ifndef __IO_STREAM_H__\\n\\n#define __IO_STREAM_H__\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <stdio.h>\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 24,\n \"score\": 166016.2675738681\n },\n {\n \"content\": \" return NULL; // we failed to flush so something is wrong\\n\\n }\\n\\n\\n\\n if (!m_buf || len > m_bufsize) {\\n\\n int allocLen = m_bufsize < len ? len : m_bufsize;\\n\\n m_buf = static_cast<unsigned char *>(allocBuffer(allocLen));\\n\\n if (!m_buf)\\n\\n return NULL;\\n\\n m_bufsize = m_free = allocLen;\\n\\n }\\n\\n\\n\\n unsigned char *ptr;\\n\\n\\n\\n ptr = m_buf + (m_bufsize - m_free);\\n\\n m_free -= len;\\n\\n\\n\\n return ptr;\\n\\n }\\n\\n\\n\\n int flush() {\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 25,\n \"score\": 166001.68943717133\n },\n {\n \"content\": \" if (!m_buf || m_free == m_bufsize) return 0;\\n\\n\\n\\n int stat = commitBuffer(m_bufsize - m_free);\\n\\n m_buf = NULL;\\n\\n m_free = 0;\\n\\n return stat;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n unsigned char *m_buf;\\n\\n size_t m_bufsize;\\n\\n size_t m_free;\\n\\n};\\n\\n\\n\\n//\\n\\n// When a client opens a connection to the renderer, it should\\n\\n// send unsigned int value indicating the \\\"clientFlags\\\".\\n\\n// The following are the bitmask of the clientFlags.\\n\\n// currently only one bit is used which flags the server\\n\\n// it should exit.\\n\\n//\\n\\n#define IOSTREAM_CLIENT_EXIT_SERVER 1\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/host/include/libOpenglRender/IOStream.h\",\n \"rank\": 26,\n \"score\": 166001.68943717136\n },\n {\n \"content\": \"// Simple wrapper class for mutexes.\\n\\nclass Mutex {\\n\\npublic:\\n\\n // Constructor.\\n\\n Mutex() {\\n\\n#ifdef _WIN32\\n\\n ::InitializeCriticalSection(&mLock);\\n\\n#else\\n\\n ::pthread_mutex_init(&mLock, NULL);\\n\\n#endif\\n\\n }\\n\\n\\n\\n // Destructor.\\n\\n ~Mutex() {\\n\\n#ifdef _WIN32\\n\\n ::DeleteCriticalSection(&mLock);\\n\\n#else\\n\\n ::pthread_mutex_destroy(&mLock);\\n\\n#endif\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/mutex.h\",\n \"rank\": 27,\n \"score\": 161184.416189796\n },\n {\n \"content\": \"class EmulatedCamera3 : public camera3_device, public EmulatedBaseCamera {\\n\\npublic:\\n\\n /* Constructs EmulatedCamera3 instance.\\n\\n * Param:\\n\\n * cameraId - Zero based camera identifier, which is an index of the camera\\n\\n * instance in camera factory's array.\\n\\n * module - Emulated camera HAL module descriptor.\\n\\n */\\n\\n EmulatedCamera3(int cameraId,\\n\\n struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedCamera2 instance. */\\n\\n virtual ~EmulatedCamera3();\\n\\n\\n\\n /* List of all defined capabilities plus useful HW levels */\\n\\n enum AvailableCapabilities {\\n\\n BACKWARD_COMPATIBLE,\\n\\n MANUAL_SENSOR,\\n\\n MANUAL_POST_PROCESSING,\\n\\n RAW,\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCamera3.h\",\n \"rank\": 28,\n \"score\": 150868.77013997053\n },\n {\n \"content\": \"class EmulatedCamera : public camera_device, public EmulatedBaseCamera {\\n\\npublic:\\n\\n /* Constructs EmulatedCamera instance.\\n\\n * Param:\\n\\n * cameraId - Zero based camera identifier, which is an index of the camera\\n\\n * instance in camera factory's array.\\n\\n * module - Emulated camera HAL module descriptor.\\n\\n */\\n\\n EmulatedCamera(int cameraId,\\n\\n struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedCamera instance. */\\n\\n virtual ~EmulatedCamera();\\n\\n\\n\\n /****************************************************************************\\n\\n * Abstract API\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Gets emulated camera device used by this instance of the emulated camera.\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCamera.h\",\n \"rank\": 29,\n \"score\": 150868.77013997053\n },\n {\n \"content\": \"class EmulatedCamera2 : public camera2_device, public EmulatedBaseCamera {\\n\\npublic:\\n\\n /* Constructs EmulatedCamera2 instance.\\n\\n * Param:\\n\\n * cameraId - Zero based camera identifier, which is an index of the camera\\n\\n * instance in camera factory's array.\\n\\n * module - Emulated camera HAL module descriptor.\\n\\n */\\n\\n EmulatedCamera2(int cameraId,\\n\\n struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedCamera2 instance. */\\n\\n virtual ~EmulatedCamera2();\\n\\n\\n\\n /****************************************************************************\\n\\n * Abstract API\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCamera2.h\",\n \"rank\": 30,\n \"score\": 150868.77013997053\n },\n {\n \"content\": \"struct HwcContext {\\n\\n hwc_composer_device_1_t device;\\n\\n\\n\\n // These 3 variables could be reduced to first_overlay only, however it makes\\n\\n // the conditions in the code more complicated. In order to keep things as\\n\\n // simple as possible, there are 3 major ways to display a frame.\\n\\n // 1. Show only the framebuffer.\\n\\n // 2. Show the framebuffer with some overlays above it.\\n\\n // 3. Show all overlays and hide the framebuffer.\\n\\n //\\n\\n // Since the framebuffer has no alpha channel and is opaque, it can only ever\\n\\n // be the rearmost layer that we end up putting on screen, otherwise it will\\n\\n // cover up all layers behind it, since its display frame is the whole window.\\n\\n //\\n\\n // Without framebuffer_visible, the condition of whether to display the\\n\\n // frambuffer becomes more complex and possibly if (numHwLayers == 0 ||\\n\\n // hwLayers[0]->compositionType != HWC_OVERLAY) but that might not be correct.\\n\\n //\\n\\n // The range [first_overlay, first_overlay+num_overlay) is a natural way to\\n\\n // structure the loop and prevents requiring state and iterating through all\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/hwcomposer/hwcomposer.cpp\",\n \"rank\": 31,\n \"score\": 150241.79590903246\n },\n {\n \"content\": \"struct generic_stream_in {\\n\\n struct audio_stream_in stream;\\n\\n struct generic_audio_device *dev;\\n\\n audio_devices_t device;\\n\\n int fd;\\n\\n};\\n\\n\\n\\nstatic uint32_t out_get_sample_rate(const struct audio_stream *stream) {\\n\\n return OUT_SAMPLING_RATE;\\n\\n}\\n\\n\\n\\nstatic int out_set_sample_rate(struct audio_stream *stream, uint32_t rate) {\\n\\n return -ENOSYS;\\n\\n}\\n\\n\\n\\nstatic size_t out_get_buffer_size(const struct audio_stream *stream) {\\n\\n return OUT_BUFFER_SIZE;\\n\\n}\\n\\n\\n\\nstatic audio_channel_mask_t out_get_channels(const struct audio_stream *stream) {\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp\",\n \"rank\": 32,\n \"score\": 148993.2406601911\n },\n {\n \"content\": \"struct generic_stream_out {\\n\\n struct audio_stream_out stream;\\n\\n struct generic_audio_device *dev;\\n\\n audio_devices_t device;\\n\\n int fd;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp\",\n \"rank\": 33,\n \"score\": 148993.2406601911\n },\n {\n \"content\": \"class CORE_POSIX_DLL_PUBLIC Signalable\\n\\n{\\n\\npublic:\\n\\n virtual ~Signalable() { }\\n\\n\\n\\n /**\\n\\n * @brief Sends a signal to this signalable object.\\n\\n * @throws std::system_error in case of problems.\\n\\n * @param [in] signal The signal to be sent to the process.\\n\\n */\\n\\n virtual void send_signal_or_throw(Signal signal);\\n\\n\\n\\n /**\\n\\n * @brief Sends a signal to this signalable object.\\n\\n * @param [in] signal The signal to be sent to the process.\\n\\n * @param [out] e Set to contain an error if an issue arises.\\n\\n */\\n\\n virtual void send_signal(Signal signal, std::error_code& e) noexcept(true);\\n\\n\\n\\nprotected:\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/signalable.h\",\n \"rank\": 34,\n \"score\": 148947.60425506212\n },\n {\n \"content\": \"struct generic_audio_device {\\n\\n struct audio_hw_device device;\\n\\n pthread_mutex_t lock;\\n\\n struct audio_stream_out *output;\\n\\n struct audio_stream_in *input;\\n\\n bool mic_mute;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp\",\n \"rank\": 35,\n \"score\": 147772.721298119\n },\n {\n \"content\": \"//\\n\\n// our private gralloc module structure\\n\\n//\\n\\nstruct private_module_t {\\n\\n gralloc_module_t base;\\n\\n};\\n\\n\\n\\n/* If not NULL, this is a pointer to the fallback module.\\n\\n * This really is gralloc.default, which we'll use if we detect\\n\\n * that the emulator we're running in does not support GPU emulation.\\n\\n */\\n\\nstatic gralloc_module_t* sFallback;\\n\\nstatic pthread_once_t sFallbackOnce = PTHREAD_ONCE_INIT;\\n\\n\\n\\nstatic void fallback_init(void); // forward\\n\\n\\n\\n\\n\\ntypedef struct _alloc_list_node {\\n\\n buffer_handle_t handle;\\n\\n _alloc_list_node *next;\\n\\n _alloc_list_node *prev;\\n\\n} AllocListNode;\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp\",\n \"rank\": 36,\n \"score\": 147772.721298119\n },\n {\n \"content\": \"//\\n\\n// Our framebuffer device structure\\n\\n//\\n\\nstruct fb_device_t {\\n\\n framebuffer_device_t device;\\n\\n};\\n\\n\\n\\nstatic int map_buffer(cb_handle_t *cb, void **vaddr)\\n\\n{\\n\\n if (cb->fd < 0 || cb->ashmemSize <= 0) {\\n\\n return -EINVAL;\\n\\n }\\n\\n\\n\\n void *addr = mmap(0, cb->ashmemSize, PROT_READ | PROT_WRITE,\\n\\n MAP_SHARED, cb->fd, 0);\\n\\n if (addr == MAP_FAILED) {\\n\\n return -errno;\\n\\n }\\n\\n\\n\\n cb->ashmemBase = intptr_t(addr);\\n\\n cb->ashmemBasePid = getpid();\\n\\n\\n\\n *vaddr = addr;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp\",\n \"rank\": 37,\n \"score\": 147772.721298119\n },\n {\n \"content\": \"//\\n\\n// Our gralloc device structure (alloc interface)\\n\\n//\\n\\nstruct gralloc_device_t {\\n\\n alloc_device_t device;\\n\\n\\n\\n AllocListNode *allocListHead; // double linked list of allocated buffers\\n\\n pthread_mutex_t lock;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp\",\n \"rank\": 38,\n \"score\": 147772.721298119\n },\n {\n \"content\": \"struct egl_surface_t {\\n\\n\\n\\n EGLDisplay dpy;\\n\\n EGLConfig config;\\n\\n\\n\\n\\n\\n egl_surface_t(EGLDisplay dpy, EGLConfig config, EGLint surfaceType);\\n\\n virtual ~egl_surface_t();\\n\\n\\n\\n virtual void setSwapInterval(int interval) = 0;\\n\\n virtual EGLBoolean swapBuffers() = 0;\\n\\n\\n\\n EGLint getSwapBehavior() const;\\n\\n uint32_t getRcSurface() { return rcSurface; }\\n\\n EGLint getSurfaceType() { return surfaceType; }\\n\\n\\n\\n EGLint getWidth(){ return width; }\\n\\n EGLint getHeight(){ return height; }\\n\\n void setTextureFormat(EGLint _texFormat) { texFormat = _texFormat; }\\n\\n EGLint getTextureFormat() { return texFormat; }\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/egl/egl.cpp\",\n \"rank\": 39,\n \"score\": 147772.721298119\n },\n {\n \"content\": \"class CORE_POSIX_DLL_PUBLIC SignalTrap\\n\\n{\\n\\npublic:\\n\\n SignalTrap(const SignalTrap&) = delete;\\n\\n virtual ~SignalTrap() = default;\\n\\n\\n\\n SignalTrap& operator=(const SignalTrap&) = delete;\\n\\n bool operator==(const SignalTrap&) const = delete;\\n\\n\\n\\n /**\\n\\n * @brief Returns true if the given signal is trapped by this instance.\\n\\n */\\n\\n virtual bool has(Signal signal) = 0;\\n\\n\\n\\n /**\\n\\n * @brief Starts observation of incoming signals, relaying them via\\n\\n * signal_raised(). The call blocks until stop is called.\\n\\n */\\n\\n virtual void run() = 0;\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/posix/signal.h\",\n \"rank\": 40,\n \"score\": 147132.069276885\n },\n {\n \"content\": \"struct EmulatedCameraHotplugThread;\\n\\n\\n\\n/*\\n\\n * Contains declaration of a class EmulatedCameraFactory that manages cameras\\n\\n * available for the emulation. A global instance of this class is statically\\n\\n * instantiated and initialized when camera emulation HAL is loaded.\\n\\n */\\n\\n\\n\\n/* Class EmulatedCameraFactoryManages cameras available for the emulation.\\n\\n *\\n\\n * When the global static instance of this class is created on the module load,\\n\\n * it enumerates cameras available for the emulation by connecting to the\\n\\n * emulator's 'camera' service. For every camera found out there it creates an\\n\\n * instance of an appropriate class, and stores it an in array of emulated\\n\\n * cameras. In addition to the cameras reported by the emulator, a fake camera\\n\\n * emulator is always created, so there is always at least one camera that is\\n\\n * available.\\n\\n *\\n\\n * Instance of this class is also used as the entry point for the camera HAL API,\\n\\n * including:\\n\\n * - hw_module_methods_t::open entry point\\n\\n * - camera_module_t::get_number_of_cameras entry point\\n\\n * - camera_module_t::get_camera_info entry point\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraFactory.h\",\n \"rank\": 41,\n \"score\": 146579.26079607772\n },\n {\n \"content\": \"// Helper union to store a socket address.\\n\\nstruct SockAddr {\\n\\n socklen_t len;\\n\\n union {\\n\\n sockaddr generic;\\n\\n sockaddr_in inet;\\n\\n#ifndef _WIN32\\n\\n sockaddr_un local;\\n\\n#endif\\n\\n };\\n\\n\\n\\n int getFamily() const { return generic.sa_family; }\\n\\n\\n\\n void initEmpty() {\\n\\n ::memset(this, 0, sizeof(*this));\\n\\n this->len = static_cast<socklen_t>(sizeof(*this));\\n\\n }\\n\\n\\n\\n int initFromInet(uint32_t ip_address, int port) {\\n\\n if (port < 0 || port >= 65536)\\n\\n return -EINVAL;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/sockets.cpp\",\n \"rank\": 42,\n \"score\": 145411.92858152583\n },\n {\n \"content\": \"struct BufferData {\\n\\n BufferData();\\n\\n BufferData(GLsizeiptr size, void * data);\\n\\n GLsizeiptr m_size;\\n\\n FixedBuffer m_fixedBuffer; \\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/GLSharedGroup.h\",\n \"rank\": 43,\n \"score\": 144269.83773947274\n },\n {\n \"content\": \"struct ShaderData {\\n\\n typedef android::List<android::String8> StringList;\\n\\n StringList samplerExternalNames;\\n\\n int refcount;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/GLSharedGroup.h\",\n \"rank\": 44,\n \"score\": 144269.83773947274\n },\n {\n \"content\": \"struct UnpackerT {};\\n\\n\\n\\ntemplate <typename T, typename S>\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/OpenglCodecCommon/ProtocolUtils.h\",\n \"rank\": 45,\n \"score\": 144269.83773947274\n },\n {\n \"content\": \"// The following is the shared structure between all threads.\\n\\nstruct MultiState {\\n\\n MultiState(LazyInstance<StaticCounter>* staticCounter) :\\n\\n mMutex(), mStaticCounter(staticCounter), mCount(0) {}\\n\\n\\n\\n enum {\\n\\n kMaxThreads = 1000,\\n\\n };\\n\\n\\n\\n Mutex mMutex;\\n\\n LazyInstance<StaticCounter>* mStaticCounter;\\n\\n size_t mCount;\\n\\n void* mValues[kMaxThreads];\\n\\n TestThread* mThreads[kMaxThreads];\\n\\n};\\n\\n\\n\\n// The thread function for the test below.\\n\\nstatic void* threadFunc(void* param) {\\n\\n MultiState* state = static_cast<MultiState*>(param);\\n\\n Mutex::AutoLock lock(state->mMutex);\\n\\n if (state->mCount < MultiState::kMaxThreads) {\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/lazy_instance_unittest.cpp\",\n \"rank\": 46,\n \"score\": 143152.1424188509\n },\n {\n \"content\": \"// NotCopyable deletes the copy c'tor and the assignment operator.\\n\\nstruct NotCopyable\\n\\n{\\n\\n NotCopyable() = default;\\n\\n NotCopyable(const NotCopyable&) = delete;\\n\\n virtual ~NotCopyable() = default;\\n\\n NotCopyable& operator=(const NotCopyable&) = delete;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/xdg/xdg.h\",\n \"rank\": 47,\n \"score\": 142495.39752184373\n },\n {\n \"content\": \"// NotMoveable deletes the move c'tor and the move assignment operator.\\n\\nstruct NotMoveable\\n\\n{\\n\\n NotMoveable() = default;\\n\\n NotMoveable(NotMoveable&&) = delete;\\n\\n virtual ~NotMoveable() = default;\\n\\n NotMoveable& operator=(NotMoveable&&) = delete;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/xdg/xdg.h\",\n \"rank\": 48,\n \"score\": 142495.39752184373\n },\n {\n \"content\": \"struct PingPongState {\\n\\n MessageChannel<std::string, 3U> in;\\n\\n MessageChannel<std::string, 3U> out;\\n\\n};\\n\\n\\n\\nvoid* pingPongFunction(void* param) {\\n\\n for (;;) {\\n\\n PingPongState* s = static_cast<PingPongState*>(param);\\n\\n std::string str;\\n\\n s->in.receive(&str);\\n\\n s->out.send(str);\\n\\n if (str == \\\"quit\\\") {\\n\\n break;\\n\\n }\\n\\n }\\n\\n return 0;\\n\\n}\\n\\n\\n\\n} // namespace\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/message_channel_unittest.cpp\",\n \"rank\": 49,\n \"score\": 142058.0354247275\n },\n {\n \"content\": \"class CORE_POSIX_DLL_PUBLIC CrossProcessSync\\n\\n{\\n\\n public:\\n\\n struct Error\\n\\n {\\n\\n Error() = delete;\\n\\n ~Error() = delete;\\n\\n\\n\\n /**\\n\\n * @brief Thrown if any of the *_for functions times out.\\n\\n */\\n\\n struct Timeout : public std::runtime_error\\n\\n {\\n\\n Timeout() : std::runtime_error(\\\"Timeout while waiting for event to happen.\\\")\\n\\n {\\n\\n }\\n\\n };\\n\\n };\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/include/core/testing/cross_process_sync.h\",\n \"rank\": 50,\n \"score\": 141941.65275312006\n },\n {\n \"content\": \"struct Event {\\n\\n std::uint16_t type;\\n\\n std::uint16_t code;\\n\\n std::int32_t value;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/input/device.h\",\n \"rank\": 51,\n \"score\": 141011.18816619407\n },\n {\n \"content\": \"struct deleter {\\n\\n\\ttemplate <typename U>\\n\\n\\t\\tvoid operator()(U& ptr) const {\\n\\n\\t\\t\\t(*F)(ptr);\\n\\n\\t\\t}\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp\",\n \"rank\": 52,\n \"score\": 139567.07057306488\n },\n {\n \"content\": \"struct demangler:\\n\\n\\tpublic demangler_impl<system_tag::current_tag> {};\\n\\n\\n\\n} // namespace details\\n\\n\\n\\n/*************** A TRACE ***************/\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp\",\n \"rank\": 53,\n \"score\": 139567.07057306488\n },\n {\n \"content\": \"struct Configuration {\\n\\n graphics::Rect display_frame = graphics::Rect::Invalid;\\n\\n bool single_window = false;\\n\\n bool no_touch_emulation = false;\\n\\n bool server_side_decoration = false;\\n\\n};\\n\\n\\n\\nstd::shared_ptr<BasePlatform> create(const std::string &name,\\n\\n const std::shared_ptr<input::Manager> &input_manager,\\n\\n const Configuration &config);\\n\\n} // namespace platform\\n\\n} // namespace anbox\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/platform/base_platform.h\",\n \"rank\": 54,\n \"score\": 139567.07057306488\n },\n {\n \"content\": \"struct Trace {\\n\\n\\tvoid* addr;\\n\\n\\tsize_t idx;\\n\\n\\n\\n\\tTrace():\\n\\n\\t\\taddr(nullptr), idx(0) {}\\n\\n\\n\\n\\texplicit Trace(void* _addr, size_t _idx):\\n\\n\\t\\taddr(_addr), idx(_idx) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp\",\n \"rank\": 55,\n \"score\": 139567.07057306488\n },\n {\n \"content\": \"class SocketMessenger : public MessageSender, public MessageReceiver {\\n\\n public:\\n\\n virtual Credentials creds() const = 0;\\n\\n virtual unsigned short local_port() const = 0;\\n\\n virtual void set_no_delay() = 0;\\n\\n virtual void close() = 0;\\n\\n};\\n\\n} // namespace network\\n\\n} // namespace anbox\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/network/socket_messenger.h\",\n \"rank\": 56,\n \"score\": 139266.8840682224\n },\n {\n \"content\": \"class PublishedSocketConnector : public DoNotCopyOrMove, public Connector {\\n\\n public:\\n\\n explicit PublishedSocketConnector(\\n\\n const std::string& socket_file, const std::shared_ptr<Runtime>& rt,\\n\\n const std::shared_ptr<ConnectionCreator<\\n\\n boost::asio::local::stream_protocol>>& connection_creator);\\n\\n ~PublishedSocketConnector() noexcept;\\n\\n\\n\\n std::string socket_file() const { return socket_file_; }\\n\\n\\n\\n private:\\n\\n void start_accept();\\n\\n void on_new_connection(\\n\\n std::shared_ptr<boost::asio::local::stream_protocol::socket> const& socket,\\n\\n boost::system::error_code const& err);\\n\\n\\n\\n const std::string socket_file_;\\n\\n std::shared_ptr<Runtime> runtime_;\\n\\n std::shared_ptr<ConnectionCreator<boost::asio::local::stream_protocol>>\\n\\n connection_creator_;\\n\\n boost::asio::local::stream_protocol::acceptor acceptor_;\\n\\n};\\n\\n} // namespace network\\n\\n} // namespace anbox\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/network/published_socket_connector.h\",\n \"rank\": 57,\n \"score\": 138218.00647272263\n },\n {\n \"content\": \"class TcpSocketConnector : public DoNotCopyOrMove, public Connector {\\n\\n public:\\n\\n explicit TcpSocketConnector(\\n\\n const boost::asio::ip::address_v4 &address, unsigned short port,\\n\\n const std::shared_ptr<Runtime> &rt,\\n\\n const std::shared_ptr<ConnectionCreator<boost::asio::ip::tcp>>\\n\\n &connection_creator);\\n\\n ~TcpSocketConnector() noexcept;\\n\\n\\n\\n unsigned short port() const { return port_; }\\n\\n\\n\\n private:\\n\\n void start_accept();\\n\\n void on_new_connection(\\n\\n std::shared_ptr<boost::asio::ip::tcp::socket> const &socket,\\n\\n boost::system::error_code const &err);\\n\\n\\n\\n boost::asio::ip::address_v4 address_;\\n\\n unsigned short port_;\\n\\n std::shared_ptr<Runtime> runtime_;\\n\\n std::shared_ptr<ConnectionCreator<boost::asio::ip::tcp>> connection_creator_;\\n\\n boost::asio::ip::tcp::acceptor acceptor_;\\n\\n};\\n\\n} // namespace network\\n\\n} // namespace anbox\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/network/tcp_socket_connector.h\",\n \"rank\": 58,\n \"score\": 138218.00647272263\n },\n {\n \"content\": \"struct RendererWindow;\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.h\",\n \"rank\": 59,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"struct FuncDelete {\\n\\n explicit FuncDelete(Func f = {}) : mF(f) {}\\n\\n\\n\\n FuncDelete(const FuncDelete& other) = default;\\n\\n FuncDelete(FuncDelete&& other) = default;\\n\\n FuncDelete& operator=(const FuncDelete& other) = default;\\n\\n FuncDelete& operator=(FuncDelete&& other) = default;\\n\\n\\n\\n // To be able to copy/move from all compatible template instantiations.\\n\\n template <class U>\\n\\n friend struct FuncDelete;\\n\\n\\n\\n // Template constructors and move assignment from compatible instantiations.\\n\\n template <class U>\\n\\n FuncDelete(const FuncDelete<U>& other) : mF(other.mF) {}\\n\\n template <class U>\\n\\n FuncDelete(FuncDelete<U>&& other) : mF(std::move(other.mF)) {}\\n\\n template <class U>\\n\\n FuncDelete& operator=(const FuncDelete<U>& other) {\\n\\n mF = other.mF;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/common/scope_ptr.h\",\n \"rank\": 60,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"struct IntOwnedFd {\\n\\n int int_owned_fd;\\n\\n};\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/common/fd.h\",\n \"rank\": 61,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"// A structure used to list the capabilities of the underlying EGL\\n\\n// implementation that the FrameBuffer instance depends on.\\n\\n// |has_eglimage_texture_2d| is true iff the EGL_KHR_gl_texture_2D_image\\n\\n// extension is supported.\\n\\n// |has_eglimage_renderbuffer| is true iff the EGL_KHR_gl_renderbuffer_image\\n\\n// extension is supported.\\n\\n// |eglMajor| and |eglMinor| are the major and minor version numbers of\\n\\n// the underlying EGL implementation.\\n\\nstruct RendererCaps {\\n\\n bool has_eglimage_texture_2d;\\n\\n bool has_eglimage_renderbuffer;\\n\\n EGLint eglMajor;\\n\\n EGLint eglMinor;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.h\",\n \"rank\": 62,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"struct default_delete {\\n\\n\\tvoid operator()(T& ptr) const {\\n\\n\\t\\tdelete ptr;\\n\\n\\t}\\n\\n};\\n\\n\\n\\ntemplate <typename T, typename Deleter = deleter<void, void*, &::free> >\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp\",\n \"rank\": 63,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"struct demangler_impl {\\n\\n\\tstatic std::string demangle(const char* funcname) {\\n\\n\\t\\treturn funcname;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n#if defined(BACKWARD_SYSTEM_LINUX) || defined(BACKWARD_SYSTEM_DARWIN)\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/backward.hpp\",\n \"rank\": 64,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"struct FreeDelete {\\n\\n template <class T>\\n\\n void operator()(T ptr) const {\\n\\n free(ptr);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <class Func>\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/common/scope_ptr.h\",\n \"rank\": 65,\n \"score\": 138161.44193990383\n },\n {\n \"content\": \"struct audio_module HAL_MODULE_INFO_SYM = {\\n\\n .common = {\\n\\n .tag = HARDWARE_MODULE_TAG,\\n\\n .module_api_version = AUDIO_MODULE_API_VERSION_0_1,\\n\\n .hal_api_version = HARDWARE_HAL_API_VERSION,\\n\\n .id = AUDIO_HARDWARE_MODULE_ID,\\n\\n .name = \\\"Anbox audio HW HAL\\\",\\n\\n .author = \\\"The Android Open Source Project\\\",\\n\\n .methods = &hal_module_methods,\\n\\n },\\n\\n};\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/audio/audio_hw.cpp\",\n \"rank\": 66,\n \"score\": 137724.18876417686\n },\n {\n \"content\": \"struct ColorBufferRef {\\n\\n ColorBufferPtr cb;\\n\\n uint32_t refcount; // number of client-side references\\n\\n};\\n\\ntypedef std::map<HandleType, RenderContextPtr> RenderContextMap;\\n\\ntypedef std::map<HandleType, std::pair<WindowSurfacePtr, HandleType>>\\n\\n WindowSurfaceMap;\\n\\ntypedef std::map<HandleType, ColorBufferRef> ColorBufferMap;\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.h\",\n \"rank\": 67,\n \"score\": 136792.78377713138\n },\n {\n \"content\": \"// Hard-coded arrays of vertex information.\\n\\nstruct Vertex {\\n\\n float pos[3];\\n\\n float coord[2];\\n\\n};\\n\\n\\n\\nconst Vertex kVertices[] = {\\n\\n {{+1, -1, +0}, {+1, +1}},\\n\\n {{+1, +1, +0}, {+1, +0}},\\n\\n {{-1, +1, +0}, {+0, +0}},\\n\\n {{-1, -1, +0}, {+0, +1}},\\n\\n};\\n\\n\\n\\nconst GLubyte kIndices[] = {0, 1, 2, 2, 3, 0};\\n\\nconst GLint kIndicesLen = sizeof(kIndices) / sizeof(kIndices[0]);\\n\\n\\n\\n} // namespace\\n\\n\\n\\nTextureDraw::TextureDraw(EGLDisplay)\\n\\n : mVertexShader(0),\\n\\n mFragmentShader(0),\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/TextureDraw.cpp\",\n \"rank\": 68,\n \"score\": 136792.78377713138\n },\n {\n \"content\": \"struct TestBase {\\n\\n\\tconst char* name;\\n\\n\\tTestStatus expected_status;\\n\\n\\n\\n\\tvirtual ~TestBase() {}\\n\\n\\tTestBase(const char*, TestStatus);\\n\\n\\tvirtual void do_test() = 0;\\n\\n\\n\\n\\tTestStatus run() {\\n\\n\\t\\ttry {\\n\\n\\t\\t\\tdo_test();\\n\\n\\t\\t\\treturn SUCCESS;\\n\\n\\t\\t} catch(const AssertFailedError& e) {\\n\\n\\t\\t\\tprintf(\\\"!! %s\\\\n\\\", e.what());\\n\\n\\t\\t\\treturn ASSERT_FAIL;\\n\\n\\t\\t} catch(const std::exception& e) {\\n\\n\\t\\t\\tprintf(\\\"!! exception: %s\\\\n\\\", e.what());\\n\\n\\t\\t\\treturn EXCEPTION_UNCAUGHT;\\n\\n\\t\\t} catch(...) {\\n\\n\\t\\t\\tprintf(\\\"!! unknown exception\\\\n\\\");\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/backward-cpp/test/test.hpp\",\n \"rank\": 69,\n \"score\": 136792.78377713138\n },\n {\n \"content\": \"struct result_ptr_t {\\n\\n typedef ::google::protobuf::MessageLite* type;\\n\\n};\\n\\n\\n\\n// Boiler plate for unpacking a parameter message, invoking a server function,\\n\\n// and\\n\\n// sending the result message. Assumes the existence of Self::send_response().\\n\\ntemplate <class Self, class Bridge, class BridgeX, class ParameterMessage,\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/rpc/template_message_processor.h\",\n \"rank\": 70,\n \"score\": 136792.78377713138\n },\n {\n \"content\": \"struct RendererWindow {\\n\\n EGLNativeWindowType native_window = 0;\\n\\n EGLSurface surface = EGL_NO_SURFACE;\\n\\n anbox::graphics::Rect viewport;\\n\\n glm::mat4 screen_to_gl_coords = glm::mat4(1.0f);\\n\\n glm::mat4 display_transform = glm::mat4(1.0f);\\n\\n};\\n\\n\\n\\nRendererWindow *Renderer::createNativeWindow(\\n\\n EGLNativeWindowType native_window) {\\n\\n m_lock.lock();\\n\\n\\n\\n auto window = new RendererWindow;\\n\\n window->native_window = native_window;\\n\\n window->surface = s_egl.eglCreateWindowSurface(\\n\\n m_eglDisplay, m_eglConfig, window->native_window, nullptr);\\n\\n if (window->surface == EGL_NO_SURFACE) {\\n\\n delete window;\\n\\n m_lock.unlock();\\n\\n return nullptr;\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/graphics/emugl/Renderer.cpp\",\n \"rank\": 71,\n \"score\": 136792.78377713138\n },\n {\n \"content\": \"struct private_module_t HAL_MODULE_INFO_SYM = {\\n\\n base: {\\n\\n common: {\\n\\n tag: HARDWARE_MODULE_TAG,\\n\\n module_api_version: GRALLOC_MODULE_API_VERSION_0_2,\\n\\n hal_api_version: 0,\\n\\n id: GRALLOC_HARDWARE_MODULE_ID,\\n\\n name: \\\"Graphics Memory Allocator Module\\\",\\n\\n author: \\\"The Android Open Source Project\\\",\\n\\n methods: &gralloc_module_methods,\\n\\n dso: NULL,\\n\\n reserved: {0, }\\n\\n },\\n\\n registerBuffer: gralloc_register_buffer,\\n\\n unregisterBuffer: gralloc_unregister_buffer,\\n\\n lock: gralloc_lock,\\n\\n unlock: gralloc_unlock,\\n\\n perform: NULL,\\n\\n lock_ycbcr: gralloc_lock_ycbcr,\\n\\n }\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/gralloc/gralloc.cpp\",\n \"rank\": 72,\n \"score\": 136606.49344355502\n },\n {\n \"content\": \" class WorkerThread : public Thread {\\n\\n\\n\\n /****************************************************************************\\n\\n * Public API\\n\\n ***************************************************************************/\\n\\n\\n\\n public:\\n\\n inline explicit WorkerThread(EmulatedCameraDevice* camera_dev)\\n\\n : Thread(true), // Callbacks may involve Java calls.\\n\\n mCameraDevice(camera_dev),\\n\\n mThreadControl(-1),\\n\\n mControlFD(-1)\\n\\n {\\n\\n }\\n\\n\\n\\n inline ~WorkerThread()\\n\\n {\\n\\n ALOGW_IF(mThreadControl >= 0 || mControlFD >= 0,\\n\\n \\\"%s: Control FDs are opened in the destructor\\\",\\n\\n __FUNCTION__);\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraDevice.h\",\n \"rank\": 73,\n \"score\": 135497.34025889696\n },\n {\n \"content\": \" // 3A management thread (auto-exposure, focus, white balance)\\n\\n class ControlThread: public Thread {\\n\\n public:\\n\\n ControlThread(EmulatedFakeCamera2 *parent);\\n\\n ~ControlThread();\\n\\n\\n\\n status_t readyToRun();\\n\\n\\n\\n status_t waitUntilRunning();\\n\\n\\n\\n // Interpret request's control parameters and override\\n\\n // capture settings as needed\\n\\n status_t processRequest(camera_metadata_t *request);\\n\\n\\n\\n status_t triggerAction(uint32_t msgType,\\n\\n int32_t ext1, int32_t ext2);\\n\\n private:\\n\\n ControlThread(const ControlThread &t);\\n\\n ControlThread& operator=(const ControlThread &t);\\n\\n\\n\\n // Constants controlling fake 3A behavior\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera2.h\",\n \"rank\": 74,\n \"score\": 135497.34025889696\n },\n {\n \"content\": \" class ConfigureThread: public Thread {\\n\\n public:\\n\\n ConfigureThread(EmulatedFakeCamera2 *parent);\\n\\n ~ConfigureThread();\\n\\n\\n\\n status_t waitUntilRunning();\\n\\n status_t newRequestAvailable();\\n\\n status_t readyToRun();\\n\\n\\n\\n bool isStreamInUse(uint32_t id);\\n\\n int getInProgressCount();\\n\\n private:\\n\\n EmulatedFakeCamera2 *mParent;\\n\\n static const nsecs_t kWaitPerLoop = 10000000L; // 10 ms\\n\\n\\n\\n bool mRunning;\\n\\n bool threadLoop();\\n\\n\\n\\n bool setupCapture();\\n\\n bool setupReprocess();\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera2.h\",\n \"rank\": 75,\n \"score\": 135497.34025889696\n },\n {\n \"content\": \"class IPlatformService : public IInterface {\\n\\npublic:\\n\\n DECLARE_META_INTERFACE(PlatformService);\\n\\n\\n\\n enum {\\n\\n // Keep this synchronized with frameworks/base/services/java/com/android/server/wm/AnboxPlatformServiceProxy.java\\n\\n BOOT_FINISHED = IBinder::FIRST_CALL_TRANSACTION,\\n\\n UPDATE_WINDOW_STATE = IBinder::FIRST_CALL_TRANSACTION + 1,\\n\\n UPDATE_APPLICATION_LIST = IBinder::FIRST_CALL_TRANSACTION + 2,\\n\\n SET_CLIPBOARD_DATA = IBinder::FIRST_CALL_TRANSACTION + 3,\\n\\n GET_CLIPBOARD_DATA = IBinder::FIRST_CALL_TRANSACTION + 4,\\n\\n };\\n\\n\\n\\n virtual status_t boot_finished() = 0;\\n\\n virtual status_t update_window_state(const Parcel &data) = 0;\\n\\n virtual status_t update_application_list(const Parcel &data) = 0;\\n\\n virtual status_t set_clipboard_data(const Parcel &data) = 0;\\n\\n virtual status_t get_clipboard_data(const Parcel &data, Parcel *reply) = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/service/platform_service_interface.h\",\n \"rank\": 76,\n \"score\": 135497.34025889696\n },\n {\n \"content\": \"class IActivityManager : public IInterface {\\n\\npublic:\\n\\n DECLARE_META_INTERFACE(ActivityManager);\\n\\n\\n\\n enum {\\n\\n // This needs to stay synchronized with frameworks/base/core/java/android/app/IActivityManager.java\\n\\n SET_FOCUSED_TASK = IBinder::FIRST_CALL_TRANSACTION + 130,\\n\\n REMOVE_TASK = IBinder::FIRST_CALL_TRANSACTION + 131,\\n\\n RESIZE_TASK = IBinder::FIRST_CALL_TRANSACTION + 285,\\n\\n };\\n\\n\\n\\n virtual status_t setFocusedTask(int32_t id) = 0;\\n\\n virtual status_t removeTask(int32_t id) = 0;\\n\\n virtual status_t resizeTask(int32_t id, const anbox::graphics::Rect &rect, int resize_mode) = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/service/activity_manager_interface.h\",\n \"rank\": 77,\n \"score\": 135497.34025889696\n },\n {\n \"content\": \"class CameraQemuClient : public QemuClient {\\n\\npublic:\\n\\n /* Constructs CameraQemuClient instance. */\\n\\n CameraQemuClient();\\n\\n\\n\\n /* Destructs CameraQemuClient instance. */\\n\\n ~CameraQemuClient();\\n\\n\\n\\n /****************************************************************************\\n\\n * Public API\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Queries camera connection.\\n\\n * Return:\\n\\n * NO_ERROR on success, or an appropriate error status on failure.\\n\\n */\\n\\n status_t queryConnect();\\n\\n\\n\\n /* Queries camera disconnection.\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/QemuClient.h\",\n \"rank\": 78,\n \"score\": 134330.6907576609\n },\n {\n \"content\": \"class PlatformService : public BnPlatformService {\\n\\npublic:\\n\\n static const char* service_name() { return \\\"org.anbox.PlatformService\\\"; }\\n\\n\\n\\n PlatformService(const std::shared_ptr<anbox::PlatformApiStub> &platform_api_stub);\\n\\n\\n\\n status_t boot_finished() override;\\n\\n status_t update_window_state(const Parcel &data) override;\\n\\n status_t update_application_list(const Parcel &data) override;\\n\\n status_t set_clipboard_data(const Parcel &data) override;\\n\\n status_t get_clipboard_data(const Parcel &data, Parcel *reply) override;\\n\\n\\n\\nprivate:\\n\\n anbox::PlatformApiStub::WindowStateUpdate::Window unpack_window_state(const Parcel &data);\\n\\n std::shared_ptr<anbox::PlatformApiStub> platform_api_stub_;\\n\\n};\\n\\n} // namespace android\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/service/platform_service.h\",\n \"rank\": 79,\n \"score\": 134330.6907576609\n },\n {\n \"content\": \"class FactoryQemuClient : public QemuClient {\\n\\npublic:\\n\\n /* Constructs FactoryQemuClient instance. */\\n\\n FactoryQemuClient();\\n\\n\\n\\n /* Destructs FactoryQemuClient instance. */\\n\\n ~FactoryQemuClient();\\n\\n\\n\\n /****************************************************************************\\n\\n * Public API\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Lists camera devices connected to the host.\\n\\n * Param:\\n\\n * list - Upon success contains a list of cameras connected to the host. The\\n\\n * list returned here is represented as a string, containing multiple\\n\\n * lines separated with '\\\\n', where each line represents a camera. Each\\n\\n * camera line is formatted as such:\\n\\n *\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/QemuClient.h\",\n \"rank\": 80,\n \"score\": 134330.6907576609\n },\n {\n \"content\": \"struct Features {\\n\\n bool a = false;\\n\\n bool b = false;\\n\\n bool c = false;\\n\\n};\\n\\n\\n\\nDECLARE_SETTER(Features, a)\\n\\nDECLARE_SETTER(Features, b)\\n\\nDECLARE_SETTER(Features, c)\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/cpu_features/test/linux_features_aggregator_test.cc\",\n \"rank\": 81,\n \"score\": 134160.6940581074\n },\n {\n \"content\": \"class EmulatedFakeCamera2 : public EmulatedCamera2 {\\n\\npublic:\\n\\n /* Constructs EmulatedFakeCamera instance. */\\n\\n EmulatedFakeCamera2(int cameraId, bool facingBack, struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedFakeCamera instance. */\\n\\n ~EmulatedFakeCamera2();\\n\\n\\n\\n /****************************************************************************\\n\\n * EmulatedCamera2 virtual overrides.\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Initializes EmulatedFakeCamera2 instance. */\\n\\n status_t Initialize();\\n\\n\\n\\n /****************************************************************************\\n\\n * Camera Module API and generic hardware device API implementation\\n\\n ***************************************************************************/\\n\\npublic:\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera2.h\",\n \"rank\": 82,\n \"score\": 133189.26535392334\n },\n {\n \"content\": \"class EmulatedQemuCamera2 : public EmulatedCamera2 {\\n\\npublic:\\n\\n /* Constructs EmulatedFakeCamera instance. */\\n\\n EmulatedQemuCamera2(int cameraId, bool facingBack, struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedFakeCamera instance. */\\n\\n ~EmulatedQemuCamera2();\\n\\n\\n\\n /****************************************************************************\\n\\n * EmulatedCamera2 virtual overrides.\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Initializes EmulatedQemuCamera2 instance. */\\n\\n status_t Initialize();\\n\\n\\n\\n /****************************************************************************\\n\\n * EmulatedCamera abstract API implementation.\\n\\n ***************************************************************************/\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedQemuCamera2.h\",\n \"rank\": 83,\n \"score\": 133189.26535392334\n },\n {\n \"content\": \"class EmulatedQemuCamera : public EmulatedCamera {\\n\\npublic:\\n\\n /* Constructs EmulatedQemuCamera instance. */\\n\\n EmulatedQemuCamera(int cameraId, struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedQemuCamera instance. */\\n\\n ~EmulatedQemuCamera();\\n\\n\\n\\n /***************************************************************************\\n\\n * EmulatedCamera virtual overrides.\\n\\n **************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Initializes EmulatedQemuCamera instance. */\\n\\n status_t Initialize(const char* device_name,\\n\\n const char* frame_dims,\\n\\n const char* facing_dir);\\n\\n\\n\\n /***************************************************************************\\n\\n * EmulatedCamera abstract API implementation.\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedQemuCamera.h\",\n \"rank\": 84,\n \"score\": 133189.26535392334\n },\n {\n \"content\": \"class EmulatedFakeCamera : public EmulatedCamera {\\n\\npublic:\\n\\n /* Constructs EmulatedFakeCamera instance. */\\n\\n EmulatedFakeCamera(int cameraId, bool facingBack, struct hw_module_t* module);\\n\\n\\n\\n /* Destructs EmulatedFakeCamera instance. */\\n\\n ~EmulatedFakeCamera();\\n\\n\\n\\n /****************************************************************************\\n\\n * EmulatedCamera virtual overrides.\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Initializes EmulatedFakeCamera instance. */\\n\\n status_t Initialize();\\n\\n\\n\\n /****************************************************************************\\n\\n * EmulatedCamera abstract API implementation.\\n\\n ***************************************************************************/\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera.h\",\n \"rank\": 85,\n \"score\": 133189.26535392334\n },\n {\n \"content\": \"class EmulatedFakeCamera3 : public EmulatedCamera3,\\n\\n private Sensor::SensorListener {\\n\\npublic:\\n\\n\\n\\n EmulatedFakeCamera3(int cameraId, bool facingBack,\\n\\n struct hw_module_t* module);\\n\\n\\n\\n virtual ~EmulatedFakeCamera3();\\n\\n\\n\\n /****************************************************************************\\n\\n * EmulatedCamera3 virtual overrides\\n\\n ***************************************************************************/\\n\\n\\n\\npublic:\\n\\n\\n\\n virtual status_t Initialize();\\n\\n\\n\\n /****************************************************************************\\n\\n * Camera module API and generic hardware device API implementation\\n\\n ***************************************************************************/\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCamera3.h\",\n \"rank\": 86,\n \"score\": 133189.26535392334\n },\n {\n \"content\": \"class EmulatedCameraHotplugThread : public Thread {\\n\\n public:\\n\\n EmulatedCameraHotplugThread(const int* cameraIdArray, size_t size);\\n\\n ~EmulatedCameraHotplugThread();\\n\\n\\n\\n virtual void requestExit();\\n\\n virtual status_t requestExitAndWait();\\n\\n\\n\\n private:\\n\\n\\n\\n\\n\\n virtual status_t readyToRun();\\n\\n virtual bool threadLoop();\\n\\n\\n\\n struct SubscriberInfo {\\n\\n int CameraID;\\n\\n int WatchID;\\n\\n };\\n\\n\\n\\n bool addWatch(int cameraId);\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraHotplugThread.h\",\n \"rank\": 87,\n \"score\": 132072.21884410054\n },\n {\n \"content\": \"class Window : public std::enable_shared_from_this<Window>, public wm::Window {\\n\\n public:\\n\\n typedef std::int32_t Id;\\n\\n static Id Invalid;\\n\\n\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/platform/sdl/window.h\",\n \"rank\": 88,\n \"score\": 131499.99304664764\n },\n {\n \"content\": \"class MessageProcessor : public rpc::MessageProcessor {\\n\\npublic:\\n\\n MessageProcessor(const std::shared_ptr<network::MessageSender> &sender,\\n\\n const std::shared_ptr<rpc::PendingCallCache> &pending_calls,\\n\\n const std::shared_ptr<AndroidApiSkeleton> &platform_api);\\n\\n ~MessageProcessor();\\n\\n\\n\\n void dispatch(rpc::Invocation const& invocation) override;\\n\\n void process_event_sequence(const std::string &event) override;\\n\\n\\n\\nprivate:\\n\\n std::shared_ptr<AndroidApiSkeleton> platform_api_;\\n\\n};\\n\\n} // namespace network\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/service/message_processor.h\",\n \"rank\": 89,\n \"score\": 131131.45035466045\n },\n {\n \"content\": \"class TcpStream : public SocketStream {\\n\\npublic:\\n\\n explicit TcpStream(size_t bufsize = 10000);\\n\\n virtual int listen(unsigned short port);\\n\\n virtual SocketStream *accept();\\n\\n virtual int connect(unsigned short port);\\n\\n int connect(const char* hostname, unsigned short port);\\n\\nprivate:\\n\\n TcpStream(int sock, size_t bufSize);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/shared/OpenglCodecCommon/TcpStream.h\",\n \"rank\": 90,\n \"score\": 130978.74464878492\n },\n {\n \"content\": \"class AndroidApiStub : public anbox::application::Manager {\\n\\n public:\\n\\n AndroidApiStub();\\n\\n ~AndroidApiStub();\\n\\n\\n\\n void set_rpc_channel(const std::shared_ptr<rpc::Channel> &channel);\\n\\n void reset_rpc_channel();\\n\\n\\n\\n void set_focused_task(const std::int32_t &id);\\n\\n void remove_task(const std::int32_t &id);\\n\\n void resize_task(const std::int32_t &id, const anbox::graphics::Rect &rect,\\n\\n const std::int32_t &resize_mode);\\n\\n\\n\\n void launch(const android::Intent &intent,\\n\\n const graphics::Rect &launch_bounds = graphics::Rect::Invalid,\\n\\n const wm::Stack::Id &stack = wm::Stack::Id::Default) override;\\n\\n\\n\\n core::Property<bool>& ready() override;\\n\\n\\n\\n private:\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/src/anbox/bridge/android_api_stub.h\",\n \"rank\": 91,\n \"score\": 130734.100405643\n },\n {\n \"content\": \"class PodVector : public PodVectorBase {\\n\\npublic:\\n\\n // Default constructor for an empty PodVector<T>\\n\\n PodVector() : PodVectorBase() {}\\n\\n\\n\\n // Copy constructor. This copies all items from |other| into\\n\\n // the new instance with ::memmove().\\n\\n PodVector(const PodVector& other) : PodVectorBase(other) {}\\n\\n\\n\\n // Assignment operator.\\n\\n PodVector& operator=(const PodVector& other) {\\n\\n this->assignFrom(other);\\n\\n return *this;\\n\\n }\\n\\n\\n\\n // Destructor, this simply releases the internal storage block that\\n\\n // holds all the items, but doesn't touch them otherwise.\\n\\n ~PodVector() {}\\n\\n\\n\\n // Return true iff the PodVector<T> instance is empty, i.e. does not\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/pod_vector.h\",\n \"rank\": 92,\n \"score\": 129908.07257721908\n },\n {\n \"content\": \"class EmulatedFakeCameraDevice : public EmulatedCameraDevice {\\n\\npublic:\\n\\n /* Constructs EmulatedFakeCameraDevice instance. */\\n\\n explicit EmulatedFakeCameraDevice(EmulatedFakeCamera* camera_hal);\\n\\n\\n\\n /* Destructs EmulatedFakeCameraDevice instance. */\\n\\n ~EmulatedFakeCameraDevice();\\n\\n\\n\\n /***************************************************************************\\n\\n * Emulated camera device abstract interface implementation.\\n\\n * See declarations of these methods in EmulatedCameraDevice class for\\n\\n * information on each of these methods.\\n\\n **************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Connects to the camera device.\\n\\n * Since there is no real device to connect to, this method does nothing,\\n\\n * but changes the state.\\n\\n */\\n\\n status_t connectDevice();\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedFakeCameraDevice.h\",\n \"rank\": 93,\n \"score\": 129908.07257721908\n },\n {\n \"content\": \"class MessageChannel : public MessageChannelBase {\\n\\npublic:\\n\\n MessageChannel() : MessageChannelBase(CAPACITY) {}\\n\\n\\n\\n void send(const T& msg) {\\n\\n size_t pos = beforeWrite();\\n\\n mItems[pos] = msg;\\n\\n afterWrite();\\n\\n }\\n\\n\\n\\n void receive(T* msg) {\\n\\n size_t pos = beforeRead();\\n\\n *msg = mItems[pos];\\n\\n afterRead();\\n\\n }\\n\\n\\n\\nprivate:\\n\\n T mItems[CAPACITY];\\n\\n};\\n\\n\\n\\n} // namespace emugl\\n\\n\\n\\n#endif // EMUGL_COMMON_MESSAGE_CHANNEL_H\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/external/android-emugl/shared/emugl/common/message_channel.h\",\n \"rank\": 94,\n \"score\": 129908.07257721908\n },\n {\n \"content\": \"class GL2Encoder : public gl2_encoder_context_t {\\n\\npublic:\\n\\n GL2Encoder(IOStream *stream, ChecksumCalculator* protocol);\\n\\n virtual ~GL2Encoder();\\n\\n void setClientState(GLClientState *state) {\\n\\n m_state = state;\\n\\n }\\n\\n void setSharedGroup(GLSharedGroupPtr shared){ m_shared = shared; }\\n\\n const GLClientState *state() { return m_state; }\\n\\n const GLSharedGroupPtr shared() { return m_shared; }\\n\\n void flush() { m_stream->flush(); }\\n\\n\\n\\n void setInitialized(){ m_initialized = true; };\\n\\n bool isInitialized(){ return m_initialized; };\\n\\n\\n\\n virtual void setError(GLenum error){ m_error = error; };\\n\\n virtual GLenum getError() { return m_error; };\\n\\n\\n\\n void override2DTextureTarget(GLenum target);\\n\\n void restore2DTextureTarget();\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/GLESv2_enc/GL2Encoder.h\",\n \"rank\": 95,\n \"score\": 129908.07257721908\n },\n {\n \"content\": \"class EmulatedQemuCameraDevice : public EmulatedCameraDevice {\\n\\npublic:\\n\\n /* Constructs EmulatedQemuCameraDevice instance. */\\n\\n explicit EmulatedQemuCameraDevice(EmulatedQemuCamera* camera_hal);\\n\\n\\n\\n /* Destructs EmulatedQemuCameraDevice instance. */\\n\\n ~EmulatedQemuCameraDevice();\\n\\n\\n\\n /***************************************************************************\\n\\n * Public API\\n\\n **************************************************************************/\\n\\n\\n\\npublic:\\n\\n /* Initializes EmulatedQemuCameraDevice instance.\\n\\n * Param:\\n\\n * device_name - Name of the camera device connected to the host. The name\\n\\n * that is used here must have been reported by the 'factory' camera\\n\\n * service when it listed camera devices connected to the host.\\n\\n * Return:\\n\\n * NO_ERROR on success, or an appropriate error status.\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedQemuCameraDevice.h\",\n \"rank\": 96,\n \"score\": 129908.07257721908\n },\n {\n \"content\": \"class GLEncoder : public gl_encoder_context_t {\\n\\n\\n\\npublic:\\n\\n GLEncoder(IOStream *stream, ChecksumCalculator* protocol);\\n\\n virtual ~GLEncoder();\\n\\n void setClientState(GLClientState *state) {\\n\\n m_state = state;\\n\\n }\\n\\n void setSharedGroup(GLSharedGroupPtr shared) { m_shared = shared; }\\n\\n void flush() { m_stream->flush(); }\\n\\n size_t pixelDataSize(GLsizei width, GLsizei height, GLenum format, GLenum type, int pack);\\n\\n\\n\\n void setInitialized(){ m_initialized = true; };\\n\\n bool isInitialized(){ return m_initialized; };\\n\\n\\n\\n virtual void setError(GLenum error){ m_error = error; };\\n\\n virtual GLenum getError() { return m_error; };\\n\\n\\n\\n void override2DTextureTarget(GLenum target);\\n\\n void restore2DTextureTarget();\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/opengl/system/GLESv1_enc/GLEncoder.h\",\n \"rank\": 97,\n \"score\": 129908.07257721908\n },\n {\n \"content\": \"struct hw_module_methods_t EmulatedCameraFactory::mCameraModuleMethods = {\\n\\n open: EmulatedCameraFactory::device_open\\n\\n};\\n\\n\\n\\n}; /* namespace android */\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/camera/EmulatedCameraFactory.cpp\",\n \"rank\": 98,\n \"score\": 128955.11722247464\n },\n {\n \"content\": \"class LocalSocketConnection : public network::MessageSender {\\n\\npublic:\\n\\n LocalSocketConnection(const std::string &path);\\n\\n ~LocalSocketConnection();\\n\\n\\n\\n ssize_t read_all(std::uint8_t *buffer, const size_t &size);\\n\\n void send(char const* data, size_t length) override;\\n\\n ssize_t send_raw(char const* data, size_t length) override;\\n\\n\\n\\nprivate:\\n\\n Fd fd_;\\n\\n};\\n\\n} // namespace anbox\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/type3_AndroidCloud/anbox-master/android/service/local_socket_connection.h\",\n \"rank\": 99,\n \"score\": 128872.97844110007\n }\n]","isConversational":false}}},{"rowIdx":82,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"gmsh/Mesh/meshGRegionCarveHole.cpp"},"repo_name":{"kind":"string","value":"Poofee/fastFEM"},"commit":{"kind":"string","value":"14eb626df973e2123604041451912c867ab7188c"},"file_code":{"kind":"string","value":"\n\n#include <set>\n#include \"GmshConfig.h\"\n#include \"GmshMessage.h\"\n#include \"GModel.h\"\n#include \"MTriangle.h\"\n#include \"MQuadrangle.h\"\n#include \"MTetrahedron.h\"\n#include \"MHexahedron.h\"\n#include \"MPrism.h\"\n#include \"MPyramid.h\"\n\n#if !defined(HAVE_ANN)\n\nvoid carveHole(GRegion *gr, int num, double distance,\n std::vector<int> &surfaces)\n{\n Msg::Error(\"Gmsh must be compiled with ANN support to carve holes in meshes\");\n}\n\n#else\n\n#include \"ANN/ANN.h\"\n\ntemplate <class T>\nvoid carveHole(std::vector<T *> &elements, double distance, ANNkd_tree *kdtree)\n{\n \n \n ANNidxArray index = new ANNidx[1];\n ANNdistArray dist = new ANNdist[1];\n std::vector<T *> temp;\n for(std::size_t i = 0; i < elements.size(); i++) {\n for(std::size_t j = 0; j < elements[i]->getNumVertices(); j++) {\n MVertex *v = elements[i]->getVertex(j);\n double xyz[3] = {v->x(), v->y(), v->z()};\n kdtree->annkSearch(xyz, 1, index, dist);\n double d = std::sqrt(dist[0]);\n if(d < distance) {\n delete elements[i];\n break;\n }\n else if(j == elements[i]->getNumVertices() - 1) {\n temp.push_back(elements[i]);\n }\n }\n }\n elements = temp;\n delete[] index;\n delete[] dist;\n}\n\ntemplate <class T>\nvoid addFaces(std::vector<T *> &elements, std::set<MFace, Less_Face> &faces)\n{\n for(std::size_t i = 0; i < elements.size(); i++) {\n for(int j = 0; j < elements[i]->getNumFaces(); j++) {\n MFace f = elements[i]->getFace(j);\n std::set<MFace, Less_Face>::iterator it = faces.find(f);\n if(it == faces.end())\n faces.insert(f);\n else\n faces.erase(it);\n }\n }\n}\n\nvoid carveHole(GRegion *gr, int num, double distance,\n std::vector<int> &surfaces)\n{\n Msg::Info(\"Carving hole %d from surface %d at distance %g\", num, surfaces[0],\n distance);\n GModel *m = gr->model();\n\n \n int numnodes = 0;\n for(std::size_t i = 0; i < surfaces.size(); i++) {\n GFace *gf = m->getFaceByTag(surfaces[i]);\n if(!gf) {\n Msg::Error(\"Unknown carving surface %d\", surfaces[i]);\n return;\n }\n numnodes += gf->mesh_vertices.size();\n }\n\n ANNpointArray kdnodes = annAllocPts(numnodes, 3);\n int k = 0;\n for(std::size_t i = 0; i < surfaces.size(); i++) {\n GFace *gf = m->getFaceByTag(surfaces[i]);\n for(std::size_t j = 0; j < gf->mesh_vertices.size(); j++) {\n kdnodes[k][0] = gf->mesh_vertices[j]->x();\n kdnodes[k][1] = gf->mesh_vertices[j]->y();\n kdnodes[k][2] = gf->mesh_vertices[j]->z();\n k++;\n }\n }\n ANNkd_tree *kdtree = new ANNkd_tree(kdnodes, numnodes, 3);\n\n \n \n carveHole(gr->tetrahedra, distance, kdtree);\n carveHole(gr->hexahedra, distance, kdtree);\n carveHole(gr->prisms, distance, kdtree);\n carveHole(gr->pyramids, distance, kdtree);\n\n delete kdtree;\n annDeallocPts(kdnodes);\n\n \n \n \n\n \n GFace *gf = m->getFaceByTag(num);\n if(!gf) return;\n std::set<MFace, Less_Face> faces;\n std::vector<GFace *> f = gr->faces();\n for(std::vector<GFace *>::iterator it = f.begin(); it != f.end(); it++) {\n addFaces((*it)->triangles, faces);\n addFaces((*it)->quadrangles, faces);\n }\n addFaces(gr->tetrahedra, faces);\n addFaces(gr->hexahedra, faces);\n addFaces(gr->prisms, faces);\n addFaces(gr->pyramids, faces);\n\n std::set<MVertex *> verts;\n for(std::set<MFace, Less_Face>::iterator it = faces.begin();\n it != faces.end(); it++) {\n for(std::size_t i = 0; i < it->getNumVertices(); i++) {\n it->getVertex(i)->setEntity(gf);\n verts.insert(it->getVertex(i));\n }\n if(it->getNumVertices() == 3)\n gf->triangles.push_back(\n new MTriangle(it->getVertex(0), it->getVertex(1), it->getVertex(2)));\n else if(it->getNumVertices() == 4)\n gf->quadrangles.push_back(\n new MQuadrangle(it->getVertex(0), it->getVertex(1), it->getVertex(2),\n it->getVertex(3)));\n }\n}\n\n#endif\n"},"prefix":{"kind":"string","value":"\n\n#include <set>\n#include \"GmshConfig.h\"\n#include \"GmshMessage.h\"\n#include \"GModel.h\"\n#include \"MTriangle.h\"\n#include \"MQuadrangle.h\"\n#include \"MTetrahedron.h\"\n#include \"MHexahedron.h\"\n#include \"MPrism.h\"\n#include \"MPyramid.h\"\n\n#if !defined(HAVE_ANN)\n\nvoid carveHole(GRegion *gr, int num, double distance,\n std::vector<int> &surfaces)\n{\n Msg::Error(\"Gmsh must be compiled with ANN support to carve holes in meshes\");\n}\n\n#else\n\n#include \"ANN/ANN.h\"\n\ntemplate <class T>\nvoid carveHole(std::vector<T *> &elements, double distance, ANNkd_tree *kdtree)\n{\n \n \n ANNidxArray index = new ANNidx[1];\n ANNdistArray dist = new ANNdist[1];\n std::vector<T *> temp;\n for(std::size_t i = 0; i < elements.size(); i++) {\n for(std::size_t j = 0; j < elements[i]->getNumVertices(); j++) {\n MVertex *v = elements[i]->getVertex(j);\n double xyz[3] = {v->x(), v->y(), v->z()};\n kdtree->annkSearch(xyz, 1, index, dist);\n double d = std::sqrt(dist[0]);\n if(d < distance) {\n delete elements[i];\n break;\n }\n else if(j == elements[i]->getNumVertices() - 1) {\n temp.push_back(elements[i]);\n }\n }\n }\n elements = temp;\n delete[] index;\n delete[] dist;\n}\n\ntemplate <class T>\nvoid addFaces(std::vector<T *> &elements, std::set<MFace, Less_Face> &faces)\n{\n for(std::size_t i = 0; i < elements.size(); i++) {\n for(int j = 0; j < elements[i]->getNumFaces(); j++) {\n MFace f = elements[i]->getFace(j);\n std::set<MFace, Less_Face>::iterator it = faces.find(f);\n if(it == faces.end())\n faces.insert(f);\n else\n faces.erase(it);\n }\n }\n}\n\nvoid carveHole(GRegion *gr, int num, double distance,\n std::vector<int> &surfaces)\n{\n Msg::Info(\"Carving hole %d from surface %d at distance %g\", num, surfaces[0],\n distance);\n GModel *m = gr->model();\n\n \n int numnodes = 0;\n for(std::size_t i = 0; i < surfaces.size(); i++) {\n GFace *gf = m->getFaceByTag(surfaces[i]);\n if(!gf) {\n Msg::Error(\"Unknown carving surface %d\", surfaces[i]);\n return;\n }\n numnodes += gf->mesh_vertices.size();\n }\n\n ANNpointArray kdnodes = annAllocPts(numnodes, 3);\n int k = 0;\n for(std::size_t i = 0; i < surfaces.size(); i++) {\n GFace *gf = m->getFaceByTag(surfaces[i]);\n for(std::size_t j = 0; j < gf->mesh_vertices.size(); j++) {\n kdnodes[k][0] = gf->mesh_vertices[j]->x();\n kdnodes[k][1] = gf->mesh_vertices[j]->y();\n kdnodes[k][2] = gf->mesh_vertices[j]->z();\n k++;\n }\n }\n ANNkd_tree *kdtree = new ANNkd_tree(kdnodes, numnodes, 3);\n\n \n \n carveHole(gr->tetrahedra, distance, kdtree);\n carveHole(gr->hexahedra, distance, kdtree);\n carveHole(gr->prisms, distance, kdtree);\n carveHole(gr->pyramids, distance, kdtree);\n\n delete kdtree;\n annDeallocPts(kdnodes);\n\n \n \n \n\n \n GFace *gf = m->getFaceByTag(num);\n if(!gf) return;\n std::set<MFace, Less_Face> faces;\n std::vector<GFace *> f = gr->faces();\n for(std::vector<GFace *>::iterator it = f.begin(); it != f.end(); it++) {\n addFaces((*it)->triangles, faces);\n addFaces((*it)->quadrangles, faces);\n }\n addFaces(gr->tetrahedra, faces);\n addFaces(gr->hexahedra, faces);\n addFaces(gr->prisms, faces);\n addFaces(gr->pyramids, faces);\n\n std::set<MVertex *> verts;\n for(std::set<MFace, Less_Face>::iterator it = faces.begin();\n it != faces.end(); it++) {\n for(std::size_t i = 0; i < it->getNumVertices(); i++) {\n it->getVertex(i)->setEntity(gf);\n verts.insert(it->getVertex(i));\n }\n if(it->getNumVertices() == 3)\n gf->triangles.push_back(\n new MTriangle(it->getVertex(0), it->getVertex(1), it->getVertex(2)));\n else if(it->getNumVertices() == 4)\n "},"suffix":{"kind":"string","value":";\n }\n}\n\n#endif\n"},"middle":{"kind":"string","value":"gf->quadrangles.push_back(\n new MQuadrangle(it->getVertex(0), it->getVertex(1), it->getVertex(2),\n it->getVertex(3)))"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshGFace.h","rank":0,"score":346488.86100550985},{"content":"class GFace;\n\n\n\nvoid meshGFaceBamg(GFace *gf);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGFaceBamg.h","rank":1,"score":339593.6655204776},{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshGFaceBDS.h","rank":2,"score":339593.6655204776},{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshGFaceOptimize.h","rank":3,"score":339593.6655204776},{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshGFaceDelaunayInsertion.h","rank":4,"score":333057.75710543484},{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":5,"score":330223.9255007503},{"content":"class GFace;\n","file_path":"gmsh/Mesh/BackgroundMesh.h","rank":6,"score":322092.85319761274},{"content":"class GModel;\n","file_path":"gmsh/Mesh/meshGFaceDelaunayInsertion.h","rank":7,"score":316276.3569890859},{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshGRegionDelaunayInsertion.h","rank":8,"score":316271.2959253823},{"content":"class GFace;\n","file_path":"gmsh/Mesh/BDS.h","rank":9,"score":315334.40213265514},{"content":"class MVertex;\n\n\n","file_path":"gmsh/Mesh/meshGFace.h","rank":10,"score":314097.3220717434},{"content":"class GFace;\n","file_path":"gmsh/Mesh/BackgroundMeshTools.h","rank":11,"score":314093.948605755},{"content":"class GFace;\n","file_path":"gmsh/Mesh/meshRelocateVertex.h","rank":12,"score":314093.948605755},{"content":"// Create the mesh of the face\n\nclass meshGFace {\n\n const bool repairSelfIntersecting1dMesh;\n\n bool onlyInitialMesh;\n\n\n\npublic:\n\n meshGFace(bool r = true)\n\n : repairSelfIntersecting1dMesh(r), onlyInitialMesh(false)\n\n {\n\n }\n\n void operator()(GFace *, bool print = true);\n\n void setOnlyInitial() { onlyInitialMesh = true; }\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGFace.h","rank":13,"score":307438.2047187082},{"content":"class MVertex;\n","file_path":"gmsh/Mesh/meshGFaceBDS.h","rank":14,"score":306624.8866591958},{"content":"class MVertex;\n\n\n","file_path":"gmsh/Mesh/meshGFaceOptimize.h","rank":15,"score":306624.8866591958},{"content":"class GFace;\n\ntypedef struct CDList DListRecord, *DListPeek;\n\ntypedef int PointNumero;\n\n\n\ntypedef struct {\n\n double v;\n\n double h;\n\n} DPoint;\n\n\n","file_path":"gmsh/Mesh/DivideAndConquer.h","rank":16,"score":306315.97676165076},{"content":"// Orient the mesh of a face to match the orientation of the underlying\n\n// geometry. This is necessary for 3 different reasons:\n\n// 1) some surface mesh algorithms do not respect the original geometrical\n\n// orientation\n\n// 2) some volume algorithms need to change the surface mesh orientation\n\n// 3) users can choose to reverse the natural orientation\n\nclass orientMeshGFace {\n\npublic:\n\n void operator()(GFace *);\n\n};\n\n\n\nvoid fourthPoint(double *p1, double *p2, double *p3, double *p4);\n\nvoid findTransfiniteCorners(GFace *gf, std::vector<MVertex *> &corners);\n\nint MeshTransfiniteSurface(GFace *gf);\n\nint MeshExtrudedSurface(\n\n GFace *gf, std::set<std::pair<MVertex *, MVertex *> > *constrainedEdges = 0);\n\nbool meshGenerator(GFace *gf, int RECUR_ITER, bool repairSelfIntersecting1dMesh,\n\n bool onlyInitialMesh, bool debug = true,\n\n std::vector<GEdge *> *replacement_edges = 0);\n\nbool pointInsideParametricDomain(std::vector<SPoint2> &bnd, SPoint2 &p,\n\n SPoint2 &out, int &N);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGFace.h","rank":17,"score":301165.8028725458},{"content":"// Destroy the mesh of the face\n\nclass deMeshGFace {\n\npublic:\n\n deMeshGFace() {}\n\n void operator()(GFace *);\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGFace.h","rank":18,"score":301159.9356482198},{"content":"class GEdge;\n","file_path":"gmsh/Mesh/meshGFace.h","rank":19,"score":290030.1888060803},{"content":"class GVertex;\n","file_path":"gmsh/Mesh/meshGFaceOptimize.h","rank":20,"score":282845.17095400626},{"content":"class GModel;\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":21,"score":275399.0953660632},{"content":"class BDS_Mesh;\n","file_path":"gmsh/Mesh/meshGFaceBDS.h","rank":22,"score":274451.4845618835},{"content":"class BDS_Mesh;\n","file_path":"gmsh/Mesh/meshGFaceDelaunayInsertion.h","rank":23,"score":267711.7314374723},{"content":"class MElement;\n","file_path":"gmsh/Geo/GFace.h","rank":24,"score":266650.92835004925},{"content":"class BDS_Point;\n\n\n\nvoid refineMeshBDS(\n\n GFace *gf, BDS_Mesh &m, const int NIT, const bool computeNodalSizeField,\n\n std::map<MVertex *, BDS_Point *> *recoverMapInv = 0,\n\n std::map<BDS_Point *, MVertex *, PointLessThan> *recoverMap = 0,\n\n std::vector<SPoint2> *true_boundary = 0);\n\nvoid optimizeMeshBDS(\n\n GFace *gf, BDS_Mesh &m, const int NIT,\n\n std::map<BDS_Point *, MVertex *, PointLessThan> *recoverMap = 0);\n\nvoid delaunayizeBDS(GFace *gf, BDS_Mesh &m, int &nb_swap);\n\nBDS_Mesh *gmsh2BDS(std::list<GFace *> &l);\n\ndouble computeEdgeLinearLength(BDS_Point *p1, BDS_Point *p2);\n\nvoid smoothVertexPass(GFace *gf, BDS_Mesh &m, int &nb_smooth, bool q);\n\nvoid modifyInitialMeshToRemoveDegeneracies(\n\n GFace *gf, BDS_Mesh &m,\n\n std::map<BDS_Point *, MVertex *, PointLessThan> *recoverMap);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGFaceBDS.h","rank":25,"score":266427.7764985375},{"content":"class GFace;\n","file_path":"gmsh/Geo/GEntity.h","rank":26,"score":265629.70710705436},{"content":"class GModel;\n","file_path":"gmsh/Mesh/meshGRegionDelaunayInsertion.h","rank":27,"score":265210.32494222187},{"content":"class GModel;\n","file_path":"gmsh/Mesh/meshPartition.h","rank":28,"score":265170.0688724885},{"content":"class GOrientedTransfiniteFace {\n\nprivate:\n\n GFace *_gf;\n\n int _ll, _hh;\n\n int _permutation, _index;\n\n std::vector<MVertex *> _list;\n\n\n\npublic:\n\n GOrientedTransfiniteFace()\n\n : _gf(0), _ll(0), _hh(0), _permutation(-1), _index(-1)\n\n {\n\n }\n\n GOrientedTransfiniteFace(GFace *gf, std::vector<MVertex *> &corners)\n\n : _gf(gf), _ll(0), _hh(0), _permutation(-1), _index(-1)\n\n {\n\n _ll = gf->transfinite_vertices.size() - 1;\n\n if(_ll <= 0) return;\n\n _hh = gf->transfinite_vertices[0].size() - 1;\n\n if(_hh <= 0) return;\n\n Msg::Debug(\"Face %d: L = %d H = %d\", gf->tag(), _ll, _hh);\n","file_path":"gmsh/Mesh/meshGRegionTransfinite.cpp","rank":29,"score":263652.24469477625},{"content":"class MTri3 {\n\nprotected:\n\n bool deleted;\n\n double circum_radius;\n\n MTriangle *base;\n\n MTri3 *neigh[3];\n\n\n\npublic:\n\n /// 2 is euclidian norm, -1 is infinite norm , 3 quality\n\n static int radiusNorm;\n\n bool isDeleted() const { return deleted; }\n\n void forceRadius(double r) { circum_radius = r; }\n\n inline double getRadius() const { return circum_radius; }\n\n inline MVertex *otherSide(int i)\n\n {\n\n MTri3 *n = neigh[i];\n\n if(!n) return 0;\n\n MVertex *v1 = base->getVertex((i + 2) % 3);\n\n MVertex *v2 = base->getVertex(i);\n\n for(int j = 0; j < 3; j++)\n","file_path":"gmsh/Mesh/meshGFaceDelaunayInsertion.h","rank":30,"score":259430.384029572},{"content":"class BDS_Point;\n\n\n","file_path":"gmsh/Mesh/meshGFaceDelaunayInsertion.h","rank":31,"score":259430.384029572},{"content":"class MVertex;\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":32,"score":259267.43087335269},{"content":" class face {\n\n public:\n\n shellface *sh;\n\n int shver; // Range from 0 to 5.\n\n face() : sh(0), shver(0) {}\n\n face &operator=(const face &s)\n\n {\n\n sh = s.sh;\n\n shver = s.shver;\n\n return *this;\n\n }\n\n };\n\n\n\n ///////////////////////////////////////////////////////////////////////////////\n\n // //\n\n // Arraypool //\n\n // //\n\n // A dynamic linear array. (It is written by J. Shewchuk) //\n\n // //\n\n // Each arraypool contains an array of pointers to a number of blocks. Each\n","file_path":"gmsh/Mesh/tetgenBR.h","rank":33,"score":256642.4065518275},{"content":"class GModel;\n","file_path":"gmsh/Mesh/Generator.h","rank":34,"score":256146.72828208006},{"content":"class blyr_mvertex {\n\npublic:\n\n MVertex *_v;\n\n // all triangles connected to that vertex\n\n\n\n mutable std::vector<MTriangle *> _triangles;\n\n mutable std::vector<SVector3> _normals;\n\n mutable std::vector<GFace *> _gfaces;\n\n\n\n // all mesh edges connected to that vertex\n\n\n\n mutable std::vector<MLine *> _lines;\n\n mutable std::vector<GEdge *> _gedges;\n\n\n\n // one extruded vertex per face ...\n\n mutable std::vector<MVertex *> _v_per_face;\n\n mutable std::vector<SVector3> _n_per_vertex;\n\n mutable std::vector<GFace *> _f_per_normal;\n\n\n\n // ridge points\n","file_path":"gmsh/Mesh/meshGRegionBoundaryLayer.cpp","rank":35,"score":253027.09590297163},{"content":"class compareTri3Ptr {\n\n Less_Face lf;\n\n\n\npublic:\n\n inline bool operator()(const MTri3 *a, const MTri3 *b) const\n\n {\n\n if(a->getRadius() > b->getRadius()) return true;\n\n if(a->getRadius() < b->getRadius()) return false;\n\n return lf(a->tri()->getFace(0), b->tri()->getFace(0));\n\n }\n\n};\n\n\n\nvoid connectTriangles(std::list<MTri3 *> &);\n\nvoid connectTriangles(std::vector<MTri3 *> &);\n\nvoid connectTriangles(std::set<MTri3 *, compareTri3Ptr> &AllTris);\n\nvoid bowyerWatson(GFace *gf, int MAXPNT = 1000000000,\n\n std::map<MVertex *, MVertex *> *equivalence = 0,\n\n std::map<MVertex *, SPoint2> *parametricCoordinates = 0);\n\nvoid bowyerWatsonFrontal(\n\n GFace *gf, std::map<MVertex *, MVertex *> *equivalence = 0,\n","file_path":"gmsh/Mesh/meshGFaceDelaunayInsertion.h","rank":36,"score":252863.1943766731},{"content":"// A model face.\n\nclass GFace : public GEntity {\n\nprotected:\n\n // edge loops might replace what follows (list of all the edges of\n\n // the face + directions)\n\n std::vector<GEdge *> l_edges;\n\n std::vector<int> l_dirs;\n\n GRegion *r1, *r2;\n\n mean_plane meanPlane;\n\n std::vector<GEdge *> embedded_edges;\n\n std::set<GVertex *, GEntityLessThan> embedded_vertices;\n\n\n\n BoundaryLayerColumns _columns;\n\n\n\npublic: // this will become protected or private\n\n std::list<GEdgeLoop> edgeLoops;\n\n\n\n // periodic counterparts of edges\n\n std::map<GEdge *, std::pair<GEdge *, int> > edgeCounterparts;\n\n\n\n // specify mesh master with transformation, deduce edgeCounterparts\n","file_path":"gmsh/Geo/GFace.h","rank":37,"score":250560.0055550107},{"content":"class quadMeshRemoveHalfOfOneDMesh {\n\nprivate:\n\n GFace *_gf;\n\n std::map<GEdge *, std::vector<MLine *> > _backup;\n\n std::map<MEdge, MVertex *, Less_Edge> _middle;\n\n void _subdivide()\n\n {\n\n std::vector<MQuadrangle *> qnew;\n\n std::map<MEdge, MVertex *, Less_Edge> eds;\n\n for(std::size_t i = 0; i < _gf->triangles.size(); i++) {\n\n MVertex *v[3];\n\n SPoint2 m[3];\n\n for(int j = 0; j < 3; j++) {\n\n MEdge E = _gf->triangles[i]->getEdge(j);\n\n SPoint2 p1, p2;\n\n reparamMeshEdgeOnFace(E.getVertex(0), E.getVertex(1), _gf, p1, p2);\n\n std::map<MEdge, MVertex *, Less_Edge>::iterator it = _middle.find(E);\n\n std::map<MEdge, MVertex *, Less_Edge>::iterator it2 = eds.find(E);\n\n m[j] = p1;\n\n if(it == _middle.end() && it2 == eds.end()) {\n","file_path":"gmsh/Mesh/meshGFace.cpp","rank":38,"score":250066.7263744296},{"content":"class GModel;\n","file_path":"gmsh/Geo/MElement.h","rank":39,"score":249921.88071959498},{"content":"class GFace;\n","file_path":"gmsh/Geo/MVertex.h","rank":40,"score":249854.50374284724},{"content":"class GModel;\n\nvoid createTopologyFromMeshNew(GModel *gm);\n\n\n\n#endif\n","file_path":"gmsh/Geo/GModelCreateTopologyFromMesh.h","rank":41,"score":248561.38419055354},{"content":"// two dimensional elements\n\nclass surface_t: public element_t {\n\npublic:\n\n surface_t();\n\n ~surface_t();\n\n\n\n void setEdges(int);\n\n int getEdges() const;\n\n void setEdgeIndex(int, int);\n\n int getEdgeIndex(int) const;\n\n void newEdgeIndexes(int);\n\n void deleteEdgeIndexes();\n\n void setElements(int);\n\n int getElements() const;\n\n void setElementIndex(int, int);\n\n int getElementIndex(int) const;\n\n void newElementIndexes(int);\n\n void deleteElementIndexes();\n\n void setNormalVec(double*);\n\n double* getNormalVec();\n\n double getNormal(int) const;\n","file_path":"fastFEM/mesh/meshtype.h","rank":42,"score":246821.76907981306},{"content":"class initMeshGFace {\n\nprivate:\n\n bool _curved;\n\n int _estimateNumLines(GFace *f)\n\n {\n\n int num = 0;\n\n if(CTX::instance()->mesh.surfacesEdges) {\n\n num += (3 * f->triangles.size() + 4 * f->quadrangles.size() +\n\n 4 * f->polygons.size()) /\n\n 2;\n\n if(CTX::instance()->mesh.explode != 1.) num *= 2;\n\n if(_curved) num *= 2;\n\n }\n\n return num + 100;\n\n }\n\n int _estimateNumTriangles(GFace *f)\n\n {\n\n int num = 0;\n\n if(CTX::instance()->mesh.surfacesFaces) {\n\n num += (f->triangles.size() + 2 * f->quadrangles.size() +\n","file_path":"gmsh/Geo/GModelVertexArrays.cpp","rank":43,"score":246685.12188794036},{"content":"class GModel;\n\n\n","file_path":"gmsh/Geo/MElementCut.h","rank":44,"score":243646.63548332098},{"content":"class GModel;\n","file_path":"gmsh/Geo/MElementOctree.h","rank":45,"score":243646.63548332098},{"content":"class GFace;\n","file_path":"gmsh/Geo/boundaryLayersData.h","rank":46,"score":243581.5550264926},{"content":"class surfaceFunctorGFace : public surfaceFunctor {\n\n const GFace *gf;\n\n\n\npublic:\n\n surfaceFunctorGFace(const GFace *_gf) : gf(_gf) {}\n\n virtual SPoint3 operator()(double u, double v) const\n\n {\n\n GPoint gp = gf->point(u, v);\n\n if(!gp.succeeded()) throw gf;\n\n return SPoint3(gp.x(), gp.y(), gp.z());\n\n }\n\n};\n\n\n","file_path":"gmsh/Geo/intersectCurveSurface.h","rank":47,"score":238952.9188601577},{"content":"// Create the mesh of the region\n\nclass meshGRegion {\n\npublic:\n\n std::vector<GRegion *> &delaunay;\n\n meshGRegion(std::vector<GRegion *> &d) : delaunay(d) {}\n\n void operator()(GRegion *);\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":48,"score":237995.08139139807},{"content":"class topoFace {\n\nprotected:\n\n MElement *parent;\n\n int faceIndex;\n\n std::set<int> vtcs;\n\n\n\npublic:\n\n const std::set<int> &getVertices() const { return vtcs; }\n\n\n\n const MElement *getParent() const { return parent; }\n\n const int getIndex() const { return faceIndex; }\n\n const int getType() const\n\n {\n\n switch(vtcs.size()) {\n\n case 3: return TYPE_TRI; break;\n\n case 4: return TYPE_QUA; break;\n\n default: return vtcs.size() > 4 ? TYPE_POLYG : -1; break;\n\n }\n\n }\n\n\n","file_path":"gmsh/Geo/GModelCreateTopologyFromMesh.cpp","rank":49,"score":236033.90149349143},{"content":"class GEdge;\n\n\n","file_path":"gmsh/Mesh/meshGEdge.h","rank":50,"score":235200.29760768963},{"content":"class GRegion;\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":51,"score":235200.29760768963},{"content":"class GEdge;\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":52,"score":235200.29760768963},{"content":"#if defined(HAVE_ACIS)\n\n#include <face.hxx>\n\n#include <surface.hxx>\n\nclass ACISFace : public GFace {\n\nprotected:\n\n FACE *_f;\n\n double umin, umax, vmin, vmax;\n\n bool _periodic[2];\n\n\n\npublic:\n\n ACISFace(GModel *m, FACE *f, int num);\n\n virtual ~ACISFace() {}\n\n virtual bool periodic(int dir) const { return _periodic[dir]; }\n\n virtual double period(int dir) const;\n\n Range<double> parBounds(int i) const;\n\n virtual GPoint point(double par1, double par2) const;\n\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\n\n const double initialGuess[2]) const;\n\n virtual bool containsPoint(const SPoint3 &pt) const;\n\n virtual SVector3 normal(const SPoint2 ¶m) const;\n\n virtual Pair<SVector3, SVector3> firstDer(const SPoint2 ¶m) const;\n\n virtual void secondDer(const SPoint2 &, SVector3 *, SVector3 *,\n\n SVector3 *) const;\n","file_path":"gmsh/Geo/ACISFace.h","rank":53,"score":233996.69509404406},{"content":"class discreteFace : public GFace {\n\nprivate:\n\n bool _checkAndFixOrientation();\n\n#if defined(HAVE_HXT)\n\n int _currentParametrization;\n\n std::vector<hxt_reparam_surf> _parametrizations;\n\n HXTStatus _reparametrizeThroughHxt();\n\n bool _computeTopologyOfPartition(int nbColors, int *colors, int *nNodes,\n\n int *nodes, double *uv,\n\n std::vector<MVertex *> &c2v,\n\n std::vector<std::vector<MEdge> > &boundaries);\n\n#endif\n\npublic:\n\n discreteFace(GModel *model, int num);\n\n virtual ~discreteFace() {}\n\n using GFace::point;\n\n GPoint point(double par1, double par2) const;\n\n SPoint2 parFromPoint(const SPoint3 &p, bool onSurface = true) const;\n\n GPoint closestPoint(const SPoint3 &queryPoint, double maxDistance,\n\n SVector3 *normal = nullptr) const;\n","file_path":"gmsh/Geo/discreteFace.h","rank":54,"score":233974.73221060526},{"content":"class xyFace : public GFace {\n\npublic:\n\n xyFace(GModel *gm, int t, xyEdge *e) : GFace(gm, t) { l_edges.push_back(e); }\n\n virtual ~xyFace() {}\n\n Range<double> parBounds(int i) const { return Range<double>(0, 1); }\n\n virtual GPoint point(double par1, double par2) const\n\n {\n\n double pp[2] = {par1, par2};\n\n return GPoint(par1, par2, 0.0, this, pp);\n\n }\n\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\n\n const double initialGuess[2]) const\n\n {\n\n double u[2] = {queryPoint.x(), queryPoint.y()};\n\n return GPoint(queryPoint.x(), queryPoint.y(), 0.0, this, u);\n\n }\n\n virtual bool containsPoint(const SPoint3 &pt) const { return true; }\n\n virtual SVector3 normal(const SPoint2 ¶m) const\n\n {\n\n SVector3 n(0, 0, 1);\n","file_path":"gmsh/Geo/xyFace.h","rank":55,"score":233974.73221060526},{"content":"class OCCFace : public GFace {\n\nprotected:\n\n TopoDS_Face s;\n\n Handle(Geom_Surface) occface;\n\n double umin, umax, vmin, vmax;\n\n bool _periodic[2];\n\n double _period[2];\n\n bool buildSTLTriangulation(bool force = false);\n\n void setup();\n\n double _radius;\n\n SPoint3 _center;\n\n\n\npublic:\n\n OCCFace(GModel *m, TopoDS_Face s, int num);\n\n virtual ~OCCFace();\n\n virtual SBoundingBox3d bounds(bool fast = false) const;\n\n Range<double> parBounds(int i) const;\n\n virtual GPoint point(double par1, double par2) const;\n\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\n\n const double initialGuess[2]) const;\n","file_path":"gmsh/Geo/OCCFace.h","rank":56,"score":233974.73221060526},{"content":"class gmshFace : public GFace {\n\nprotected:\n\n Surface *s;\n\n bool buildSTLTriangulation(bool force);\n\n\n\npublic:\n\n gmshFace(GModel *m, Surface *face);\n\n virtual ~gmshFace() {}\n\n Range<double> parBounds(int i) const;\n\n void setModelEdges(std::list<GEdge *> &);\n\n using GFace::point;\n\n virtual GPoint point(double par1, double par2) const;\n\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\n\n const double initialGuess[2]) const;\n\n virtual bool containsPoint(const SPoint3 &pt) const;\n\n virtual double getMetricEigenvalue(const SPoint2 &);\n\n virtual SVector3 normal(const SPoint2 ¶m) const;\n\n virtual Pair<SVector3, SVector3> firstDer(const SPoint2 ¶m) const;\n\n virtual void secondDer(const SPoint2 &, SVector3 &, SVector3 &,\n\n SVector3 &) const;\n","file_path":"gmsh/Geo/gmshFace.h","rank":57,"score":233974.73221060526},{"content":"// adapt the mesh of a region\n\nclass adaptMeshGRegion {\n\npublic:\n\n void operator()(GRegion *);\n\n};\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":58,"score":233300.14915926164},{"content":"// destroy the mesh of the region\n\nclass deMeshGRegion {\n\npublic:\n\n void operator()(GRegion *);\n\n};\n\n\n\nvoid MeshDelaunayVolume(std::vector<GRegion *> &delaunay);\n\nbool CreateAnEmptyVolumeMesh(GRegion *gr);\n\nint MeshTransfiniteVolume(GRegion *gr);\n\nint SubdivideExtrudedMesh(GModel *m);\n\nvoid carveHole(GRegion *gr, int num, double distance,\n\n std::vector<int> &surfaces);\n\n\n\ntypedef std::map<MFace, GFace *, Less_Face> fs_cont;\n\ntypedef std::multimap<MVertex *, std::pair<MLine *, GEdge *> > es_cont;\n\nGFace *findInFaceSearchStructure(MVertex *p1, MVertex *p2, MVertex *p3,\n\n const fs_cont &search);\n\nGFace *findInFaceSearchStructure(const MFace &f, const fs_cont &search);\n\nGEdge *findInEdgeSearchStructure(MVertex *p1, MVertex *p2,\n\n const es_cont &search);\n\nbool buildFaceSearchStructure(GModel *model, fs_cont &search, bool onlyTriangles = false);\n\nbool buildEdgeSearchStructure(GModel *model, es_cont &search);\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":59,"score":233300.14915926164},{"content":"// Optimize the mesh of the region using gmsh's algo\n\nclass optimizeMeshGRegion {\n\npublic:\n\n void operator()(GRegion *, bool always = false);\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":60,"score":233299.9004076693},{"content":"class meshGRegionExtruded {\n\npublic:\n\n void operator()(GRegion *);\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":61,"score":233292.87459174855},{"content":"class GRegion;\n\n\n\nvoid meshGRegionNetgen(GRegion *gr);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGRegionNetgen.h","rank":62,"score":229964.09876053903},{"content":"class GRegion;\n\n\n\nint meshGRegionHxt(std::vector<GRegion *> ®ions);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGRegionHxt.h","rank":63,"score":229964.09876053903},{"content":"class GRegion;\n\n\n\nvoid refineMeshMMG(GRegion *gr);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshGRegionMMG3D.h","rank":64,"score":229964.09876053903},{"content":"// Optimize the mesh of the region using netgen's algo\n\nclass optimizeMeshGRegionNetgen {\n\npublic:\n\n void operator()(GRegion *, bool always = false);\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":65,"score":228839.31231270704},{"content":"class MElement;\n","file_path":"gmsh/Mesh/filterElements.h","rank":73,"score":225653.67683480692},{"content":"class MElement;\n","file_path":"gmsh/Mesh/BackgroundMesh.h","rank":74,"score":225505.94690023124},{"content":"class MElement;\n\n\n\nint PartitionMesh(GModel *const model);\n\nint UnpartitionMesh(GModel *const model);\n\nint ConvertOldPartitioningToNewOne(GModel *const model);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshPartition.h","rank":75,"score":225505.94690023124},{"content":"class GRegion;\n\n\n","file_path":"gmsh/Geo/GFace.h","rank":76,"score":225435.9704123844},{"content":"class GRegion;\n","file_path":"gmsh/Mesh/meshGRegionBoundaryRecovery.h","rank":77,"score":225011.52718384826},{"content":"//#define GMSH_PRE_ALLOCATE_STRATEGY 1\n\nclass GRegion;\n","file_path":"gmsh/Mesh/meshGRegionDelaunayInsertion.h","rank":78,"score":225011.52718384826},{"content":"class GEdge;\n","file_path":"gmsh/Mesh/BackgroundMesh.h","rank":79,"score":224971.27111411493},{"content":"class MElementOctree;\n","file_path":"gmsh/Mesh/meshMetric.h","rank":80,"score":219585.29216434408},{"content":"class MElementOctree;\n","file_path":"gmsh/Mesh/BackgroundMesh.h","rank":81,"score":219585.29216434408},{"content":"class MElement;\n\n\n\nvoid RelocateVertices(GRegion *region, int niter, double tol = 1.e-2);\n\nvoid RelocateVertices(std::vector<GRegion *> ®ions, int niter,\n\n double tol = 1.e-2);\n\nvoid RelocateVertices(GFace *, int niter, double tol = 1.e-6);\n\nvoid RelocateVerticesOfPyramids(GRegion *region, int niter, double tol= 1.e-2);\n\nvoid RelocateVerticesOfPyramids(std::vector<GRegion *> ®ions, int niter, double tol= 1.e-2);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/meshRelocateVertex.h","rank":82,"score":219585.29216434408},{"content":"class GVertex;\n","file_path":"gmsh/Mesh/BackgroundMeshTools.h","rank":83,"score":219070.3207126944},{"content":"class GEdge;\n","file_path":"gmsh/Mesh/BackgroundMeshTools.h","rank":84,"score":219070.3207126944},{"content":"class GRegion;\n","file_path":"gmsh/Mesh/meshRelocateVertex.h","rank":85,"score":219070.3207126944},{"content":"class GEntity;\n\n\n\nSMetric3 buildMetricTangentToCurve(SVector3 &t, double l_t, double l_n);\n\nSMetric3 buildMetricTangentToSurface(SVector3 &t1, SVector3 &t2, double l_t1,\n\n double l_t2, double l_n);\n\ndouble BGM_MeshSize(GEntity *ge, double U, double V, double X, double Y,\n\n double Z);\n\nSMetric3 BGM_MeshMetric(GEntity *ge, double U, double V, double X, double Y,\n\n double Z);\n\nbool Extend1dMeshIn2dSurfaces();\n\nbool Extend2dMeshIn3dVolumes();\n\nSMetric3 max_edge_curvature_metric(const GVertex *gv);\n\nSMetric3 max_edge_curvature_metric(const GEdge *ge, double u, double &l);\n\nSMetric3 metric_based_on_surface_curvature(const GFace *gf, double u, double v,\n\n bool surface_isotropic = false,\n\n double d_normal = 1.e12,\n\n double d_tangent_max = 1.e12);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/BackgroundMeshTools.h","rank":86,"score":219070.3207126944},{"content":"class MTriangle;\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":87,"score":219070.3207126944},{"content":"class MLine;\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":88,"score":219070.3207126944},{"content":"class Surface;\n\n\n","file_path":"gmsh/Geo/gmshFace.h","rank":89,"score":217102.1799953591},{"content":"class DistanceField;\n\n\n","file_path":"gmsh/Mesh/Field.h","rank":90,"score":216630.20642494725},{"content":"// base element class\n\nclass element_t {\n\npublic:\n\n element_t();\n\n ~element_t();\n\n\n\n void setNature(int);\n\n int getNature() const;\n\n void setCode(int);\n\n int getCode() const;\n\n void setNodes(int);\n\n int getNodes() const;\n\n void setIndex(int);\n\n int getIndex() const;\n\n void setSelected(int);\n\n int getSelected() const;\n\n int getNodeIndex(int) const;\n\n void setNodeIndex(int, int);\n\n int* getNodeIndexes() const;\n\n void newNodeIndexes(int);\n\n void deleteNodeIndexes();\n\n\n\nprivate:\n\n int nature; // PDE_BULK, ...\n\n int code; // element code for Elmer (504, 808, ...)\n\n int nodes; // number of nodes\n\n int index; // bc/mat index as defined in input file\n\n int selected; // element is selected or not\n\n int* node; // list of nodes\n\n};\n\n\n","file_path":"fastFEM/mesh/meshtype.h","rank":91,"score":216518.50401975823},{"content":"class BDS_Face;\n","file_path":"gmsh/Mesh/BDS.h","rank":92,"score":216439.08336042345},{"content":"class BDS_Face {\n\npublic:\n\n BDS_Face(BDS_Edge *A, BDS_Edge *B, BDS_Edge *C, BDS_Edge *D = 0)\n\n : deleted(false), e1(A), e2(B), e3(C), e4(D), g(0)\n\n {\n\n e1->addface(this);\n\n e2->addface(this);\n\n e3->addface(this);\n\n if(e4) e4->addface(this);\n\n }\n\n\n\n int numEdges() const { return e4 ? 4 : 3; }\n\n BDS_Edge *oppositeEdge(BDS_Point *p)\n\n {\n\n if(e4) {\n\n Msg::Error(\"oppositeEdge to point %d cannot be applied to a quad\", p->iD);\n\n return 0;\n\n }\n\n if(e1->p1 != p && e1->p2 != p) return e1;\n\n if(e2->p1 != p && e2->p2 != p) return e2;\n","file_path":"gmsh/Mesh/BDS.h","rank":93,"score":216439.08336042345},{"content":"class GEdge;\n","file_path":"gmsh/Mesh/BDS.h","rank":94,"score":215947.93052370648},{"content":"class GEntity;\n\n\n\ntypedef enum {\n\n FIELD_OPTION_DOUBLE = 0,\n\n FIELD_OPTION_INT,\n\n FIELD_OPTION_STRING,\n\n FIELD_OPTION_PATH,\n\n FIELD_OPTION_BOOL,\n\n FIELD_OPTION_LIST,\n\n FIELD_OPTION_LIST_DOUBLE\n\n} FieldOptionType;\n\n\n","file_path":"gmsh/Mesh/Field.h","rank":95,"score":215947.93052370648},{"content":"class GVertex;\n\n\n","file_path":"gmsh/Mesh/BDS.h","rank":96,"score":215947.93052370648},{"content":"class GRegion;\n\n\n\nvoid GetStatistics(double stat[50], double quality[4][100] = 0,\n\nbool visibleOnly = false);\n\nvoid AdaptMesh(GModel *m);\n\nvoid GenerateMesh(GModel *m, int dimension);\n\nvoid OptimizeMesh(GModel *m);\n\nvoid OptimizeMeshNetgen(GModel *m);\n\nvoid SmoothMesh(GModel *m);\n\nvoid RefineMesh(GModel *m, bool linear, bool splitIntoQuads = false,\n\n bool splitIntoHexas = false);\n\nvoid BarycentricRefineMesh(GModel *m);\n\nvoid RecombineMesh(GModel *m);\n\n\n\n#endif\n","file_path":"gmsh/Mesh/Generator.h","rank":97,"score":215947.93052370648},{"content":"// hybrid mesh recovery structure\n\nclass splitQuadRecovery {\n\nprivate:\n\n std::map<MFace, MVertex *, Less_Face> _quad;\n\n std::map<MFace, GFace *, Less_Face> _tri;\n\npublic:\n\n splitQuadRecovery() {}\n\n void add(const MFace &f, MVertex *v, GFace *gf);\n\n std::map<MFace, GFace *, Less_Face> &getTri() { return _tri; }\n\n std::map<MFace, MVertex *, Less_Face> &getQuad() { return _quad; }\n\n int buildPyramids(GModel *gm);\n\n};\n\n\n","file_path":"gmsh/Mesh/meshGRegion.h","rank":98,"score":213553.89402107178},{"content":"class MTriangle;\n","file_path":"gmsh/Mesh/filterElements.h","rank":99,"score":209729.07046426926}],"string":"[\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.h\",\n \"rank\": 0,\n \"score\": 346488.86100550985\n },\n {\n \"content\": \"class GFace;\\n\\n\\n\\nvoid meshGFaceBamg(GFace *gf);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceBamg.h\",\n \"rank\": 1,\n \"score\": 339593.6655204776\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceBDS.h\",\n \"rank\": 2,\n \"score\": 339593.6655204776\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceOptimize.h\",\n \"rank\": 3,\n \"score\": 339593.6655204776\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceDelaunayInsertion.h\",\n \"rank\": 4,\n \"score\": 333057.75710543484\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 5,\n \"score\": 330223.9255007503\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMesh.h\",\n \"rank\": 6,\n \"score\": 322092.85319761274\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceDelaunayInsertion.h\",\n \"rank\": 7,\n \"score\": 316276.3569890859\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionDelaunayInsertion.h\",\n \"rank\": 8,\n \"score\": 316271.2959253823\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/BDS.h\",\n \"rank\": 9,\n \"score\": 315334.40213265514\n },\n {\n \"content\": \"class MVertex;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.h\",\n \"rank\": 10,\n \"score\": 314097.3220717434\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMeshTools.h\",\n \"rank\": 11,\n \"score\": 314093.948605755\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Mesh/meshRelocateVertex.h\",\n \"rank\": 12,\n \"score\": 314093.948605755\n },\n {\n \"content\": \"// Create the mesh of the face\\n\\nclass meshGFace {\\n\\n const bool repairSelfIntersecting1dMesh;\\n\\n bool onlyInitialMesh;\\n\\n\\n\\npublic:\\n\\n meshGFace(bool r = true)\\n\\n : repairSelfIntersecting1dMesh(r), onlyInitialMesh(false)\\n\\n {\\n\\n }\\n\\n void operator()(GFace *, bool print = true);\\n\\n void setOnlyInitial() { onlyInitialMesh = true; }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.h\",\n \"rank\": 13,\n \"score\": 307438.2047187082\n },\n {\n \"content\": \"class MVertex;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceBDS.h\",\n \"rank\": 14,\n \"score\": 306624.8866591958\n },\n {\n \"content\": \"class MVertex;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceOptimize.h\",\n \"rank\": 15,\n \"score\": 306624.8866591958\n },\n {\n \"content\": \"class GFace;\\n\\ntypedef struct CDList DListRecord, *DListPeek;\\n\\ntypedef int PointNumero;\\n\\n\\n\\ntypedef struct {\\n\\n double v;\\n\\n double h;\\n\\n} DPoint;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/DivideAndConquer.h\",\n \"rank\": 16,\n \"score\": 306315.97676165076\n },\n {\n \"content\": \"// Orient the mesh of a face to match the orientation of the underlying\\n\\n// geometry. This is necessary for 3 different reasons:\\n\\n// 1) some surface mesh algorithms do not respect the original geometrical\\n\\n// orientation\\n\\n// 2) some volume algorithms need to change the surface mesh orientation\\n\\n// 3) users can choose to reverse the natural orientation\\n\\nclass orientMeshGFace {\\n\\npublic:\\n\\n void operator()(GFace *);\\n\\n};\\n\\n\\n\\nvoid fourthPoint(double *p1, double *p2, double *p3, double *p4);\\n\\nvoid findTransfiniteCorners(GFace *gf, std::vector<MVertex *> &corners);\\n\\nint MeshTransfiniteSurface(GFace *gf);\\n\\nint MeshExtrudedSurface(\\n\\n GFace *gf, std::set<std::pair<MVertex *, MVertex *> > *constrainedEdges = 0);\\n\\nbool meshGenerator(GFace *gf, int RECUR_ITER, bool repairSelfIntersecting1dMesh,\\n\\n bool onlyInitialMesh, bool debug = true,\\n\\n std::vector<GEdge *> *replacement_edges = 0);\\n\\nbool pointInsideParametricDomain(std::vector<SPoint2> &bnd, SPoint2 &p,\\n\\n SPoint2 &out, int &N);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.h\",\n \"rank\": 17,\n \"score\": 301165.8028725458\n },\n {\n \"content\": \"// Destroy the mesh of the face\\n\\nclass deMeshGFace {\\n\\npublic:\\n\\n deMeshGFace() {}\\n\\n void operator()(GFace *);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.h\",\n \"rank\": 18,\n \"score\": 301159.9356482198\n },\n {\n \"content\": \"class GEdge;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.h\",\n \"rank\": 19,\n \"score\": 290030.1888060803\n },\n {\n \"content\": \"class GVertex;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceOptimize.h\",\n \"rank\": 20,\n \"score\": 282845.17095400626\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 21,\n \"score\": 275399.0953660632\n },\n {\n \"content\": \"class BDS_Mesh;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceBDS.h\",\n \"rank\": 22,\n \"score\": 274451.4845618835\n },\n {\n \"content\": \"class BDS_Mesh;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceDelaunayInsertion.h\",\n \"rank\": 23,\n \"score\": 267711.7314374723\n },\n {\n \"content\": \"class MElement;\\n\",\n \"file_path\": \"gmsh/Geo/GFace.h\",\n \"rank\": 24,\n \"score\": 266650.92835004925\n },\n {\n \"content\": \"class BDS_Point;\\n\\n\\n\\nvoid refineMeshBDS(\\n\\n GFace *gf, BDS_Mesh &m, const int NIT, const bool computeNodalSizeField,\\n\\n std::map<MVertex *, BDS_Point *> *recoverMapInv = 0,\\n\\n std::map<BDS_Point *, MVertex *, PointLessThan> *recoverMap = 0,\\n\\n std::vector<SPoint2> *true_boundary = 0);\\n\\nvoid optimizeMeshBDS(\\n\\n GFace *gf, BDS_Mesh &m, const int NIT,\\n\\n std::map<BDS_Point *, MVertex *, PointLessThan> *recoverMap = 0);\\n\\nvoid delaunayizeBDS(GFace *gf, BDS_Mesh &m, int &nb_swap);\\n\\nBDS_Mesh *gmsh2BDS(std::list<GFace *> &l);\\n\\ndouble computeEdgeLinearLength(BDS_Point *p1, BDS_Point *p2);\\n\\nvoid smoothVertexPass(GFace *gf, BDS_Mesh &m, int &nb_smooth, bool q);\\n\\nvoid modifyInitialMeshToRemoveDegeneracies(\\n\\n GFace *gf, BDS_Mesh &m,\\n\\n std::map<BDS_Point *, MVertex *, PointLessThan> *recoverMap);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceBDS.h\",\n \"rank\": 25,\n \"score\": 266427.7764985375\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Geo/GEntity.h\",\n \"rank\": 26,\n \"score\": 265629.70710705436\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionDelaunayInsertion.h\",\n \"rank\": 27,\n \"score\": 265210.32494222187\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Mesh/meshPartition.h\",\n \"rank\": 28,\n \"score\": 265170.0688724885\n },\n {\n \"content\": \"class GOrientedTransfiniteFace {\\n\\nprivate:\\n\\n GFace *_gf;\\n\\n int _ll, _hh;\\n\\n int _permutation, _index;\\n\\n std::vector<MVertex *> _list;\\n\\n\\n\\npublic:\\n\\n GOrientedTransfiniteFace()\\n\\n : _gf(0), _ll(0), _hh(0), _permutation(-1), _index(-1)\\n\\n {\\n\\n }\\n\\n GOrientedTransfiniteFace(GFace *gf, std::vector<MVertex *> &corners)\\n\\n : _gf(gf), _ll(0), _hh(0), _permutation(-1), _index(-1)\\n\\n {\\n\\n _ll = gf->transfinite_vertices.size() - 1;\\n\\n if(_ll <= 0) return;\\n\\n _hh = gf->transfinite_vertices[0].size() - 1;\\n\\n if(_hh <= 0) return;\\n\\n Msg::Debug(\\\"Face %d: L = %d H = %d\\\", gf->tag(), _ll, _hh);\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionTransfinite.cpp\",\n \"rank\": 29,\n \"score\": 263652.24469477625\n },\n {\n \"content\": \"class MTri3 {\\n\\nprotected:\\n\\n bool deleted;\\n\\n double circum_radius;\\n\\n MTriangle *base;\\n\\n MTri3 *neigh[3];\\n\\n\\n\\npublic:\\n\\n /// 2 is euclidian norm, -1 is infinite norm , 3 quality\\n\\n static int radiusNorm;\\n\\n bool isDeleted() const { return deleted; }\\n\\n void forceRadius(double r) { circum_radius = r; }\\n\\n inline double getRadius() const { return circum_radius; }\\n\\n inline MVertex *otherSide(int i)\\n\\n {\\n\\n MTri3 *n = neigh[i];\\n\\n if(!n) return 0;\\n\\n MVertex *v1 = base->getVertex((i + 2) % 3);\\n\\n MVertex *v2 = base->getVertex(i);\\n\\n for(int j = 0; j < 3; j++)\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceDelaunayInsertion.h\",\n \"rank\": 30,\n \"score\": 259430.384029572\n },\n {\n \"content\": \"class BDS_Point;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceDelaunayInsertion.h\",\n \"rank\": 31,\n \"score\": 259430.384029572\n },\n {\n \"content\": \"class MVertex;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 32,\n \"score\": 259267.43087335269\n },\n {\n \"content\": \" class face {\\n\\n public:\\n\\n shellface *sh;\\n\\n int shver; // Range from 0 to 5.\\n\\n face() : sh(0), shver(0) {}\\n\\n face &operator=(const face &s)\\n\\n {\\n\\n sh = s.sh;\\n\\n shver = s.shver;\\n\\n return *this;\\n\\n }\\n\\n };\\n\\n\\n\\n ///////////////////////////////////////////////////////////////////////////////\\n\\n // //\\n\\n // Arraypool //\\n\\n // //\\n\\n // A dynamic linear array. (It is written by J. Shewchuk) //\\n\\n // //\\n\\n // Each arraypool contains an array of pointers to a number of blocks. Each\\n\",\n \"file_path\": \"gmsh/Mesh/tetgenBR.h\",\n \"rank\": 33,\n \"score\": 256642.4065518275\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Mesh/Generator.h\",\n \"rank\": 34,\n \"score\": 256146.72828208006\n },\n {\n \"content\": \"class blyr_mvertex {\\n\\npublic:\\n\\n MVertex *_v;\\n\\n // all triangles connected to that vertex\\n\\n\\n\\n mutable std::vector<MTriangle *> _triangles;\\n\\n mutable std::vector<SVector3> _normals;\\n\\n mutable std::vector<GFace *> _gfaces;\\n\\n\\n\\n // all mesh edges connected to that vertex\\n\\n\\n\\n mutable std::vector<MLine *> _lines;\\n\\n mutable std::vector<GEdge *> _gedges;\\n\\n\\n\\n // one extruded vertex per face ...\\n\\n mutable std::vector<MVertex *> _v_per_face;\\n\\n mutable std::vector<SVector3> _n_per_vertex;\\n\\n mutable std::vector<GFace *> _f_per_normal;\\n\\n\\n\\n // ridge points\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionBoundaryLayer.cpp\",\n \"rank\": 35,\n \"score\": 253027.09590297163\n },\n {\n \"content\": \"class compareTri3Ptr {\\n\\n Less_Face lf;\\n\\n\\n\\npublic:\\n\\n inline bool operator()(const MTri3 *a, const MTri3 *b) const\\n\\n {\\n\\n if(a->getRadius() > b->getRadius()) return true;\\n\\n if(a->getRadius() < b->getRadius()) return false;\\n\\n return lf(a->tri()->getFace(0), b->tri()->getFace(0));\\n\\n }\\n\\n};\\n\\n\\n\\nvoid connectTriangles(std::list<MTri3 *> &);\\n\\nvoid connectTriangles(std::vector<MTri3 *> &);\\n\\nvoid connectTriangles(std::set<MTri3 *, compareTri3Ptr> &AllTris);\\n\\nvoid bowyerWatson(GFace *gf, int MAXPNT = 1000000000,\\n\\n std::map<MVertex *, MVertex *> *equivalence = 0,\\n\\n std::map<MVertex *, SPoint2> *parametricCoordinates = 0);\\n\\nvoid bowyerWatsonFrontal(\\n\\n GFace *gf, std::map<MVertex *, MVertex *> *equivalence = 0,\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFaceDelaunayInsertion.h\",\n \"rank\": 36,\n \"score\": 252863.1943766731\n },\n {\n \"content\": \"// A model face.\\n\\nclass GFace : public GEntity {\\n\\nprotected:\\n\\n // edge loops might replace what follows (list of all the edges of\\n\\n // the face + directions)\\n\\n std::vector<GEdge *> l_edges;\\n\\n std::vector<int> l_dirs;\\n\\n GRegion *r1, *r2;\\n\\n mean_plane meanPlane;\\n\\n std::vector<GEdge *> embedded_edges;\\n\\n std::set<GVertex *, GEntityLessThan> embedded_vertices;\\n\\n\\n\\n BoundaryLayerColumns _columns;\\n\\n\\n\\npublic: // this will become protected or private\\n\\n std::list<GEdgeLoop> edgeLoops;\\n\\n\\n\\n // periodic counterparts of edges\\n\\n std::map<GEdge *, std::pair<GEdge *, int> > edgeCounterparts;\\n\\n\\n\\n // specify mesh master with transformation, deduce edgeCounterparts\\n\",\n \"file_path\": \"gmsh/Geo/GFace.h\",\n \"rank\": 37,\n \"score\": 250560.0055550107\n },\n {\n \"content\": \"class quadMeshRemoveHalfOfOneDMesh {\\n\\nprivate:\\n\\n GFace *_gf;\\n\\n std::map<GEdge *, std::vector<MLine *> > _backup;\\n\\n std::map<MEdge, MVertex *, Less_Edge> _middle;\\n\\n void _subdivide()\\n\\n {\\n\\n std::vector<MQuadrangle *> qnew;\\n\\n std::map<MEdge, MVertex *, Less_Edge> eds;\\n\\n for(std::size_t i = 0; i < _gf->triangles.size(); i++) {\\n\\n MVertex *v[3];\\n\\n SPoint2 m[3];\\n\\n for(int j = 0; j < 3; j++) {\\n\\n MEdge E = _gf->triangles[i]->getEdge(j);\\n\\n SPoint2 p1, p2;\\n\\n reparamMeshEdgeOnFace(E.getVertex(0), E.getVertex(1), _gf, p1, p2);\\n\\n std::map<MEdge, MVertex *, Less_Edge>::iterator it = _middle.find(E);\\n\\n std::map<MEdge, MVertex *, Less_Edge>::iterator it2 = eds.find(E);\\n\\n m[j] = p1;\\n\\n if(it == _middle.end() && it2 == eds.end()) {\\n\",\n \"file_path\": \"gmsh/Mesh/meshGFace.cpp\",\n \"rank\": 38,\n \"score\": 250066.7263744296\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Geo/MElement.h\",\n \"rank\": 39,\n \"score\": 249921.88071959498\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Geo/MVertex.h\",\n \"rank\": 40,\n \"score\": 249854.50374284724\n },\n {\n \"content\": \"class GModel;\\n\\nvoid createTopologyFromMeshNew(GModel *gm);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Geo/GModelCreateTopologyFromMesh.h\",\n \"rank\": 41,\n \"score\": 248561.38419055354\n },\n {\n \"content\": \"// two dimensional elements\\n\\nclass surface_t: public element_t {\\n\\npublic:\\n\\n surface_t();\\n\\n ~surface_t();\\n\\n\\n\\n void setEdges(int);\\n\\n int getEdges() const;\\n\\n void setEdgeIndex(int, int);\\n\\n int getEdgeIndex(int) const;\\n\\n void newEdgeIndexes(int);\\n\\n void deleteEdgeIndexes();\\n\\n void setElements(int);\\n\\n int getElements() const;\\n\\n void setElementIndex(int, int);\\n\\n int getElementIndex(int) const;\\n\\n void newElementIndexes(int);\\n\\n void deleteElementIndexes();\\n\\n void setNormalVec(double*);\\n\\n double* getNormalVec();\\n\\n double getNormal(int) const;\\n\",\n \"file_path\": \"fastFEM/mesh/meshtype.h\",\n \"rank\": 42,\n \"score\": 246821.76907981306\n },\n {\n \"content\": \"class initMeshGFace {\\n\\nprivate:\\n\\n bool _curved;\\n\\n int _estimateNumLines(GFace *f)\\n\\n {\\n\\n int num = 0;\\n\\n if(CTX::instance()->mesh.surfacesEdges) {\\n\\n num += (3 * f->triangles.size() + 4 * f->quadrangles.size() +\\n\\n 4 * f->polygons.size()) /\\n\\n 2;\\n\\n if(CTX::instance()->mesh.explode != 1.) num *= 2;\\n\\n if(_curved) num *= 2;\\n\\n }\\n\\n return num + 100;\\n\\n }\\n\\n int _estimateNumTriangles(GFace *f)\\n\\n {\\n\\n int num = 0;\\n\\n if(CTX::instance()->mesh.surfacesFaces) {\\n\\n num += (f->triangles.size() + 2 * f->quadrangles.size() +\\n\",\n \"file_path\": \"gmsh/Geo/GModelVertexArrays.cpp\",\n \"rank\": 43,\n \"score\": 246685.12188794036\n },\n {\n \"content\": \"class GModel;\\n\\n\\n\",\n \"file_path\": \"gmsh/Geo/MElementCut.h\",\n \"rank\": 44,\n \"score\": 243646.63548332098\n },\n {\n \"content\": \"class GModel;\\n\",\n \"file_path\": \"gmsh/Geo/MElementOctree.h\",\n \"rank\": 45,\n \"score\": 243646.63548332098\n },\n {\n \"content\": \"class GFace;\\n\",\n \"file_path\": \"gmsh/Geo/boundaryLayersData.h\",\n \"rank\": 46,\n \"score\": 243581.5550264926\n },\n {\n \"content\": \"class surfaceFunctorGFace : public surfaceFunctor {\\n\\n const GFace *gf;\\n\\n\\n\\npublic:\\n\\n surfaceFunctorGFace(const GFace *_gf) : gf(_gf) {}\\n\\n virtual SPoint3 operator()(double u, double v) const\\n\\n {\\n\\n GPoint gp = gf->point(u, v);\\n\\n if(!gp.succeeded()) throw gf;\\n\\n return SPoint3(gp.x(), gp.y(), gp.z());\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Geo/intersectCurveSurface.h\",\n \"rank\": 47,\n \"score\": 238952.9188601577\n },\n {\n \"content\": \"// Create the mesh of the region\\n\\nclass meshGRegion {\\n\\npublic:\\n\\n std::vector<GRegion *> &delaunay;\\n\\n meshGRegion(std::vector<GRegion *> &d) : delaunay(d) {}\\n\\n void operator()(GRegion *);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 48,\n \"score\": 237995.08139139807\n },\n {\n \"content\": \"class topoFace {\\n\\nprotected:\\n\\n MElement *parent;\\n\\n int faceIndex;\\n\\n std::set<int> vtcs;\\n\\n\\n\\npublic:\\n\\n const std::set<int> &getVertices() const { return vtcs; }\\n\\n\\n\\n const MElement *getParent() const { return parent; }\\n\\n const int getIndex() const { return faceIndex; }\\n\\n const int getType() const\\n\\n {\\n\\n switch(vtcs.size()) {\\n\\n case 3: return TYPE_TRI; break;\\n\\n case 4: return TYPE_QUA; break;\\n\\n default: return vtcs.size() > 4 ? TYPE_POLYG : -1; break;\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"gmsh/Geo/GModelCreateTopologyFromMesh.cpp\",\n \"rank\": 49,\n \"score\": 236033.90149349143\n },\n {\n \"content\": \"class GEdge;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGEdge.h\",\n \"rank\": 50,\n \"score\": 235200.29760768963\n },\n {\n \"content\": \"class GRegion;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 51,\n \"score\": 235200.29760768963\n },\n {\n \"content\": \"class GEdge;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 52,\n \"score\": 235200.29760768963\n },\n {\n \"content\": \"#if defined(HAVE_ACIS)\\n\\n#include <face.hxx>\\n\\n#include <surface.hxx>\\n\\nclass ACISFace : public GFace {\\n\\nprotected:\\n\\n FACE *_f;\\n\\n double umin, umax, vmin, vmax;\\n\\n bool _periodic[2];\\n\\n\\n\\npublic:\\n\\n ACISFace(GModel *m, FACE *f, int num);\\n\\n virtual ~ACISFace() {}\\n\\n virtual bool periodic(int dir) const { return _periodic[dir]; }\\n\\n virtual double period(int dir) const;\\n\\n Range<double> parBounds(int i) const;\\n\\n virtual GPoint point(double par1, double par2) const;\\n\\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\\n\\n const double initialGuess[2]) const;\\n\\n virtual bool containsPoint(const SPoint3 &pt) const;\\n\\n virtual SVector3 normal(const SPoint2 ¶m) const;\\n\\n virtual Pair<SVector3, SVector3> firstDer(const SPoint2 ¶m) const;\\n\\n virtual void secondDer(const SPoint2 &, SVector3 *, SVector3 *,\\n\\n SVector3 *) const;\\n\",\n \"file_path\": \"gmsh/Geo/ACISFace.h\",\n \"rank\": 53,\n \"score\": 233996.69509404406\n },\n {\n \"content\": \"class discreteFace : public GFace {\\n\\nprivate:\\n\\n bool _checkAndFixOrientation();\\n\\n#if defined(HAVE_HXT)\\n\\n int _currentParametrization;\\n\\n std::vector<hxt_reparam_surf> _parametrizations;\\n\\n HXTStatus _reparametrizeThroughHxt();\\n\\n bool _computeTopologyOfPartition(int nbColors, int *colors, int *nNodes,\\n\\n int *nodes, double *uv,\\n\\n std::vector<MVertex *> &c2v,\\n\\n std::vector<std::vector<MEdge> > &boundaries);\\n\\n#endif\\n\\npublic:\\n\\n discreteFace(GModel *model, int num);\\n\\n virtual ~discreteFace() {}\\n\\n using GFace::point;\\n\\n GPoint point(double par1, double par2) const;\\n\\n SPoint2 parFromPoint(const SPoint3 &p, bool onSurface = true) const;\\n\\n GPoint closestPoint(const SPoint3 &queryPoint, double maxDistance,\\n\\n SVector3 *normal = nullptr) const;\\n\",\n \"file_path\": \"gmsh/Geo/discreteFace.h\",\n \"rank\": 54,\n \"score\": 233974.73221060526\n },\n {\n \"content\": \"class xyFace : public GFace {\\n\\npublic:\\n\\n xyFace(GModel *gm, int t, xyEdge *e) : GFace(gm, t) { l_edges.push_back(e); }\\n\\n virtual ~xyFace() {}\\n\\n Range<double> parBounds(int i) const { return Range<double>(0, 1); }\\n\\n virtual GPoint point(double par1, double par2) const\\n\\n {\\n\\n double pp[2] = {par1, par2};\\n\\n return GPoint(par1, par2, 0.0, this, pp);\\n\\n }\\n\\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\\n\\n const double initialGuess[2]) const\\n\\n {\\n\\n double u[2] = {queryPoint.x(), queryPoint.y()};\\n\\n return GPoint(queryPoint.x(), queryPoint.y(), 0.0, this, u);\\n\\n }\\n\\n virtual bool containsPoint(const SPoint3 &pt) const { return true; }\\n\\n virtual SVector3 normal(const SPoint2 ¶m) const\\n\\n {\\n\\n SVector3 n(0, 0, 1);\\n\",\n \"file_path\": \"gmsh/Geo/xyFace.h\",\n \"rank\": 55,\n \"score\": 233974.73221060526\n },\n {\n \"content\": \"class OCCFace : public GFace {\\n\\nprotected:\\n\\n TopoDS_Face s;\\n\\n Handle(Geom_Surface) occface;\\n\\n double umin, umax, vmin, vmax;\\n\\n bool _periodic[2];\\n\\n double _period[2];\\n\\n bool buildSTLTriangulation(bool force = false);\\n\\n void setup();\\n\\n double _radius;\\n\\n SPoint3 _center;\\n\\n\\n\\npublic:\\n\\n OCCFace(GModel *m, TopoDS_Face s, int num);\\n\\n virtual ~OCCFace();\\n\\n virtual SBoundingBox3d bounds(bool fast = false) const;\\n\\n Range<double> parBounds(int i) const;\\n\\n virtual GPoint point(double par1, double par2) const;\\n\\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\\n\\n const double initialGuess[2]) const;\\n\",\n \"file_path\": \"gmsh/Geo/OCCFace.h\",\n \"rank\": 56,\n \"score\": 233974.73221060526\n },\n {\n \"content\": \"class gmshFace : public GFace {\\n\\nprotected:\\n\\n Surface *s;\\n\\n bool buildSTLTriangulation(bool force);\\n\\n\\n\\npublic:\\n\\n gmshFace(GModel *m, Surface *face);\\n\\n virtual ~gmshFace() {}\\n\\n Range<double> parBounds(int i) const;\\n\\n void setModelEdges(std::list<GEdge *> &);\\n\\n using GFace::point;\\n\\n virtual GPoint point(double par1, double par2) const;\\n\\n virtual GPoint closestPoint(const SPoint3 &queryPoint,\\n\\n const double initialGuess[2]) const;\\n\\n virtual bool containsPoint(const SPoint3 &pt) const;\\n\\n virtual double getMetricEigenvalue(const SPoint2 &);\\n\\n virtual SVector3 normal(const SPoint2 ¶m) const;\\n\\n virtual Pair<SVector3, SVector3> firstDer(const SPoint2 ¶m) const;\\n\\n virtual void secondDer(const SPoint2 &, SVector3 &, SVector3 &,\\n\\n SVector3 &) const;\\n\",\n \"file_path\": \"gmsh/Geo/gmshFace.h\",\n \"rank\": 57,\n \"score\": 233974.73221060526\n },\n {\n \"content\": \"// adapt the mesh of a region\\n\\nclass adaptMeshGRegion {\\n\\npublic:\\n\\n void operator()(GRegion *);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 58,\n \"score\": 233300.14915926164\n },\n {\n \"content\": \"// destroy the mesh of the region\\n\\nclass deMeshGRegion {\\n\\npublic:\\n\\n void operator()(GRegion *);\\n\\n};\\n\\n\\n\\nvoid MeshDelaunayVolume(std::vector<GRegion *> &delaunay);\\n\\nbool CreateAnEmptyVolumeMesh(GRegion *gr);\\n\\nint MeshTransfiniteVolume(GRegion *gr);\\n\\nint SubdivideExtrudedMesh(GModel *m);\\n\\nvoid carveHole(GRegion *gr, int num, double distance,\\n\\n std::vector<int> &surfaces);\\n\\n\\n\\ntypedef std::map<MFace, GFace *, Less_Face> fs_cont;\\n\\ntypedef std::multimap<MVertex *, std::pair<MLine *, GEdge *> > es_cont;\\n\\nGFace *findInFaceSearchStructure(MVertex *p1, MVertex *p2, MVertex *p3,\\n\\n const fs_cont &search);\\n\\nGFace *findInFaceSearchStructure(const MFace &f, const fs_cont &search);\\n\\nGEdge *findInEdgeSearchStructure(MVertex *p1, MVertex *p2,\\n\\n const es_cont &search);\\n\\nbool buildFaceSearchStructure(GModel *model, fs_cont &search, bool onlyTriangles = false);\\n\\nbool buildEdgeSearchStructure(GModel *model, es_cont &search);\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 59,\n \"score\": 233300.14915926164\n },\n {\n \"content\": \"// Optimize the mesh of the region using gmsh's algo\\n\\nclass optimizeMeshGRegion {\\n\\npublic:\\n\\n void operator()(GRegion *, bool always = false);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 60,\n \"score\": 233299.9004076693\n },\n {\n \"content\": \"class meshGRegionExtruded {\\n\\npublic:\\n\\n void operator()(GRegion *);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 61,\n \"score\": 233292.87459174855\n },\n {\n \"content\": \"class GRegion;\\n\\n\\n\\nvoid meshGRegionNetgen(GRegion *gr);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionNetgen.h\",\n \"rank\": 62,\n \"score\": 229964.09876053903\n },\n {\n \"content\": \"class GRegion;\\n\\n\\n\\nint meshGRegionHxt(std::vector<GRegion *> ®ions);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionHxt.h\",\n \"rank\": 63,\n \"score\": 229964.09876053903\n },\n {\n \"content\": \"class GRegion;\\n\\n\\n\\nvoid refineMeshMMG(GRegion *gr);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionMMG3D.h\",\n \"rank\": 64,\n \"score\": 229964.09876053903\n },\n {\n \"content\": \"// Optimize the mesh of the region using netgen's algo\\n\\nclass optimizeMeshGRegionNetgen {\\n\\npublic:\\n\\n void operator()(GRegion *, bool always = false);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 65,\n \"score\": 228839.31231270704\n },\n {\n \"content\": \"class MElement;\\n\",\n \"file_path\": \"gmsh/Mesh/filterElements.h\",\n \"rank\": 73,\n \"score\": 225653.67683480692\n },\n {\n \"content\": \"class MElement;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMesh.h\",\n \"rank\": 74,\n \"score\": 225505.94690023124\n },\n {\n \"content\": \"class MElement;\\n\\n\\n\\nint PartitionMesh(GModel *const model);\\n\\nint UnpartitionMesh(GModel *const model);\\n\\nint ConvertOldPartitioningToNewOne(GModel *const model);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshPartition.h\",\n \"rank\": 75,\n \"score\": 225505.94690023124\n },\n {\n \"content\": \"class GRegion;\\n\\n\\n\",\n \"file_path\": \"gmsh/Geo/GFace.h\",\n \"rank\": 76,\n \"score\": 225435.9704123844\n },\n {\n \"content\": \"class GRegion;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionBoundaryRecovery.h\",\n \"rank\": 77,\n \"score\": 225011.52718384826\n },\n {\n \"content\": \"//#define GMSH_PRE_ALLOCATE_STRATEGY 1\\n\\nclass GRegion;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegionDelaunayInsertion.h\",\n \"rank\": 78,\n \"score\": 225011.52718384826\n },\n {\n \"content\": \"class GEdge;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMesh.h\",\n \"rank\": 79,\n \"score\": 224971.27111411493\n },\n {\n \"content\": \"class MElementOctree;\\n\",\n \"file_path\": \"gmsh/Mesh/meshMetric.h\",\n \"rank\": 80,\n \"score\": 219585.29216434408\n },\n {\n \"content\": \"class MElementOctree;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMesh.h\",\n \"rank\": 81,\n \"score\": 219585.29216434408\n },\n {\n \"content\": \"class MElement;\\n\\n\\n\\nvoid RelocateVertices(GRegion *region, int niter, double tol = 1.e-2);\\n\\nvoid RelocateVertices(std::vector<GRegion *> ®ions, int niter,\\n\\n double tol = 1.e-2);\\n\\nvoid RelocateVertices(GFace *, int niter, double tol = 1.e-6);\\n\\nvoid RelocateVerticesOfPyramids(GRegion *region, int niter, double tol= 1.e-2);\\n\\nvoid RelocateVerticesOfPyramids(std::vector<GRegion *> ®ions, int niter, double tol= 1.e-2);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/meshRelocateVertex.h\",\n \"rank\": 82,\n \"score\": 219585.29216434408\n },\n {\n \"content\": \"class GVertex;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMeshTools.h\",\n \"rank\": 83,\n \"score\": 219070.3207126944\n },\n {\n \"content\": \"class GEdge;\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMeshTools.h\",\n \"rank\": 84,\n \"score\": 219070.3207126944\n },\n {\n \"content\": \"class GRegion;\\n\",\n \"file_path\": \"gmsh/Mesh/meshRelocateVertex.h\",\n \"rank\": 85,\n \"score\": 219070.3207126944\n },\n {\n \"content\": \"class GEntity;\\n\\n\\n\\nSMetric3 buildMetricTangentToCurve(SVector3 &t, double l_t, double l_n);\\n\\nSMetric3 buildMetricTangentToSurface(SVector3 &t1, SVector3 &t2, double l_t1,\\n\\n double l_t2, double l_n);\\n\\ndouble BGM_MeshSize(GEntity *ge, double U, double V, double X, double Y,\\n\\n double Z);\\n\\nSMetric3 BGM_MeshMetric(GEntity *ge, double U, double V, double X, double Y,\\n\\n double Z);\\n\\nbool Extend1dMeshIn2dSurfaces();\\n\\nbool Extend2dMeshIn3dVolumes();\\n\\nSMetric3 max_edge_curvature_metric(const GVertex *gv);\\n\\nSMetric3 max_edge_curvature_metric(const GEdge *ge, double u, double &l);\\n\\nSMetric3 metric_based_on_surface_curvature(const GFace *gf, double u, double v,\\n\\n bool surface_isotropic = false,\\n\\n double d_normal = 1.e12,\\n\\n double d_tangent_max = 1.e12);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/BackgroundMeshTools.h\",\n \"rank\": 86,\n \"score\": 219070.3207126944\n },\n {\n \"content\": \"class MTriangle;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 87,\n \"score\": 219070.3207126944\n },\n {\n \"content\": \"class MLine;\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 88,\n \"score\": 219070.3207126944\n },\n {\n \"content\": \"class Surface;\\n\\n\\n\",\n \"file_path\": \"gmsh/Geo/gmshFace.h\",\n \"rank\": 89,\n \"score\": 217102.1799953591\n },\n {\n \"content\": \"class DistanceField;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/Field.h\",\n \"rank\": 90,\n \"score\": 216630.20642494725\n },\n {\n \"content\": \"// base element class\\n\\nclass element_t {\\n\\npublic:\\n\\n element_t();\\n\\n ~element_t();\\n\\n\\n\\n void setNature(int);\\n\\n int getNature() const;\\n\\n void setCode(int);\\n\\n int getCode() const;\\n\\n void setNodes(int);\\n\\n int getNodes() const;\\n\\n void setIndex(int);\\n\\n int getIndex() const;\\n\\n void setSelected(int);\\n\\n int getSelected() const;\\n\\n int getNodeIndex(int) const;\\n\\n void setNodeIndex(int, int);\\n\\n int* getNodeIndexes() const;\\n\\n void newNodeIndexes(int);\\n\\n void deleteNodeIndexes();\\n\\n\\n\\nprivate:\\n\\n int nature; // PDE_BULK, ...\\n\\n int code; // element code for Elmer (504, 808, ...)\\n\\n int nodes; // number of nodes\\n\\n int index; // bc/mat index as defined in input file\\n\\n int selected; // element is selected or not\\n\\n int* node; // list of nodes\\n\\n};\\n\\n\\n\",\n \"file_path\": \"fastFEM/mesh/meshtype.h\",\n \"rank\": 91,\n \"score\": 216518.50401975823\n },\n {\n \"content\": \"class BDS_Face;\\n\",\n \"file_path\": \"gmsh/Mesh/BDS.h\",\n \"rank\": 92,\n \"score\": 216439.08336042345\n },\n {\n \"content\": \"class BDS_Face {\\n\\npublic:\\n\\n BDS_Face(BDS_Edge *A, BDS_Edge *B, BDS_Edge *C, BDS_Edge *D = 0)\\n\\n : deleted(false), e1(A), e2(B), e3(C), e4(D), g(0)\\n\\n {\\n\\n e1->addface(this);\\n\\n e2->addface(this);\\n\\n e3->addface(this);\\n\\n if(e4) e4->addface(this);\\n\\n }\\n\\n\\n\\n int numEdges() const { return e4 ? 4 : 3; }\\n\\n BDS_Edge *oppositeEdge(BDS_Point *p)\\n\\n {\\n\\n if(e4) {\\n\\n Msg::Error(\\\"oppositeEdge to point %d cannot be applied to a quad\\\", p->iD);\\n\\n return 0;\\n\\n }\\n\\n if(e1->p1 != p && e1->p2 != p) return e1;\\n\\n if(e2->p1 != p && e2->p2 != p) return e2;\\n\",\n \"file_path\": \"gmsh/Mesh/BDS.h\",\n \"rank\": 93,\n \"score\": 216439.08336042345\n },\n {\n \"content\": \"class GEdge;\\n\",\n \"file_path\": \"gmsh/Mesh/BDS.h\",\n \"rank\": 94,\n \"score\": 215947.93052370648\n },\n {\n \"content\": \"class GEntity;\\n\\n\\n\\ntypedef enum {\\n\\n FIELD_OPTION_DOUBLE = 0,\\n\\n FIELD_OPTION_INT,\\n\\n FIELD_OPTION_STRING,\\n\\n FIELD_OPTION_PATH,\\n\\n FIELD_OPTION_BOOL,\\n\\n FIELD_OPTION_LIST,\\n\\n FIELD_OPTION_LIST_DOUBLE\\n\\n} FieldOptionType;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/Field.h\",\n \"rank\": 95,\n \"score\": 215947.93052370648\n },\n {\n \"content\": \"class GVertex;\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/BDS.h\",\n \"rank\": 96,\n \"score\": 215947.93052370648\n },\n {\n \"content\": \"class GRegion;\\n\\n\\n\\nvoid GetStatistics(double stat[50], double quality[4][100] = 0,\\n\\nbool visibleOnly = false);\\n\\nvoid AdaptMesh(GModel *m);\\n\\nvoid GenerateMesh(GModel *m, int dimension);\\n\\nvoid OptimizeMesh(GModel *m);\\n\\nvoid OptimizeMeshNetgen(GModel *m);\\n\\nvoid SmoothMesh(GModel *m);\\n\\nvoid RefineMesh(GModel *m, bool linear, bool splitIntoQuads = false,\\n\\n bool splitIntoHexas = false);\\n\\nvoid BarycentricRefineMesh(GModel *m);\\n\\nvoid RecombineMesh(GModel *m);\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"gmsh/Mesh/Generator.h\",\n \"rank\": 97,\n \"score\": 215947.93052370648\n },\n {\n \"content\": \"// hybrid mesh recovery structure\\n\\nclass splitQuadRecovery {\\n\\nprivate:\\n\\n std::map<MFace, MVertex *, Less_Face> _quad;\\n\\n std::map<MFace, GFace *, Less_Face> _tri;\\n\\npublic:\\n\\n splitQuadRecovery() {}\\n\\n void add(const MFace &f, MVertex *v, GFace *gf);\\n\\n std::map<MFace, GFace *, Less_Face> &getTri() { return _tri; }\\n\\n std::map<MFace, MVertex *, Less_Face> &getQuad() { return _quad; }\\n\\n int buildPyramids(GModel *gm);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"gmsh/Mesh/meshGRegion.h\",\n \"rank\": 98,\n \"score\": 213553.89402107178\n },\n {\n \"content\": \"class MTriangle;\\n\",\n \"file_path\": \"gmsh/Mesh/filterElements.h\",\n \"rank\": 99,\n \"score\": 209729.07046426926\n }\n]","isConversational":false}}},{"rowIdx":83,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Clients/OIViewer/ConfigurationLoader.cpp"},"repo_name":{"kind":"string","value":"OpenImageViewer/OIV"},"commit":{"kind":"string","value":"7b2b67ea156255bf77819ce77bf687c9d360e217"},"file_code":{"kind":"string","value":"#include \"ConfigurationLoader.h\"\n#include <LLUtils/FileHelper.h>\n#include <LLUtils/PlatformUtility.h>\n#include <LLUtils/Exception.h>\n#include <LLUtils/Logging/Logger.h>\n#include <nlohmann/json.hpp>\n#include <stack>\n\nnamespace OIV\n{\n\tConfigurationLoader::CommandGroupList ConfigurationLoader::LoadCommandGroups()\n\t{\n\t\tusing namespace nlohmann;\n\t\tusing namespace LLUtils;\n\n\t\tstd::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT(\"./Resources/Configuration/Commands.json\"));\n\t\tauto jsonObject = json::parse(jsonText);\n\t\tauto commands = jsonObject[\"commands\"];\n\n\t\tif (commands == nullptr || commands.is_array() == false)\n\t\t\tLL_EXCEPTION(LLUtils::Exception::ErrorCode::BadParameters, \"File contents mismatch\");\n\n\t\tCommandGroupList commandsList;\n\t\tfor (auto commandGroup : commands)\n\t\t\tcommandsList.push_back({ commandGroup[\"GroupID\"], commandGroup[\"DisplayName\"] ,commandGroup[\"Name\"], commandGroup[\"arguments\"] });\n\n\t\treturn commandsList;\n\t}\n\n\tConfigurationLoader::KeyBindingList ConfigurationLoader::LoadKeyBindings()\n\t{\n\t\tusing namespace nlohmann;\n\t\tusing namespace LLUtils;\n\n\t\tstd::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT(\"./Resources/Configuration/KeyBindings.json\"));\n\t\tauto jsonObject = json::parse(jsonText);\n\t\tauto keyBindings = jsonObject[\"KeyBindings\"];\n\n\t\tif (keyBindings == nullptr || keyBindings.is_array() == false)\n\t\t\tLL_EXCEPTION(LLUtils::Exception::ErrorCode::BadParameters, \"File contents mismatch\");\n\n\t\tKeyBindingList keyBindingsList;\n\t\tfor (auto& keybindingPair : keyBindings.items())\n\t\t{\n\t\t\t\n\t\t\tfor (auto& [key, value] : keybindingPair.value().items())\n\t\t\t\tkeyBindingsList.push_back(KeyBinding{ key, value.get<std::string>() });\n\t\t}\n\n\t\treturn keyBindingsList;\n\t}\n\n\tConfigurationLoader::MapSettings ConfigurationLoader::LoadSettings()\n\t{\n\t\tusing namespace nlohmann;\n\t\tusing namespace LLUtils;\n\n\t\tMapSettings mapSettings;\n\n\t\ttry\n\t\t{\n\t\t\tstd::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT(\"./Resources/Configuration/Settings.json\"));\n\t\t\tauto jsonObject = json::parse(jsonText);\n\n\t\t\tSettingEntryForParsing root;\n\n\t\t\tusing StackData = std::tuple<json*, SettingEntryForParsing*, std::string>;\n\n\t\t\tstd::stack<StackData> stck;\n\t\t\t\n\n\t\t\tstck.emplace(&jsonObject, &root, \"\");\n\n\t\t\twhile (stck.empty() == false)\n\t\t\t{\n\t\t\t\tconst auto [jsonTree, settingEntry, currentNamespace] = stck.top();\n\t\t\t\tstck.pop();\n\n\t\t\t\tstruct TmpEntry\n\t\t\t\t{\n\t\t\t\t\tbool isObject = false;\n\t\t\t\t\tstd::string name;\n\t\t\t\t\tjson* child;\n\t\t\t\t\tSettingEntryForParsing entry;\n\t\t\t\t};\n\n\t\t\t\tstd::list< TmpEntry> tmpList;\n\n\t\t\t\tfor (auto& child : jsonTree->items())\n\t\t\t\t{\n\t\t\t\t\ttmpList.push_back(TmpEntry());\n\n\t\t\t\t\tauto& currentTmp = tmpList.back();\n\t\t\t\t\tauto& currentChild = tmpList.back().entry;\n\t\t\t\t\tcurrentChild.name = child.key();\n\t\t\t\t\tif (child.value().is_object() == true)\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentTmp.isObject = true;\n\t\t\t\t\t\tcurrentTmp.child = &child.value();\n\t\t\t\t\t\tcurrentTmp.name = child.key();\n\n\t\t\t\t\t}\n\t\t\t\t\telse if (child.value().is_string())\n\t\t\t\t\t\tcurrentChild.value = child.value().get<String>();\n\t\t\t\t\telse\n\t\t\t\t\t\tcurrentChild.value = child.value().dump(0);\n\n\t\t\t\t\t\n\t\t\t\t\t\n\n\t\t\t\t\tif (child.value().is_object() == false)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::string qualifiedName;\n\t\t\t\t\t\tif (currentNamespace.empty())\n\t\t\t\t\t\t\tqualifiedName = currentChild.name;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tqualifiedName = currentNamespace + seperator + currentChild.name;\n\t\t\t\t\t\t\n\t\t\t\t\t\tmapSettings.emplace(qualifiedName, currentChild.value);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsettingEntry->children.resize(tmpList.size());\n\n\t\t\t\tdecltype(tmpList)::const_iterator it = tmpList.begin();\n\t\t\t\tfor (size_t i = 0; i < tmpList.size(); i++, it++)\n\t\t\t\t{\n\n\t\t\t\t\tsettingEntry->children.at(i) = it->entry;\n\t\t\t\t\tif (it->isObject)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::string qualifiedName;\n\t\t\t\t\t\tif (currentNamespace.empty())\n\n\t\t\t\t\t\t\tqualifiedName = it->name;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tqualifiedName = currentNamespace + seperator + it->name;\n\n\t\t\t\t\t\tstck.emplace(it->child, &settingEntry->children.at(i), qualifiedName);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (nlohmann::detail::exception& exception)\n\t\t{\n\t\t\tLLUtils::Logger::GetSingleton().Log(exception.what());\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\t\n\t\t}\n\n\t\t\n\n\t\treturn mapSettings;\n\t}\n\n}\n\n"},"prefix":{"kind":"string","value":"#include \"ConfigurationLoader.h\"\n#include <LLUtils/FileHelper.h>\n#include <LLUtils/PlatformUtility.h>\n#include <LLUtils/Exception.h>\n#include <LLUtils/Logging/Logger.h>\n#include <nlohmann/json.hpp>\n#include <stack>\n\nnamespace OIV\n{\n\t"},"suffix":{"kind":"string","value":"\n\n\tConfigurationLoader::KeyBindingList ConfigurationLoader::LoadKeyBindings()\n\t{\n\t\tusing namespace nlohmann;\n\t\tusing namespace LLUtils;\n\n\t\tstd::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT(\"./Resources/Configuration/KeyBindings.json\"));\n\t\tauto jsonObject = json::parse(jsonText);\n\t\tauto keyBindings = jsonObject[\"KeyBindings\"];\n\n\t\tif (keyBindings == nullptr || keyBindings.is_array() == false)\n\t\t\tLL_EXCEPTION(LLUtils::Exception::ErrorCode::BadParameters, \"File contents mismatch\");\n\n\t\tKeyBindingList keyBindingsList;\n\t\tfor (auto& keybindingPair : keyBindings.items())\n\t\t{\n\t\t\t\n\t\t\tfor (auto& [key, value] : keybindingPair.value().items())\n\t\t\t\tkeyBindingsList.push_back(KeyBinding{ key, value.get<std::string>() });\n\t\t}\n\n\t\treturn keyBindingsList;\n\t}\n\n\tConfigurationLoader::MapSettings ConfigurationLoader::LoadSettings()\n\t{\n\t\tusing namespace nlohmann;\n\t\tusing namespace LLUtils;\n\n\t\tMapSettings mapSettings;\n\n\t\ttry\n\t\t{\n\t\t\tstd::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT(\"./Resources/Configuration/Settings.json\"));\n\t\t\tauto jsonObject = json::parse(jsonText);\n\n\t\t\tSettingEntryForParsing root;\n\n\t\t\tusing StackData = std::tuple<json*, SettingEntryForParsing*, std::string>;\n\n\t\t\tstd::stack<StackData> stck;\n\t\t\t\n\n\t\t\tstck.emplace(&jsonObject, &root, \"\");\n\n\t\t\twhile (stck.empty() == false)\n\t\t\t{\n\t\t\t\tconst auto [jsonTree, settingEntry, currentNamespace] = stck.top();\n\t\t\t\tstck.pop();\n\n\t\t\t\tstruct TmpEntry\n\t\t\t\t{\n\t\t\t\t\tbool isObject = false;\n\t\t\t\t\tstd::string name;\n\t\t\t\t\tjson* child;\n\t\t\t\t\tSettingEntryForParsing entry;\n\t\t\t\t};\n\n\t\t\t\tstd::list< TmpEntry> tmpList;\n\n\t\t\t\tfor (auto& child : jsonTree->items())\n\t\t\t\t{\n\t\t\t\t\ttmpList.push_back(TmpEntry());\n\n\t\t\t\t\tauto& currentTmp = tmpList.back();\n\t\t\t\t\tauto& currentChild = tmpList.back().entry;\n\t\t\t\t\tcurrentChild.name = child.key();\n\t\t\t\t\tif (child.value().is_object() == true)\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentTmp.isObject = true;\n\t\t\t\t\t\tcurrentTmp.child = &child.value();\n\t\t\t\t\t\tcurrentTmp.name = child.key();\n\n\t\t\t\t\t}\n\t\t\t\t\telse if (child.value().is_string())\n\t\t\t\t\t\tcurrentChild.value = child.value().get<String>();\n\t\t\t\t\telse\n\t\t\t\t\t\tcurrentChild.value = child.value().dump(0);\n\n\t\t\t\t\t\n\t\t\t\t\t\n\n\t\t\t\t\tif (child.value().is_object() == false)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::string qualifiedName;\n\t\t\t\t\t\tif (currentNamespace.empty())\n\t\t\t\t\t\t\tqualifiedName = currentChild.name;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tqualifiedName = currentNamespace + seperator + currentChild.name;\n\t\t\t\t\t\t\n\t\t\t\t\t\tmapSettings.emplace(qualifiedName, currentChild.value);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsettingEntry->children.resize(tmpList.size());\n\n\t\t\t\tdecltype(tmpList)::const_iterator it = tmpList.begin();\n\t\t\t\tfor (size_t i = 0; i < tmpList.size(); i++, it++)\n\t\t\t\t{\n\n\t\t\t\t\tsettingEntry->children.at(i) = it->entry;\n\t\t\t\t\tif (it->isObject)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::string qualifiedName;\n\t\t\t\t\t\tif (currentNamespace.empty())\n\n\t\t\t\t\t\t\tqualifiedName = it->name;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tqualifiedName = currentNamespace + seperator + it->name;\n\n\t\t\t\t\t\tstck.emplace(it->child, &settingEntry->children.at(i), qualifiedName);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (nlohmann::detail::exception& exception)\n\t\t{\n\t\t\tLLUtils::Logger::GetSingleton().Log(exception.what());\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\t\n\t\t}\n\n\t\t\n\n\t\treturn mapSettings;\n\t}\n\n}\n\n"},"middle":{"kind":"string","value":"ConfigurationLoader::CommandGroupList ConfigurationLoader::LoadCommandGroups()\n\t{\n\t\tusing namespace nlohmann;\n\t\tusing namespace LLUtils;\n\n\t\tstd::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT(\"./Resources/Configuration/Commands.json\"));\n\t\tauto jsonObject = json::parse(jsonText);\n\t\tauto commands = jsonObject[\"commands\"];\n\n\t\tif (commands == nullptr || commands.is_array() == false)\n\t\t\tLL_EXCEPTION(LLUtils::Exception::ErrorCode::BadParameters, \"File contents mismatch\");\n\n\t\tCommandGroupList commandsList;\n\t\tfor (auto commandGroup : commands)\n\t\t\tcommandsList.push_back({ commandGroup[\"GroupID\"], commandGroup[\"DisplayName\"] ,commandGroup[\"Name\"], commandGroup[\"arguments\"] });\n\n\t\treturn commandsList;\n\t}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"namespace OIV\n\n{\n\n struct SelectionRect\n\n {\n\n LLUtils::PointI32 p0;\n\n LLUtils::PointI32 p1;\n\n };\n\n\n\n struct ViewParameters\n\n {\n\n LLUtils::PointI32 uViewportSize;\n\n LLUtils::Color uTransparencyColor1;\n\n LLUtils::Color uTransparencyColor2;\n\n bool showGrid;\n\n };\n","file_path":"oivlib/oiv/Include/Interfaces/IRendererDefs.h","rank":0,"score":119997.74623380002},{"content":"namespace OIV\n\n{\n\n ResultCode Execute_impl(int command, std::size_t requestSize, void* requestData, std::size_t responseSize, void* responseData);\n\n namespace Util\n\n {\n\n ResultCode GetBPPFromTexelFormat_impl(OIV_TexelFormat in_texelFormat, uint8_t* out_bpp);\n\n }\n\n \n","file_path":"oivlib/oiv/Source/APIImpl.h","rank":1,"score":85673.4010815513},{"content":"#pragma once\n\n#include <cstdint>\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/oiv/Include/System.h","rank":2,"score":85659.4113818168},{"content":" uint32_t x;\n","file_path":"oivlib/oiv/Include/defs.h","rank":3,"score":83921.1042925374},{"content":" uint32_t y;\n","file_path":"oivlib/oiv/Include/defs.h","rank":4,"score":83921.1042925374},{"content":" LLUtils::PointF64 scale;\n","file_path":"oivlib/oiv/Include/defs.h","rank":5,"score":83921.1042925374},{"content":"constexpr int OIV_VERSION_MINOR = 18;\n","file_path":"oivlib/oiv/Include/Version.h","rank":6,"score":83904.89187227802},{"content":"constexpr int OIV_VERSION_MAJOR = 0 ;\n","file_path":"oivlib/oiv/Include/Version.h","rank":7,"score":83904.89187227802},{"content":"#pragma once\n\n#include <defs.h>\n\n#include <Image.h>\n\n#include \"IRendererDefs.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/oiv/Include/Interfaces/IRenderer.h","rank":8,"score":82958.81020681701},{"content":"\tclass System\n\n\t{\n\n\tpublic:\n\n\t\tstatic uint32_t GetIdealNumThreadsForMemoryOperations();\n\n\t};\n\n}","file_path":"oivlib/oiv/Include/System.h","rank":9,"score":82944.38644219028},{"content":" ImageHandle handle;\n","file_path":"oivlib/oiv/Include/defs.h","rank":10,"score":82073.85596242147},{"content":" uint8_t bpp;\n","file_path":"oivlib/oiv/Include/defs.h","rank":11,"score":82073.85596242147},{"content":" std::size_t length;\n","file_path":"oivlib/oiv/Include/defs.h","rank":12,"score":82073.85596242147},{"content":" double offset;\n","file_path":"oivlib/oiv/Include/defs.h","rank":13,"score":82073.85596242147},{"content":" uint32_t width;\n","file_path":"oivlib/oiv/Include/defs.h","rank":14,"score":82073.85596242147},{"content":" size_t container;\n","file_path":"oivlib/oiv/Include/defs.h","rank":15,"score":82073.85596242147},{"content":" const OIVCHAR* text;\n","file_path":"oivlib/oiv/Include/defs.h","rank":16,"score":82073.85596242147},{"content":" char extension[MAX_EXTENSION_SIZE];\n","file_path":"oivlib/oiv/Include/defs.h","rank":17,"score":82073.85596242147},{"content":" double y0;\n","file_path":"oivlib/oiv/Include/defs.h","rank":18,"score":82073.85596242147},{"content":" double gamma;\n","file_path":"oivlib/oiv/Include/defs.h","rank":19,"score":82073.85596242147},{"content":" OIV_TexelFormat type;\n","file_path":"oivlib/oiv/Include/defs.h","rank":20,"score":82073.85596242147},{"content":" double saturation;\n","file_path":"oivlib/oiv/Include/defs.h","rank":21,"score":82073.85596242147},{"content":" OIV_AxisAlignedRotation rotation;\n","file_path":"oivlib/oiv/Include/defs.h","rank":22,"score":82073.85596242147},{"content":" OIV_TexelFormat format;\n","file_path":"oivlib/oiv/Include/defs.h","rank":23,"score":82073.85596242147},{"content":" OIV_RECT_I rect;\n","file_path":"oivlib/oiv/Include/defs.h","rank":24,"score":82073.85596242147},{"content":" double y1;\n","file_path":"oivlib/oiv/Include/defs.h","rank":25,"score":82073.85596242147},{"content":" double x0;\n","file_path":"oivlib/oiv/Include/defs.h","rank":26,"score":82073.85596242147},{"content":" const wchar_t* callstack;\n","file_path":"oivlib/oiv/Include/defs.h","rank":27,"score":82073.85596242147},{"content":" bool visible;\n","file_path":"oivlib/oiv/Include/defs.h","rank":28,"score":82073.85596242147},{"content":" OIV_AxisAlignedFlip transformation;\n","file_path":"oivlib/oiv/Include/defs.h","rank":29,"score":82073.85596242147},{"content":" char dummy;\n","file_path":"oivlib/oiv/Include/defs.h","rank":30,"score":82073.85596242147},{"content":" double x1;\n","file_path":"oivlib/oiv/Include/defs.h","rank":31,"score":82073.85596242147},{"content":" static constexpr uint8_t MAX_EXTENSION_SIZE = 16;\n","file_path":"oivlib/oiv/Include/defs.h","rank":32,"score":82073.85596242147},{"content":" const wchar_t* description;\n","file_path":"oivlib/oiv/Include/defs.h","rank":33,"score":82073.85596242147},{"content":" void* buffer;\n","file_path":"oivlib/oiv/Include/defs.h","rank":34,"score":82073.85596242147},{"content":" OIV_Tranform transform;\n","file_path":"oivlib/oiv/Include/defs.h","rank":35,"score":82073.85596242147},{"content":" double opacity;\n","file_path":"oivlib/oiv/Include/defs.h","rank":36,"score":82073.85596242147},{"content":" double exposure;\n","file_path":"oivlib/oiv/Include/defs.h","rank":37,"score":82073.85596242147},{"content":" uint8_t size;\n","file_path":"oivlib/oiv/Include/defs.h","rank":38,"score":82073.85596242147},{"content":" OIV_AxisAlignedFlip flip;\n","file_path":"oivlib/oiv/Include/defs.h","rank":39,"score":82073.85596242147},{"content":" double contrast;\n","file_path":"oivlib/oiv/Include/defs.h","rank":40,"score":82073.85596242147},{"content":" uint32_t height;\n","file_path":"oivlib/oiv/Include/defs.h","rank":41,"score":82073.85596242147},{"content":" OIV_CMD_LoadFile_Flags flags;\n","file_path":"oivlib/oiv/Include/defs.h","rank":42,"score":82073.85596242147},{"content":" class IRenderer\n\n {\n\n public:\n\n virtual int Init(const OIV_RendererInitializationParams& initParams) = 0;\n\n virtual int SetViewParams(const ViewParameters& viewParams) = 0;\n\n virtual int Redraw() = 0;\n\n virtual int SetFilterLevel(OIV_Filter_type filterType) = 0;\n\n virtual int SetExposure(const OIV_CMD_ColorExposure_Request& exposure) = 0;\n\n virtual int SetSelectionRect(SelectionRect selectionRect) = 0;\n\n\n\n\n\n //Multi image API\n\n virtual int SetImageBuffer(uint32_t id, const IMCodec::ImageSharedPtr image) = 0;\n\n virtual int SetImageProperties(const OIV_CMD_ImageProperties_Request&) = 0;\n\n virtual int RemoveImage(uint32_t id) = 0;\n\n\n\n virtual ~IRenderer() {}\n\n };\n\n\n\n typedef std::shared_ptr<IRenderer> IRendererSharedPtr;\n\n} ","file_path":"oivlib/oiv/Include/Interfaces/IRenderer.h","rank":43,"score":80408.40701001583},{"content":" OIV_TexelFormat texelFormat;\n","file_path":"oivlib/oiv/Include/defs.h","rank":44,"score":80309.7175273478},{"content":" uint8_t backgroundColor[4];\n","file_path":"oivlib/oiv/Include/defs.h","rank":45,"score":80309.7175273478},{"content":" LLUtils::Color uTransparencyColor2;\n","file_path":"oivlib/oiv/Include/Interfaces/IRendererDefs.h","rank":46,"score":80309.7175273478},{"content":" uint8_t outlineColor;\n","file_path":"oivlib/oiv/Include/defs.h","rank":47,"score":80309.7175273478},{"content":" uint32_t rowPitch;\n","file_path":"oivlib/oiv/Include/defs.h","rank":48,"score":80309.7175273478},{"content":" OIV_PROP_CreateText_Mode renderMode;\n","file_path":"oivlib/oiv/Include/defs.h","rank":49,"score":80309.7175273478},{"content":" uint16_t fontSize;\n","file_path":"oivlib/oiv/Include/defs.h","rank":50,"score":80309.7175273478},{"content":" const OIVCHAR* dataPath;\n","file_path":"oivlib/oiv/Include/defs.h","rank":51,"score":80309.7175273478},{"content":" ImageHandle imageHandle;\n","file_path":"oivlib/oiv/Include/defs.h","rank":52,"score":80309.7175273478},{"content":" const OIVCHAR* fontPath;\n","file_path":"oivlib/oiv/Include/defs.h","rank":53,"score":80309.7175273478},{"content":" uint8_t outlineWidth;\n","file_path":"oivlib/oiv/Include/defs.h","rank":54,"score":80309.7175273478},{"content":" uint16_t DPIy;\n","file_path":"oivlib/oiv/Include/defs.h","rank":55,"score":80309.7175273478},{"content":" const wchar_t* functionName;\n","file_path":"oivlib/oiv/Include/defs.h","rank":56,"score":80309.7175273478},{"content":"\t\tvoid* userPointer;\n","file_path":"oivlib/oiv/Include/defs.h","rank":57,"score":80309.7175273478},{"content":" int errorCode;\n","file_path":"oivlib/oiv/Include/defs.h","rank":58,"score":80309.7175273478},{"content":" uint16_t DPIx;\n","file_path":"oivlib/oiv/Include/defs.h","rank":59,"score":80309.7175273478},{"content":"#pragma once\n\n#include <defs.h>\n\n#include <map>\n\n#include \"OIVImage\\OIVTextImage.h\"\n\n#include \"EventManager.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/LabelManager.h","rank":60,"score":15.187077033493052},{"content":"#pragma once\n\n#include <array>\n\n#include \"OIVImage/OIVBaseImage.h\"\n\n#include \"OIVImage/OIVFileImage.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/ImageState.h","rank":61,"score":15.149622874589928},{"content":"#include <cstdint>\n\n#include \"../OIVImage/OIVBaseImage.h\"\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/Helpers/PixelHelper.h","rank":62,"score":15.090069426741803},{"content":"#pragma once\n\n#include \"Helpers/OIVHelper.h\"\n\n#include \"LabelManager.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/VirtualStatusBar.h","rank":63,"score":14.753628528021679},{"content":"#pragma once\n\n#include <Windows.h>\n\n#include <windowsx.h>\n\n#include <tchar.h>\n\n#include <Win32/Win32Window.h>\n\n#include \"ImageLIst.h\"\n\nnamespace OIV\n\n{\n\n namespace Win32\n\n\n\n {\n","file_path":"Clients/OIViewer/win32/ImageControl.h","rank":64,"score":14.6215407957274},{"content":"#pragma once\n\n#include <Win32/Win32Window.h>\n\n#include \"ImageControl.h\"\n\nnamespace OIV\n\n{\n\n namespace Win32\n\n {\n","file_path":"Clients/OIViewer/win32/MainWindow.h","rank":65,"score":14.546658650431004},{"content":"#include \"../OIVImage/OIVBaseImage.h\"\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/Helpers/MessageHelper.h","rank":66,"score":14.506094960165097},{"content":"#pragma once\n\n#include <list>\n\n#include <map>\n\n#include <defs.h>\n\n#include <Image.h>\n\n\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/oiv/Source/ImageManager.h","rank":67,"score":14.496156404738226},{"content":"#pragma once\n\n#include <defs.h>\n\n#include <Image.h>\n\n\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/oiv/Source/IPictureRenderer.h","rank":68,"score":14.482907749087776},{"content":"#pragma once\n\n#include \"OIVCommands.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/SelectionRect.h","rank":69,"score":14.455934714938092},{"content":"#pragma once\n\n#include <map>\n\n#include <functional>\n\n\n\nnamespace OIV\n\n{\n\n \n","file_path":"Clients/OIViewer/CommandManager.h","rank":70,"score":14.34706513419062},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerInit.h","rank":71,"score":14.34706513419062},{"content":"#pragma once\n\n#include <windows.h>\n\nnamespace OIV\n\n{\n\n namespace Win32\n\n {\n","file_path":"Clients/OIViewer/win32/UserMessages.h","rank":72,"score":14.333868832422986},{"content":"#pragma once\n\n#include \"OIVBaseImage.h\"\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/OIVImage/OIVHandleImage.h","rank":73,"score":14.319511911241904},{"content":"#pragma once\n\n#include \"../oiv/Interfaces/IRenderer.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/renderers/OIVGLRenderer/OIVGLRendererFactory.h","rank":74,"score":14.319511911241904},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerImageProperties.h","rank":75,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerGetKnownFileTypes.h","rank":76,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerAxisAlignedTransform.h","rank":77,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerRegisterCallbacks.h","rank":78,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerRefresh.h","rank":79,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerGetSubImages.h","rank":80,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerColorExposure.h","rank":81,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerGetPixels.h","rank":82,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerConvertFormat.h","rank":83,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerUnloadFile.h","rank":84,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerSetSelectionRect.h","rank":85,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerCreateText.h","rank":86,"score":14.303932221663187},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerCropImage.h","rank":87,"score":14.303932221663187},{"content":"#pragma once\n\n#include <string>\n\n#include <vector>\n\n#include <variant>\n\n#include <list>\n\n#include <map>\n\nnamespace OIV\n\n{\n\n\n","file_path":"Clients/OIViewer/ConfigurationLoader.h","rank":88,"score":14.29630949481656},{"content":"#pragma once\n\n#include <memory>\n\n#include <wrl/client.h>\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/renderers/OIVD3D11Renderer/Source/D3D11/D3D11Common.h","rank":90,"score":14.213887332837889},{"content":"#pragma once\n\n#include <memory>\n\n#include <d3d11.h>\n\n#include \"D3D11Device.h\"\n\nnamespace OIV\n\n{\n","file_path":"oivlib/renderers/OIVD3D11Renderer/Source/D3D11/D3D11Texture.h","rank":91,"score":14.18633419031239},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n#include \"../../ApiGlobal.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerLoadRaw.h","rank":92,"score":14.16455183267573},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n#include \"../../ApiGlobal.h\"\n\n\n\nnamespace OIV\n\n{\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerTexelInfo.h","rank":93,"score":14.16455183267573},{"content":"#pragma once\n\n#include <unordered_map>\n\n\n\n#include <defs.h>\n\n#include \"../IPictureRenderer.h\"\n\n#include \"CommandHandler.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/CommandProcessor.h","rank":94,"score":14.16455183267573},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n#include \"../../ApiGlobal.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerLoadFile.h","rank":95,"score":14.16455183267573},{"content":"#pragma once\n\n#include \"../CommandHandler.h\"\n\n#include <defs.h>\n\n#include \"../CommandProcessor.h\"\n\n#include \"../../ApiGlobal.h\"\n\n\n\nnamespace OIV\n\n{\n\n\n","file_path":"oivlib/oiv/Source/Commands/Handlers/CommandHandlerQueryImageInfo.h","rank":96,"score":14.16455183267573},{"content":"#include \"SelectionRect.h\"\n\n\n\n\n\n#include \"OIVImage\\OIVHandleImage.h\"\n\n#include \"OIVImage\\OIVFileImage.h\"\n\n#include \"OIVImage\\OIVRawImage.h\"\n\n#include \"Helpers\\OIVImageHelper.h\"\n\n#include \"VirtualStatusBar.h\"\n\n#include \"MonitorProvider.h\"\n\n\n\n#include \"ContextMenu.h\"\n\n#include \"globals.h\"\n\n#include \"ConfigurationLoader.h\"\n\n\n\n\n\n#include \"resource.h\"\n\n\n\nnamespace OIV\n\n{\n\n void TestApp::CMD_Zoom(const CommandManager::CommandRequest& request, CommandManager::CommandResult& result)\n","file_path":"Clients/OIViewer/TestApp.cpp","rank":97,"score":14.09587079505684},{"content":"#pragma once\n\n#include <string>\n\n#include <vector>\n\n#include <memory>\n\n#include <LLUtils/StopWatch.h>\n\n#include <defs.h>\n\n\n\nnamespace OIV\n\n{\n","file_path":"Clients/OIViewer/OIVImage/OIVBaseImage.h","rank":98,"score":14.091586781535776},{"content":"#pragma once\n\n#include \"../OIVImage/OIVHandleImage.h\"\n\n#include \"../OIVCommands.h\"\n\nnamespace OIV\n\n{\n\n \n\n //Create an RGBA render compatible image, \n\n // TODO: accept any render compatible image format.\n\n\n","file_path":"Clients/OIViewer/Helpers/OIVImageHelper.h","rank":99,"score":14.089715328557691}],"string":"[\n {\n \"content\": \"namespace OIV\\n\\n{\\n\\n struct SelectionRect\\n\\n {\\n\\n LLUtils::PointI32 p0;\\n\\n LLUtils::PointI32 p1;\\n\\n };\\n\\n\\n\\n struct ViewParameters\\n\\n {\\n\\n LLUtils::PointI32 uViewportSize;\\n\\n LLUtils::Color uTransparencyColor1;\\n\\n LLUtils::Color uTransparencyColor2;\\n\\n bool showGrid;\\n\\n };\\n\",\n \"file_path\": \"oivlib/oiv/Include/Interfaces/IRendererDefs.h\",\n \"rank\": 0,\n \"score\": 119997.74623380002\n },\n {\n \"content\": \"namespace OIV\\n\\n{\\n\\n ResultCode Execute_impl(int command, std::size_t requestSize, void* requestData, std::size_t responseSize, void* responseData);\\n\\n namespace Util\\n\\n {\\n\\n ResultCode GetBPPFromTexelFormat_impl(OIV_TexelFormat in_texelFormat, uint8_t* out_bpp);\\n\\n }\\n\\n \\n\",\n \"file_path\": \"oivlib/oiv/Source/APIImpl.h\",\n \"rank\": 1,\n \"score\": 85673.4010815513\n },\n {\n \"content\": \"#pragma once\\n\\n#include <cstdint>\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/oiv/Include/System.h\",\n \"rank\": 2,\n \"score\": 85659.4113818168\n },\n {\n \"content\": \" uint32_t x;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 3,\n \"score\": 83921.1042925374\n },\n {\n \"content\": \" uint32_t y;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 4,\n \"score\": 83921.1042925374\n },\n {\n \"content\": \" LLUtils::PointF64 scale;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 5,\n \"score\": 83921.1042925374\n },\n {\n \"content\": \"constexpr int OIV_VERSION_MINOR = 18;\\n\",\n \"file_path\": \"oivlib/oiv/Include/Version.h\",\n \"rank\": 6,\n \"score\": 83904.89187227802\n },\n {\n \"content\": \"constexpr int OIV_VERSION_MAJOR = 0 ;\\n\",\n \"file_path\": \"oivlib/oiv/Include/Version.h\",\n \"rank\": 7,\n \"score\": 83904.89187227802\n },\n {\n \"content\": \"#pragma once\\n\\n#include <defs.h>\\n\\n#include <Image.h>\\n\\n#include \\\"IRendererDefs.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/oiv/Include/Interfaces/IRenderer.h\",\n \"rank\": 8,\n \"score\": 82958.81020681701\n },\n {\n \"content\": \"\\tclass System\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tstatic uint32_t GetIdealNumThreadsForMemoryOperations();\\n\\n\\t};\\n\\n}\",\n \"file_path\": \"oivlib/oiv/Include/System.h\",\n \"rank\": 9,\n \"score\": 82944.38644219028\n },\n {\n \"content\": \" ImageHandle handle;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 10,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" uint8_t bpp;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 11,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" std::size_t length;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 12,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double offset;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 13,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" uint32_t width;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 14,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" size_t container;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 15,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" const OIVCHAR* text;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 16,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" char extension[MAX_EXTENSION_SIZE];\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 17,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double y0;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 18,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double gamma;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 19,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_TexelFormat type;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 20,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double saturation;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 21,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_AxisAlignedRotation rotation;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 22,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_TexelFormat format;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 23,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_RECT_I rect;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 24,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double y1;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 25,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double x0;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 26,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" const wchar_t* callstack;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 27,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" bool visible;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 28,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_AxisAlignedFlip transformation;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 29,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" char dummy;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 30,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double x1;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 31,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" static constexpr uint8_t MAX_EXTENSION_SIZE = 16;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 32,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" const wchar_t* description;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 33,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" void* buffer;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 34,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_Tranform transform;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 35,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double opacity;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 36,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double exposure;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 37,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" uint8_t size;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 38,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_AxisAlignedFlip flip;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 39,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" double contrast;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 40,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" uint32_t height;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 41,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" OIV_CMD_LoadFile_Flags flags;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 42,\n \"score\": 82073.85596242147\n },\n {\n \"content\": \" class IRenderer\\n\\n {\\n\\n public:\\n\\n virtual int Init(const OIV_RendererInitializationParams& initParams) = 0;\\n\\n virtual int SetViewParams(const ViewParameters& viewParams) = 0;\\n\\n virtual int Redraw() = 0;\\n\\n virtual int SetFilterLevel(OIV_Filter_type filterType) = 0;\\n\\n virtual int SetExposure(const OIV_CMD_ColorExposure_Request& exposure) = 0;\\n\\n virtual int SetSelectionRect(SelectionRect selectionRect) = 0;\\n\\n\\n\\n\\n\\n //Multi image API\\n\\n virtual int SetImageBuffer(uint32_t id, const IMCodec::ImageSharedPtr image) = 0;\\n\\n virtual int SetImageProperties(const OIV_CMD_ImageProperties_Request&) = 0;\\n\\n virtual int RemoveImage(uint32_t id) = 0;\\n\\n\\n\\n virtual ~IRenderer() {}\\n\\n };\\n\\n\\n\\n typedef std::shared_ptr<IRenderer> IRendererSharedPtr;\\n\\n} \",\n \"file_path\": \"oivlib/oiv/Include/Interfaces/IRenderer.h\",\n \"rank\": 43,\n \"score\": 80408.40701001583\n },\n {\n \"content\": \" OIV_TexelFormat texelFormat;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 44,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint8_t backgroundColor[4];\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 45,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" LLUtils::Color uTransparencyColor2;\\n\",\n \"file_path\": \"oivlib/oiv/Include/Interfaces/IRendererDefs.h\",\n \"rank\": 46,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint8_t outlineColor;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 47,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint32_t rowPitch;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 48,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" OIV_PROP_CreateText_Mode renderMode;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 49,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint16_t fontSize;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 50,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" const OIVCHAR* dataPath;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 51,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" ImageHandle imageHandle;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 52,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" const OIVCHAR* fontPath;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 53,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint8_t outlineWidth;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 54,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint16_t DPIy;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 55,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" const wchar_t* functionName;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 56,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \"\\t\\tvoid* userPointer;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 57,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" int errorCode;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 58,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \" uint16_t DPIx;\\n\",\n \"file_path\": \"oivlib/oiv/Include/defs.h\",\n \"rank\": 59,\n \"score\": 80309.7175273478\n },\n {\n \"content\": \"#pragma once\\n\\n#include <defs.h>\\n\\n#include <map>\\n\\n#include \\\"OIVImage\\\\OIVTextImage.h\\\"\\n\\n#include \\\"EventManager.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/LabelManager.h\",\n \"rank\": 60,\n \"score\": 15.187077033493052\n },\n {\n \"content\": \"#pragma once\\n\\n#include <array>\\n\\n#include \\\"OIVImage/OIVBaseImage.h\\\"\\n\\n#include \\\"OIVImage/OIVFileImage.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/ImageState.h\",\n \"rank\": 61,\n \"score\": 15.149622874589928\n },\n {\n \"content\": \"#include <cstdint>\\n\\n#include \\\"../OIVImage/OIVBaseImage.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/Helpers/PixelHelper.h\",\n \"rank\": 62,\n \"score\": 15.090069426741803\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"Helpers/OIVHelper.h\\\"\\n\\n#include \\\"LabelManager.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/VirtualStatusBar.h\",\n \"rank\": 63,\n \"score\": 14.753628528021679\n },\n {\n \"content\": \"#pragma once\\n\\n#include <Windows.h>\\n\\n#include <windowsx.h>\\n\\n#include <tchar.h>\\n\\n#include <Win32/Win32Window.h>\\n\\n#include \\\"ImageLIst.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\\n namespace Win32\\n\\n\\n\\n {\\n\",\n \"file_path\": \"Clients/OIViewer/win32/ImageControl.h\",\n \"rank\": 64,\n \"score\": 14.6215407957274\n },\n {\n \"content\": \"#pragma once\\n\\n#include <Win32/Win32Window.h>\\n\\n#include \\\"ImageControl.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\\n namespace Win32\\n\\n {\\n\",\n \"file_path\": \"Clients/OIViewer/win32/MainWindow.h\",\n \"rank\": 65,\n \"score\": 14.546658650431004\n },\n {\n \"content\": \"#include \\\"../OIVImage/OIVBaseImage.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/Helpers/MessageHelper.h\",\n \"rank\": 66,\n \"score\": 14.506094960165097\n },\n {\n \"content\": \"#pragma once\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <defs.h>\\n\\n#include <Image.h>\\n\\n\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/oiv/Source/ImageManager.h\",\n \"rank\": 67,\n \"score\": 14.496156404738226\n },\n {\n \"content\": \"#pragma once\\n\\n#include <defs.h>\\n\\n#include <Image.h>\\n\\n\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/oiv/Source/IPictureRenderer.h\",\n \"rank\": 68,\n \"score\": 14.482907749087776\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"OIVCommands.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/SelectionRect.h\",\n \"rank\": 69,\n \"score\": 14.455934714938092\n },\n {\n \"content\": \"#pragma once\\n\\n#include <map>\\n\\n#include <functional>\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n \\n\",\n \"file_path\": \"Clients/OIViewer/CommandManager.h\",\n \"rank\": 70,\n \"score\": 14.34706513419062\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerInit.h\",\n \"rank\": 71,\n \"score\": 14.34706513419062\n },\n {\n \"content\": \"#pragma once\\n\\n#include <windows.h>\\n\\nnamespace OIV\\n\\n{\\n\\n namespace Win32\\n\\n {\\n\",\n \"file_path\": \"Clients/OIViewer/win32/UserMessages.h\",\n \"rank\": 72,\n \"score\": 14.333868832422986\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"OIVBaseImage.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/OIVImage/OIVHandleImage.h\",\n \"rank\": 73,\n \"score\": 14.319511911241904\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../oiv/Interfaces/IRenderer.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/renderers/OIVGLRenderer/OIVGLRendererFactory.h\",\n \"rank\": 74,\n \"score\": 14.319511911241904\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerImageProperties.h\",\n \"rank\": 75,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerGetKnownFileTypes.h\",\n \"rank\": 76,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerAxisAlignedTransform.h\",\n \"rank\": 77,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerRegisterCallbacks.h\",\n \"rank\": 78,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerRefresh.h\",\n \"rank\": 79,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerGetSubImages.h\",\n \"rank\": 80,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerColorExposure.h\",\n \"rank\": 81,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerGetPixels.h\",\n \"rank\": 82,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerConvertFormat.h\",\n \"rank\": 83,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerUnloadFile.h\",\n \"rank\": 84,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerSetSelectionRect.h\",\n \"rank\": 85,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerCreateText.h\",\n \"rank\": 86,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerCropImage.h\",\n \"rank\": 87,\n \"score\": 14.303932221663187\n },\n {\n \"content\": \"#pragma once\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <variant>\\n\\n#include <list>\\n\\n#include <map>\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Clients/OIViewer/ConfigurationLoader.h\",\n \"rank\": 88,\n \"score\": 14.29630949481656\n },\n {\n \"content\": \"#pragma once\\n\\n#include <memory>\\n\\n#include <wrl/client.h>\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/renderers/OIVD3D11Renderer/Source/D3D11/D3D11Common.h\",\n \"rank\": 90,\n \"score\": 14.213887332837889\n },\n {\n \"content\": \"#pragma once\\n\\n#include <memory>\\n\\n#include <d3d11.h>\\n\\n#include \\\"D3D11Device.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/renderers/OIVD3D11Renderer/Source/D3D11/D3D11Texture.h\",\n \"rank\": 91,\n \"score\": 14.18633419031239\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n#include \\\"../../ApiGlobal.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerLoadRaw.h\",\n \"rank\": 92,\n \"score\": 14.16455183267573\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n#include \\\"../../ApiGlobal.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerTexelInfo.h\",\n \"rank\": 93,\n \"score\": 14.16455183267573\n },\n {\n \"content\": \"#pragma once\\n\\n#include <unordered_map>\\n\\n\\n\\n#include <defs.h>\\n\\n#include \\\"../IPictureRenderer.h\\\"\\n\\n#include \\\"CommandHandler.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/CommandProcessor.h\",\n \"rank\": 94,\n \"score\": 14.16455183267573\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n#include \\\"../../ApiGlobal.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerLoadFile.h\",\n \"rank\": 95,\n \"score\": 14.16455183267573\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../CommandHandler.h\\\"\\n\\n#include <defs.h>\\n\\n#include \\\"../CommandProcessor.h\\\"\\n\\n#include \\\"../../ApiGlobal.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n\\n\",\n \"file_path\": \"oivlib/oiv/Source/Commands/Handlers/CommandHandlerQueryImageInfo.h\",\n \"rank\": 96,\n \"score\": 14.16455183267573\n },\n {\n \"content\": \"#include \\\"SelectionRect.h\\\"\\n\\n\\n\\n\\n\\n#include \\\"OIVImage\\\\OIVHandleImage.h\\\"\\n\\n#include \\\"OIVImage\\\\OIVFileImage.h\\\"\\n\\n#include \\\"OIVImage\\\\OIVRawImage.h\\\"\\n\\n#include \\\"Helpers\\\\OIVImageHelper.h\\\"\\n\\n#include \\\"VirtualStatusBar.h\\\"\\n\\n#include \\\"MonitorProvider.h\\\"\\n\\n\\n\\n#include \\\"ContextMenu.h\\\"\\n\\n#include \\\"globals.h\\\"\\n\\n#include \\\"ConfigurationLoader.h\\\"\\n\\n\\n\\n\\n\\n#include \\\"resource.h\\\"\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\\n void TestApp::CMD_Zoom(const CommandManager::CommandRequest& request, CommandManager::CommandResult& result)\\n\",\n \"file_path\": \"Clients/OIViewer/TestApp.cpp\",\n \"rank\": 97,\n \"score\": 14.09587079505684\n },\n {\n \"content\": \"#pragma once\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <memory>\\n\\n#include <LLUtils/StopWatch.h>\\n\\n#include <defs.h>\\n\\n\\n\\nnamespace OIV\\n\\n{\\n\",\n \"file_path\": \"Clients/OIViewer/OIVImage/OIVBaseImage.h\",\n \"rank\": 98,\n \"score\": 14.091586781535776\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"../OIVImage/OIVHandleImage.h\\\"\\n\\n#include \\\"../OIVCommands.h\\\"\\n\\nnamespace OIV\\n\\n{\\n\\n \\n\\n //Create an RGBA render compatible image, \\n\\n // TODO: accept any render compatible image format.\\n\\n\\n\",\n \"file_path\": \"Clients/OIViewer/Helpers/OIVImageHelper.h\",\n \"rank\": 99,\n \"score\": 14.089715328557691\n }\n]","isConversational":false}}},{"rowIdx":84,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"dependencies/PyMesh/tools/MeshUtils/DegeneratedTriangleRemoval.cpp"},"repo_name":{"kind":"string","value":"aprieels/3D-watermarking-spectral-decomposition"},"commit":{"kind":"string","value":"dcab78857d0bb201563014e58900917545ed4673"},"file_code":{"kind":"string","value":"#include \"DegeneratedTriangleRemoval.h\"\n\n#include <cassert>\n#include <iostream>\n#include <limits>\n#include <set>\n#include <vector>\n\n#include <Math/MatrixUtils.h>\n#include <MeshUtils/FaceUtils.h>\n#include <MeshUtils/IsolatedVertexRemoval.h>\n#include <MeshUtils/ShortEdgeRemoval.h>\n#include <Predicates/predicates.h>\n\nusing namespace PyMesh;\n\nnamespace DegeneratedTriangleRemovalHelper {\n const size_t INVALID = std::numeric_limits<size_t>::max();\n}\nusing namespace DegeneratedTriangleRemovalHelper;\n\nDegeneratedTriangleRemoval::DegeneratedTriangleRemoval(\n const MatrixFr& vertices, const MatrixIr& faces) :\nm_vertices(vertices), m_faces(faces) {\n assert(m_vertices.cols() == 3);\n assert(m_faces.cols() == 3);\n exactinit();\n init_ori_face_indices();\n}\n\nvoid DegeneratedTriangleRemoval::run(size_t num_iterations) {\n size_t num_removed = 0;\n size_t count = 0;\n do {\n num_removed = 0;\n size_t e_removed = remove_zero_edges();\n size_t e_flipped = remove_line_faces();\n remove_isolated_vertices();\n count++;\n num_removed += (e_removed + e_flipped);\n } while (num_removed != 0 && count < num_iterations);\n\n if (num_removed != 0) {\n std::cerr << \"Warning: Max number of iterations reached. \";\n std::cerr << \"Not all degenerated faces are removed.\" << std::endl;\n }\n}\n\nvoid DegeneratedTriangleRemoval::init_ori_face_indices() {\n const size_t num_faces = m_faces.rows();\n m_ori_face_indices.resize(num_faces);\n for (size_t i=0; i<num_faces; i++) {\n m_ori_face_indices[i] = i;\n }\n}\n\nsize_t DegeneratedTriangleRemoval::remove_zero_edges() {\n ShortEdgeRemoval remover(m_vertices, m_faces);\n size_t num_removed = remover.run(0.0);\n m_vertices = remover.get_vertices();\n m_faces = remover.get_faces();\n\n auto sources = remover.get_face_indices();\n const size_t num_faces = m_faces.rows();\n assert(num_faces == sources.rows());\n assert(sources.size() == 0 || sources.minCoeff() >= 0);\n assert(sources.size() == 0 ||\n sources.maxCoeff() < m_ori_face_indices.size());\n\n VectorI updated_ori_face_indices(num_faces);\n for (size_t i=0; i<num_faces; i++) {\n updated_ori_face_indices[i] = m_ori_face_indices[sources[i]];\n }\n m_ori_face_indices = updated_ori_face_indices;\n\n return num_removed;\n}\n\nsize_t DegeneratedTriangleRemoval::remove_line_faces() {\n init_edge_map();\n \n \n\n auto comp = [&](const Triplet& e1, const Triplet& e2) -> bool{\n \n auto v1 = m_vertices.row(e1.get_ori_data()[0]);\n auto v2 = m_vertices.row(e1.get_ori_data()[1]);\n auto v3 = m_vertices.row(e2.get_ori_data()[0]);\n auto v4 = m_vertices.row(e2.get_ori_data()[1]);\n return (v1-v2).squaredNorm() > (v3-v4).squaredNorm();\n };\n\n const size_t num_faces = m_faces.rows();\n std::set<Triplet, decltype(comp)> edges_to_remove(comp);\n std::vector<size_t> longest_edges(num_faces, INVALID);\n for (size_t fi=0; fi<num_faces; fi++) {\n if (!is_degenerated(fi)) continue;\n const auto& face = m_faces.row(fi);\n const size_t fi_opp_v = find_longest_edge(fi);\n const size_t vi_0 = face[(fi_opp_v+1)%3];\n const size_t vi_1 = face[(fi_opp_v+2)%3];\n Triplet edge(vi_0, vi_1);\n edges_to_remove.insert(edge);\n longest_edges[fi] = fi_opp_v;\n }\n\n std::vector<VectorI> new_faces;\n std::vector<VectorI::Scalar> new_ori_face_indices;\n std::vector<bool> is_valid(num_faces, true);\n size_t count = 0;\n\n for (auto& edge : edges_to_remove) {\n auto& neighboring_faces = m_edge_map[edge];\n bool all_valid = true;\n for (auto fj : neighboring_faces) { all_valid &= is_valid[fj]; }\n if (!all_valid) continue;\n\n const size_t vi_0 = edge.get_ori_data()[0];\n const size_t vi_1 = edge.get_ori_data()[1];\n size_t vi_opp = INVALID;\n size_t fi = INVALID;\n for (auto fj : neighboring_faces) {\n if (longest_edges[fj] == INVALID) continue;\n const auto neighbor_face = m_faces.row(fj);\n const size_t vj_opp = neighbor_face[longest_edges[fj]];\n if (vj_opp != vi_0 && vj_opp != vi_1) {\n fi = fj;\n vi_opp = vj_opp;\n break;\n }\n }\n assert(vi_opp != INVALID);\n assert(fi != INVALID);\n\n for (auto fj : neighboring_faces) {\n is_valid[fj] = false;\n if (fj == fi) continue;\n const auto neighbor_face = m_faces.row(fj);\n size_t fj_opp_v = INVALID;\n for (size_t i=0; i<3; i++) {\n if (neighbor_face[i] != vi_0 && neighbor_face[i] != vi_1) {\n fj_opp_v = i;\n break;\n }\n }\n assert(fj_opp_v != INVALID);\n const size_t vj_opp = neighbor_face[fj_opp_v];\n const size_t vj_0 = neighbor_face[(fj_opp_v+1)%3];\n const size_t vj_1 = neighbor_face[(fj_opp_v+2)%3];\n new_faces.push_back(Vector3I(vi_opp, vj_opp, vj_0));\n new_faces.push_back(Vector3I(vi_opp, vj_1, vj_opp));\n new_ori_face_indices.push_back(m_ori_face_indices[fj]);\n new_ori_face_indices.push_back(m_ori_face_indices[fj]);\n }\n count++;\n }\n\n \n for (size_t fi=0; fi<num_faces; fi++) {\n if (is_valid[fi]) {\n new_faces.push_back(m_faces.row(fi));\n new_ori_face_indices.push_back(m_ori_face_indices[fi]);\n }\n }\n if (!new_faces.empty()) {\n m_faces = MatrixUtils::rowstack(new_faces);\n m_ori_face_indices = MatrixUtils::std2eigen(new_ori_face_indices);\n } else {\n m_faces = MatrixIr(0, 3);\n m_ori_face_indices.resize(0);\n }\n assert(m_faces.rows() == new_faces.size());\n return count;\n}\n\nvoid DegeneratedTriangleRemoval::remove_isolated_vertices() {\n IsolatedVertexRemoval remover(m_vertices, m_faces);\n remover.run();\n m_vertices = remover.get_vertices();\n m_faces = remover.get_faces();\n}\n\nvoid DegeneratedTriangleRemoval::init_edge_map() {\n m_edge_map.clear();\n const size_t num_faces = m_faces.rows();\n assert(m_faces.cols() == 3);\n for (size_t i=0; i<num_faces; i++) {\n const auto& f = m_faces.row(i);\n m_edge_map.insert(Triplet(f[0], f[1]), i);\n m_edge_map.insert(Triplet(f[1], f[2]), i);\n m_edge_map.insert(Triplet(f[2], f[0]), i);\n }\n}\n\nbool DegeneratedTriangleRemoval::is_degenerated(size_t i) const {\n const auto& f = m_faces.row(i);\n const auto& v0 = m_vertices.row(f[0]);\n const auto& v1 = m_vertices.row(f[1]);\n const auto& v2 = m_vertices.row(f[2]);\n\n return FaceUtils::is_colinear_3D(v0, v1, v2);\n}\n\nsize_t DegeneratedTriangleRemoval::find_longest_edge(size_t fi) const {\n \n const auto& f = m_faces.row(fi);\n const auto& v0 = m_vertices.row(f[0]);\n const auto& v1 = m_vertices.row(f[1]);\n const auto& v2 = m_vertices.row(f[2]);\n size_t i = 0;\n if (!(v0[0] == v1[0] || v0[0] == v2[0] || v1[0] == v2[0])) {\n i = 0;\n } else if (!(v0[1] == v1[1] || v0[1] == v2[1] || v1[1] == v2[1])) {\n i = 1;\n } else if (!(v0[2] == v1[2] || v0[2] == v2[2] || v1[2] == v2[2])) {\n i = 2;\n } else {\n \n \n std::cerr << f[0] << \": \" << v0 << std::endl;\n std::cerr << f[1] << \": \" << v1 << std::endl;\n std::cerr << f[2] << \": \" << v2 << std::endl;\n throw RuntimeError(\"Triangle degenerates to a point, report this bug\");\n }\n\n if (v0[i] < v1[i] && v0[i] > v2[i]) return 0;\n if (v0[i] > v1[i] && v0[i] < v2[i]) return 0;\n if (v1[i] < v0[i] && v1[i] > v2[i]) return 1;\n if (v1[i] > v0[i] && v1[i] < v2[i]) return 1;\n if (v2[i] < v0[i] && v2[i] > v1[i]) return 2;\n if (v2[i] > v0[i] && v2[i] < v1[i]) return 2;\n\n \n \n std::cerr << f[0] << \": \" << v0 << std::endl;\n std::cerr << f[1] << \": \" << v1 << std::endl;\n std::cerr << f[2] << \": \" << v2 << std::endl;\n throw RuntimeError(\"Triangle contains an zero edge, report this bug\");\n}\n\n"},"prefix":{"kind":"string","value":"#include \"DegeneratedTriangleRemoval.h\"\n\n#include <cassert>\n#include <iostream>\n#include <limits>\n#include <set>\n#include <vector>\n\n#include <Math/MatrixUtils.h>\n#include <MeshUtils/FaceUtils.h>\n#include <MeshUtils/IsolatedVertexRemoval.h>\n#include <MeshUtils/ShortEdgeRemoval.h>\n#include <Predicates/predicates.h>\n\nusing namespace PyMesh;\n\nnamespace DegeneratedTriangleRemovalHelper {\n const size_t INVALID = std::numeric_limits<size_t>::max();\n}\nusing namespace DegeneratedTriangleRemovalHelper;\n\nDegeneratedTriangleRemoval::DegeneratedTriangleRemoval(\n const MatrixFr& vertices, const MatrixIr& faces) :\nm_vertices(vertices), m_faces(faces) {\n assert(m_vertices.cols() == 3);\n assert(m_faces.cols() == 3);\n exactinit();\n init_ori_face_indices();\n}\n\nvoid DegeneratedTriangleRemoval::run(size_t num_iterations) {\n size_t num_removed = 0;\n size_t count = 0;\n do {\n num_removed = 0;\n size_t e_removed = remove_zero_edges();\n size_t e_flipped = remove_line_faces();\n remove_isolated_vertices();\n count++;\n num_removed += (e_removed + e_flipped);\n } while (num_removed != 0 && count < num_iterations);\n\n if (num_removed != 0) {\n std::cerr << \"Warning: Max number of iterations reached. \";\n std::cerr << \"Not all degenerated faces are removed.\" << std::endl;\n }\n}\n\nvoid DegeneratedTriangleRemoval::init_ori_face_indices() {\n const size_t num_faces = m_faces.rows();\n m_ori_face_indices.resize(num_faces);\n for (size_t i=0; i<num_faces; i++) {\n m_ori_face_indices[i] = i;\n }\n}\n\nsize_t DegeneratedTriangleRemoval::remove_zero_edges() {\n ShortEdgeRemoval remover(m_vertices, m_faces);\n size_t num_removed = remover.run(0.0);\n m_vertices = remover.get_vertices();\n m_faces = remover.get_faces();\n\n auto sources = remover.get_face_indices();\n const size_t num_faces = m_faces.rows();\n assert(num_faces == sources.rows());\n assert(sources.size() == 0 || sources.minCoeff() >= 0);\n assert(sources.size() == 0 ||\n sources.maxCoeff() < m_ori_face_indices.size());\n\n VectorI updated_ori_face_indices(num_faces);\n for (size_t i=0; i<num_faces; i++) {\n updated_ori_face_indices[i] = m_ori_face_indices[sources[i]];\n }\n m_ori_face_indices = updated_ori_face_indices;\n\n return num_removed;\n}\n\nsize_t DegeneratedTriangleRemoval::remove_line_faces() {\n init_edge_map();\n \n \n\n auto comp = [&](const Triplet& e1, const Triplet& e2) -> bool{\n \n auto v1 = m_vertices.row(e1.get_ori_data()[0]);\n auto v2 = m_vertices.row(e1.get_ori_data()[1]);\n auto v3 = m_vertices.row(e2.get_ori_data()[0]);\n auto v4 = m_vertices.row(e2.get_ori_data()[1]);\n return (v1-v2).squaredNorm() > (v3-v4).squaredNorm();\n };\n\n const size_t num_faces = m_faces.rows();\n std::set<Triplet, decltype(comp)> edges_to_remove(comp);\n std::vector<size_t> longest_edges(num_faces, INVALID);\n for (size_t fi=0; fi<num_faces; fi++) {\n if (!is_degenerated(fi)) continue;\n const auto& face = m_faces.row(fi);\n const size_t fi_opp_v = find_longest_edge(fi);\n const size_t vi_0 = face[(fi_opp_v+1)%3];\n const size_t vi_1 = face[(fi_opp_v+2)%3];\n Triplet edge(vi_0, vi_1);\n edges_to_remove.insert(edge);\n longest_edges[fi] = fi_opp_v;\n }\n\n std::vector<VectorI> new_faces;\n std::vector<VectorI::Scalar> new_ori_face_indices;\n std::vector<bool> is_valid(num_faces, true);\n size_t count = 0;\n\n for (auto& edge : edges_to_remove) {\n auto& neighboring_faces = m_edge_map[edge];\n bool all_valid = true;\n for (auto fj : neighboring_faces) { all_valid &= is_valid[fj]; }\n if (!all_valid) continue;\n\n const size_t vi_0 = edge.get_ori_data()[0];\n const size_t vi_1 = edge.get_ori_data()[1];\n size_t vi_opp = INVALID;\n size_t fi = INVALID;\n for (auto fj : neighboring_faces) {\n if (longest_edges[fj] == INVALID) continue;\n const auto neighbor_face = m_faces.row(fj);\n const size_t vj_opp = neighbor_face[longest_edges[fj]];\n if (vj_opp != vi_0 && vj_opp != vi_1) {\n fi = fj;\n vi_opp = vj_opp;\n break;\n }\n }\n assert(vi_opp != INVALID);\n assert(fi != INVALID);\n\n for (auto fj : neighboring_faces) {\n is_valid[fj] = false;\n if (fj == fi) continue;\n const auto neighbor_face = m_faces.row(fj);\n size_t fj_opp_v = INVALID;\n for (size_t i=0; i<3; i++) {\n "},"suffix":{"kind":"string","value":"\n }\n assert(fj_opp_v != INVALID);\n const size_t vj_opp = neighbor_face[fj_opp_v];\n const size_t vj_0 = neighbor_face[(fj_opp_v+1)%3];\n const size_t vj_1 = neighbor_face[(fj_opp_v+2)%3];\n new_faces.push_back(Vector3I(vi_opp, vj_opp, vj_0));\n new_faces.push_back(Vector3I(vi_opp, vj_1, vj_opp));\n new_ori_face_indices.push_back(m_ori_face_indices[fj]);\n new_ori_face_indices.push_back(m_ori_face_indices[fj]);\n }\n count++;\n }\n\n \n for (size_t fi=0; fi<num_faces; fi++) {\n if (is_valid[fi]) {\n new_faces.push_back(m_faces.row(fi));\n new_ori_face_indices.push_back(m_ori_face_indices[fi]);\n }\n }\n if (!new_faces.empty()) {\n m_faces = MatrixUtils::rowstack(new_faces);\n m_ori_face_indices = MatrixUtils::std2eigen(new_ori_face_indices);\n } else {\n m_faces = MatrixIr(0, 3);\n m_ori_face_indices.resize(0);\n }\n assert(m_faces.rows() == new_faces.size());\n return count;\n}\n\nvoid DegeneratedTriangleRemoval::remove_isolated_vertices() {\n IsolatedVertexRemoval remover(m_vertices, m_faces);\n remover.run();\n m_vertices = remover.get_vertices();\n m_faces = remover.get_faces();\n}\n\nvoid DegeneratedTriangleRemoval::init_edge_map() {\n m_edge_map.clear();\n const size_t num_faces = m_faces.rows();\n assert(m_faces.cols() == 3);\n for (size_t i=0; i<num_faces; i++) {\n const auto& f = m_faces.row(i);\n m_edge_map.insert(Triplet(f[0], f[1]), i);\n m_edge_map.insert(Triplet(f[1], f[2]), i);\n m_edge_map.insert(Triplet(f[2], f[0]), i);\n }\n}\n\nbool DegeneratedTriangleRemoval::is_degenerated(size_t i) const {\n const auto& f = m_faces.row(i);\n const auto& v0 = m_vertices.row(f[0]);\n const auto& v1 = m_vertices.row(f[1]);\n const auto& v2 = m_vertices.row(f[2]);\n\n return FaceUtils::is_colinear_3D(v0, v1, v2);\n}\n\nsize_t DegeneratedTriangleRemoval::find_longest_edge(size_t fi) const {\n \n const auto& f = m_faces.row(fi);\n const auto& v0 = m_vertices.row(f[0]);\n const auto& v1 = m_vertices.row(f[1]);\n const auto& v2 = m_vertices.row(f[2]);\n size_t i = 0;\n if (!(v0[0] == v1[0] || v0[0] == v2[0] || v1[0] == v2[0])) {\n i = 0;\n } else if (!(v0[1] == v1[1] || v0[1] == v2[1] || v1[1] == v2[1])) {\n i = 1;\n } else if (!(v0[2] == v1[2] || v0[2] == v2[2] || v1[2] == v2[2])) {\n i = 2;\n } else {\n \n \n std::cerr << f[0] << \": \" << v0 << std::endl;\n std::cerr << f[1] << \": \" << v1 << std::endl;\n std::cerr << f[2] << \": \" << v2 << std::endl;\n throw RuntimeError(\"Triangle degenerates to a point, report this bug\");\n }\n\n if (v0[i] < v1[i] && v0[i] > v2[i]) return 0;\n if (v0[i] > v1[i] && v0[i] < v2[i]) return 0;\n if (v1[i] < v0[i] && v1[i] > v2[i]) return 1;\n if (v1[i] > v0[i] && v1[i] < v2[i]) return 1;\n if (v2[i] < v0[i] && v2[i] > v1[i]) return 2;\n if (v2[i] > v0[i] && v2[i] < v1[i]) return 2;\n\n \n \n std::cerr << f[0] << \": \" << v0 << std::endl;\n std::cerr << f[1] << \": \" << v1 << std::endl;\n std::cerr << f[2] << \": \" << v2 << std::endl;\n throw RuntimeError(\"Triangle contains an zero edge, report this bug\");\n}\n\n"},"middle":{"kind":"string","value":"if (neighbor_face[i] != vi_0 && neighbor_face[i] != vi_1) {\n fj_opp_v = i;\n break;\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"struct RemoveConst<const T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n\n\n#if defined(_MSC_VER) && _MSC_VER < 1400\n\n// This is the only specialization that allows VC++ 7.1 to remove const in\n\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\n\n// and thus needs to be conditionally compiled.\n\ntemplate <typename T, size_t N>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h","rank":0,"score":207685.25908348509},{"content":"struct IteratorTraits<const T*> {\n\n typedef T value_type;\n\n};\n\n\n\n#if GTEST_OS_WINDOWS\n\n# define GTEST_PATH_SEP_ \"\\\\\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 1\n\n// The biggest signed integer type the compiler supports.\n\ntypedef __int64 BiggestInt;\n\n#else\n\n# define GTEST_PATH_SEP_ \"/\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 0\n\ntypedef long long BiggestInt; // NOLINT\n\n#endif // GTEST_OS_WINDOWS\n\n\n\n// Utilities for char.\n\n\n\n// isspace(int ch) and friends accept an unsigned char or EOF. char\n\n// may be signed, depending on the compiler (or compiler flags).\n\n// Therefore we need to cast a char to unsigned char before calling\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-port.h","rank":1,"score":198337.06117945336},{"content":" def __remove_isolated_vertices(self):\n\n remover = IsolatedVertexRemoval(self.vertices, self.faces);\n\n remover.run();\n\n self.vertices = remover.get_vertices();\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/collapse_short_edges.py","rank":2,"score":197144.73063755667},{"content":" def __remove_fin_faces(self):\n\n remover = FinFaceRemoval(self.vertices, self.faces);\n\n remover.run();\n\n self.vertices = remover.get_vertices();\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/collapse_short_edges.py","rank":3,"score":197083.35693862228},{"content":"struct RemoveConstFromKey<std::pair<const K, V> > {\n\n typedef std::pair<K, V> type;\n\n};\n\n\n\n// Mapping from booleans to types. Similar to boost::bool_<kValue> and\n\n// std::integral_constant<bool, kValue>.\n\ntemplate <bool kValue>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":4,"score":195270.02050562316},{"content":"import numpy as np\n\nfrom PyMesh import IsolatedVertexRemoval\n\nfrom ..meshio import form_mesh\n\n\n\ndef remove_isolated_vertices_raw(vertices, elements):\n\n \"\"\" Remove isolated vertices.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n elements (``numpy.ndarray``): Element array with one face per row.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array with one vertex per row.\n\n * ``output_elements``: Output element array with one element per row.\n\n * ``infomation``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``infomation``:\n\n\n\n * ``num_vertex_removed``: Number of vertex removed.\n\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\n\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\n\n vertex array.\n\n \"\"\"\n\n remover = IsolatedVertexRemoval(vertices, elements);\n\n num_removed = remover.run();\n\n vertices = remover.get_vertices();\n\n elements = remover.get_faces();\n\n info = {\n\n \"num_vertex_removed\": num_removed,\n\n \"ori_vertex_index\": remover.get_ori_vertex_indices().ravel(),\n\n };\n\n return vertices, elements, info;\n\n\n\ndef remove_isolated_vertices(mesh):\n\n \"\"\" Wrapper function of :func:`remove_isolated_vertices_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``infomation`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``infomation``:\n\n\n\n * ``num_vertex_removed``: Number of vertex removed.\n\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\n\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\n\n vertex array.\n\n \"\"\"\n\n if mesh.num_voxels == 0:\n\n vertices, faces, info = remove_isolated_vertices_raw(\n\n mesh.vertices, mesh.faces);\n\n output_mesh = form_mesh(vertices, faces);\n\n else:\n\n vertices, voxels, info = remove_isolated_vertices_raw(\n\n mesh.vertices, mesh.voxels);\n\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\n\n return output_mesh, info;\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_isolated_vertices.py","rank":5,"score":194833.20345134335},{"content":"import numpy as np\n\nfrom PyMesh import DuplicatedVertexRemoval\n\nfrom ..meshio import form_mesh\n\n\n\ndef remove_duplicated_vertices_raw(vertices, elements, tol=1e-12, importance=None):\n\n \"\"\" Merge duplicated vertices into a single vertex.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertices in row major.\n\n elements (``numpy.ndarray``): Elements in row major.\n\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\n\n considered as duplicates. Default is ``1e-12``.\n\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\n\n When discarding duplicates, the vertex with the highest importance\n\n value will be kept.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertices in row major.\n\n * ``output_elements``: Output elements in row major.\n\n * ``information``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``num_vertex_merged``: number of vertex merged.\n\n * ``index_map``: An array that maps input vertex index to output vertex index.\n\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\n\n\n\n \"\"\"\n\n\n\n remover = DuplicatedVertexRemoval(vertices, elements);\n\n if importance is not None:\n\n if (len(importance) != len(vertices)):\n\n raise RuntimeError(\n\n \"Vertex importance must be of the same size as vertices\");\n\n remover.set_importance_level(importance);\n\n num_merged = remover.run(tol);\n\n new_vertices = remover.get_vertices();\n\n new_elements = remover.get_faces();\n\n info = {\n\n \"num_vertex_merged\": num_merged,\n\n \"index_map\": remover.get_index_map().ravel(),\n\n };\n\n return new_vertices, new_elements, info;\n\n\n\ndef remove_duplicated_vertices(mesh, tol=1e-12, importance=None):\n\n \"\"\" Wrapper function of :func:`remove_duplicated_vertices_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\n\n considered as duplicates. Default is ``1e-12``.\n\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\n\n When discarding duplicates, the vertex with the highest importance\n\n value will be kept.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``num_vertex_merged``: number of vertex merged.\n\n * ``index_map``: An array that maps input vertex index to output vertex index.\n\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\n\n\n\n \"\"\"\n\n if mesh.num_voxels == 0:\n\n vertices, faces, info = remove_duplicated_vertices_raw(\n\n mesh.vertices, mesh.faces, tol, importance);\n\n out_mesh = form_mesh(vertices, faces);\n\n else:\n\n vertices, voxels, info = remove_duplicated_vertices_raw(\n\n mesh.vertices, mesh.voxels, tol, importance);\n\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\n\n\n\n return out_mesh, info;\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_vertices.py","rank":6,"score":194833.20345134335},{"content":"import numpy as np\n\nfrom PyMesh import FinFaceRemoval\n\nfrom ..meshio import form_mesh\n\n\n\ndef remove_duplicated_faces_raw(vertices, faces, fins_only=False):\n\n \"\"\" Remove duplicated faces.\n\n\n\n Duplicated faces are defined as faces consist of the same set of vertices.\n\n Depending on the face orientation. A special case of duplicated faces is\n\n a fin. A fin is defined as two duplicated faces with opposite orientaiton.\n\n\n\n If fins_only is set to True, all fins in the mesh are removed. The output\n\n mesh could still contain duplicated faces but no fins.\n\n\n\n If fins_only is not True, all duplicated faces will be removed. There could\n\n be two caes:\n\n\n\n If there is a dominant orientation, that is more than half of the faces are\n\n consistently orientated, and fins_only is False, one face with the dominant\n\n orientation will be kept while all other faces are removed.\n\n\n\n If there is no dominant orientation, i.e. half of the face are positively\n\n orientated and the other half is negatively orientated, all faces are\n\n discarded.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n faces (``numpy.ndarray``): Face array with one face per row.\n\n fins_only (``bool``): If set, only remove fins.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array, one vertex per row.\n\n * ``output_faces``: Output face array, one face per row.\n\n * ``information``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``ori_face_index``: An array of original face indices. I.e. face\n\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\n\n the input vertices.\n\n\n\n \"\"\"\n\n remover = FinFaceRemoval(vertices, faces);\n\n if fins_only: remover.set_fins_only();\n\n remover.run();\n\n info = {\n\n \"ori_face_index\": remover.get_face_indices().ravel(),\n\n };\n\n return remover.get_vertices(), remover.get_faces(), info;\n\n\n\ndef remove_duplicated_faces(mesh, fins_only=False):\n\n \"\"\" Wrapper function of :func:`remove_duplicated_faces_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n fins_only (``bool``): If set, only remove fins.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``ori_face_index``: An array of original face indices. I.e. face\n\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\n\n the input vertices.\n\n\n\n \"\"\"\n\n vertices, faces, info = remove_duplicated_faces_raw(\n\n mesh.vertices, mesh.faces, fins_only);\n\n return form_mesh(vertices, faces), info;\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_faces.py","rank":7,"score":194768.67109983676},{"content":"struct RemoveConst<const T> { typedef T type; }; // NOLINT\n\n\n\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\n\n// definition to fail to remove the const in 'const int[3]' and 'const\n\n// char[3][4]'. The following specialization works around the bug.\n\ntemplate <typename T, size_t N>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h","rank":8,"score":193078.93656213454},{"content":"class SetArgumentPointeeAction<N, Proto, true> {\n\n public:\n\n // Constructs an action that sets the variable pointed to by the\n\n // N-th function argument to 'proto'. Both ProtocolMessage and\n\n // proto2::Message have the CopyFrom() method, so the same\n\n // implementation works for both.\n\n explicit SetArgumentPointeeAction(const Proto& proto) : proto_(new Proto) {\n\n proto_->CopyFrom(proto);\n\n }\n\n\n\n template <typename Result, typename ArgumentTuple>\n\n void Perform(const ArgumentTuple& args) const {\n\n CompileAssertTypesEqual<void, Result>();\n\n ::std::tr1::get<N>(args)->CopyFrom(*proto_);\n\n }\n\n\n\n private:\n\n const internal::linked_ptr<Proto> proto_;\n\n\n\n GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction);\n\n};\n\n\n\n// Implements the InvokeWithoutArgs(f) action. The template argument\n\n// FunctionImpl is the implementation type of f, which can be either a\n\n// function pointer or a functor. InvokeWithoutArgs(f) can be used as an\n\n// Action<F> as long as f's type is compatible with F (i.e. f can be\n\n// assigned to a tr1::function<F>).\n\ntemplate <typename FunctionImpl>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h","rank":9,"score":192327.82539473395},{"content":"from pymesh.meshutils import remove_isolated_vertices_raw\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\nimport unittest\n\n\n\nclass RemoveIsolatedVerticesTest(TestCase):\n\n def test_no_isolated_vertices(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\n\n\n\n self.assert_array_equal(vertices, out_vertices);\n\n self.assert_array_equal(faces, out_faces);\n\n self.assertEqual(0, info[\"num_vertex_removed\"]);\n\n self.assert_array_equal(np.arange(3), info[\"ori_vertex_index\"]);\n\n\n\n def test_multiple_isolated_vertices(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n [ 1.0, 1.0, 0.0],\n\n [ 0.0, 0.0, 1.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 4]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assertTrue(np.all(out_faces < len(out_vertices)));\n\n self.assertEqual(2, info[\"num_vertex_removed\"]);\n\n self.assert_array_equal([0, 1, 4], info[\"ori_vertex_index\"]);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py","rank":10,"score":188200.2718730756},{"content":"from pymesh.meshutils import remove_duplicated_vertices_raw\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\n\n\nclass RemoveDuplicatedVerticesTest(TestCase):\n\n def test_no_removal(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces);\n\n\n\n self.assert_array_equal(vertices, out_vertices);\n\n self.assert_array_equal(faces, out_faces);\n\n\n\n def test_simple_removal(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 2, 3],\n\n [1, 2, 3]\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assert_array_equal([[0, 1, 2], [0, 1, 2]], out_faces);\n\n\n\n def test_tiny_triangle(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 0.1, 0.0, 0.0],\n\n [ 0.0, 0.1, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces, 1.0);\n\n\n\n self.assertEqual(1, len(out_vertices));\n\n self.assert_array_equal([[0, 0, 0]], out_faces);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py","rank":11,"score":188200.2718730756},{"content":"from pymesh.meshutils import remove_duplicated_faces_raw\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\nimport numpy.testing\n\nimport unittest\n\n\n\nclass RemoveDuplicatedFacesTest(TestCase):\n\n def test_double_faces(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 0],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\n\n\n\n # Vertices are left alone.\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n self.assertEqual(0, len(out_faces));\n\n\n\n def test_triple_faces(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 0],\n\n [0, 2, 1],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\n\n\n\n # Vertices are left alone.\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n self.assertEqual(1, len(out_faces));\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py","rank":12,"score":188137.88021668085},{"content":"def remove_isolated_vertices(mesh):\n\n \"\"\" Wrapper function of :func:`remove_isolated_vertices_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``infomation`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``infomation``:\n\n\n\n * ``num_vertex_removed``: Number of vertex removed.\n\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\n\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\n\n vertex array.\n\n \"\"\"\n\n if mesh.num_voxels == 0:\n\n vertices, faces, info = remove_isolated_vertices_raw(\n\n mesh.vertices, mesh.faces);\n\n output_mesh = form_mesh(vertices, faces);\n\n else:\n\n vertices, voxels, info = remove_isolated_vertices_raw(\n\n mesh.vertices, mesh.voxels);\n\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_isolated_vertices.py","rank":13,"score":179180.68844942682},{"content":"def remove_duplicated_vertices(mesh, tol=1e-12, importance=None):\n\n \"\"\" Wrapper function of :func:`remove_duplicated_vertices_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\n\n considered as duplicates. Default is ``1e-12``.\n\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\n\n When discarding duplicates, the vertex with the highest importance\n\n value will be kept.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``num_vertex_merged``: number of vertex merged.\n\n * ``index_map``: An array that maps input vertex index to output vertex index.\n\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\n\n\n\n \"\"\"\n\n if mesh.num_voxels == 0:\n\n vertices, faces, info = remove_duplicated_vertices_raw(\n\n mesh.vertices, mesh.faces, tol, importance);\n\n out_mesh = form_mesh(vertices, faces);\n\n else:\n\n vertices, voxels, info = remove_duplicated_vertices_raw(\n\n mesh.vertices, mesh.voxels, tol, importance);\n\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_vertices.py","rank":14,"score":179175.8209691525},{"content":"def remove_duplicated_faces(mesh, fins_only=False):\n\n \"\"\" Wrapper function of :func:`remove_duplicated_faces_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n fins_only (``bool``): If set, only remove fins.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``ori_face_index``: An array of original face indices. I.e. face\n\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\n\n the input vertices.\n\n\n\n \"\"\"\n\n vertices, faces, info = remove_duplicated_faces_raw(\n\n mesh.vertices, mesh.faces, fins_only);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_faces.py","rank":15,"score":179109.8826717141},{"content":"def remove_isolated_vertices_raw(vertices, elements):\n\n \"\"\" Remove isolated vertices.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n elements (``numpy.ndarray``): Element array with one face per row.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array with one vertex per row.\n\n * ``output_elements``: Output element array with one element per row.\n\n * ``infomation``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``infomation``:\n\n\n\n * ``num_vertex_removed``: Number of vertex removed.\n\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\n\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\n\n vertex array.\n\n \"\"\"\n\n remover = IsolatedVertexRemoval(vertices, elements);\n\n num_removed = remover.run();\n\n vertices = remover.get_vertices();\n\n elements = remover.get_faces();\n\n info = {\n\n \"num_vertex_removed\": num_removed,\n\n \"ori_vertex_index\": remover.get_ori_vertex_indices().ravel(),\n\n };\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_isolated_vertices.py","rank":16,"score":177012.8742194173},{"content":"def remove_duplicated_vertices_raw(vertices, elements, tol=1e-12, importance=None):\n\n \"\"\" Merge duplicated vertices into a single vertex.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertices in row major.\n\n elements (``numpy.ndarray``): Elements in row major.\n\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\n\n considered as duplicates. Default is ``1e-12``.\n\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\n\n When discarding duplicates, the vertex with the highest importance\n\n value will be kept.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertices in row major.\n\n * ``output_elements``: Output elements in row major.\n\n * ``information``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``num_vertex_merged``: number of vertex merged.\n\n * ``index_map``: An array that maps input vertex index to output vertex index.\n\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\n\n\n\n \"\"\"\n\n\n\n remover = DuplicatedVertexRemoval(vertices, elements);\n\n if importance is not None:\n\n if (len(importance) != len(vertices)):\n\n raise RuntimeError(\n\n \"Vertex importance must be of the same size as vertices\");\n\n remover.set_importance_level(importance);\n\n num_merged = remover.run(tol);\n\n new_vertices = remover.get_vertices();\n\n new_elements = remover.get_faces();\n\n info = {\n\n \"num_vertex_merged\": num_merged,\n\n \"index_map\": remover.get_index_map().ravel(),\n\n };\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_vertices.py","rank":17,"score":177002.1766115245},{"content":"def remove_duplicated_faces_raw(vertices, faces, fins_only=False):\n\n \"\"\" Remove duplicated faces.\n\n\n\n Duplicated faces are defined as faces consist of the same set of vertices.\n\n Depending on the face orientation. A special case of duplicated faces is\n\n a fin. A fin is defined as two duplicated faces with opposite orientaiton.\n\n\n\n If fins_only is set to True, all fins in the mesh are removed. The output\n\n mesh could still contain duplicated faces but no fins.\n\n\n\n If fins_only is not True, all duplicated faces will be removed. There could\n\n be two caes:\n\n\n\n If there is a dominant orientation, that is more than half of the faces are\n\n consistently orientated, and fins_only is False, one face with the dominant\n\n orientation will be kept while all other faces are removed.\n\n\n\n If there is no dominant orientation, i.e. half of the face are positively\n\n orientated and the other half is negatively orientated, all faces are\n\n discarded.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n faces (``numpy.ndarray``): Face array with one face per row.\n\n fins_only (``bool``): If set, only remove fins.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array, one vertex per row.\n\n * ``output_faces``: Output face array, one face per row.\n\n * ``information``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``ori_face_index``: An array of original face indices. I.e. face\n\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\n\n the input vertices.\n\n\n\n \"\"\"\n\n remover = FinFaceRemoval(vertices, faces);\n\n if fins_only: remover.set_fins_only();\n\n remover.run();\n\n info = {\n\n \"ori_face_index\": remover.get_face_indices().ravel(),\n\n };\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_faces.py","rank":18,"score":176943.22692630906},{"content":"struct LosslessArithmeticConvertibleImpl<kBool, bool, kBool, bool>\n\n : public true_type {}; // NOLINT\n\n\n\n// Converting bool to any integer type is lossless.\n\ntemplate <typename To>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":19,"score":176404.70298680058},{"content":"struct TupleElement<true, 3, GTEST_10_TUPLE_(T) > {\n\n typedef T3 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":20,"score":173698.6093473549},{"content":"struct TupleElement<true, 0, GTEST_10_TUPLE_(T) > {\n\n typedef T0 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":21,"score":173694.37077978894},{"content":"class RemoveDuplicatedVerticesTest(TestCase):\n\n def test_no_removal(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces);\n\n\n\n self.assert_array_equal(vertices, out_vertices);\n\n self.assert_array_equal(faces, out_faces);\n\n\n\n def test_simple_removal(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 2, 3],\n\n [1, 2, 3]\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assert_array_equal([[0, 1, 2], [0, 1, 2]], out_faces);\n\n\n\n def test_tiny_triangle(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 0.1, 0.0, 0.0],\n\n [ 0.0, 0.1, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces, 1.0);\n\n\n\n self.assertEqual(1, len(out_vertices));\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py","rank":22,"score":172803.42166140876},{"content":"class RemoveIsolatedVerticesTest(TestCase):\n\n def test_no_isolated_vertices(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\n\n\n\n self.assert_array_equal(vertices, out_vertices);\n\n self.assert_array_equal(faces, out_faces);\n\n self.assertEqual(0, info[\"num_vertex_removed\"]);\n\n self.assert_array_equal(np.arange(3), info[\"ori_vertex_index\"]);\n\n\n\n def test_multiple_isolated_vertices(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n [ 1.0, 1.0, 0.0],\n\n [ 0.0, 0.0, 1.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 4]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assertTrue(np.all(out_faces < len(out_vertices)));\n\n self.assertEqual(2, info[\"num_vertex_removed\"]);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py","rank":23,"score":172803.42166140876},{"content":"class RemoveDuplicatedFacesTest(TestCase):\n\n def test_double_faces(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 0],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\n\n\n\n # Vertices are left alone.\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n self.assertEqual(0, len(out_faces));\n\n\n\n def test_triple_faces(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 0],\n\n [0, 2, 1],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\n\n\n\n # Vertices are left alone.\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py","rank":24,"score":172725.0973377171},{"content":" def count(self):\n","file_path":"dependencies/PyMesh/python/pymesh/timethis.py","rank":25,"score":165494.86218172975},{"content":"// Implements the Return() action.\n\nclass ReturnVoidAction {\n\n public:\n\n // Allows Return() to be used in any void-returning function.\n\n template <typename Result, typename ArgumentTuple>\n\n static void Perform(const ArgumentTuple&) {\n\n CompileAssertTypesEqual<void, Result>();\n\n }\n\n};\n\n\n\n// Implements the polymorphic ReturnRef(x) action, which can be used\n\n// in any function that returns a reference to the type of x,\n\n// regardless of the argument types.\n\ntemplate <typename T>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h","rank":26,"score":163507.3723252705},{"content":" def test_no_removal(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces);\n\n\n\n self.assert_array_equal(vertices, out_vertices);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py","rank":27,"score":161213.72251137815},{"content":"struct RemoveConst<const T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n\n\n#if defined(_MSC_VER) && _MSC_VER < 1400\n\n// This is the only specialization that allows VC++ 7.1 to remove const in\n\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\n\n// and thus needs to be conditionally compiled.\n\ntemplate <typename T, size_t N>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gtest/gtest.h","rank":28,"score":160599.48669645196},{"content":"class SetErrnoAndReturnAction {\n\n public:\n\n SetErrnoAndReturnAction(int errno_value, T result)\n\n : errno_(errno_value),\n\n result_(result) {}\n\n template <typename Result, typename ArgumentTuple>\n\n Result Perform(const ArgumentTuple& /* args */) const {\n\n errno = errno_;\n\n return result_;\n\n }\n\n\n\n private:\n\n const int errno_;\n\n const T result_;\n\n\n\n GTEST_DISALLOW_ASSIGN_(SetErrnoAndReturnAction);\n\n};\n\n\n\n#endif // !GTEST_OS_WINDOWS_MOBILE\n\n\n\n// Implements the SetArgumentPointee<N>(x) action for any function\n\n// whose N-th argument (0-based) is a pointer to x's type. The\n\n// template parameter kIsProto is true iff type A is ProtocolMessage,\n\n// proto2::Message, or a sub-class of those.\n\ntemplate <size_t N, typename A, bool kIsProto>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h","rank":29,"score":160577.15156848638},{"content":" def test_no_isolated_vertices(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\n\n\n\n self.assert_array_equal(vertices, out_vertices);\n\n self.assert_array_equal(faces, out_faces);\n\n self.assertEqual(0, info[\"num_vertex_removed\"]);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py","rank":30,"score":159030.44837376065},{"content":" def test_simple_removal(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 2, 3],\n\n [1, 2, 3]\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces);\n\n\n\n self.assertEqual(3, len(out_vertices));\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py","rank":31,"score":159005.8308355033},{"content":" def test_triple_faces(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 0],\n\n [0, 2, 1],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\n\n\n\n # Vertices are left alone.\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py","rank":32,"score":158951.30004626734},{"content":" def test_double_faces(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 0],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\n\n\n\n # Vertices are left alone.\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py","rank":33,"score":158951.30004626734},{"content":"struct RemoveConst<const T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n\n\n#if defined(_MSC_VER) && _MSC_VER < 1400\n\n// This is the only specialization that allows VC++ 7.1 to remove const in\n\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\n\n// and thus needs to be conditionally compiled.\n\ntemplate <typename T, size_t N>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/fused-src/gtest/gtest.h","rank":34,"score":158939.79869137998},{"content":"struct RemoveConstFromKey {\n\n typedef T type;\n\n};\n\n\n\n// Partially specialized to remove constness from std::pair<const K, V>.\n\ntemplate <typename K, typename V>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":35,"score":157690.31438549873},{"content":" def test_multiple_isolated_vertices(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n [ 1.0, 1.0, 0.0],\n\n [ 0.0, 0.0, 1.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 4]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assertTrue(np.all(out_faces < len(out_vertices)));\n\n self.assertEqual(2, info[\"num_vertex_removed\"]);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py","rank":36,"score":156884.4117008424},{"content":" const char* e2,\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest_pred_impl.h","rank":37,"score":156306.2747611113},{"content":" const char* e1,\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest_pred_impl.h","rank":38,"score":156304.51867493588},{"content":"class DefaultValue<void> {\n\n public:\n\n static bool Exists() { return true; }\n\n static void Get() {}\n\n};\n\n\n\n// Points to the user-set default value for type T.\n\ntemplate <typename T>\n\nconst T* DefaultValue<T>::value_ = NULL;\n\n\n\n// Points to the user-set default value for type T&.\n\ntemplate <typename T>\n\nT* DefaultValue<T&>::address_ = NULL;\n\n\n\n// Implement this interface to define an action for function type F.\n\ntemplate <typename F>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h","rank":39,"score":156102.75792150287},{"content":"class EqHelper<true> {\n\n public:\n\n // We define two overloaded versions of Compare(). The first\n\n // version will be picked when the second argument to ASSERT_EQ() is\n\n // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or\n\n // EXPECT_EQ(false, a_bool).\n\n template <typename T1, typename T2>\n\n static AssertionResult Compare(\n\n const char* expected_expression,\n\n const char* actual_expression,\n\n const T1& expected,\n\n const T2& actual,\n\n // The following line prevents this overload from being considered if T2\n\n // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr)\n\n // expands to Compare(\"\", \"\", NULL, my_ptr), which requires a conversion\n\n // to match the Secret* in the other overload, which would otherwise make\n\n // this template match better.\n\n typename EnableIf<!is_pointer<T2>::value>::type* = 0) {\n\n return CmpHelperEQ(expected_expression, actual_expression, expected,\n\n actual);\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest.h","rank":40,"score":156055.310743908},{"content":"struct RemoveConst<T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n#endif\n\n\n\n// A handy wrapper around RemoveConst that works when the argument\n\n// T depends on template parameters.\n\n#define GTEST_REMOVE_CONST_(T) \\\n\n typename ::testing::internal::RemoveConst<T>::type\n\n\n\n// Turns const U&, U&, const U, and U all into U.\n\n#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \\\n\n GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))\n\n\n\n// Adds reference to a type if it is not a reference type,\n\n// otherwise leaves it unchanged. This is the same as\n\n// tr1::add_reference, which is not widely available yet.\n\ntemplate <typename T>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h","rank":41,"score":154985.0898034813},{"content":"struct IteratorTraits<const T*> {\n\n typedef T value_type;\n\n};\n\n\n\n#if GTEST_OS_WINDOWS\n\n# define GTEST_PATH_SEP_ \"\\\\\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 1\n\n// The biggest signed integer type the compiler supports.\n\ntypedef __int64 BiggestInt;\n\n#else\n\n# define GTEST_PATH_SEP_ \"/\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 0\n\ntypedef long long BiggestInt; // NOLINT\n\n#endif // GTEST_OS_WINDOWS\n\n\n\n// Utilities for char.\n\n\n\n// isspace(int ch) and friends accept an unsigned char or EOF. char\n\n// may be signed, depending on the compiler (or compiler flags).\n\n// Therefore we need to cast a char to unsigned char before calling\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gtest/gtest.h","rank":42,"score":150804.25901849993},{"content":"struct LosslessArithmeticConvertibleImpl<kBool, bool, kInteger, To>\n\n : public true_type {}; // NOLINT\n\n\n\n// Converting bool to any floating-point type is lossless.\n\ntemplate <typename To>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":43,"score":150772.85746387483},{"content":"struct LosslessArithmeticConvertibleImpl<kInteger, From, kBool, bool>\n\n : public false_type {}; // NOLINT\n\n\n\n// Converting an integer to another non-bool integer is lossless iff\n\n// the target type's range encloses the source type's range.\n\ntemplate <typename From, typename To>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":44,"score":150772.85746387483},{"content":"struct RemoveConstFromKey<std::pair<const K, V> > {\n\n typedef std::pair<K, V> type;\n\n};\n\n\n\n// Mapping from booleans to types. Similar to boost::bool_<kValue> and\n\n// std::integral_constant<bool, kValue>.\n\ntemplate <bool kValue>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gmock/gmock.h","rank":45,"score":150344.85191801187},{"content":"struct RemoveConst { typedef T type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h","rank":46,"score":149843.85728368102},{"content":"struct LosslessArithmeticConvertibleImpl<kFloatingPoint, From, kBool, bool>\n\n : public false_type {}; // NOLINT\n\n\n\n// Converting a floating-point to an integer is lossy.\n\ntemplate <typename From, typename To>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":47,"score":149299.04359523824},{"content":"struct LosslessArithmeticConvertibleImpl<kBool, bool, kFloatingPoint, To>\n\n : public true_type {}; // NOLINT\n\n\n\n// Converting an integer to bool is lossy.\n\ntemplate <typename From>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h","rank":48,"score":149299.04359523824},{"content":"struct IteratorTraits<const T*> {\n\n typedef T value_type;\n\n};\n\n\n\n#if GTEST_OS_WINDOWS\n\n# define GTEST_PATH_SEP_ \"\\\\\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 1\n\n// The biggest signed integer type the compiler supports.\n\ntypedef __int64 BiggestInt;\n\n#else\n\n# define GTEST_PATH_SEP_ \"/\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 0\n\ntypedef long long BiggestInt; // NOLINT\n\n#endif // GTEST_OS_WINDOWS\n\n\n\n// Utilities for char.\n\n\n\n// isspace(int ch) and friends accept an unsigned char or EOF. char\n\n// may be signed, depending on the compiler (or compiler flags).\n\n// Therefore we need to cast a char to unsigned char before calling\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/fused-src/gtest/gtest.h","rank":49,"score":148927.4874565561},{"content":"import PyMesh\n\n\n\ndef compute_winding_number(mesh, queries, engine=\"auto\"):\n\n \"\"\" Compute winding number with respect to `mesh` at `queries`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): The mesh for which winding number is evaluated.\n\n queries (:class:`numpy.ndarray`): N by 3 matrix of query points at which\n\n winding number is evaluated.\n\n\n\n Returns:\n\n A list of size N, represent the winding nubmers at each query points in\n\n order.\n\n \"\"\"\n\n assert(mesh.dim == 3);\n\n assert(mesh.vertex_per_face == 3);\n\n\n\n if engine == \"auto\":\n\n engine = \"igl\";\n\n\n\n engine = PyMesh.WindingNumberEngine.create(engine);\n\n engine.set_mesh(mesh.vertices, mesh.faces);\n\n winding_numbers = engine.run(queries).ravel();\n\n\n\n return winding_numbers;\n","file_path":"dependencies/PyMesh/python/pymesh/winding_number.py","rank":50,"score":148272.1032585054},{"content":"class BuiltInDefaultValue<const T> {\n\n public:\n\n static bool Exists() { return BuiltInDefaultValue<T>::Exists(); }\n\n static T Get() { return BuiltInDefaultValue<T>::Get(); }\n\n};\n\n\n\n// This partial specialization defines the default values for pointer\n\n// types.\n\ntemplate <typename T>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h","rank":51,"score":148222.01874080085},{"content":"struct RemoveConst<const T> { typedef T type; }; // NOLINT\n\n\n\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\n\n// definition to fail to remove the const in 'const int[3]' and 'const\n\n// char[3][4]'. The following specialization works around the bug.\n\ntemplate <typename T, size_t N>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gtest/gtest.h","rank":52,"score":148153.76797452325},{"content":" def test_face_edge_touch(self):\n\n mesh_1 = generate_box_mesh(\n\n np.array([0, 0, 0]), np.array([1, 1, 1]));\n\n\n\n rot = Quaternion.fromData(\n\n np.array([1, 0, 1], dtype=float),\n\n np.array([0, 0, 1], dtype=float));\n\n mesh_2 = form_mesh(\n\n np.dot(rot.to_matrix(), mesh_1.vertices.T).T +\n\n np.array([0.5, 0.5, 1.0]),\n\n mesh_1.faces);\n\n\n\n mesh = merge_meshes((mesh_1, mesh_2));\n\n output_mesh = resolve_self_intersection(mesh);\n\n\n\n self.assert_self_intersect(mesh);\n\n self.assert_no_self_intersect(output_mesh);\n","file_path":"dependencies/PyMesh/python/pymesh/tests/test_selfintersection.py","rank":53,"score":147775.58661375986},{"content":" def test_face_edge_touch(self):\n\n mesh_1 = generate_box_mesh(\n\n np.array([0, 0, 0]), np.array([1, 1, 1]));\n\n\n\n rot = Quaternion.fromData(\n\n np.array([1, 0, 1], dtype=float),\n\n np.array([0, 0, 1], dtype=float));\n\n mesh_2 = form_mesh(\n\n np.dot(rot.to_matrix(), mesh_1.vertices.T).T +\n\n np.array([0.5, 0.5, 1.0]),\n\n mesh_1.faces);\n\n\n\n mesh = boolean(mesh_1, mesh_2, \"union\", \"igl\");\n\n\n\n self.assertEqual(17, mesh.num_vertices);\n\n self.assertEqual(30, mesh.num_faces);\n\n self.assertFalse(mesh.is_manifold());\n\n self.assertTrue(mesh.is_closed());\n","file_path":"dependencies/PyMesh/python/pymesh/tests/test_boolean.py","rank":54,"score":147775.58661375986},{"content":" def get_edge_adj_faces(self, mesh):\n\n self.assertEqual(3, mesh.vertex_per_face);\n\n edge_adj_faces = {};\n\n for i, f in enumerate(mesh.faces):\n\n f = sorted(f);\n\n edges = [(f[0], f[1]),\n\n (f[1], f[2]),\n\n (f[0], f[2])];\n\n for e in edges:\n\n if e in edge_adj_faces:\n\n edge_adj_faces[e].append(i);\n\n else:\n\n edge_adj_faces[e] = [i];\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/tests/test_selfintersection.py","rank":55,"score":147775.58661375986},{"content":"struct RemoveConst<const T> { typedef T type; }; // NOLINT\n\n\n\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\n\n// definition to fail to remove the const in 'const int[3]' and 'const\n\n// char[3][4]'. The following specialization works around the bug.\n\ntemplate <typename T, size_t N>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/fused-src/gtest/gtest.h","rank":56,"score":146629.3355975274},{"content":"class UniversalTersePrinter<const char*> {\n\n public:\n\n static void Print(const char* str, ::std::ostream* os) {\n\n if (str == NULL) {\n\n *os << \"NULL\";\n\n } else {\n\n UniversalPrint(string(str), os);\n\n }\n\n }\n\n};\n\ntemplate <>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest-printers.h","rank":57,"score":146421.74286273657},{"content":"class UniversalTersePrinter<const wchar_t*> {\n\n public:\n\n static void Print(const wchar_t* str, ::std::ostream* os) {\n\n if (str == NULL) {\n\n *os << \"NULL\";\n\n } else {\n\n UniversalPrint(::std::wstring(str), os);\n\n }\n\n }\n\n};\n\n#endif\n\n\n\ntemplate <>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest-printers.h","rank":58,"score":146421.74286273657},{"content":"import sys\n\nimport os.path\n\n\n\npackage_dir = os.path.abspath(os.path.dirname(__file__));\n\nsys.path.append(os.path.join(package_dir, \"lib\"));\n\n#sys.path.append(os.path.join(package_dir, \"swig\"));\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/PyMeshSetting.py","rank":59,"score":146383.2425916887},{"content":"import PyMesh\n\nimport numpy as np\n\n\n\ndef is_colinear(v0, v1, v2):\n\n \"\"\" Return true if ``v0``, ``v1`` and ``v2`` are colinear.\n\n Colinear check is done using exact predicates.\n\n\n\n Args:\n\n v0 (``numpy.ndarray``): vector of size 2 or 3.\n\n v1 (``numpy.ndarray``): vector of size 2 or 3.\n\n v2 (``numpy.ndarray``): vector of size 2 or 3.\n\n\n\n Return:\n\n A boolean indicating whether ``v0``, ``v1`` and ``v2`` are colinear.\n\n \"\"\"\n\n dim = len(v0);\n\n if dim == 2:\n\n return PyMesh.is_colinear_2D(v0, v1, v2);\n\n elif dim == 3:\n\n return PyMesh.is_colinear_3D(v0, v1, v2);\n\n else:\n\n raise NotImplementedError(\"Supported dimention {}\".format(dim));\n\n\n\ndef get_degenerated_faces_raw(vertices, faces):\n\n \"\"\" Return indices of degenerated faces.\n\n A face is degenerated if all its 3 corners are colinear.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex matrix.\n\n faces (``numpy.ndarray``): Face matrix.\n\n\n\n Returns:\n\n A ``numpy.ndarray`` of indices of degenerated faces.\n\n \"\"\"\n\n return np.array(PyMesh.get_degenerated_faces(vertices, faces));\n\n\n\ndef get_degenerated_faces(mesh):\n\n \"\"\" A thin wrapper for :py:func:`get_degenerated_faces_raw`.\n\n \"\"\"\n\n return get_degenerated_faces_raw(mesh.vertices, mesh.faces);\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/face_utils.py","rank":60,"score":144730.4603721215},{"content":" def test_tiny_triangle(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 0.1, 0.0, 0.0],\n\n [ 0.0, 0.1, 0.0],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\n\n vertices, faces, 1.0);\n\n\n\n self.assertEqual(1, len(out_vertices));\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py","rank":61,"score":143167.52518257557},{"content":"class GTEST_API_ Matcher<const StringPiece&>\n\n : public internal::MatcherBase<const StringPiece&> {\n\n public:\n\n Matcher() {}\n\n\n\n explicit Matcher(const MatcherInterface<const StringPiece&>* impl)\n\n : internal::MatcherBase<const StringPiece&>(impl) {}\n\n\n\n // Allows the user to write str instead of Eq(str) sometimes, where\n\n // str is a string object.\n\n Matcher(const internal::string& s); // NOLINT\n\n\n\n // Allows the user to write \"foo\" instead of Eq(\"foo\") sometimes.\n\n Matcher(const char* s); // NOLINT\n\n\n\n // Allows the user to pass StringPieces directly.\n\n Matcher(StringPiece s); // NOLINT\n\n};\n\n\n\ntemplate <>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-matchers.h","rank":62,"score":143021.94550902475},{"content":"from pymesh.TestCase import TestCase\n\n\n\nfrom pymesh import compute_winding_number\n\nfrom pymesh.meshutils import generate_box_mesh\n\n\n\nimport numpy as np\n\nfrom numpy.linalg import norm\n\n\n\nclass WindingNumberTest(TestCase):\n\n def test_cube(self):\n\n mesh = generate_box_mesh(\n\n np.array([0, 0, 0]), np.array([1, 1, 1]));\n\n queries = np.array([\n\n [-1, 0, 0],\n\n [0.0, 0.0, 0.0],\n\n [0.5, 0.0, 0.0],\n\n [0.5, 0.5, 0.0],\n\n [0.5, 0.5, 0.5],\n\n ]);\n\n\n\n winding_numbers = compute_winding_number(mesh, queries);\n\n\n\n self.assertEqual(len(queries), len(winding_numbers));\n\n self.assertAlmostEqual(0.0, norm(winding_numbers -\n\n np.array([0, 0.125, 0.25, 0.5, 1])));\n","file_path":"dependencies/PyMesh/python/pymesh/tests/test_winding_number.py","rank":63,"score":142994.89403569326},{"content":"from PyMesh import DegeneratedTriangleRemoval\n\nfrom ..meshio import form_mesh\n\n\n\ndef remove_degenerated_triangles_raw(vertices, faces, num_iterations=5):\n\n \"\"\" Remove degenerated triangles.\n\n\n\n Degenerated faces are faces with collinear vertices. It is impossible to\n\n compute face normal for them. This method get rid of all degenerated faces.\n\n No new vertices will be introduced. Only connectivity is changed.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n faces (``numpy.ndarray``): Face array with one triangle per row.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array, one vertex per row.\n\n * ``output_faces``: Output face array, one face per row.\n\n * ``info``: Additional information dict.\n\n\n\n The following fields are defined in the ``info`` dict:\n\n * ``ori_face_indices``: index array that maps each output face\n\n to an input face that contains it.\n\n \"\"\"\n\n if (faces.shape[1] != 3):\n\n raise RuntimeError(\"Faces are not triangles!\");\n\n remover = DegeneratedTriangleRemoval(vertices, faces);\n\n remover.run(num_iterations);\n\n info = {\n\n \"ori_face_indices\": remover.get_ori_face_indices().squeeze(),\n\n };\n\n return remover.get_vertices(), remover.get_faces(), info;\n\n\n\ndef remove_degenerated_triangles(mesh, num_iterations=5):\n\n \"\"\" Wrapper function of :func:`remove_degenerated_triangles_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``mesh``: A :py:class:`Mesh` object without degenerated triangles.\n\n * ``info``: Additional information dictionary.\n\n \"\"\"\n\n vertices, faces, info = remove_degenerated_triangles_raw(\n\n mesh.vertices, mesh.faces, num_iterations);\n\n return form_mesh(vertices, faces), info;\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_degenerated_triangles.py","rank":64,"score":142907.18085226027},{"content":"from math import radians\n\n\n\nfrom .. import timethis\n\nfrom ..meshio import form_mesh\n\nfrom PyMesh import ObtuseTriangleRemoval\n\n\n\nclass ObtuseTriangleRemover:\n\n def __init__(self, vertices, faces):\n\n if vertices.shape[1] != 3:\n\n raise RuntimeError(\"Only 3D meshes are supported\");\n\n if faces.shape[1] != 3:\n\n raise RuntimeError(\"Only triangular meshes are supported\");\n\n\n\n self.vertices = vertices;\n\n self.faces = faces;\n\n\n\n def remove_obtuse_triangles(self, max_angle, max_num_iterations):\n\n max_angle = radians(max_angle);\n\n remover = ObtuseTriangleRemoval(self.vertices, self.faces);\n\n num_triangles_split = remover.run(\n\n max_angle, max_num_iterations);\n\n self.vertices = remover.get_vertices();\n\n self.faces = remover.get_faces();\n\n return num_triangles_split;\n\n\n\ndef remove_obtuse_triangles_raw(vertices, faces,\n\n max_angle=120,\n\n max_iterations=5):\n\n \"\"\" Remove all obtuse triangles.\n\n\n\n Args:\n\n vetices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n faces (``numpy.ndarray``): Face array with one face per row.\n\n max_angle (``float``): (optional) Maximum obtuse angle in degrees\n\n allowed. All triangle with larger internal angle would be split.\n\n Default is 120 degrees.\n\n max_iterations (``int``): (optional) Number of iterations to run before\n\n quitting. Default is 5.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array with one vertex per row.\n\n * ``output_faces``: Output face array with one face per row.\n\n * ``information``: A ``dict`` of additinal informations.\n\n\n\n The following fields are defiend in ``information``:\n\n\n\n * ``num_triangle_split``: number of triangles split.\n\n \"\"\"\n\n if max_angle < 90:\n\n raise RuntimeError(\"max_angle must be greater than 90 degrees\");\n\n\n\n remover = ObtuseTriangleRemover(vertices, faces);\n\n num_split = remover.remove_obtuse_triangles(max_angle, max_iterations);\n\n info = {\n\n \"num_triangle_split\": num_split\n\n };\n\n return remover.vertices, remover.faces, info;\n\n\n\ndef remove_obtuse_triangles(mesh, max_angle=120, max_iterations=5):\n\n \"\"\" Wrapper function of :func:`remove_obtuse_triangles_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n max_angle (``float``): (optional) Maximum obtuse angle in degrees\n\n allowed. All triangle with larger internal angle would be split.\n\n Default is 120 degrees.\n\n max_iterations (``int``): (optional) Number of iterations to run before\n\n quitting. Default is 5.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information`` (:class:`dict`): A ``dict`` of additinal informations.\n\n\n\n The following fields are defiend in ``information``:\n\n\n\n * ``num_triangle_split``: number of triangles split.\n\n \"\"\"\n\n vertices, faces, info = remove_obtuse_triangles_raw(\n\n mesh.vertices, mesh.faces, max_angle, max_iterations);\n\n return form_mesh(vertices, faces), info;\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/remove_obtuse_triangles.py","rank":65,"score":142907.18085226027},{"content":"import logging\n\nimport math\n\nimport numpy as np\n\n\n\nfrom .. import timethis\n\nfrom ..meshio import form_mesh\n\n\n\nfrom PyMesh import ShortEdgeRemoval, IsolatedVertexRemoval, FinFaceRemoval\n\n\n\nclass _EdgeCollapser(object):\n\n \"\"\" Wrapper class for C++ ShortEdgeRemoval class.\n\n\n\n Attributes:\n\n input_mesh: The input mesh.\n\n vertices (2D array): the output vertices.\n\n faces (2D array): the output faces.\n\n\n\n Examples:\n\n A common usage::\n\n\n\n collapser = _EdgeCollapser.create(mesh);\n\n collapser.keep_features();\n\n collapser.collapse(0.1, None);\n\n print(collapser.vertices);\n\n print(collapser.faces);\n\n \"\"\"\n\n @classmethod\n\n def create(cls, mesh):\n\n return _EdgeCollapser(mesh);\n\n\n\n @classmethod\n\n def create_raw(cls, vertices, faces):\n\n mesh = form_mesh(vertices, faces);\n\n return _EdgeCollapser(mesh);\n\n\n\n def __init__(self, mesh):\n\n self.input_mesh = mesh;\n\n if self.input_mesh.vertex_per_face != 3:\n\n raise RuntimeError(\"Only triangle mesh is supported! \"\n\n \"Input has {} vertices per face\".format(\n\n self.input_mesh.vertex_per_face));\n\n self.logger = logging.getLogger(__name__);\n\n self.importance = None;\n\n\n\n @timethis\n\n def keep_features(self):\n\n \"\"\" Preserve sharp edges and boundaries.\n\n \"\"\"\n\n if not self.input_mesh.has_attribute(\"vertex_dihedral_angle\"):\n\n self.input_mesh.add_attribute(\"vertex_dihedral_angle\");\n\n dihedral_angle = self.input_mesh.get_attribute(\"vertex_dihedral_angle\");\n\n self.importance = np.round(dihedral_angle * 4 / math.pi).astype(int);\n\n\n\n # keep boundary.\n\n bd_vertices = self.input_mesh.boundary_vertices;\n\n self.importance[bd_vertices] = 10;\n\n\n\n @timethis\n\n def collapse(self, abs_threshold, rel_threshold):\n\n \"\"\" Note this method remove all edges with length less than threshold.\n\n This could result in a non-manifold mesh.\n\n \"\"\"\n\n min_edge_length = abs_threshold;\n\n if rel_threshold is not None:\n\n ave_edge_len = self.__get_ave_edge_length()\n\n min_edge_length = rel_threshold * ave_edge_len;\n\n self.logger.info(\"Minimum edge threshold: {:.3}\".format(min_edge_length));\n\n\n\n num_collapsed = self.__collapse_C(min_edge_length);\n\n self.logger.info(\"{} edges collapsed\".format(num_collapsed));\n\n\n\n self.__remove_fin_faces();\n\n self.__remove_isolated_vertices();\n\n\n\n return num_collapsed;\n\n\n\n def __get_ave_edge_length(self):\n\n if not self.input_mesh.has_attribute(\"edge_length\"):\n\n self.input_mesh.add_attribute(\"edge_length\");\n\n edge_lengths = self.input_mesh.get_attribute(\"edge_length\");\n\n return np.mean(edge_lengths);\n\n\n\n @timethis\n\n def __collapse_C(self, min_edge_length):\n\n collapser = ShortEdgeRemoval(\n\n self.input_mesh.vertices, self.input_mesh.faces);\n\n if self.importance is not None:\n\n if len(self.importance) != self.input_mesh.num_vertices:\n\n raise RuntimeError(\"Invalid importance size!\");\n\n collapser.set_importance(self.importance);\n\n num_collapsed = collapser.run(min_edge_length);\n\n self.vertices = collapser.get_vertices();\n\n self.faces = collapser.get_faces();\n\n self.face_index_map = collapser.get_face_indices().ravel();\n\n return num_collapsed;\n\n\n\n @timethis\n\n def __remove_isolated_vertices(self):\n\n remover = IsolatedVertexRemoval(self.vertices, self.faces);\n\n remover.run();\n\n self.vertices = remover.get_vertices();\n\n self.faces = remover.get_faces();\n\n\n\n @timethis\n\n def __remove_fin_faces(self):\n\n remover = FinFaceRemoval(self.vertices, self.faces);\n\n remover.run();\n\n self.vertices = remover.get_vertices();\n\n self.faces = remover.get_faces();\n\n\n\ndef collapse_short_edges_raw(vertices, faces, abs_threshold=0.0,\n\n rel_threshold=None, preserve_feature=False):\n\n \"\"\" Convenient function for collapsing short edges.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array. One vertex per row.\n\n faces (``numpy.ndarray``): Face array. One face per row.\n\n abs_threshold (``float``): (optional) All edge with length below or\n\n equal to this threshold will be collapsed. This value is ignored\n\n if ``rel_thresold`` is not ``None``.\n\n rel_threashold (``float``): (optional) Relative edge length threshold\n\n based on average edge length. e.g. ``rel_threshold=0.1`` means all\n\n edges with length less than ``0.1 * ave_edge_length`` will be collapsed.\n\n preserve_feature (``bool``): True if shape features should be preserved.\n\n Default is false.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array. One vertex per row.\n\n * ``output_faces``: Output face array. One face per row.\n\n * ``information``: A ``dict`` of additional informations.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``num_edge_collapsed``: Number of edge collapsed.\n\n * ``source_face_index``: An array tracks the source of each output face.\n\n That is face ``i`` of the ``output_faces`` comes from face\n\n ``source_face_index[i]`` of the input faces.\n\n \"\"\"\n\n collapser = _EdgeCollapser.create_raw(vertices, faces);\n\n if preserve_feature:\n\n collapser.keep_features();\n\n num_collapsed = collapser.collapse(abs_threshold, rel_threshold);\n\n info = {\n\n \"num_edge_collapsed\": num_collapsed,\n\n \"source_face_index\": collapser.face_index_map\n\n }\n\n return collapser.vertices, collapser.faces, info;\n\n\n\ndef collapse_short_edges(mesh,\n\n abs_threshold=0.0, rel_threshold=None, preserve_feature=False):\n\n \"\"\" Wrapper function of :func:`collapse_short_edges_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n abs_threshold (``float``): (optional) All edge with length below or\n\n equal to this threshold will be collapsed. This value is ignored\n\n if ``rel_thresold`` is not ``None``.\n\n rel_threashold (``float``): (optional) Relative edge length threshold\n\n based on average edge length. e.g. ``rel_threshold=0.1`` means all\n\n edges with length less than ``0.1 * ave_edge_length`` will be collapsed.\n\n preserve_feature (``bool``): True if shape features should be preserved.\n\n Default is false.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_Mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\n\n\n\n The following attribute are defined:\n\n\n\n * ``face_sources``: The index of input source face of each output face.\n\n\n\n The following fields are defined in ``information``:\n\n\n\n * ``num_edge_collapsed``: Number of edge collapsed.\n\n \"\"\"\n\n vertices, faces, info = collapse_short_edges_raw(mesh.vertices, mesh.faces,\n\n abs_threshold, rel_threshold, preserve_feature);\n\n result = form_mesh(vertices, faces);\n\n result.add_attribute(\"face_sources\")\n\n result.set_attribute(\"face_sources\", info[\"source_face_index\"]);\n\n del info[\"source_face_index\"]\n\n return result, info;\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/collapse_short_edges.py","rank":66,"score":142904.76909236884},{"content":"import numpy as np\n\n\n\nfrom ..meshio import form_mesh\n\nfrom PyMesh import LongEdgeRemoval\n\n\n\ndef split_long_edges_raw(vertices, faces, max_edge_length):\n\n \"\"\" Split long edges.\n\n\n\n Args:\n\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\n\n faces (``numpy.ndarray``): Face array with one face per row.\n\n max_edge_length (``float``): Maximum edge length allowed. All edges\n\n longer than this will be split.\n\n\n\n Returns:\n\n 3 values are returned.\n\n\n\n * ``output_vertices``: Output vertex array with one vertex per row.\n\n * ``output_faces``: Output face array with one face per row.\n\n * ``information``: A dummy ``dict`` that is currently empty.\n\n It is here to ensure consistent interface across the module.\n\n \"\"\"\n\n remover = LongEdgeRemoval(vertices, faces);\n\n remover.run(max_edge_length);\n\n vertices = remover.get_vertices();\n\n faces = remover.get_faces();\n\n return vertices, faces, {};\n\n\n\ndef split_long_edges(mesh, max_edge_length):\n\n \"\"\" Wrapper function of :func:`split_long_edges_raw`.\n\n\n\n Args:\n\n mesh (:class:`Mesh`): Input mesh.\n\n max_edge_length (``float``): Maximum edge length allowed. All edges\n\n longer than this will be split.\n\n\n\n Returns:\n\n 2 values are returned.\n\n\n\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\n\n * ``information``: A dummy ``dict`` that is currently empty.\n\n It is here to ensure consistent interface across the module.\n\n \"\"\"\n\n vertices, faces, info = split_long_edges_raw(\n\n mesh.vertices, mesh.faces, max_edge_length);\n\n return form_mesh(vertices, faces), info;\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/split_long_edges.py","rank":67,"score":142904.76909236884},{"content":"class SetArgumentPointeeAction<N, Proto, true> {\n\n public:\n\n // Constructs an action that sets the variable pointed to by the\n\n // N-th function argument to 'proto'. Both ProtocolMessage and\n\n // proto2::Message have the CopyFrom() method, so the same\n\n // implementation works for both.\n\n explicit SetArgumentPointeeAction(const Proto& proto) : proto_(new Proto) {\n\n proto_->CopyFrom(proto);\n\n }\n\n\n\n template <typename Result, typename ArgumentTuple>\n\n void Perform(const ArgumentTuple& args) const {\n\n CompileAssertTypesEqual<void, Result>();\n\n ::std::tr1::get<N>(args)->CopyFrom(*proto_);\n\n }\n\n\n\n private:\n\n const internal::linked_ptr<Proto> proto_;\n\n\n\n GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction);\n\n};\n\n\n\n// Implements the InvokeWithoutArgs(f) action. The template argument\n\n// FunctionImpl is the implementation type of f, which can be either a\n\n// function pointer or a functor. InvokeWithoutArgs(f) can be used as an\n\n// Action<F> as long as f's type is compatible with F (i.e. f can be\n\n// assigned to a tr1::function<F>).\n\ntemplate <typename FunctionImpl>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gmock/gmock.h","rank":68,"score":141969.78061047563},{"content":"class FinFaceRemoval {\n\n public:\n\n FinFaceRemoval(const MatrixFr& vertices, const MatrixIr& faces);\n\n\n\n public:\n\n /**\n\n * Only remove fins. A fin is defined as a pair of faces with identical\n\n * vertices but opposite orientaiton.\n\n */\n\n void set_fins_only() {\n\n m_fins_only = true;\n\n }\n\n\n\n /**\n\n * When set_fins_only() is called:\n\n * Only fins are removed.\n\n *\n\n * Otherwise:\n\n *\n\n * For each set of duplicated faces, if there is a majority orientation,\n","file_path":"dependencies/PyMesh/tools/MeshUtils/FinFaceRemoval.h","rank":69,"score":140498.4946578307},{"content":"class LongEdgeRemoval {\n\n public:\n\n LongEdgeRemoval(const MatrixFr& vertices, const MatrixIr& faces) :\n\n m_vertices(vertices), m_faces(faces) {}\n\n\n\n public:\n\n void run(Float max_length, bool recursive=true);\n\n\n\n MatrixFr get_vertices() const { return m_vertices; }\n\n MatrixIr get_faces() const { return m_faces; }\n\n\n\n private:\n\n void init_edge_map();\n\n void split_long_edges(Float max_length);\n\n size_t retriangulate();\n\n void triangulate_chain(\n\n std::vector<VectorI>& faces,\n\n const std::vector<size_t>& chain,\n\n size_t v0_idx, size_t v1_idx, size_t v2_idx);\n\n std::vector<size_t> get_vertex_chain_around_triangle(\n","file_path":"dependencies/PyMesh/tools/MeshUtils/LongEdgeRemoval.h","rank":70,"score":140473.4816764854},{"content":"class ShortEdgeRemoval {\n\n public:\n\n ShortEdgeRemoval(const MatrixFr& vertices, const MatrixIr& faces);\n\n\n\n public:\n\n /**\n\n * Importance is an integer value per vertex. The vertex with higher\n\n * importance would keep its position during edge collapsing. Mid-point\n\n * is used when collapsing edge with same importance at each end.\n\n *\n\n * Vertex with negative importance is not considered during collapsing.\n\n * i.e. they will keep their original location.\n\n */\n\n void set_importance(const VectorI& importance) {\n\n m_importance = importance;\n\n }\n\n /**\n\n * Remove all edges that <= thresold\n\n * If thresold=0, remove all degenerated edges.\n\n */\n","file_path":"dependencies/PyMesh/tools/MeshUtils/ShortEdgeRemoval.h","rank":71,"score":140473.4816764854},{"content":"class GTEST_API_ Matcher<const internal::string&>\n\n : public internal::MatcherBase<const internal::string&> {\n\n public:\n\n Matcher() {}\n\n\n\n explicit Matcher(const MatcherInterface<const internal::string&>* impl)\n\n : internal::MatcherBase<const internal::string&>(impl) {}\n\n\n\n // Allows the user to write str instead of Eq(str) sometimes, where\n\n // str is a string object.\n\n Matcher(const internal::string& s); // NOLINT\n\n\n\n // Allows the user to write \"foo\" instead of Eq(\"foo\") sometimes.\n\n Matcher(const char* s); // NOLINT\n\n};\n\n\n\ntemplate <>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-matchers.h","rank":72,"score":140117.35613349773},{"content":"from pymesh import remove_degenerated_triangles\n\nfrom pymesh import remove_degenerated_triangles_raw\n\nfrom pymesh import generate_box_mesh\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\n\n\nclass RemoveDegeneratedTrianglesTest(TestCase):\n\n def test_no_degeneracy(self):\n\n mesh = generate_box_mesh(np.ones(3)*-1, np.ones(3));\n\n\n\n result, info = remove_degenerated_triangles(mesh);\n\n self.assertEqual(8, result.num_vertices);\n\n self.assertEqual(12, result.num_faces);\n\n self.assert_array_equal(np.arange(12),\n\n sorted(info[\"ori_face_indices\"]));\n\n\n\n def test_simple(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n ]);\n\n faces = np.array([\n\n [0, 1, 2]\n\n ], dtype=int);\n\n\n\n result_vertices, result_faces, info = \\\n\n remove_degenerated_triangles_raw(vertices, faces);\n\n\n\n self.assertEqual(0, len(result_vertices));\n\n self.assertEqual(0, len(result_faces));\n\n self.assertEqual(0, len(info[\"ori_face_indices\"]));\n\n\n\n def multiple_degeneracies(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n [2.0, 0.0, 0.0],\n\n [4.0, 0.0, 0.0],\n\n [5.0, 0.0, 0.0],\n\n [0.0, 2.0, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 5],\n\n [1, 2, 5],\n\n [2, 3, 5],\n\n [3, 4, 5],\n\n [5, 6, 0],\n\n ], dtype=int);\n\n\n\n result_vertices, result_faces, info = \\\n\n remove_degenerated_triangles_raw(vertices, faces);\n\n\n\n self.assertEqual(6, len(result_vertices));\n\n self.assertEqual(4, len(result_faces));\n\n self.assertEqual(4, len(info[\"ori_face_indices\"]));\n\n self.assertTrue(np.all(info[\"ori_face_indices\"] == 4));\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_degenerated_triangles.py","rank":73,"score":137996.76178373647},{"content":"from pymesh.meshutils import remove_obtuse_triangles_raw\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\nimport numpy.testing\n\nimport unittest\n\n\n\nclass ObtuseTriangleRemovalTest(TestCase):\n\n def test_nothing_to_remove(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\n\n\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n numpy.testing.assert_array_equal(faces, out_faces);\n\n\n\n def test_single_obtuse_triangle(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.1, 0.0],\n\n [-1.0, 0.1, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2]\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\n\n self.assertEqual(2, len(out_faces));\n\n\n\n def test_double_obtuse_triangles_1(self):\n\n \"\"\" Check two obtuse triangles sharing the longest edges.\n\n \"\"\"\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.1, 0.0],\n\n [-1.0, 0.1, 0.0],\n\n [ 0.0, 0.2, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 3],\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\n\n self.assertEqual(4, len(out_faces));\n\n\n\n def test_double_obtuse_triangles_2(self):\n\n \"\"\" Check two obtuse triangles that does not share the longest edge.\n\n \"\"\"\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.1, 0.0],\n\n [-1.0, 0.1, 0.0],\n\n [ 5.0, 0.2, 0.0],\n\n ]);\n\n\n\n faces = np.array([\n\n [0, 1, 2],\n\n [2, 1, 3],\n\n ]);\n\n\n\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\n\n self.assertLess(4, len(out_faces));\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_obtuse_triangles.py","rank":74,"score":137996.76178373647},{"content":"from pymesh import generate_icosphere\n\nfrom pymesh.meshutils import collapse_short_edges_raw, collapse_short_edges\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\nimport numpy.testing\n\nimport unittest\n\n\n\nclass CollapseShortEdgesTest(TestCase):\n\n def test_simple_3D(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n [0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([[0, 1, 2]], dtype=int);\n\n\n\n out_vertices, out_faces, info = collapse_short_edges_raw(\n\n vertices, faces, 0.1);\n\n\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n numpy.testing.assert_array_equal(faces, out_faces);\n\n self.assertEqual(0, info[\"num_edge_collapsed\"]);\n\n self.assert_array_equal([0], info[\"source_face_index\"]);\n\n\n\n def test_collapse_all_3D(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n [0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([[0, 1, 2]], dtype=int);\n\n\n\n out_vertices, out_faces, info = collapse_short_edges_raw(\n\n vertices, faces, 1.1);\n\n\n\n self.assertEqual(0, len(out_vertices));\n\n self.assertEqual(0, len(out_faces));\n\n self.assertEqual(1, info[\"num_edge_collapsed\"]);\n\n self.assert_array_equal([], info[\"source_face_index\"]);\n\n\n\n def test_slim_triangles(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n [-0.1,-0.1,-0.1],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [0, 3, 1],\n\n [0, 2, 3],\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = collapse_short_edges_raw(\n\n vertices, faces, 0.5);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assertEqual(1, len(out_faces));\n\n self.assertEqual(1, info[\"num_edge_collapsed\"]);\n\n self.assert_array_equal([0], info[\"source_face_index\"]);\n\n\n\n def test_degenerated_triangles(self):\n\n vertices = np.array([\n\n [ 0.0, 0.0, 0.0],\n\n [ 1.0, 0.0, 0.0],\n\n [ 0.0, 1.0, 0.0],\n\n [-0.1,-0.1,-0.1],\n\n ], dtype=float);\n\n faces = np.array([\n\n [0, 1, 2],\n\n [0, 3, 1],\n\n [0, 2, 3],\n\n [0, 0, 1],\n\n [2, 3, 3]\n\n ], dtype=int);\n\n\n\n out_vertices, out_faces, info = collapse_short_edges_raw(\n\n vertices, faces, 0.5);\n\n\n\n self.assertEqual(3, len(out_vertices));\n\n self.assertEqual(1, len(out_faces));\n\n self.assertEqual(3, info[\"num_edge_collapsed\"]);\n\n self.assert_array_equal([0], info[\"source_face_index\"]);\n\n\n\n def test_simple_2D(self):\n\n vertices = np.array([\n\n [0.0, 0.0],\n\n [1.0, 0.0],\n\n [0.0, 1.0],\n\n ], dtype=float);\n\n faces = np.array([[0, 1, 2]], dtype=int);\n\n\n\n out_vertices, out_faces, info = collapse_short_edges_raw(\n\n vertices, faces, 0.1);\n\n\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n numpy.testing.assert_array_equal(faces, out_faces);\n\n self.assertEqual(0, info[\"num_edge_collapsed\"]);\n\n self.assert_array_equal([0], info[\"source_face_index\"]);\n\n\n\n def test_tiny_mesh(self):\n\n \"\"\" Edge collapse performed on a tiny icosphere.\n\n \"\"\"\n\n mesh = generate_icosphere(1e-6, [0.0, 0.0, 0.0]);\n\n mesh, info = collapse_short_edges(mesh, 0.1);\n\n\n\n self.assertTrue(\"face_sources\" in mesh.attribute_names);\n\n self.assertEqual(0, mesh.num_vertices);\n\n self.assertEqual(0, mesh.num_faces);\n\n self.assertEqual(0, mesh.num_voxels);\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_collapse_short_edges.py","rank":75,"score":137994.43002778868},{"content":"from pymesh.meshutils import split_long_edges_raw\n\nfrom pymesh.TestCase import TestCase\n\n\n\nimport numpy as np\n\nimport numpy.testing\n\nimport unittest\n\n\n\nclass SplitLongEdgeTest(TestCase):\n\n def test_nothing_to_split(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n [0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([[0, 1, 2]], dtype=int);\n\n\n\n out_vertices, out_faces, __ = split_long_edges_raw(vertices, faces, 2.0);\n\n\n\n numpy.testing.assert_array_equal(vertices, out_vertices);\n\n numpy.testing.assert_array_equal(faces, out_faces);\n\n\n\n def test_simple_split(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n [0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([[0, 1, 2]], dtype=int);\n\n\n\n out_vertices, out_faces, __ = split_long_edges_raw(vertices, faces, 1.4);\n\n\n\n self.assertEqual(2, len(out_faces));\n\n\n\n def test_multiple_splits(self):\n\n vertices = np.array([\n\n [0.0, 0.0, 0.0],\n\n [1.0, 0.0, 0.0],\n\n [0.0, 1.0, 0.0],\n\n ], dtype=float);\n\n faces = np.array([[0, 1, 2]], dtype=int);\n\n\n\n out_vertices, out_faces, __ = split_long_edges_raw(vertices, faces, 0.9);\n\n\n\n self.assertLess(2, len(out_faces));\n\n\n","file_path":"dependencies/PyMesh/python/pymesh/meshutils/tests/test_split_long_edges.py","rank":76,"score":137994.43002778868},{"content":"struct TupleElement<true, 6, GTEST_10_TUPLE_(T) > {\n\n typedef T6 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":77,"score":136699.71416766342},{"content":"struct TupleElement<true, 9, GTEST_10_TUPLE_(T) > {\n\n typedef T9 type;\n\n};\n\n\n\n} // namespace gtest_internal\n\n\n\ntemplate <>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":78,"score":136699.71416766342},{"content":"struct TupleElement<true, 2, GTEST_10_TUPLE_(T) > {\n\n typedef T2 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":79,"score":136699.71416766342},{"content":"struct TupleElement<true, 4, GTEST_10_TUPLE_(T) > {\n\n typedef T4 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":80,"score":136699.71416766342},{"content":"struct TupleElement<true, 8, GTEST_10_TUPLE_(T) > {\n\n typedef T8 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":81,"score":136699.71416766342},{"content":"struct TupleElement<true, 1, GTEST_10_TUPLE_(T) > {\n\n typedef T1 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":82,"score":136699.71416766342},{"content":"struct TupleElement<true, 7, GTEST_10_TUPLE_(T) > {\n\n typedef T7 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":83,"score":136699.71416766342},{"content":"struct TupleElement<true, 5, GTEST_10_TUPLE_(T) > {\n\n typedef T5 type;\n\n};\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":84,"score":136699.71416766342},{"content":"#!/usr/bin/env python\n\n\n\n\"\"\"\n\nRemove isolated vertices.\n\n\"\"\"\n\n\n\nimport argparse\n\nimport pymesh\n\n\n\ndef parse_args():\n\n parser = argparse.ArgumentParser(description=__doc__);\n\n parser.add_argument(\"input_mesh\", help=\"input mesh\");\n\n parser.add_argument(\"output_mesh\", help=\"output mesh\");\n\n return parser.parse_args();\n\n\n\ndef main():\n\n args = parse_args();\n\n mesh = pymesh.load_mesh(args.input_mesh);\n\n mesh, __ = pymesh.remove_isolated_vertices(mesh);\n\n pymesh.save_mesh(args.output_mesh, mesh);\n\n\n\nif __name__ == \"__main__\":\n\n main();\n","file_path":"dependencies/PyMesh/scripts/remove_isolated_vertices.py","rank":85,"score":135990.69832397185},{"content":"#!/usr/bin/env python\n\n\n\n\"\"\"\n\nRemove duplicated faces.\n\n\"\"\"\n\n\n\nimport argparse\n\nimport pymesh\n\n\n\ndef parse_args():\n\n parser = argparse.ArgumentParser(description=__doc__);\n\n parser.add_argument(\"input_mesh\", help=\"input mesh\");\n\n parser.add_argument(\"output_mesh\", help=\"output mesh\");\n\n return parser.parse_args();\n\n\n\ndef main():\n\n args = parse_args();\n\n mesh = pymesh.load_mesh(args.input_mesh);\n\n mesh, __ = pymesh.remove_duplicated_faces(mesh);\n\n pymesh.save_mesh(args.output_mesh, mesh);\n\n\n\nif __name__ == \"__main__\":\n\n main();\n","file_path":"dependencies/PyMesh/scripts/remove_duplicated_faces.py","rank":86,"score":135923.8668951813},{"content":"class ActionResultHolder<void> : public UntypedActionResultHolderBase {\n\n public:\n\n void GetValueAndDelete() const { delete this; }\n\n\n\n virtual void PrintAsActionResult(::std::ostream* /* os */) const {}\n\n\n\n // Performs the given mock function's default action and returns NULL;\n\n template <typename F>\n\n static ActionResultHolder* PerformDefaultAction(\n\n const FunctionMockerBase<F>* func_mocker,\n\n const typename Function<F>::ArgumentTuple& args,\n\n const string& call_description) {\n\n func_mocker->PerformDefaultAction(args, call_description);\n\n return NULL;\n\n }\n\n\n\n // Performs the given action and returns NULL.\n\n template <typename F>\n\n static ActionResultHolder* PerformAction(\n\n const Action<F>& action,\n\n const typename Function<F>::ArgumentTuple& args) {\n\n action.Perform(args);\n\n return NULL;\n\n }\n\n};\n\n\n\n// The base of the function mocker class for the given function type.\n\n// We put the methods in this class instead of its child to avoid code\n\n// bloat.\n\ntemplate <typename F>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-spec-builders.h","rank":87,"score":134917.78135907854},{"content":"class FaceEdgeRatioAttribute : public MeshAttribute {\n\n public:\n\n FaceEdgeRatioAttribute(const std::string& name) : MeshAttribute(name) {}\n\n virtual ~FaceEdgeRatioAttribute() {}\n\n\n\n public:\n\n virtual void compute_from_mesh(Mesh& mesh);\n\n};\n\n\n\n}\n","file_path":"dependencies/PyMesh/src/Attributes/FaceEdgeRatioAttribute.h","rank":88,"score":134254.6943782677},{"content":"struct ByRef { typedef const T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h","rank":89,"score":134185.72993183482},{"content":"class FinFaceRemovalTest : public TestBase {\n\n protected:\n\n void check_face_index(const MatrixIr& in_faces, \n\n const MatrixIr& out_faces, \n\n const VectorI& face_indices) {\n\n const size_t num_output_faces = out_faces.rows();\n\n ASSERT_EQ(num_output_faces, face_indices.size());\n\n for (size_t i=0; i<num_output_faces; i++) {\n\n const VectorI& input_f = in_faces.row(face_indices[i]);\n\n const VectorI& output_f = out_faces.row(i);\n\n ASSERT_TRUE((input_f.array() == output_f.array()).all());\n\n }\n\n }\n\n};\n\n\n\nTEST_F(FinFaceRemovalTest, zero_fin) {\n\n MatrixF vertices(4, 3);\n\n vertices << 0.0, 0.0, 0.0,\n\n 1.0, 0.0, 0.0,\n\n 0.0, 1.0, 0.0,\n","file_path":"dependencies/PyMesh/tests/tools/MeshUtils/FinFaceRemovalTest.h","rank":90,"score":131340.86002013297},{"content":"class ShortEdgeRemovalTest : public TestBase {\n\n protected:\n\n void check_num_faces_left(const ShortEdgeRemoval& remover, size_t n) {\n\n MatrixIr faces_left = remover.get_faces();\n\n ASSERT_EQ(n, faces_left.rows());\n\n }\n\n\n\n void check_face_validity(const ShortEdgeRemoval& remover) {\n\n MatrixFr vertices_left = remover.get_vertices();\n\n MatrixIr faces_left = remover.get_faces();\n\n const size_t num_vertices = vertices_left.rows();\n\n for (size_t i=0; i<faces_left.size(); i++) {\n\n ASSERT_LT(faces_left.data()[i], num_vertices);\n\n }\n\n }\n\n\n\n /**\n\n * Assert that v is either one of vertices left unchanged or is within\n\n * threshold away from a vertex after remove short edges.\n\n */\n","file_path":"dependencies/PyMesh/tests/tools/MeshUtils/ShortEdgeRemovalTest.h","rank":91,"score":131317.47737472053},{"content":"class LongEdgeRemovalTest : public TestBase {\n\n protected:\n\n void ASSERT_NO_LONG_EDGES(\n\n const MatrixFr& vertices,\n\n const MatrixIr& faces,\n\n Float max_length) {\n\n const size_t num_faces = faces.rows();\n\n const size_t vertex_per_face = faces.cols();\n\n for (size_t i=0; i<num_faces; i++) {\n\n const auto& f = faces.row(i);\n\n for (size_t j=0; j<vertex_per_face; j++) {\n\n const auto& curr_v = vertices.row(f[j]);\n\n const auto& next_v = vertices.row(f[(j+1)%vertex_per_face]);\n\n ASSERT_LT((curr_v - next_v).norm(), max_length);\n\n }\n\n }\n\n }\n\n};\n\n\n\nTEST_F(LongEdgeRemovalTest, SingleTraingle) {\n","file_path":"dependencies/PyMesh/tests/tools/MeshUtils/LongEdgeRemovalTest.h","rank":92,"score":131317.47737472053},{"content":"class FooTest : public ::testing::TestWithParam<const char*> {\n\n // You can implement all the usual class fixture members here.\n\n};\n\n\n\n// Then, use the TEST_P macro to define as many parameterized tests\n\n// for this fixture as you want. The _P suffix is for \"parameterized\"\n\n// or \"pattern\", whichever you prefer to think.\n\n\n\nTEST_P(FooTest, DoesBlah) {\n\n // Inside a test, access the test parameter with the GetParam() method\n\n // of the TestWithParam<T> class:\n\n EXPECT_TRUE(foo.Blah(GetParam()));\n\n ...\n\n}\n\n\n\nTEST_P(FooTest, HasBlahBlah) {\n\n ...\n\n}\n\n\n\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest-param-test.h","rank":93,"score":130984.04053206244},{"content":"struct LosslessArithmeticConvertibleImpl<kBool, bool, kBool, bool>\n\n : public true_type {}; // NOLINT\n\n\n\n// Converting bool to any integer type is lossless.\n\ntemplate <typename To>\n","file_path":"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gmock/gmock.h","rank":94,"score":129459.77695740892},{"content":" m_edge_adj_faces.insert(Triplet(f[1], f[2]), i);\n\n m_edge_adj_faces.insert(Triplet(f[2], f[0]), i);\n\n m_edge_adj_faces.insert(Triplet(f[0], f[1]), i);\n\n }\n\n}\n\n\n\nvoid EdgeSplitter::set_all_faces_as_valid() {\n\n const size_t num_faces = m_faces.rows();\n\n m_face_is_valid = std::vector<bool>(num_faces, true);\n\n}\n\n\n\nvoid EdgeSplitter::split_edge(const VectorI& edge,\n\n const std::vector<size_t>& adj_faces, Float max_length) {\n\n const auto v0 = m_vertices.row(edge[0]);\n\n const auto v1 = m_vertices.row(edge[1]);\n\n Float length = (v0 - v1).norm();\n\n if (length < max_length) return;\n\n\n\n bool adj_faces_are_valid = true;\n\n for (auto fi : adj_faces) {\n","file_path":"dependencies/PyMesh/tools/MeshUtils/EdgeSplitter.cpp","rank":96,"score":71.99981793630346},{"content":" finalize_geometry();\n\n if (num_split == 0) break;\n\n } while (count < max_iterations);\n\n\n\n return total_num_split;\n\n}\n\n\n\nvoid ObtuseTriangleRemoval::clear_intermediate_data() {\n\n m_face_angles.clear();\n\n m_opp_vertices.clear();\n\n m_edges.clear();\n\n m_valid.clear();\n\n m_edge_faces.clear();\n\n m_new_vertices.clear();\n\n m_new_faces.clear();\n\n}\n\n\n\nvoid ObtuseTriangleRemoval::set_all_faces_as_valid() {\n\n m_valid = std::vector<bool>(m_faces.rows(), true);\n\n}\n","file_path":"dependencies/PyMesh/tools/MeshUtils/ObtuseTriangleRemoval.cpp","rank":98,"score":68.61228084790953}],"string":"[\n {\n \"content\": \"struct RemoveConst<const T[N]> {\\n\\n typedef typename RemoveConst<T>::type type[N];\\n\\n};\\n\\n\\n\\n#if defined(_MSC_VER) && _MSC_VER < 1400\\n\\n// This is the only specialization that allows VC++ 7.1 to remove const in\\n\\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\\n\\n// and thus needs to be conditionally compiled.\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 0,\n \"score\": 207685.25908348509\n },\n {\n \"content\": \"struct IteratorTraits<const T*> {\\n\\n typedef T value_type;\\n\\n};\\n\\n\\n\\n#if GTEST_OS_WINDOWS\\n\\n# define GTEST_PATH_SEP_ \\\"\\\\\\\\\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 1\\n\\n// The biggest signed integer type the compiler supports.\\n\\ntypedef __int64 BiggestInt;\\n\\n#else\\n\\n# define GTEST_PATH_SEP_ \\\"/\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 0\\n\\ntypedef long long BiggestInt; // NOLINT\\n\\n#endif // GTEST_OS_WINDOWS\\n\\n\\n\\n// Utilities for char.\\n\\n\\n\\n// isspace(int ch) and friends accept an unsigned char or EOF. char\\n\\n// may be signed, depending on the compiler (or compiler flags).\\n\\n// Therefore we need to cast a char to unsigned char before calling\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 1,\n \"score\": 198337.06117945336\n },\n {\n \"content\": \" def __remove_isolated_vertices(self):\\n\\n remover = IsolatedVertexRemoval(self.vertices, self.faces);\\n\\n remover.run();\\n\\n self.vertices = remover.get_vertices();\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/collapse_short_edges.py\",\n \"rank\": 2,\n \"score\": 197144.73063755667\n },\n {\n \"content\": \" def __remove_fin_faces(self):\\n\\n remover = FinFaceRemoval(self.vertices, self.faces);\\n\\n remover.run();\\n\\n self.vertices = remover.get_vertices();\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/collapse_short_edges.py\",\n \"rank\": 3,\n \"score\": 197083.35693862228\n },\n {\n \"content\": \"struct RemoveConstFromKey<std::pair<const K, V> > {\\n\\n typedef std::pair<K, V> type;\\n\\n};\\n\\n\\n\\n// Mapping from booleans to types. Similar to boost::bool_<kValue> and\\n\\n// std::integral_constant<bool, kValue>.\\n\\ntemplate <bool kValue>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 4,\n \"score\": 195270.02050562316\n },\n {\n \"content\": \"import numpy as np\\n\\nfrom PyMesh import IsolatedVertexRemoval\\n\\nfrom ..meshio import form_mesh\\n\\n\\n\\ndef remove_isolated_vertices_raw(vertices, elements):\\n\\n \\\"\\\"\\\" Remove isolated vertices.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n elements (``numpy.ndarray``): Element array with one face per row.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array with one vertex per row.\\n\\n * ``output_elements``: Output element array with one element per row.\\n\\n * ``infomation``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``infomation``:\\n\\n\\n\\n * ``num_vertex_removed``: Number of vertex removed.\\n\\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\\n\\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\\n\\n vertex array.\\n\\n \\\"\\\"\\\"\\n\\n remover = IsolatedVertexRemoval(vertices, elements);\\n\\n num_removed = remover.run();\\n\\n vertices = remover.get_vertices();\\n\\n elements = remover.get_faces();\\n\\n info = {\\n\\n \\\"num_vertex_removed\\\": num_removed,\\n\\n \\\"ori_vertex_index\\\": remover.get_ori_vertex_indices().ravel(),\\n\\n };\\n\\n return vertices, elements, info;\\n\\n\\n\\ndef remove_isolated_vertices(mesh):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_isolated_vertices_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``infomation`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``infomation``:\\n\\n\\n\\n * ``num_vertex_removed``: Number of vertex removed.\\n\\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\\n\\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\\n\\n vertex array.\\n\\n \\\"\\\"\\\"\\n\\n if mesh.num_voxels == 0:\\n\\n vertices, faces, info = remove_isolated_vertices_raw(\\n\\n mesh.vertices, mesh.faces);\\n\\n output_mesh = form_mesh(vertices, faces);\\n\\n else:\\n\\n vertices, voxels, info = remove_isolated_vertices_raw(\\n\\n mesh.vertices, mesh.voxels);\\n\\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\\n\\n return output_mesh, info;\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_isolated_vertices.py\",\n \"rank\": 5,\n \"score\": 194833.20345134335\n },\n {\n \"content\": \"import numpy as np\\n\\nfrom PyMesh import DuplicatedVertexRemoval\\n\\nfrom ..meshio import form_mesh\\n\\n\\n\\ndef remove_duplicated_vertices_raw(vertices, elements, tol=1e-12, importance=None):\\n\\n \\\"\\\"\\\" Merge duplicated vertices into a single vertex.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertices in row major.\\n\\n elements (``numpy.ndarray``): Elements in row major.\\n\\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\\n\\n considered as duplicates. Default is ``1e-12``.\\n\\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\\n\\n When discarding duplicates, the vertex with the highest importance\\n\\n value will be kept.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertices in row major.\\n\\n * ``output_elements``: Output elements in row major.\\n\\n * ``information``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``num_vertex_merged``: number of vertex merged.\\n\\n * ``index_map``: An array that maps input vertex index to output vertex index.\\n\\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n\\n\\n remover = DuplicatedVertexRemoval(vertices, elements);\\n\\n if importance is not None:\\n\\n if (len(importance) != len(vertices)):\\n\\n raise RuntimeError(\\n\\n \\\"Vertex importance must be of the same size as vertices\\\");\\n\\n remover.set_importance_level(importance);\\n\\n num_merged = remover.run(tol);\\n\\n new_vertices = remover.get_vertices();\\n\\n new_elements = remover.get_faces();\\n\\n info = {\\n\\n \\\"num_vertex_merged\\\": num_merged,\\n\\n \\\"index_map\\\": remover.get_index_map().ravel(),\\n\\n };\\n\\n return new_vertices, new_elements, info;\\n\\n\\n\\ndef remove_duplicated_vertices(mesh, tol=1e-12, importance=None):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_duplicated_vertices_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\\n\\n considered as duplicates. Default is ``1e-12``.\\n\\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\\n\\n When discarding duplicates, the vertex with the highest importance\\n\\n value will be kept.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``num_vertex_merged``: number of vertex merged.\\n\\n * ``index_map``: An array that maps input vertex index to output vertex index.\\n\\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n if mesh.num_voxels == 0:\\n\\n vertices, faces, info = remove_duplicated_vertices_raw(\\n\\n mesh.vertices, mesh.faces, tol, importance);\\n\\n out_mesh = form_mesh(vertices, faces);\\n\\n else:\\n\\n vertices, voxels, info = remove_duplicated_vertices_raw(\\n\\n mesh.vertices, mesh.voxels, tol, importance);\\n\\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\\n\\n\\n\\n return out_mesh, info;\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_vertices.py\",\n \"rank\": 6,\n \"score\": 194833.20345134335\n },\n {\n \"content\": \"import numpy as np\\n\\nfrom PyMesh import FinFaceRemoval\\n\\nfrom ..meshio import form_mesh\\n\\n\\n\\ndef remove_duplicated_faces_raw(vertices, faces, fins_only=False):\\n\\n \\\"\\\"\\\" Remove duplicated faces.\\n\\n\\n\\n Duplicated faces are defined as faces consist of the same set of vertices.\\n\\n Depending on the face orientation. A special case of duplicated faces is\\n\\n a fin. A fin is defined as two duplicated faces with opposite orientaiton.\\n\\n\\n\\n If fins_only is set to True, all fins in the mesh are removed. The output\\n\\n mesh could still contain duplicated faces but no fins.\\n\\n\\n\\n If fins_only is not True, all duplicated faces will be removed. There could\\n\\n be two caes:\\n\\n\\n\\n If there is a dominant orientation, that is more than half of the faces are\\n\\n consistently orientated, and fins_only is False, one face with the dominant\\n\\n orientation will be kept while all other faces are removed.\\n\\n\\n\\n If there is no dominant orientation, i.e. half of the face are positively\\n\\n orientated and the other half is negatively orientated, all faces are\\n\\n discarded.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n faces (``numpy.ndarray``): Face array with one face per row.\\n\\n fins_only (``bool``): If set, only remove fins.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array, one vertex per row.\\n\\n * ``output_faces``: Output face array, one face per row.\\n\\n * ``information``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``ori_face_index``: An array of original face indices. I.e. face\\n\\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\\n\\n the input vertices.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n remover = FinFaceRemoval(vertices, faces);\\n\\n if fins_only: remover.set_fins_only();\\n\\n remover.run();\\n\\n info = {\\n\\n \\\"ori_face_index\\\": remover.get_face_indices().ravel(),\\n\\n };\\n\\n return remover.get_vertices(), remover.get_faces(), info;\\n\\n\\n\\ndef remove_duplicated_faces(mesh, fins_only=False):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_duplicated_faces_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n fins_only (``bool``): If set, only remove fins.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``ori_face_index``: An array of original face indices. I.e. face\\n\\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\\n\\n the input vertices.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n vertices, faces, info = remove_duplicated_faces_raw(\\n\\n mesh.vertices, mesh.faces, fins_only);\\n\\n return form_mesh(vertices, faces), info;\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_faces.py\",\n \"rank\": 7,\n \"score\": 194768.67109983676\n },\n {\n \"content\": \"struct RemoveConst<const T> { typedef T type; }; // NOLINT\\n\\n\\n\\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\\n\\n// definition to fail to remove the const in 'const int[3]' and 'const\\n\\n// char[3][4]'. The following specialization works around the bug.\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 8,\n \"score\": 193078.93656213454\n },\n {\n \"content\": \"class SetArgumentPointeeAction<N, Proto, true> {\\n\\n public:\\n\\n // Constructs an action that sets the variable pointed to by the\\n\\n // N-th function argument to 'proto'. Both ProtocolMessage and\\n\\n // proto2::Message have the CopyFrom() method, so the same\\n\\n // implementation works for both.\\n\\n explicit SetArgumentPointeeAction(const Proto& proto) : proto_(new Proto) {\\n\\n proto_->CopyFrom(proto);\\n\\n }\\n\\n\\n\\n template <typename Result, typename ArgumentTuple>\\n\\n void Perform(const ArgumentTuple& args) const {\\n\\n CompileAssertTypesEqual<void, Result>();\\n\\n ::std::tr1::get<N>(args)->CopyFrom(*proto_);\\n\\n }\\n\\n\\n\\n private:\\n\\n const internal::linked_ptr<Proto> proto_;\\n\\n\\n\\n GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction);\\n\\n};\\n\\n\\n\\n// Implements the InvokeWithoutArgs(f) action. The template argument\\n\\n// FunctionImpl is the implementation type of f, which can be either a\\n\\n// function pointer or a functor. InvokeWithoutArgs(f) can be used as an\\n\\n// Action<F> as long as f's type is compatible with F (i.e. f can be\\n\\n// assigned to a tr1::function<F>).\\n\\ntemplate <typename FunctionImpl>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h\",\n \"rank\": 9,\n \"score\": 192327.82539473395\n },\n {\n \"content\": \"from pymesh.meshutils import remove_isolated_vertices_raw\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\nimport unittest\\n\\n\\n\\nclass RemoveIsolatedVerticesTest(TestCase):\\n\\n def test_no_isolated_vertices(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\\n\\n\\n\\n self.assert_array_equal(vertices, out_vertices);\\n\\n self.assert_array_equal(faces, out_faces);\\n\\n self.assertEqual(0, info[\\\"num_vertex_removed\\\"]);\\n\\n self.assert_array_equal(np.arange(3), info[\\\"ori_vertex_index\\\"]);\\n\\n\\n\\n def test_multiple_isolated_vertices(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n [ 1.0, 1.0, 0.0],\\n\\n [ 0.0, 0.0, 1.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 4]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assertTrue(np.all(out_faces < len(out_vertices)));\\n\\n self.assertEqual(2, info[\\\"num_vertex_removed\\\"]);\\n\\n self.assert_array_equal([0, 1, 4], info[\\\"ori_vertex_index\\\"]);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py\",\n \"rank\": 10,\n \"score\": 188200.2718730756\n },\n {\n \"content\": \"from pymesh.meshutils import remove_duplicated_vertices_raw\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nclass RemoveDuplicatedVerticesTest(TestCase):\\n\\n def test_no_removal(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces);\\n\\n\\n\\n self.assert_array_equal(vertices, out_vertices);\\n\\n self.assert_array_equal(faces, out_faces);\\n\\n\\n\\n def test_simple_removal(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 2, 3],\\n\\n [1, 2, 3]\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assert_array_equal([[0, 1, 2], [0, 1, 2]], out_faces);\\n\\n\\n\\n def test_tiny_triangle(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 0.1, 0.0, 0.0],\\n\\n [ 0.0, 0.1, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces, 1.0);\\n\\n\\n\\n self.assertEqual(1, len(out_vertices));\\n\\n self.assert_array_equal([[0, 0, 0]], out_faces);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py\",\n \"rank\": 11,\n \"score\": 188200.2718730756\n },\n {\n \"content\": \"from pymesh.meshutils import remove_duplicated_faces_raw\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\nimport numpy.testing\\n\\nimport unittest\\n\\n\\n\\nclass RemoveDuplicatedFacesTest(TestCase):\\n\\n def test_double_faces(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 0],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\\n\\n\\n\\n # Vertices are left alone.\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n self.assertEqual(0, len(out_faces));\\n\\n\\n\\n def test_triple_faces(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 0],\\n\\n [0, 2, 1],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\\n\\n\\n\\n # Vertices are left alone.\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n self.assertEqual(1, len(out_faces));\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py\",\n \"rank\": 12,\n \"score\": 188137.88021668085\n },\n {\n \"content\": \"def remove_isolated_vertices(mesh):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_isolated_vertices_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``infomation`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``infomation``:\\n\\n\\n\\n * ``num_vertex_removed``: Number of vertex removed.\\n\\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\\n\\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\\n\\n vertex array.\\n\\n \\\"\\\"\\\"\\n\\n if mesh.num_voxels == 0:\\n\\n vertices, faces, info = remove_isolated_vertices_raw(\\n\\n mesh.vertices, mesh.faces);\\n\\n output_mesh = form_mesh(vertices, faces);\\n\\n else:\\n\\n vertices, voxels, info = remove_isolated_vertices_raw(\\n\\n mesh.vertices, mesh.voxels);\\n\\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_isolated_vertices.py\",\n \"rank\": 13,\n \"score\": 179180.68844942682\n },\n {\n \"content\": \"def remove_duplicated_vertices(mesh, tol=1e-12, importance=None):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_duplicated_vertices_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\\n\\n considered as duplicates. Default is ``1e-12``.\\n\\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\\n\\n When discarding duplicates, the vertex with the highest importance\\n\\n value will be kept.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``num_vertex_merged``: number of vertex merged.\\n\\n * ``index_map``: An array that maps input vertex index to output vertex index.\\n\\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n if mesh.num_voxels == 0:\\n\\n vertices, faces, info = remove_duplicated_vertices_raw(\\n\\n mesh.vertices, mesh.faces, tol, importance);\\n\\n out_mesh = form_mesh(vertices, faces);\\n\\n else:\\n\\n vertices, voxels, info = remove_duplicated_vertices_raw(\\n\\n mesh.vertices, mesh.voxels, tol, importance);\\n\\n output_mesh = form_mesh(vertices, np.zeros((0, 3)), voxels);\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_vertices.py\",\n \"rank\": 14,\n \"score\": 179175.8209691525\n },\n {\n \"content\": \"def remove_duplicated_faces(mesh, fins_only=False):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_duplicated_faces_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n fins_only (``bool``): If set, only remove fins.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``ori_face_index``: An array of original face indices. I.e. face\\n\\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\\n\\n the input vertices.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n vertices, faces, info = remove_duplicated_faces_raw(\\n\\n mesh.vertices, mesh.faces, fins_only);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_faces.py\",\n \"rank\": 15,\n \"score\": 179109.8826717141\n },\n {\n \"content\": \"def remove_isolated_vertices_raw(vertices, elements):\\n\\n \\\"\\\"\\\" Remove isolated vertices.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n elements (``numpy.ndarray``): Element array with one face per row.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array with one vertex per row.\\n\\n * ``output_elements``: Output element array with one element per row.\\n\\n * ``infomation``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``infomation``:\\n\\n\\n\\n * ``num_vertex_removed``: Number of vertex removed.\\n\\n * ``ori_vertex_index``: Original vertex index. That is vertex ``i`` of\\n\\n ``output_vertices`` has index ``ori_vertex_index[i]`` in the input\\n\\n vertex array.\\n\\n \\\"\\\"\\\"\\n\\n remover = IsolatedVertexRemoval(vertices, elements);\\n\\n num_removed = remover.run();\\n\\n vertices = remover.get_vertices();\\n\\n elements = remover.get_faces();\\n\\n info = {\\n\\n \\\"num_vertex_removed\\\": num_removed,\\n\\n \\\"ori_vertex_index\\\": remover.get_ori_vertex_indices().ravel(),\\n\\n };\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_isolated_vertices.py\",\n \"rank\": 16,\n \"score\": 177012.8742194173\n },\n {\n \"content\": \"def remove_duplicated_vertices_raw(vertices, elements, tol=1e-12, importance=None):\\n\\n \\\"\\\"\\\" Merge duplicated vertices into a single vertex.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertices in row major.\\n\\n elements (``numpy.ndarray``): Elements in row major.\\n\\n tol (``float``): (optional) Vertices with distance less than ``tol`` are\\n\\n considered as duplicates. Default is ``1e-12``.\\n\\n importance (``numpy.ndarray``): (optional) Per-vertex importance value.\\n\\n When discarding duplicates, the vertex with the highest importance\\n\\n value will be kept.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertices in row major.\\n\\n * ``output_elements``: Output elements in row major.\\n\\n * ``information``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``num_vertex_merged``: number of vertex merged.\\n\\n * ``index_map``: An array that maps input vertex index to output vertex index.\\n\\n I.e. vertex ``i`` will be mapped to ``index_map[i]`` in the output.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n\\n\\n remover = DuplicatedVertexRemoval(vertices, elements);\\n\\n if importance is not None:\\n\\n if (len(importance) != len(vertices)):\\n\\n raise RuntimeError(\\n\\n \\\"Vertex importance must be of the same size as vertices\\\");\\n\\n remover.set_importance_level(importance);\\n\\n num_merged = remover.run(tol);\\n\\n new_vertices = remover.get_vertices();\\n\\n new_elements = remover.get_faces();\\n\\n info = {\\n\\n \\\"num_vertex_merged\\\": num_merged,\\n\\n \\\"index_map\\\": remover.get_index_map().ravel(),\\n\\n };\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_vertices.py\",\n \"rank\": 17,\n \"score\": 177002.1766115245\n },\n {\n \"content\": \"def remove_duplicated_faces_raw(vertices, faces, fins_only=False):\\n\\n \\\"\\\"\\\" Remove duplicated faces.\\n\\n\\n\\n Duplicated faces are defined as faces consist of the same set of vertices.\\n\\n Depending on the face orientation. A special case of duplicated faces is\\n\\n a fin. A fin is defined as two duplicated faces with opposite orientaiton.\\n\\n\\n\\n If fins_only is set to True, all fins in the mesh are removed. The output\\n\\n mesh could still contain duplicated faces but no fins.\\n\\n\\n\\n If fins_only is not True, all duplicated faces will be removed. There could\\n\\n be two caes:\\n\\n\\n\\n If there is a dominant orientation, that is more than half of the faces are\\n\\n consistently orientated, and fins_only is False, one face with the dominant\\n\\n orientation will be kept while all other faces are removed.\\n\\n\\n\\n If there is no dominant orientation, i.e. half of the face are positively\\n\\n orientated and the other half is negatively orientated, all faces are\\n\\n discarded.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n faces (``numpy.ndarray``): Face array with one face per row.\\n\\n fins_only (``bool``): If set, only remove fins.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array, one vertex per row.\\n\\n * ``output_faces``: Output face array, one face per row.\\n\\n * ``information``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``ori_face_index``: An array of original face indices. I.e. face\\n\\n ``i`` of the ``output_faces`` has index ``ori_face_index[i]`` in\\n\\n the input vertices.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n remover = FinFaceRemoval(vertices, faces);\\n\\n if fins_only: remover.set_fins_only();\\n\\n remover.run();\\n\\n info = {\\n\\n \\\"ori_face_index\\\": remover.get_face_indices().ravel(),\\n\\n };\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_duplicated_faces.py\",\n \"rank\": 18,\n \"score\": 176943.22692630906\n },\n {\n \"content\": \"struct LosslessArithmeticConvertibleImpl<kBool, bool, kBool, bool>\\n\\n : public true_type {}; // NOLINT\\n\\n\\n\\n// Converting bool to any integer type is lossless.\\n\\ntemplate <typename To>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 19,\n \"score\": 176404.70298680058\n },\n {\n \"content\": \"struct TupleElement<true, 3, GTEST_10_TUPLE_(T) > {\\n\\n typedef T3 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 20,\n \"score\": 173698.6093473549\n },\n {\n \"content\": \"struct TupleElement<true, 0, GTEST_10_TUPLE_(T) > {\\n\\n typedef T0 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 21,\n \"score\": 173694.37077978894\n },\n {\n \"content\": \"class RemoveDuplicatedVerticesTest(TestCase):\\n\\n def test_no_removal(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces);\\n\\n\\n\\n self.assert_array_equal(vertices, out_vertices);\\n\\n self.assert_array_equal(faces, out_faces);\\n\\n\\n\\n def test_simple_removal(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 2, 3],\\n\\n [1, 2, 3]\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assert_array_equal([[0, 1, 2], [0, 1, 2]], out_faces);\\n\\n\\n\\n def test_tiny_triangle(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 0.1, 0.0, 0.0],\\n\\n [ 0.0, 0.1, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces, 1.0);\\n\\n\\n\\n self.assertEqual(1, len(out_vertices));\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py\",\n \"rank\": 22,\n \"score\": 172803.42166140876\n },\n {\n \"content\": \"class RemoveIsolatedVerticesTest(TestCase):\\n\\n def test_no_isolated_vertices(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\\n\\n\\n\\n self.assert_array_equal(vertices, out_vertices);\\n\\n self.assert_array_equal(faces, out_faces);\\n\\n self.assertEqual(0, info[\\\"num_vertex_removed\\\"]);\\n\\n self.assert_array_equal(np.arange(3), info[\\\"ori_vertex_index\\\"]);\\n\\n\\n\\n def test_multiple_isolated_vertices(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n [ 1.0, 1.0, 0.0],\\n\\n [ 0.0, 0.0, 1.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 4]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assertTrue(np.all(out_faces < len(out_vertices)));\\n\\n self.assertEqual(2, info[\\\"num_vertex_removed\\\"]);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py\",\n \"rank\": 23,\n \"score\": 172803.42166140876\n },\n {\n \"content\": \"class RemoveDuplicatedFacesTest(TestCase):\\n\\n def test_double_faces(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 0],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\\n\\n\\n\\n # Vertices are left alone.\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n self.assertEqual(0, len(out_faces));\\n\\n\\n\\n def test_triple_faces(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 0],\\n\\n [0, 2, 1],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\\n\\n\\n\\n # Vertices are left alone.\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py\",\n \"rank\": 24,\n \"score\": 172725.0973377171\n },\n {\n \"content\": \" def count(self):\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/timethis.py\",\n \"rank\": 25,\n \"score\": 165494.86218172975\n },\n {\n \"content\": \"// Implements the Return() action.\\n\\nclass ReturnVoidAction {\\n\\n public:\\n\\n // Allows Return() to be used in any void-returning function.\\n\\n template <typename Result, typename ArgumentTuple>\\n\\n static void Perform(const ArgumentTuple&) {\\n\\n CompileAssertTypesEqual<void, Result>();\\n\\n }\\n\\n};\\n\\n\\n\\n// Implements the polymorphic ReturnRef(x) action, which can be used\\n\\n// in any function that returns a reference to the type of x,\\n\\n// regardless of the argument types.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h\",\n \"rank\": 26,\n \"score\": 163507.3723252705\n },\n {\n \"content\": \" def test_no_removal(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces);\\n\\n\\n\\n self.assert_array_equal(vertices, out_vertices);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py\",\n \"rank\": 27,\n \"score\": 161213.72251137815\n },\n {\n \"content\": \"struct RemoveConst<const T[N]> {\\n\\n typedef typename RemoveConst<T>::type type[N];\\n\\n};\\n\\n\\n\\n#if defined(_MSC_VER) && _MSC_VER < 1400\\n\\n// This is the only specialization that allows VC++ 7.1 to remove const in\\n\\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\\n\\n// and thus needs to be conditionally compiled.\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gtest/gtest.h\",\n \"rank\": 28,\n \"score\": 160599.48669645196\n },\n {\n \"content\": \"class SetErrnoAndReturnAction {\\n\\n public:\\n\\n SetErrnoAndReturnAction(int errno_value, T result)\\n\\n : errno_(errno_value),\\n\\n result_(result) {}\\n\\n template <typename Result, typename ArgumentTuple>\\n\\n Result Perform(const ArgumentTuple& /* args */) const {\\n\\n errno = errno_;\\n\\n return result_;\\n\\n }\\n\\n\\n\\n private:\\n\\n const int errno_;\\n\\n const T result_;\\n\\n\\n\\n GTEST_DISALLOW_ASSIGN_(SetErrnoAndReturnAction);\\n\\n};\\n\\n\\n\\n#endif // !GTEST_OS_WINDOWS_MOBILE\\n\\n\\n\\n// Implements the SetArgumentPointee<N>(x) action for any function\\n\\n// whose N-th argument (0-based) is a pointer to x's type. The\\n\\n// template parameter kIsProto is true iff type A is ProtocolMessage,\\n\\n// proto2::Message, or a sub-class of those.\\n\\ntemplate <size_t N, typename A, bool kIsProto>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h\",\n \"rank\": 29,\n \"score\": 160577.15156848638\n },\n {\n \"content\": \" def test_no_isolated_vertices(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\\n\\n\\n\\n self.assert_array_equal(vertices, out_vertices);\\n\\n self.assert_array_equal(faces, out_faces);\\n\\n self.assertEqual(0, info[\\\"num_vertex_removed\\\"]);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py\",\n \"rank\": 30,\n \"score\": 159030.44837376065\n },\n {\n \"content\": \" def test_simple_removal(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 2, 3],\\n\\n [1, 2, 3]\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py\",\n \"rank\": 31,\n \"score\": 159005.8308355033\n },\n {\n \"content\": \" def test_triple_faces(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 0],\\n\\n [0, 2, 1],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\\n\\n\\n\\n # Vertices are left alone.\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py\",\n \"rank\": 32,\n \"score\": 158951.30004626734\n },\n {\n \"content\": \" def test_double_faces(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 0],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = remove_duplicated_faces_raw(vertices, faces);\\n\\n\\n\\n # Vertices are left alone.\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_faces.py\",\n \"rank\": 33,\n \"score\": 158951.30004626734\n },\n {\n \"content\": \"struct RemoveConst<const T[N]> {\\n\\n typedef typename RemoveConst<T>::type type[N];\\n\\n};\\n\\n\\n\\n#if defined(_MSC_VER) && _MSC_VER < 1400\\n\\n// This is the only specialization that allows VC++ 7.1 to remove const in\\n\\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\\n\\n// and thus needs to be conditionally compiled.\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/fused-src/gtest/gtest.h\",\n \"rank\": 34,\n \"score\": 158939.79869137998\n },\n {\n \"content\": \"struct RemoveConstFromKey {\\n\\n typedef T type;\\n\\n};\\n\\n\\n\\n// Partially specialized to remove constness from std::pair<const K, V>.\\n\\ntemplate <typename K, typename V>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 35,\n \"score\": 157690.31438549873\n },\n {\n \"content\": \" def test_multiple_isolated_vertices(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n [ 1.0, 1.0, 0.0],\\n\\n [ 0.0, 0.0, 1.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 4]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_isolated_vertices_raw(vertices, faces);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assertTrue(np.all(out_faces < len(out_vertices)));\\n\\n self.assertEqual(2, info[\\\"num_vertex_removed\\\"]);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_isolated_vertices.py\",\n \"rank\": 36,\n \"score\": 156884.4117008424\n },\n {\n \"content\": \" const char* e2,\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest_pred_impl.h\",\n \"rank\": 37,\n \"score\": 156306.2747611113\n },\n {\n \"content\": \" const char* e1,\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest_pred_impl.h\",\n \"rank\": 38,\n \"score\": 156304.51867493588\n },\n {\n \"content\": \"class DefaultValue<void> {\\n\\n public:\\n\\n static bool Exists() { return true; }\\n\\n static void Get() {}\\n\\n};\\n\\n\\n\\n// Points to the user-set default value for type T.\\n\\ntemplate <typename T>\\n\\nconst T* DefaultValue<T>::value_ = NULL;\\n\\n\\n\\n// Points to the user-set default value for type T&.\\n\\ntemplate <typename T>\\n\\nT* DefaultValue<T&>::address_ = NULL;\\n\\n\\n\\n// Implement this interface to define an action for function type F.\\n\\ntemplate <typename F>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h\",\n \"rank\": 39,\n \"score\": 156102.75792150287\n },\n {\n \"content\": \"class EqHelper<true> {\\n\\n public:\\n\\n // We define two overloaded versions of Compare(). The first\\n\\n // version will be picked when the second argument to ASSERT_EQ() is\\n\\n // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or\\n\\n // EXPECT_EQ(false, a_bool).\\n\\n template <typename T1, typename T2>\\n\\n static AssertionResult Compare(\\n\\n const char* expected_expression,\\n\\n const char* actual_expression,\\n\\n const T1& expected,\\n\\n const T2& actual,\\n\\n // The following line prevents this overload from being considered if T2\\n\\n // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr)\\n\\n // expands to Compare(\\\"\\\", \\\"\\\", NULL, my_ptr), which requires a conversion\\n\\n // to match the Secret* in the other overload, which would otherwise make\\n\\n // this template match better.\\n\\n typename EnableIf<!is_pointer<T2>::value>::type* = 0) {\\n\\n return CmpHelperEQ(expected_expression, actual_expression, expected,\\n\\n actual);\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest.h\",\n \"rank\": 40,\n \"score\": 156055.310743908\n },\n {\n \"content\": \"struct RemoveConst<T[N]> {\\n\\n typedef typename RemoveConst<T>::type type[N];\\n\\n};\\n\\n#endif\\n\\n\\n\\n// A handy wrapper around RemoveConst that works when the argument\\n\\n// T depends on template parameters.\\n\\n#define GTEST_REMOVE_CONST_(T) \\\\\\n\\n typename ::testing::internal::RemoveConst<T>::type\\n\\n\\n\\n// Turns const U&, U&, const U, and U all into U.\\n\\n#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \\\\\\n\\n GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))\\n\\n\\n\\n// Adds reference to a type if it is not a reference type,\\n\\n// otherwise leaves it unchanged. This is the same as\\n\\n// tr1::add_reference, which is not widely available yet.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 41,\n \"score\": 154985.0898034813\n },\n {\n \"content\": \"struct IteratorTraits<const T*> {\\n\\n typedef T value_type;\\n\\n};\\n\\n\\n\\n#if GTEST_OS_WINDOWS\\n\\n# define GTEST_PATH_SEP_ \\\"\\\\\\\\\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 1\\n\\n// The biggest signed integer type the compiler supports.\\n\\ntypedef __int64 BiggestInt;\\n\\n#else\\n\\n# define GTEST_PATH_SEP_ \\\"/\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 0\\n\\ntypedef long long BiggestInt; // NOLINT\\n\\n#endif // GTEST_OS_WINDOWS\\n\\n\\n\\n// Utilities for char.\\n\\n\\n\\n// isspace(int ch) and friends accept an unsigned char or EOF. char\\n\\n// may be signed, depending on the compiler (or compiler flags).\\n\\n// Therefore we need to cast a char to unsigned char before calling\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gtest/gtest.h\",\n \"rank\": 42,\n \"score\": 150804.25901849993\n },\n {\n \"content\": \"struct LosslessArithmeticConvertibleImpl<kBool, bool, kInteger, To>\\n\\n : public true_type {}; // NOLINT\\n\\n\\n\\n// Converting bool to any floating-point type is lossless.\\n\\ntemplate <typename To>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 43,\n \"score\": 150772.85746387483\n },\n {\n \"content\": \"struct LosslessArithmeticConvertibleImpl<kInteger, From, kBool, bool>\\n\\n : public false_type {}; // NOLINT\\n\\n\\n\\n// Converting an integer to another non-bool integer is lossless iff\\n\\n// the target type's range encloses the source type's range.\\n\\ntemplate <typename From, typename To>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 44,\n \"score\": 150772.85746387483\n },\n {\n \"content\": \"struct RemoveConstFromKey<std::pair<const K, V> > {\\n\\n typedef std::pair<K, V> type;\\n\\n};\\n\\n\\n\\n// Mapping from booleans to types. Similar to boost::bool_<kValue> and\\n\\n// std::integral_constant<bool, kValue>.\\n\\ntemplate <bool kValue>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gmock/gmock.h\",\n \"rank\": 45,\n \"score\": 150344.85191801187\n },\n {\n \"content\": \"struct RemoveConst { typedef T type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 46,\n \"score\": 149843.85728368102\n },\n {\n \"content\": \"struct LosslessArithmeticConvertibleImpl<kFloatingPoint, From, kBool, bool>\\n\\n : public false_type {}; // NOLINT\\n\\n\\n\\n// Converting a floating-point to an integer is lossy.\\n\\ntemplate <typename From, typename To>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 47,\n \"score\": 149299.04359523824\n },\n {\n \"content\": \"struct LosslessArithmeticConvertibleImpl<kBool, bool, kFloatingPoint, To>\\n\\n : public true_type {}; // NOLINT\\n\\n\\n\\n// Converting an integer to bool is lossy.\\n\\ntemplate <typename From>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/internal/gmock-internal-utils.h\",\n \"rank\": 48,\n \"score\": 149299.04359523824\n },\n {\n \"content\": \"struct IteratorTraits<const T*> {\\n\\n typedef T value_type;\\n\\n};\\n\\n\\n\\n#if GTEST_OS_WINDOWS\\n\\n# define GTEST_PATH_SEP_ \\\"\\\\\\\\\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 1\\n\\n// The biggest signed integer type the compiler supports.\\n\\ntypedef __int64 BiggestInt;\\n\\n#else\\n\\n# define GTEST_PATH_SEP_ \\\"/\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 0\\n\\ntypedef long long BiggestInt; // NOLINT\\n\\n#endif // GTEST_OS_WINDOWS\\n\\n\\n\\n// Utilities for char.\\n\\n\\n\\n// isspace(int ch) and friends accept an unsigned char or EOF. char\\n\\n// may be signed, depending on the compiler (or compiler flags).\\n\\n// Therefore we need to cast a char to unsigned char before calling\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/fused-src/gtest/gtest.h\",\n \"rank\": 49,\n \"score\": 148927.4874565561\n },\n {\n \"content\": \"import PyMesh\\n\\n\\n\\ndef compute_winding_number(mesh, queries, engine=\\\"auto\\\"):\\n\\n \\\"\\\"\\\" Compute winding number with respect to `mesh` at `queries`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): The mesh for which winding number is evaluated.\\n\\n queries (:class:`numpy.ndarray`): N by 3 matrix of query points at which\\n\\n winding number is evaluated.\\n\\n\\n\\n Returns:\\n\\n A list of size N, represent the winding nubmers at each query points in\\n\\n order.\\n\\n \\\"\\\"\\\"\\n\\n assert(mesh.dim == 3);\\n\\n assert(mesh.vertex_per_face == 3);\\n\\n\\n\\n if engine == \\\"auto\\\":\\n\\n engine = \\\"igl\\\";\\n\\n\\n\\n engine = PyMesh.WindingNumberEngine.create(engine);\\n\\n engine.set_mesh(mesh.vertices, mesh.faces);\\n\\n winding_numbers = engine.run(queries).ravel();\\n\\n\\n\\n return winding_numbers;\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/winding_number.py\",\n \"rank\": 50,\n \"score\": 148272.1032585054\n },\n {\n \"content\": \"class BuiltInDefaultValue<const T> {\\n\\n public:\\n\\n static bool Exists() { return BuiltInDefaultValue<T>::Exists(); }\\n\\n static T Get() { return BuiltInDefaultValue<T>::Get(); }\\n\\n};\\n\\n\\n\\n// This partial specialization defines the default values for pointer\\n\\n// types.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-actions.h\",\n \"rank\": 51,\n \"score\": 148222.01874080085\n },\n {\n \"content\": \"struct RemoveConst<const T> { typedef T type; }; // NOLINT\\n\\n\\n\\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\\n\\n// definition to fail to remove the const in 'const int[3]' and 'const\\n\\n// char[3][4]'. The following specialization works around the bug.\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gtest/gtest.h\",\n \"rank\": 52,\n \"score\": 148153.76797452325\n },\n {\n \"content\": \" def test_face_edge_touch(self):\\n\\n mesh_1 = generate_box_mesh(\\n\\n np.array([0, 0, 0]), np.array([1, 1, 1]));\\n\\n\\n\\n rot = Quaternion.fromData(\\n\\n np.array([1, 0, 1], dtype=float),\\n\\n np.array([0, 0, 1], dtype=float));\\n\\n mesh_2 = form_mesh(\\n\\n np.dot(rot.to_matrix(), mesh_1.vertices.T).T +\\n\\n np.array([0.5, 0.5, 1.0]),\\n\\n mesh_1.faces);\\n\\n\\n\\n mesh = merge_meshes((mesh_1, mesh_2));\\n\\n output_mesh = resolve_self_intersection(mesh);\\n\\n\\n\\n self.assert_self_intersect(mesh);\\n\\n self.assert_no_self_intersect(output_mesh);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/tests/test_selfintersection.py\",\n \"rank\": 53,\n \"score\": 147775.58661375986\n },\n {\n \"content\": \" def test_face_edge_touch(self):\\n\\n mesh_1 = generate_box_mesh(\\n\\n np.array([0, 0, 0]), np.array([1, 1, 1]));\\n\\n\\n\\n rot = Quaternion.fromData(\\n\\n np.array([1, 0, 1], dtype=float),\\n\\n np.array([0, 0, 1], dtype=float));\\n\\n mesh_2 = form_mesh(\\n\\n np.dot(rot.to_matrix(), mesh_1.vertices.T).T +\\n\\n np.array([0.5, 0.5, 1.0]),\\n\\n mesh_1.faces);\\n\\n\\n\\n mesh = boolean(mesh_1, mesh_2, \\\"union\\\", \\\"igl\\\");\\n\\n\\n\\n self.assertEqual(17, mesh.num_vertices);\\n\\n self.assertEqual(30, mesh.num_faces);\\n\\n self.assertFalse(mesh.is_manifold());\\n\\n self.assertTrue(mesh.is_closed());\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/tests/test_boolean.py\",\n \"rank\": 54,\n \"score\": 147775.58661375986\n },\n {\n \"content\": \" def get_edge_adj_faces(self, mesh):\\n\\n self.assertEqual(3, mesh.vertex_per_face);\\n\\n edge_adj_faces = {};\\n\\n for i, f in enumerate(mesh.faces):\\n\\n f = sorted(f);\\n\\n edges = [(f[0], f[1]),\\n\\n (f[1], f[2]),\\n\\n (f[0], f[2])];\\n\\n for e in edges:\\n\\n if e in edge_adj_faces:\\n\\n edge_adj_faces[e].append(i);\\n\\n else:\\n\\n edge_adj_faces[e] = [i];\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/tests/test_selfintersection.py\",\n \"rank\": 55,\n \"score\": 147775.58661375986\n },\n {\n \"content\": \"struct RemoveConst<const T> { typedef T type; }; // NOLINT\\n\\n\\n\\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\\n\\n// definition to fail to remove the const in 'const int[3]' and 'const\\n\\n// char[3][4]'. The following specialization works around the bug.\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/fused-src/gtest/gtest.h\",\n \"rank\": 56,\n \"score\": 146629.3355975274\n },\n {\n \"content\": \"class UniversalTersePrinter<const char*> {\\n\\n public:\\n\\n static void Print(const char* str, ::std::ostream* os) {\\n\\n if (str == NULL) {\\n\\n *os << \\\"NULL\\\";\\n\\n } else {\\n\\n UniversalPrint(string(str), os);\\n\\n }\\n\\n }\\n\\n};\\n\\ntemplate <>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 57,\n \"score\": 146421.74286273657\n },\n {\n \"content\": \"class UniversalTersePrinter<const wchar_t*> {\\n\\n public:\\n\\n static void Print(const wchar_t* str, ::std::ostream* os) {\\n\\n if (str == NULL) {\\n\\n *os << \\\"NULL\\\";\\n\\n } else {\\n\\n UniversalPrint(::std::wstring(str), os);\\n\\n }\\n\\n }\\n\\n};\\n\\n#endif\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 58,\n \"score\": 146421.74286273657\n },\n {\n \"content\": \"import sys\\n\\nimport os.path\\n\\n\\n\\npackage_dir = os.path.abspath(os.path.dirname(__file__));\\n\\nsys.path.append(os.path.join(package_dir, \\\"lib\\\"));\\n\\n#sys.path.append(os.path.join(package_dir, \\\"swig\\\"));\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/PyMeshSetting.py\",\n \"rank\": 59,\n \"score\": 146383.2425916887\n },\n {\n \"content\": \"import PyMesh\\n\\nimport numpy as np\\n\\n\\n\\ndef is_colinear(v0, v1, v2):\\n\\n \\\"\\\"\\\" Return true if ``v0``, ``v1`` and ``v2`` are colinear.\\n\\n Colinear check is done using exact predicates.\\n\\n\\n\\n Args:\\n\\n v0 (``numpy.ndarray``): vector of size 2 or 3.\\n\\n v1 (``numpy.ndarray``): vector of size 2 or 3.\\n\\n v2 (``numpy.ndarray``): vector of size 2 or 3.\\n\\n\\n\\n Return:\\n\\n A boolean indicating whether ``v0``, ``v1`` and ``v2`` are colinear.\\n\\n \\\"\\\"\\\"\\n\\n dim = len(v0);\\n\\n if dim == 2:\\n\\n return PyMesh.is_colinear_2D(v0, v1, v2);\\n\\n elif dim == 3:\\n\\n return PyMesh.is_colinear_3D(v0, v1, v2);\\n\\n else:\\n\\n raise NotImplementedError(\\\"Supported dimention {}\\\".format(dim));\\n\\n\\n\\ndef get_degenerated_faces_raw(vertices, faces):\\n\\n \\\"\\\"\\\" Return indices of degenerated faces.\\n\\n A face is degenerated if all its 3 corners are colinear.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex matrix.\\n\\n faces (``numpy.ndarray``): Face matrix.\\n\\n\\n\\n Returns:\\n\\n A ``numpy.ndarray`` of indices of degenerated faces.\\n\\n \\\"\\\"\\\"\\n\\n return np.array(PyMesh.get_degenerated_faces(vertices, faces));\\n\\n\\n\\ndef get_degenerated_faces(mesh):\\n\\n \\\"\\\"\\\" A thin wrapper for :py:func:`get_degenerated_faces_raw`.\\n\\n \\\"\\\"\\\"\\n\\n return get_degenerated_faces_raw(mesh.vertices, mesh.faces);\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/face_utils.py\",\n \"rank\": 60,\n \"score\": 144730.4603721215\n },\n {\n \"content\": \" def test_tiny_triangle(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 0.1, 0.0, 0.0],\\n\\n [ 0.0, 0.1, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = remove_duplicated_vertices_raw(\\n\\n vertices, faces, 1.0);\\n\\n\\n\\n self.assertEqual(1, len(out_vertices));\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_duplicated_vertices.py\",\n \"rank\": 61,\n \"score\": 143167.52518257557\n },\n {\n \"content\": \"class GTEST_API_ Matcher<const StringPiece&>\\n\\n : public internal::MatcherBase<const StringPiece&> {\\n\\n public:\\n\\n Matcher() {}\\n\\n\\n\\n explicit Matcher(const MatcherInterface<const StringPiece&>* impl)\\n\\n : internal::MatcherBase<const StringPiece&>(impl) {}\\n\\n\\n\\n // Allows the user to write str instead of Eq(str) sometimes, where\\n\\n // str is a string object.\\n\\n Matcher(const internal::string& s); // NOLINT\\n\\n\\n\\n // Allows the user to write \\\"foo\\\" instead of Eq(\\\"foo\\\") sometimes.\\n\\n Matcher(const char* s); // NOLINT\\n\\n\\n\\n // Allows the user to pass StringPieces directly.\\n\\n Matcher(StringPiece s); // NOLINT\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-matchers.h\",\n \"rank\": 62,\n \"score\": 143021.94550902475\n },\n {\n \"content\": \"from pymesh.TestCase import TestCase\\n\\n\\n\\nfrom pymesh import compute_winding_number\\n\\nfrom pymesh.meshutils import generate_box_mesh\\n\\n\\n\\nimport numpy as np\\n\\nfrom numpy.linalg import norm\\n\\n\\n\\nclass WindingNumberTest(TestCase):\\n\\n def test_cube(self):\\n\\n mesh = generate_box_mesh(\\n\\n np.array([0, 0, 0]), np.array([1, 1, 1]));\\n\\n queries = np.array([\\n\\n [-1, 0, 0],\\n\\n [0.0, 0.0, 0.0],\\n\\n [0.5, 0.0, 0.0],\\n\\n [0.5, 0.5, 0.0],\\n\\n [0.5, 0.5, 0.5],\\n\\n ]);\\n\\n\\n\\n winding_numbers = compute_winding_number(mesh, queries);\\n\\n\\n\\n self.assertEqual(len(queries), len(winding_numbers));\\n\\n self.assertAlmostEqual(0.0, norm(winding_numbers -\\n\\n np.array([0, 0.125, 0.25, 0.5, 1])));\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/tests/test_winding_number.py\",\n \"rank\": 63,\n \"score\": 142994.89403569326\n },\n {\n \"content\": \"from PyMesh import DegeneratedTriangleRemoval\\n\\nfrom ..meshio import form_mesh\\n\\n\\n\\ndef remove_degenerated_triangles_raw(vertices, faces, num_iterations=5):\\n\\n \\\"\\\"\\\" Remove degenerated triangles.\\n\\n\\n\\n Degenerated faces are faces with collinear vertices. It is impossible to\\n\\n compute face normal for them. This method get rid of all degenerated faces.\\n\\n No new vertices will be introduced. Only connectivity is changed.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n faces (``numpy.ndarray``): Face array with one triangle per row.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array, one vertex per row.\\n\\n * ``output_faces``: Output face array, one face per row.\\n\\n * ``info``: Additional information dict.\\n\\n\\n\\n The following fields are defined in the ``info`` dict:\\n\\n * ``ori_face_indices``: index array that maps each output face\\n\\n to an input face that contains it.\\n\\n \\\"\\\"\\\"\\n\\n if (faces.shape[1] != 3):\\n\\n raise RuntimeError(\\\"Faces are not triangles!\\\");\\n\\n remover = DegeneratedTriangleRemoval(vertices, faces);\\n\\n remover.run(num_iterations);\\n\\n info = {\\n\\n \\\"ori_face_indices\\\": remover.get_ori_face_indices().squeeze(),\\n\\n };\\n\\n return remover.get_vertices(), remover.get_faces(), info;\\n\\n\\n\\ndef remove_degenerated_triangles(mesh, num_iterations=5):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_degenerated_triangles_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``mesh``: A :py:class:`Mesh` object without degenerated triangles.\\n\\n * ``info``: Additional information dictionary.\\n\\n \\\"\\\"\\\"\\n\\n vertices, faces, info = remove_degenerated_triangles_raw(\\n\\n mesh.vertices, mesh.faces, num_iterations);\\n\\n return form_mesh(vertices, faces), info;\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_degenerated_triangles.py\",\n \"rank\": 64,\n \"score\": 142907.18085226027\n },\n {\n \"content\": \"from math import radians\\n\\n\\n\\nfrom .. import timethis\\n\\nfrom ..meshio import form_mesh\\n\\nfrom PyMesh import ObtuseTriangleRemoval\\n\\n\\n\\nclass ObtuseTriangleRemover:\\n\\n def __init__(self, vertices, faces):\\n\\n if vertices.shape[1] != 3:\\n\\n raise RuntimeError(\\\"Only 3D meshes are supported\\\");\\n\\n if faces.shape[1] != 3:\\n\\n raise RuntimeError(\\\"Only triangular meshes are supported\\\");\\n\\n\\n\\n self.vertices = vertices;\\n\\n self.faces = faces;\\n\\n\\n\\n def remove_obtuse_triangles(self, max_angle, max_num_iterations):\\n\\n max_angle = radians(max_angle);\\n\\n remover = ObtuseTriangleRemoval(self.vertices, self.faces);\\n\\n num_triangles_split = remover.run(\\n\\n max_angle, max_num_iterations);\\n\\n self.vertices = remover.get_vertices();\\n\\n self.faces = remover.get_faces();\\n\\n return num_triangles_split;\\n\\n\\n\\ndef remove_obtuse_triangles_raw(vertices, faces,\\n\\n max_angle=120,\\n\\n max_iterations=5):\\n\\n \\\"\\\"\\\" Remove all obtuse triangles.\\n\\n\\n\\n Args:\\n\\n vetices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n faces (``numpy.ndarray``): Face array with one face per row.\\n\\n max_angle (``float``): (optional) Maximum obtuse angle in degrees\\n\\n allowed. All triangle with larger internal angle would be split.\\n\\n Default is 120 degrees.\\n\\n max_iterations (``int``): (optional) Number of iterations to run before\\n\\n quitting. Default is 5.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array with one vertex per row.\\n\\n * ``output_faces``: Output face array with one face per row.\\n\\n * ``information``: A ``dict`` of additinal informations.\\n\\n\\n\\n The following fields are defiend in ``information``:\\n\\n\\n\\n * ``num_triangle_split``: number of triangles split.\\n\\n \\\"\\\"\\\"\\n\\n if max_angle < 90:\\n\\n raise RuntimeError(\\\"max_angle must be greater than 90 degrees\\\");\\n\\n\\n\\n remover = ObtuseTriangleRemover(vertices, faces);\\n\\n num_split = remover.remove_obtuse_triangles(max_angle, max_iterations);\\n\\n info = {\\n\\n \\\"num_triangle_split\\\": num_split\\n\\n };\\n\\n return remover.vertices, remover.faces, info;\\n\\n\\n\\ndef remove_obtuse_triangles(mesh, max_angle=120, max_iterations=5):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`remove_obtuse_triangles_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n max_angle (``float``): (optional) Maximum obtuse angle in degrees\\n\\n allowed. All triangle with larger internal angle would be split.\\n\\n Default is 120 degrees.\\n\\n max_iterations (``int``): (optional) Number of iterations to run before\\n\\n quitting. Default is 5.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information`` (:class:`dict`): A ``dict`` of additinal informations.\\n\\n\\n\\n The following fields are defiend in ``information``:\\n\\n\\n\\n * ``num_triangle_split``: number of triangles split.\\n\\n \\\"\\\"\\\"\\n\\n vertices, faces, info = remove_obtuse_triangles_raw(\\n\\n mesh.vertices, mesh.faces, max_angle, max_iterations);\\n\\n return form_mesh(vertices, faces), info;\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/remove_obtuse_triangles.py\",\n \"rank\": 65,\n \"score\": 142907.18085226027\n },\n {\n \"content\": \"import logging\\n\\nimport math\\n\\nimport numpy as np\\n\\n\\n\\nfrom .. import timethis\\n\\nfrom ..meshio import form_mesh\\n\\n\\n\\nfrom PyMesh import ShortEdgeRemoval, IsolatedVertexRemoval, FinFaceRemoval\\n\\n\\n\\nclass _EdgeCollapser(object):\\n\\n \\\"\\\"\\\" Wrapper class for C++ ShortEdgeRemoval class.\\n\\n\\n\\n Attributes:\\n\\n input_mesh: The input mesh.\\n\\n vertices (2D array): the output vertices.\\n\\n faces (2D array): the output faces.\\n\\n\\n\\n Examples:\\n\\n A common usage::\\n\\n\\n\\n collapser = _EdgeCollapser.create(mesh);\\n\\n collapser.keep_features();\\n\\n collapser.collapse(0.1, None);\\n\\n print(collapser.vertices);\\n\\n print(collapser.faces);\\n\\n \\\"\\\"\\\"\\n\\n @classmethod\\n\\n def create(cls, mesh):\\n\\n return _EdgeCollapser(mesh);\\n\\n\\n\\n @classmethod\\n\\n def create_raw(cls, vertices, faces):\\n\\n mesh = form_mesh(vertices, faces);\\n\\n return _EdgeCollapser(mesh);\\n\\n\\n\\n def __init__(self, mesh):\\n\\n self.input_mesh = mesh;\\n\\n if self.input_mesh.vertex_per_face != 3:\\n\\n raise RuntimeError(\\\"Only triangle mesh is supported! \\\"\\n\\n \\\"Input has {} vertices per face\\\".format(\\n\\n self.input_mesh.vertex_per_face));\\n\\n self.logger = logging.getLogger(__name__);\\n\\n self.importance = None;\\n\\n\\n\\n @timethis\\n\\n def keep_features(self):\\n\\n \\\"\\\"\\\" Preserve sharp edges and boundaries.\\n\\n \\\"\\\"\\\"\\n\\n if not self.input_mesh.has_attribute(\\\"vertex_dihedral_angle\\\"):\\n\\n self.input_mesh.add_attribute(\\\"vertex_dihedral_angle\\\");\\n\\n dihedral_angle = self.input_mesh.get_attribute(\\\"vertex_dihedral_angle\\\");\\n\\n self.importance = np.round(dihedral_angle * 4 / math.pi).astype(int);\\n\\n\\n\\n # keep boundary.\\n\\n bd_vertices = self.input_mesh.boundary_vertices;\\n\\n self.importance[bd_vertices] = 10;\\n\\n\\n\\n @timethis\\n\\n def collapse(self, abs_threshold, rel_threshold):\\n\\n \\\"\\\"\\\" Note this method remove all edges with length less than threshold.\\n\\n This could result in a non-manifold mesh.\\n\\n \\\"\\\"\\\"\\n\\n min_edge_length = abs_threshold;\\n\\n if rel_threshold is not None:\\n\\n ave_edge_len = self.__get_ave_edge_length()\\n\\n min_edge_length = rel_threshold * ave_edge_len;\\n\\n self.logger.info(\\\"Minimum edge threshold: {:.3}\\\".format(min_edge_length));\\n\\n\\n\\n num_collapsed = self.__collapse_C(min_edge_length);\\n\\n self.logger.info(\\\"{} edges collapsed\\\".format(num_collapsed));\\n\\n\\n\\n self.__remove_fin_faces();\\n\\n self.__remove_isolated_vertices();\\n\\n\\n\\n return num_collapsed;\\n\\n\\n\\n def __get_ave_edge_length(self):\\n\\n if not self.input_mesh.has_attribute(\\\"edge_length\\\"):\\n\\n self.input_mesh.add_attribute(\\\"edge_length\\\");\\n\\n edge_lengths = self.input_mesh.get_attribute(\\\"edge_length\\\");\\n\\n return np.mean(edge_lengths);\\n\\n\\n\\n @timethis\\n\\n def __collapse_C(self, min_edge_length):\\n\\n collapser = ShortEdgeRemoval(\\n\\n self.input_mesh.vertices, self.input_mesh.faces);\\n\\n if self.importance is not None:\\n\\n if len(self.importance) != self.input_mesh.num_vertices:\\n\\n raise RuntimeError(\\\"Invalid importance size!\\\");\\n\\n collapser.set_importance(self.importance);\\n\\n num_collapsed = collapser.run(min_edge_length);\\n\\n self.vertices = collapser.get_vertices();\\n\\n self.faces = collapser.get_faces();\\n\\n self.face_index_map = collapser.get_face_indices().ravel();\\n\\n return num_collapsed;\\n\\n\\n\\n @timethis\\n\\n def __remove_isolated_vertices(self):\\n\\n remover = IsolatedVertexRemoval(self.vertices, self.faces);\\n\\n remover.run();\\n\\n self.vertices = remover.get_vertices();\\n\\n self.faces = remover.get_faces();\\n\\n\\n\\n @timethis\\n\\n def __remove_fin_faces(self):\\n\\n remover = FinFaceRemoval(self.vertices, self.faces);\\n\\n remover.run();\\n\\n self.vertices = remover.get_vertices();\\n\\n self.faces = remover.get_faces();\\n\\n\\n\\ndef collapse_short_edges_raw(vertices, faces, abs_threshold=0.0,\\n\\n rel_threshold=None, preserve_feature=False):\\n\\n \\\"\\\"\\\" Convenient function for collapsing short edges.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array. One vertex per row.\\n\\n faces (``numpy.ndarray``): Face array. One face per row.\\n\\n abs_threshold (``float``): (optional) All edge with length below or\\n\\n equal to this threshold will be collapsed. This value is ignored\\n\\n if ``rel_thresold`` is not ``None``.\\n\\n rel_threashold (``float``): (optional) Relative edge length threshold\\n\\n based on average edge length. e.g. ``rel_threshold=0.1`` means all\\n\\n edges with length less than ``0.1 * ave_edge_length`` will be collapsed.\\n\\n preserve_feature (``bool``): True if shape features should be preserved.\\n\\n Default is false.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array. One vertex per row.\\n\\n * ``output_faces``: Output face array. One face per row.\\n\\n * ``information``: A ``dict`` of additional informations.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``num_edge_collapsed``: Number of edge collapsed.\\n\\n * ``source_face_index``: An array tracks the source of each output face.\\n\\n That is face ``i`` of the ``output_faces`` comes from face\\n\\n ``source_face_index[i]`` of the input faces.\\n\\n \\\"\\\"\\\"\\n\\n collapser = _EdgeCollapser.create_raw(vertices, faces);\\n\\n if preserve_feature:\\n\\n collapser.keep_features();\\n\\n num_collapsed = collapser.collapse(abs_threshold, rel_threshold);\\n\\n info = {\\n\\n \\\"num_edge_collapsed\\\": num_collapsed,\\n\\n \\\"source_face_index\\\": collapser.face_index_map\\n\\n }\\n\\n return collapser.vertices, collapser.faces, info;\\n\\n\\n\\ndef collapse_short_edges(mesh,\\n\\n abs_threshold=0.0, rel_threshold=None, preserve_feature=False):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`collapse_short_edges_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n abs_threshold (``float``): (optional) All edge with length below or\\n\\n equal to this threshold will be collapsed. This value is ignored\\n\\n if ``rel_thresold`` is not ``None``.\\n\\n rel_threashold (``float``): (optional) Relative edge length threshold\\n\\n based on average edge length. e.g. ``rel_threshold=0.1`` means all\\n\\n edges with length less than ``0.1 * ave_edge_length`` will be collapsed.\\n\\n preserve_feature (``bool``): True if shape features should be preserved.\\n\\n Default is false.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_Mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information`` (:class:`dict`): A ``dict`` of additional informations.\\n\\n\\n\\n The following attribute are defined:\\n\\n\\n\\n * ``face_sources``: The index of input source face of each output face.\\n\\n\\n\\n The following fields are defined in ``information``:\\n\\n\\n\\n * ``num_edge_collapsed``: Number of edge collapsed.\\n\\n \\\"\\\"\\\"\\n\\n vertices, faces, info = collapse_short_edges_raw(mesh.vertices, mesh.faces,\\n\\n abs_threshold, rel_threshold, preserve_feature);\\n\\n result = form_mesh(vertices, faces);\\n\\n result.add_attribute(\\\"face_sources\\\")\\n\\n result.set_attribute(\\\"face_sources\\\", info[\\\"source_face_index\\\"]);\\n\\n del info[\\\"source_face_index\\\"]\\n\\n return result, info;\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/collapse_short_edges.py\",\n \"rank\": 66,\n \"score\": 142904.76909236884\n },\n {\n \"content\": \"import numpy as np\\n\\n\\n\\nfrom ..meshio import form_mesh\\n\\nfrom PyMesh import LongEdgeRemoval\\n\\n\\n\\ndef split_long_edges_raw(vertices, faces, max_edge_length):\\n\\n \\\"\\\"\\\" Split long edges.\\n\\n\\n\\n Args:\\n\\n vertices (``numpy.ndarray``): Vertex array with one vertex per row.\\n\\n faces (``numpy.ndarray``): Face array with one face per row.\\n\\n max_edge_length (``float``): Maximum edge length allowed. All edges\\n\\n longer than this will be split.\\n\\n\\n\\n Returns:\\n\\n 3 values are returned.\\n\\n\\n\\n * ``output_vertices``: Output vertex array with one vertex per row.\\n\\n * ``output_faces``: Output face array with one face per row.\\n\\n * ``information``: A dummy ``dict`` that is currently empty.\\n\\n It is here to ensure consistent interface across the module.\\n\\n \\\"\\\"\\\"\\n\\n remover = LongEdgeRemoval(vertices, faces);\\n\\n remover.run(max_edge_length);\\n\\n vertices = remover.get_vertices();\\n\\n faces = remover.get_faces();\\n\\n return vertices, faces, {};\\n\\n\\n\\ndef split_long_edges(mesh, max_edge_length):\\n\\n \\\"\\\"\\\" Wrapper function of :func:`split_long_edges_raw`.\\n\\n\\n\\n Args:\\n\\n mesh (:class:`Mesh`): Input mesh.\\n\\n max_edge_length (``float``): Maximum edge length allowed. All edges\\n\\n longer than this will be split.\\n\\n\\n\\n Returns:\\n\\n 2 values are returned.\\n\\n\\n\\n * ``output_mesh`` (:class:`Mesh`): Output mesh.\\n\\n * ``information``: A dummy ``dict`` that is currently empty.\\n\\n It is here to ensure consistent interface across the module.\\n\\n \\\"\\\"\\\"\\n\\n vertices, faces, info = split_long_edges_raw(\\n\\n mesh.vertices, mesh.faces, max_edge_length);\\n\\n return form_mesh(vertices, faces), info;\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/split_long_edges.py\",\n \"rank\": 67,\n \"score\": 142904.76909236884\n },\n {\n \"content\": \"class SetArgumentPointeeAction<N, Proto, true> {\\n\\n public:\\n\\n // Constructs an action that sets the variable pointed to by the\\n\\n // N-th function argument to 'proto'. Both ProtocolMessage and\\n\\n // proto2::Message have the CopyFrom() method, so the same\\n\\n // implementation works for both.\\n\\n explicit SetArgumentPointeeAction(const Proto& proto) : proto_(new Proto) {\\n\\n proto_->CopyFrom(proto);\\n\\n }\\n\\n\\n\\n template <typename Result, typename ArgumentTuple>\\n\\n void Perform(const ArgumentTuple& args) const {\\n\\n CompileAssertTypesEqual<void, Result>();\\n\\n ::std::tr1::get<N>(args)->CopyFrom(*proto_);\\n\\n }\\n\\n\\n\\n private:\\n\\n const internal::linked_ptr<Proto> proto_;\\n\\n\\n\\n GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction);\\n\\n};\\n\\n\\n\\n// Implements the InvokeWithoutArgs(f) action. The template argument\\n\\n// FunctionImpl is the implementation type of f, which can be either a\\n\\n// function pointer or a functor. InvokeWithoutArgs(f) can be used as an\\n\\n// Action<F> as long as f's type is compatible with F (i.e. f can be\\n\\n// assigned to a tr1::function<F>).\\n\\ntemplate <typename FunctionImpl>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gmock/gmock.h\",\n \"rank\": 68,\n \"score\": 141969.78061047563\n },\n {\n \"content\": \"class FinFaceRemoval {\\n\\n public:\\n\\n FinFaceRemoval(const MatrixFr& vertices, const MatrixIr& faces);\\n\\n\\n\\n public:\\n\\n /**\\n\\n * Only remove fins. A fin is defined as a pair of faces with identical\\n\\n * vertices but opposite orientaiton.\\n\\n */\\n\\n void set_fins_only() {\\n\\n m_fins_only = true;\\n\\n }\\n\\n\\n\\n /**\\n\\n * When set_fins_only() is called:\\n\\n * Only fins are removed.\\n\\n *\\n\\n * Otherwise:\\n\\n *\\n\\n * For each set of duplicated faces, if there is a majority orientation,\\n\",\n \"file_path\": \"dependencies/PyMesh/tools/MeshUtils/FinFaceRemoval.h\",\n \"rank\": 69,\n \"score\": 140498.4946578307\n },\n {\n \"content\": \"class LongEdgeRemoval {\\n\\n public:\\n\\n LongEdgeRemoval(const MatrixFr& vertices, const MatrixIr& faces) :\\n\\n m_vertices(vertices), m_faces(faces) {}\\n\\n\\n\\n public:\\n\\n void run(Float max_length, bool recursive=true);\\n\\n\\n\\n MatrixFr get_vertices() const { return m_vertices; }\\n\\n MatrixIr get_faces() const { return m_faces; }\\n\\n\\n\\n private:\\n\\n void init_edge_map();\\n\\n void split_long_edges(Float max_length);\\n\\n size_t retriangulate();\\n\\n void triangulate_chain(\\n\\n std::vector<VectorI>& faces,\\n\\n const std::vector<size_t>& chain,\\n\\n size_t v0_idx, size_t v1_idx, size_t v2_idx);\\n\\n std::vector<size_t> get_vertex_chain_around_triangle(\\n\",\n \"file_path\": \"dependencies/PyMesh/tools/MeshUtils/LongEdgeRemoval.h\",\n \"rank\": 70,\n \"score\": 140473.4816764854\n },\n {\n \"content\": \"class ShortEdgeRemoval {\\n\\n public:\\n\\n ShortEdgeRemoval(const MatrixFr& vertices, const MatrixIr& faces);\\n\\n\\n\\n public:\\n\\n /**\\n\\n * Importance is an integer value per vertex. The vertex with higher\\n\\n * importance would keep its position during edge collapsing. Mid-point\\n\\n * is used when collapsing edge with same importance at each end.\\n\\n *\\n\\n * Vertex with negative importance is not considered during collapsing.\\n\\n * i.e. they will keep their original location.\\n\\n */\\n\\n void set_importance(const VectorI& importance) {\\n\\n m_importance = importance;\\n\\n }\\n\\n /**\\n\\n * Remove all edges that <= thresold\\n\\n * If thresold=0, remove all degenerated edges.\\n\\n */\\n\",\n \"file_path\": \"dependencies/PyMesh/tools/MeshUtils/ShortEdgeRemoval.h\",\n \"rank\": 71,\n \"score\": 140473.4816764854\n },\n {\n \"content\": \"class GTEST_API_ Matcher<const internal::string&>\\n\\n : public internal::MatcherBase<const internal::string&> {\\n\\n public:\\n\\n Matcher() {}\\n\\n\\n\\n explicit Matcher(const MatcherInterface<const internal::string&>* impl)\\n\\n : internal::MatcherBase<const internal::string&>(impl) {}\\n\\n\\n\\n // Allows the user to write str instead of Eq(str) sometimes, where\\n\\n // str is a string object.\\n\\n Matcher(const internal::string& s); // NOLINT\\n\\n\\n\\n // Allows the user to write \\\"foo\\\" instead of Eq(\\\"foo\\\") sometimes.\\n\\n Matcher(const char* s); // NOLINT\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-matchers.h\",\n \"rank\": 72,\n \"score\": 140117.35613349773\n },\n {\n \"content\": \"from pymesh import remove_degenerated_triangles\\n\\nfrom pymesh import remove_degenerated_triangles_raw\\n\\nfrom pymesh import generate_box_mesh\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nclass RemoveDegeneratedTrianglesTest(TestCase):\\n\\n def test_no_degeneracy(self):\\n\\n mesh = generate_box_mesh(np.ones(3)*-1, np.ones(3));\\n\\n\\n\\n result, info = remove_degenerated_triangles(mesh);\\n\\n self.assertEqual(8, result.num_vertices);\\n\\n self.assertEqual(12, result.num_faces);\\n\\n self.assert_array_equal(np.arange(12),\\n\\n sorted(info[\\\"ori_face_indices\\\"]));\\n\\n\\n\\n def test_simple(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n ]);\\n\\n faces = np.array([\\n\\n [0, 1, 2]\\n\\n ], dtype=int);\\n\\n\\n\\n result_vertices, result_faces, info = \\\\\\n\\n remove_degenerated_triangles_raw(vertices, faces);\\n\\n\\n\\n self.assertEqual(0, len(result_vertices));\\n\\n self.assertEqual(0, len(result_faces));\\n\\n self.assertEqual(0, len(info[\\\"ori_face_indices\\\"]));\\n\\n\\n\\n def multiple_degeneracies(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n [2.0, 0.0, 0.0],\\n\\n [4.0, 0.0, 0.0],\\n\\n [5.0, 0.0, 0.0],\\n\\n [0.0, 2.0, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 5],\\n\\n [1, 2, 5],\\n\\n [2, 3, 5],\\n\\n [3, 4, 5],\\n\\n [5, 6, 0],\\n\\n ], dtype=int);\\n\\n\\n\\n result_vertices, result_faces, info = \\\\\\n\\n remove_degenerated_triangles_raw(vertices, faces);\\n\\n\\n\\n self.assertEqual(6, len(result_vertices));\\n\\n self.assertEqual(4, len(result_faces));\\n\\n self.assertEqual(4, len(info[\\\"ori_face_indices\\\"]));\\n\\n self.assertTrue(np.all(info[\\\"ori_face_indices\\\"] == 4));\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_degenerated_triangles.py\",\n \"rank\": 73,\n \"score\": 137996.76178373647\n },\n {\n \"content\": \"from pymesh.meshutils import remove_obtuse_triangles_raw\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\nimport numpy.testing\\n\\nimport unittest\\n\\n\\n\\nclass ObtuseTriangleRemovalTest(TestCase):\\n\\n def test_nothing_to_remove(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\\n\\n\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n numpy.testing.assert_array_equal(faces, out_faces);\\n\\n\\n\\n def test_single_obtuse_triangle(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.1, 0.0],\\n\\n [-1.0, 0.1, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2]\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\\n\\n self.assertEqual(2, len(out_faces));\\n\\n\\n\\n def test_double_obtuse_triangles_1(self):\\n\\n \\\"\\\"\\\" Check two obtuse triangles sharing the longest edges.\\n\\n \\\"\\\"\\\"\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.1, 0.0],\\n\\n [-1.0, 0.1, 0.0],\\n\\n [ 0.0, 0.2, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 3],\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\\n\\n self.assertEqual(4, len(out_faces));\\n\\n\\n\\n def test_double_obtuse_triangles_2(self):\\n\\n \\\"\\\"\\\" Check two obtuse triangles that does not share the longest edge.\\n\\n \\\"\\\"\\\"\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.1, 0.0],\\n\\n [-1.0, 0.1, 0.0],\\n\\n [ 5.0, 0.2, 0.0],\\n\\n ]);\\n\\n\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [2, 1, 3],\\n\\n ]);\\n\\n\\n\\n out_vertices, out_faces, info = remove_obtuse_triangles_raw(vertices, faces);\\n\\n self.assertLess(4, len(out_faces));\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_remove_obtuse_triangles.py\",\n \"rank\": 74,\n \"score\": 137996.76178373647\n },\n {\n \"content\": \"from pymesh import generate_icosphere\\n\\nfrom pymesh.meshutils import collapse_short_edges_raw, collapse_short_edges\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\nimport numpy.testing\\n\\nimport unittest\\n\\n\\n\\nclass CollapseShortEdgesTest(TestCase):\\n\\n def test_simple_3D(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n [0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([[0, 1, 2]], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = collapse_short_edges_raw(\\n\\n vertices, faces, 0.1);\\n\\n\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n numpy.testing.assert_array_equal(faces, out_faces);\\n\\n self.assertEqual(0, info[\\\"num_edge_collapsed\\\"]);\\n\\n self.assert_array_equal([0], info[\\\"source_face_index\\\"]);\\n\\n\\n\\n def test_collapse_all_3D(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n [0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([[0, 1, 2]], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = collapse_short_edges_raw(\\n\\n vertices, faces, 1.1);\\n\\n\\n\\n self.assertEqual(0, len(out_vertices));\\n\\n self.assertEqual(0, len(out_faces));\\n\\n self.assertEqual(1, info[\\\"num_edge_collapsed\\\"]);\\n\\n self.assert_array_equal([], info[\\\"source_face_index\\\"]);\\n\\n\\n\\n def test_slim_triangles(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n [-0.1,-0.1,-0.1],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [0, 3, 1],\\n\\n [0, 2, 3],\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = collapse_short_edges_raw(\\n\\n vertices, faces, 0.5);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assertEqual(1, len(out_faces));\\n\\n self.assertEqual(1, info[\\\"num_edge_collapsed\\\"]);\\n\\n self.assert_array_equal([0], info[\\\"source_face_index\\\"]);\\n\\n\\n\\n def test_degenerated_triangles(self):\\n\\n vertices = np.array([\\n\\n [ 0.0, 0.0, 0.0],\\n\\n [ 1.0, 0.0, 0.0],\\n\\n [ 0.0, 1.0, 0.0],\\n\\n [-0.1,-0.1,-0.1],\\n\\n ], dtype=float);\\n\\n faces = np.array([\\n\\n [0, 1, 2],\\n\\n [0, 3, 1],\\n\\n [0, 2, 3],\\n\\n [0, 0, 1],\\n\\n [2, 3, 3]\\n\\n ], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = collapse_short_edges_raw(\\n\\n vertices, faces, 0.5);\\n\\n\\n\\n self.assertEqual(3, len(out_vertices));\\n\\n self.assertEqual(1, len(out_faces));\\n\\n self.assertEqual(3, info[\\\"num_edge_collapsed\\\"]);\\n\\n self.assert_array_equal([0], info[\\\"source_face_index\\\"]);\\n\\n\\n\\n def test_simple_2D(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0],\\n\\n [1.0, 0.0],\\n\\n [0.0, 1.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([[0, 1, 2]], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, info = collapse_short_edges_raw(\\n\\n vertices, faces, 0.1);\\n\\n\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n numpy.testing.assert_array_equal(faces, out_faces);\\n\\n self.assertEqual(0, info[\\\"num_edge_collapsed\\\"]);\\n\\n self.assert_array_equal([0], info[\\\"source_face_index\\\"]);\\n\\n\\n\\n def test_tiny_mesh(self):\\n\\n \\\"\\\"\\\" Edge collapse performed on a tiny icosphere.\\n\\n \\\"\\\"\\\"\\n\\n mesh = generate_icosphere(1e-6, [0.0, 0.0, 0.0]);\\n\\n mesh, info = collapse_short_edges(mesh, 0.1);\\n\\n\\n\\n self.assertTrue(\\\"face_sources\\\" in mesh.attribute_names);\\n\\n self.assertEqual(0, mesh.num_vertices);\\n\\n self.assertEqual(0, mesh.num_faces);\\n\\n self.assertEqual(0, mesh.num_voxels);\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_collapse_short_edges.py\",\n \"rank\": 75,\n \"score\": 137994.43002778868\n },\n {\n \"content\": \"from pymesh.meshutils import split_long_edges_raw\\n\\nfrom pymesh.TestCase import TestCase\\n\\n\\n\\nimport numpy as np\\n\\nimport numpy.testing\\n\\nimport unittest\\n\\n\\n\\nclass SplitLongEdgeTest(TestCase):\\n\\n def test_nothing_to_split(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n [0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([[0, 1, 2]], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = split_long_edges_raw(vertices, faces, 2.0);\\n\\n\\n\\n numpy.testing.assert_array_equal(vertices, out_vertices);\\n\\n numpy.testing.assert_array_equal(faces, out_faces);\\n\\n\\n\\n def test_simple_split(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n [0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([[0, 1, 2]], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = split_long_edges_raw(vertices, faces, 1.4);\\n\\n\\n\\n self.assertEqual(2, len(out_faces));\\n\\n\\n\\n def test_multiple_splits(self):\\n\\n vertices = np.array([\\n\\n [0.0, 0.0, 0.0],\\n\\n [1.0, 0.0, 0.0],\\n\\n [0.0, 1.0, 0.0],\\n\\n ], dtype=float);\\n\\n faces = np.array([[0, 1, 2]], dtype=int);\\n\\n\\n\\n out_vertices, out_faces, __ = split_long_edges_raw(vertices, faces, 0.9);\\n\\n\\n\\n self.assertLess(2, len(out_faces));\\n\\n\\n\",\n \"file_path\": \"dependencies/PyMesh/python/pymesh/meshutils/tests/test_split_long_edges.py\",\n \"rank\": 76,\n \"score\": 137994.43002778868\n },\n {\n \"content\": \"struct TupleElement<true, 6, GTEST_10_TUPLE_(T) > {\\n\\n typedef T6 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 77,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 9, GTEST_10_TUPLE_(T) > {\\n\\n typedef T9 type;\\n\\n};\\n\\n\\n\\n} // namespace gtest_internal\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 78,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 2, GTEST_10_TUPLE_(T) > {\\n\\n typedef T2 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 79,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 4, GTEST_10_TUPLE_(T) > {\\n\\n typedef T4 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 80,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 8, GTEST_10_TUPLE_(T) > {\\n\\n typedef T8 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 81,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 1, GTEST_10_TUPLE_(T) > {\\n\\n typedef T1 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 82,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 7, GTEST_10_TUPLE_(T) > {\\n\\n typedef T7 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 83,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"struct TupleElement<true, 5, GTEST_10_TUPLE_(T) > {\\n\\n typedef T5 type;\\n\\n};\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 84,\n \"score\": 136699.71416766342\n },\n {\n \"content\": \"#!/usr/bin/env python\\n\\n\\n\\n\\\"\\\"\\\"\\n\\nRemove isolated vertices.\\n\\n\\\"\\\"\\\"\\n\\n\\n\\nimport argparse\\n\\nimport pymesh\\n\\n\\n\\ndef parse_args():\\n\\n parser = argparse.ArgumentParser(description=__doc__);\\n\\n parser.add_argument(\\\"input_mesh\\\", help=\\\"input mesh\\\");\\n\\n parser.add_argument(\\\"output_mesh\\\", help=\\\"output mesh\\\");\\n\\n return parser.parse_args();\\n\\n\\n\\ndef main():\\n\\n args = parse_args();\\n\\n mesh = pymesh.load_mesh(args.input_mesh);\\n\\n mesh, __ = pymesh.remove_isolated_vertices(mesh);\\n\\n pymesh.save_mesh(args.output_mesh, mesh);\\n\\n\\n\\nif __name__ == \\\"__main__\\\":\\n\\n main();\\n\",\n \"file_path\": \"dependencies/PyMesh/scripts/remove_isolated_vertices.py\",\n \"rank\": 85,\n \"score\": 135990.69832397185\n },\n {\n \"content\": \"#!/usr/bin/env python\\n\\n\\n\\n\\\"\\\"\\\"\\n\\nRemove duplicated faces.\\n\\n\\\"\\\"\\\"\\n\\n\\n\\nimport argparse\\n\\nimport pymesh\\n\\n\\n\\ndef parse_args():\\n\\n parser = argparse.ArgumentParser(description=__doc__);\\n\\n parser.add_argument(\\\"input_mesh\\\", help=\\\"input mesh\\\");\\n\\n parser.add_argument(\\\"output_mesh\\\", help=\\\"output mesh\\\");\\n\\n return parser.parse_args();\\n\\n\\n\\ndef main():\\n\\n args = parse_args();\\n\\n mesh = pymesh.load_mesh(args.input_mesh);\\n\\n mesh, __ = pymesh.remove_duplicated_faces(mesh);\\n\\n pymesh.save_mesh(args.output_mesh, mesh);\\n\\n\\n\\nif __name__ == \\\"__main__\\\":\\n\\n main();\\n\",\n \"file_path\": \"dependencies/PyMesh/scripts/remove_duplicated_faces.py\",\n \"rank\": 86,\n \"score\": 135923.8668951813\n },\n {\n \"content\": \"class ActionResultHolder<void> : public UntypedActionResultHolderBase {\\n\\n public:\\n\\n void GetValueAndDelete() const { delete this; }\\n\\n\\n\\n virtual void PrintAsActionResult(::std::ostream* /* os */) const {}\\n\\n\\n\\n // Performs the given mock function's default action and returns NULL;\\n\\n template <typename F>\\n\\n static ActionResultHolder* PerformDefaultAction(\\n\\n const FunctionMockerBase<F>* func_mocker,\\n\\n const typename Function<F>::ArgumentTuple& args,\\n\\n const string& call_description) {\\n\\n func_mocker->PerformDefaultAction(args, call_description);\\n\\n return NULL;\\n\\n }\\n\\n\\n\\n // Performs the given action and returns NULL.\\n\\n template <typename F>\\n\\n static ActionResultHolder* PerformAction(\\n\\n const Action<F>& action,\\n\\n const typename Function<F>::ArgumentTuple& args) {\\n\\n action.Perform(args);\\n\\n return NULL;\\n\\n }\\n\\n};\\n\\n\\n\\n// The base of the function mocker class for the given function type.\\n\\n// We put the methods in this class instead of its child to avoid code\\n\\n// bloat.\\n\\ntemplate <typename F>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/include/gmock/gmock-spec-builders.h\",\n \"rank\": 87,\n \"score\": 134917.78135907854\n },\n {\n \"content\": \"class FaceEdgeRatioAttribute : public MeshAttribute {\\n\\n public:\\n\\n FaceEdgeRatioAttribute(const std::string& name) : MeshAttribute(name) {}\\n\\n virtual ~FaceEdgeRatioAttribute() {}\\n\\n\\n\\n public:\\n\\n virtual void compute_from_mesh(Mesh& mesh);\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"dependencies/PyMesh/src/Attributes/FaceEdgeRatioAttribute.h\",\n \"rank\": 88,\n \"score\": 134254.6943782677\n },\n {\n \"content\": \"struct ByRef { typedef const T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 89,\n \"score\": 134185.72993183482\n },\n {\n \"content\": \"class FinFaceRemovalTest : public TestBase {\\n\\n protected:\\n\\n void check_face_index(const MatrixIr& in_faces, \\n\\n const MatrixIr& out_faces, \\n\\n const VectorI& face_indices) {\\n\\n const size_t num_output_faces = out_faces.rows();\\n\\n ASSERT_EQ(num_output_faces, face_indices.size());\\n\\n for (size_t i=0; i<num_output_faces; i++) {\\n\\n const VectorI& input_f = in_faces.row(face_indices[i]);\\n\\n const VectorI& output_f = out_faces.row(i);\\n\\n ASSERT_TRUE((input_f.array() == output_f.array()).all());\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\nTEST_F(FinFaceRemovalTest, zero_fin) {\\n\\n MatrixF vertices(4, 3);\\n\\n vertices << 0.0, 0.0, 0.0,\\n\\n 1.0, 0.0, 0.0,\\n\\n 0.0, 1.0, 0.0,\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/tools/MeshUtils/FinFaceRemovalTest.h\",\n \"rank\": 90,\n \"score\": 131340.86002013297\n },\n {\n \"content\": \"class ShortEdgeRemovalTest : public TestBase {\\n\\n protected:\\n\\n void check_num_faces_left(const ShortEdgeRemoval& remover, size_t n) {\\n\\n MatrixIr faces_left = remover.get_faces();\\n\\n ASSERT_EQ(n, faces_left.rows());\\n\\n }\\n\\n\\n\\n void check_face_validity(const ShortEdgeRemoval& remover) {\\n\\n MatrixFr vertices_left = remover.get_vertices();\\n\\n MatrixIr faces_left = remover.get_faces();\\n\\n const size_t num_vertices = vertices_left.rows();\\n\\n for (size_t i=0; i<faces_left.size(); i++) {\\n\\n ASSERT_LT(faces_left.data()[i], num_vertices);\\n\\n }\\n\\n }\\n\\n\\n\\n /**\\n\\n * Assert that v is either one of vertices left unchanged or is within\\n\\n * threshold away from a vertex after remove short edges.\\n\\n */\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/tools/MeshUtils/ShortEdgeRemovalTest.h\",\n \"rank\": 91,\n \"score\": 131317.47737472053\n },\n {\n \"content\": \"class LongEdgeRemovalTest : public TestBase {\\n\\n protected:\\n\\n void ASSERT_NO_LONG_EDGES(\\n\\n const MatrixFr& vertices,\\n\\n const MatrixIr& faces,\\n\\n Float max_length) {\\n\\n const size_t num_faces = faces.rows();\\n\\n const size_t vertex_per_face = faces.cols();\\n\\n for (size_t i=0; i<num_faces; i++) {\\n\\n const auto& f = faces.row(i);\\n\\n for (size_t j=0; j<vertex_per_face; j++) {\\n\\n const auto& curr_v = vertices.row(f[j]);\\n\\n const auto& next_v = vertices.row(f[(j+1)%vertex_per_face]);\\n\\n ASSERT_LT((curr_v - next_v).norm(), max_length);\\n\\n }\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\nTEST_F(LongEdgeRemovalTest, SingleTraingle) {\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/tools/MeshUtils/LongEdgeRemovalTest.h\",\n \"rank\": 92,\n \"score\": 131317.47737472053\n },\n {\n \"content\": \"class FooTest : public ::testing::TestWithParam<const char*> {\\n\\n // You can implement all the usual class fixture members here.\\n\\n};\\n\\n\\n\\n// Then, use the TEST_P macro to define as many parameterized tests\\n\\n// for this fixture as you want. The _P suffix is for \\\"parameterized\\\"\\n\\n// or \\\"pattern\\\", whichever you prefer to think.\\n\\n\\n\\nTEST_P(FooTest, DoesBlah) {\\n\\n // Inside a test, access the test parameter with the GetParam() method\\n\\n // of the TestWithParam<T> class:\\n\\n EXPECT_TRUE(foo.Blah(GetParam()));\\n\\n ...\\n\\n}\\n\\n\\n\\nTEST_P(FooTest, HasBlahBlah) {\\n\\n ...\\n\\n}\\n\\n\\n\\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 93,\n \"score\": 130984.04053206244\n },\n {\n \"content\": \"struct LosslessArithmeticConvertibleImpl<kBool, bool, kBool, bool>\\n\\n : public true_type {}; // NOLINT\\n\\n\\n\\n// Converting bool to any integer type is lossless.\\n\\ntemplate <typename To>\\n\",\n \"file_path\": \"dependencies/PyMesh/tests/external/gmock-1.7.0/fused-src/gmock/gmock.h\",\n \"rank\": 94,\n \"score\": 129459.77695740892\n },\n {\n \"content\": \" m_edge_adj_faces.insert(Triplet(f[1], f[2]), i);\\n\\n m_edge_adj_faces.insert(Triplet(f[2], f[0]), i);\\n\\n m_edge_adj_faces.insert(Triplet(f[0], f[1]), i);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid EdgeSplitter::set_all_faces_as_valid() {\\n\\n const size_t num_faces = m_faces.rows();\\n\\n m_face_is_valid = std::vector<bool>(num_faces, true);\\n\\n}\\n\\n\\n\\nvoid EdgeSplitter::split_edge(const VectorI& edge,\\n\\n const std::vector<size_t>& adj_faces, Float max_length) {\\n\\n const auto v0 = m_vertices.row(edge[0]);\\n\\n const auto v1 = m_vertices.row(edge[1]);\\n\\n Float length = (v0 - v1).norm();\\n\\n if (length < max_length) return;\\n\\n\\n\\n bool adj_faces_are_valid = true;\\n\\n for (auto fi : adj_faces) {\\n\",\n \"file_path\": \"dependencies/PyMesh/tools/MeshUtils/EdgeSplitter.cpp\",\n \"rank\": 96,\n \"score\": 71.99981793630346\n },\n {\n \"content\": \" finalize_geometry();\\n\\n if (num_split == 0) break;\\n\\n } while (count < max_iterations);\\n\\n\\n\\n return total_num_split;\\n\\n}\\n\\n\\n\\nvoid ObtuseTriangleRemoval::clear_intermediate_data() {\\n\\n m_face_angles.clear();\\n\\n m_opp_vertices.clear();\\n\\n m_edges.clear();\\n\\n m_valid.clear();\\n\\n m_edge_faces.clear();\\n\\n m_new_vertices.clear();\\n\\n m_new_faces.clear();\\n\\n}\\n\\n\\n\\nvoid ObtuseTriangleRemoval::set_all_faces_as_valid() {\\n\\n m_valid = std::vector<bool>(m_faces.rows(), true);\\n\\n}\\n\",\n \"file_path\": \"dependencies/PyMesh/tools/MeshUtils/ObtuseTriangleRemoval.cpp\",\n \"rank\": 98,\n \"score\": 68.61228084790953\n }\n]","isConversational":false}}},{"rowIdx":85,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Sandbox/src/Sandbox2D.cpp"},"repo_name":{"kind":"string","value":"SunHailang/Hazel"},"commit":{"kind":"string","value":"1b4784c8d6bd2ad402ded34d677fd482a81a9d72"},"file_code":{"kind":"string","value":"#include \"Sandbox2D.h\"\r\n\r\n\r\n#include <imgui/imgui.h>\r\n#include <glm/gtc/matrix_transform.hpp>\r\n#include <glm/gtc/type_ptr.hpp>\r\n\r\n\r\nstatic const char* s_MapTiles = \"lajksdasd\";\r\n\r\nSandbox2D::Sandbox2D()\r\n\t:Hazel::Layer(\"Sandbox2D\"), m_CameraController(1280.0f / 720.0f, true)\r\n{\r\n\r\n}\r\n\r\nvoid Sandbox2D::OnAttach()\r\n{\r\n\tHZ_PROFILE_FUNCTION();\r\n\r\n\tm_texture = Hazel::Texture2D::Create(\"assets/textures/wall.jpg\");\r\n\r\n\r\n\tm_spriteSheet = Hazel::Texture2D::Create(\"assets/game/textures/RPGpack_sheet_2X.png\");\r\n\tm_textureStairs = Hazel::SubTexture2D::CreateFromCoords(m_spriteSheet, { 7, 6 }, { 128, 128 });\r\n\r\n\tm_Particle.ColorBegin = { 254 / 255.0f, 109 / 255.0f, 41 / 255.0f, 1.0f };\r\n\tm_Particle.ColorEnd = { 254 / 255.0f, 212 / 255.0f, 123 / 255.0f, 1.0f };\r\n\tm_Particle.SizeBegin = 0.5f;\r\n\tm_Particle.SizeVariation = 0.3f;\r\n\tm_Particle.SizeEnd = 0.0f;\r\n\tm_Particle.LiftTime = 1.0f;\r\n\tm_Particle.Velocity = { 0.0f, 0.0f };\r\n\tm_Particle.VelocityVariation = { 3.0f, 1.0f };\r\n\tm_Particle.Position = { 0.0f, 0.0f };\r\n\r\n\tm_CameraController.SetZoomLevel(5.0f);\r\n}\r\n\r\nvoid Sandbox2D::OnDetach()\r\n{\r\n\r\n}\r\n\r\nvoid Sandbox2D::OnUpdate(Hazel::Timestep ts)\r\n{\r\n\tHZ_PROFILE_FUNCTION();\r\n\r\n\t\n\tm_CameraController.OnUpdate(ts);\r\n\r\n\t\n\tHazel::Renderer2D::ResetStats();\r\n\t{\r\n\t\tHZ_PROFILE_SCOPE(\"Renderer Prep\");\r\n\t\tHazel::RendererCommand::SetClearColor(glm::vec4(0.2f, 0.2f, 0.2f, 1.0f));\r\n\t\tHazel::RendererCommand::Clear();\r\n\t}\r\n\t{\r\n\t\t\n\t\t\n\r\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\r\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\r\n\r\n\tif (Hazel::Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_LEFT))\r\n\t{\r\n\t\tauto [x, y] = Hazel::Input::GetMousePosition();\r\n\t\tauto width = Hazel::Application::Get().GetWindow().GetWidth();\r\n\t\tauto height = Hazel::Application::Get().GetWindow().GetHeight();\r\n\r\n\t\tauto bounds = m_CameraController.GetBounds();\r\n\t\tauto pos = m_CameraController.GetCamera().GetPosition();\r\n\r\n\t\tx = (x / width) * bounds.GetWidth() - bounds.GetWidth() * 0.5f;\r\n\t\ty = bounds.GetHeight() * 0.5f - (y / height) * bounds.GetHeight();\r\n\t\tm_Particle.Position = { (x + pos.x), (y + pos.y) };\r\n\r\n\t\tfor (int i = 0; i < 5; i++)\r\n\t\t{\r\n\t\t\tm_ParticleSystem.Emit(m_Particle);\r\n\t\t}\r\n\t}\r\n\r\n\tm_ParticleSystem.OnUpdate(ts);\r\n\tm_ParticleSystem.OnRender(m_CameraController.GetCamera());\r\n\r\n\tHazel::Renderer2D::BeginScene(m_CameraController.GetCamera());\r\n\tHazel::Renderer2D::DrawQuad({ 0.0f, 0.0f, 0.3f }, { 1.0f, 1.0f }, m_textureStairs);\r\n\tHazel::Renderer2D::EndScene();\r\n}\r\n\r\nvoid Sandbox2D::OnImGuiRender()\r\n{\r\n\tHZ_PROFILE_FUNCTION();\r\n\r\n\tImGui::Begin(\"Setting\");\r\n\tauto stats = Hazel::Renderer2D::GetStats();\r\n\tImGui::Text(\"Renderer2D Stats:\");\r\n\tImGui::Text(\"Draw Calls: %d\", stats.DrawCalls);\r\n\tImGui::Text(\"Quads: %d\", stats.QuadCount);\r\n\tImGui::Text(\"Vertics: %d\", stats.GetTotalVertexCount());\r\n\tImGui::Text(\"Indices: %d\", stats.GetTotalIndexCount());\r\n\tImGui::End();\r\n}\r\n\r\nvoid Sandbox2D::OnEvent(Hazel::Event& event)\r\n{\r\n\tm_CameraController.OnEvent(event);\r\n}\r\n"},"prefix":{"kind":"string","value":"#include \"Sandbox2D.h\"\r\n\r\n\r\n#include <imgui/imgui.h>\r\n#include <glm/gtc/matrix_transform.hpp>\r\n#include <glm/gtc/type_ptr.hpp>\r\n\r\n\r\nstatic const char* s_MapTiles = \"lajksdasd\";\r\n\r\nSandbox2D::Sandbox2D()\r\n\t:Hazel::Layer(\"Sandbox2D\"), m_CameraController(1280.0f / 720.0f, true)\r\n{\r\n\r\n}\r\n\r\nvoid Sandbox2D::OnAttach()\r\n{\r\n\tHZ_PROFILE_FUNCTION();\r\n\r\n\tm_texture = Hazel::Texture2D::Create(\"assets/textures/wall.jpg\");\r\n\r\n\r\n\tm_spriteSheet = Hazel::Texture2D::Create(\"assets/game/textures/RPGpack_sheet_2X.png\");\r\n\tm_textureStairs = Hazel::SubTexture2D::CreateFromCoords(m_spriteSheet, { 7, 6 }, { 128, 128 });\r\n\r\n\tm_Particle.ColorBegin = { 254 / 255.0f, 109 / 255.0f, 41 / 255.0f, 1.0f };\r\n\tm_Particle.ColorEnd = { 254 / 255.0f, 212 / 255.0f, 123 / 255.0f, 1.0f };\r\n\tm_Particle.SizeBegin = 0.5f;\r\n\tm_Particle.SizeVariation = 0.3f;\r\n\tm_Particle.SizeEnd = 0.0f;\r\n\tm_Particle.LiftTime = 1.0f;\r\n\tm_Particle.Velocity = { 0.0f, 0.0f };\r\n\tm_Particle.VelocityVariation = { 3.0f, 1.0f };\r\n\tm_Particle.Position = { 0.0f, 0.0f };\r\n\r\n\tm_CameraController.SetZoomLevel(5.0f);\r\n}\r\n\r\nvoid Sandbox2D::OnDetach()\r\n{\r\n\r\n}\r\n\r\nvoid Sandbox2D::OnUpdate(Hazel::Timestep ts)\r\n{\r\n\tHZ_PROFILE_FUNCTION();\r\n\r\n\t\n\tm_CameraController."},"suffix":{"kind":"string","value":"tWindow().GetWidth();\r\n\t\tauto height = Hazel::Application::Get().GetWindow().GetHeight();\r\n\r\n\t\tauto bounds = m_CameraController.GetBounds();\r\n\t\tauto pos = m_CameraController.GetCamera().GetPosition();\r\n\r\n\t\tx = (x / width) * bounds.GetWidth() - bounds.GetWidth() * 0.5f;\r\n\t\ty = bounds.GetHeight() * 0.5f - (y / height) * bounds.GetHeight();\r\n\t\tm_Particle.Position = { (x + pos.x), (y + pos.y) };\r\n\r\n\t\tfor (int i = 0; i < 5; i++)\r\n\t\t{\r\n\t\t\tm_ParticleSystem.Emit(m_Particle);\r\n\t\t}\r\n\t}\r\n\r\n\tm_ParticleSystem.OnUpdate(ts);\r\n\tm_ParticleSystem.OnRender(m_CameraController.GetCamera());\r\n\r\n\tHazel::Renderer2D::BeginScene(m_CameraController.GetCamera());\r\n\tHazel::Renderer2D::DrawQuad({ 0.0f, 0.0f, 0.3f }, { 1.0f, 1.0f }, m_textureStairs);\r\n\tHazel::Renderer2D::EndScene();\r\n}\r\n\r\nvoid Sandbox2D::OnImGuiRender()\r\n{\r\n\tHZ_PROFILE_FUNCTION();\r\n\r\n\tImGui::Begin(\"Setting\");\r\n\tauto stats = Hazel::Renderer2D::GetStats();\r\n\tImGui::Text(\"Renderer2D Stats:\");\r\n\tImGui::Text(\"Draw Calls: %d\", stats.DrawCalls);\r\n\tImGui::Text(\"Quads: %d\", stats.QuadCount);\r\n\tImGui::Text(\"Vertics: %d\", stats.GetTotalVertexCount());\r\n\tImGui::Text(\"Indices: %d\", stats.GetTotalIndexCount());\r\n\tImGui::End();\r\n}\r\n\r\nvoid Sandbox2D::OnEvent(Hazel::Event& event)\r\n{\r\n\tm_CameraController.OnEvent(event);\r\n}\r\n"},"middle":{"kind":"string","value":"OnUpdate(ts);\r\n\r\n\t\n\tHazel::Renderer2D::ResetStats();\r\n\t{\r\n\t\tHZ_PROFILE_SCOPE(\"Renderer Prep\");\r\n\t\tHazel::RendererCommand::SetClearColor(glm::vec4(0.2f, 0.2f, 0.2f, 1.0f));\r\n\t\tHazel::RendererCommand::Clear();\r\n\t}\r\n\t{\r\n\t\t\n\t\t\n\r\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\r\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\r\n\r\n\tif (Hazel::Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_LEFT))\r\n\t{\r\n\t\tauto [x, y] = Hazel::Input::GetMousePosition();\r\n\t\tauto width = Hazel::Application::Get().Ge"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#include \"hzpch.h\"\n\n#include \"OpenGLFramebuffer.h\"\n\n\n\n#include <glad/glad.h>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tstatic const uint32_t s_MaxFramebufferSize = 8192;\n\n\n\n\tnamespace Utils {\n\n\n\n\t\tstatic GLenum TextureTarget(bool multisampled)\n\n\t\t{\n\n\t\t\treturn multisampled ? GL_TEXTURE_2D_MULTISAMPLE : GL_TEXTURE_2D;\n\n\t\t}\n\n\n\n\t\tstatic void CreateTextures(bool multisampled, uint32_t* outID, uint32_t count)\n\n\t\t{\n\n\t\t\tglCreateTextures(TextureTarget(multisampled), count, outID);\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.cpp","rank":1,"score":10.326714682624264},{"content":"#include \"EditorLayer.h\"\n\n\n\n#include <imgui/imgui.h>\n\n#include <glm/gtc/matrix_transform.hpp>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\n#include \"ImGuizmo.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\tEditorLayer::EditorLayer()\n\n\t\t:Hazel::Layer(\"EditorLayer\"), m_CameraController(1280.0f / 720.0f, true)\n\n\t{\n\n\n\n\t}\n\n\n\n\tvoid EditorLayer::OnAttach()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n","file_path":"Hazel-Editor/src/EditorLayer.cpp","rank":2,"score":10.001562629951499},{"content":"\t\t\tm_OutputStream << \"\\\"ph\\\":\\\"X\\\",\";\n\n\t\t\tm_OutputStream << \"\\\"pid\\\":0,\";\n\n\t\t\tm_OutputStream << \"\\\"tid\\\":\" << result.ThreadID << \",\";\n\n\t\t\tm_OutputStream << \"\\\"ts\\\":\" << result.Start;\n\n\t\t\tm_OutputStream << \"}\";\n\n\n\n\t\t\tm_OutputStream.flush();\n\n\t\t}\n\n\n\n\t\tvoid WriteHeader()\n\n\t\t{\n\n\t\t\tm_OutputStream << \"{\\\"otherData\\\": {},\\\"traceEvents\\\":[\";\n\n\t\t\tm_OutputStream.flush();\n\n\t\t}\n\n\n\n\t\tvoid WriteFooter()\n\n\t\t{\n\n\t\t\tm_OutputStream << \"]}\";\n\n\t\t\tm_OutputStream.flush();\n\n\t\t}\n\n\n\n\t\tstatic Instrumentor& Get()\n\n\t\t{\n\n\t\t\tstatic Instrumentor instance;\n\n\t\t\treturn instance;\n\n\t\t}\n\n\t};\n\n\n","file_path":"Hazel/src/Hazel/Debug/Instrumentor.h","rank":3,"score":9.544574479417442},{"content":"\t\t};\n\n\n\n\t\tstatic void ResetStats();\n\n\t\tstatic Statistics GetStats();\n\n\n\n\tprivate:\n\n\t\tstatic void StartBatch();\n\n\t\tstatic void NextBatch();\n\n\t};\n\n}","file_path":"Hazel/src/Hazel/Renderer/Renderer2D.h","rank":4,"score":9.455072850878782},{"content":"#include \"ParticleSystem.h\"\n\n\n\n#include \"Random.h\"\n\n\n\n#define GLM_ENABLE_EXPERIMENTAL\n\n#include <glm/gtx/compatibility.hpp>\n\n\n\nParticleSystem::ParticleSystem(uint32_t maxParticles/* = 1000*/)\n\n\t:m_PoolIndex(maxParticles - 1)\n\n{\n\n\tm_PariclePool.resize(maxParticles);\n\n}\n\n\n\nvoid ParticleSystem::OnUpdate(Hazel::Timestep ts)\n\n{\n\n\tfor (auto& particle : m_PariclePool)\n\n\t{\n\n\t\tif (!particle.Active) continue;\n\n\n\n\t\tif (particle.LiftRemaining <= 0.0f)\n","file_path":"Sandbox/src/ParticleSystem.cpp","rank":6,"score":9.089576522608775},{"content":"#include \"hzpch.h\"\n\n#include \"Hazel/Utils/PlatformUtils.h\"\n\n\n\n#include \"Hazel/Core/Application.h\"\n\n\n\n\n\n#include <commdlg.h>\n\n#include <GLFW/glfw3.h>\n\n#define GLFW_EXPOSE_NATIVE_WIN32\n\n#include <GLFW/glfw3native.h>\n\n\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tstd::string FileDialogs::OpenFile(const char* filter)\n\n\t{\n\n\t\tOPENFILENAMEA ofn;\n\n\t\tCHAR szFile[260] = { 0 };\n\n\t\tCHAR currentDir[256] = { 0 };\n","file_path":"Hazel/src/Platform/Windows/WindowsPlatformUtils.cpp","rank":7,"score":8.930104606437943},{"content":"\t\t}\n\n\n\n\t\tm_Framebuffer->Unbind();\n\n\t}\n\n\n\n\tvoid EditorLayer::OnImGuiRender()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tstatic bool dockspaceOpen = true;\n\n\t\tstatic bool opt_fullscreen = true;\n\n\t\tstatic bool opt_padding = false;\n\n\t\tstatic ImGuiDockNodeFlags dockspace_flags = ImGuiDockNodeFlags_None;\n\n\n\n\t\t// We are using the ImGuiWindowFlags_NoDocking flag to make the parent window not dockable into,\n\n\t\t// because it would be confusing to have two docking targets within each others.\n\n\t\tImGuiWindowFlags window_flags = ImGuiWindowFlags_MenuBar | ImGuiWindowFlags_NoDocking;\n\n\t\tif (opt_fullscreen)\n\n\t\t{\n\n\t\t\tImGuiViewport* viewport = ImGui::GetMainViewport();\n","file_path":"Hazel-Editor/src/EditorLayer.cpp","rank":8,"score":8.797356009832791},{"content":"#include \"hzpch.h\"\n\n\n\n#include \"OrthographicCameraController.h\"\n\n\n\n#include \"Hazel/Core/Input.h\"\n\n#include \"Hazel/Core/KeyCodes.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tOrthographicCameraController::OrthographicCameraController(float aspectRatio, bool rotation/* = false*/)\n\n\t\t:m_AspectRatio(aspectRatio),\n\n\t\tm_Bounds{ -m_AspectRatio * m_ZoomLevel, m_AspectRatio * m_ZoomLevel, -m_ZoomLevel, m_ZoomLevel },\n\n\t\tm_Camera(-m_AspectRatio * m_ZoomLevel, m_AspectRatio * m_ZoomLevel, -m_ZoomLevel, m_ZoomLevel),\n\n\t\tm_Rotation(rotation)\n\n\t{\n\n\n\n\t}\n\n\n\n\tvoid OrthographicCameraController::OnUpdate(Timestep ts)\n","file_path":"Hazel/src/Hazel/Renderer/OrthographicCameraController.cpp","rank":9,"score":8.31210150219377},{"content":"#include \"hzpch.h\"\n\n#include \"Renderer.h\"\n\n\n\n#include \"RendererCommand.h\"\n\n#include \"Platform/OpenGL/OpenGLShader.h\"\n\n#include \"Renderer2D.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\tRenderer::SceneData* Renderer::m_SceneData = new Renderer::SceneData;\n\n\n\n\tvoid Renderer::Init()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tRendererCommand::Init();\n\n\t\tRenderer2D::Init();\n\n\t}\n\n\n\n\tvoid Renderer::Shutdown()\n","file_path":"Hazel/src/Hazel/Renderer/Renderer.cpp","rank":10,"score":7.929590523128617},{"content":"\tstatic void GLFWErrorCallback(int error, const char* description)\n\n\t{\n\n\t\tHZ_CORE_ERROR(\"GLFW_Error: ({0}, {1})\", error, description);\n\n\t}\n\n\n\n\tScope<Window> Window::Create(const WindowProps& props)\n\n\t{\n\n\t\treturn CreateScope<WindowsWindow>(props);\n\n\t}\n\n\n\n\tWindowsWindow::WindowsWindow(const WindowProps& props)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tInit(props);\n\n\t}\n\n\n\n\tWindowsWindow::~WindowsWindow()\n\n\t{\n\n\t\tif (m_Context != nullptr)\n","file_path":"Hazel/src/Platform/Windows/WindowsWindow.cpp","rank":11,"score":7.866503613818002},{"content":"\n\n\tm_Pillars.resize(5);\n\n\tfor (int i = 0; i < 5; i++)\n\n\t\tCreatePillar(i, i * 10.0f);\n\n}\n\n\n\nvoid Level::OnUpdate(Hazel::Timestep ts)\n\n{\n\n\tm_Player.OnUpdate(ts);\n\n\n\n\tif (CollisionTest())\n\n\t{\n\n\t\tGameOver();\n\n\t\treturn;\n\n\t}\n\n\n\n\tm_PillarHSV.x += 0.1f * ts;\n\n\tif (m_PillarHSV.x > 1.0f)\n\n\t\tm_PillarHSV.x = 0.0f;\n\n\n","file_path":"Sandbox/src/Level.cpp","rank":12,"score":7.70440045105941},{"content":"\t\t\t\t\ttranslation.x -= speed * ts;\n\n\t\t\t\tif (Input::IsKeyPressed(HZ_KEY_W))\n\n\t\t\t\t\ttranslation.y -= speed * ts;\n\n\t\t\t\tif (Input::IsKeyPressed(HZ_KEY_S))\n\n\t\t\t\t\ttranslation.y += speed * ts;\n\n\t\t\t}\n\n\t\t};\n\n\t\tm_CameraEntity.AddComponent<NativeScriptComponent>().Bind<CameraController>();\n\n#endif\n\n\t\t// Panels\n\n\t\tm_SceneHierarchyPanel.SetContext(m_ActiveScene);\n\n\t}\n\n\n\n\tvoid EditorLayer::OnDetach()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\t}\n\n\n\n\tvoid EditorLayer::OnUpdate(Hazel::Timestep ts)\n\n\t{\n","file_path":"Hazel-Editor/src/EditorLayer.cpp","rank":13,"score":7.647660926271703},{"content":"#include \"hzpch.h\"\n\n#include \"WindowsWindow.h\"\n\n\n\n#include \"Hazel/Events/ApplicationEvent.h\"\n\n#include \"Hazel/Events/MouseEvent.h\"\n\n#include \"Hazel/Events/KeyEvent.h\"\n\n\n\n#include \"Hazel/Renderer/Renderer.h\"\n\n\n\n#include \"Platform/OpenGL/OpenGLContext.h\"\n\n\n\n#include <glad/glad.h>\n\n\n\n\n\n\n\n\n\nnamespace Hazel\n\n{\n\n\tstatic uint8_t s_GLFWWindowCount = 0;\n\n\n","file_path":"Hazel/src/Platform/Windows/WindowsWindow.cpp","rank":14,"score":7.634099466622118},{"content":"\t\tfor (auto& vert : playerTransformedVerts)\n\n\t\t{\n\n\t\t\tif (PointInTri({ vert.x, vert.y }, tri[0], tri[1], tri[2]))\n\n \t\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\n\n\treturn false;\n\n}\n\n\n\nvoid Level::GameOver()\n\n{\n\n\tm_GameOver = true;\n\n}\n","file_path":"Sandbox/src/Level.cpp","rank":15,"score":7.595071809448658},{"content":"\t\tstatic void DrawQuad(const glm::mat4& transform, const glm::vec4& color, int entityID = -1);\n\n\t\tstatic void DrawQuad(const glm::mat4& transform, const Ref<Texture2D>& texture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f), int entityID = -1);\n\n\n\n\t\tstatic void DrawRotatedQuad(const glm::vec2& position, const glm::vec2& size, float rotation, const glm::vec4& color);\n\n\t\tstatic void DrawRotatedQuad(const glm::vec3& position, const glm::vec2& size, float rotation, const glm::vec4& color);\n\n\t\tstatic void DrawRotatedQuad(const glm::vec2& position, const glm::vec2& size, float rotation, const Ref<Texture2D>& texture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\n\n\t\tstatic void DrawRotatedQuad(const glm::vec3& position, const glm::vec2& size, float rotation, const Ref<Texture2D>& texture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\n\n\t\tstatic void DrawRotatedQuad(const glm::vec2& position, const glm::vec2& size, float rotation, const Ref<SubTexture2D>& subtexture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\n\n\t\tstatic void DrawRotatedQuad(const glm::vec3& position, const glm::vec2& size, float rotation, const Ref<SubTexture2D>& subtexture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\n\n\n\n\t\tstatic void DrawSprite(const glm::mat4& transform, SpriteRendererComponent& src, int entityID);\n\n\n\n\t\t// Stats\n\n\t\tstruct Statistics\n\n\t\t{\n\n\t\t\tuint32_t DrawCalls = 0;\n\n\t\t\tuint32_t QuadCount = 0;\n\n\n\n\t\t\tuint32_t GetTotalVertexCount() { return QuadCount * 4; }\n\n\t\t\tuint32_t GetTotalIndexCount() { return QuadCount * 6; }\n","file_path":"Hazel/src/Hazel/Renderer/Renderer2D.h","rank":16,"score":7.5747062616415715},{"content":"#include \"hzpch.h\"\n\n#include \"SceneSerializer.h\"\n\n\n\n#include \"Entity.h\"\n\n#include \"Components.h\"\n\n\n\n#include <fstream>\n\n#include <yaml-cpp/yaml.h>\n\n\n\nnamespace YAML\n\n{\n\n\ttemplate<>\n\n\tstruct convert<glm::vec3>\n\n\t{\n\n\t\tstatic Node encode(const glm::vec3& rsh)\n\n\t\t{\n\n\t\t\tNode node;\n\n\t\t\tnode.push_back(rsh.x);\n\n\t\t\tnode.push_back(rsh.y);\n\n\t\t\tnode.push_back(rsh.z);\n","file_path":"Hazel/src/Hazel/Scene/SceneSerializer.cpp","rank":17,"score":7.452936022838331},{"content":"#include \"hzpch.h\"\n\n#include \"OpenGLRendererAPI.h\"\n\n\n\n#include <glad/glad.h>\n\n#include <glm/glm.hpp>\n\n\n\nnamespace Hazel\n\n{\n\n\tvoid OpenGLRendererAPI::Init()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tglEnable(GL_BLEND);\n\n\t\tglBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n\n\n\n\t\tglEnable(GL_DEPTH_TEST);\n\n\t}\n\n\n\n\n\n\tvoid OpenGLRendererAPI::SetViewport(uint32_t x, uint32_t y, uint32_t width, uint32_t height)\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLRendererAPI.cpp","rank":18,"score":7.264945962419464},{"content":"\t\t\t\tfor (length_t i = 0; i < 3; i++)\n\n\t\t\t\t{\n\n\t\t\t\t\tscale[i] *= static_cast<T>(-1);\n\n\t\t\t\t\tRow[i] *= static_cast<T>(-1);\n\n\t\t\t\t}\n\n\t\t\t}\n\n#endif\n\n\n\n\t\t\trotation.y = asin(-Row[0][2]);\n\n\t\t\tif (cos(rotation.y) != 0) {\n\n\t\t\t\trotation.x = atan2(Row[1][2], Row[2][2]);\n\n\t\t\t\trotation.z = atan2(Row[0][1], Row[0][0]);\n\n\t\t\t}\n\n\t\t\telse {\n\n\t\t\t\trotation.x = atan2(-Row[2][0], Row[1][1]);\n\n\t\t\t\trotation.z = 0;\n\n\t\t\t}\n\n\n\n\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n}","file_path":"Hazel/src/Hazel/Math/Math.cpp","rank":19,"score":7.245567063002382},{"content":"#include \"hzpch.h\"\n\n#include \"OpenGLShader.h\"\n\n\n\n#include \"Hazel/Core/Core.h\"\n\n\n\n#include <glad/glad.h>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tstatic GLenum ShaderTypeFromString(const std::string& type)\n\n\t{\n\n\t\tif (type == \"vertex\")\n\n\t\t\treturn GL_VERTEX_SHADER;\n\n\n\n\t\tif (type == \"fragment\" || type == \"pixel\")\n\n\t\t\treturn GL_FRAGMENT_SHADER;\n\n\n\n\t\tHZ_CORE_ASSERT(false, \"Unknow Shader type!\");\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLShader.cpp","rank":20,"score":7.240998465253718},{"content":"\tm_Level.Init();\n\n\n\n\tImGuiIO io = ImGui::GetIO();\n\n\tm_Font = io.Fonts->AddFontFromFileTTF(\"assets/OpenSans-Regular.ttf\", 30.f);\n\n}\n\n\n\nvoid GameLayer::OnDetach()\n\n{\n\n\n\n}\n\n\n\nvoid GameLayer::OnUpdate(Hazel::Timestep ts)\n\n{\n\n\tm_Time += ts;\n\n\tif (((int)(m_Time * 10.0f)) % 8 > 4)\n\n\t\tm_Blink = !m_Blink;\n\n\n\n\tif (m_Level.IsGameOver())\n\n\t\tm_State = GameState::GameOver;\n\n\n","file_path":"Sandbox/src/GameLayer.cpp","rank":21,"score":7.114520280308195},{"content":"\t\t\ts_RendererAPI->Clear();\n\n\t\t}\n\n\n\n\t\tinline static void DrawIndexed(const Ref<VertexArray>& vertexArray, uint32_t indexCount = 0)\n\n\t\t{\n\n\t\t\ts_RendererAPI->DrawIndexed(vertexArray, indexCount);\n\n\t\t}\n\n\n\n\tprivate:\n\n\t\tstatic RendererAPI* s_RendererAPI;\n\n\t};\n\n\n\n}\n","file_path":"Hazel/src/Hazel/Renderer/RendererCommand.h","rank":22,"score":6.961845627764188},{"content":"#include \"hzpch.h\"\n\n\n\n#include \"LayerStack.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tLayerStack::LayerStack()\n\n\t{\n\n\t\t\n\n\t}\n\n\n\n\tLayerStack::~LayerStack()\n\n\t{\n\n\t\tfor (Layer* layer : m_Layers)\n\n\t\t\tdelete layer;\n\n\t}\n\n\n\n\tvoid LayerStack::PushLayer(Layer* layer)\n\n\t{\n","file_path":"Hazel/src/Hazel/Core/LayerStack.cpp","rank":23,"score":6.899483338282227},{"content":"#include \"GameLayer.h\"\n\n\n\n#include \"Random.h\"\n\n\n\n#include <imgui/imgui.h>\n\n\n\n#include <glm/gtc/matrix_transform.hpp>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\nGameLayer::GameLayer()\n\n\t:Hazel::Layer(\"GameLayer\")\n\n{\n\n\tauto& window = Hazel::Application::Get().GetWindow();\n\n\tCreateCamera(window.GetWidth(), window.GetHeight());\n\n\n\n\tRandom::Init();\n\n}\n\n\n\nvoid GameLayer::OnAttach()\n\n{\n","file_path":"Sandbox/src/GameLayer.cpp","rank":24,"score":6.88527433202152},{"content":"#include \"hzpch.h\"\n\n#include \"OpenGLContext.h\"\n\n\n\n\n\n#include <GLFW/glfw3.h>\n\n#include <glad/glad.h>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tOpenGLContext::OpenGLContext(GLFWwindow* windowHandle)\n\n\t\t: m_WindowHandle(windowHandle)\n\n\t{\n\n\t\tHZ_CORE_ASSERT(m_WindowHandle, \"Window Handle is null!\");\n\n\t}\n\n\n\n\tvoid OpenGLContext::Init()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLContext.cpp","rank":25,"score":6.829251790237164},{"content":"\tm_EngineParticle.Position = { 0.0f, 0.0f };\n\n\tm_SmokeParticle.Velocity = { -0.2f, 0.0f };\n\n\tm_SmokeParticle.VelocityVariation = { 3.0f, 1.0f };\n\n\tm_SmokeParticle.SizeBegin = 0.5f;\n\n\tm_SmokeParticle.SizeEnd = 0.0f;\n\n\tm_SmokeParticle.SizeVariation = 0.3f;\n\n\tm_SmokeParticle.ColorBegin = { 254 / 255.0f, 109 / 255.0f, 41 / 255.0f, 1.0f };\n\n\tm_SmokeParticle.ColorEnd = { 254 / 255.0f, 212 / 255.0f, 123 / 255.0f, 1.0f };\n\n\tm_SmokeParticle.LiftTime = 1.0f;\n\n}\n\n\n\nvoid Player::LoadAssets()\n\n{\n\n\tm_ShipTexture = Hazel::Texture2D::Create(\"assets/textures/Ship.png\");\n\n}\n\n\n\nvoid Player::OnUpdate(Hazel::Timestep ts)\n\n{\n\n\tm_Time += ts;\n\n\n","file_path":"Sandbox/src/Player.cpp","rank":26,"score":6.681893704376371},{"content":"\t\tm_Velcity.y -= m_Gravity;\n\n\t}\n\n\n\n\tm_Velcity.y = glm::clamp(m_Velcity.y, -20.0f, 20.0f);\n\n\tm_Position += m_Velcity * (float)ts;\n\n\tHZ_INFO(\"Player OnUpdate: m_VelcityX:{0} PositionX:{1}, ts:{2}\", m_Velcity.x, m_Position.x, (float)ts);\n\n\t// Particles\n\n\tif (m_Time > m_SmokeNextEmitTime)\n\n\t{\n\n\t\tm_SmokeParticle.Position = m_Position;\n\n\t\tm_ParticleSystem.Emit(m_SmokeParticle);\n\n\t\tm_SmokeNextEmitTime += m_SmokeEmitInterval;\n\n\t}\n\n\n\n\t//m_ParticleSystem.OnUpdate(ts);\n\n}\n\n\n\nvoid Player::OnRender()\n\n{\n\n\t//m_ParticleSystem.OnRender();\n","file_path":"Sandbox/src/Player.cpp","rank":27,"score":6.663964082923467},{"content":"\t\t\treturn node;\n\n\t\t}\n\n\n\n\t\tstatic bool decode(const Node& node, glm::vec3& rhs)\n\n\t\t{\n\n\t\t\tif (!node.IsSequence() || node.size() != 3)\n\n\t\t\t\treturn false;\n\n\t\t\trhs.x = node[0].as<float>();\n\n\t\t\trhs.y = node[1].as<float>();\n\n\t\t\trhs.z = node[2].as<float>();\n\n\t\t\treturn true;\n\n\t\t}\n\n\t};\n\n\ttemplate<>\n\n\tstruct convert<glm::vec4>\n\n\t{\n\n\t\tstatic Node encode(const glm::vec4& rhs)\n\n\t\t{\n\n\t\t\tNode node;\n\n\t\t\tnode.push_back(rhs.x);\n","file_path":"Hazel/src/Hazel/Scene/SceneSerializer.cpp","rank":28,"score":6.604816193523037},{"content":"\t\t{\n\n\t\t\tparticle.Active = false;\n\n\t\t\tcontinue;\n\n\t\t}\n\n\n\n\t\tparticle.LiftRemaining -= ts;\n\n\t\tparticle.Position += particle.Velocity * (float)ts;\n\n\t\tparticle.Rotation += 0.1f * ts;\n\n\t}\n\n}\n\n\n\nvoid ParticleSystem::OnRender(Hazel::OrthographicCamera& camera)\n\n{\n\n\tHazel::Renderer2D::BeginScene(camera);\n\n\tfor (auto& particle : m_PariclePool)\n\n\t{\n\n\t\tif (!particle.Active) continue;\n\n\n\n\t\t// Fade away particles\n\n\t\tfloat life = particle.LiftRemaining / particle.LiftTime;\n","file_path":"Sandbox/src/ParticleSystem.cpp","rank":29,"score":6.55468746441497},{"content":"#include \"hzpch.h\"\n\n#include \"SceneCamera.h\"\n\n\n\n#include <glm/gtc/matrix_transform.hpp>\n\n\n\nnamespace Hazel\n\n{\n\n\tSceneCamera::SceneCamera()\n\n\t{\n\n\t\tRecalculateProjection();\n\n\t}\n\n\n\n\n\n\tvoid SceneCamera::SetOrthographic(float size, float nearClip, float farClip)\n\n\t{\n\n\t\tm_ProjectionType = ProjectionType::Orthographic;\n\n\t\tm_OrthographicSize = size;\n\n\t\tm_OrthographicNear = nearClip;\n\n\t\tm_OrthographicFar = farClip;\n\n\n","file_path":"Hazel/src/Hazel/Scene/SceneCamera.cpp","rank":30,"score":6.3833105033719555},{"content":"\n\n\n\n\tvoid Application::Close()\n\n\t{\n\n\t\tm_Running = false;\n\n\t}\n\n\n\n\tbool Application::OnWindowClose(WindowCloseEvent& e)\n\n\t{\n\n\t\tm_Running = false;\n\n\t\treturn true;\n\n\t}\n\n\n\n\tbool Application::OnWindowResize(WindowResizeEvent& e)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tif (e.GetWidth() == 0 || e.GetHeight() == 0)\n\n\t\t{\n\n\t\t\tm_Minimized = true;\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tm_Minimized = false;\n\n\t\tRenderer::OnWindowResize(e.GetWidth(), e.GetHeight());\n\n\t\treturn false;\n\n\t}\n\n\n\n}\n","file_path":"Hazel/src/Hazel/Core/Application.cpp","rank":31,"score":6.332785741110651},{"content":"#include \"hzpch.h\"\n\n#include \"WindowsInput.h\"\n\n\n\n#include \"Hazel/Core/Application.h\"\n\n\n\n#include <GLFW/glfw3.h>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tInput* Input::s_Instance = new WindowsInput();\n\n\n\n\tbool WindowsInput::IsKeyPressedImpl(int keycode)\n\n\t{\n\n\t\tGLFWwindow* window = static_cast<GLFWwindow*>(Application::Get().GetWindow().GetNativeWindow());\n\n\t\tint state = glfwGetKey(window, keycode);\n\n\t\treturn state == GLFW_PRESS || state == GLFW_REPEAT;\n\n\t}\n\n\n\n\tbool WindowsInput::IsMouseButtonPressedImpl(int button)\n","file_path":"Hazel/src/Platform/Windows/WindowsInput.cpp","rank":32,"score":6.316393340615807},{"content":"\t{\n\n\t\tauto view = m_Registry.view<CameraComponent>();\n\n\t\tfor (auto entity : view)\n\n\t\t{\n\n\t\t\tconst auto& camera = view.get<CameraComponent>(entity);\n\n\t\t\tif (camera.Primary)\n\n\t\t\t\treturn Entity{ entity, this };\n\n\t\t}\n\n\t\treturn {};\n\n\t}\n\n\n\n\ttemplate<typename T>\n\n\tvoid Scene::OnComponentAdded(Entity entity, T& component)\n\n\t{\n\n\t\tstatic_assert(false);\n\n\t}\n\n\n\n\ttemplate<>\n\n\tvoid Scene::OnComponentAdded<TransformComponent>(Entity entity, TransformComponent& component)\n\n\t{\n","file_path":"Hazel/src/Hazel/Scene/Scene.cpp","rank":33,"score":6.069894363805872},{"content":"#include \"hzpch.h\"\n\n#include \"Log.h\"\n\n\n\n#include \"spdlog/sinks/stdout_color_sinks.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\tRef<spdlog::logger> Log::s_CoreLogger;\n\n\tRef<spdlog::logger> Log::s_ClientLogger;\n\n\n\n\n\n\tvoid Log::Init()\n\n\t{\n\n\t\tspdlog::set_pattern(\"%^[%T] %n: %v%$\");\n\n\t\ts_CoreLogger = spdlog::stdout_color_mt(\"HAZEL\");\n\n\t\ts_CoreLogger->set_level(spdlog::level::trace);\n\n\n\n\t\ts_ClientLogger = spdlog::stdout_color_mt(\"APP\");\n\n\t\ts_ClientLogger->set_level(spdlog::level::trace);\n\n\t}\n\n\n\n}\n","file_path":"Hazel/src/Hazel/Core/Log.cpp","rank":34,"score":5.993687697302027},{"content":"#include \"Level.h\"\n\n\n\n#include <glm/gtc/matrix_transform.hpp>\n\n\n\n\n\nstatic glm::vec4 HSVtoRGB(const glm::vec3& hsv)\n\n{\n\n\tint H = (int)(hsv.x * 360.0f);\n\n\tdouble S = hsv.y;\n\n\tdouble V = hsv.z;\n\n\n\n\tdouble C = S * V;\n\n\tdouble X = C * (1 - abs(fmod(H / 60.0f, 2) - 1));\n\n\tdouble m = V - C;\n\n\tdouble Rs, Gs, Bs;\n\n\n\n\tif (H >= 0 && H < 60)\n\n\t{\n\n\t\tRs = C;\n\n\t\tGs = X;\n","file_path":"Sandbox/src/Level.cpp","rank":35,"score":5.986137734037028},{"content":"#include \"hzpch.h\"\n\n\n\n#include \"OpenGLVertexArray.h\"\n\n\n\n#include <glad/glad.h>\n\n\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tstatic GLenum ShaderDataTypeToOpenGLBaseType(ShaderDataType type)\n\n\t{\n\n\t\tswitch (type)\n\n\t\t{\n\n\t\tcase ShaderDataType::Float:\t\treturn GL_FLOAT;\n\n\t\tcase ShaderDataType::Float2:\treturn GL_FLOAT;\n\n\t\tcase ShaderDataType::Float3:\treturn GL_FLOAT;\n\n\t\tcase ShaderDataType::Float4:\treturn GL_FLOAT;\n\n\t\tcase ShaderDataType::Mat3:\t\treturn GL_FLOAT;\n\n\t\tcase ShaderDataType::Mat4:\t\treturn GL_FLOAT;\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLVertexArray.cpp","rank":36,"score":5.859696505798498},{"content":"#include \"hzpch.h\"\n\n#include \"OrthographicCamera.h\"\n\n\n\n#include <glm/gtc/matrix_transform.hpp>\n\n\n\nnamespace Hazel\n\n{\n\n\tOrthographicCamera::OrthographicCamera(float left, float right, float bottom, float top)\n\n\t\t:m_ProjectionMatrix(glm::ortho(left, right, bottom, top, -1.0f, 1.0f)),\n\n\t\tm_ViewMatrix(1.0f),\n\n\t\tm_Position(glm::vec3(0.0f))\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tm_ViewProjectionMatrix = m_ProjectionMatrix * m_ViewMatrix;\n\n\t}\n\n\n\n\tvoid OrthographicCamera::SetProjection(float left, float right, float bottom, float top)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n","file_path":"Hazel/src/Hazel/Renderer/OrthographicCamera.cpp","rank":37,"score":5.8332572790514075},{"content":"\t\tbool OnWindowClose(WindowCloseEvent& e);\n\n\t\tbool OnWindowResize(WindowResizeEvent& e);\n\n\n\n\tprivate:\n\n\t\tScope<Window> m_Window;\n\n\t\tImGuiLayer* m_ImGuiLayer;\n\n\t\tbool m_Running = true;\n\n\t\tbool m_Minimized = false;\n\n\n\n\t\tLayerStack m_LayerStack;\n\n\t\tTimestep m_Timestep;\n\n\t\tfloat m_LastTime = 0.0f;\n\n\n\n\tprivate:\n\n\t\tstatic Application* s_Instance;\n\n\n\n\t};\n\n\n\n\tApplication* CreateApplication();\n\n}\n\n\n","file_path":"Hazel/src/Hazel/Core/Application.h","rank":38,"score":5.544082451358816},{"content":"\t\t}\n\n\n\n\t\tstatic void BindTexture(bool multisampled, uint32_t id)\n\n\t\t{\n\n\t\t\tglBindTexture(TextureTarget(multisampled), id);\n\n\t\t}\n\n\n\n\t\tstatic void AttachColorTexture(uint32_t id, int samples, GLenum internalFormat, GLenum format, uint32_t width, uint32_t height, int index)\n\n\t\t{\n\n\t\t\tbool multisampled = samples > 1;\n\n\t\t\tif (multisampled)\n\n\t\t\t{\n\n\t\t\t\tglTexImage2DMultisample(GL_TEXTURE_2D_MULTISAMPLE, samples, internalFormat, width, height, GL_FALSE);\n\n\t\t\t}\n\n\t\t\telse\n\n\t\t\t{\n\n\t\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, internalFormat, width, height, 0, format, GL_UNSIGNED_BYTE, nullptr);\n\n\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.cpp","rank":39,"score":5.423975416658351},{"content":"\n\n\tEntity Scene::CreateEntity(const std::string& name)\n\n\t{\n\n\t\tEntity entity = { m_Registry.create(), this };\n\n\t\tentity.AddComponent<TransformComponent>();\n\n\t\tauto& tag = entity.AddComponent<TagComponent>();\n\n\t\ttag.Tag = name.empty() ? \"Entity\" : name;\n\n\t\treturn entity;\n\n\t}\n\n\n\n\tvoid Scene::DestroyEntity(Entity entity)\n\n\t{\n\n\t\tm_Registry.destroy(entity);\n\n\t}\n\n\n\n\tvoid Scene::OnUpdateEditor(Timestep ts, EditorCamera& camera)\n\n\t{\n\n\t\tRenderer2D::BeginScene(camera);\n\n\n\n\t\tauto grop = m_Registry.group<TransformComponent>(entt::get<SpriteRendererComponent>);\n","file_path":"Hazel/src/Hazel/Scene/Scene.cpp","rank":40,"score":5.408079899890227},{"content":"\t\t\tnode.push_back(rhs.y);\n\n\t\t\tnode.push_back(rhs.z);\n\n\t\t\tnode.push_back(rhs.w);\n\n\t\t\tnode.SetStyle(EmitterStyle::Flow);\n\n\t\t\treturn node;\n\n\t\t}\n\n\n\n\t\tstatic bool decode(const Node& node, glm::vec4& rhs)\n\n\t\t{\n\n\t\t\tif (!node.IsSequence() || node.size() != 4)\n\n\t\t\t\treturn false;\n\n\n\n\t\t\trhs.x = node[0].as<float>();\n\n\t\t\trhs.y = node[1].as<float>();\n\n\t\t\trhs.z = node[2].as<float>();\n\n\t\t\trhs.w = node[3].as<float>();\n\n\t\t\treturn true;\n\n\t\t}\n\n\t};\n\n}\n","file_path":"Hazel/src/Hazel/Scene/SceneSerializer.cpp","rank":41,"score":5.400195524714958},{"content":"\t\t\tif (open)\n\n\t\t\t{\n\n\t\t\t\tuiFunction(component);\n\n\t\t\t\tImGui::TreePop();\n\n\t\t\t}\n\n\n\n\t\t\tif (removeComponent)\n\n\t\t\t\tentity.RemoveComponent<T>();\n\n\t\t}\n\n\t}\n\n\n\n\tvoid SceneHierarchyPanel::DrawComponent(Entity& entity)\n\n\t{\n\n\t\tif (entity.HasComponent<TagComponent>())\n\n\t\t{\n\n\t\t\tauto& tag = entity.GetComponent<TagComponent>().Tag;\n\n\n\n\t\t\tchar buffer[256];\n\n\t\t\tmemset(buffer, 0, sizeof(buffer));\n\n\t\t\tmemcpy(buffer, tag.c_str(), tag.size());\n","file_path":"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp","rank":42,"score":5.197739962966851},{"content":"\t\tCHAR szFile[260] = { 0 };\n\n\t\tCHAR currentDir[256] = { 0 };\n\n\t\tZeroMemory(&ofn, sizeof(OPENFILENAME));\n\n\t\tofn.lStructSize = sizeof(OPENFILENAME);\n\n\t\tofn.hwndOwner = glfwGetWin32Window((GLFWwindow*)Application::Get().GetWindow().GetNativeWindow());\n\n\t\tofn.lpstrFile = szFile;\n\n\t\tofn.nMaxFile = sizeof(szFile);\n\n\t\tif (GetCurrentDirectoryA(256, currentDir))\n\n\t\t\tofn.lpstrInitialDir = currentDir;\n\n\t\tofn.lpstrFilter = filter;\n\n\t\tofn.nFilterIndex = 1;\n\n\t\tofn.Flags = OFN_PATHMUSTEXIST | OFN_FILEMUSTEXIST | OFN_NOCHANGEDIR;\n\n\n\n\t\tif (GetSaveFileNameA(&ofn) == TRUE)\n\n\t\t\treturn ofn.lpstrFile;\n\n\n\n\t\treturn std::string();\n\n\t}\n\n\n\n}\n","file_path":"Hazel/src/Platform/Windows/WindowsPlatformUtils.cpp","rank":43,"score":5.157545825550708},{"content":"\tvoid OpenGLVertexArray::AddVertexBuffer(Ref<VertexBuffer>& vertexBuffer)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tglBindVertexArray(m_RendererID);\n\n\t\tvertexBuffer->Bind();\n\n\n\n\t\tuint32_t index = 0;\n\n\t\tconst auto& layout = vertexBuffer->GetLayout();\n\n\t\tfor (const auto& element : layout)\n\n\t\t{\n\n\t\t\tglEnableVertexAttribArray(index);\n\n\t\t\tglVertexAttribPointer(index,\n\n\t\t\t\telement.GetComponetCount(),\n\n\t\t\t\tShaderDataTypeToOpenGLBaseType(element.Type),\n\n\t\t\t\telement.Normalized ? GL_TRUE : GL_FALSE,\n\n\t\t\t\tlayout.GetStride(),\n\n\t\t\t\t(const void*)(element.Offset));\n\n\t\t\tindex++;\n\n\t\t}\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLVertexArray.cpp","rank":44,"score":5.117319812498209},{"content":"\n\n\t\tuint32_t indicesSquare[6] = { 0, 1, 2, 2, 3, 0 };\n\n\t\tHazel::Ref<Hazel::IndexBuffer> indexBufferSquare = Hazel::IndexBuffer::Create(indicesSquare, sizeof(indicesSquare) / sizeof(uint32_t));\n\n\t\tm_SquareVA->SetIndexBuffer(indexBufferSquare);\n\n\n\n\t\tauto textureShader = m_ShaderLibrary.Load(\"assets/shaders/Texture.glsl\");\n\n\n\n\n\n\n\n\t\tm_TextureWall = Hazel::Texture2D::Create(\"assets/textures/wall.jpg\");\n\n\t\tm_TextureBox = Hazel::Texture2D::Create(\"assets/textures/box.png\");\n\n\n\n\t}\n\n\n\n\tvoid OnUpdate(Hazel::Timestep ts) override\n\n\t{\n\n\t\t// Update\n\n\t\tm_CameraController.OnUpdate(ts);\n\n\n\n\t\tHazel::RendererCommand::SetClearColor(glm::vec4(0.2f, 0.2f, 0.2f, 1.0f));\n","file_path":"Sandbox/src/SandboxApp.cpp","rank":45,"score":5.020215109676801},{"content":"#include \"hzpch.h\"\n\n#include \"ImGuiLayer.h\"\n\n\n\n#include \"imgui.h\"\n\n\n\n//#define IMGUI_IMPL_API\n\n#include <examples/imgui_impl_opengl3.h>\n\n#include <examples/imgui_impl_glfw.h>\n\n\n\n#include \"Hazel/Core/Application.h\"\n\n\n\n// TEMPORARY\n\n#include <GLFW/glfw3.h>\n\n#include <glad/glad.h>\n\n\n\n#include \"ImGuizmo.h\"\n\n\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/ImGui/ImGuiLayer.cpp","rank":46,"score":4.936438350196774},{"content":"#include <Hazel.h>\n\n\n\n#include <Hazel/Core/EntryPoint.h>\n\n\n\n#include <imgui/imgui.h>\n\n#include <glm/gtc/matrix_transform.hpp>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\n#include \"Sandbox2D.h\"\n\n#include \"GameLayer.h\"\n\n\n","file_path":"Sandbox/src/SandboxApp.cpp","rank":47,"score":4.924026578097971},{"content":"#pragma once\n\n\n\n#include \"OrthographicCamera.h\"\n\n#include \"Camera.h\"\n\n#include \"Texture.h\"\n\n#include \"SubTexture2D.h\"\n\n#include \"EditorCamera.h\"\n\n\n\n#include \"Hazel/Scene/Components.h\"\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Renderer/Renderer2D.h","rank":48,"score":4.921526368840995},{"content":"\t{\n\n\t\t\"MultiProcessorCompile\"\n\n\t}\n\n\n\noutputdir = \"%{cfg.buildcfg}-%{cfg.system}-%{cfg.architecture}\"\n\n\n\n-- Include directories relative to root folder (solution directory)\n\nIncludeDir = {}\n\nIncludeDir[\"GLFW\"] = \"%{wks.location}/Hazel/vendor/GLFW/include\"\n\nIncludeDir[\"Glad\"] = \"%{wks.location}/Hazel/vendor/Glad/include\"\n\nIncludeDir[\"ImGui\"] = \"%{wks.location}/Hazel/vendor/imgui\"\n\nIncludeDir[\"glm\"] = \"%{wks.location}/Hazel/vendor/glm\"\n\nIncludeDir[\"stb_image\"] = \"%{wks.location}/Hazel/vendor/stb_image\"\n\nIncludeDir[\"entt\"] = \"%{wks.location}/Hazel/vendor/entt/include\"\n\nIncludeDir[\"yaml_cpp\"] = \"%{wks.location}/Hazel/vendor/yaml-cpp/include\"\n\nIncludeDir[\"ImGuizmo\"] = \"%{wks.location}/Hazel/vendor/ImGuizmo\"\n\n\n\ngroup \"Dependencies\"\n\n\tinclude \"vendor/premake\"\n\n\tinclude \"Hazel/vendor/GLFW\"\n\n\tinclude \"Hazel/vendor/Glad\"\n\n\tinclude \"Hazel/vendor/imgui\"\n\n\tinclude \"Hazel/vendor/yaml-cpp\"\n\ngroup \"\"\n\n\n\ninclude \"Hazel\"\n\ninclude \"Sandbox\"\n\ninclude \"Hazel-Editor\"","file_path":"premake5.lua","rank":49,"score":4.908407273071825},{"content":"#include \"hzpch.h\"\n\n#include \"Scene.h\"\n\n\n\n#include \"Entity.h\"\n\n#include \"Components.h\"\n\n#include \"Hazel/Renderer/Renderer2D.h\"\n\n\n\n//#include <glm/glm.hpp>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tScene::Scene()\n\n\t{\n\n\t}\n\n\n\n\tScene::~Scene()\n\n\t{\n\n\n\n\t}\n","file_path":"Hazel/src/Hazel/Scene/Scene.cpp","rank":50,"score":4.894566638033482},{"content":"#pragma once\n\n\n\n#include <Hazel.h>\n\n\n\n#include \"Color.h\"\n\n#include \"Random.h\"\n\n#include \"ParticleSystem.h\"\n\n\n","file_path":"Sandbox/src/Player.h","rank":51,"score":4.892619696021304},{"content":"#pragma once\n\n\n\n#include \"Hazel/Core/Core.h\"\n\n\n\n#include \"Window.h\"\n\n#include \"LayerStack.h\"\n\n#include \"Hazel/Events/Event.h\"\n\n#include \"Hazel/Events/ApplicationEvent.h\"\n\n\n\n#include \"Timestep.h\"\n\n\n\n#include \"Hazel/ImGui/ImGuiLayer.h\"\n\n\n\nnamespace Hazel \n\n{\n","file_path":"Hazel/src/Hazel/Core/Application.h","rank":52,"score":4.889383184989084},{"content":"#include \"hzpch.h\"\n\n\n\n#include \"Renderer2D.h\"\n\n#include \"VertexArray.h\"\n\n#include \"Shader.h\"\n\n#include \"Buffer.h\"\n\n#include \"RendererCommand.h\"\n\n#include \"Texture.h\"\n\n\n\n#include \"Platform/OpenGL/OpenGLShader.h\"\n\n\n\n#include <glm/gtc/matrix_transform.hpp>\n\n\n\nnamespace Hazel\n\n{\n\n\tstruct QuadVertex\n\n\t{\n\n\t\tglm::vec3 Position;\n\n\t\tglm::vec4 Color;\n\n\t\tglm::vec2 TexCoord;\n","file_path":"Hazel/src/Hazel/Renderer/Renderer2D.cpp","rank":53,"score":4.882488968284861},{"content":"#include <Hazel.h>\n\n\n\n#include <Hazel/Core/EntryPoint.h>\n\n\n\n#include <imgui/imgui.h>\n\n#include <glm/gtc/matrix_transform.hpp>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\n#include \"EditorLayer.h\"\n\n\n","file_path":"Hazel-Editor/src/HazelEditorApp.cpp","rank":54,"score":4.8811972325335296},{"content":"\t\t\"vendor/ImGuizmo/ImGuizmo.h\",\n\n\t\t\"vendor/ImGuizmo/ImGuizmo.cpp\"\n\n\t}\n\n\n\n\tdefines\n\n\t{\n\n\t\t\"_CRT_SECURE_NO_WARNINGS\",\n\n\t\t\"GLFW_INCLUDE_NONE\"\n\n\t}\n\n\n\n\tincludedirs\n\n\t{\n\n\t\t\"src\",\n\n\t\t\"vendor/spdlog/include\",\n\n\t\t\"%{IncludeDir.GLFW}\",\n\n\t\t\"%{IncludeDir.Glad}\",\n\n\t\t\"%{IncludeDir.ImGui}\",\n\n\t\t\"%{IncludeDir.glm}\",\n\n\t\t\"%{IncludeDir.stb_image}\",\n\n\t\t\"%{IncludeDir.entt}\",\n","file_path":"Hazel/premake5.lua","rank":55,"score":4.826129351651299},{"content":"\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_R, GL_CLAMP_TO_EDGE);\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n\t\t\t}\n\n\n\n\t\t\tglFramebufferTexture2D(GL_FRAMEBUFFER, attachmentType, TextureTarget(multisampled), id, 0);\n\n\t\t}\n\n\n\n\t\tstatic bool IsDepthFormat(FramebufferTextureFormat format)\n\n\t\t{\n\n\t\t\tswitch (format)\n\n\t\t\t{\n\n\t\t\tcase FramebufferTextureFormat::DEPTH24STENCIL8: return true;\n\n\t\t\t}\n\n\n\n\t\t\treturn false;\n\n\t\t}\n\n\n\n\t\tstatic GLenum HazelFBTextureFormatToGL(FramebufferTextureFormat format)\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.cpp","rank":56,"score":4.7946632836856224},{"content":"\t{\n\n\n\n\t}\n\n\n\n\tstatic void SerializerEntity(YAML::Emitter& out, Entity entity)\n\n\t{\n\n\t\tout << YAML::BeginMap; // Entity\n\n\t\tout << YAML::Key << \"Entity\" << YAML::Value << (uint32_t)entity; // TODO: Entity ID goes here\n\n\n\n\t\tif (entity.HasComponent<TagComponent>())\n\n\t\t{\n\n\t\t\tout << YAML::Key << \"TagComponent\";\n\n\t\t\tout << YAML::BeginMap; // TagComponent\n\n\n\n\t\t\tauto& tag = entity.GetComponent<TagComponent>().Tag;\n\n\t\t\tout << YAML::Key << \"Tag\" << YAML::Value << tag;\n\n\n\n\t\t\tout << YAML::EndMap; // TagComponent\n\n\t\t}\n\n\n","file_path":"Hazel/src/Hazel/Scene/SceneSerializer.cpp","rank":57,"score":4.7914879298459265},{"content":"#pragma once\n\n\n\n#include <Hazel.h>\n\n\n\n#include \"Level.h\"\n\n#include <imgui/imgui.h>\n\n\n","file_path":"Sandbox/src/GameLayer.h","rank":58,"score":4.773107696931341},{"content":"#pragma once\n\n\n\n#include \"Camera.h\"\n\n#include \"Hazel/Core/Timestep.h\"\n\n#include \"Hazel/Events/Event.h\"\n\n#include \"Hazel/Events/MouseEvent.h\"\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Renderer/EditorCamera.h","rank":59,"score":4.736988543533212},{"content":"#pragma once\n\n\n\n#include \"Shader.h\"\n\n#include \"RendererCommand.h\"\n\n#include \"OrthographicCamera.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel/src/Hazel/Renderer/Renderer.h","rank":60,"score":4.697820624802768},{"content":"#pragma once\n\n\n\n#include \"Core.h\"\n\n\n\n#include \"spdlog/spdlog.h\"\n\n#include \"spdlog/fmt/ostr.h\"\n\n\t\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel/src/Hazel/Core/Log.h","rank":61,"score":4.673249958683749},{"content":"#pragma once\n\n\n\n#include \"Hazel/Core/Core.h\"\n\n#include \"Texture.h\"\n\n\n\n#include <glm/glm.hpp>\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Renderer/SubTexture2D.h","rank":62,"score":4.648934975584767},{"content":"\t\tImGui::End();\n\n\t}\n\n\n\n\tvoid SceneHierarchyPanel::DrawEntityNode(Entity& entity)\n\n\t{\n\n\t\tauto& tag = entity.GetComponent<TagComponent>().Tag;\n\n\n\n\t\tImGuiTreeNodeFlags flags = ((m_SelectionContext == entity) ? ImGuiTreeNodeFlags_Selected : 0) | ImGuiTreeNodeFlags_OpenOnArrow;\n\n\t\tflags |= ImGuiTreeNodeFlags_SpanAvailWidth;\n\n\t\tbool opened = ImGui::TreeNodeEx((void*)((uint64_t)(uint32_t)entity), flags, tag.c_str());\n\n\t\tif (ImGui::IsItemClicked())\n\n\t\t{\n\n\t\t\tm_SelectionContext = entity;\n\n\t\t}\n\n\n\n\t\tbool entityDelete = false;\n\n\t\tif (ImGui::BeginPopupContextItem())\n\n\t\t{\n\n\t\t\tif (ImGui::MenuItem(\"Delete Entity\"))\n\n\t\t\t\tentityDelete = true;\n","file_path":"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp","rank":63,"score":4.629583990179634},{"content":"#pragma once\n\n\n\n#include \"Hazel/Core/Window.h\"\n\n#include \"Hazel/Renderer/GraphicsContext.h\"\n\n\n\n#include <GLFW/glfw3.h>\n\n\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Platform/Windows/WindowsWindow.h","rank":64,"score":4.601056258989728},{"content":"#pragma once\n\n\n\n#include \"Hazel/Core/Timestep.h\"\n\n#include \"Hazel/Renderer/EditorCamera.h\"\n\n\n\n#include \"entt.hpp\"\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Scene/Scene.h","rank":65,"score":4.601056258989728},{"content":"\n\n\tOpenGLVertexBuffer::OpenGLVertexBuffer(float* vertices, uint32_t size)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tglCreateBuffers(1, &m_RendererID);\n\n\t\tglBindBuffer(GL_ARRAY_BUFFER, m_RendererID);\n\n\t\tglBufferData(GL_ARRAY_BUFFER, size, vertices, GL_STATIC_DRAW);\n\n\t}\n\n\n\n\n\n\tOpenGLVertexBuffer::~OpenGLVertexBuffer()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tglDeleteBuffers(1, &m_RendererID);\n\n\t}\n\n\n\n\tvoid OpenGLVertexBuffer::Bind() const\n\n\t{\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLBuffer.cpp","rank":66,"score":4.5730185570421025},{"content":"#pragma once\n\n\n\n#include \"Hazel.h\"\n\n\n\n#include \"ParticleSystem.h\"\n\n\n","file_path":"Sandbox/src/Sandbox2D.h","rank":67,"score":4.550783749001534},{"content":"\t\tuint32_t QuadIndexCount = 0;\n\n\t\tQuadVertex* QuadVertexBufferBase = nullptr;\n\n\t\tQuadVertex* QuadVertexBufferPtr = nullptr;\n\n\n\n\t\tstd::array<Ref<Texture2D>, MaxTextureSlots> TextureSlots;\n\n\t\tuint32_t TextureSlotIndex = 1; // 0 = White texture\n\n\n\n\t\tglm::vec4 QuadVertexPositions[4];\n\n\n\n\t\tRenderer2D::Statistics Stats;\n\n\t};\n\n\n\n\tstatic Renderer2DStorage s_Data;\n\n\n\n\tvoid Renderer2D::Init()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\ts_Data.QuadVertexArray = VertexArray::Create();\n\n\n","file_path":"Hazel/src/Hazel/Renderer/Renderer2D.cpp","rank":68,"score":4.538529282854405},{"content":"#pragma once\n\n\n\n#include \"hzpch.h\"\n\n#include \"Event.h\"\n\n\n\n\n\n\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel/src/Hazel/Events/MouseEvent.h","rank":69,"score":4.516280510865067},{"content":"#pragma once\n\n#include \"hzpch.h\"\n\n#include \"Event.h\"\n\n\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Events/KeyEvent.h","rank":70,"score":4.516280510865067},{"content":"#pragma once\n\n\n\n#include <memory>\n\n#include \"Buffer.h\"\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Renderer/VertexArray.h","rank":71,"score":4.516280510865067},{"content":"\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tif (Input::IsKeyPressed(HZ_KEY_A))\n\n\t\t\tm_CameraPosition.x += m_CameraTranslationSpeed * ts;\n\n\t\telse if (Input::IsKeyPressed(HZ_KEY_D))\n\n\t\t\tm_CameraPosition.x -= m_CameraTranslationSpeed * ts;\n\n\n\n\t\tif (Input::IsKeyPressed(HZ_KEY_W))\n\n\t\t\tm_CameraPosition.y -= m_CameraTranslationSpeed * ts;\n\n\t\telse if (Input::IsKeyPressed(HZ_KEY_S))\n\n\t\t\tm_CameraPosition.y += m_CameraTranslationSpeed * ts;\n\n\n\n\t\tif (m_Rotation) \n\n\t\t{\n\n\t\t\tif (Input::IsKeyPressed(HZ_KEY_Q))\n\n\t\t\t\tm_CameraRotation += m_CameraRotationSpeed * ts;\n\n\t\t\telse if (Input::IsKeyPressed(HZ_KEY_E))\n\n\t\t\t\tm_CameraRotation -= m_CameraRotationSpeed * ts;\n\n\n","file_path":"Hazel/src/Hazel/Renderer/OrthographicCameraController.cpp","rank":72,"score":4.513161420932953},{"content":"#include \"hzpch.h\"\n\n\n\n#define IMGUI_IMPL_OPENGL_LOADER_GLAD\n\n#include <examples/imgui_impl_opengl3.cpp>\n\n#include <examples/imgui_impl_glfw.cpp>\n\n\n","file_path":"Hazel/src/Hazel/ImGui/ImGuiBuild.cpp","rank":73,"score":4.485565758033494},{"content":"#pragma once\n\n\n\n#include \"Scene.h\"\n\n\n\n#include \"entt.hpp\"\n\n\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel/src/Hazel/Scene/Entity.h","rank":74,"score":4.482296530714082},{"content":"\t\t\tif (epsilonEqual(LocalMatrix[3][3], static_cast<float>(0), epsilon<T>()))\n\n\t\t\t\treturn false;\n\n\n\n\t\t\t// First, isolate perspective. This is the messiest.\n\n\t\t\tif (\n\n\t\t\t\tepsilonNotEqual(LocalMatrix[0][3], static_cast<T>(0), epsilon<T>()) ||\n\n\t\t\t\tepsilonNotEqual(LocalMatrix[1][3], static_cast<T>(0), epsilon<T>()) ||\n\n\t\t\t\tepsilonNotEqual(LocalMatrix[2][3], static_cast<T>(0), epsilon<T>()))\n\n\t\t\t{\n\n\t\t\t\t// Clear the perspective partition\n\n\t\t\t\tLocalMatrix[0][3] = LocalMatrix[1][3] = LocalMatrix[2][3] = static_cast<T>(0);\n\n\t\t\t\tLocalMatrix[3][3] = static_cast<T>(1);\n\n\t\t\t}\n\n\n\n\t\t\t// Next take care of translation (easy).\n\n\t\t\ttranslation = vec3(LocalMatrix[3]);\n\n\t\t\tLocalMatrix[3] = vec4(0, 0, 0, LocalMatrix[3].w);\n\n\n\n\t\t\tvec3 Row[3], Pdum3;\n\n\n","file_path":"Hazel/src/Hazel/Math/Math.cpp","rank":75,"score":4.475995144329643},{"content":"#pragma once\n\n\n\n#include \"Hazel/Core/Core.h\"\n\n#include \"Scene.h\"\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Hazel/Scene/SceneSerializer.h","rank":76,"score":4.448820174200882},{"content":"\t\tfor (auto entity : grop)\n\n\t\t{\n\n\t\t\tauto [transform, sprite] = grop.get<TransformComponent, SpriteRendererComponent>(entity);\n\n\t\t\t//Renderer2D::DrawQuad(transform.GetTransform(), sprite.Color);\n\n\t\t\tRenderer2D::DrawSprite(transform.GetTransform(), sprite, (int)entity);\n\n\t\t}\n\n\n\n\t\tRenderer2D::EndScene();\n\n\t}\n\n\n\n\tvoid Scene::OnUpdateRuntime(Timestep ts)\n\n\t{\n\n\t\t// Update Script\n\n\t\t{\n\n\t\t\tm_Registry.view<NativeScriptComponent>().each([=](auto entity, auto& nsc)\n\n\t\t\t\t{\n\n\t\t\t\t\t// TODO: Move To Scene::OnScenePlay\n\n\t\t\t\t\tif (!nsc.Instance)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tnsc.Instance = nsc.InstantiateScript();\n","file_path":"Hazel/src/Hazel/Scene/Scene.cpp","rank":77,"score":4.42453744156035},{"content":"#pragma once\n\n\n\n#include \"Hazel/Renderer/Texture.h\"\n\n#include <glad/glad.h>\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLTexture.h","rank":78,"score":4.415840151969048},{"content":"#pragma once\n\n\n\n#include <glm/glm.hpp>\n\n\n\n#include \"VertexArray.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel/src/Hazel/Renderer/RendererAPI.h","rank":79,"score":4.415840151969048},{"content":"#pragma once\n\n\n\n#include \"Hazel.h\"\n\n\n\n#include \"Panels/SceneHierarchyPanel.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel-Editor/src/EditorLayer.h","rank":80,"score":4.415840151969048},{"content":"#include \"hzpch.h\"\n\n#include \"EditorCamera.h\"\n\n\n\n#include \"Hazel/Core/Input.h\"\n\n#include \"Hazel/Core/KeyCodes.h\"\n\n#include \"Hazel/Core/MouseButtonCodes.h\"\n\n\n\n#include <glfw/glfw3.h>\n\n\n\n#define GLM_ENABLE_EXPERIMENTAL\n\n#include <glm/gtx/quaternion.hpp>\n\n\n\nnamespace Hazel {\n\n\n\n\tEditorCamera::EditorCamera(float fov, float aspectRatio, float nearClip, float farClip)\n\n\t\t: m_FOV(fov), m_AspectRatio(aspectRatio), m_NearClip(nearClip), m_FarClip(farClip), Camera(glm::perspective(glm::radians(fov), aspectRatio, nearClip, farClip))\n\n\t{\n\n\t\tUpdateView();\n\n\t}\n\n\n","file_path":"Hazel/src/Hazel/Renderer/EditorCamera.cpp","rank":81,"score":4.403960516471075},{"content":"#include \"SceneHierarchyPanel.h\"\n\n\n\n#include <imgui/imgui.h>\n\n#include <imgui/imgui_internal.h>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\n#include <cstring>\n\n\n\n/* The Microsoft C++ compiler is non-compliant with the C++ standard and needs\n\n * the following definition to disable a security warning on std::strncpy().\n\n */\n\n#ifdef _MSVC_LANG\n\n#define _CRT_SECURE_NO_WARNINGS\n\n#endif\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tSceneHierarchyPanel::SceneHierarchyPanel(const Ref<Scene>& scene)\n\n\t{\n","file_path":"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp","rank":82,"score":4.3954535247075155},{"content":"#pragma once\n\n\n\n#include \"Hazel/Events/Event.h\"\n\n#include \"Hazel/Core/Timestep.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n","file_path":"Hazel/src/Hazel/Core/Layer.h","rank":83,"score":4.383345506960088},{"content":"#pragma once\n\n\n\n#include \"Hazel/Core/Core.h\"\n\n#include \"Hazel/Renderer/Framebuffer.h\"\n\n\n\nnamespace Hazel\n\n{\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.h","rank":84,"score":4.383345506960088},{"content":"\t/////////////////////////////////////////////////////////////////////\n\n\tOpenGLIndexBuffer::OpenGLIndexBuffer(uint32_t* indices, uint32_t count)\n\n\t\t: m_Count(count)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tglCreateBuffers(1, &m_RendererID);\n\n\t\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_RendererID);\n\n\t\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, count * sizeof(uint32_t), indices, GL_STATIC_DRAW);\n\n\t}\n\n\n\n\tOpenGLIndexBuffer::~OpenGLIndexBuffer()\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tglDeleteBuffers(1, &m_RendererID);\n\n\t}\n\n\n\n\tvoid OpenGLIndexBuffer::Bind() const\n\n\t{\n","file_path":"Hazel/src/Platform/OpenGL/OpenGLBuffer.cpp","rank":85,"score":4.373602786482774},{"content":"#include \"hzpch.h\"\n\n#include \"Application.h\"\n\n\n\n#include \"Hazel/Renderer/Renderer.h\"\n\n\n\n#include <glfw/glfw3.h>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tApplication* Application::s_Instance = nullptr;\n\n\n\n\tApplication::Application(const std::string& name/* = \"\"*/)\n\n\t{\n\n\t\tHZ_PROFILE_FUNCTION();\n\n\n\n\t\tHZ_CORE_ASSERT(!s_Instance, \"Application already exists!\");\n\n\t\ts_Instance = this;\n\n\n\n\t\tm_Window = Window::Create(WindowProps(name));\n","file_path":"Hazel/src/Hazel/Core/Application.cpp","rank":86,"score":4.371933828599548},{"content":"#include \"hzpch.h\"\n\n#include \"RendererCommand.h\"\n\n\n\n#include \"Platform/OpenGL/OpenGLRendererAPI.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tRendererAPI* RendererCommand::s_RendererAPI = new OpenGLRendererAPI();\n\n\n\n}","file_path":"Hazel/src/Hazel/Renderer/RendererCommand.cpp","rank":87,"score":4.354406504100932},{"content":"#pragma once\n\n\n\n#include \"Hazel/Renderer/OrthographicCamera.h\"\n\n#include \"Hazel/Core/Timestep.h\"\n\n\n\n#include \"Hazel/Events/ApplicationEvent.h\"\n\n#include \"Hazel/Events/MouseEvent.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\tstruct OrthographicCameraBounds\n\n\t{\n\n\t\tfloat Left, Right;\n\n\t\tfloat Bottom, Top;\n\n\n\n\t\tfloat GetWidth() { return Right - Left; }\n\n\t\tfloat GetHeight() { return Top - Bottom; }\n\n\t};\n\n\n","file_path":"Hazel/src/Hazel/Renderer/OrthographicCameraController.h","rank":88,"score":4.340079823461601},{"content":"\n\n\tvoid EditorCamera::OnUpdate(Timestep ts)\n\n\t{\n\n\t\tif (Input::IsKeyPressed(HZ_KEY_LEFT_ALT))\n\n\t\t{\n\n\t\t\tconst glm::vec2& mouse{ Input::GetMouseX(), Input::GetMouseY() };\n\n\t\t\tglm::vec2 delta = (mouse - m_InitialMousePosition) * 0.003f;\n\n\t\t\tm_InitialMousePosition = mouse;\n\n\n\n\t\t\tif (Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_MIDDLE))\n\n\t\t\t\tMousePan(delta);\n\n\t\t\telse if (Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_LEFT))\n\n\t\t\t\tMouseRotate(delta);\n\n\t\t\telse if (Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_RIGHT))\n\n\t\t\t\tMouseZoom(delta.y);\n\n\t\t}\n\n\n\n\t\tUpdateView();\n\n\t}\n\n\n","file_path":"Hazel/src/Hazel/Renderer/EditorCamera.cpp","rank":90,"score":4.298654825466244},{"content":"\t\t\tbool open = ImGui::TreeNodeEx((void*)typeid(T).hash_code(), treeNodeFlags, name.c_str());\n\n\t\t\tImGui::PopStyleVar();\n\n\n\n\t\t\tbool removeComponent = false;\n\n\t\t\tif (name != \"Transform\")\n\n\t\t\t{\n\n\t\t\t\tImGui::SameLine(contentRegionAvailable.x - lineHeight * 0.5f);\n\n\t\t\t\tif (ImGui::Button(\"+\", ImVec2{ lineHeight + panding / 2, lineHeight + panding / 2 }))\n\n\t\t\t\t{\n\n\t\t\t\t\tImGui::OpenPopup(\"ComponentSettings\");\n\n\t\t\t\t}\n\n\n\n\t\t\t\tif (ImGui::BeginPopup(\"ComponentSettings\"))\n\n\t\t\t\t{\n\n\t\t\t\t\tif (ImGui::MenuItem(\"Remove Component\"))\n\n\t\t\t\t\t\tremoveComponent = true;\n\n\n\n\t\t\t\t\tImGui::EndPopup();\n\n\t\t\t\t}\n\n\t\t\t}\n","file_path":"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp","rank":91,"score":4.2336124799529475},{"content":"#pragma once\n\n//\n\n// Basic instrumentation profiler by Cherno\n\n\n\n// Usage: include this header file somewhere in your code (eg. precompiled header), and then use like:\n\n//\n\n// Instrumentor::Get().BeginSession(\"Session Name\"); // Begin session \n\n// {\n\n// InstrumentationTimer timer(\"Profiled Scope Name\"); // Place code like this in scopes you'd like to include in profiling\n\n// // Code\n\n// }\n\n// Instrumentor::Get().EndSession(); // End Session\n\n//\n\n// You will probably want to macro-fy this, to switch on/off easily and use things like __FUNCSIG__ for the profile name.\n\n//\n\n#pragma once\n\n\n\n#include <string>\n\n#include <chrono>\n\n#include <algorithm>\n","file_path":"Hazel/src/Hazel/Debug/Instrumentor.h","rank":92,"score":4.233029207552987},{"content":"\t\t// TODO: color, texid\n\n\t\tfloat TexIndex;\n\n\t\tfloat TilingFactor;\n\n\n\n\t\t// Entity-only\n\n\t\tint EntityID;\n\n\t};\n\n\n\n\tstruct Renderer2DStorage\n\n\t{\n\n\t\tstatic const uint32_t MaxQuads = 100;\n\n\t\tstatic const uint32_t MaxVertices = MaxQuads * 4;\n\n\t\tstatic const uint32_t MaxIndices = MaxQuads * 6;\n\n\t\tstatic const uint32_t MaxTextureSlots = 32; // TODO: Render Caps\n\n\n\n\t\tRef<VertexArray> QuadVertexArray;\n\n\t\tRef<VertexBuffer> QuadVertexBuffer;\n\n\t\tRef<Shader> TextureShader;\n\n\t\tRef<Texture2D> WhiteTexture;\n\n\n","file_path":"Hazel/src/Hazel/Renderer/Renderer2D.cpp","rank":93,"score":4.2262773154492805},{"content":"\t{\n\n\t\tRenderer2D::Shutdown();\n\n\t}\n\n\n\n\tvoid Renderer::OnWindowResize(uint32_t width, uint32_t height)\n\n\t{\n\n\t\tRendererCommand::SetViewport(0, 0, width, height);\n\n\t}\n\n\n\n\tvoid Renderer::BeginScene(OrthographicCamera& camera)\n\n\t{\n\n\t\tm_SceneData->ViewProjectionMatrix = camera.GetViewProjectionMatrix();\n\n\t}\n\n\n\n\tvoid Renderer::EndScene()\n\n\t{\n\n\n\n\t}\n\n\n\n\tvoid Renderer::Submit(const Ref<Shader>& shader, \n","file_path":"Hazel/src/Hazel/Renderer/Renderer.cpp","rank":94,"score":4.189102055479687},{"content":"#include \"hzpch.h\"\n\n#include \"RendererAPI.h\"\n\n\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tRendererAPI::API RendererAPI::s_API = RendererAPI::API::OpenGL;\n\n\n\n}\n","file_path":"Hazel/src/Hazel/Renderer/RendererAPI.cpp","rank":95,"score":4.1686175719320335},{"content":"#include \"hzpch.h\"\n\n#include \"Entity.h\"\n\n\n\n\n\n\n\nnamespace Hazel\n\n{\n\n\tEntity::Entity(entt::entity handle, Scene* scene)\n\n\t\t:m_EntityHandle(handle), m_Scene(scene)\n\n\t{\n\n\t}\n\n}","file_path":"Hazel/src/Hazel/Scene/Entity.cpp","rank":96,"score":4.1686175719320335},{"content":"#include \"hzpch.h\"\n\n#include \"Layer.h\"\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tLayer::Layer(const std::string& debugName)\n\n\t\t:m_DebugName(debugName)\n\n\t{\n\n\n\n\t}\n\n\n\n\tLayer::~Layer()\n\n\t{\n\n\n\n\t}\n\n\n\n}\n","file_path":"Hazel/src/Hazel/Core/Layer.cpp","rank":97,"score":4.1686175719320335},{"content":"#include \"hzpch.h\"","file_path":"Hazel/src/hzpch.cpp","rank":98,"score":4.102849576387479},{"content":"\t\tZeroMemory(&ofn, sizeof(OPENFILENAME));\n\n\t\tofn.lStructSize = sizeof(OPENFILENAME);\n\n\t\tofn.hwndOwner = glfwGetWin32Window((GLFWwindow*)Application::Get().GetWindow().GetNativeWindow());\n\n\t\tofn.lpstrFile = szFile;\n\n\t\tofn.nMaxFile = sizeof(szFile);\n\n\t\tif (GetCurrentDirectoryA(256, currentDir))\n\n\t\t\tofn.lpstrInitialDir = currentDir;\n\n\t\tofn.lpstrFilter = filter;\n\n\t\tofn.nFilterIndex = 1;\n\n\t\tofn.Flags = OFN_PATHMUSTEXIST | OFN_FILEMUSTEXIST | OFN_NOCHANGEDIR;\n\n\n\n\t\tif (GetOpenFileNameA(&ofn) == TRUE)\n\n\t\t\treturn ofn.lpstrFile;\n\n\n\n\t\treturn std::string();\n\n\t}\n\n\n\n\tstd::string FileDialogs::SaveFile(const char* filter)\n\n\t{\n\n\t\tOPENFILENAMEA ofn;\n","file_path":"Hazel/src/Platform/Windows/WindowsPlatformUtils.cpp","rank":99,"score":4.065298272570798}],"string":"[\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"OpenGLFramebuffer.h\\\"\\n\\n\\n\\n#include <glad/glad.h>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tstatic const uint32_t s_MaxFramebufferSize = 8192;\\n\\n\\n\\n\\tnamespace Utils {\\n\\n\\n\\n\\t\\tstatic GLenum TextureTarget(bool multisampled)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn multisampled ? GL_TEXTURE_2D_MULTISAMPLE : GL_TEXTURE_2D;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic void CreateTextures(bool multisampled, uint32_t* outID, uint32_t count)\\n\\n\\t\\t{\\n\\n\\t\\t\\tglCreateTextures(TextureTarget(multisampled), count, outID);\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.cpp\",\n \"rank\": 1,\n \"score\": 10.326714682624264\n },\n {\n \"content\": \"#include \\\"EditorLayer.h\\\"\\n\\n\\n\\n#include <imgui/imgui.h>\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\n#include \\\"ImGuizmo.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tEditorLayer::EditorLayer()\\n\\n\\t\\t:Hazel::Layer(\\\"EditorLayer\\\"), m_CameraController(1280.0f / 720.0f, true)\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tvoid EditorLayer::OnAttach()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\",\n \"file_path\": \"Hazel-Editor/src/EditorLayer.cpp\",\n \"rank\": 2,\n \"score\": 10.001562629951499\n },\n {\n \"content\": \"\\t\\t\\tm_OutputStream << \\\"\\\\\\\"ph\\\\\\\":\\\\\\\"X\\\\\\\",\\\";\\n\\n\\t\\t\\tm_OutputStream << \\\"\\\\\\\"pid\\\\\\\":0,\\\";\\n\\n\\t\\t\\tm_OutputStream << \\\"\\\\\\\"tid\\\\\\\":\\\" << result.ThreadID << \\\",\\\";\\n\\n\\t\\t\\tm_OutputStream << \\\"\\\\\\\"ts\\\\\\\":\\\" << result.Start;\\n\\n\\t\\t\\tm_OutputStream << \\\"}\\\";\\n\\n\\n\\n\\t\\t\\tm_OutputStream.flush();\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tvoid WriteHeader()\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_OutputStream << \\\"{\\\\\\\"otherData\\\\\\\": {},\\\\\\\"traceEvents\\\\\\\":[\\\";\\n\\n\\t\\t\\tm_OutputStream.flush();\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tvoid WriteFooter()\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_OutputStream << \\\"]}\\\";\\n\\n\\t\\t\\tm_OutputStream.flush();\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic Instrumentor& Get()\\n\\n\\t\\t{\\n\\n\\t\\t\\tstatic Instrumentor instance;\\n\\n\\t\\t\\treturn instance;\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Debug/Instrumentor.h\",\n \"rank\": 3,\n \"score\": 9.544574479417442\n },\n {\n \"content\": \"\\t\\t};\\n\\n\\n\\n\\t\\tstatic void ResetStats();\\n\\n\\t\\tstatic Statistics GetStats();\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstatic void StartBatch();\\n\\n\\t\\tstatic void NextBatch();\\n\\n\\t};\\n\\n}\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer2D.h\",\n \"rank\": 4,\n \"score\": 9.455072850878782\n },\n {\n \"content\": \"#include \\\"ParticleSystem.h\\\"\\n\\n\\n\\n#include \\\"Random.h\\\"\\n\\n\\n\\n#define GLM_ENABLE_EXPERIMENTAL\\n\\n#include <glm/gtx/compatibility.hpp>\\n\\n\\n\\nParticleSystem::ParticleSystem(uint32_t maxParticles/* = 1000*/)\\n\\n\\t:m_PoolIndex(maxParticles - 1)\\n\\n{\\n\\n\\tm_PariclePool.resize(maxParticles);\\n\\n}\\n\\n\\n\\nvoid ParticleSystem::OnUpdate(Hazel::Timestep ts)\\n\\n{\\n\\n\\tfor (auto& particle : m_PariclePool)\\n\\n\\t{\\n\\n\\t\\tif (!particle.Active) continue;\\n\\n\\n\\n\\t\\tif (particle.LiftRemaining <= 0.0f)\\n\",\n \"file_path\": \"Sandbox/src/ParticleSystem.cpp\",\n \"rank\": 6,\n \"score\": 9.089576522608775\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Hazel/Utils/PlatformUtils.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Core/Application.h\\\"\\n\\n\\n\\n\\n\\n#include <commdlg.h>\\n\\n#include <GLFW/glfw3.h>\\n\\n#define GLFW_EXPOSE_NATIVE_WIN32\\n\\n#include <GLFW/glfw3native.h>\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tstd::string FileDialogs::OpenFile(const char* filter)\\n\\n\\t{\\n\\n\\t\\tOPENFILENAMEA ofn;\\n\\n\\t\\tCHAR szFile[260] = { 0 };\\n\\n\\t\\tCHAR currentDir[256] = { 0 };\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsPlatformUtils.cpp\",\n \"rank\": 7,\n \"score\": 8.930104606437943\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\n\\n\\t\\tm_Framebuffer->Unbind();\\n\\n\\t}\\n\\n\\n\\n\\tvoid EditorLayer::OnImGuiRender()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tstatic bool dockspaceOpen = true;\\n\\n\\t\\tstatic bool opt_fullscreen = true;\\n\\n\\t\\tstatic bool opt_padding = false;\\n\\n\\t\\tstatic ImGuiDockNodeFlags dockspace_flags = ImGuiDockNodeFlags_None;\\n\\n\\n\\n\\t\\t// We are using the ImGuiWindowFlags_NoDocking flag to make the parent window not dockable into,\\n\\n\\t\\t// because it would be confusing to have two docking targets within each others.\\n\\n\\t\\tImGuiWindowFlags window_flags = ImGuiWindowFlags_MenuBar | ImGuiWindowFlags_NoDocking;\\n\\n\\t\\tif (opt_fullscreen)\\n\\n\\t\\t{\\n\\n\\t\\t\\tImGuiViewport* viewport = ImGui::GetMainViewport();\\n\",\n \"file_path\": \"Hazel-Editor/src/EditorLayer.cpp\",\n \"rank\": 8,\n \"score\": 8.797356009832791\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n\\n\\n#include \\\"OrthographicCameraController.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Core/Input.h\\\"\\n\\n#include \\\"Hazel/Core/KeyCodes.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tOrthographicCameraController::OrthographicCameraController(float aspectRatio, bool rotation/* = false*/)\\n\\n\\t\\t:m_AspectRatio(aspectRatio),\\n\\n\\t\\tm_Bounds{ -m_AspectRatio * m_ZoomLevel, m_AspectRatio * m_ZoomLevel, -m_ZoomLevel, m_ZoomLevel },\\n\\n\\t\\tm_Camera(-m_AspectRatio * m_ZoomLevel, m_AspectRatio * m_ZoomLevel, -m_ZoomLevel, m_ZoomLevel),\\n\\n\\t\\tm_Rotation(rotation)\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tvoid OrthographicCameraController::OnUpdate(Timestep ts)\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/OrthographicCameraController.cpp\",\n \"rank\": 9,\n \"score\": 8.31210150219377\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Renderer.h\\\"\\n\\n\\n\\n#include \\\"RendererCommand.h\\\"\\n\\n#include \\\"Platform/OpenGL/OpenGLShader.h\\\"\\n\\n#include \\\"Renderer2D.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tRenderer::SceneData* Renderer::m_SceneData = new Renderer::SceneData;\\n\\n\\n\\n\\tvoid Renderer::Init()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tRendererCommand::Init();\\n\\n\\t\\tRenderer2D::Init();\\n\\n\\t}\\n\\n\\n\\n\\tvoid Renderer::Shutdown()\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer.cpp\",\n \"rank\": 10,\n \"score\": 7.929590523128617\n },\n {\n \"content\": \"\\tstatic void GLFWErrorCallback(int error, const char* description)\\n\\n\\t{\\n\\n\\t\\tHZ_CORE_ERROR(\\\"GLFW_Error: ({0}, {1})\\\", error, description);\\n\\n\\t}\\n\\n\\n\\n\\tScope<Window> Window::Create(const WindowProps& props)\\n\\n\\t{\\n\\n\\t\\treturn CreateScope<WindowsWindow>(props);\\n\\n\\t}\\n\\n\\n\\n\\tWindowsWindow::WindowsWindow(const WindowProps& props)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tInit(props);\\n\\n\\t}\\n\\n\\n\\n\\tWindowsWindow::~WindowsWindow()\\n\\n\\t{\\n\\n\\t\\tif (m_Context != nullptr)\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsWindow.cpp\",\n \"rank\": 11,\n \"score\": 7.866503613818002\n },\n {\n \"content\": \"\\n\\n\\tm_Pillars.resize(5);\\n\\n\\tfor (int i = 0; i < 5; i++)\\n\\n\\t\\tCreatePillar(i, i * 10.0f);\\n\\n}\\n\\n\\n\\nvoid Level::OnUpdate(Hazel::Timestep ts)\\n\\n{\\n\\n\\tm_Player.OnUpdate(ts);\\n\\n\\n\\n\\tif (CollisionTest())\\n\\n\\t{\\n\\n\\t\\tGameOver();\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\tm_PillarHSV.x += 0.1f * ts;\\n\\n\\tif (m_PillarHSV.x > 1.0f)\\n\\n\\t\\tm_PillarHSV.x = 0.0f;\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/Level.cpp\",\n \"rank\": 12,\n \"score\": 7.70440045105941\n },\n {\n \"content\": \"\\t\\t\\t\\t\\ttranslation.x -= speed * ts;\\n\\n\\t\\t\\t\\tif (Input::IsKeyPressed(HZ_KEY_W))\\n\\n\\t\\t\\t\\t\\ttranslation.y -= speed * ts;\\n\\n\\t\\t\\t\\tif (Input::IsKeyPressed(HZ_KEY_S))\\n\\n\\t\\t\\t\\t\\ttranslation.y += speed * ts;\\n\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n\\t\\tm_CameraEntity.AddComponent<NativeScriptComponent>().Bind<CameraController>();\\n\\n#endif\\n\\n\\t\\t// Panels\\n\\n\\t\\tm_SceneHierarchyPanel.SetContext(m_ActiveScene);\\n\\n\\t}\\n\\n\\n\\n\\tvoid EditorLayer::OnDetach()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\t}\\n\\n\\n\\n\\tvoid EditorLayer::OnUpdate(Hazel::Timestep ts)\\n\\n\\t{\\n\",\n \"file_path\": \"Hazel-Editor/src/EditorLayer.cpp\",\n \"rank\": 13,\n \"score\": 7.647660926271703\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"WindowsWindow.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Events/ApplicationEvent.h\\\"\\n\\n#include \\\"Hazel/Events/MouseEvent.h\\\"\\n\\n#include \\\"Hazel/Events/KeyEvent.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Renderer/Renderer.h\\\"\\n\\n\\n\\n#include \\\"Platform/OpenGL/OpenGLContext.h\\\"\\n\\n\\n\\n#include <glad/glad.h>\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tstatic uint8_t s_GLFWWindowCount = 0;\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsWindow.cpp\",\n \"rank\": 14,\n \"score\": 7.634099466622118\n },\n {\n \"content\": \"\\t\\tfor (auto& vert : playerTransformedVerts)\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (PointInTri({ vert.x, vert.y }, tri[0], tri[1], tri[2]))\\n\\n \\t\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\nvoid Level::GameOver()\\n\\n{\\n\\n\\tm_GameOver = true;\\n\\n}\\n\",\n \"file_path\": \"Sandbox/src/Level.cpp\",\n \"rank\": 15,\n \"score\": 7.595071809448658\n },\n {\n \"content\": \"\\t\\tstatic void DrawQuad(const glm::mat4& transform, const glm::vec4& color, int entityID = -1);\\n\\n\\t\\tstatic void DrawQuad(const glm::mat4& transform, const Ref<Texture2D>& texture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f), int entityID = -1);\\n\\n\\n\\n\\t\\tstatic void DrawRotatedQuad(const glm::vec2& position, const glm::vec2& size, float rotation, const glm::vec4& color);\\n\\n\\t\\tstatic void DrawRotatedQuad(const glm::vec3& position, const glm::vec2& size, float rotation, const glm::vec4& color);\\n\\n\\t\\tstatic void DrawRotatedQuad(const glm::vec2& position, const glm::vec2& size, float rotation, const Ref<Texture2D>& texture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\\n\\n\\t\\tstatic void DrawRotatedQuad(const glm::vec3& position, const glm::vec2& size, float rotation, const Ref<Texture2D>& texture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\\n\\n\\t\\tstatic void DrawRotatedQuad(const glm::vec2& position, const glm::vec2& size, float rotation, const Ref<SubTexture2D>& subtexture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\\n\\n\\t\\tstatic void DrawRotatedQuad(const glm::vec3& position, const glm::vec2& size, float rotation, const Ref<SubTexture2D>& subtexture, float tilingFactor = 1.0f, const glm::vec4& tintColor = glm::vec4(1.0f));\\n\\n\\n\\n\\t\\tstatic void DrawSprite(const glm::mat4& transform, SpriteRendererComponent& src, int entityID);\\n\\n\\n\\n\\t\\t// Stats\\n\\n\\t\\tstruct Statistics\\n\\n\\t\\t{\\n\\n\\t\\t\\tuint32_t DrawCalls = 0;\\n\\n\\t\\t\\tuint32_t QuadCount = 0;\\n\\n\\n\\n\\t\\t\\tuint32_t GetTotalVertexCount() { return QuadCount * 4; }\\n\\n\\t\\t\\tuint32_t GetTotalIndexCount() { return QuadCount * 6; }\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer2D.h\",\n \"rank\": 16,\n \"score\": 7.5747062616415715\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"SceneSerializer.h\\\"\\n\\n\\n\\n#include \\\"Entity.h\\\"\\n\\n#include \\\"Components.h\\\"\\n\\n\\n\\n#include <fstream>\\n\\n#include <yaml-cpp/yaml.h>\\n\\n\\n\\nnamespace YAML\\n\\n{\\n\\n\\ttemplate<>\\n\\n\\tstruct convert<glm::vec3>\\n\\n\\t{\\n\\n\\t\\tstatic Node encode(const glm::vec3& rsh)\\n\\n\\t\\t{\\n\\n\\t\\t\\tNode node;\\n\\n\\t\\t\\tnode.push_back(rsh.x);\\n\\n\\t\\t\\tnode.push_back(rsh.y);\\n\\n\\t\\t\\tnode.push_back(rsh.z);\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/SceneSerializer.cpp\",\n \"rank\": 17,\n \"score\": 7.452936022838331\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"OpenGLRendererAPI.h\\\"\\n\\n\\n\\n#include <glad/glad.h>\\n\\n#include <glm/glm.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tvoid OpenGLRendererAPI::Init()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tglEnable(GL_BLEND);\\n\\n\\t\\tglBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\\n\\n\\n\\n\\t\\tglEnable(GL_DEPTH_TEST);\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\tvoid OpenGLRendererAPI::SetViewport(uint32_t x, uint32_t y, uint32_t width, uint32_t height)\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLRendererAPI.cpp\",\n \"rank\": 18,\n \"score\": 7.264945962419464\n },\n {\n \"content\": \"\\t\\t\\t\\tfor (length_t i = 0; i < 3; i++)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tscale[i] *= static_cast<T>(-1);\\n\\n\\t\\t\\t\\t\\tRow[i] *= static_cast<T>(-1);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n#endif\\n\\n\\n\\n\\t\\t\\trotation.y = asin(-Row[0][2]);\\n\\n\\t\\t\\tif (cos(rotation.y) != 0) {\\n\\n\\t\\t\\t\\trotation.x = atan2(Row[1][2], Row[2][2]);\\n\\n\\t\\t\\t\\trotation.z = atan2(Row[0][1], Row[0][0]);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\trotation.x = atan2(-Row[2][0], Row[1][1]);\\n\\n\\t\\t\\t\\trotation.z = 0;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\",\n \"file_path\": \"Hazel/src/Hazel/Math/Math.cpp\",\n \"rank\": 19,\n \"score\": 7.245567063002382\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"OpenGLShader.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Core/Core.h\\\"\\n\\n\\n\\n#include <glad/glad.h>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tstatic GLenum ShaderTypeFromString(const std::string& type)\\n\\n\\t{\\n\\n\\t\\tif (type == \\\"vertex\\\")\\n\\n\\t\\t\\treturn GL_VERTEX_SHADER;\\n\\n\\n\\n\\t\\tif (type == \\\"fragment\\\" || type == \\\"pixel\\\")\\n\\n\\t\\t\\treturn GL_FRAGMENT_SHADER;\\n\\n\\n\\n\\t\\tHZ_CORE_ASSERT(false, \\\"Unknow Shader type!\\\");\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLShader.cpp\",\n \"rank\": 20,\n \"score\": 7.240998465253718\n },\n {\n \"content\": \"\\tm_Level.Init();\\n\\n\\n\\n\\tImGuiIO io = ImGui::GetIO();\\n\\n\\tm_Font = io.Fonts->AddFontFromFileTTF(\\\"assets/OpenSans-Regular.ttf\\\", 30.f);\\n\\n}\\n\\n\\n\\nvoid GameLayer::OnDetach()\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nvoid GameLayer::OnUpdate(Hazel::Timestep ts)\\n\\n{\\n\\n\\tm_Time += ts;\\n\\n\\tif (((int)(m_Time * 10.0f)) % 8 > 4)\\n\\n\\t\\tm_Blink = !m_Blink;\\n\\n\\n\\n\\tif (m_Level.IsGameOver())\\n\\n\\t\\tm_State = GameState::GameOver;\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/GameLayer.cpp\",\n \"rank\": 21,\n \"score\": 7.114520280308195\n },\n {\n \"content\": \"\\t\\t\\ts_RendererAPI->Clear();\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tinline static void DrawIndexed(const Ref<VertexArray>& vertexArray, uint32_t indexCount = 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\ts_RendererAPI->DrawIndexed(vertexArray, indexCount);\\n\\n\\t\\t}\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstatic RendererAPI* s_RendererAPI;\\n\\n\\t};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/RendererCommand.h\",\n \"rank\": 22,\n \"score\": 6.961845627764188\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n\\n\\n#include \\\"LayerStack.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tLayerStack::LayerStack()\\n\\n\\t{\\n\\n\\t\\t\\n\\n\\t}\\n\\n\\n\\n\\tLayerStack::~LayerStack()\\n\\n\\t{\\n\\n\\t\\tfor (Layer* layer : m_Layers)\\n\\n\\t\\t\\tdelete layer;\\n\\n\\t}\\n\\n\\n\\n\\tvoid LayerStack::PushLayer(Layer* layer)\\n\\n\\t{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/LayerStack.cpp\",\n \"rank\": 23,\n \"score\": 6.899483338282227\n },\n {\n \"content\": \"#include \\\"GameLayer.h\\\"\\n\\n\\n\\n#include \\\"Random.h\\\"\\n\\n\\n\\n#include <imgui/imgui.h>\\n\\n\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\nGameLayer::GameLayer()\\n\\n\\t:Hazel::Layer(\\\"GameLayer\\\")\\n\\n{\\n\\n\\tauto& window = Hazel::Application::Get().GetWindow();\\n\\n\\tCreateCamera(window.GetWidth(), window.GetHeight());\\n\\n\\n\\n\\tRandom::Init();\\n\\n}\\n\\n\\n\\nvoid GameLayer::OnAttach()\\n\\n{\\n\",\n \"file_path\": \"Sandbox/src/GameLayer.cpp\",\n \"rank\": 24,\n \"score\": 6.88527433202152\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"OpenGLContext.h\\\"\\n\\n\\n\\n\\n\\n#include <GLFW/glfw3.h>\\n\\n#include <glad/glad.h>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tOpenGLContext::OpenGLContext(GLFWwindow* windowHandle)\\n\\n\\t\\t: m_WindowHandle(windowHandle)\\n\\n\\t{\\n\\n\\t\\tHZ_CORE_ASSERT(m_WindowHandle, \\\"Window Handle is null!\\\");\\n\\n\\t}\\n\\n\\n\\n\\tvoid OpenGLContext::Init()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLContext.cpp\",\n \"rank\": 25,\n \"score\": 6.829251790237164\n },\n {\n \"content\": \"\\tm_EngineParticle.Position = { 0.0f, 0.0f };\\n\\n\\tm_SmokeParticle.Velocity = { -0.2f, 0.0f };\\n\\n\\tm_SmokeParticle.VelocityVariation = { 3.0f, 1.0f };\\n\\n\\tm_SmokeParticle.SizeBegin = 0.5f;\\n\\n\\tm_SmokeParticle.SizeEnd = 0.0f;\\n\\n\\tm_SmokeParticle.SizeVariation = 0.3f;\\n\\n\\tm_SmokeParticle.ColorBegin = { 254 / 255.0f, 109 / 255.0f, 41 / 255.0f, 1.0f };\\n\\n\\tm_SmokeParticle.ColorEnd = { 254 / 255.0f, 212 / 255.0f, 123 / 255.0f, 1.0f };\\n\\n\\tm_SmokeParticle.LiftTime = 1.0f;\\n\\n}\\n\\n\\n\\nvoid Player::LoadAssets()\\n\\n{\\n\\n\\tm_ShipTexture = Hazel::Texture2D::Create(\\\"assets/textures/Ship.png\\\");\\n\\n}\\n\\n\\n\\nvoid Player::OnUpdate(Hazel::Timestep ts)\\n\\n{\\n\\n\\tm_Time += ts;\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/Player.cpp\",\n \"rank\": 26,\n \"score\": 6.681893704376371\n },\n {\n \"content\": \"\\t\\tm_Velcity.y -= m_Gravity;\\n\\n\\t}\\n\\n\\n\\n\\tm_Velcity.y = glm::clamp(m_Velcity.y, -20.0f, 20.0f);\\n\\n\\tm_Position += m_Velcity * (float)ts;\\n\\n\\tHZ_INFO(\\\"Player OnUpdate: m_VelcityX:{0} PositionX:{1}, ts:{2}\\\", m_Velcity.x, m_Position.x, (float)ts);\\n\\n\\t// Particles\\n\\n\\tif (m_Time > m_SmokeNextEmitTime)\\n\\n\\t{\\n\\n\\t\\tm_SmokeParticle.Position = m_Position;\\n\\n\\t\\tm_ParticleSystem.Emit(m_SmokeParticle);\\n\\n\\t\\tm_SmokeNextEmitTime += m_SmokeEmitInterval;\\n\\n\\t}\\n\\n\\n\\n\\t//m_ParticleSystem.OnUpdate(ts);\\n\\n}\\n\\n\\n\\nvoid Player::OnRender()\\n\\n{\\n\\n\\t//m_ParticleSystem.OnRender();\\n\",\n \"file_path\": \"Sandbox/src/Player.cpp\",\n \"rank\": 27,\n \"score\": 6.663964082923467\n },\n {\n \"content\": \"\\t\\t\\treturn node;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic bool decode(const Node& node, glm::vec3& rhs)\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (!node.IsSequence() || node.size() != 3)\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\trhs.x = node[0].as<float>();\\n\\n\\t\\t\\trhs.y = node[1].as<float>();\\n\\n\\t\\t\\trhs.z = node[2].as<float>();\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\ttemplate<>\\n\\n\\tstruct convert<glm::vec4>\\n\\n\\t{\\n\\n\\t\\tstatic Node encode(const glm::vec4& rhs)\\n\\n\\t\\t{\\n\\n\\t\\t\\tNode node;\\n\\n\\t\\t\\tnode.push_back(rhs.x);\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/SceneSerializer.cpp\",\n \"rank\": 28,\n \"score\": 6.604816193523037\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\tparticle.Active = false;\\n\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tparticle.LiftRemaining -= ts;\\n\\n\\t\\tparticle.Position += particle.Velocity * (float)ts;\\n\\n\\t\\tparticle.Rotation += 0.1f * ts;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid ParticleSystem::OnRender(Hazel::OrthographicCamera& camera)\\n\\n{\\n\\n\\tHazel::Renderer2D::BeginScene(camera);\\n\\n\\tfor (auto& particle : m_PariclePool)\\n\\n\\t{\\n\\n\\t\\tif (!particle.Active) continue;\\n\\n\\n\\n\\t\\t// Fade away particles\\n\\n\\t\\tfloat life = particle.LiftRemaining / particle.LiftTime;\\n\",\n \"file_path\": \"Sandbox/src/ParticleSystem.cpp\",\n \"rank\": 29,\n \"score\": 6.55468746441497\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"SceneCamera.h\\\"\\n\\n\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tSceneCamera::SceneCamera()\\n\\n\\t{\\n\\n\\t\\tRecalculateProjection();\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\tvoid SceneCamera::SetOrthographic(float size, float nearClip, float farClip)\\n\\n\\t{\\n\\n\\t\\tm_ProjectionType = ProjectionType::Orthographic;\\n\\n\\t\\tm_OrthographicSize = size;\\n\\n\\t\\tm_OrthographicNear = nearClip;\\n\\n\\t\\tm_OrthographicFar = farClip;\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/SceneCamera.cpp\",\n \"rank\": 30,\n \"score\": 6.3833105033719555\n },\n {\n \"content\": \"\\n\\n\\n\\n\\tvoid Application::Close()\\n\\n\\t{\\n\\n\\t\\tm_Running = false;\\n\\n\\t}\\n\\n\\n\\n\\tbool Application::OnWindowClose(WindowCloseEvent& e)\\n\\n\\t{\\n\\n\\t\\tm_Running = false;\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\tbool Application::OnWindowResize(WindowResizeEvent& e)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tif (e.GetWidth() == 0 || e.GetHeight() == 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_Minimized = true;\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}\\n\\n\\t\\tm_Minimized = false;\\n\\n\\t\\tRenderer::OnWindowResize(e.GetWidth(), e.GetHeight());\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Application.cpp\",\n \"rank\": 31,\n \"score\": 6.332785741110651\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"WindowsInput.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Core/Application.h\\\"\\n\\n\\n\\n#include <GLFW/glfw3.h>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tInput* Input::s_Instance = new WindowsInput();\\n\\n\\n\\n\\tbool WindowsInput::IsKeyPressedImpl(int keycode)\\n\\n\\t{\\n\\n\\t\\tGLFWwindow* window = static_cast<GLFWwindow*>(Application::Get().GetWindow().GetNativeWindow());\\n\\n\\t\\tint state = glfwGetKey(window, keycode);\\n\\n\\t\\treturn state == GLFW_PRESS || state == GLFW_REPEAT;\\n\\n\\t}\\n\\n\\n\\n\\tbool WindowsInput::IsMouseButtonPressedImpl(int button)\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsInput.cpp\",\n \"rank\": 32,\n \"score\": 6.316393340615807\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tauto view = m_Registry.view<CameraComponent>();\\n\\n\\t\\tfor (auto entity : view)\\n\\n\\t\\t{\\n\\n\\t\\t\\tconst auto& camera = view.get<CameraComponent>(entity);\\n\\n\\t\\t\\tif (camera.Primary)\\n\\n\\t\\t\\t\\treturn Entity{ entity, this };\\n\\n\\t\\t}\\n\\n\\t\\treturn {};\\n\\n\\t}\\n\\n\\n\\n\\ttemplate<typename T>\\n\\n\\tvoid Scene::OnComponentAdded(Entity entity, T& component)\\n\\n\\t{\\n\\n\\t\\tstatic_assert(false);\\n\\n\\t}\\n\\n\\n\\n\\ttemplate<>\\n\\n\\tvoid Scene::OnComponentAdded<TransformComponent>(Entity entity, TransformComponent& component)\\n\\n\\t{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Scene.cpp\",\n \"rank\": 33,\n \"score\": 6.069894363805872\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Log.h\\\"\\n\\n\\n\\n#include \\\"spdlog/sinks/stdout_color_sinks.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tRef<spdlog::logger> Log::s_CoreLogger;\\n\\n\\tRef<spdlog::logger> Log::s_ClientLogger;\\n\\n\\n\\n\\n\\n\\tvoid Log::Init()\\n\\n\\t{\\n\\n\\t\\tspdlog::set_pattern(\\\"%^[%T] %n: %v%$\\\");\\n\\n\\t\\ts_CoreLogger = spdlog::stdout_color_mt(\\\"HAZEL\\\");\\n\\n\\t\\ts_CoreLogger->set_level(spdlog::level::trace);\\n\\n\\n\\n\\t\\ts_ClientLogger = spdlog::stdout_color_mt(\\\"APP\\\");\\n\\n\\t\\ts_ClientLogger->set_level(spdlog::level::trace);\\n\\n\\t}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Log.cpp\",\n \"rank\": 34,\n \"score\": 5.993687697302027\n },\n {\n \"content\": \"#include \\\"Level.h\\\"\\n\\n\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n\\n\\n\\n\\nstatic glm::vec4 HSVtoRGB(const glm::vec3& hsv)\\n\\n{\\n\\n\\tint H = (int)(hsv.x * 360.0f);\\n\\n\\tdouble S = hsv.y;\\n\\n\\tdouble V = hsv.z;\\n\\n\\n\\n\\tdouble C = S * V;\\n\\n\\tdouble X = C * (1 - abs(fmod(H / 60.0f, 2) - 1));\\n\\n\\tdouble m = V - C;\\n\\n\\tdouble Rs, Gs, Bs;\\n\\n\\n\\n\\tif (H >= 0 && H < 60)\\n\\n\\t{\\n\\n\\t\\tRs = C;\\n\\n\\t\\tGs = X;\\n\",\n \"file_path\": \"Sandbox/src/Level.cpp\",\n \"rank\": 35,\n \"score\": 5.986137734037028\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n\\n\\n#include \\\"OpenGLVertexArray.h\\\"\\n\\n\\n\\n#include <glad/glad.h>\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tstatic GLenum ShaderDataTypeToOpenGLBaseType(ShaderDataType type)\\n\\n\\t{\\n\\n\\t\\tswitch (type)\\n\\n\\t\\t{\\n\\n\\t\\tcase ShaderDataType::Float:\\t\\treturn GL_FLOAT;\\n\\n\\t\\tcase ShaderDataType::Float2:\\treturn GL_FLOAT;\\n\\n\\t\\tcase ShaderDataType::Float3:\\treturn GL_FLOAT;\\n\\n\\t\\tcase ShaderDataType::Float4:\\treturn GL_FLOAT;\\n\\n\\t\\tcase ShaderDataType::Mat3:\\t\\treturn GL_FLOAT;\\n\\n\\t\\tcase ShaderDataType::Mat4:\\t\\treturn GL_FLOAT;\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLVertexArray.cpp\",\n \"rank\": 36,\n \"score\": 5.859696505798498\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"OrthographicCamera.h\\\"\\n\\n\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tOrthographicCamera::OrthographicCamera(float left, float right, float bottom, float top)\\n\\n\\t\\t:m_ProjectionMatrix(glm::ortho(left, right, bottom, top, -1.0f, 1.0f)),\\n\\n\\t\\tm_ViewMatrix(1.0f),\\n\\n\\t\\tm_Position(glm::vec3(0.0f))\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tm_ViewProjectionMatrix = m_ProjectionMatrix * m_ViewMatrix;\\n\\n\\t}\\n\\n\\n\\n\\tvoid OrthographicCamera::SetProjection(float left, float right, float bottom, float top)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/OrthographicCamera.cpp\",\n \"rank\": 37,\n \"score\": 5.8332572790514075\n },\n {\n \"content\": \"\\t\\tbool OnWindowClose(WindowCloseEvent& e);\\n\\n\\t\\tbool OnWindowResize(WindowResizeEvent& e);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tScope<Window> m_Window;\\n\\n\\t\\tImGuiLayer* m_ImGuiLayer;\\n\\n\\t\\tbool m_Running = true;\\n\\n\\t\\tbool m_Minimized = false;\\n\\n\\n\\n\\t\\tLayerStack m_LayerStack;\\n\\n\\t\\tTimestep m_Timestep;\\n\\n\\t\\tfloat m_LastTime = 0.0f;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstatic Application* s_Instance;\\n\\n\\n\\n\\t};\\n\\n\\n\\n\\tApplication* CreateApplication();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Application.h\",\n \"rank\": 38,\n \"score\": 5.544082451358816\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\n\\n\\t\\tstatic void BindTexture(bool multisampled, uint32_t id)\\n\\n\\t\\t{\\n\\n\\t\\t\\tglBindTexture(TextureTarget(multisampled), id);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic void AttachColorTexture(uint32_t id, int samples, GLenum internalFormat, GLenum format, uint32_t width, uint32_t height, int index)\\n\\n\\t\\t{\\n\\n\\t\\t\\tbool multisampled = samples > 1;\\n\\n\\t\\t\\tif (multisampled)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tglTexImage2DMultisample(GL_TEXTURE_2D_MULTISAMPLE, samples, internalFormat, width, height, GL_FALSE);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tglTexImage2D(GL_TEXTURE_2D, 0, internalFormat, width, height, 0, format, GL_UNSIGNED_BYTE, nullptr);\\n\\n\\n\\n\\t\\t\\t\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\\n\\n\\t\\t\\t\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.cpp\",\n \"rank\": 39,\n \"score\": 5.423975416658351\n },\n {\n \"content\": \"\\n\\n\\tEntity Scene::CreateEntity(const std::string& name)\\n\\n\\t{\\n\\n\\t\\tEntity entity = { m_Registry.create(), this };\\n\\n\\t\\tentity.AddComponent<TransformComponent>();\\n\\n\\t\\tauto& tag = entity.AddComponent<TagComponent>();\\n\\n\\t\\ttag.Tag = name.empty() ? \\\"Entity\\\" : name;\\n\\n\\t\\treturn entity;\\n\\n\\t}\\n\\n\\n\\n\\tvoid Scene::DestroyEntity(Entity entity)\\n\\n\\t{\\n\\n\\t\\tm_Registry.destroy(entity);\\n\\n\\t}\\n\\n\\n\\n\\tvoid Scene::OnUpdateEditor(Timestep ts, EditorCamera& camera)\\n\\n\\t{\\n\\n\\t\\tRenderer2D::BeginScene(camera);\\n\\n\\n\\n\\t\\tauto grop = m_Registry.group<TransformComponent>(entt::get<SpriteRendererComponent>);\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Scene.cpp\",\n \"rank\": 40,\n \"score\": 5.408079899890227\n },\n {\n \"content\": \"\\t\\t\\tnode.push_back(rhs.y);\\n\\n\\t\\t\\tnode.push_back(rhs.z);\\n\\n\\t\\t\\tnode.push_back(rhs.w);\\n\\n\\t\\t\\tnode.SetStyle(EmitterStyle::Flow);\\n\\n\\t\\t\\treturn node;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic bool decode(const Node& node, glm::vec4& rhs)\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (!node.IsSequence() || node.size() != 4)\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\n\\n\\t\\t\\trhs.x = node[0].as<float>();\\n\\n\\t\\t\\trhs.y = node[1].as<float>();\\n\\n\\t\\t\\trhs.z = node[2].as<float>();\\n\\n\\t\\t\\trhs.w = node[3].as<float>();\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/SceneSerializer.cpp\",\n \"rank\": 41,\n \"score\": 5.400195524714958\n },\n {\n \"content\": \"\\t\\t\\tif (open)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tuiFunction(component);\\n\\n\\t\\t\\t\\tImGui::TreePop();\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tif (removeComponent)\\n\\n\\t\\t\\t\\tentity.RemoveComponent<T>();\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tvoid SceneHierarchyPanel::DrawComponent(Entity& entity)\\n\\n\\t{\\n\\n\\t\\tif (entity.HasComponent<TagComponent>())\\n\\n\\t\\t{\\n\\n\\t\\t\\tauto& tag = entity.GetComponent<TagComponent>().Tag;\\n\\n\\n\\n\\t\\t\\tchar buffer[256];\\n\\n\\t\\t\\tmemset(buffer, 0, sizeof(buffer));\\n\\n\\t\\t\\tmemcpy(buffer, tag.c_str(), tag.size());\\n\",\n \"file_path\": \"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp\",\n \"rank\": 42,\n \"score\": 5.197739962966851\n },\n {\n \"content\": \"\\t\\tCHAR szFile[260] = { 0 };\\n\\n\\t\\tCHAR currentDir[256] = { 0 };\\n\\n\\t\\tZeroMemory(&ofn, sizeof(OPENFILENAME));\\n\\n\\t\\tofn.lStructSize = sizeof(OPENFILENAME);\\n\\n\\t\\tofn.hwndOwner = glfwGetWin32Window((GLFWwindow*)Application::Get().GetWindow().GetNativeWindow());\\n\\n\\t\\tofn.lpstrFile = szFile;\\n\\n\\t\\tofn.nMaxFile = sizeof(szFile);\\n\\n\\t\\tif (GetCurrentDirectoryA(256, currentDir))\\n\\n\\t\\t\\tofn.lpstrInitialDir = currentDir;\\n\\n\\t\\tofn.lpstrFilter = filter;\\n\\n\\t\\tofn.nFilterIndex = 1;\\n\\n\\t\\tofn.Flags = OFN_PATHMUSTEXIST | OFN_FILEMUSTEXIST | OFN_NOCHANGEDIR;\\n\\n\\n\\n\\t\\tif (GetSaveFileNameA(&ofn) == TRUE)\\n\\n\\t\\t\\treturn ofn.lpstrFile;\\n\\n\\n\\n\\t\\treturn std::string();\\n\\n\\t}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsPlatformUtils.cpp\",\n \"rank\": 43,\n \"score\": 5.157545825550708\n },\n {\n \"content\": \"\\tvoid OpenGLVertexArray::AddVertexBuffer(Ref<VertexBuffer>& vertexBuffer)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tglBindVertexArray(m_RendererID);\\n\\n\\t\\tvertexBuffer->Bind();\\n\\n\\n\\n\\t\\tuint32_t index = 0;\\n\\n\\t\\tconst auto& layout = vertexBuffer->GetLayout();\\n\\n\\t\\tfor (const auto& element : layout)\\n\\n\\t\\t{\\n\\n\\t\\t\\tglEnableVertexAttribArray(index);\\n\\n\\t\\t\\tglVertexAttribPointer(index,\\n\\n\\t\\t\\t\\telement.GetComponetCount(),\\n\\n\\t\\t\\t\\tShaderDataTypeToOpenGLBaseType(element.Type),\\n\\n\\t\\t\\t\\telement.Normalized ? GL_TRUE : GL_FALSE,\\n\\n\\t\\t\\t\\tlayout.GetStride(),\\n\\n\\t\\t\\t\\t(const void*)(element.Offset));\\n\\n\\t\\t\\tindex++;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLVertexArray.cpp\",\n \"rank\": 44,\n \"score\": 5.117319812498209\n },\n {\n \"content\": \"\\n\\n\\t\\tuint32_t indicesSquare[6] = { 0, 1, 2, 2, 3, 0 };\\n\\n\\t\\tHazel::Ref<Hazel::IndexBuffer> indexBufferSquare = Hazel::IndexBuffer::Create(indicesSquare, sizeof(indicesSquare) / sizeof(uint32_t));\\n\\n\\t\\tm_SquareVA->SetIndexBuffer(indexBufferSquare);\\n\\n\\n\\n\\t\\tauto textureShader = m_ShaderLibrary.Load(\\\"assets/shaders/Texture.glsl\\\");\\n\\n\\n\\n\\n\\n\\n\\n\\t\\tm_TextureWall = Hazel::Texture2D::Create(\\\"assets/textures/wall.jpg\\\");\\n\\n\\t\\tm_TextureBox = Hazel::Texture2D::Create(\\\"assets/textures/box.png\\\");\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tvoid OnUpdate(Hazel::Timestep ts) override\\n\\n\\t{\\n\\n\\t\\t// Update\\n\\n\\t\\tm_CameraController.OnUpdate(ts);\\n\\n\\n\\n\\t\\tHazel::RendererCommand::SetClearColor(glm::vec4(0.2f, 0.2f, 0.2f, 1.0f));\\n\",\n \"file_path\": \"Sandbox/src/SandboxApp.cpp\",\n \"rank\": 45,\n \"score\": 5.020215109676801\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"ImGuiLayer.h\\\"\\n\\n\\n\\n#include \\\"imgui.h\\\"\\n\\n\\n\\n//#define IMGUI_IMPL_API\\n\\n#include <examples/imgui_impl_opengl3.h>\\n\\n#include <examples/imgui_impl_glfw.h>\\n\\n\\n\\n#include \\\"Hazel/Core/Application.h\\\"\\n\\n\\n\\n// TEMPORARY\\n\\n#include <GLFW/glfw3.h>\\n\\n#include <glad/glad.h>\\n\\n\\n\\n#include \\\"ImGuizmo.h\\\"\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/ImGui/ImGuiLayer.cpp\",\n \"rank\": 46,\n \"score\": 4.936438350196774\n },\n {\n \"content\": \"#include <Hazel.h>\\n\\n\\n\\n#include <Hazel/Core/EntryPoint.h>\\n\\n\\n\\n#include <imgui/imgui.h>\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\n#include \\\"Sandbox2D.h\\\"\\n\\n#include \\\"GameLayer.h\\\"\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/SandboxApp.cpp\",\n \"rank\": 47,\n \"score\": 4.924026578097971\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"OrthographicCamera.h\\\"\\n\\n#include \\\"Camera.h\\\"\\n\\n#include \\\"Texture.h\\\"\\n\\n#include \\\"SubTexture2D.h\\\"\\n\\n#include \\\"EditorCamera.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Scene/Components.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer2D.h\",\n \"rank\": 48,\n \"score\": 4.921526368840995\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\t\\\"MultiProcessorCompile\\\"\\n\\n\\t}\\n\\n\\n\\noutputdir = \\\"%{cfg.buildcfg}-%{cfg.system}-%{cfg.architecture}\\\"\\n\\n\\n\\n-- Include directories relative to root folder (solution directory)\\n\\nIncludeDir = {}\\n\\nIncludeDir[\\\"GLFW\\\"] = \\\"%{wks.location}/Hazel/vendor/GLFW/include\\\"\\n\\nIncludeDir[\\\"Glad\\\"] = \\\"%{wks.location}/Hazel/vendor/Glad/include\\\"\\n\\nIncludeDir[\\\"ImGui\\\"] = \\\"%{wks.location}/Hazel/vendor/imgui\\\"\\n\\nIncludeDir[\\\"glm\\\"] = \\\"%{wks.location}/Hazel/vendor/glm\\\"\\n\\nIncludeDir[\\\"stb_image\\\"] = \\\"%{wks.location}/Hazel/vendor/stb_image\\\"\\n\\nIncludeDir[\\\"entt\\\"] = \\\"%{wks.location}/Hazel/vendor/entt/include\\\"\\n\\nIncludeDir[\\\"yaml_cpp\\\"] = \\\"%{wks.location}/Hazel/vendor/yaml-cpp/include\\\"\\n\\nIncludeDir[\\\"ImGuizmo\\\"] = \\\"%{wks.location}/Hazel/vendor/ImGuizmo\\\"\\n\\n\\n\\ngroup \\\"Dependencies\\\"\\n\\n\\tinclude \\\"vendor/premake\\\"\\n\\n\\tinclude \\\"Hazel/vendor/GLFW\\\"\\n\\n\\tinclude \\\"Hazel/vendor/Glad\\\"\\n\\n\\tinclude \\\"Hazel/vendor/imgui\\\"\\n\\n\\tinclude \\\"Hazel/vendor/yaml-cpp\\\"\\n\\ngroup \\\"\\\"\\n\\n\\n\\ninclude \\\"Hazel\\\"\\n\\ninclude \\\"Sandbox\\\"\\n\\ninclude \\\"Hazel-Editor\\\"\",\n \"file_path\": \"premake5.lua\",\n \"rank\": 49,\n \"score\": 4.908407273071825\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Scene.h\\\"\\n\\n\\n\\n#include \\\"Entity.h\\\"\\n\\n#include \\\"Components.h\\\"\\n\\n#include \\\"Hazel/Renderer/Renderer2D.h\\\"\\n\\n\\n\\n//#include <glm/glm.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tScene::Scene()\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\tScene::~Scene()\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Scene.cpp\",\n \"rank\": 50,\n \"score\": 4.894566638033482\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <Hazel.h>\\n\\n\\n\\n#include \\\"Color.h\\\"\\n\\n#include \\\"Random.h\\\"\\n\\n#include \\\"ParticleSystem.h\\\"\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/Player.h\",\n \"rank\": 51,\n \"score\": 4.892619696021304\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Core/Core.h\\\"\\n\\n\\n\\n#include \\\"Window.h\\\"\\n\\n#include \\\"LayerStack.h\\\"\\n\\n#include \\\"Hazel/Events/Event.h\\\"\\n\\n#include \\\"Hazel/Events/ApplicationEvent.h\\\"\\n\\n\\n\\n#include \\\"Timestep.h\\\"\\n\\n\\n\\n#include \\\"Hazel/ImGui/ImGuiLayer.h\\\"\\n\\n\\n\\nnamespace Hazel \\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Application.h\",\n \"rank\": 52,\n \"score\": 4.889383184989084\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n\\n\\n#include \\\"Renderer2D.h\\\"\\n\\n#include \\\"VertexArray.h\\\"\\n\\n#include \\\"Shader.h\\\"\\n\\n#include \\\"Buffer.h\\\"\\n\\n#include \\\"RendererCommand.h\\\"\\n\\n#include \\\"Texture.h\\\"\\n\\n\\n\\n#include \\\"Platform/OpenGL/OpenGLShader.h\\\"\\n\\n\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tstruct QuadVertex\\n\\n\\t{\\n\\n\\t\\tglm::vec3 Position;\\n\\n\\t\\tglm::vec4 Color;\\n\\n\\t\\tglm::vec2 TexCoord;\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer2D.cpp\",\n \"rank\": 53,\n \"score\": 4.882488968284861\n },\n {\n \"content\": \"#include <Hazel.h>\\n\\n\\n\\n#include <Hazel/Core/EntryPoint.h>\\n\\n\\n\\n#include <imgui/imgui.h>\\n\\n#include <glm/gtc/matrix_transform.hpp>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\n#include \\\"EditorLayer.h\\\"\\n\\n\\n\",\n \"file_path\": \"Hazel-Editor/src/HazelEditorApp.cpp\",\n \"rank\": 54,\n \"score\": 4.8811972325335296\n },\n {\n \"content\": \"\\t\\t\\\"vendor/ImGuizmo/ImGuizmo.h\\\",\\n\\n\\t\\t\\\"vendor/ImGuizmo/ImGuizmo.cpp\\\"\\n\\n\\t}\\n\\n\\n\\n\\tdefines\\n\\n\\t{\\n\\n\\t\\t\\\"_CRT_SECURE_NO_WARNINGS\\\",\\n\\n\\t\\t\\\"GLFW_INCLUDE_NONE\\\"\\n\\n\\t}\\n\\n\\n\\n\\tincludedirs\\n\\n\\t{\\n\\n\\t\\t\\\"src\\\",\\n\\n\\t\\t\\\"vendor/spdlog/include\\\",\\n\\n\\t\\t\\\"%{IncludeDir.GLFW}\\\",\\n\\n\\t\\t\\\"%{IncludeDir.Glad}\\\",\\n\\n\\t\\t\\\"%{IncludeDir.ImGui}\\\",\\n\\n\\t\\t\\\"%{IncludeDir.glm}\\\",\\n\\n\\t\\t\\\"%{IncludeDir.stb_image}\\\",\\n\\n\\t\\t\\\"%{IncludeDir.entt}\\\",\\n\",\n \"file_path\": \"Hazel/premake5.lua\",\n \"rank\": 55,\n \"score\": 4.826129351651299\n },\n {\n \"content\": \"\\t\\t\\t\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\\n\\n\\t\\t\\t\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_R, GL_CLAMP_TO_EDGE);\\n\\n\\t\\t\\t\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\\n\\n\\t\\t\\t\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tglFramebufferTexture2D(GL_FRAMEBUFFER, attachmentType, TextureTarget(multisampled), id, 0);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic bool IsDepthFormat(FramebufferTextureFormat format)\\n\\n\\t\\t{\\n\\n\\t\\t\\tswitch (format)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tcase FramebufferTextureFormat::DEPTH24STENCIL8: return true;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic GLenum HazelFBTextureFormatToGL(FramebufferTextureFormat format)\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.cpp\",\n \"rank\": 56,\n \"score\": 4.7946632836856224\n },\n {\n \"content\": \"\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tstatic void SerializerEntity(YAML::Emitter& out, Entity entity)\\n\\n\\t{\\n\\n\\t\\tout << YAML::BeginMap; // Entity\\n\\n\\t\\tout << YAML::Key << \\\"Entity\\\" << YAML::Value << (uint32_t)entity; // TODO: Entity ID goes here\\n\\n\\n\\n\\t\\tif (entity.HasComponent<TagComponent>())\\n\\n\\t\\t{\\n\\n\\t\\t\\tout << YAML::Key << \\\"TagComponent\\\";\\n\\n\\t\\t\\tout << YAML::BeginMap; // TagComponent\\n\\n\\n\\n\\t\\t\\tauto& tag = entity.GetComponent<TagComponent>().Tag;\\n\\n\\t\\t\\tout << YAML::Key << \\\"Tag\\\" << YAML::Value << tag;\\n\\n\\n\\n\\t\\t\\tout << YAML::EndMap; // TagComponent\\n\\n\\t\\t}\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/SceneSerializer.cpp\",\n \"rank\": 57,\n \"score\": 4.7914879298459265\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <Hazel.h>\\n\\n\\n\\n#include \\\"Level.h\\\"\\n\\n#include <imgui/imgui.h>\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/GameLayer.h\",\n \"rank\": 58,\n \"score\": 4.773107696931341\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Camera.h\\\"\\n\\n#include \\\"Hazel/Core/Timestep.h\\\"\\n\\n#include \\\"Hazel/Events/Event.h\\\"\\n\\n#include \\\"Hazel/Events/MouseEvent.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/EditorCamera.h\",\n \"rank\": 59,\n \"score\": 4.736988543533212\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Shader.h\\\"\\n\\n#include \\\"RendererCommand.h\\\"\\n\\n#include \\\"OrthographicCamera.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer.h\",\n \"rank\": 60,\n \"score\": 4.697820624802768\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Core.h\\\"\\n\\n\\n\\n#include \\\"spdlog/spdlog.h\\\"\\n\\n#include \\\"spdlog/fmt/ostr.h\\\"\\n\\n\\t\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Log.h\",\n \"rank\": 61,\n \"score\": 4.673249958683749\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Core/Core.h\\\"\\n\\n#include \\\"Texture.h\\\"\\n\\n\\n\\n#include <glm/glm.hpp>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/SubTexture2D.h\",\n \"rank\": 62,\n \"score\": 4.648934975584767\n },\n {\n \"content\": \"\\t\\tImGui::End();\\n\\n\\t}\\n\\n\\n\\n\\tvoid SceneHierarchyPanel::DrawEntityNode(Entity& entity)\\n\\n\\t{\\n\\n\\t\\tauto& tag = entity.GetComponent<TagComponent>().Tag;\\n\\n\\n\\n\\t\\tImGuiTreeNodeFlags flags = ((m_SelectionContext == entity) ? ImGuiTreeNodeFlags_Selected : 0) | ImGuiTreeNodeFlags_OpenOnArrow;\\n\\n\\t\\tflags |= ImGuiTreeNodeFlags_SpanAvailWidth;\\n\\n\\t\\tbool opened = ImGui::TreeNodeEx((void*)((uint64_t)(uint32_t)entity), flags, tag.c_str());\\n\\n\\t\\tif (ImGui::IsItemClicked())\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_SelectionContext = entity;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tbool entityDelete = false;\\n\\n\\t\\tif (ImGui::BeginPopupContextItem())\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (ImGui::MenuItem(\\\"Delete Entity\\\"))\\n\\n\\t\\t\\t\\tentityDelete = true;\\n\",\n \"file_path\": \"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp\",\n \"rank\": 63,\n \"score\": 4.629583990179634\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Core/Window.h\\\"\\n\\n#include \\\"Hazel/Renderer/GraphicsContext.h\\\"\\n\\n\\n\\n#include <GLFW/glfw3.h>\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsWindow.h\",\n \"rank\": 64,\n \"score\": 4.601056258989728\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Core/Timestep.h\\\"\\n\\n#include \\\"Hazel/Renderer/EditorCamera.h\\\"\\n\\n\\n\\n#include \\\"entt.hpp\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Scene.h\",\n \"rank\": 65,\n \"score\": 4.601056258989728\n },\n {\n \"content\": \"\\n\\n\\tOpenGLVertexBuffer::OpenGLVertexBuffer(float* vertices, uint32_t size)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tglCreateBuffers(1, &m_RendererID);\\n\\n\\t\\tglBindBuffer(GL_ARRAY_BUFFER, m_RendererID);\\n\\n\\t\\tglBufferData(GL_ARRAY_BUFFER, size, vertices, GL_STATIC_DRAW);\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\tOpenGLVertexBuffer::~OpenGLVertexBuffer()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tglDeleteBuffers(1, &m_RendererID);\\n\\n\\t}\\n\\n\\n\\n\\tvoid OpenGLVertexBuffer::Bind() const\\n\\n\\t{\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLBuffer.cpp\",\n \"rank\": 66,\n \"score\": 4.5730185570421025\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel.h\\\"\\n\\n\\n\\n#include \\\"ParticleSystem.h\\\"\\n\\n\\n\",\n \"file_path\": \"Sandbox/src/Sandbox2D.h\",\n \"rank\": 67,\n \"score\": 4.550783749001534\n },\n {\n \"content\": \"\\t\\tuint32_t QuadIndexCount = 0;\\n\\n\\t\\tQuadVertex* QuadVertexBufferBase = nullptr;\\n\\n\\t\\tQuadVertex* QuadVertexBufferPtr = nullptr;\\n\\n\\n\\n\\t\\tstd::array<Ref<Texture2D>, MaxTextureSlots> TextureSlots;\\n\\n\\t\\tuint32_t TextureSlotIndex = 1; // 0 = White texture\\n\\n\\n\\n\\t\\tglm::vec4 QuadVertexPositions[4];\\n\\n\\n\\n\\t\\tRenderer2D::Statistics Stats;\\n\\n\\t};\\n\\n\\n\\n\\tstatic Renderer2DStorage s_Data;\\n\\n\\n\\n\\tvoid Renderer2D::Init()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\ts_Data.QuadVertexArray = VertexArray::Create();\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer2D.cpp\",\n \"rank\": 68,\n \"score\": 4.538529282854405\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"hzpch.h\\\"\\n\\n#include \\\"Event.h\\\"\\n\\n\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Events/MouseEvent.h\",\n \"rank\": 69,\n \"score\": 4.516280510865067\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"hzpch.h\\\"\\n\\n#include \\\"Event.h\\\"\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Events/KeyEvent.h\",\n \"rank\": 70,\n \"score\": 4.516280510865067\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <memory>\\n\\n#include \\\"Buffer.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/VertexArray.h\",\n \"rank\": 71,\n \"score\": 4.516280510865067\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tif (Input::IsKeyPressed(HZ_KEY_A))\\n\\n\\t\\t\\tm_CameraPosition.x += m_CameraTranslationSpeed * ts;\\n\\n\\t\\telse if (Input::IsKeyPressed(HZ_KEY_D))\\n\\n\\t\\t\\tm_CameraPosition.x -= m_CameraTranslationSpeed * ts;\\n\\n\\n\\n\\t\\tif (Input::IsKeyPressed(HZ_KEY_W))\\n\\n\\t\\t\\tm_CameraPosition.y -= m_CameraTranslationSpeed * ts;\\n\\n\\t\\telse if (Input::IsKeyPressed(HZ_KEY_S))\\n\\n\\t\\t\\tm_CameraPosition.y += m_CameraTranslationSpeed * ts;\\n\\n\\n\\n\\t\\tif (m_Rotation) \\n\\n\\t\\t{\\n\\n\\t\\t\\tif (Input::IsKeyPressed(HZ_KEY_Q))\\n\\n\\t\\t\\t\\tm_CameraRotation += m_CameraRotationSpeed * ts;\\n\\n\\t\\t\\telse if (Input::IsKeyPressed(HZ_KEY_E))\\n\\n\\t\\t\\t\\tm_CameraRotation -= m_CameraRotationSpeed * ts;\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/OrthographicCameraController.cpp\",\n \"rank\": 72,\n \"score\": 4.513161420932953\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n\\n\\n#define IMGUI_IMPL_OPENGL_LOADER_GLAD\\n\\n#include <examples/imgui_impl_opengl3.cpp>\\n\\n#include <examples/imgui_impl_glfw.cpp>\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/ImGui/ImGuiBuild.cpp\",\n \"rank\": 73,\n \"score\": 4.485565758033494\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Scene.h\\\"\\n\\n\\n\\n#include \\\"entt.hpp\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Entity.h\",\n \"rank\": 74,\n \"score\": 4.482296530714082\n },\n {\n \"content\": \"\\t\\t\\tif (epsilonEqual(LocalMatrix[3][3], static_cast<float>(0), epsilon<T>()))\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\n\\n\\t\\t\\t// First, isolate perspective. This is the messiest.\\n\\n\\t\\t\\tif (\\n\\n\\t\\t\\t\\tepsilonNotEqual(LocalMatrix[0][3], static_cast<T>(0), epsilon<T>()) ||\\n\\n\\t\\t\\t\\tepsilonNotEqual(LocalMatrix[1][3], static_cast<T>(0), epsilon<T>()) ||\\n\\n\\t\\t\\t\\tepsilonNotEqual(LocalMatrix[2][3], static_cast<T>(0), epsilon<T>()))\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// Clear the perspective partition\\n\\n\\t\\t\\t\\tLocalMatrix[0][3] = LocalMatrix[1][3] = LocalMatrix[2][3] = static_cast<T>(0);\\n\\n\\t\\t\\t\\tLocalMatrix[3][3] = static_cast<T>(1);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t// Next take care of translation (easy).\\n\\n\\t\\t\\ttranslation = vec3(LocalMatrix[3]);\\n\\n\\t\\t\\tLocalMatrix[3] = vec4(0, 0, 0, LocalMatrix[3].w);\\n\\n\\n\\n\\t\\t\\tvec3 Row[3], Pdum3;\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Math/Math.cpp\",\n \"rank\": 75,\n \"score\": 4.475995144329643\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Core/Core.h\\\"\\n\\n#include \\\"Scene.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/SceneSerializer.h\",\n \"rank\": 76,\n \"score\": 4.448820174200882\n },\n {\n \"content\": \"\\t\\tfor (auto entity : grop)\\n\\n\\t\\t{\\n\\n\\t\\t\\tauto [transform, sprite] = grop.get<TransformComponent, SpriteRendererComponent>(entity);\\n\\n\\t\\t\\t//Renderer2D::DrawQuad(transform.GetTransform(), sprite.Color);\\n\\n\\t\\t\\tRenderer2D::DrawSprite(transform.GetTransform(), sprite, (int)entity);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tRenderer2D::EndScene();\\n\\n\\t}\\n\\n\\n\\n\\tvoid Scene::OnUpdateRuntime(Timestep ts)\\n\\n\\t{\\n\\n\\t\\t// Update Script\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_Registry.view<NativeScriptComponent>().each([=](auto entity, auto& nsc)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t// TODO: Move To Scene::OnScenePlay\\n\\n\\t\\t\\t\\t\\tif (!nsc.Instance)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tnsc.Instance = nsc.InstantiateScript();\\n\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Scene.cpp\",\n \"rank\": 77,\n \"score\": 4.42453744156035\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Renderer/Texture.h\\\"\\n\\n#include <glad/glad.h>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLTexture.h\",\n \"rank\": 78,\n \"score\": 4.415840151969048\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <glm/glm.hpp>\\n\\n\\n\\n#include \\\"VertexArray.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/RendererAPI.h\",\n \"rank\": 79,\n \"score\": 4.415840151969048\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel.h\\\"\\n\\n\\n\\n#include \\\"Panels/SceneHierarchyPanel.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel-Editor/src/EditorLayer.h\",\n \"rank\": 80,\n \"score\": 4.415840151969048\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"EditorCamera.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Core/Input.h\\\"\\n\\n#include \\\"Hazel/Core/KeyCodes.h\\\"\\n\\n#include \\\"Hazel/Core/MouseButtonCodes.h\\\"\\n\\n\\n\\n#include <glfw/glfw3.h>\\n\\n\\n\\n#define GLM_ENABLE_EXPERIMENTAL\\n\\n#include <glm/gtx/quaternion.hpp>\\n\\n\\n\\nnamespace Hazel {\\n\\n\\n\\n\\tEditorCamera::EditorCamera(float fov, float aspectRatio, float nearClip, float farClip)\\n\\n\\t\\t: m_FOV(fov), m_AspectRatio(aspectRatio), m_NearClip(nearClip), m_FarClip(farClip), Camera(glm::perspective(glm::radians(fov), aspectRatio, nearClip, farClip))\\n\\n\\t{\\n\\n\\t\\tUpdateView();\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/EditorCamera.cpp\",\n \"rank\": 81,\n \"score\": 4.403960516471075\n },\n {\n \"content\": \"#include \\\"SceneHierarchyPanel.h\\\"\\n\\n\\n\\n#include <imgui/imgui.h>\\n\\n#include <imgui/imgui_internal.h>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\n#include <cstring>\\n\\n\\n\\n/* The Microsoft C++ compiler is non-compliant with the C++ standard and needs\\n\\n * the following definition to disable a security warning on std::strncpy().\\n\\n */\\n\\n#ifdef _MSVC_LANG\\n\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n#endif\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tSceneHierarchyPanel::SceneHierarchyPanel(const Ref<Scene>& scene)\\n\\n\\t{\\n\",\n \"file_path\": \"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp\",\n \"rank\": 82,\n \"score\": 4.3954535247075155\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Events/Event.h\\\"\\n\\n#include \\\"Hazel/Core/Timestep.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Layer.h\",\n \"rank\": 83,\n \"score\": 4.383345506960088\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Core/Core.h\\\"\\n\\n#include \\\"Hazel/Renderer/Framebuffer.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLFramebuffer.h\",\n \"rank\": 84,\n \"score\": 4.383345506960088\n },\n {\n \"content\": \"\\t/////////////////////////////////////////////////////////////////////\\n\\n\\tOpenGLIndexBuffer::OpenGLIndexBuffer(uint32_t* indices, uint32_t count)\\n\\n\\t\\t: m_Count(count)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tglCreateBuffers(1, &m_RendererID);\\n\\n\\t\\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_RendererID);\\n\\n\\t\\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, count * sizeof(uint32_t), indices, GL_STATIC_DRAW);\\n\\n\\t}\\n\\n\\n\\n\\tOpenGLIndexBuffer::~OpenGLIndexBuffer()\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tglDeleteBuffers(1, &m_RendererID);\\n\\n\\t}\\n\\n\\n\\n\\tvoid OpenGLIndexBuffer::Bind() const\\n\\n\\t{\\n\",\n \"file_path\": \"Hazel/src/Platform/OpenGL/OpenGLBuffer.cpp\",\n \"rank\": 85,\n \"score\": 4.373602786482774\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Application.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Renderer/Renderer.h\\\"\\n\\n\\n\\n#include <glfw/glfw3.h>\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tApplication* Application::s_Instance = nullptr;\\n\\n\\n\\n\\tApplication::Application(const std::string& name/* = \\\"\\\"*/)\\n\\n\\t{\\n\\n\\t\\tHZ_PROFILE_FUNCTION();\\n\\n\\n\\n\\t\\tHZ_CORE_ASSERT(!s_Instance, \\\"Application already exists!\\\");\\n\\n\\t\\ts_Instance = this;\\n\\n\\n\\n\\t\\tm_Window = Window::Create(WindowProps(name));\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Application.cpp\",\n \"rank\": 86,\n \"score\": 4.371933828599548\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"RendererCommand.h\\\"\\n\\n\\n\\n#include \\\"Platform/OpenGL/OpenGLRendererAPI.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tRendererAPI* RendererCommand::s_RendererAPI = new OpenGLRendererAPI();\\n\\n\\n\\n}\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/RendererCommand.cpp\",\n \"rank\": 87,\n \"score\": 4.354406504100932\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"Hazel/Renderer/OrthographicCamera.h\\\"\\n\\n#include \\\"Hazel/Core/Timestep.h\\\"\\n\\n\\n\\n#include \\\"Hazel/Events/ApplicationEvent.h\\\"\\n\\n#include \\\"Hazel/Events/MouseEvent.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tstruct OrthographicCameraBounds\\n\\n\\t{\\n\\n\\t\\tfloat Left, Right;\\n\\n\\t\\tfloat Bottom, Top;\\n\\n\\n\\n\\t\\tfloat GetWidth() { return Right - Left; }\\n\\n\\t\\tfloat GetHeight() { return Top - Bottom; }\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/OrthographicCameraController.h\",\n \"rank\": 88,\n \"score\": 4.340079823461601\n },\n {\n \"content\": \"\\n\\n\\tvoid EditorCamera::OnUpdate(Timestep ts)\\n\\n\\t{\\n\\n\\t\\tif (Input::IsKeyPressed(HZ_KEY_LEFT_ALT))\\n\\n\\t\\t{\\n\\n\\t\\t\\tconst glm::vec2& mouse{ Input::GetMouseX(), Input::GetMouseY() };\\n\\n\\t\\t\\tglm::vec2 delta = (mouse - m_InitialMousePosition) * 0.003f;\\n\\n\\t\\t\\tm_InitialMousePosition = mouse;\\n\\n\\n\\n\\t\\t\\tif (Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_MIDDLE))\\n\\n\\t\\t\\t\\tMousePan(delta);\\n\\n\\t\\t\\telse if (Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_LEFT))\\n\\n\\t\\t\\t\\tMouseRotate(delta);\\n\\n\\t\\t\\telse if (Input::IsMouseButtonPressed(HZ_MOUSE_BUTTON_RIGHT))\\n\\n\\t\\t\\t\\tMouseZoom(delta.y);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tUpdateView();\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/EditorCamera.cpp\",\n \"rank\": 90,\n \"score\": 4.298654825466244\n },\n {\n \"content\": \"\\t\\t\\tbool open = ImGui::TreeNodeEx((void*)typeid(T).hash_code(), treeNodeFlags, name.c_str());\\n\\n\\t\\t\\tImGui::PopStyleVar();\\n\\n\\n\\n\\t\\t\\tbool removeComponent = false;\\n\\n\\t\\t\\tif (name != \\\"Transform\\\")\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tImGui::SameLine(contentRegionAvailable.x - lineHeight * 0.5f);\\n\\n\\t\\t\\t\\tif (ImGui::Button(\\\"+\\\", ImVec2{ lineHeight + panding / 2, lineHeight + panding / 2 }))\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tImGui::OpenPopup(\\\"ComponentSettings\\\");\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\tif (ImGui::BeginPopup(\\\"ComponentSettings\\\"))\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif (ImGui::MenuItem(\\\"Remove Component\\\"))\\n\\n\\t\\t\\t\\t\\t\\tremoveComponent = true;\\n\\n\\n\\n\\t\\t\\t\\t\\tImGui::EndPopup();\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\",\n \"file_path\": \"Hazel-Editor/src/Panels/SceneHierarchyPanel.cpp\",\n \"rank\": 91,\n \"score\": 4.2336124799529475\n },\n {\n \"content\": \"#pragma once\\n\\n//\\n\\n// Basic instrumentation profiler by Cherno\\n\\n\\n\\n// Usage: include this header file somewhere in your code (eg. precompiled header), and then use like:\\n\\n//\\n\\n// Instrumentor::Get().BeginSession(\\\"Session Name\\\"); // Begin session \\n\\n// {\\n\\n// InstrumentationTimer timer(\\\"Profiled Scope Name\\\"); // Place code like this in scopes you'd like to include in profiling\\n\\n// // Code\\n\\n// }\\n\\n// Instrumentor::Get().EndSession(); // End Session\\n\\n//\\n\\n// You will probably want to macro-fy this, to switch on/off easily and use things like __FUNCSIG__ for the profile name.\\n\\n//\\n\\n#pragma once\\n\\n\\n\\n#include <string>\\n\\n#include <chrono>\\n\\n#include <algorithm>\\n\",\n \"file_path\": \"Hazel/src/Hazel/Debug/Instrumentor.h\",\n \"rank\": 92,\n \"score\": 4.233029207552987\n },\n {\n \"content\": \"\\t\\t// TODO: color, texid\\n\\n\\t\\tfloat TexIndex;\\n\\n\\t\\tfloat TilingFactor;\\n\\n\\n\\n\\t\\t// Entity-only\\n\\n\\t\\tint EntityID;\\n\\n\\t};\\n\\n\\n\\n\\tstruct Renderer2DStorage\\n\\n\\t{\\n\\n\\t\\tstatic const uint32_t MaxQuads = 100;\\n\\n\\t\\tstatic const uint32_t MaxVertices = MaxQuads * 4;\\n\\n\\t\\tstatic const uint32_t MaxIndices = MaxQuads * 6;\\n\\n\\t\\tstatic const uint32_t MaxTextureSlots = 32; // TODO: Render Caps\\n\\n\\n\\n\\t\\tRef<VertexArray> QuadVertexArray;\\n\\n\\t\\tRef<VertexBuffer> QuadVertexBuffer;\\n\\n\\t\\tRef<Shader> TextureShader;\\n\\n\\t\\tRef<Texture2D> WhiteTexture;\\n\\n\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer2D.cpp\",\n \"rank\": 93,\n \"score\": 4.2262773154492805\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tRenderer2D::Shutdown();\\n\\n\\t}\\n\\n\\n\\n\\tvoid Renderer::OnWindowResize(uint32_t width, uint32_t height)\\n\\n\\t{\\n\\n\\t\\tRendererCommand::SetViewport(0, 0, width, height);\\n\\n\\t}\\n\\n\\n\\n\\tvoid Renderer::BeginScene(OrthographicCamera& camera)\\n\\n\\t{\\n\\n\\t\\tm_SceneData->ViewProjectionMatrix = camera.GetViewProjectionMatrix();\\n\\n\\t}\\n\\n\\n\\n\\tvoid Renderer::EndScene()\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tvoid Renderer::Submit(const Ref<Shader>& shader, \\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/Renderer.cpp\",\n \"rank\": 94,\n \"score\": 4.189102055479687\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"RendererAPI.h\\\"\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tRendererAPI::API RendererAPI::s_API = RendererAPI::API::OpenGL;\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Renderer/RendererAPI.cpp\",\n \"rank\": 95,\n \"score\": 4.1686175719320335\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Entity.h\\\"\\n\\n\\n\\n\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\tEntity::Entity(entt::entity handle, Scene* scene)\\n\\n\\t\\t:m_EntityHandle(handle), m_Scene(scene)\\n\\n\\t{\\n\\n\\t}\\n\\n}\",\n \"file_path\": \"Hazel/src/Hazel/Scene/Entity.cpp\",\n \"rank\": 96,\n \"score\": 4.1686175719320335\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\\n\\n#include \\\"Layer.h\\\"\\n\\n\\n\\nnamespace Hazel\\n\\n{\\n\\n\\n\\n\\tLayer::Layer(const std::string& debugName)\\n\\n\\t\\t:m_DebugName(debugName)\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tLayer::~Layer()\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Hazel/src/Hazel/Core/Layer.cpp\",\n \"rank\": 97,\n \"score\": 4.1686175719320335\n },\n {\n \"content\": \"#include \\\"hzpch.h\\\"\",\n \"file_path\": \"Hazel/src/hzpch.cpp\",\n \"rank\": 98,\n \"score\": 4.102849576387479\n },\n {\n \"content\": \"\\t\\tZeroMemory(&ofn, sizeof(OPENFILENAME));\\n\\n\\t\\tofn.lStructSize = sizeof(OPENFILENAME);\\n\\n\\t\\tofn.hwndOwner = glfwGetWin32Window((GLFWwindow*)Application::Get().GetWindow().GetNativeWindow());\\n\\n\\t\\tofn.lpstrFile = szFile;\\n\\n\\t\\tofn.nMaxFile = sizeof(szFile);\\n\\n\\t\\tif (GetCurrentDirectoryA(256, currentDir))\\n\\n\\t\\t\\tofn.lpstrInitialDir = currentDir;\\n\\n\\t\\tofn.lpstrFilter = filter;\\n\\n\\t\\tofn.nFilterIndex = 1;\\n\\n\\t\\tofn.Flags = OFN_PATHMUSTEXIST | OFN_FILEMUSTEXIST | OFN_NOCHANGEDIR;\\n\\n\\n\\n\\t\\tif (GetOpenFileNameA(&ofn) == TRUE)\\n\\n\\t\\t\\treturn ofn.lpstrFile;\\n\\n\\n\\n\\t\\treturn std::string();\\n\\n\\t}\\n\\n\\n\\n\\tstd::string FileDialogs::SaveFile(const char* filter)\\n\\n\\t{\\n\\n\\t\\tOPENFILENAMEA ofn;\\n\",\n \"file_path\": \"Hazel/src/Platform/Windows/WindowsPlatformUtils.cpp\",\n \"rank\": 99,\n \"score\": 4.065298272570798\n }\n]","isConversational":false}}},{"rowIdx":86,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/vm/vm_detect.cpp"},"repo_name":{"kind":"string","value":"bouldev/libbouldev"},"commit":{"kind":"string","value":"afe0d5dca71d4f9c94b11273c4884a92f2549df8"},"file_code":{"kind":"string","value":"\n#include <libbouldev.h>\n#include <string>\n#ifdef _WIN32\n#include \"stdafx.h\"\n#include <iostream>\n#include <Wbemidl.h>\n#pragma comment(lib, \"wbemuuid.lib\")\n#endif\n\n#ifdef _WIN32\n\nstatic\nbool InitWMI(IWbemServices **pSvc, IWbemLocator **pLoc, const TCHAR* szNetworkResource)\n{\n\tHRESULT hres;\n\thres = CoInitializeEx(0, COINIT_MULTITHREADED);\n\thres = CoInitializeSecurity(NULL, -1, NULL, NULL, RPC_C_AUTHN_LEVEL_DEFAULT, RPC_C_IMP_LEVEL_IMPERSONATE, NULL, EOAC_NONE, NULL);\n\thres = CoCreateInstance(CLSID_WbemLocator, NULL, CLSCTX_INPROC_SERVER, IID_PPV_ARGS(pLoc));\n\tBSTR strNetworkResource = SysAllocString(szNetworkResource);\n\tif (strNetworkResource) \n\t{\n\t\thres = (*pLoc)->ConnectServer(strNetworkResource, NULL, NULL, NULL, WBEM_FLAG_CONNECT_USE_MAX_WAIT, 0, 0, pSvc);\n\t\tSysFreeString(strNetworkResource);\n\t}\n\thres = CoSetProxyBlanket(*pSvc, RPC_C_AUTHN_WINNT, RPC_C_AUTHZ_NONE, NULL, RPC_C_AUTHN_LEVEL_CALL, RPC_C_IMP_LEVEL_IMPERSONATE, NULL, EOAC_NONE);\n\treturn 1;\n}\n\nstatic\nbool ExecWMIQuery(IWbemServices **pSvc, IWbemLocator **pLoc, IEnumWbemClassObject **pEnumerator, const TCHAR* szQuery)\n{\n\tBSTR strQueryLanguage = SysAllocString(OLESTR(\"WQL\"));\n\tBSTR strQuery = SysAllocString(szQuery);\n\tBOOL bQueryResult = TRUE;\n\tif (strQueryLanguage && strQuery) HRESULT hres = (*pSvc)->ExecQuery(strQueryLanguage, strQuery, WBEM_FLAG_FORWARD_ONLY | WBEM_FLAG_RETURN_IMMEDIATELY, NULL, pEnumerator);\n\tif (strQueryLanguage) SysFreeString(strQueryLanguage);\n\tif (strQuery) SysFreeString(strQuery);\n\treturn bQueryResult;\n}\n\nstatic\nint wmi_query_count(const _TCHAR* query)\n{\n IWbemServices *pSvc = NULL;\n IWbemLocator *pLoc = NULL;\n IEnumWbemClassObject* pEnumerator = NULL;\n BOOL bStatus = FALSE;\n HRESULT hRes;\n int count = 0;\n bStatus = InitWMI(&pSvc, &pLoc, _T(\"ROOT\\\\CIMV2\"));\n if (bStatus)\n {\n bStatus = ExecWMIQuery(&pSvc, &pLoc, &pEnumerator, query);\n if (bStatus)\n {\n IWbemClassObject *pclsObj = NULL;\n ULONG uReturn = 0;\n while (pEnumerator)\n {\n hRes = pEnumerator->Next(WBEM_INFINITE, 1, &pclsObj, &uReturn);\n if (0 == uReturn) break;\n count++;\n pclsObj->Release();\n }\n\t}\n pSvc->Release();\n pLoc->Release();\n CoUninitialize(); \n }\n else return -1;\n return count;\n}\n#endif\n\n#ifdef linux\nstatic\nbool under_qemu()\n{\n\tchar *cmdline = NULL;\n\tchar *out = NULL;\n\tint ret = 0;\n\tstrcpy(cmdline, \"cat /proc/cpuinfo | grep QEMU &> /dev/null\");\n\tboul_cmd buf = { cmdline, ret, out };\n\trun_cmd(buf);\n\n\tif (ret == 0) return true;\n\treturn false;\n}\n#endif\n\nstatic\nbool under_sandbox()\n{\n\tif (path_exists(\"/.dockerenv\")) return true;\n#ifdef linux\n\tchar *cmdline = NULL;\n\tchar *out = NULL;\n\tint ret = 0;\n\tstrcpy(cmdline, \"grep -sq 'docker|lxc' /proc/1/cgroup &> /dev/null\");\n\tboul_cmd buf = { cmdline, ret, out };\n\trun_cmd(buf);\n\n\tif (ret == 0) return true;\n#endif\n\treturn false;\n}\n\nbool os_is_vm()\n{\n#ifdef _WIN32\n\treturn wmi_query_count(_T(\"SELECT * FROM Win32_PortConnector\")) == 0 ? true : false;\n#elif defined(linux)\n\treturn (under_qemu() || under_sandbox());\n#elif defined(__APPLE__)\n \n return false;\n#endif\n}\n"},"prefix":{"kind":"string","value":"\n#include <libbouldev.h>\n#include <string>\n#ifdef _WIN32\n#include \"stdafx.h\"\n#include <iostream>\n#include <Wbemidl.h>\n#pragma comment(lib, \"wbemuuid.lib\")\n#endif\n\n#ifdef _WIN32\n\nstatic\nbool InitWMI(IWbemServices **pSvc, IWbemLocator **pLoc, const TCHAR* szNetworkResource)\n{\n\tHRESULT hres;\n\thres = CoInitializeEx(0, COINIT_MULTITHREADED);\n\thres = CoInitializeSecurity(NULL, -1, NULL, NULL, RPC_C_AUTHN_LEVEL_DEFAULT, RPC_C_IMP_LEVEL_IMPERSONATE, NULL, EOAC_NONE, NULL);\n\thres = CoCreateInstance(CLSID_WbemLocator, NULL, CLSCTX_INPROC_SERVER, IID_PPV_ARGS(pLoc));\n\tBSTR strNetworkResource = SysAllocString(szNetworkResource);\n\tif (strNetworkResource) \n\t{\n\t\thres = (*pLoc)->ConnectServer(strNetworkResource, NULL, NULL, NULL, WBEM_FLAG_CONNECT_USE_MAX_WAIT, 0, 0, pSvc);\n\t\tSysFreeString(strNetworkResource);\n\t}\n\thres = CoSetProxyBlanket(*pSvc, RPC_C_AUTHN_WINNT, RPC_C_AUTHZ_NONE, NULL, RPC_C_AUTHN_LEVEL_CALL, RPC_C_IMP_LEVEL_IMPERSONATE, NULL, EOAC_NONE);\n\treturn 1;\n}\n\nstatic\nbool ExecWMIQuery(IWbemServices **pSvc, IWbemLocator **pLoc, IEnumWbemClassObject **pEnumerator, const TCHAR* szQuery)\n{\n\tBSTR strQueryLanguage = SysAllocString(OLESTR(\"WQL\"));\n\tBSTR strQuery = SysAllo"},"suffix":{"kind":"string","value":"\n\nstatic\nint wmi_query_count(const _TCHAR* query)\n{\n IWbemServices *pSvc = NULL;\n IWbemLocator *pLoc = NULL;\n IEnumWbemClassObject* pEnumerator = NULL;\n BOOL bStatus = FALSE;\n HRESULT hRes;\n int count = 0;\n bStatus = InitWMI(&pSvc, &pLoc, _T(\"ROOT\\\\CIMV2\"));\n if (bStatus)\n {\n bStatus = ExecWMIQuery(&pSvc, &pLoc, &pEnumerator, query);\n if (bStatus)\n {\n IWbemClassObject *pclsObj = NULL;\n ULONG uReturn = 0;\n while (pEnumerator)\n {\n hRes = pEnumerator->Next(WBEM_INFINITE, 1, &pclsObj, &uReturn);\n if (0 == uReturn) break;\n count++;\n pclsObj->Release();\n }\n\t}\n pSvc->Release();\n pLoc->Release();\n CoUninitialize(); \n }\n else return -1;\n return count;\n}\n#endif\n\n#ifdef linux\nstatic\nbool under_qemu()\n{\n\tchar *cmdline = NULL;\n\tchar *out = NULL;\n\tint ret = 0;\n\tstrcpy(cmdline, \"cat /proc/cpuinfo | grep QEMU &> /dev/null\");\n\tboul_cmd buf = { cmdline, ret, out };\n\trun_cmd(buf);\n\n\tif (ret == 0) return true;\n\treturn false;\n}\n#endif\n\nstatic\nbool under_sandbox()\n{\n\tif (path_exists(\"/.dockerenv\")) return true;\n#ifdef linux\n\tchar *cmdline = NULL;\n\tchar *out = NULL;\n\tint ret = 0;\n\tstrcpy(cmdline, \"grep -sq 'docker|lxc' /proc/1/cgroup &> /dev/null\");\n\tboul_cmd buf = { cmdline, ret, out };\n\trun_cmd(buf);\n\n\tif (ret == 0) return true;\n#endif\n\treturn false;\n}\n\nbool os_is_vm()\n{\n#ifdef _WIN32\n\treturn wmi_query_count(_T(\"SELECT * FROM Win32_PortConnector\")) == 0 ? true : false;\n#elif defined(linux)\n\treturn (under_qemu() || under_sandbox());\n#elif defined(__APPLE__)\n \n return false;\n#endif\n}\n"},"middle":{"kind":"string","value":"cString(szQuery);\n\tBOOL bQueryResult = TRUE;\n\tif (strQueryLanguage && strQuery) HRESULT hres = (*pSvc)->ExecQuery(strQueryLanguage, strQuery, WBEM_FLAG_FORWARD_ONLY | WBEM_FLAG_RETURN_IMMEDIATELY, NULL, pEnumerator);\n\tif (strQueryLanguage) SysFreeString(strQueryLanguage);\n\tif (strQuery) SysFreeString(strQuery);\n\treturn bQueryResult;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"\tchar *out; // stdout buffer\n","file_path":"src/common/libbouldev_private.h","rank":6,"score":1.5771744743371818}],"string":"[\n {\n \"content\": \"\\tchar *out; // stdout buffer\\n\",\n \"file_path\": \"src/common/libbouldev_private.h\",\n \"rank\": 6,\n \"score\": 1.5771744743371818\n }\n]","isConversational":false}}},{"rowIdx":87,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.cpp"},"repo_name":{"kind":"string","value":"yiftachn/krembot_sim_fork"},"commit":{"kind":"string","value":"d3d1b050f9fff4c96bded298eadde5a9ca4dab6b"},"file_code":{"kind":"string","value":"\n\n#include \"radios_default_sensor.h\"\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\n\nnamespace argos {\n\n \n \n\n CRadiosDefaultSensor::CRadiosDefaultSensor() :\n m_pcRadioEquippedEntity(nullptr),\n m_pcControllableEntity(nullptr),\n m_bShowRays(false) {}\n\n \n \n\n void CRadiosDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n try {\n \n m_pcRadioEquippedEntity = &(c_entity.GetComponent<CRadioEquippedEntity>(\"radios\"));\n \n m_vecInterfaces.reserve(m_pcRadioEquippedEntity->GetInstances().size());\n \n for(CRadioEquippedEntity::SInstance& s_instance :\n m_pcRadioEquippedEntity->GetInstances()) {\n \n m_vecInterfaces.emplace_back(s_instance.Radio.GetId());\n }\n \n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\"controller\"));\n }\n catch(CARGoSException& ex) {\n THROW_ARGOSEXCEPTION_NESTED(\"Can't set robot for the radios default sensor\", ex);\n }\n\n \n Enable();\n }\n\n \n \n\n void CRadiosDefaultSensor::Init(TConfigurationNode& t_tree) {\n try {\n \n CCI_RadiosSensor::Init(t_tree);\n \n GetNodeAttributeOrDefault(t_tree, \"show_rays\", m_bShowRays, m_bShowRays);\n }\n catch(CARGoSException& ex) {\n THROW_ARGOSEXCEPTION_NESTED(\"Error initializing the radios default sensor\", ex);\n }\n }\n\n \n \n\n void CRadiosDefaultSensor::Update() {\n \n if (IsDisabled()) {\n return;\n }\n for(size_t i = 0; i < m_pcRadioEquippedEntity->GetInstances().size(); ++i) {\n CRadioEntity& cRadio = m_pcRadioEquippedEntity->GetRadio(i);\n \n m_vecInterfaces[i].Data.clear();\n \n for(const std::pair<CVector3, CByteArray>& c_data : cRadio.GetData()) {\n m_vecInterfaces[i].Data.emplace_back(c_data.second);\n if(m_bShowRays) {\n CRay3 cRay(c_data.first, cRadio.GetPosition());\n m_pcControllableEntity->GetCheckedRays().emplace_back(!c_data.second.Empty(), cRay);\n }\n }\n \n cRadio.GetData().clear();\n }\n }\n\n \n \n\n void CRadiosDefaultSensor::Reset() {\n for(SInterface& s_interface : m_vecInterfaces) {\n \n s_interface.Data.clear();\n }\n }\n\n \n \n\n REGISTER_SENSOR(CRadiosDefaultSensor,\n \"radios\", \"default\",\n \"Michael Allwright [allsey87@gmail.com]\",\n \"1.0\",\n\n \"A generic radio sensor to receive messages from nearby radios.\",\n \"This radio sensor implementation allows an arbitary number of messages\\n\"\n \"containing an arbitary number of bytes to be received from nearby robots. The\\n\"\n \"implementation is very basic and any concepts such as throughput, addressing,\\n\"\n \"or formatting of a message's contents is beyond the scope of this sensor's\\n\"\n \"implementation\\n\\n\"\n\n \"This sensor is enabled by default.\\n\\n\"\n\n \"REQUIRED XML CONFIGURATION\\n\\n\"\n\n \" <controllers>\\n\"\n \" ...\\n\"\n \" <my_controller ...>\\n\"\n \" ...\\n\"\n \" <sensors>\\n\"\n \" ...\\n\"\n \" <radios implementation=\\\"default\\\" medium=\\\"radios\\\" />\\n\"\n \" ...\\n\"\n \" </sensors>\\n\"\n \" ...\\n\"\n \" </my_controller>\\n\"\n \" ...\\n\"\n \" </controllers>\\n\\n\"\n\n \"The 'medium' attribute sets the id of the radio medium declared in the <media>\\n\"\n \"XML section.\\n\\n\"\n\n \"OPTIONAL XML CONFIGURATION\\n\\n\"\n\n \"None.\\n\",\n\n \"Usable\"\n );\n\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"radios_default_sensor.h\"\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\n\nnamespace argos {\n\n \n \n\n CRadiosDefaultSensor::CRadiosDefaultSensor() :\n m_pcRadioEquippedEntity(nullptr),\n m_pcControllableEntity(nullptr),\n m_bShowRays(false) {}\n\n \n \n\n void CRadiosDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n try {\n \n m_pcRadioEquippedEntity = &(c_entity.GetComponent<CRadioEquippedEntity>(\"radios\"));\n \n m_vecInterfaces.reserve(m_pcRadioEquippedEntity->GetInstances().size());\n \n for(CRadioEquippedEntity::SInstance& s_instance :\n m_pcRadioEquippedEntity->GetInstances()) {\n \n m_vecInterfaces.emplace_back(s_instance.Radio.GetId());\n }\n \n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\"controller\"));\n }\n catch(CARGoSException& ex) {\n THROW_ARGOSEXCEPTION_NESTED(\"Can't set robot for the radios default sensor\", ex);\n }\n\n \n Enable();\n }\n\n \n \n\n void CRadiosDefaultSensor::Init(TConfigurationNode& t_tree) {\n try {\n \n CCI_RadiosSensor::Init(t_tree);\n \n GetNodeAttributeOrDefault(t_tree, \"show_rays\", m_bShowRays, m_bShowRays);\n }\n catch(CARGoSException& ex) {\n THROW_ARGOSEXCEPTION_NESTED(\"Error initializing the radios default sensor\", ex);\n }\n }\n\n \n \n\n void CRadiosDefaultSensor::Update() {\n \n if (IsDisabled()) {\n return;\n }\n for(size_t i = 0; i < m_pcRadioEquippedEntity->GetInstances().size(); ++i) {\n CRadioEntity& cRadio = m_pcRadioEquippedEntity->GetRadio(i);\n \n m_vecInterfaces[i].Data.clear();\n \n for(const std::pair<CVector3, CByteArray>& c_data : cRadio.GetData()) {\n m_vecInterfaces[i].Data.emplace_back(c_data.second);\n if(m_bShowRays) {\n CRay3 cRay(c_data.first, cRadio.GetPosition());\n m_pcControllableEntity->GetCheckedRays().emplace_back(!c_data.second.Empty(), cRay);\n }\n }\n \n cRadio.GetData().clear();\n }\n }\n\n \n \n\n void "},"suffix":{"kind":"string","value":"\n\n \n \n\n REGISTER_SENSOR(CRadiosDefaultSensor,\n \"radios\", \"default\",\n \"Michael Allwright [allsey87@gmail.com]\",\n \"1.0\",\n\n \"A generic radio sensor to receive messages from nearby radios.\",\n \"This radio sensor implementation allows an arbitary number of messages\\n\"\n \"containing an arbitary number of bytes to be received from nearby robots. The\\n\"\n \"implementation is very basic and any concepts such as throughput, addressing,\\n\"\n \"or formatting of a message's contents is beyond the scope of this sensor's\\n\"\n \"implementation\\n\\n\"\n\n \"This sensor is enabled by default.\\n\\n\"\n\n \"REQUIRED XML CONFIGURATION\\n\\n\"\n\n \" <controllers>\\n\"\n \" ...\\n\"\n \" <my_controller ...>\\n\"\n \" ...\\n\"\n \" <sensors>\\n\"\n \" ...\\n\"\n \" <radios implementation=\\\"default\\\" medium=\\\"radios\\\" />\\n\"\n \" ...\\n\"\n \" </sensors>\\n\"\n \" ...\\n\"\n \" </my_controller>\\n\"\n \" ...\\n\"\n \" </controllers>\\n\\n\"\n\n \"The 'medium' attribute sets the id of the radio medium declared in the <media>\\n\"\n \"XML section.\\n\\n\"\n\n \"OPTIONAL XML CONFIGURATION\\n\\n\"\n\n \"None.\\n\",\n\n \"Usable\"\n );\n\n}\n"},"middle":{"kind":"string","value":"CRadiosDefaultSensor::Reset() {\n for(SInterface& s_interface : m_vecInterfaces) {\n \n s_interface.Data.clear();\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":" class CRadiosDefaultSensor;\n\n}\n\n\n\n#include <argos3/core/simulator/sensor.h>\n\n#include <argos3/plugins/robots/generic/control_interface/ci_radios_sensor.h>\n\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h","rank":0,"score":278446.62080654135},{"content":" class CRadiosDefaultSensor : public CSimulatedSensor,\n\n public CCI_RadiosSensor {\n\n\n\n public:\n\n\n\n CRadiosDefaultSensor();\n\n\n\n virtual ~CRadiosDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n /**\n\n * Returns true if the rays must be shown in the GUI.\n\n * @return true if the rays must be shown in the GUI.\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h","rank":1,"score":274672.9850432067},{"content":"/**\n\n * @file <argos3/plugins/robots/generic/simulator/radios_default_sensor.h>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#ifndef RADIOS_DEFAULT_SENSOR_H\n\n#define RADIOS_DEFAULT_SENSOR_H\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h","rank":2,"score":250582.74120216788},{"content":" */\n\n inline bool IsShowRays() {\n\n return m_bShowRays;\n\n }\n\n\n\n /**\n\n * Sets whether or not the rays must be shown in the GUI.\n\n * @param b_show_rays true if the rays must be shown, false otherwise\n\n */\n\n inline void SetShowRays(bool b_show_rays) {\n\n m_bShowRays = b_show_rays;\n\n }\n\n\n\n protected:\n\n\n\n CRadioEquippedEntity* m_pcRadioEquippedEntity;\n\n CControllableEntity* m_pcControllableEntity;\n\n bool m_bShowRays;\n\n\n\n };\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h","rank":3,"score":250560.25614876655},{"content":" class CRadiosDefaultActuator;\n\n}\n\n\n\n#include <argos3/core/simulator/actuator.h>\n\n#include <argos3/plugins/robots/generic/control_interface/ci_radios_actuator.h>\n\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\n\n#include <argos3/plugins/simulator/media/radio_medium.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.h","rank":11,"score":205377.70858307905},{"content":"\tclass CCI_RadiosSensor;\n\n}\n\n\n\n#include <argos3/core/control_interface/ci_sensor.h>\n\n#include <argos3/core/utility/datatypes/byte_array.h>\n\n\n\nnamespace argos {\n\n \n","file_path":"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h","rank":12,"score":205207.6654434374},{"content":" class CPositioningDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h","rank":13,"score":205036.23309779592},{"content":" class CLightDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":14,"score":205036.23309779592},{"content":" class CCameraDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h","rank":15,"score":205036.23309779592},{"content":" class CProximityDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":16,"score":205036.23309779592},{"content":" class CBatteryDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h","rank":17,"score":205036.23309779592},{"content":" class CCI_RadiosSensor: virtual public CCI_Sensor {\n\n \n\n public:\n\n \n\n struct SInterface {\n\n SInterface(const std::string& str_id,\n\n const std::vector<CByteArray>& vec_data = {}) :\n\n Id(str_id),\n\n Data(vec_data) {}\n\n std::string Id;\n\n std::vector<CByteArray> Data;\n\n using TVector = std::vector<SInterface>;\n\n };\n\n\n\n public:\n\n \n\n /**\n\n * Constructor\n\n */\n\n CCI_RadiosSensor() {}\n","file_path":"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h","rank":18,"score":203901.56540705002},{"content":" class CBatteryDefaultSensor : public CSimulatedSensor,\n\n public CCI_BatterySensor {\n\n\n\n public:\n\n\n\n CBatteryDefaultSensor();\n\n\n\n virtual ~CBatteryDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n protected:\n\n\n\n /** Reference to embodied entity associated to this sensor */\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h","rank":19,"score":203735.9088870675},{"content":" class CPositioningDefaultSensor : public CSimulatedSensor,\n\n public CCI_PositioningSensor {\n\n\n\n public:\n\n\n\n CPositioningDefaultSensor();\n\n\n\n virtual ~CPositioningDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n protected:\n\n\n\n /** Reference to embodied entity associated to this sensor */\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h","rank":20,"score":203735.9088870675},{"content":" class CProximityDefaultSensor : public CSimulatedSensor,\n\n public CCI_ProximitySensor {\n\n\n\n public:\n\n\n\n CProximityDefaultSensor();\n\n\n\n virtual ~CProximityDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n /**\n\n * Calculates the proximity reading when the closest occluding object is located as the given distance.\n\n * @param f_distance The distance of the closest occluding object in meters\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":21,"score":203735.9088870675},{"content":" class CCameraDefaultSensor : public CSimulatedSensor,\n\n public CCI_CameraSensor {\n\n\n\n public:\n\n struct SSensor {\n\n SAnchor& Anchor;\n\n CTransformationMatrix3 Offset;\n\n CRange<Real> Range;\n\n CSquareMatrix<3> ProjectionMatrix;\n\n std::vector<CCameraSensorSimulatedAlgorithm*> Algorithms;\n\n Real NearPlaneWidth, NearPlaneHeight;\n\n Real FarPlaneWidth, FarPlaneHeight;\n\n /* constructor */\n\n SSensor(SAnchor& s_anchor,\n\n const CTransformationMatrix3& c_offset,\n\n const CRange<Real>& c_range,\n\n const CSquareMatrix<3>& c_projection_matrix,\n\n const CVector2& c_resolution,\n\n const std::vector<CCameraSensorSimulatedAlgorithm*>& vec_algorithms) :\n\n Anchor(s_anchor),\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h","rank":22,"score":203735.9088870675},{"content":" class CLightDefaultSensor : public CSimulatedSensor,\n\n public CCI_LightSensor {\n\n\n\n public:\n\n\n\n CLightDefaultSensor();\n\n\n\n virtual ~CLightDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n /**\n\n * Calculates the light reading resulting from a light source at the given distance.\n\n * Denoting the intensity with <em>i</em> and the distance <em>x</em>, this function calculates <em>i</em> = (<em>I</em> / <em>x<em>)^2.\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":23,"score":203735.9088870675},{"content":" class CPrototypeJointsDefaultSensor;\n\n}\n\n\n\n#include <argos3/core/simulator/sensor.h>\n\n#include <argos3/plugins/robots/prototype/control_interface/ci_prototype_joints_sensor.h>\n\n#include <argos3/plugins/robots/prototype/simulator/prototype_entity.h>\n\n#include <argos3/plugins/robots/prototype/simulator/prototype_joint_equipped_entity.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/prototype/simulator/prototype_joints_default_sensor.h","rank":24,"score":200918.8121532871},{"content":" class CDifferentialSteeringDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/differential_steering_default_sensor.h","rank":25,"score":200918.8121532871},{"content":" class CEPuckProximityDefaultSensor;\n","file_path":"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h","rank":26,"score":200918.8121532871},{"content":" class CPrototypeJointsDefaultSensor : public CSimulatedSensor,\n\n public CCI_PrototypeJointsSensor {\n\n\n\n public:\n\n struct SSimulatedSensor : public SSensor {\n\n SSimulatedSensor(const std::string& str_id,\n\n CPrototypeJointEntity::SSensor& s_sensor) :\n\n SSensor(str_id),\n\n Instance(s_sensor) {}\n\n CPrototypeJointEntity::SSensor& Instance;\n\n };\n\n \n\n public:\n\n CPrototypeJointsDefaultSensor();\n\n\n\n virtual ~CPrototypeJointsDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n","file_path":"argos3/src/plugins/robots/prototype/simulator/prototype_joints_default_sensor.h","rank":27,"score":200177.59681013745},{"content":" class CEPuckProximityDefaultSensor : public CSimulatedSensor,\n\n public CCI_EPuckProximitySensor {\n\n\n\n public:\n\n\n\n CEPuckProximityDefaultSensor();\n\n\n\n virtual ~CEPuckProximityDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n /**\n\n * Calculates the proximity reading when the closest occluding object is located as the given distance.\n\n * @param f_distance The distance of the closest occluding object in meters\n","file_path":"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h","rank":28,"score":200177.59681013745},{"content":" class CDifferentialSteeringDefaultSensor : public CSimulatedSensor,\n\n public CCI_DifferentialSteeringSensor {\n\n\n\n public:\n\n\n\n CDifferentialSteeringDefaultSensor();\n\n\n\n virtual ~CDifferentialSteeringDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n protected:\n\n\n\n /** Reference to wheeled entity associated to this sensor */\n","file_path":"argos3/src/plugins/robots/generic/simulator/differential_steering_default_sensor.h","rank":29,"score":200177.59681013745},{"content":" class CRadiosDefaultActuator : public CSimulatedActuator,\n\n public CCI_RadiosActuator {\n\n\n\n public:\n\n\n\n CRadiosDefaultActuator();\n\n\n\n virtual ~CRadiosDefaultActuator() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n private:\n\n\n\n CRadioEquippedEntity* m_pcRadioEquippedEntity;\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.h","rank":30,"score":197301.7967841988},{"content":" class CFootBotProximityDefaultSensor;\n\n}\n\n\n\n#include <argos3/plugins/robots/foot-bot/control_interface/ci_footbot_proximity_sensor.h>\n\n#include <argos3/plugins/robots/generic/simulator/proximity_default_sensor.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/foot-bot/simulator/footbot_proximity_default_sensor.h","rank":31,"score":196971.82614569613},{"content":" class CEyeBotProximityDefaultSensor;\n\n}\n\n\n\n#include <argos3/plugins/robots/eye-bot/control_interface/ci_eyebot_proximity_sensor.h>\n\n#include <argos3/plugins/robots/generic/simulator/proximity_default_sensor.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/eye-bot/simulator/eyebot_proximity_default_sensor.h","rank":32,"score":196971.82614569613},{"content":" class CProximitySensorImpl : public CProximityDefaultSensor {\n\n\n\n public:\n\n\n\n virtual Real CalculateReading(Real f_distance) {\n\n if(f_distance < 0.009889556) {\n\n return 1.0;\n\n }\n\n else {\n\n return 0.0100527 / (f_distance + 0.000163144);\n\n }\n\n }\n\n\n\n };\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CEyeBotProximityDefaultSensor::CEyeBotProximityDefaultSensor() :\n\n m_pcProximityImpl(new CProximitySensorImpl()) {}\n","file_path":"argos3/src/plugins/robots/eye-bot/simulator/eyebot_proximity_default_sensor.cpp","rank":33,"score":196753.33581463736},{"content":" class CProximitySensorImpl : public CProximityDefaultSensor {\n\n\n\n public:\n\n\n\n virtual Real CalculateReading(Real f_distance) {\n\n return f_distance;\n\n }\n\n\n\n };\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CFootBotProximityDefaultSensor::CFootBotProximityDefaultSensor() :\n\n m_pcProximityImpl(new CProximitySensorImpl()) {}\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CFootBotProximityDefaultSensor::~CFootBotProximityDefaultSensor() {\n","file_path":"argos3/src/plugins/robots/foot-bot/simulator/footbot_proximity_default_sensor.cpp","rank":34,"score":196753.33581463736},{"content":" class CFootBotProximityDefaultSensor : public CCI_FootBotProximitySensor,\n\n public CSimulatedSensor {\n\n\n\n public:\n\n\n\n CFootBotProximityDefaultSensor();\n\n\n\n virtual ~CFootBotProximityDefaultSensor();\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n private:\n\n\n\n CProximityDefaultSensor* m_pcProximityImpl;\n\n\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/foot-bot/simulator/footbot_proximity_default_sensor.h","rank":35,"score":193455.053094409},{"content":" class CEyeBotProximityDefaultSensor : public CCI_EyeBotProximitySensor,\n\n public CSimulatedSensor {\n\n\n\n public:\n\n\n\n CEyeBotProximityDefaultSensor();\n\n\n\n virtual ~CEyeBotProximityDefaultSensor();\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n private:\n\n\n\n CProximityDefaultSensor* m_pcProximityImpl;\n\n\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/eye-bot/simulator/eyebot_proximity_default_sensor.h","rank":36,"score":193455.053094409},{"content":" class CFootBotTurretEncoderDefaultSensor;\n\n}\n\n\n\n#include <argos3/plugins/robots/foot-bot/control_interface/ci_footbot_turret_encoder_sensor.h>\n\n#include <argos3/plugins/robots/foot-bot/simulator/footbot_turret_encoder_default_sensor.h>\n\n#include <argos3/plugins/robots/foot-bot/simulator/footbot_turret_entity.h>\n\n#include <argos3/core/simulator/sensor.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/foot-bot/simulator/footbot_turret_encoder_default_sensor.h","rank":37,"score":193184.37208821767},{"content":" class CColoredBlobPerspectiveCameraDefaultSensor;\n","file_path":"argos3/src/plugins/robots/generic/simulator/colored_blob_perspective_camera_default_sensor.h","rank":38,"score":193184.37208821767},{"content":" class CLightSensorEquippedEntity;\n\n}\n\n\n\n#include <argos3/plugins/robots/generic/control_interface/ci_light_sensor.h>\n\n#include <argos3/core/utility/math/range.h>\n\n#include <argos3/core/utility/math/rng.h>\n\n#include <argos3/core/simulator/space/space.h>\n\n#include <argos3/core/simulator/sensor.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":39,"score":188754.4947490895},{"content":" class CProximitySensorEquippedEntity;\n\n}\n\n\n\n#include <argos3/plugins/robots/generic/control_interface/ci_proximity_sensor.h>\n\n#include <argos3/core/utility/math/range.h>\n\n#include <argos3/core/utility/math/rng.h>\n\n#include <argos3/core/simulator/space/space.h>\n\n#include <argos3/core/simulator/sensor.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":40,"score":188754.4947490895},{"content":" class CFootBotTurretEncoderDefaultSensor : public CCI_FootBotTurretEncoderSensor,\n\n public CSimulatedSensor {\n\n\n\n public:\n\n\n\n CFootBotTurretEncoderDefaultSensor();\n\n\n\n virtual ~CFootBotTurretEncoderDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n virtual void Enable();\n\n\n\n virtual void Disable();\n\n\n\n private:\n\n\n\n CFootBotTurretEntity* m_pcTurretEntity;\n\n\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/foot-bot/simulator/footbot_turret_encoder_default_sensor.h","rank":41,"score":188727.82842349893},{"content":" class CColoredBlobPerspectiveCameraDefaultSensor : public CCI_ColoredBlobPerspectiveCameraSensor,\n\n public CSimulatedSensor {\n\n\n\n public:\n\n\n\n CColoredBlobPerspectiveCameraDefaultSensor();\n\n\n\n virtual ~CColoredBlobPerspectiveCameraDefaultSensor();\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n\n\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n virtual void Reset();\n\n\n\n virtual void Destroy();\n\n\n\n virtual void Enable();\n","file_path":"argos3/src/plugins/robots/generic/simulator/colored_blob_perspective_camera_default_sensor.h","rank":42,"score":188727.82842349893},{"content":"/*\n\n * @file <argos3/plugins/robots/generic/simulator/radios_default_actuator.h>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#ifndef RADIOS_DEFAULT_ACTUATOR_H\n\n#define RADIOS_DEFAULT_ACTUATOR_H\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.h","rank":43,"score":187952.79684239408},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/positioning_default_sensor.h>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#ifndef POSITIONING_DEFAULT_SENSOR_H\n\n#define POSITIONING_DEFAULT_SENSOR_H\n\n\n\n#include <string>\n\n#include <map>\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h","rank":44,"score":187661.29029730335},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/light_default_sensor.h>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#ifndef LIGHT_DEFAULT_SENSOR_H\n\n#define LIGHT_DEFAULT_SENSOR_H\n\n\n\n#include <string>\n\n#include <map>\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":45,"score":187661.29029730335},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/battery_default_sensor.h>\n\n *\n\n * @author Adhavan Jayabalan <jadhu94@gmail.com>\n\n */\n\n\n\n#ifndef BATTERY_DEFAULT_SENSOR_H\n\n#define BATTERY_DEFAULT_SENSOR_H\n\n\n\n#include <string>\n\n#include <map>\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h","rank":46,"score":187661.29029730335},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/proximity_default_sensor.h>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#ifndef PROXIMITY_DEFAULT_SENSOR_H\n\n#define PROXIMITY_DEFAULT_SENSOR_H\n\n\n\n#include <string>\n\n#include <map>\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":47,"score":187661.29029730335},{"content":"/**\n\n * @file <argos3/plugins/robots/generic/simulator/camera_default_sensor.h>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#ifndef CAMERAS_DEFAULT_SENSOR_H\n\n#define CAMERAS_DEFAULT_SENSOR_H\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h","rank":48,"score":187660.09753407145},{"content":" Offset(c_offset),\n\n Range(c_range),\n\n ProjectionMatrix(c_projection_matrix),\n\n Algorithms(vec_algorithms) {\n\n Real fWidthToDepthRatio = (0.5 * c_resolution.GetX()) / c_projection_matrix(0,0);\n\n Real fHeightToDepthRatio = (0.5 * c_resolution.GetY()) / c_projection_matrix(1,1);\n\n NearPlaneHeight = fHeightToDepthRatio * c_range.GetMin();\n\n NearPlaneWidth = fWidthToDepthRatio * c_range.GetMin();\n\n FarPlaneHeight = fHeightToDepthRatio * c_range.GetMax();\n\n FarPlaneWidth = fWidthToDepthRatio * c_range.GetMax();\n\n }\n\n };\n\n\n\n public:\n\n\n\n CCameraDefaultSensor();\n\n\n\n virtual ~CCameraDefaultSensor() {}\n\n\n\n virtual void SetRobot(CComposableEntity& c_entity);\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h","rank":49,"score":187650.03955336683},{"content":" * @returns A value in the range [0:1], where 0 means that the object is too far to be sensed, and 1 means the object is so close that it saturates the sensor.\n\n */\n\n virtual Real CalculateReading(Real f_distance);\n\n\n\n /**\n\n * Returns true if the rays must be shown in the GUI.\n\n * @return true if the rays must be shown in the GUI.\n\n */\n\n inline bool IsShowRays() {\n\n return m_bShowRays;\n\n }\n\n\n\n /**\n\n * Sets whether or not the rays must be shown in the GUI.\n\n * @param b_show_rays true if the rays must be shown, false otherwise\n\n */\n\n inline void SetShowRays(bool b_show_rays) {\n\n m_bShowRays = b_show_rays;\n\n }\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":50,"score":187647.01803251563},{"content":" inline void SetShowRays(bool b_show_rays) {\n\n m_bShowRays = b_show_rays;\n\n }\n\n\n\n protected:\n\n\n\n /** Reference to light sensor equipped entity associated to this sensor */\n\n CLightSensorEquippedEntity* m_pcLightEntity;\n\n\n\n /** Reference to controllable entity associated to this sensor */\n\n CControllableEntity* m_pcControllableEntity;\n\n\n\n /** Flag to show rays in the simulator */\n\n bool m_bShowRays;\n\n\n\n /** Random number generator */\n\n CRandom::CRNG* m_pcRNG;\n\n\n\n /** Whether to add noise or not */\n\n bool m_bAddNoise;\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":51,"score":187644.1439066438},{"content":"\n\n virtual void Init(TConfigurationNode& t_tree);\n\n\n\n virtual void Update();\n\n\n\n protected:\n\n bool m_bShowFrustum;\n\n CEmbodiedEntity* m_pcEmbodiedEntity;\n\n CControllableEntity* m_pcControllableEntity;\n\n std::vector<SSensor> m_vecSensors;\n\n };\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h","rank":52,"score":187641.93726317337},{"content":" * <em>I</em> is the reference intensity of the light, that is, the distance at which the light reading saturates.\n\n * It is dependent on the light entity being considered.\n\n * @param f_distance The distance of the considered light source.\n\n * @param f_intensity The reference intensity of the considered light source.\n\n * @returns A value in the range [0:1], where 0 means that the light is too far to be sensed, and 1 means the light is so close that it saturates the sensor.\n\n */\n\n virtual Real CalculateReading(Real f_distance, Real f_intensity);\n\n\n\n /**\n\n * Returns true if the rays must be shown in the GUI.\n\n * @return true if the rays must be shown in the GUI.\n\n */\n\n inline bool IsShowRays() {\n\n return m_bShowRays;\n\n }\n\n\n\n /**\n\n * Sets whether or not the rays must be shown in the GUI.\n\n * @param b_show_rays true if the rays must be shown, false otherwise\n\n */\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":53,"score":187639.9809619003},{"content":" protected:\n\n\n\n /** Reference to embodied entity associated to this sensor */\n\n CEmbodiedEntity* m_pcEmbodiedEntity;\n\n\n\n /** Reference to proximity sensor equipped entity associated to this sensor */\n\n CProximitySensorEquippedEntity* m_pcProximityEntity;\n\n\n\n /** Reference to controllable entity associated to this sensor */\n\n CControllableEntity* m_pcControllableEntity;\n\n\n\n /** Flag to show rays in the simulator */\n\n bool m_bShowRays;\n\n\n\n /** Random number generator */\n\n CRandom::CRNG* m_pcRNG;\n\n\n\n /** Whether to add noise or not */\n\n bool m_bAddNoise;\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":54,"score":187636.26174529057},{"content":" CEmbodiedEntity* m_pcEmbodiedEntity;\n\n\n\n /** Reference to battery sensor equipped entity associated to this sensor */\n\n CBatteryEquippedEntity* m_pcBatteryEntity;\n\n\n\n /** Random number generator */\n\n CRandom::CRNG* m_pcRNG;\n\n\n\n /** Whether to add noise or not */\n\n bool m_bAddNoise;\n\n\n\n /** Noise range on battery level */\n\n CRange<Real> m_cNoiseRange;\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h","rank":55,"score":187635.04119265653},{"content":" /** Noise range */\n\n CRange<Real> m_cNoiseRange;\n\n\n\n /** Reference to the space */\n\n CSpace& m_cSpace;\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h","rank":56,"score":187628.74022750737},{"content":"\n\n /** Noise range */\n\n CRange<Real> m_cNoiseRange;\n\n\n\n /** Reference to the space */\n\n CSpace& m_cSpace;\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h","rank":57,"score":187628.74022750737},{"content":" CEmbodiedEntity* m_pcEmbodiedEntity;\n\n\n\n /** Random number generator */\n\n CRandom::CRNG* m_pcRNG;\n\n\n\n /** Whether to add noise or not */\n\n bool m_bAddNoise;\n\n\n\n /** Noise range on position */\n\n CRange<Real> m_cPosNoiseRange;\n\n\n\n /** Noise range on angle */\n\n CRange<CRadians> m_cAngleNoiseRange;\n\n\n\n /** Noise range on axis */\n\n CRange<Real> m_cAxisNoiseRange;\n\n };\n\n\n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h","rank":58,"score":187628.74022750737},{"content":" class CProximitySensorEquippedEntity;\n\n}\n\n\n\n#include <argos3/plugins/robots/e-puck/control_interface/ci_epuck_proximity_sensor.h>\n\n#include <argos3/core/utility/math/range.h>\n\n#include <argos3/core/utility/math/rng.h>\n\n#include <argos3/core/simulator/space/space.h>\n\n#include <argos3/core/simulator/sensor.h>\n\n\n\nnamespace argos {\n\n\n","file_path":"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h","rank":59,"score":186539.0157425024},{"content":"/**\n\n * @file <argos3/plugins/robots/generic/simulator/radios_default_actuator.cpp>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#include \"radios_default_actuator.h\"\n\n#include <argos3/plugins/simulator/media/radio_medium.h>\n\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\n\n\n\nnamespace argos {\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CRadiosDefaultActuator::CRadiosDefaultActuator() :\n\n m_pcRadioEquippedEntity(nullptr) {\n\n }\n\n\n\n /****************************************/\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":60,"score":185190.91596976135},{"content":" /****************************************/\n\n\n\n void CRadiosDefaultActuator::SetRobot(CComposableEntity& c_entity) {\n\n try {\n\n /* Get and enable omndirectional radio equipped entity */\n\n m_pcRadioEquippedEntity = &(c_entity.GetComponent<CRadioEquippedEntity>(\"radios\"));\n\n /* Create a configuration settings for each radio in the container */\n\n m_vecInterfaces.reserve(m_pcRadioEquippedEntity->GetInstances().size());\n\n /* Populate the descriptors */\n\n for(CRadioEquippedEntity::SInstance& s_instance : m_pcRadioEquippedEntity->GetInstances()) {\n\n m_vecInterfaces.emplace_back(s_instance.Radio.GetId());\n\n }\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Can't set robot for the radios default actuator\", ex);\n\n }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":61,"score":185190.6546351586},{"content":"\n\n void CRadiosDefaultActuator::Init(TConfigurationNode& t_tree) {\n\n try {\n\n /* Parent class init */\n\n CCI_RadiosActuator::Init(t_tree);\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Error initializing the radios default actuator\", ex);\n\n }\n\n }\n\n \n\n /****************************************/\n\n /****************************************/\n\n\n\n void CRadiosDefaultActuator::Update() {\n\n for(size_t i = 0; i < m_vecInterfaces.size(); ++i) {\n\n CRadioEntity& cRadio = m_pcRadioEquippedEntity->GetRadio(i);\n\n /* Create operation instance */\n\n CTxOperation cTxOperation(cRadio, m_vecInterfaces[i].Data);\n\n /* Calculate the range of the transmitting radio */\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":62,"score":185184.00587519378},{"content":" CVector3 cTxRange(1.0f,1.0f,1.0f);\n\n cTxRange *= (cRadio.GetRange() * 0.5f);\n\n /* Get positional index */\n\n CPositionalIndex<CRadioEntity>* pcRadioIndex =\n\n &(cRadio.GetMedium().GetIndex());\n\n /* Transmit the data to receiving radios in the space */\n\n pcRadioIndex->ForEntitiesInBoxRange(cRadio.GetPosition(), cTxRange, cTxOperation);\n\n /* Flush data from the control interface */\n\n m_vecInterfaces[i].Data.clear();\n\n }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CRadiosDefaultActuator::Reset() {\n\n for(SInterface& s_interface : m_vecInterfaces) {\n\n /* Clear any data in the interface */\n\n s_interface.Data.clear();\n\n }\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":63,"score":185170.97555969114},{"content":" }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CRadiosDefaultActuator::CTxOperation::CTxOperation(const CRadioEntity& c_tx_radio,\n\n const std::vector<CByteArray>& c_tx_data) :\n\n m_cTxRadio(c_tx_radio),\n\n m_cTxData(c_tx_data) {}\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n bool CRadiosDefaultActuator::CTxOperation::operator()(CRadioEntity& c_rx_radio) {\n\n if(&c_rx_radio != &m_cTxRadio) {\n\n const CVector3& cRxRadioPosition = c_rx_radio.GetPosition();\n\n const CVector3& cTxRadioPosition = m_cTxRadio.GetPosition();\n\n Real fDistance = (cRxRadioPosition - cTxRadioPosition).Length();\n\n if(fDistance < m_cTxRadio.GetRange()) {\n\n for(const CByteArray& c_data : m_cTxData) {\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":64,"score":185168.7493238804},{"content":" \"scope of this actuator's implementation.\\n\\n\"\n\n\n\n \"REQUIRED XML CONFIGURATION\\n\\n\"\n\n \" <controllers>\\n\"\n\n \" ...\\n\"\n\n \" <my_controller ...>\\n\"\n\n \" ...\\n\"\n\n \" <actuators>\\n\"\n\n \" ...\\n\"\n\n \" <radios implementation=\\\"default\\\" medium=\\\"radios\\\" />\\n\"\n\n \" ...\\n\"\n\n \" </actuators>\\n\"\n\n \" ...\\n\"\n\n \" </my_controller>\\n\"\n\n \" ...\\n\"\n\n \" </controllers>\\n\\n\"\n\n\n\n \"The 'medium' attribute sets the id of the radio medium declared in the <media>\\n\"\n\n \"XML section.\\n\\n\"\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":65,"score":185167.91588825843},{"content":" c_rx_radio.ReceiveData(cTxRadioPosition, c_data);\n\n }\n\n }\n\n }\n\n return true;\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n REGISTER_ACTUATOR(CRadiosDefaultActuator,\n\n \"radios\", \"default\",\n\n \"Michael Allwright [allsey87@gmail.com]\",\n\n \"1.0\",\n\n\n\n \"A generic radio actuator to send messages to nearby radios.\",\n\n \"This radio actuator implementation allows an arbitary number of messages\\n\"\n\n \"containing an arbitary number of bytes to be sent to nearby radios. The\\n\" \n\n \"implementation of this actuator is very basic and any concepts such as\\n\"\n\n \"throughput, addressing, or formatting of a message's contents is beyond the\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":66,"score":185167.6820929863},{"content":" \"OPTIONAL XML CONFIGURATION\\n\\n\"\n\n\n\n \"None.\\n\",\n\n\n\n \"Usable\"\n\n );\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n}\n","file_path":"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp","rank":67,"score":185155.03807126769},{"content":"/**\n\n * @file <argos3/plugins/robots/generic/control_interface/ci_radios_sensor.cpp>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#ifndef CI_RADIOS_SENSOR_H\n\n#define CI_RADIOS_SENSOR_H\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h","rank":68,"score":185042.4388109653},{"content":" \n\n /**\n\n * Destructor\n\n */\n\n virtual ~CCI_RadiosSensor() {}\n\n \n\n public:\n\n\n\n /**\n\n * Returns a const reference to the radio interfaces.\n\n * @return A const reference to the radio interfaces.\n\n */\n\n const SInterface::TVector& GetInterfaces() const;\n\n \n\n#ifdef ARGOS_WITH_LUA\n\n virtual void CreateLuaState(lua_State* pt_lua_state);\n\n \n\n virtual void ReadingsToLuaState(lua_State* pt_lua_state);\n\n#endif\n\n\n","file_path":"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h","rank":69,"score":185039.6295696094},{"content":" protected:\n\n \n\n SInterface::TVector m_vecInterfaces;\n\n \n\n };\n\n \n\n}\n\n\n\n#endif\n","file_path":"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h","rank":70,"score":185011.45088734615},{"content":" m_cNoiseRange.Set(-fNoiseLevel, fNoiseLevel);\n\n m_pcRNG = CRandom::CreateRNG(\"argos\");\n\n }\n\n m_tReadings.resize(m_pcLightEntity->GetNumSensors());\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Initialization error in default light sensor\", ex);\n\n }\n\n /* sensor is enabled by default */\n\n Enable();\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n \n\n void CLightDefaultSensor::Update() {\n\n /* sensor is disabled--nothing to do */\n\n if (IsDisabled()) {\n\n return;\n\n }\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":71,"score":184908.9363847223},{"content":" m_bAddNoise = true;\n\n m_cNoiseRange.Set(-fNoiseLevel, fNoiseLevel);\n\n m_pcRNG = CRandom::CreateRNG(\"argos\");\n\n }\n\n m_tReadings.resize(m_pcProximityEntity->GetNumSensors());\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Initialization error in default proximity sensor\", ex);\n\n }\n\n /* This sensor is enabled by default */\n\n Enable();\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CProximityDefaultSensor::Update() {\n\n /* sensor is disabled--nothing to do */\n\n if (IsDisabled()) {\n\n return;\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp","rank":72,"score":184908.21958755923},{"content":" /****************************************/\n\n /****************************************/\n\n\n\n CBatteryDefaultSensor::CBatteryDefaultSensor() :\n\n m_pcEmbodiedEntity(nullptr),\n\n m_pcBatteryEntity(nullptr),\n\n m_pcRNG(nullptr),\n\n m_bAddNoise(false) {}\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CBatteryDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n\n try {\n\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\"body\"));\n\n m_pcBatteryEntity = &(c_entity.GetComponent<CBatteryEquippedEntity>(\"battery\"));\n\n m_pcBatteryEntity->Enable();\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Can't set robot for the battery default sensor\", ex);\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp","rank":73,"score":184903.8256227054},{"content":"/**\n\n * @file <argos3/plugins/robots/generic/simulator/camera_default_sensor.cpp>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#include \"camera_default_sensor.h\"\n\n#include <argos3/core/simulator/simulator.h>\n\n#include <argos3/core/simulator/entity/composable_entity.h>\n\n#include <argos3/plugins/robots/generic/simulator/camera_sensor_algorithm.h>\n\n\n\nnamespace argos {\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CCameraDefaultSensor::CCameraDefaultSensor() :\n\n m_bShowFrustum(false),\n\n m_pcEmbodiedEntity(nullptr),\n\n m_pcControllableEntity(nullptr) {}\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.cpp","rank":74,"score":184902.3572131068},{"content":" GetNodeAttributeOrDefault(t_tree, \"axis_noise_range\", m_cAxisNoiseRange, m_cAxisNoiseRange);\n\n if(m_cPosNoiseRange.GetSpan() != 0 ||\n\n m_cAngleNoiseRange.GetSpan() != CRadians::ZERO ||\n\n m_cAxisNoiseRange.GetSpan() != 0) {\n\n m_bAddNoise = true;\n\n m_pcRNG = CRandom::CreateRNG(\"argos\");\n\n }\n\n /* sensor is enabled by default */\n\n Enable();\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Initialization error in default positioning sensor\", ex);\n\n }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n \n\n void CPositioningDefaultSensor::Update() {\n\n /* sensor is disabled--nothing to do */\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp","rank":75,"score":184902.15375475987},{"content":"\n\n /****************************************/\n\n /****************************************/\n\n\n\n CLightDefaultSensor::CLightDefaultSensor() :\n\n m_bShowRays(false),\n\n m_pcRNG(nullptr),\n\n m_bAddNoise(false),\n\n m_cSpace(CSimulator::GetInstance().GetSpace()) {}\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CLightDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n\n try {\n\n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\"controller\"));\n\n m_pcLightEntity = &(c_entity.GetComponent<CLightSensorEquippedEntity>(\"light_sensors\"));\n\n m_pcLightEntity->Enable();\n\n }\n\n catch(CARGoSException& ex) {\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":76,"score":184900.43476472795},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/differential_steering_default_sensor.h>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#ifndef DIFFERENTIAL_STEERING_DEFAULT_SENSOR_H\n\n#define DIFFERENTIAL_STEERING_DEFAULT_SENSOR_H\n\n\n\n#include <string>\n\n#include <map>\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/generic/simulator/differential_steering_default_sensor.h","rank":77,"score":184898.7037618062},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/epuck_proximity_default_sensor.h>\n\n *\n\n * @author Danesh Tarapore - <daneshtarapore@gmail.com>\n\n */\n\n\n\n#ifndef EPUCK_PROXIMITY_DEFAULT_SENSOR_H\n\n#define EPUCK_PROXIMITY_DEFAULT_SENSOR_H\n\n\n\n#include <string>\n\n#include <map>\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h","rank":78,"score":184898.7037618062},{"content":" }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CBatteryDefaultSensor::Init(TConfigurationNode& t_tree) {\n\n try {\n\n /* Execute standard logic */\n\n CCI_BatterySensor::Init(t_tree);\n\n /* Parse noise range */\n\n GetNodeAttributeOrDefault(t_tree, \"noise_range\", m_cNoiseRange, m_cNoiseRange);\n\n if(m_cNoiseRange.GetSpan() != 0) {\n\n m_bAddNoise = true;\n\n m_pcRNG = CRandom::CreateRNG(\"argos\");\n\n }\n\n }\n\n catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Initialization error in default battery sensor\", ex);\n\n }\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp","rank":79,"score":184897.44657918456},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/positioning_default_sensor.cpp>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#include <argos3/core/simulator/simulator.h>\n\n#include <argos3/core/simulator/entity/embodied_entity.h>\n\n#include <argos3/core/simulator/entity/composable_entity.h>\n\n\n\n#include \"positioning_default_sensor.h\"\n\n\n\nnamespace argos {\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n CPositioningDefaultSensor::CPositioningDefaultSensor() :\n\n m_pcEmbodiedEntity(nullptr),\n\n m_pcRNG(nullptr),\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp","rank":80,"score":184897.4352676829},{"content":"/**\n\n * @file <argos3/plugins/robots/prototype/simulator/prototype_joints_default_sensor.cpp>\n\n *\n\n * @author Michael Allwright - <allsey87@gmail.com>\n\n */\n\n\n\n#ifndef PROTOTYPE_JOINTS_DEFAULT_SENSOR_H\n\n#define PROTOTYPE_JOINTS_DEFAULT_SENSOR_H\n\n\n\nnamespace argos {\n","file_path":"argos3/src/plugins/robots/prototype/simulator/prototype_joints_default_sensor.h","rank":81,"score":184897.2507024365},{"content":" catch(CARGoSException& ex) {\n\n THROW_ARGOSEXCEPTION_NESTED(\"Can't set robot for the proximity default sensor\", ex);\n\n }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CProximityDefaultSensor::Init(TConfigurationNode& t_tree) {\n\n try {\n\n CCI_ProximitySensor::Init(t_tree);\n\n /* Show rays? */\n\n GetNodeAttributeOrDefault(t_tree, \"show_rays\", m_bShowRays, m_bShowRays);\n\n /* Parse noise level */\n\n Real fNoiseLevel = 0.0f;\n\n GetNodeAttributeOrDefault(t_tree, \"noise_level\", fNoiseLevel, fNoiseLevel);\n\n if(fNoiseLevel < 0.0f) {\n\n THROW_ARGOSEXCEPTION(\"Can't specify a negative value for the noise level of the proximity sensor\");\n\n }\n\n else if(fNoiseLevel > 0.0f) {\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp","rank":82,"score":184896.65782760558},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/proximity_default_sensor.cpp>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#include <argos3/core/simulator/simulator.h>\n\n#include <argos3/core/simulator/entity/embodied_entity.h>\n\n#include <argos3/core/simulator/entity/composable_entity.h>\n\n#include <argos3/plugins/simulator/entities/proximity_sensor_equipped_entity.h>\n\n\n\n#include \"proximity_default_sensor.h\"\n\n\n\nnamespace argos {\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n static CRange<Real> UNIT(0.0f, 1.0f);\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp","rank":83,"score":184896.25611726003},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/battery_default_sensor.cpp>\n\n *\n\n * @author Adhavan Jayabalan <jadhu94@gmail.com>\n\n */\n\n\n\n#include <argos3/core/simulator/simulator.h>\n\n#include <argos3/core/simulator/entity/embodied_entity.h>\n\n#include <argos3/core/simulator/entity/composable_entity.h>\n\n#include <argos3/plugins/simulator/entities/battery_equipped_entity.h>\n\n\n\n#include \"battery_default_sensor.h\"\n\n\n\nnamespace argos {\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n static CRange<Real> UNIT(0.0f, 1.0f);\n\n\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp","rank":84,"score":184895.90000734595},{"content":"/**\n\n * @file <argos3/plugins/simulator/sensors/light_default_sensor.cpp>\n\n *\n\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\n\n */\n\n\n\n#include <argos3/core/simulator/simulator.h>\n\n#include <argos3/core/simulator/entity/embodied_entity.h>\n\n#include <argos3/core/simulator/entity/composable_entity.h>\n\n#include <argos3/plugins/simulator/entities/light_entity.h>\n\n#include <argos3/plugins/simulator/entities/light_sensor_equipped_entity.h>\n\n\n\n#include \"light_default_sensor.h\"\n\n\n\nnamespace argos {\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n static CRange<Real> UNIT(0.0f, 1.0f);\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":85,"score":184895.61924081508},{"content":" THROW_ARGOSEXCEPTION_NESTED(\"Can't set robot for the light default sensor\", ex);\n\n }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CLightDefaultSensor::Init(TConfigurationNode& t_tree) {\n\n try {\n\n CCI_LightSensor::Init(t_tree);\n\n /* Show rays? */\n\n GetNodeAttributeOrDefault(t_tree, \"show_rays\", m_bShowRays, m_bShowRays);\n\n /* Parse noise level */\n\n Real fNoiseLevel = 0.0f;\n\n GetNodeAttributeOrDefault(t_tree, \"noise_level\", fNoiseLevel, fNoiseLevel);\n\n if(fNoiseLevel < 0.0f) {\n\n THROW_ARGOSEXCEPTION(\"Can't specify a negative value for the noise level of the light sensor\");\n\n }\n\n else if(fNoiseLevel > 0.0f) {\n\n m_bAddNoise = true;\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":86,"score":184895.33068992328},{"content":" /****************************************/\n\n /****************************************/\n\n\n\n CProximityDefaultSensor::CProximityDefaultSensor() :\n\n m_pcEmbodiedEntity(nullptr),\n\n m_bShowRays(false),\n\n m_pcRNG(nullptr),\n\n m_bAddNoise(false),\n\n m_cSpace(CSimulator::GetInstance().GetSpace()) {}\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CProximityDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n\n try {\n\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\"body\"));\n\n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\"controller\"));\n\n m_pcProximityEntity = &(c_entity.GetComponent<CProximitySensorEquippedEntity>(\"proximity_sensors\"));\n\n m_pcProximityEntity->Enable();\n\n }\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp","rank":87,"score":184895.1622686897},{"content":" /****************************************/\n\n /****************************************/\n\n\n\n void CPositioningDefaultSensor::Reset() {\n\n m_sReading.Position = m_pcEmbodiedEntity->GetOriginAnchor().Position;\n\n m_sReading.Orientation = m_pcEmbodiedEntity->GetOriginAnchor().Orientation;\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n REGISTER_SENSOR(CPositioningDefaultSensor,\n\n \"positioning\", \"default\",\n\n \"Carlo Pinciroli [ilpincy@gmail.com]\",\n\n \"1.0\",\n\n \"A generic positioning sensor.\",\n\n\n\n \"This sensor returns the current position and orientation of a robot. This sensor\\n\"\n\n \"can be used with any robot, since it accesses only the body component. In\\n\"\n\n \"controllers, you must include the ci_positioning_sensor.h header.\\n\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp","rank":88,"score":184894.48669048309},{"content":"\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CCameraDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n\n /* Get the embodied and controllable entities */\n\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\"body\"));\n\n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\"controller\"));\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CCameraDefaultSensor::Init(TConfigurationNode& t_tree) {\n\n try {\n\n /* Parent class init */\n\n CCI_CameraSensor::Init(t_tree);\n\n /* Show the frustums */\n\n GetNodeAttributeOrDefault(t_tree, \"show_frustum\", m_bShowFrustum, m_bShowFrustum);\n\n /* For each camera */\n","file_path":"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.cpp","rank":89,"score":184893.12973967852},{"content":" }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CBatteryDefaultSensor::Reset() {\n\n /* TODO */\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n REGISTER_SENSOR(CBatteryDefaultSensor,\n\n \"battery\", \"default\",\n\n \"Adhavan Jayabalan [jadhu94@gmail.com]\",\n\n \"1.0\",\n\n \"A generic battery level sensor.\",\n\n\n\n \"This sensor returns the current battery level of a robot. This sensor\\n\"\n\n \"can be used with any robot, since it accesses only the body component. In\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp","rank":90,"score":184892.66537863284},{"content":" /* sensor is enabled by default */\n\n Enable();\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CBatteryDefaultSensor::Update() {\n\n /* sensor is disabled--nothing to do */\n\n if (IsDisabled()) {\n\n return;\n\n }\n\n /* Save old charge value (used later for time left estimation) */\n\n Real fOldCharge = m_sReading.AvailableCharge;\n\n /* Update available charge as seen by the robot */\n\n m_sReading.AvailableCharge =\n\n m_pcBatteryEntity->GetAvailableCharge() /\n\n m_pcBatteryEntity->GetFullCharge();\n\n /* Add noise */\n\n if(m_bAddNoise) {\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp","rank":91,"score":184892.63450650347},{"content":"\n\n void CProximityDefaultSensor::Reset() {\n\n for(UInt32 i = 0; i < GetReadings().size(); ++i) {\n\n m_tReadings[i].val = 0.0f;\n\n m_tReadings[i].isRobot = false;\n\n }\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n Real CProximityDefaultSensor::CalculateReading(Real f_distance) {\n\n // CHANGED FROM ORIGINAL FOOTBOT CODE\n\n return f_distance;\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n REGISTER_SENSOR(CProximityDefaultSensor,\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp","rank":92,"score":184891.5401246428},{"content":" m_bAddNoise(false) {}\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CPositioningDefaultSensor::SetRobot(CComposableEntity& c_entity) {\n\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\"body\"));\n\n m_sReading.Position = m_pcEmbodiedEntity->GetOriginAnchor().Position;\n\n m_sReading.Orientation = m_pcEmbodiedEntity->GetOriginAnchor().Orientation;\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n void CPositioningDefaultSensor::Init(TConfigurationNode& t_tree) {\n\n try {\n\n CCI_PositioningSensor::Init(t_tree);\n\n /* Parse noise range */\n\n GetNodeAttributeOrDefault(t_tree, \"pos_noise_range\", m_cPosNoiseRange, m_cPosNoiseRange);\n\n GetNodeAttributeOrDefault(t_tree, \"angle_noise_range\", m_cAngleNoiseRange, m_cAngleNoiseRange);\n","file_path":"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp","rank":93,"score":184891.27105636874},{"content":" \"proximity\", \"default\",\n\n \"Carlo Pinciroli [ilpincy@gmail.com]\",\n\n \"1.0\",\n\n \"A generic proximity sensor.\",\n\n\n\n \"This sensor accesses a set of proximity sensors. The sensors all return a value\\n\"\n\n \"between 0 and 1, where 0 means nothing within range and 1 means an external\\n\"\n\n \"object is touching the sensor. Values between 0 and 1 depend on the distance of\\n\"\n\n \"the occluding object, and are calculated as value=exp(-distance). In\\n\"\n\n \"controllers, you must include the ci_proximity_sensor.h header.\\n\\n\"\n\n\n\n \"This sensor is enabled by default.\\n\\n\"\n\n\n\n \"REQUIRED XML CONFIGURATION\\n\\n\"\n\n\n\n \" <controllers>\\n\"\n\n \" ...\\n\"\n\n \" <my_controller ...>\\n\"\n\n \" ...\\n\"\n\n \" <sensors>\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp","rank":94,"score":184888.461969895},{"content":" \"the perceived light. Each reading R is calculated with R=(I/x)^2, where x is the\\n\"\n\n \"distance between a sensor and the light, and I is the reference intensity of the\\n\"\n\n \"perceived light. The reference intensity corresponds to the minimum distance at\\n\"\n\n \"which the light saturates a sensor. The reference intensity depends on the\\n\"\n\n \"individual light, and it is set with the \\\"intensity\\\" attribute of the light\\n\"\n\n \"entity. In case multiple lights are present in the environment, each sensor\\n\"\n\n \"reading is calculated as the sum of the individual readings due to each light.\\n\"\n\n \"In other words, light wave interference is not taken into account. In\\n\"\n\n \"controllers, you must include the ci_light_sensor.h header.\\n\\n\"\n\n\n\n \"This sensor is enabled by default.\\n\\n\"\n\n\n\n \"REQUIRED XML CONFIGURATION\\n\\n\"\n\n \" <controllers>\\n\"\n\n \" ...\\n\"\n\n \" <my_controller ...>\\n\"\n\n \" ...\\n\"\n\n \" <sensors>\\n\"\n\n \" ...\\n\"\n\n \" <light implementation=\\\"default\\\" />\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":95,"score":184886.0881221864},{"content":" \"controllers, you must include the ci_battery_sensor.h header.\\n\\n\"\n\n\n\n \"This sensor is enabled by default.\\n\\n\"\n\n\n\n \"REQUIRED XML CONFIGURATION\\n\\n\"\n\n \" <controllers>\\n\"\n\n \" ...\\n\"\n\n \" <my_controller ...>\\n\"\n\n \" ...\\n\"\n\n \" <sensors>\\n\"\n\n \" ...\\n\"\n\n \" <battery implementation=\\\"default\\\" />\\n\"\n\n \" ...\\n\"\n\n \" </sensors>\\n\"\n\n \" ...\\n\"\n\n \" </my_controller>\\n\"\n\n \" ...\\n\"\n\n \" </controllers>\\n\\n\"\n\n\n\n \"OPTIONAL XML CONFIGURATION\\n\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp","rank":96,"score":184885.69489521778},{"content":" \" <sensors>\\n\"\n\n \" ...\\n\"\n\n \" <light implementation=\\\"default\\\"\\n\"\n\n \" noise_level=\\\"0.1\\\" />\\n\"\n\n \" ...\\n\"\n\n \" </sensors>\\n\"\n\n \" ...\\n\"\n\n \" </my_controller>\\n\"\n\n \" ...\\n\"\n\n \" </controllers>\\n\\n\"\n\n\n\n \"OPTIMIZATION HINTS\\n\\n\"\n\n\n\n \"1. For small swarms, enabling the light sensor (and therefore causing ARGoS to\\n\"\n\n \" update its readings each timestep) unconditionally does not impact performance too\\n\"\n\n \" much. For large swarms, it can impact performance, and selectively\\n\"\n\n \" enabling/disabling the light sensor according to when each individual robot needs it\\n\"\n\n \" (e.g., only when it is returning to the nest from foraging) can increase performance\\n\"\n\n \" by only requiring ARGoS to update the readings for a robot on the timesteps will be\\n\"\n\n \" used.\\n\",\n\n\n\n \"Usable\"\n\n\t\t );\n\n\n\n}\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":97,"score":184885.44623256396},{"content":"\n\n /****************************************/\n\n /****************************************/\n\n\n\n Real CLightDefaultSensor::CalculateReading(Real f_distance, Real f_intensity) {\n\n return (f_intensity * f_intensity) / (f_distance * f_distance);\n\n }\n\n\n\n /****************************************/\n\n /****************************************/\n\n\n\n REGISTER_SENSOR(CLightDefaultSensor,\n\n \"light\", \"default\",\n\n \"Carlo Pinciroli [ilpincy@gmail.com]\",\n\n \"1.0\",\n\n \"A generic light sensor.\",\n\n\n\n \"This sensor accesses a set of light sensors. The sensors all return a value\\n\"\n\n \"between 0 and 1, where 0 means nothing within range and 1 means the perceived\\n\"\n\n \"light saturates the sensor. Values between 0 and 1 depend on the distance of\\n\"\n","file_path":"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp","rank":98,"score":184885.4076339252},{"content":" * @returns A value in the range [0:1], where 0 means that the object is too far to be sensed, and 1 means the object is so close that it saturates the sensor.\n\n */\n\n virtual Real CalculateReading(Real f_distance);\n\n\n\n /**\n\n * Returns true if the rays must be shown in the GUI.\n\n * @return true if the rays must be shown in the GUI.\n\n */\n\n inline bool IsShowRays() {\n\n return m_bShowRays;\n\n }\n\n\n\n /**\n\n * Sets whether or not the rays must be shown in the GUI.\n\n * @param b_show_rays true if the rays must be shown, false otherwise\n\n */\n\n inline void SetShowRays(bool b_show_rays) {\n\n m_bShowRays = b_show_rays;\n\n }\n\n\n","file_path":"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h","rank":99,"score":184884.96844036411}],"string":"[\n {\n \"content\": \" class CRadiosDefaultSensor;\\n\\n}\\n\\n\\n\\n#include <argos3/core/simulator/sensor.h>\\n\\n#include <argos3/plugins/robots/generic/control_interface/ci_radios_sensor.h>\\n\\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h\",\n \"rank\": 0,\n \"score\": 278446.62080654135\n },\n {\n \"content\": \" class CRadiosDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_RadiosSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CRadiosDefaultSensor();\\n\\n\\n\\n virtual ~CRadiosDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n /**\\n\\n * Returns true if the rays must be shown in the GUI.\\n\\n * @return true if the rays must be shown in the GUI.\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h\",\n \"rank\": 1,\n \"score\": 274672.9850432067\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/robots/generic/simulator/radios_default_sensor.h>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef RADIOS_DEFAULT_SENSOR_H\\n\\n#define RADIOS_DEFAULT_SENSOR_H\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h\",\n \"rank\": 2,\n \"score\": 250582.74120216788\n },\n {\n \"content\": \" */\\n\\n inline bool IsShowRays() {\\n\\n return m_bShowRays;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Sets whether or not the rays must be shown in the GUI.\\n\\n * @param b_show_rays true if the rays must be shown, false otherwise\\n\\n */\\n\\n inline void SetShowRays(bool b_show_rays) {\\n\\n m_bShowRays = b_show_rays;\\n\\n }\\n\\n\\n\\n protected:\\n\\n\\n\\n CRadioEquippedEntity* m_pcRadioEquippedEntity;\\n\\n CControllableEntity* m_pcControllableEntity;\\n\\n bool m_bShowRays;\\n\\n\\n\\n };\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_sensor.h\",\n \"rank\": 3,\n \"score\": 250560.25614876655\n },\n {\n \"content\": \" class CRadiosDefaultActuator;\\n\\n}\\n\\n\\n\\n#include <argos3/core/simulator/actuator.h>\\n\\n#include <argos3/plugins/robots/generic/control_interface/ci_radios_actuator.h>\\n\\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\\n\\n#include <argos3/plugins/simulator/media/radio_medium.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.h\",\n \"rank\": 11,\n \"score\": 205377.70858307905\n },\n {\n \"content\": \"\\tclass CCI_RadiosSensor;\\n\\n}\\n\\n\\n\\n#include <argos3/core/control_interface/ci_sensor.h>\\n\\n#include <argos3/core/utility/datatypes/byte_array.h>\\n\\n\\n\\nnamespace argos {\\n\\n \\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h\",\n \"rank\": 12,\n \"score\": 205207.6654434374\n },\n {\n \"content\": \" class CPositioningDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h\",\n \"rank\": 13,\n \"score\": 205036.23309779592\n },\n {\n \"content\": \" class CLightDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 14,\n \"score\": 205036.23309779592\n },\n {\n \"content\": \" class CCameraDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h\",\n \"rank\": 15,\n \"score\": 205036.23309779592\n },\n {\n \"content\": \" class CProximityDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 16,\n \"score\": 205036.23309779592\n },\n {\n \"content\": \" class CBatteryDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h\",\n \"rank\": 17,\n \"score\": 205036.23309779592\n },\n {\n \"content\": \" class CCI_RadiosSensor: virtual public CCI_Sensor {\\n\\n \\n\\n public:\\n\\n \\n\\n struct SInterface {\\n\\n SInterface(const std::string& str_id,\\n\\n const std::vector<CByteArray>& vec_data = {}) :\\n\\n Id(str_id),\\n\\n Data(vec_data) {}\\n\\n std::string Id;\\n\\n std::vector<CByteArray> Data;\\n\\n using TVector = std::vector<SInterface>;\\n\\n };\\n\\n\\n\\n public:\\n\\n \\n\\n /**\\n\\n * Constructor\\n\\n */\\n\\n CCI_RadiosSensor() {}\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h\",\n \"rank\": 18,\n \"score\": 203901.56540705002\n },\n {\n \"content\": \" class CBatteryDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_BatterySensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CBatteryDefaultSensor();\\n\\n\\n\\n virtual ~CBatteryDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n protected:\\n\\n\\n\\n /** Reference to embodied entity associated to this sensor */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h\",\n \"rank\": 19,\n \"score\": 203735.9088870675\n },\n {\n \"content\": \" class CPositioningDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_PositioningSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CPositioningDefaultSensor();\\n\\n\\n\\n virtual ~CPositioningDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n protected:\\n\\n\\n\\n /** Reference to embodied entity associated to this sensor */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h\",\n \"rank\": 20,\n \"score\": 203735.9088870675\n },\n {\n \"content\": \" class CProximityDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_ProximitySensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CProximityDefaultSensor();\\n\\n\\n\\n virtual ~CProximityDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n /**\\n\\n * Calculates the proximity reading when the closest occluding object is located as the given distance.\\n\\n * @param f_distance The distance of the closest occluding object in meters\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 21,\n \"score\": 203735.9088870675\n },\n {\n \"content\": \" class CCameraDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_CameraSensor {\\n\\n\\n\\n public:\\n\\n struct SSensor {\\n\\n SAnchor& Anchor;\\n\\n CTransformationMatrix3 Offset;\\n\\n CRange<Real> Range;\\n\\n CSquareMatrix<3> ProjectionMatrix;\\n\\n std::vector<CCameraSensorSimulatedAlgorithm*> Algorithms;\\n\\n Real NearPlaneWidth, NearPlaneHeight;\\n\\n Real FarPlaneWidth, FarPlaneHeight;\\n\\n /* constructor */\\n\\n SSensor(SAnchor& s_anchor,\\n\\n const CTransformationMatrix3& c_offset,\\n\\n const CRange<Real>& c_range,\\n\\n const CSquareMatrix<3>& c_projection_matrix,\\n\\n const CVector2& c_resolution,\\n\\n const std::vector<CCameraSensorSimulatedAlgorithm*>& vec_algorithms) :\\n\\n Anchor(s_anchor),\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h\",\n \"rank\": 22,\n \"score\": 203735.9088870675\n },\n {\n \"content\": \" class CLightDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_LightSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CLightDefaultSensor();\\n\\n\\n\\n virtual ~CLightDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n /**\\n\\n * Calculates the light reading resulting from a light source at the given distance.\\n\\n * Denoting the intensity with <em>i</em> and the distance <em>x</em>, this function calculates <em>i</em> = (<em>I</em> / <em>x<em>)^2.\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 23,\n \"score\": 203735.9088870675\n },\n {\n \"content\": \" class CPrototypeJointsDefaultSensor;\\n\\n}\\n\\n\\n\\n#include <argos3/core/simulator/sensor.h>\\n\\n#include <argos3/plugins/robots/prototype/control_interface/ci_prototype_joints_sensor.h>\\n\\n#include <argos3/plugins/robots/prototype/simulator/prototype_entity.h>\\n\\n#include <argos3/plugins/robots/prototype/simulator/prototype_joint_equipped_entity.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/prototype/simulator/prototype_joints_default_sensor.h\",\n \"rank\": 24,\n \"score\": 200918.8121532871\n },\n {\n \"content\": \" class CDifferentialSteeringDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/differential_steering_default_sensor.h\",\n \"rank\": 25,\n \"score\": 200918.8121532871\n },\n {\n \"content\": \" class CEPuckProximityDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h\",\n \"rank\": 26,\n \"score\": 200918.8121532871\n },\n {\n \"content\": \" class CPrototypeJointsDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_PrototypeJointsSensor {\\n\\n\\n\\n public:\\n\\n struct SSimulatedSensor : public SSensor {\\n\\n SSimulatedSensor(const std::string& str_id,\\n\\n CPrototypeJointEntity::SSensor& s_sensor) :\\n\\n SSensor(str_id),\\n\\n Instance(s_sensor) {}\\n\\n CPrototypeJointEntity::SSensor& Instance;\\n\\n };\\n\\n \\n\\n public:\\n\\n CPrototypeJointsDefaultSensor();\\n\\n\\n\\n virtual ~CPrototypeJointsDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\",\n \"file_path\": \"argos3/src/plugins/robots/prototype/simulator/prototype_joints_default_sensor.h\",\n \"rank\": 27,\n \"score\": 200177.59681013745\n },\n {\n \"content\": \" class CEPuckProximityDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_EPuckProximitySensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CEPuckProximityDefaultSensor();\\n\\n\\n\\n virtual ~CEPuckProximityDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n /**\\n\\n * Calculates the proximity reading when the closest occluding object is located as the given distance.\\n\\n * @param f_distance The distance of the closest occluding object in meters\\n\",\n \"file_path\": \"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h\",\n \"rank\": 28,\n \"score\": 200177.59681013745\n },\n {\n \"content\": \" class CDifferentialSteeringDefaultSensor : public CSimulatedSensor,\\n\\n public CCI_DifferentialSteeringSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CDifferentialSteeringDefaultSensor();\\n\\n\\n\\n virtual ~CDifferentialSteeringDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n protected:\\n\\n\\n\\n /** Reference to wheeled entity associated to this sensor */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/differential_steering_default_sensor.h\",\n \"rank\": 29,\n \"score\": 200177.59681013745\n },\n {\n \"content\": \" class CRadiosDefaultActuator : public CSimulatedActuator,\\n\\n public CCI_RadiosActuator {\\n\\n\\n\\n public:\\n\\n\\n\\n CRadiosDefaultActuator();\\n\\n\\n\\n virtual ~CRadiosDefaultActuator() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n private:\\n\\n\\n\\n CRadioEquippedEntity* m_pcRadioEquippedEntity;\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.h\",\n \"rank\": 30,\n \"score\": 197301.7967841988\n },\n {\n \"content\": \" class CFootBotProximityDefaultSensor;\\n\\n}\\n\\n\\n\\n#include <argos3/plugins/robots/foot-bot/control_interface/ci_footbot_proximity_sensor.h>\\n\\n#include <argos3/plugins/robots/generic/simulator/proximity_default_sensor.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/foot-bot/simulator/footbot_proximity_default_sensor.h\",\n \"rank\": 31,\n \"score\": 196971.82614569613\n },\n {\n \"content\": \" class CEyeBotProximityDefaultSensor;\\n\\n}\\n\\n\\n\\n#include <argos3/plugins/robots/eye-bot/control_interface/ci_eyebot_proximity_sensor.h>\\n\\n#include <argos3/plugins/robots/generic/simulator/proximity_default_sensor.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/eye-bot/simulator/eyebot_proximity_default_sensor.h\",\n \"rank\": 32,\n \"score\": 196971.82614569613\n },\n {\n \"content\": \" class CProximitySensorImpl : public CProximityDefaultSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n virtual Real CalculateReading(Real f_distance) {\\n\\n if(f_distance < 0.009889556) {\\n\\n return 1.0;\\n\\n }\\n\\n else {\\n\\n return 0.0100527 / (f_distance + 0.000163144);\\n\\n }\\n\\n }\\n\\n\\n\\n };\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CEyeBotProximityDefaultSensor::CEyeBotProximityDefaultSensor() :\\n\\n m_pcProximityImpl(new CProximitySensorImpl()) {}\\n\",\n \"file_path\": \"argos3/src/plugins/robots/eye-bot/simulator/eyebot_proximity_default_sensor.cpp\",\n \"rank\": 33,\n \"score\": 196753.33581463736\n },\n {\n \"content\": \" class CProximitySensorImpl : public CProximityDefaultSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n virtual Real CalculateReading(Real f_distance) {\\n\\n return f_distance;\\n\\n }\\n\\n\\n\\n };\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CFootBotProximityDefaultSensor::CFootBotProximityDefaultSensor() :\\n\\n m_pcProximityImpl(new CProximitySensorImpl()) {}\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CFootBotProximityDefaultSensor::~CFootBotProximityDefaultSensor() {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/foot-bot/simulator/footbot_proximity_default_sensor.cpp\",\n \"rank\": 34,\n \"score\": 196753.33581463736\n },\n {\n \"content\": \" class CFootBotProximityDefaultSensor : public CCI_FootBotProximitySensor,\\n\\n public CSimulatedSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CFootBotProximityDefaultSensor();\\n\\n\\n\\n virtual ~CFootBotProximityDefaultSensor();\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n private:\\n\\n\\n\\n CProximityDefaultSensor* m_pcProximityImpl;\\n\\n\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/foot-bot/simulator/footbot_proximity_default_sensor.h\",\n \"rank\": 35,\n \"score\": 193455.053094409\n },\n {\n \"content\": \" class CEyeBotProximityDefaultSensor : public CCI_EyeBotProximitySensor,\\n\\n public CSimulatedSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CEyeBotProximityDefaultSensor();\\n\\n\\n\\n virtual ~CEyeBotProximityDefaultSensor();\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n private:\\n\\n\\n\\n CProximityDefaultSensor* m_pcProximityImpl;\\n\\n\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/eye-bot/simulator/eyebot_proximity_default_sensor.h\",\n \"rank\": 36,\n \"score\": 193455.053094409\n },\n {\n \"content\": \" class CFootBotTurretEncoderDefaultSensor;\\n\\n}\\n\\n\\n\\n#include <argos3/plugins/robots/foot-bot/control_interface/ci_footbot_turret_encoder_sensor.h>\\n\\n#include <argos3/plugins/robots/foot-bot/simulator/footbot_turret_encoder_default_sensor.h>\\n\\n#include <argos3/plugins/robots/foot-bot/simulator/footbot_turret_entity.h>\\n\\n#include <argos3/core/simulator/sensor.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/foot-bot/simulator/footbot_turret_encoder_default_sensor.h\",\n \"rank\": 37,\n \"score\": 193184.37208821767\n },\n {\n \"content\": \" class CColoredBlobPerspectiveCameraDefaultSensor;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/colored_blob_perspective_camera_default_sensor.h\",\n \"rank\": 38,\n \"score\": 193184.37208821767\n },\n {\n \"content\": \" class CLightSensorEquippedEntity;\\n\\n}\\n\\n\\n\\n#include <argos3/plugins/robots/generic/control_interface/ci_light_sensor.h>\\n\\n#include <argos3/core/utility/math/range.h>\\n\\n#include <argos3/core/utility/math/rng.h>\\n\\n#include <argos3/core/simulator/space/space.h>\\n\\n#include <argos3/core/simulator/sensor.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 39,\n \"score\": 188754.4947490895\n },\n {\n \"content\": \" class CProximitySensorEquippedEntity;\\n\\n}\\n\\n\\n\\n#include <argos3/plugins/robots/generic/control_interface/ci_proximity_sensor.h>\\n\\n#include <argos3/core/utility/math/range.h>\\n\\n#include <argos3/core/utility/math/rng.h>\\n\\n#include <argos3/core/simulator/space/space.h>\\n\\n#include <argos3/core/simulator/sensor.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 40,\n \"score\": 188754.4947490895\n },\n {\n \"content\": \" class CFootBotTurretEncoderDefaultSensor : public CCI_FootBotTurretEncoderSensor,\\n\\n public CSimulatedSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CFootBotTurretEncoderDefaultSensor();\\n\\n\\n\\n virtual ~CFootBotTurretEncoderDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n virtual void Enable();\\n\\n\\n\\n virtual void Disable();\\n\\n\\n\\n private:\\n\\n\\n\\n CFootBotTurretEntity* m_pcTurretEntity;\\n\\n\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/foot-bot/simulator/footbot_turret_encoder_default_sensor.h\",\n \"rank\": 41,\n \"score\": 188727.82842349893\n },\n {\n \"content\": \" class CColoredBlobPerspectiveCameraDefaultSensor : public CCI_ColoredBlobPerspectiveCameraSensor,\\n\\n public CSimulatedSensor {\\n\\n\\n\\n public:\\n\\n\\n\\n CColoredBlobPerspectiveCameraDefaultSensor();\\n\\n\\n\\n virtual ~CColoredBlobPerspectiveCameraDefaultSensor();\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\\n\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n virtual void Reset();\\n\\n\\n\\n virtual void Destroy();\\n\\n\\n\\n virtual void Enable();\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/colored_blob_perspective_camera_default_sensor.h\",\n \"rank\": 42,\n \"score\": 188727.82842349893\n },\n {\n \"content\": \"/*\\n\\n * @file <argos3/plugins/robots/generic/simulator/radios_default_actuator.h>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef RADIOS_DEFAULT_ACTUATOR_H\\n\\n#define RADIOS_DEFAULT_ACTUATOR_H\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.h\",\n \"rank\": 43,\n \"score\": 187952.79684239408\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/positioning_default_sensor.h>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef POSITIONING_DEFAULT_SENSOR_H\\n\\n#define POSITIONING_DEFAULT_SENSOR_H\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h\",\n \"rank\": 44,\n \"score\": 187661.29029730335\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/light_default_sensor.h>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef LIGHT_DEFAULT_SENSOR_H\\n\\n#define LIGHT_DEFAULT_SENSOR_H\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 45,\n \"score\": 187661.29029730335\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/battery_default_sensor.h>\\n\\n *\\n\\n * @author Adhavan Jayabalan <jadhu94@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef BATTERY_DEFAULT_SENSOR_H\\n\\n#define BATTERY_DEFAULT_SENSOR_H\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h\",\n \"rank\": 46,\n \"score\": 187661.29029730335\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/proximity_default_sensor.h>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef PROXIMITY_DEFAULT_SENSOR_H\\n\\n#define PROXIMITY_DEFAULT_SENSOR_H\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 47,\n \"score\": 187661.29029730335\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/robots/generic/simulator/camera_default_sensor.h>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef CAMERAS_DEFAULT_SENSOR_H\\n\\n#define CAMERAS_DEFAULT_SENSOR_H\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h\",\n \"rank\": 48,\n \"score\": 187660.09753407145\n },\n {\n \"content\": \" Offset(c_offset),\\n\\n Range(c_range),\\n\\n ProjectionMatrix(c_projection_matrix),\\n\\n Algorithms(vec_algorithms) {\\n\\n Real fWidthToDepthRatio = (0.5 * c_resolution.GetX()) / c_projection_matrix(0,0);\\n\\n Real fHeightToDepthRatio = (0.5 * c_resolution.GetY()) / c_projection_matrix(1,1);\\n\\n NearPlaneHeight = fHeightToDepthRatio * c_range.GetMin();\\n\\n NearPlaneWidth = fWidthToDepthRatio * c_range.GetMin();\\n\\n FarPlaneHeight = fHeightToDepthRatio * c_range.GetMax();\\n\\n FarPlaneWidth = fWidthToDepthRatio * c_range.GetMax();\\n\\n }\\n\\n };\\n\\n\\n\\n public:\\n\\n\\n\\n CCameraDefaultSensor();\\n\\n\\n\\n virtual ~CCameraDefaultSensor() {}\\n\\n\\n\\n virtual void SetRobot(CComposableEntity& c_entity);\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h\",\n \"rank\": 49,\n \"score\": 187650.03955336683\n },\n {\n \"content\": \" * @returns A value in the range [0:1], where 0 means that the object is too far to be sensed, and 1 means the object is so close that it saturates the sensor.\\n\\n */\\n\\n virtual Real CalculateReading(Real f_distance);\\n\\n\\n\\n /**\\n\\n * Returns true if the rays must be shown in the GUI.\\n\\n * @return true if the rays must be shown in the GUI.\\n\\n */\\n\\n inline bool IsShowRays() {\\n\\n return m_bShowRays;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Sets whether or not the rays must be shown in the GUI.\\n\\n * @param b_show_rays true if the rays must be shown, false otherwise\\n\\n */\\n\\n inline void SetShowRays(bool b_show_rays) {\\n\\n m_bShowRays = b_show_rays;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 50,\n \"score\": 187647.01803251563\n },\n {\n \"content\": \" inline void SetShowRays(bool b_show_rays) {\\n\\n m_bShowRays = b_show_rays;\\n\\n }\\n\\n\\n\\n protected:\\n\\n\\n\\n /** Reference to light sensor equipped entity associated to this sensor */\\n\\n CLightSensorEquippedEntity* m_pcLightEntity;\\n\\n\\n\\n /** Reference to controllable entity associated to this sensor */\\n\\n CControllableEntity* m_pcControllableEntity;\\n\\n\\n\\n /** Flag to show rays in the simulator */\\n\\n bool m_bShowRays;\\n\\n\\n\\n /** Random number generator */\\n\\n CRandom::CRNG* m_pcRNG;\\n\\n\\n\\n /** Whether to add noise or not */\\n\\n bool m_bAddNoise;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 51,\n \"score\": 187644.1439066438\n },\n {\n \"content\": \"\\n\\n virtual void Init(TConfigurationNode& t_tree);\\n\\n\\n\\n virtual void Update();\\n\\n\\n\\n protected:\\n\\n bool m_bShowFrustum;\\n\\n CEmbodiedEntity* m_pcEmbodiedEntity;\\n\\n CControllableEntity* m_pcControllableEntity;\\n\\n std::vector<SSensor> m_vecSensors;\\n\\n };\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.h\",\n \"rank\": 52,\n \"score\": 187641.93726317337\n },\n {\n \"content\": \" * <em>I</em> is the reference intensity of the light, that is, the distance at which the light reading saturates.\\n\\n * It is dependent on the light entity being considered.\\n\\n * @param f_distance The distance of the considered light source.\\n\\n * @param f_intensity The reference intensity of the considered light source.\\n\\n * @returns A value in the range [0:1], where 0 means that the light is too far to be sensed, and 1 means the light is so close that it saturates the sensor.\\n\\n */\\n\\n virtual Real CalculateReading(Real f_distance, Real f_intensity);\\n\\n\\n\\n /**\\n\\n * Returns true if the rays must be shown in the GUI.\\n\\n * @return true if the rays must be shown in the GUI.\\n\\n */\\n\\n inline bool IsShowRays() {\\n\\n return m_bShowRays;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Sets whether or not the rays must be shown in the GUI.\\n\\n * @param b_show_rays true if the rays must be shown, false otherwise\\n\\n */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 53,\n \"score\": 187639.9809619003\n },\n {\n \"content\": \" protected:\\n\\n\\n\\n /** Reference to embodied entity associated to this sensor */\\n\\n CEmbodiedEntity* m_pcEmbodiedEntity;\\n\\n\\n\\n /** Reference to proximity sensor equipped entity associated to this sensor */\\n\\n CProximitySensorEquippedEntity* m_pcProximityEntity;\\n\\n\\n\\n /** Reference to controllable entity associated to this sensor */\\n\\n CControllableEntity* m_pcControllableEntity;\\n\\n\\n\\n /** Flag to show rays in the simulator */\\n\\n bool m_bShowRays;\\n\\n\\n\\n /** Random number generator */\\n\\n CRandom::CRNG* m_pcRNG;\\n\\n\\n\\n /** Whether to add noise or not */\\n\\n bool m_bAddNoise;\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 54,\n \"score\": 187636.26174529057\n },\n {\n \"content\": \" CEmbodiedEntity* m_pcEmbodiedEntity;\\n\\n\\n\\n /** Reference to battery sensor equipped entity associated to this sensor */\\n\\n CBatteryEquippedEntity* m_pcBatteryEntity;\\n\\n\\n\\n /** Random number generator */\\n\\n CRandom::CRNG* m_pcRNG;\\n\\n\\n\\n /** Whether to add noise or not */\\n\\n bool m_bAddNoise;\\n\\n\\n\\n /** Noise range on battery level */\\n\\n CRange<Real> m_cNoiseRange;\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.h\",\n \"rank\": 55,\n \"score\": 187635.04119265653\n },\n {\n \"content\": \" /** Noise range */\\n\\n CRange<Real> m_cNoiseRange;\\n\\n\\n\\n /** Reference to the space */\\n\\n CSpace& m_cSpace;\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.h\",\n \"rank\": 56,\n \"score\": 187628.74022750737\n },\n {\n \"content\": \"\\n\\n /** Noise range */\\n\\n CRange<Real> m_cNoiseRange;\\n\\n\\n\\n /** Reference to the space */\\n\\n CSpace& m_cSpace;\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.h\",\n \"rank\": 57,\n \"score\": 187628.74022750737\n },\n {\n \"content\": \" CEmbodiedEntity* m_pcEmbodiedEntity;\\n\\n\\n\\n /** Random number generator */\\n\\n CRandom::CRNG* m_pcRNG;\\n\\n\\n\\n /** Whether to add noise or not */\\n\\n bool m_bAddNoise;\\n\\n\\n\\n /** Noise range on position */\\n\\n CRange<Real> m_cPosNoiseRange;\\n\\n\\n\\n /** Noise range on angle */\\n\\n CRange<CRadians> m_cAngleNoiseRange;\\n\\n\\n\\n /** Noise range on axis */\\n\\n CRange<Real> m_cAxisNoiseRange;\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.h\",\n \"rank\": 58,\n \"score\": 187628.74022750737\n },\n {\n \"content\": \" class CProximitySensorEquippedEntity;\\n\\n}\\n\\n\\n\\n#include <argos3/plugins/robots/e-puck/control_interface/ci_epuck_proximity_sensor.h>\\n\\n#include <argos3/core/utility/math/range.h>\\n\\n#include <argos3/core/utility/math/rng.h>\\n\\n#include <argos3/core/simulator/space/space.h>\\n\\n#include <argos3/core/simulator/sensor.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h\",\n \"rank\": 59,\n \"score\": 186539.0157425024\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/robots/generic/simulator/radios_default_actuator.cpp>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#include \\\"radios_default_actuator.h\\\"\\n\\n#include <argos3/plugins/simulator/media/radio_medium.h>\\n\\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CRadiosDefaultActuator::CRadiosDefaultActuator() :\\n\\n m_pcRadioEquippedEntity(nullptr) {\\n\\n }\\n\\n\\n\\n /****************************************/\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 60,\n \"score\": 185190.91596976135\n },\n {\n \"content\": \" /****************************************/\\n\\n\\n\\n void CRadiosDefaultActuator::SetRobot(CComposableEntity& c_entity) {\\n\\n try {\\n\\n /* Get and enable omndirectional radio equipped entity */\\n\\n m_pcRadioEquippedEntity = &(c_entity.GetComponent<CRadioEquippedEntity>(\\\"radios\\\"));\\n\\n /* Create a configuration settings for each radio in the container */\\n\\n m_vecInterfaces.reserve(m_pcRadioEquippedEntity->GetInstances().size());\\n\\n /* Populate the descriptors */\\n\\n for(CRadioEquippedEntity::SInstance& s_instance : m_pcRadioEquippedEntity->GetInstances()) {\\n\\n m_vecInterfaces.emplace_back(s_instance.Radio.GetId());\\n\\n }\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Can't set robot for the radios default actuator\\\", ex);\\n\\n }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 61,\n \"score\": 185190.6546351586\n },\n {\n \"content\": \"\\n\\n void CRadiosDefaultActuator::Init(TConfigurationNode& t_tree) {\\n\\n try {\\n\\n /* Parent class init */\\n\\n CCI_RadiosActuator::Init(t_tree);\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Error initializing the radios default actuator\\\", ex);\\n\\n }\\n\\n }\\n\\n \\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CRadiosDefaultActuator::Update() {\\n\\n for(size_t i = 0; i < m_vecInterfaces.size(); ++i) {\\n\\n CRadioEntity& cRadio = m_pcRadioEquippedEntity->GetRadio(i);\\n\\n /* Create operation instance */\\n\\n CTxOperation cTxOperation(cRadio, m_vecInterfaces[i].Data);\\n\\n /* Calculate the range of the transmitting radio */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 62,\n \"score\": 185184.00587519378\n },\n {\n \"content\": \" CVector3 cTxRange(1.0f,1.0f,1.0f);\\n\\n cTxRange *= (cRadio.GetRange() * 0.5f);\\n\\n /* Get positional index */\\n\\n CPositionalIndex<CRadioEntity>* pcRadioIndex =\\n\\n &(cRadio.GetMedium().GetIndex());\\n\\n /* Transmit the data to receiving radios in the space */\\n\\n pcRadioIndex->ForEntitiesInBoxRange(cRadio.GetPosition(), cTxRange, cTxOperation);\\n\\n /* Flush data from the control interface */\\n\\n m_vecInterfaces[i].Data.clear();\\n\\n }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CRadiosDefaultActuator::Reset() {\\n\\n for(SInterface& s_interface : m_vecInterfaces) {\\n\\n /* Clear any data in the interface */\\n\\n s_interface.Data.clear();\\n\\n }\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 63,\n \"score\": 185170.97555969114\n },\n {\n \"content\": \" }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CRadiosDefaultActuator::CTxOperation::CTxOperation(const CRadioEntity& c_tx_radio,\\n\\n const std::vector<CByteArray>& c_tx_data) :\\n\\n m_cTxRadio(c_tx_radio),\\n\\n m_cTxData(c_tx_data) {}\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n bool CRadiosDefaultActuator::CTxOperation::operator()(CRadioEntity& c_rx_radio) {\\n\\n if(&c_rx_radio != &m_cTxRadio) {\\n\\n const CVector3& cRxRadioPosition = c_rx_radio.GetPosition();\\n\\n const CVector3& cTxRadioPosition = m_cTxRadio.GetPosition();\\n\\n Real fDistance = (cRxRadioPosition - cTxRadioPosition).Length();\\n\\n if(fDistance < m_cTxRadio.GetRange()) {\\n\\n for(const CByteArray& c_data : m_cTxData) {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 64,\n \"score\": 185168.7493238804\n },\n {\n \"content\": \" \\\"scope of this actuator's implementation.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"REQUIRED XML CONFIGURATION\\\\n\\\\n\\\"\\n\\n \\\" <controllers>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <my_controller ...>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <actuators>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <radios implementation=\\\\\\\"default\\\\\\\" medium=\\\\\\\"radios\\\\\\\" />\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </actuators>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </my_controller>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </controllers>\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"The 'medium' attribute sets the id of the radio medium declared in the <media>\\\\n\\\"\\n\\n \\\"XML section.\\\\n\\\\n\\\"\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 65,\n \"score\": 185167.91588825843\n },\n {\n \"content\": \" c_rx_radio.ReceiveData(cTxRadioPosition, c_data);\\n\\n }\\n\\n }\\n\\n }\\n\\n return true;\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n REGISTER_ACTUATOR(CRadiosDefaultActuator,\\n\\n \\\"radios\\\", \\\"default\\\",\\n\\n \\\"Michael Allwright [allsey87@gmail.com]\\\",\\n\\n \\\"1.0\\\",\\n\\n\\n\\n \\\"A generic radio actuator to send messages to nearby radios.\\\",\\n\\n \\\"This radio actuator implementation allows an arbitary number of messages\\\\n\\\"\\n\\n \\\"containing an arbitary number of bytes to be sent to nearby radios. The\\\\n\\\" \\n\\n \\\"implementation of this actuator is very basic and any concepts such as\\\\n\\\"\\n\\n \\\"throughput, addressing, or formatting of a message's contents is beyond the\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 66,\n \"score\": 185167.6820929863\n },\n {\n \"content\": \" \\\"OPTIONAL XML CONFIGURATION\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"None.\\\\n\\\",\\n\\n\\n\\n \\\"Usable\\\"\\n\\n );\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n}\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/radios_default_actuator.cpp\",\n \"rank\": 67,\n \"score\": 185155.03807126769\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/robots/generic/control_interface/ci_radios_sensor.cpp>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef CI_RADIOS_SENSOR_H\\n\\n#define CI_RADIOS_SENSOR_H\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h\",\n \"rank\": 68,\n \"score\": 185042.4388109653\n },\n {\n \"content\": \" \\n\\n /**\\n\\n * Destructor\\n\\n */\\n\\n virtual ~CCI_RadiosSensor() {}\\n\\n \\n\\n public:\\n\\n\\n\\n /**\\n\\n * Returns a const reference to the radio interfaces.\\n\\n * @return A const reference to the radio interfaces.\\n\\n */\\n\\n const SInterface::TVector& GetInterfaces() const;\\n\\n \\n\\n#ifdef ARGOS_WITH_LUA\\n\\n virtual void CreateLuaState(lua_State* pt_lua_state);\\n\\n \\n\\n virtual void ReadingsToLuaState(lua_State* pt_lua_state);\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h\",\n \"rank\": 69,\n \"score\": 185039.6295696094\n },\n {\n \"content\": \" protected:\\n\\n \\n\\n SInterface::TVector m_vecInterfaces;\\n\\n \\n\\n };\\n\\n \\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/control_interface/ci_radios_sensor.h\",\n \"rank\": 70,\n \"score\": 185011.45088734615\n },\n {\n \"content\": \" m_cNoiseRange.Set(-fNoiseLevel, fNoiseLevel);\\n\\n m_pcRNG = CRandom::CreateRNG(\\\"argos\\\");\\n\\n }\\n\\n m_tReadings.resize(m_pcLightEntity->GetNumSensors());\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Initialization error in default light sensor\\\", ex);\\n\\n }\\n\\n /* sensor is enabled by default */\\n\\n Enable();\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n \\n\\n void CLightDefaultSensor::Update() {\\n\\n /* sensor is disabled--nothing to do */\\n\\n if (IsDisabled()) {\\n\\n return;\\n\\n }\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 71,\n \"score\": 184908.9363847223\n },\n {\n \"content\": \" m_bAddNoise = true;\\n\\n m_cNoiseRange.Set(-fNoiseLevel, fNoiseLevel);\\n\\n m_pcRNG = CRandom::CreateRNG(\\\"argos\\\");\\n\\n }\\n\\n m_tReadings.resize(m_pcProximityEntity->GetNumSensors());\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Initialization error in default proximity sensor\\\", ex);\\n\\n }\\n\\n /* This sensor is enabled by default */\\n\\n Enable();\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CProximityDefaultSensor::Update() {\\n\\n /* sensor is disabled--nothing to do */\\n\\n if (IsDisabled()) {\\n\\n return;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp\",\n \"rank\": 72,\n \"score\": 184908.21958755923\n },\n {\n \"content\": \" /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CBatteryDefaultSensor::CBatteryDefaultSensor() :\\n\\n m_pcEmbodiedEntity(nullptr),\\n\\n m_pcBatteryEntity(nullptr),\\n\\n m_pcRNG(nullptr),\\n\\n m_bAddNoise(false) {}\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CBatteryDefaultSensor::SetRobot(CComposableEntity& c_entity) {\\n\\n try {\\n\\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\\\"body\\\"));\\n\\n m_pcBatteryEntity = &(c_entity.GetComponent<CBatteryEquippedEntity>(\\\"battery\\\"));\\n\\n m_pcBatteryEntity->Enable();\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Can't set robot for the battery default sensor\\\", ex);\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp\",\n \"rank\": 73,\n \"score\": 184903.8256227054\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/robots/generic/simulator/camera_default_sensor.cpp>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#include \\\"camera_default_sensor.h\\\"\\n\\n#include <argos3/core/simulator/simulator.h>\\n\\n#include <argos3/core/simulator/entity/composable_entity.h>\\n\\n#include <argos3/plugins/robots/generic/simulator/camera_sensor_algorithm.h>\\n\\n\\n\\nnamespace argos {\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CCameraDefaultSensor::CCameraDefaultSensor() :\\n\\n m_bShowFrustum(false),\\n\\n m_pcEmbodiedEntity(nullptr),\\n\\n m_pcControllableEntity(nullptr) {}\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.cpp\",\n \"rank\": 74,\n \"score\": 184902.3572131068\n },\n {\n \"content\": \" GetNodeAttributeOrDefault(t_tree, \\\"axis_noise_range\\\", m_cAxisNoiseRange, m_cAxisNoiseRange);\\n\\n if(m_cPosNoiseRange.GetSpan() != 0 ||\\n\\n m_cAngleNoiseRange.GetSpan() != CRadians::ZERO ||\\n\\n m_cAxisNoiseRange.GetSpan() != 0) {\\n\\n m_bAddNoise = true;\\n\\n m_pcRNG = CRandom::CreateRNG(\\\"argos\\\");\\n\\n }\\n\\n /* sensor is enabled by default */\\n\\n Enable();\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Initialization error in default positioning sensor\\\", ex);\\n\\n }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n \\n\\n void CPositioningDefaultSensor::Update() {\\n\\n /* sensor is disabled--nothing to do */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp\",\n \"rank\": 75,\n \"score\": 184902.15375475987\n },\n {\n \"content\": \"\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CLightDefaultSensor::CLightDefaultSensor() :\\n\\n m_bShowRays(false),\\n\\n m_pcRNG(nullptr),\\n\\n m_bAddNoise(false),\\n\\n m_cSpace(CSimulator::GetInstance().GetSpace()) {}\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CLightDefaultSensor::SetRobot(CComposableEntity& c_entity) {\\n\\n try {\\n\\n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\\\"controller\\\"));\\n\\n m_pcLightEntity = &(c_entity.GetComponent<CLightSensorEquippedEntity>(\\\"light_sensors\\\"));\\n\\n m_pcLightEntity->Enable();\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 76,\n \"score\": 184900.43476472795\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/differential_steering_default_sensor.h>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef DIFFERENTIAL_STEERING_DEFAULT_SENSOR_H\\n\\n#define DIFFERENTIAL_STEERING_DEFAULT_SENSOR_H\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/differential_steering_default_sensor.h\",\n \"rank\": 77,\n \"score\": 184898.7037618062\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/epuck_proximity_default_sensor.h>\\n\\n *\\n\\n * @author Danesh Tarapore - <daneshtarapore@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef EPUCK_PROXIMITY_DEFAULT_SENSOR_H\\n\\n#define EPUCK_PROXIMITY_DEFAULT_SENSOR_H\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h\",\n \"rank\": 78,\n \"score\": 184898.7037618062\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CBatteryDefaultSensor::Init(TConfigurationNode& t_tree) {\\n\\n try {\\n\\n /* Execute standard logic */\\n\\n CCI_BatterySensor::Init(t_tree);\\n\\n /* Parse noise range */\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"noise_range\\\", m_cNoiseRange, m_cNoiseRange);\\n\\n if(m_cNoiseRange.GetSpan() != 0) {\\n\\n m_bAddNoise = true;\\n\\n m_pcRNG = CRandom::CreateRNG(\\\"argos\\\");\\n\\n }\\n\\n }\\n\\n catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Initialization error in default battery sensor\\\", ex);\\n\\n }\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp\",\n \"rank\": 79,\n \"score\": 184897.44657918456\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/positioning_default_sensor.cpp>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#include <argos3/core/simulator/simulator.h>\\n\\n#include <argos3/core/simulator/entity/embodied_entity.h>\\n\\n#include <argos3/core/simulator/entity/composable_entity.h>\\n\\n\\n\\n#include \\\"positioning_default_sensor.h\\\"\\n\\n\\n\\nnamespace argos {\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CPositioningDefaultSensor::CPositioningDefaultSensor() :\\n\\n m_pcEmbodiedEntity(nullptr),\\n\\n m_pcRNG(nullptr),\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp\",\n \"rank\": 80,\n \"score\": 184897.4352676829\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/robots/prototype/simulator/prototype_joints_default_sensor.cpp>\\n\\n *\\n\\n * @author Michael Allwright - <allsey87@gmail.com>\\n\\n */\\n\\n\\n\\n#ifndef PROTOTYPE_JOINTS_DEFAULT_SENSOR_H\\n\\n#define PROTOTYPE_JOINTS_DEFAULT_SENSOR_H\\n\\n\\n\\nnamespace argos {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/prototype/simulator/prototype_joints_default_sensor.h\",\n \"rank\": 81,\n \"score\": 184897.2507024365\n },\n {\n \"content\": \" catch(CARGoSException& ex) {\\n\\n THROW_ARGOSEXCEPTION_NESTED(\\\"Can't set robot for the proximity default sensor\\\", ex);\\n\\n }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CProximityDefaultSensor::Init(TConfigurationNode& t_tree) {\\n\\n try {\\n\\n CCI_ProximitySensor::Init(t_tree);\\n\\n /* Show rays? */\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"show_rays\\\", m_bShowRays, m_bShowRays);\\n\\n /* Parse noise level */\\n\\n Real fNoiseLevel = 0.0f;\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"noise_level\\\", fNoiseLevel, fNoiseLevel);\\n\\n if(fNoiseLevel < 0.0f) {\\n\\n THROW_ARGOSEXCEPTION(\\\"Can't specify a negative value for the noise level of the proximity sensor\\\");\\n\\n }\\n\\n else if(fNoiseLevel > 0.0f) {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp\",\n \"rank\": 82,\n \"score\": 184896.65782760558\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/proximity_default_sensor.cpp>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#include <argos3/core/simulator/simulator.h>\\n\\n#include <argos3/core/simulator/entity/embodied_entity.h>\\n\\n#include <argos3/core/simulator/entity/composable_entity.h>\\n\\n#include <argos3/plugins/simulator/entities/proximity_sensor_equipped_entity.h>\\n\\n\\n\\n#include \\\"proximity_default_sensor.h\\\"\\n\\n\\n\\nnamespace argos {\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n static CRange<Real> UNIT(0.0f, 1.0f);\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp\",\n \"rank\": 83,\n \"score\": 184896.25611726003\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/battery_default_sensor.cpp>\\n\\n *\\n\\n * @author Adhavan Jayabalan <jadhu94@gmail.com>\\n\\n */\\n\\n\\n\\n#include <argos3/core/simulator/simulator.h>\\n\\n#include <argos3/core/simulator/entity/embodied_entity.h>\\n\\n#include <argos3/core/simulator/entity/composable_entity.h>\\n\\n#include <argos3/plugins/simulator/entities/battery_equipped_entity.h>\\n\\n\\n\\n#include \\\"battery_default_sensor.h\\\"\\n\\n\\n\\nnamespace argos {\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n static CRange<Real> UNIT(0.0f, 1.0f);\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp\",\n \"rank\": 84,\n \"score\": 184895.90000734595\n },\n {\n \"content\": \"/**\\n\\n * @file <argos3/plugins/simulator/sensors/light_default_sensor.cpp>\\n\\n *\\n\\n * @author Carlo Pinciroli - <ilpincy@gmail.com>\\n\\n */\\n\\n\\n\\n#include <argos3/core/simulator/simulator.h>\\n\\n#include <argos3/core/simulator/entity/embodied_entity.h>\\n\\n#include <argos3/core/simulator/entity/composable_entity.h>\\n\\n#include <argos3/plugins/simulator/entities/light_entity.h>\\n\\n#include <argos3/plugins/simulator/entities/light_sensor_equipped_entity.h>\\n\\n\\n\\n#include \\\"light_default_sensor.h\\\"\\n\\n\\n\\nnamespace argos {\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n static CRange<Real> UNIT(0.0f, 1.0f);\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 85,\n \"score\": 184895.61924081508\n },\n {\n \"content\": \" THROW_ARGOSEXCEPTION_NESTED(\\\"Can't set robot for the light default sensor\\\", ex);\\n\\n }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CLightDefaultSensor::Init(TConfigurationNode& t_tree) {\\n\\n try {\\n\\n CCI_LightSensor::Init(t_tree);\\n\\n /* Show rays? */\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"show_rays\\\", m_bShowRays, m_bShowRays);\\n\\n /* Parse noise level */\\n\\n Real fNoiseLevel = 0.0f;\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"noise_level\\\", fNoiseLevel, fNoiseLevel);\\n\\n if(fNoiseLevel < 0.0f) {\\n\\n THROW_ARGOSEXCEPTION(\\\"Can't specify a negative value for the noise level of the light sensor\\\");\\n\\n }\\n\\n else if(fNoiseLevel > 0.0f) {\\n\\n m_bAddNoise = true;\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 86,\n \"score\": 184895.33068992328\n },\n {\n \"content\": \" /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n CProximityDefaultSensor::CProximityDefaultSensor() :\\n\\n m_pcEmbodiedEntity(nullptr),\\n\\n m_bShowRays(false),\\n\\n m_pcRNG(nullptr),\\n\\n m_bAddNoise(false),\\n\\n m_cSpace(CSimulator::GetInstance().GetSpace()) {}\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CProximityDefaultSensor::SetRobot(CComposableEntity& c_entity) {\\n\\n try {\\n\\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\\\"body\\\"));\\n\\n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\\\"controller\\\"));\\n\\n m_pcProximityEntity = &(c_entity.GetComponent<CProximitySensorEquippedEntity>(\\\"proximity_sensors\\\"));\\n\\n m_pcProximityEntity->Enable();\\n\\n }\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp\",\n \"rank\": 87,\n \"score\": 184895.1622686897\n },\n {\n \"content\": \" /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CPositioningDefaultSensor::Reset() {\\n\\n m_sReading.Position = m_pcEmbodiedEntity->GetOriginAnchor().Position;\\n\\n m_sReading.Orientation = m_pcEmbodiedEntity->GetOriginAnchor().Orientation;\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n REGISTER_SENSOR(CPositioningDefaultSensor,\\n\\n \\\"positioning\\\", \\\"default\\\",\\n\\n \\\"Carlo Pinciroli [ilpincy@gmail.com]\\\",\\n\\n \\\"1.0\\\",\\n\\n \\\"A generic positioning sensor.\\\",\\n\\n\\n\\n \\\"This sensor returns the current position and orientation of a robot. This sensor\\\\n\\\"\\n\\n \\\"can be used with any robot, since it accesses only the body component. In\\\\n\\\"\\n\\n \\\"controllers, you must include the ci_positioning_sensor.h header.\\\\n\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp\",\n \"rank\": 88,\n \"score\": 184894.48669048309\n },\n {\n \"content\": \"\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CCameraDefaultSensor::SetRobot(CComposableEntity& c_entity) {\\n\\n /* Get the embodied and controllable entities */\\n\\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\\\"body\\\"));\\n\\n m_pcControllableEntity = &(c_entity.GetComponent<CControllableEntity>(\\\"controller\\\"));\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CCameraDefaultSensor::Init(TConfigurationNode& t_tree) {\\n\\n try {\\n\\n /* Parent class init */\\n\\n CCI_CameraSensor::Init(t_tree);\\n\\n /* Show the frustums */\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"show_frustum\\\", m_bShowFrustum, m_bShowFrustum);\\n\\n /* For each camera */\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/camera_default_sensor.cpp\",\n \"rank\": 89,\n \"score\": 184893.12973967852\n },\n {\n \"content\": \" }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CBatteryDefaultSensor::Reset() {\\n\\n /* TODO */\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n REGISTER_SENSOR(CBatteryDefaultSensor,\\n\\n \\\"battery\\\", \\\"default\\\",\\n\\n \\\"Adhavan Jayabalan [jadhu94@gmail.com]\\\",\\n\\n \\\"1.0\\\",\\n\\n \\\"A generic battery level sensor.\\\",\\n\\n\\n\\n \\\"This sensor returns the current battery level of a robot. This sensor\\\\n\\\"\\n\\n \\\"can be used with any robot, since it accesses only the body component. In\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp\",\n \"rank\": 90,\n \"score\": 184892.66537863284\n },\n {\n \"content\": \" /* sensor is enabled by default */\\n\\n Enable();\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CBatteryDefaultSensor::Update() {\\n\\n /* sensor is disabled--nothing to do */\\n\\n if (IsDisabled()) {\\n\\n return;\\n\\n }\\n\\n /* Save old charge value (used later for time left estimation) */\\n\\n Real fOldCharge = m_sReading.AvailableCharge;\\n\\n /* Update available charge as seen by the robot */\\n\\n m_sReading.AvailableCharge =\\n\\n m_pcBatteryEntity->GetAvailableCharge() /\\n\\n m_pcBatteryEntity->GetFullCharge();\\n\\n /* Add noise */\\n\\n if(m_bAddNoise) {\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp\",\n \"rank\": 91,\n \"score\": 184892.63450650347\n },\n {\n \"content\": \"\\n\\n void CProximityDefaultSensor::Reset() {\\n\\n for(UInt32 i = 0; i < GetReadings().size(); ++i) {\\n\\n m_tReadings[i].val = 0.0f;\\n\\n m_tReadings[i].isRobot = false;\\n\\n }\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n Real CProximityDefaultSensor::CalculateReading(Real f_distance) {\\n\\n // CHANGED FROM ORIGINAL FOOTBOT CODE\\n\\n return f_distance;\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n REGISTER_SENSOR(CProximityDefaultSensor,\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp\",\n \"rank\": 92,\n \"score\": 184891.5401246428\n },\n {\n \"content\": \" m_bAddNoise(false) {}\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CPositioningDefaultSensor::SetRobot(CComposableEntity& c_entity) {\\n\\n m_pcEmbodiedEntity = &(c_entity.GetComponent<CEmbodiedEntity>(\\\"body\\\"));\\n\\n m_sReading.Position = m_pcEmbodiedEntity->GetOriginAnchor().Position;\\n\\n m_sReading.Orientation = m_pcEmbodiedEntity->GetOriginAnchor().Orientation;\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n void CPositioningDefaultSensor::Init(TConfigurationNode& t_tree) {\\n\\n try {\\n\\n CCI_PositioningSensor::Init(t_tree);\\n\\n /* Parse noise range */\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"pos_noise_range\\\", m_cPosNoiseRange, m_cPosNoiseRange);\\n\\n GetNodeAttributeOrDefault(t_tree, \\\"angle_noise_range\\\", m_cAngleNoiseRange, m_cAngleNoiseRange);\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/positioning_default_sensor.cpp\",\n \"rank\": 93,\n \"score\": 184891.27105636874\n },\n {\n \"content\": \" \\\"proximity\\\", \\\"default\\\",\\n\\n \\\"Carlo Pinciroli [ilpincy@gmail.com]\\\",\\n\\n \\\"1.0\\\",\\n\\n \\\"A generic proximity sensor.\\\",\\n\\n\\n\\n \\\"This sensor accesses a set of proximity sensors. The sensors all return a value\\\\n\\\"\\n\\n \\\"between 0 and 1, where 0 means nothing within range and 1 means an external\\\\n\\\"\\n\\n \\\"object is touching the sensor. Values between 0 and 1 depend on the distance of\\\\n\\\"\\n\\n \\\"the occluding object, and are calculated as value=exp(-distance). In\\\\n\\\"\\n\\n \\\"controllers, you must include the ci_proximity_sensor.h header.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"This sensor is enabled by default.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"REQUIRED XML CONFIGURATION\\\\n\\\\n\\\"\\n\\n\\n\\n \\\" <controllers>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <my_controller ...>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <sensors>\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/proximity_default_sensor.cpp\",\n \"rank\": 94,\n \"score\": 184888.461969895\n },\n {\n \"content\": \" \\\"the perceived light. Each reading R is calculated with R=(I/x)^2, where x is the\\\\n\\\"\\n\\n \\\"distance between a sensor and the light, and I is the reference intensity of the\\\\n\\\"\\n\\n \\\"perceived light. The reference intensity corresponds to the minimum distance at\\\\n\\\"\\n\\n \\\"which the light saturates a sensor. The reference intensity depends on the\\\\n\\\"\\n\\n \\\"individual light, and it is set with the \\\\\\\"intensity\\\\\\\" attribute of the light\\\\n\\\"\\n\\n \\\"entity. In case multiple lights are present in the environment, each sensor\\\\n\\\"\\n\\n \\\"reading is calculated as the sum of the individual readings due to each light.\\\\n\\\"\\n\\n \\\"In other words, light wave interference is not taken into account. In\\\\n\\\"\\n\\n \\\"controllers, you must include the ci_light_sensor.h header.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"This sensor is enabled by default.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"REQUIRED XML CONFIGURATION\\\\n\\\\n\\\"\\n\\n \\\" <controllers>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <my_controller ...>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <sensors>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <light implementation=\\\\\\\"default\\\\\\\" />\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 95,\n \"score\": 184886.0881221864\n },\n {\n \"content\": \" \\\"controllers, you must include the ci_battery_sensor.h header.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"This sensor is enabled by default.\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"REQUIRED XML CONFIGURATION\\\\n\\\\n\\\"\\n\\n \\\" <controllers>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <my_controller ...>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <sensors>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <battery implementation=\\\\\\\"default\\\\\\\" />\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </sensors>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </my_controller>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </controllers>\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"OPTIONAL XML CONFIGURATION\\\\n\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/battery_default_sensor.cpp\",\n \"rank\": 96,\n \"score\": 184885.69489521778\n },\n {\n \"content\": \" \\\" <sensors>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" <light implementation=\\\\\\\"default\\\\\\\"\\\\n\\\"\\n\\n \\\" noise_level=\\\\\\\"0.1\\\\\\\" />\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </sensors>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </my_controller>\\\\n\\\"\\n\\n \\\" ...\\\\n\\\"\\n\\n \\\" </controllers>\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"OPTIMIZATION HINTS\\\\n\\\\n\\\"\\n\\n\\n\\n \\\"1. For small swarms, enabling the light sensor (and therefore causing ARGoS to\\\\n\\\"\\n\\n \\\" update its readings each timestep) unconditionally does not impact performance too\\\\n\\\"\\n\\n \\\" much. For large swarms, it can impact performance, and selectively\\\\n\\\"\\n\\n \\\" enabling/disabling the light sensor according to when each individual robot needs it\\\\n\\\"\\n\\n \\\" (e.g., only when it is returning to the nest from foraging) can increase performance\\\\n\\\"\\n\\n \\\" by only requiring ARGoS to update the readings for a robot on the timesteps will be\\\\n\\\"\\n\\n \\\" used.\\\\n\\\",\\n\\n\\n\\n \\\"Usable\\\"\\n\\n\\t\\t );\\n\\n\\n\\n}\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 97,\n \"score\": 184885.44623256396\n },\n {\n \"content\": \"\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n Real CLightDefaultSensor::CalculateReading(Real f_distance, Real f_intensity) {\\n\\n return (f_intensity * f_intensity) / (f_distance * f_distance);\\n\\n }\\n\\n\\n\\n /****************************************/\\n\\n /****************************************/\\n\\n\\n\\n REGISTER_SENSOR(CLightDefaultSensor,\\n\\n \\\"light\\\", \\\"default\\\",\\n\\n \\\"Carlo Pinciroli [ilpincy@gmail.com]\\\",\\n\\n \\\"1.0\\\",\\n\\n \\\"A generic light sensor.\\\",\\n\\n\\n\\n \\\"This sensor accesses a set of light sensors. The sensors all return a value\\\\n\\\"\\n\\n \\\"between 0 and 1, where 0 means nothing within range and 1 means the perceived\\\\n\\\"\\n\\n \\\"light saturates the sensor. Values between 0 and 1 depend on the distance of\\\\n\\\"\\n\",\n \"file_path\": \"argos3/src/plugins/robots/generic/simulator/light_default_sensor.cpp\",\n \"rank\": 98,\n \"score\": 184885.4076339252\n },\n {\n \"content\": \" * @returns A value in the range [0:1], where 0 means that the object is too far to be sensed, and 1 means the object is so close that it saturates the sensor.\\n\\n */\\n\\n virtual Real CalculateReading(Real f_distance);\\n\\n\\n\\n /**\\n\\n * Returns true if the rays must be shown in the GUI.\\n\\n * @return true if the rays must be shown in the GUI.\\n\\n */\\n\\n inline bool IsShowRays() {\\n\\n return m_bShowRays;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Sets whether or not the rays must be shown in the GUI.\\n\\n * @param b_show_rays true if the rays must be shown, false otherwise\\n\\n */\\n\\n inline void SetShowRays(bool b_show_rays) {\\n\\n m_bShowRays = b_show_rays;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"argos3/src/plugins/robots/e-puck/simulator/epuck_proximity_default_sensor.h\",\n \"rank\": 99,\n \"score\": 184884.96844036411\n }\n]","isConversational":false}}},{"rowIdx":88,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Studio/src/Application/Groom/GroomTool.cc"},"repo_name":{"kind":"string","value":"amylenz/ShapeWorks"},"commit":{"kind":"string","value":"78c2ee067a23e31f5b83d0121e60addb1b0bf462"},"file_code":{"kind":"string","value":"#include <iostream>\n\n#include <QXmlStreamWriter>\n#include <QTemporaryFile>\n#include <QFileDialog>\n#include <QMessageBox>\n#include <QThread>\n\n#include <Groom/GroomTool.h>\n#include <Visualization/ShapeworksWorker.h>\n#include <Data/Project.h>\n#include <Data/Mesh.h>\n#include <Data/Shape.h>\n\n#include <ui_GroomTool.h>\n\nGroomTool::GroomTool(Preferences& prefs, std::vector<std::string>& files)\n : preferences_(prefs), files_(files)\n{\n this->ui_ = new Ui_GroomTool;\n this->ui_->setupUi(this);\n qRegisterMetaType<std::string>();\n}\n\nGroomTool::~GroomTool()\n{}\n\nvoid GroomTool::on_antialias_checkbox_stateChanged(int state)\n{\n this->ui_->antialias_groupbox->setEnabled(state);\n}\n\nvoid GroomTool::on_blur_checkbox_stateChanged(int state)\n{\n this->ui_->blur_groupbox->setEnabled(state);\n}\n\nvoid GroomTool::on_autopad_checkbox_stateChanged(int state)\n{\n this->ui_->pad_groupbox->setEnabled(state);\n}\n\nvoid GroomTool::handle_error(std::string msg)\n{\n emit error_message(msg);\n this->ui_->run_groom_button->setEnabled(true);\n this->ui_->skipButton->setEnabled(true);\n}\n\nvoid GroomTool::handle_progress(int val)\n{\n emit progress(static_cast<size_t>(val));\n}\n\nvoid GroomTool::on_restoreDefaults_clicked()\n{\n this->preferences_.delete_entry(\"groom_center\");\n this->preferences_.delete_entry(\"groom_antialias\");\n this->preferences_.delete_entry(\"groom_pad\");\n this->preferences_.delete_entry(\"groom_fastmarching\");\n this->preferences_.delete_entry(\"groom_blur\");\n this->preferences_.delete_entry(\"groom_isolate\");\n this->preferences_.delete_entry(\"groom_antialias_amount\");\n this->preferences_.delete_entry(\"groom_fill_holes\");\n this->preferences_.delete_entry(\"groom_blur_sigma\");\n this->preferences_.delete_entry(\"groom_pad_value\");\n this->preferences_.restore_defaults();\n this->set_preferences();\n qApp->processEvents();\n this->preferences_.set_saved(false);\n}\n\nvoid GroomTool::set_preferences()\n{\n this->ui_->center_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_center\", this->ui_->center_checkbox->isChecked()));\n this->ui_->antialias_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_antialias\",\n this->ui_->antialias_checkbox->isChecked()));\n this->ui_->autopad_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_pad\", this->ui_->autopad_checkbox->isChecked()));\n this->ui_->fastmarching_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_fastmarching\",\n this->ui_->fastmarching_checkbox->isChecked()));\n this->ui_->blur_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_blur\", this->ui_->blur_checkbox->isChecked()));\n this->ui_->isolate_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_isolate\", this->ui_->isolate_checkbox->isChecked()));\n this->ui_->fill_holes_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_fill_holes\",\n this->ui_->fill_holes_checkbox->isChecked()));\n this->ui_->antialias_iterations->setValue(\n this->preferences_.get_preference(\"groom_antialias_amount\",\n this->ui_->antialias_iterations->value()));\n this->ui_->blur_sigma->setValue(\n this->preferences_.get_preference(\"groom_blur_sigma\", this->ui_->blur_sigma->value()));\n this->ui_->padding_amount->setValue(\n this->preferences_.get_preference(\"groom_pad_value\", this->ui_->padding_amount->value()));\n}\n\nvoid GroomTool::disableActions()\n{\n this->ui_->skipButton->setEnabled(false);\n this->ui_->run_groom_button->setEnabled(false);\n}\n\nvoid GroomTool::enableActions()\n{\n this->ui_->skipButton->setEnabled(true);\n this->ui_->run_groom_button->setEnabled(true);\n}\n\nvoid GroomTool::update_preferences()\n{\n this->preferences_.set_preference(\"groom_center\", this->ui_->center_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_antialias\", this->ui_->antialias_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_pad\", this->ui_->autopad_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_fastmarching\",\n this->ui_->fastmarching_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_blur\", this->ui_->blur_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_isolate\", this->ui_->isolate_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_fill_holes\",\n this->ui_->fill_holes_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_antialias_amount\",\n this->ui_->antialias_iterations->value());\n this->preferences_.set_preference(\"groom_blur_sigma\", this->ui_->blur_sigma->value());\n this->preferences_.set_preference(\"groom_pad_value\", this->ui_->padding_amount->value());\n}\n\nvoid GroomTool::on_run_groom_button_clicked()\n{\n this->update_preferences();\n emit message(\"Please wait: running groom step...\");\n emit progress(5);\n auto shapes = this->project_->get_shapes();\n std::vector<ImageType::Pointer> imgs;\n for (auto s : shapes) {\n imgs.push_back(s->get_original_image());\n }\n this->groom_ = new QGroom(this, imgs, 0., 1.,\n this->ui_->blur_sigma->value(),\n this->ui_->padding_amount->value(),\n this->ui_->antialias_iterations->value(),\n true);\n\n emit progress(15);\n if (this->ui_->center_checkbox->isChecked()) {\n this->groom_->queueTool(\"center\");\n }\n if (this->ui_->isolate_checkbox->isChecked()) {\n this->groom_->queueTool(\"isolate\");\n }\n if (this->ui_->fill_holes_checkbox->isChecked()) {\n this->groom_->queueTool(\"hole_fill\");\n }\n if (this->ui_->autopad_checkbox->isChecked()) {\n this->groom_->queueTool(\"auto_pad\");\n }\n if (this->ui_->antialias_checkbox->isChecked()) {\n this->groom_->queueTool(\"antialias\");\n }\n if (this->ui_->fastmarching_checkbox->isChecked()) {\n this->groom_->queueTool(\"fastmarching\");\n }\n if (this->ui_->blur_checkbox->isChecked()) {\n this->groom_->queueTool(\"blur\");\n }\n emit progress(10);\n this->ui_->run_groom_button->setEnabled(false);\n this->ui_->skipButton->setEnabled(false);\n QThread* thread = new QThread;\n ShapeworksWorker* worker = new ShapeworksWorker(\n ShapeworksWorker::GroomType, this->groom_, nullptr, this->project_);\n worker->moveToThread(thread);\n connect(thread, SIGNAL(started()), worker, SLOT(process()));\n connect(worker, SIGNAL(result_ready()), this, SLOT(handle_thread_complete()));\n connect(this->groom_, SIGNAL(progress(int)), this, SLOT(handle_progress(int)));\n connect(worker, SIGNAL(error_message(std::string)), this, SLOT(handle_error(std::string)));\n connect(worker, SIGNAL(finished()), worker, SLOT(deleteLater()));\n thread->start();\n}\n\nvoid GroomTool::handle_thread_complete()\n{\n emit progress(95);\n this->project_->load_groomed_images(this->groom_->getImages(),\n this->ui_->fastmarching_checkbox->isChecked() ? 0. : 0.5);\n emit progress(100);\n emit message(\"Groom Complete\");\n emit groom_complete();\n this->ui_->run_groom_button->setEnabled(true);\n this->ui_->skipButton->setEnabled(true);\n}\n\nvoid GroomTool::set_project(QSharedPointer<Project> project)\n{\n this->project_ = project;\n}\n\nvoid GroomTool::on_skipButton_clicked()\n{\n this->update_preferences();\n auto shapes = this->project_->get_shapes();\n std::vector<ImageType::Pointer> imgs;\n for (auto s : shapes) {\n imgs.push_back(s->get_original_image());\n }\n this->project_->load_groomed_images(imgs, 0.);\n emit message(\"Skipped groom.\");\n emit groom_complete();\n}\n"},"prefix":{"kind":"string","value":"#include <iostream>\n\n#include <QXmlStreamWriter>\n#include <QTemporaryFile>\n#include <QFileDialog>\n#include <QMessageBox>\n#include <QThread>\n\n#include <Groom/GroomTool.h>\n#include <Visualization/ShapeworksWorker.h>\n#include <Data/Project.h>\n#include <Data/Mesh.h>\n#include <Data/Shape.h>\n\n#include <ui_GroomTool.h>\n\n"},"suffix":{"kind":"string","value":"\n\nGroomTool::~GroomTool()\n{}\n\nvoid GroomTool::on_antialias_checkbox_stateChanged(int state)\n{\n this->ui_->antialias_groupbox->setEnabled(state);\n}\n\nvoid GroomTool::on_blur_checkbox_stateChanged(int state)\n{\n this->ui_->blur_groupbox->setEnabled(state);\n}\n\nvoid GroomTool::on_autopad_checkbox_stateChanged(int state)\n{\n this->ui_->pad_groupbox->setEnabled(state);\n}\n\nvoid GroomTool::handle_error(std::string msg)\n{\n emit error_message(msg);\n this->ui_->run_groom_button->setEnabled(true);\n this->ui_->skipButton->setEnabled(true);\n}\n\nvoid GroomTool::handle_progress(int val)\n{\n emit progress(static_cast<size_t>(val));\n}\n\nvoid GroomTool::on_restoreDefaults_clicked()\n{\n this->preferences_.delete_entry(\"groom_center\");\n this->preferences_.delete_entry(\"groom_antialias\");\n this->preferences_.delete_entry(\"groom_pad\");\n this->preferences_.delete_entry(\"groom_fastmarching\");\n this->preferences_.delete_entry(\"groom_blur\");\n this->preferences_.delete_entry(\"groom_isolate\");\n this->preferences_.delete_entry(\"groom_antialias_amount\");\n this->preferences_.delete_entry(\"groom_fill_holes\");\n this->preferences_.delete_entry(\"groom_blur_sigma\");\n this->preferences_.delete_entry(\"groom_pad_value\");\n this->preferences_.restore_defaults();\n this->set_preferences();\n qApp->processEvents();\n this->preferences_.set_saved(false);\n}\n\nvoid GroomTool::set_preferences()\n{\n this->ui_->center_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_center\", this->ui_->center_checkbox->isChecked()));\n this->ui_->antialias_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_antialias\",\n this->ui_->antialias_checkbox->isChecked()));\n this->ui_->autopad_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_pad\", this->ui_->autopad_checkbox->isChecked()));\n this->ui_->fastmarching_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_fastmarching\",\n this->ui_->fastmarching_checkbox->isChecked()));\n this->ui_->blur_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_blur\", this->ui_->blur_checkbox->isChecked()));\n this->ui_->isolate_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_isolate\", this->ui_->isolate_checkbox->isChecked()));\n this->ui_->fill_holes_checkbox->setChecked(\n this->preferences_.get_preference(\"groom_fill_holes\",\n this->ui_->fill_holes_checkbox->isChecked()));\n this->ui_->antialias_iterations->setValue(\n this->preferences_.get_preference(\"groom_antialias_amount\",\n this->ui_->antialias_iterations->value()));\n this->ui_->blur_sigma->setValue(\n this->preferences_.get_preference(\"groom_blur_sigma\", this->ui_->blur_sigma->value()));\n this->ui_->padding_amount->setValue(\n this->preferences_.get_preference(\"groom_pad_value\", this->ui_->padding_amount->value()));\n}\n\nvoid GroomTool::disableActions()\n{\n this->ui_->skipButton->setEnabled(false);\n this->ui_->run_groom_button->setEnabled(false);\n}\n\nvoid GroomTool::enableActions()\n{\n this->ui_->skipButton->setEnabled(true);\n this->ui_->run_groom_button->setEnabled(true);\n}\n\nvoid GroomTool::update_preferences()\n{\n this->preferences_.set_preference(\"groom_center\", this->ui_->center_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_antialias\", this->ui_->antialias_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_pad\", this->ui_->autopad_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_fastmarching\",\n this->ui_->fastmarching_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_blur\", this->ui_->blur_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_isolate\", this->ui_->isolate_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_fill_holes\",\n this->ui_->fill_holes_checkbox->isChecked());\n this->preferences_.set_preference(\"groom_antialias_amount\",\n this->ui_->antialias_iterations->value());\n this->preferences_.set_preference(\"groom_blur_sigma\", this->ui_->blur_sigma->value());\n this->preferences_.set_preference(\"groom_pad_value\", this->ui_->padding_amount->value());\n}\n\nvoid GroomTool::on_run_groom_button_clicked()\n{\n this->update_preferences();\n emit message(\"Please wait: running groom step...\");\n emit progress(5);\n auto shapes = this->project_->get_shapes();\n std::vector<ImageType::Pointer> imgs;\n for (auto s : shapes) {\n imgs.push_back(s->get_original_image());\n }\n this->groom_ = new QGroom(this, imgs, 0., 1.,\n this->ui_->blur_sigma->value(),\n this->ui_->padding_amount->value(),\n this->ui_->antialias_iterations->value(),\n true);\n\n emit progress(15);\n if (this->ui_->center_checkbox->isChecked()) {\n this->groom_->queueTool(\"center\");\n }\n if (this->ui_->isolate_checkbox->isChecked()) {\n this->groom_->queueTool(\"isolate\");\n }\n if (this->ui_->fill_holes_checkbox->isChecked()) {\n this->groom_->queueTool(\"hole_fill\");\n }\n if (this->ui_->autopad_checkbox->isChecked()) {\n this->groom_->queueTool(\"auto_pad\");\n }\n if (this->ui_->antialias_checkbox->isChecked()) {\n this->groom_->queueTool(\"antialias\");\n }\n if (this->ui_->fastmarching_checkbox->isChecked()) {\n this->groom_->queueTool(\"fastmarching\");\n }\n if (this->ui_->blur_checkbox->isChecked()) {\n this->groom_->queueTool(\"blur\");\n }\n emit progress(10);\n this->ui_->run_groom_button->setEnabled(false);\n this->ui_->skipButton->setEnabled(false);\n QThread* thread = new QThread;\n ShapeworksWorker* worker = new ShapeworksWorker(\n ShapeworksWorker::GroomType, this->groom_, nullptr, this->project_);\n worker->moveToThread(thread);\n connect(thread, SIGNAL(started()), worker, SLOT(process()));\n connect(worker, SIGNAL(result_ready()), this, SLOT(handle_thread_complete()));\n connect(this->groom_, SIGNAL(progress(int)), this, SLOT(handle_progress(int)));\n connect(worker, SIGNAL(error_message(std::string)), this, SLOT(handle_error(std::string)));\n connect(worker, SIGNAL(finished()), worker, SLOT(deleteLater()));\n thread->start();\n}\n\nvoid GroomTool::handle_thread_complete()\n{\n emit progress(95);\n this->project_->load_groomed_images(this->groom_->getImages(),\n this->ui_->fastmarching_checkbox->isChecked() ? 0. : 0.5);\n emit progress(100);\n emit message(\"Groom Complete\");\n emit groom_complete();\n this->ui_->run_groom_button->setEnabled(true);\n this->ui_->skipButton->setEnabled(true);\n}\n\nvoid GroomTool::set_project(QSharedPointer<Project> project)\n{\n this->project_ = project;\n}\n\nvoid GroomTool::on_skipButton_clicked()\n{\n this->update_preferences();\n auto shapes = this->project_->get_shapes();\n std::vector<ImageType::Pointer> imgs;\n for (auto s : shapes) {\n imgs.push_back(s->get_original_image());\n }\n this->project_->load_groomed_images(imgs, 0.);\n emit message(\"Skipped groom.\");\n emit groom_complete();\n}\n"},"middle":{"kind":"string","value":"GroomTool::GroomTool(Preferences& prefs, std::vector<std::string>& files)\n : preferences_(prefs), files_(files)\n{\n this->ui_ = new Ui_GroomTool;\n this->ui_->setupUi(this);\n qRegisterMetaType<std::string>();\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"// Constrained Delaunay Triangulation types\n\n#include <CGAL/Constrained_Delaunay_triangulation_2.h>\n\n#include <CGAL/Constrained_triangulation_plus_2.h>\n\n\n\n// Axis-align boxes for all-pairs self-intersection detection\n\n#include <CGAL/point_generators_3.h>\n\n#include <CGAL/Bbox_3.h>\n\n#include <CGAL/box_intersection_d.h>\n\n#include <CGAL/function_objects.h>\n\n#include <CGAL/Join_input_iterator.h>\n\n#include <CGAL/algorithm.h>\n\n#include <vector>\n\n\n\n// Axis-aligned bounding box tree for tet tri intersection\n\n#include <CGAL/AABB_tree.h>\n\n#include <CGAL/AABB_traits.h>\n\n#include <CGAL/AABB_triangle_primitive.h>\n\n\n\n// Boolean operations\n\n#include <CGAL/Polyhedron_3.h>\n","file_path":"Post/source/ShapeWorksPost-V1/include/igl/copyleft/cgal/CGAL_includes.hpp","rank":0,"score":73865.9029288347},{"content":"// Is this actually used?\n\n//#include <CGAL/Nef_polyhedron_3.h>\n\n\n\n// Delaunay Triangulation in 3D\n\n#include <CGAL/Delaunay_triangulation_3.h>\n\n\n\n#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>\n\n#include <CGAL/Exact_predicates_exact_constructions_kernel.h>\n\n\n\n#endif\n","file_path":"Post/source/ShapeWorksPost-V1/include/igl/copyleft/cgal/CGAL_includes.hpp","rank":1,"score":73865.38533171169},{"content":"// This file is part of libigl, a simple c++ geometry processing library.\n\n// \n\n// Copyright (C) 2014 Alec Jacobson <alecjacobson@gmail.com>\n\n// \n\n// This Source Code Form is subject to the terms of the Mozilla Public License \n\n// v. 2.0. If a copy of the MPL was not distributed with this file, You can \n\n// obtain one at http://mozilla.org/MPL/2.0/.\n\n#ifndef IGL_CGAL_INCLUDES_H\n\n#define IGL_CGAL_INCLUDES_H\n\n\n\n// This causes unknown bugs during intersection meshing:\n\n//// http://www.alecjacobson.com/weblog/?p=4291\n\n//#define CGAL_INTERSECTION_VERSION 1\n\n// Use this instead to mute errors resulting from bad CGAL assertions\n\n#define CGAL_KERNEL_NO_ASSERTIONS\n\n// Triangle triangle intersection\n\n#include <CGAL/intersections.h>\n\n// THIS CANNOT BE INCLUDED IN THE SAME FILE AS <CGAL/intersections.h>\n\n// #include <CGAL/Boolean_set_operations_2.h>\n\n\n","file_path":"Post/source/ShapeWorksPost-V1/include/igl/copyleft/cgal/CGAL_includes.hpp","rank":2,"score":73864.69994437615},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_ARB_shading_language_include;\n","file_path":"Post/source/ShapeWorksPost-V1/external/nanogui/ext/glew/include/GL/glew.h","rank":3,"score":68466.86863569455},{"content":"\n\nAlso defines the utility functions sqr, cube, sgn, fract, clamp, mix,\n\nstep, smoothstep, faceforward, reflect, and refract\n\n*/\n\n\n\n\n\n// Windows defines these as macros, which prevents us from using the\n\n// type-safe versions from std::, as well as interfering with method defns\n\n#undef min\n\n#undef max\n\n\n\n\n\n#include <cmath>\n\n#include <iostream>\n\n#include <algorithm>\n\nusing std::min;\n\nusing std::max;\n\nusing std::swap;\n\nusing std::sqrt;\n\n\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":4,"score":67340.98445279848},{"content":"#include \"Vec.h\"\n\n#include <cmath>\n\n#include <algorithm>\n\nusing std::fmod;\n\nusing std::floor;\n\nusing std::min;\n\nusing std::max;\n\n#ifndef M_PI\n\n# define M_PI 3.14159265358979323846\n\n#endif\n\n\n\n\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":5,"score":67336.53854041098},{"content":"#ifndef NOISE3D_H\n\n#define NOISE3D_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nnoise3d.h\n\nA class for 3-D noise functions, including white noise and 1/f noise\n\n*/\n\n\n\n#include <math.h>\n\n#include <algorithm>\n\n#include <vector>\n\nusing std::max;\n\nusing std::swap;\n\nusing std::vector;\n\n\n\n\n\n// Quick 'n dirty portable random number generator \n\nstatic inline float tinyrnd()\n\n{\n\n\tstatic unsigned trand = 0;\n\n\ttrand = 1664525u * trand + 1013904223u;\n\n\treturn (float) trand / 4294967296.0f;\n\n}\n\n\n\n\n","file_path":"ExternalLibs/trimesh2/include/noise3d.h","rank":6,"score":67336.35232051015},{"content":"/*\n\n * Copyright (c) 2013 University of Utah\n\n */\n\n\n\n#ifndef __map_H\n\n#define __map_H\n\n\n\n#include \"MapFilter.h\"\n\n#include \"ReduceFilter.h\"\n\n\n\nnamespace bambam\n\n{\n\n\n\n/**\n\n * map is an abstraction of mapping over threads to simplify (and restrict) things a bit.\n\n *\n\n * the passed in functor should have an \n\n * void operator()(TInputImage::ConstPointer in, const TOutputImage::RegionType & threadRegion)\n\n *\n\n * with the idea of updating out with the results of the map and the functor will hold any state information you need as you go.\n\n */\n\ntemplate<class TInputImage,\n","file_path":"ExternalLibs/trimesh2/include/map.h","rank":7,"score":67334.98907264895},{"content":"#ifndef BSPHERE_H\n\n#define BSPHERE_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nbsphere.h\n\nBounding sphere computation, based on the \"miniball\" package by\n\nBernd Gaertner, based on algorithms by Welzl and Gaertner. The\n\noriginal code is distributed under the GPL, and is available from\n\nhttp://www.inf.ethz.ch/personal/gaertner/miniball.html\n\nThe original copyright notice can be found at the end of this file.\n\n*/\n\n\n\n\n\n#include \"Vec.h\"\n\n#include <list>\n\n\n\n\n\n// Class for a basis of points supporting a bounding sphere\n\ntemplate<int D, class T>\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":8,"score":67334.98907264895},{"content":"\t\t\t\t// NOTE: scalar has to be the same type:\n\n\t\t\t\t// it won't work to do double * vec<float>\n\n\tv1 = min(v2,v3);\t// Componentwise min/max\n\n\tv1 = sin(v2);\t\t// Componentwise - all the usual functions...\n\n\tswap(v1,v2);\t\t// In-place swap\n\n\n\n\tv3 = v1 DOT v2;\t\t// Actually operator^\n\n\tv3 = v1 CROSS v2;\t// Actually operator%\n\n\n\n\tfloat f = v1[0];\t// Subscript\n\n\tfloat *fp = v1;\t\t// Implicit conversion to float *\n\n\n\n\tf = len(v1);\t\t// Length (also len2 == squared length)\n\n\tf = dist(p1, p2);\t// Distance (also dist2 == squared distance)\n\n\tnormalize(v1);\t\t// Normalize (i.e., make it unit length)\n\n\t\t\t\t// normalize(vec(0,0,0)) => vec(1,0,0)\n\n\tv1 = trinorm(p1,p2,p3); // Normal of triangle\n\n\n\n\tcout << v1 << endl;\t// iostream output in the form (1,2,3)\n\n\tcin >> v2;\t\t// iostream input using the same syntax\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":9,"score":67334.35299268759},{"content":"\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = x / v[i];\n\n\treturn result;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator / (const Vec<D,T> &v, const T &x)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = v[i] / x;\n\n\treturn result;\n\n}\n\n\n\n\n\n// iostream operators\n\ntemplate <int D, class T>\n\nstatic inline std::ostream &operator << (std::ostream &os, const Vec<D,T> &v)\n\n\n\n{\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":10,"score":67333.80448238988},{"content":"#ifndef COLOR_H\n\n#define COLOR_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nColor.h\n\nRandom class for encapsulating colors...\n\n\n\nDue to all the possible colorspace variants, here's the documentation of\n\nwhat is actually implemented:\n\n - CIE 1931 2-degree observer\n\n - D65 illuminant (including for CIELAB - it's not D50)\n\n - Rec. 709 primaries\n\n - Range of [0..1] for all spaces except CIELAB and hue in HSV\n\n - \"RGB\" means linear-scaled RGB with the above illuminant and primaries\n\n - HSV is single-hexcone, sRGB\n\n - Y'CbCr is JFIF-standard (Rec. 601 scaling, full excursion) starting from sRGB\n\n*/\n\n\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":11,"score":67333.32264172882},{"content":"#define DOT ^\n\n\n\n// Cross product - only in 3 dimensions\n\ntemplate <class T>\n\nstatic inline const Vec<3,T> operator % (const Vec<3,T> &v1, const Vec<3,T> &v2)\n\n{\n\n\treturn Vec<3,T>(v1[1]*v2[2] - v1[2]*v2[1],\n\n\t\t\tv1[2]*v2[0] - v1[0]*v2[2],\n\n\t\t\tv1[0]*v2[1] - v1[1]*v2[0]);\n\n}\n\n#define CROSS %\n\n\n\n\n\n// Component-wise equality and inequality (#include the usual caveats\n\n// about comparing floats for equality...)\n\ntemplate <int D, class T>\n\nstatic inline bool operator == (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tif (v1[i] != v2[i])\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":12,"score":67333.1851643283},{"content":"\t\t\treturn false;\n\n\treturn true;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline bool operator != (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tif (v1[i] != v2[i])\n\n\t\t\treturn true;\n\n\treturn false;\n\n}\n\n\n\n\n\n// Unary operators\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> &operator + (const Vec<D,T> &v)\n\n{\n\n\treturn v;\n\n}\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":13,"score":67328.55996081686},{"content":" { \\\n\n\tVec<D,T> result(VEC_UNINITIALIZED); \\\n\n\tfor (int i = 0; i < D; i++) \\\n\n\t\tresult[i] = name(v[i]); \\\n\n\treturn result; \\\n\n }\n\n\n\n#define VEC_DECLARE_TWOARG(name) \\\n\n template <int D, class T> \\\n\n static inline Vec<D,T> name(const Vec<D,T> &v, const T &w) \\\n\n { \\\n\n\tVec<D,T> result(VEC_UNINITIALIZED); \\\n\n\tfor (int i = 0; i < D; i++) \\\n\n\t\tresult[i] = name(v[i], w); \\\n\n\treturn result; \\\n\n } \\\n\n template <int D, class T> \\\n\n static inline Vec<D,T> name(const Vec<D,T> &v, const Vec<D,T> &w) \\\n\n { \\\n\n\tVec<D,T> result(VEC_UNINITIALIZED); \\\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":14,"score":67328.55996081686},{"content":"\n\n// Let gcc optimize conditional branches a bit better...\n\n#ifndef likely\n\n# if !defined(__GNUC__) || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)\n\n# define likely(x) (x)\n\n# define unlikely(x) (x)\n\n# else\n\n# define likely(x) (__builtin_expect((x), 1))\n\n# define unlikely(x) (__builtin_expect((x), 0))\n\n# endif\n\n#endif\n\n\n\n\n\n// Boost-like compile-time assertion checking\n\ntemplate <bool X> struct VEC_STATIC_ASSERTION_FAILURE;\n\ntemplate <> struct VEC_STATIC_ASSERTION_FAILURE<true>\n\n\t{ void operator () () {} };\n\n#define VEC_STATIC_CHECK(expr) VEC_STATIC_ASSERTION_FAILURE<bool(expr)>()\n\n\n\n\n\ntemplate <int D, class T = float>\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":15,"score":67328.55996081686},{"content":"\n\n\t// Some partial compatibility with valarrays and vectors\n\n\ttypedef T value_type;\n\n\tsize_t size() const\n\n\t\t{ return D; }\n\n\tT sum() const\n\n\t\t{ T total = v[0];\n\n\t\t for (int i = 1; i < D; i++) total += v[i];\n\n\t\t return total; }\n\n\tT avg() const\n\n\t\t{ return sum() / D; }\n\n\tT product() const\n\n\t\t{ T total = v[0];\n\n\t\t for (int i = 1; i < D; i++) total *= v[i];\n\n\t\t return total; }\n\n\tT min() const\n\n\t\t{ T m = v[0];\n\n\t\t for (int i = 1; i < D; i++)\n\n\t\t\tif (v[i] < m) m = v[i];\n\n\t\t return m; }\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":16,"score":67328.55996081686},{"content":"\tT max() const\n\n\t\t{ T m = v[0];\n\n\t\t for (int i = 1; i < D; i++)\n\n\t\t\tif (v[i] > m) m = v[i];\n\n\t\t return m; }\n\n\tT *begin() { return &(v[0]); }\n\n\tconst T *begin() const { return &(v[0]); }\n\n\tT *end() { return begin() + D; }\n\n\tconst T *end() const { return begin() + D; }\n\n\tvoid clear() { for (int i = 0; i < D; i++) v[i] = T(0); }\n\n\tbool empty() const\n\n\t\t{ for (int i = 0; i < D; i++)\n\n\t\t\tif (v[i]) return false;\n\n\t\t return true; }\n\n\tVec<D,T> apply(T func(T)) const\n\n\t\t{ Vec<D,T> result(VEC_UNINITIALIZED);\n\n\t\t for (int i = 0; i < D; i++) result[i] = func(v[i]);\n\n\t\t return result; }\n\n\tVec<D,T> apply(T func(const T&)) const\n\n\t\t{ Vec<D,T> result(VEC_UNINITIALIZED);\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":17,"score":67328.55996081686},{"content":"\t\t\t\t\t inv_cielab_nonlinearity(v[2]));\n\n\t\t\tcase SRGB:\n\n\t\t\tcase YCBCR:\n\n\t\t\t\treturn Color(inv_srgb_nonlinearity(v[0]),\n\n\t\t\t\t\t inv_srgb_nonlinearity(v[1]),\n\n\t\t\t\t\t inv_srgb_nonlinearity(v[2]));\n\n\t\t\tdefault:\n\n\t\t\t\treturn Color(*this);\n\n\t\t}\n\n\t}\n\n\n\n\t// For backwards compatibility with earlier versions of Color.h,\n\n\t// this stays as a static method. New code should use convert().\n\n\tstatic Color hsv(float h, float s, float v)\n\n\t{\n\n\t\treturn Color(h,s,v).hsv2srgb();\n\n\t}\n\n};\n\n\n\n\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":18,"score":67328.55996081686},{"content":"\t\t\tysize = 2;\n\n\n\n\t\tint i;\n\n\t\tint pxy = max(xsize, ysize);\n\n\t\tfor (i = 0; i < pxy; i++)\n\n\t\t\tp.push_back(i);\n\n\t\tfor (i = 0; i < pxy; i++) {\n\n\t\t\tint j = int(tinyrnd()*pxy);\n\n\t\t\tswap(p[i], p[j]);\n\n\t\t}\n\n\t\tfor (i = pxy; i < pxy+ysize; i++)\n\n\t\t\tp.push_back(p[i-pxy]);\n\n\t\tfor (i = 0; i < pxy + zsize; i++)\n\n\t\t\tr.push_back(tinyrnd());\n\n\t}\n\n\n\n\tvirtual float lookup(float x, float y, float z) const\n\n\t{\n\n\t\tx -= floor(x);\n\n\t\ty -= floor(y);\n","file_path":"ExternalLibs/trimesh2/include/noise3d.h","rank":19,"score":67328.55996081686},{"content":"\t{\n\n\t\tfloat fy = (v[0] + 16.0f) * (1.0f / 116.0f);\n\n\t\tfloat fx = fy + v[1] * 0.002f;\n\n\t\tfloat fz = fy - v[2] * 0.005f;\n\n\t\treturn Color(0.95047f * inv_cielab_nonlinearity(fx),\n\n\t\t\t inv_cielab_nonlinearity(fy),\n\n\t\t\t 1.08883f * inv_cielab_nonlinearity(fz));\n\n\t}\n\n\n\n\tconst Color xyz2rgb() const\n\n\t{\n\n\t\treturn col_transform(3.24071f, -1.53726f, -0.498571f,\n\n \t\t\t\t -0.969258f, 1.87599f, 0.0415557f,\n\n\t\t\t\t 0.0556352f, -0.203996f, 1.05707f);\n\n\t}\n\n\tconst Color rgb2xyz() const\n\n\t{\n\n\t\treturn col_transform(0.412424f, 0.357579f, 0.180464f,\n\n\t\t\t\t 0.212656f, 0.715158f, 0.0721856f,\n\n\t\t\t\t 0.0193324f, 0.119193f, 0.950444f);\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":20,"score":67328.55996081686},{"content":"\tVec<D,T> &operator += (const Vec<D,T> &x)\n\n\t{\n\n\t\tfor (int i = 0; i < D; i++)\n\n#pragma omp atomic\n\n\t\t\tv[i] += x[i];\n\n\t\treturn *this;\n\n\t}\n\n\tVec<D,T> &operator -= (const Vec<D,T> &x)\n\n\t{\n\n\t\tfor (int i = 0; i < D; i++)\n\n#pragma omp atomic\n\n\t\t\tv[i] -= x[i];\n\n\t\treturn *this;\n\n\t}\n\n\tVec<D,T> &operator *= (const Vec<D,T> &x)\n\n\t{\n\n\t\tfor (int i = 0; i < D; i++)\n\n#pragma omp atomic\n\n\t\t\tv[i] *= x[i];\n\n\t\treturn *this;\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":21,"score":67328.55996081686},{"content":"}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator / (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = v1[i] / v2[i];\n\n\treturn result;\n\n}\n\n\n\n// Dot product in any dimension\n\ntemplate <int D, class T>\n\nstatic inline const T operator ^ (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tT sum = v1[0] * v2[0];\n\n\tfor (int i = 1; i < D; i++)\n\n\t\tsum += v1[i] * v2[i];\n\n\treturn sum;\n\n}\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":22,"score":67328.55996081686},{"content":"\t\tc[0][j] = 0;\n\n\tcurrent_c = c[0];\n\n\tcurrent_sqr_r = -1;\n\n}\n\n\n\n\n\ntemplate <int D, class T>\n\nbool Basis<D,T>::push(const Vec<D,T> &p)\n\n{\n\n\tint i, j;\n\n\tconst T eps = T(1.0e-13);\n\n\tif (m == 0) {\n\n\t\tfor (i = 0; i < D; i++)\n\n\t\t\tq0[i] = p[i];\n\n\t\tfor (i = 0; i < D; i++)\n\n\t\t\tc[0][i] = q0[i];\n\n\t\tsqr_r[0] = 0;\n\n\t} else {\n\n\t\t// set v_m to Q_m\n\n\t\tfor (i = 0; i < D; i++)\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":23,"score":67328.55996081686},{"content":"\t\t for (int i = 0; i < D; i++) result[i] = func(v[i]);\n\n\t\t return result; }\n\n};\n\n\n\ntypedef Vec<3,float> vec;\n\ntypedef Vec<3,float> point;\n\ntypedef Vec<2,float> vec2;\n\ntypedef Vec<3,float> vec3;\n\ntypedef Vec<4,float> vec4;\n\ntypedef Vec<2,int> ivec2;\n\ntypedef Vec<3,int> ivec3;\n\ntypedef Vec<4,int> ivec4;\n\n\n\n\n\n// Nonmember operators that take two Vecs\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator + (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":24,"score":67328.55996081686},{"content":"\t}\n\n\tVec<D,T> &operator *= (const T &x)\n\n\t{\n\n\t\tfor (int i = 0; i < D; i++)\n\n#pragma omp atomic\n\n\t\t\tv[i] *= x;\n\n\t\treturn *this;\n\n\t}\n\n\tVec<D,T> &operator /= (const Vec<D,T> &x)\n\n\t{\n\n\t\tfor (int i = 0; i < D; i++)\n\n#pragma omp atomic\n\n\t\t\tv[i] /= x[i];\n\n\t\treturn *this;\n\n\t}\n\n\tVec<D,T> &operator /= (const T &x)\n\n\t{\n\n\t\tfor (int i = 0; i < D; i++)\n\n#pragma omp atomic\n\n\t\t\tv[i] /= x;\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":25,"score":67328.55996081686},{"content":"{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = x * v[i];\n\n\treturn result;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator * (const Vec<D,T> &v, const T &x)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = v[i] * x;\n\n\treturn result;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator / (const T &x, const Vec<D,T> &v)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":26,"score":67328.55996081686},{"content":"}\n\n\n\n// Square function moved up -- pm\n\n\n\ntemplate <class T>\n\nstatic inline T cube(const T &x)\n\n{\n\n\treturn x*x*x;\n\n}\n\n\n\n\n\n// Sign of a scalar\n\ntemplate <class T>\n\nstatic inline T sgn(const T &x)\n\n{\n\n\treturn (x < T(0)) ? T(-1) : T(1);\n\n}\n\n\n\n\n\n// Utility functions based on GLSL\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":27,"score":67328.55996081686},{"content":"\t}\n\n\n\n\tif (c1 == '(' && c2 != ')')\n\n\t\tis.setstate(std::ios::failbit);\n\n\telse if (c1 == '[' && c2 != ']')\n\n\t\tis.setstate(std::ios::failbit);\n\n\n\n\treturn is;\n\n}\n\n\n\n// Utility functions for square and cube, to go along with sqrt and cbrt\n\ntemplate <class T>\n\nstatic inline T sqr(const T &x)\n\n{\n\n\treturn x*x;\n\n}\n\n\n\n\n\n// Functions on Vecs\n\ntemplate <int D, class T>\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":28,"score":67328.55996081686},{"content":" }\n\n\n\nVEC_DECLARE_ONEARG(fabs)\n\nVEC_DECLARE_ONEARG(floor)\n\nVEC_DECLARE_ONEARG(ceil)\n\nVEC_DECLARE_ONEARG(round)\n\nVEC_DECLARE_ONEARG(trunc)\n\nVEC_DECLARE_ONEARG(sin)\n\nVEC_DECLARE_ONEARG(asin)\n\nVEC_DECLARE_ONEARG(cos)\n\nVEC_DECLARE_ONEARG(acos)\n\nVEC_DECLARE_ONEARG(tan)\n\nVEC_DECLARE_ONEARG(atan)\n\nVEC_DECLARE_ONEARG(exp)\n\nVEC_DECLARE_ONEARG(log)\n\nVEC_DECLARE_ONEARG(sqrt)\n\nVEC_DECLARE_ONEARG(sqr)\n\nVEC_DECLARE_ONEARG(cbrt)\n\nVEC_DECLARE_ONEARG(cube)\n\nVEC_DECLARE_ONEARG(sgn)\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":29,"score":67328.55996081686},{"content":"\tos << \"(\";\n\n\tfor (int i = 0; i < D-1; i++)\n\n\t\tos << v[i] << \", \";\n\n\treturn os << v[D-1] << \")\";\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline std::istream &operator >> (std::istream &is, Vec<D,T> &v)\n\n{\n\n\tchar c1 = 0, c2 = 0;\n\n\n\n\tis >> c1;\n\n\tif (c1 == '(' || c1 == '[') {\n\n\t\tis >> v[0] >> std::ws >> c2;\n\n\t\tfor (int i = 1; i < D; i++) {\n\n\t\t\tif (c2 == ',')\n\n\t\t\t\tis >> v[i] >> std::ws >> c2;\n\n\t\t\telse\n\n\t\t\t\tis.setstate(std::ios::failbit);\n\n\t\t}\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":30,"score":67328.55996081686},{"content":"\tColor &operator = (int c)\n\n\t\t{ return *this = Color(c); }\n\n\n\n\tstatic Color black()\n\n\t\t{ return Color(0.0f, 0.0f, 0.0f); }\n\n\tstatic Color white()\n\n\t\t{ return Color(1.0f, 1.0f, 1.0f); }\n\n\tstatic Color red()\n\n\t\t{ return Color(1.0f, 0.0f, 0.0f); }\n\n\tstatic Color green()\n\n\t\t{ return Color(0.0f, 1.0f, 0.0f); }\n\n\tstatic Color blue()\n\n\t\t{ return Color(0.0f, 0.0f, 1.0f); }\n\n\tstatic Color yellow()\n\n\t\t{ return Color(1.0f, 1.0f, 0.0f); }\n\n\tstatic Color cyan()\n\n\t\t{ return Color(0.0f, 1.0f, 1.0f); }\n\n\tstatic Color magenta()\n\n\t\t{ return Color(1.0f, 0.0f, 1.0f); }\n\n\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":31,"score":67328.55996081686},{"content":"\t\tresult[i] = v1[i] + v2[i];\n\n\treturn result;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator - (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = v1[i] - v2[i];\n\n\treturn result;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator * (const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = v1[i] * v2[i];\n\n\treturn result;\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":32,"score":67328.55996081686},{"content":"\t\telse\n\n\t\t\treturn 4.0f / 29.0f + (841.0f / 108.0f) * x;\n\n\t}\n\n\tstatic inline float inv_cielab_nonlinearity(float x)\n\n\t{\n\n\t\tif (x > (6.0f / 29.0f))\n\n\t\t\treturn cube(x);\n\n\t\telse\n\n\t\t\treturn (x - 4.0f / 29.0f) * (108.0f / 841.0f);\n\n\t}\n\n\tconst Color xyz2cielab() const\n\n\t{\n\n\t\tfloat fx = cielab_nonlinearity(v[0] * (1.0f / 0.95047f));\n\n\t\tfloat fy = cielab_nonlinearity(v[1]);\n\n\t\tfloat fz = cielab_nonlinearity(v[2] * (1.0f / 1.08883f));\n\n\t\treturn Color(116.0f * fy - 16.0f,\n\n\t\t\t 500.0f * (fx - fy),\n\n\t\t\t 200.0f * (fy - fz));\n\n\t}\n\n\tconst Color cielab2xyz() const\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":33,"score":67328.55996081686},{"content":"\t\tfor (int pass = 0 ; pass < passes; pass++, factor *= MAGIC_SCALE) {\n\n\t\t\tfloat r = 1.0f / factor;\n\n\t\t\tt += Noise3D::lookup(x*r,y*r,z*r) * factor;\n\n\t\t}\n\n\n\n\t\treturn t * correction;\n\n\t}\n\n};\n\n\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/noise3d.h","rank":34,"score":67328.55996081686},{"content":"\t\tfloat H = 0.0f;\n\n\t\tif (S == 0.0f)\n\n\t\t\treturn Color(H, S, V);\n\n\t\tif (V == v[0])\n\n\t\t\tH = (v[1] - v[2]) / diff;\n\n\t\telse if (V == v[1])\n\n\t\t\tH = (v[2] - v[0]) / diff + 2.0f;\n\n\t\telse\n\n\t\t\tH = (v[0] - v[1]) / diff + 4.0f;\n\n\t\tH *= float(M_PI / 3.0);\n\n\t\tif (H < 0.0f)\n\n\t\t\tH += float(2.0 * M_PI);\n\n\t\treturn Color(H, S, V);\n\n\t}\n\n\n\n\tstatic inline float cielab_nonlinearity(float x)\n\n\t{\n\n\t\tif (x > 216.0f / 24389.0f)\n\n\t\t\t//return cbrt(x);\n\n return (float)(std::pow( std::abs ( x ), 1.0f / 3.0f ));\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":35,"score":67328.55996081686},{"content":"\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator - (const Vec<D,T> &v)\n\n{\n\n\tVec<D,T> result(VEC_UNINITIALIZED);\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tresult[i] = -v[i];\n\n\treturn result;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline bool operator ! (const Vec<D,T> &v)\n\n{\n\n\treturn v.empty();\n\n}\n\n\n\n\n\n// Vec/scalar operators\n\ntemplate <int D, class T>\n\nstatic inline const Vec<D,T> operator * (const T &x, const Vec<D,T> &v)\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":36,"score":67328.55996081686},{"content":"\t\tH *= float(3.0 / M_PI);\n\n\t\tint i = int(floor(H));\n\n\t\tfloat f = H - i;\n\n\t\tfloat p = V * (1.0f - S);\n\n\t\tfloat q = V * (1.0f - (S*f));\n\n\t\tfloat t = V * (1.0f - (S*(1.0f-f)));\n\n\t\tswitch(i) {\n\n\t\t\tcase 0: return Color(V, t, p);\n\n\t\t\tcase 1: return Color(q, V, p);\n\n\t\t\tcase 2: return Color(p, V, t);\n\n\t\t\tcase 3: return Color(p, q, V);\n\n\t\t\tcase 4: return Color(t, p, V);\n\n\t\t\tdefault: return Color(V, p, q);\n\n\t\t}\n\n\t}\n\n\tconst Color srgb2hsv() const\n\n\t{\n\n\t\tfloat V = std::max(std::max(v[0], v[1]), v[2]);\n\n\t\tfloat diff = V - std::min(std::min(v[0], v[1]), v[2]);\n\n\t\tfloat S = diff / V;\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":37,"score":67328.55996081686},{"content":"\t\t\t srgb_nonlinearity(v[2]));\n\n\t}\n\n\tconst Color srgb2rgb() const\n\n\t{\n\n\t\treturn Color(inv_srgb_nonlinearity(v[0]),\n\n\t\t\t inv_srgb_nonlinearity(v[1]),\n\n\t\t\t inv_srgb_nonlinearity(v[2]));\n\n\t}\n\n\n\n\tconst Color srgb2ycbcr() const\n\n\t{\n\n\t\treturn Color(0.0f, 0.5f, 0.5f) + col_transform(\n\n\t\t\t0.299f, 0.587f, 0.114f,\n\n\t\t\t-0.168736f, -0.331264f, 0.5f,\n\n\t\t\t0.5f, -0.418688f, -0.081312f);\n\n\t}\n\n\tconst Color ycbcr2srgb() const\n\n\t{\n\n\t\treturn Color(v[0], v[1] - 0.5f, v[2] - 0.5f).col_transform(\n\n\t\t\t 1.0f, 0.0f, 1.402f,\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":38,"score":67328.55996081686},{"content":"\tfor (int i = 0; i < D; i++) \\\n\n\t\tresult[i] = name(v[i], w[i]); \\\n\n\treturn result; \\\n\n }\n\n#define VEC_DECLARE_THREEARG(name) \\\n\n template <int D, class T> \\\n\n static inline Vec<D,T> name(const Vec<D,T> &v, const T &w, const T &x) \\\n\n { \\\n\n\tVec<D,T> result(VEC_UNINITIALIZED); \\\n\n\tfor (int i = 0; i < D; i++) \\\n\n\t\tresult[i] = name(v[i], w, x); \\\n\n\treturn result; \\\n\n } \\\n\n template <int D, class T> \\\n\n static inline Vec<D,T> name(const Vec<D,T> &v, const Vec<D,T> &w, const Vec<D,T> &x) \\\n\n { \\\n\n\tVec<D,T> result(VEC_UNINITIALIZED); \\\n\n\tfor (int i = 0; i < D; i++) \\\n\n\t\tresult[i] = name(v[i], w[i], x[i]); \\\n\n\treturn result; \\\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":39,"score":67328.55996081686},{"content":"#ifndef VEC_H\n\n#define VEC_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nVec.h\n\nClass for a constant-length vector\n\n\n\nSupports the following operations:\n\n\tvec v1;\t\t\t// Initialized to (0,0,0)\n\n\tvec v2(1,2,3);\t\t// Initialized to (1,2,3)\n\n\tvec v3(v2);\t\t// Copy constructor\n\n\tfloat farray[3];\n\n\tvec v4 = vec(farray);\t// Explicit: \"v4 = farray\" won't work\n\n\tVec<3,double> vd;\t// The \"vec\" used above is Vec<3,float>\n\n\tpoint p1, p2, p3;\t// Same as vec\n\n\n\n\tv3 = v1 + v2;\t\t// Also -, *, / (all componentwise)\n\n\tv3 = 3.5f * v1;\t\t// Also vec * scalar, vec / scalar\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":40,"score":67328.55996081686},{"content":"\tT squared_radius() const { return B.squared_radius(); }\n\n};\n\n\n\n\n\ntemplate <int D, class T>\n\nT Basis<D,T>::excess(const Vec<D,T> &p) const\n\n{\n\n\tT e = -current_sqr_r;\n\n\tfor (int k = 0; k < D; k++)\n\n\t\te += sqr(p[k] - current_c[k]);\n\n\treturn e;\n\n}\n\n\n\n\n\ntemplate <int D, class T>\n\nvoid Basis<D,T>::reset()\n\n{\n\n\tm = s = 0;\n\n\t// we misuse c[0] for the center of the empty sphere\n\n\tfor (int j = 0; j < D; j++)\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":41,"score":67328.55996081686},{"content":"\n\ntemplate <int D, class T>\n\nstatic inline const T dist2(const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tT d2 = sqr(v2[0]-v1[0]);\n\n\tfor (int i = 1; i < D; i++)\n\n\t\td2 += sqr(v2[i]-v1[i]);\n\n\treturn d2;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const T dist(const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\treturn sqrt(dist2(v1,v2));\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline Vec<D,T> normalize(Vec<D,T> &v)\n\n{\n\n\tT l = len(v);\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":42,"score":67328.55996081686},{"content":"\t\t{}\n\n\texplicit Color(double c) : Vec<3,float>((float)c, (float)c, (float)c)\n\n\t\t{}\n\n\tColor &operator = (float c)\n\n\t\t{ return *this = Color(c); }\n\n\tColor &operator = (double c)\n\n\t\t{ return *this = Color(c); }\n\n\n\n\t// Assigning from ints divides by 255\n\n\tColor(int r, int g, int b)\n\n\t{\n\n\t\tconst float mult = 1.0f / 255.0f;\n\n\t\t*this = Color(mult*r, mult*g, mult*b);\n\n\t}\n\n\texplicit Color(const int *rgb)\n\n\t\t{ *this = Color(rgb[0], rgb[1], rgb[2]); }\n\n\texplicit Color(const unsigned char *rgb)\n\n\t\t{ *this = Color(rgb[0], rgb[1], rgb[2]); }\n\n\texplicit Color(int c)\n\n\t\t{ *this = Color(c,c,c); }\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":43,"score":67328.55996081686},{"content":"VEC_DECLARE_TWOARG(min)\n\nVEC_DECLARE_TWOARG(max)\n\nVEC_DECLARE_TWOARG(atan2)\n\nVEC_DECLARE_TWOARG(pow)\n\nVEC_DECLARE_TWOARG(fmod)\n\nVEC_DECLARE_TWOARG(step)\n\nVEC_DECLARE_THREEARG(smoothstep)\n\nVEC_DECLARE_THREEARG(clamp)\n\n\n\n#undef VEC_DECLARE_ONEARG\n\n#undef VEC_DECLARE_TWOARG\n\n#undef VEC_DECLARE_THREEARG\n\n\n\n\n\n// Both valarrays and GLSL use abs() on a vector to mean fabs().\n\n// Let's be compatible...\n\ntemplate <int D, class T>\n\nstatic inline Vec<D,T> abs(const Vec<D,T> &v)\n\n{\n\n\treturn fabs(v);\n\n}\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":44,"score":67328.55996081686},{"content":" void\n\n run( const InTypeP in, FType & functor , size_t numThreads = 1, OutRegion outRegion = OutRegion())\n\n {\n\n typedef MapFilter<FType,InType,OutType> MF;\n\n typename MF::Pointer mf = MF::New();\n\n mf->SetFunctor(&functor); // handles output\n\n if(numThreads>0)\n\n mf->SetNumberOfThreads(numThreads);\n\n mf->SetInput(in);\n\n if(outRegion.GetSize()[0] > 0)\n\n {\n\n mf->GetOutput()->SetRequestedRegion(outRegion);\n\n }\n\n else\n\n {\n\n mf->GetOutput()->SetRequestedRegion(in->GetLargestPossibleRegion());\n\n }\n\n\n\n mf->Update(); // throws\n\n }\n","file_path":"ExternalLibs/trimesh2/include/map.h","rank":45,"score":67328.55996081686},{"content":"static inline void swap(const Vec<D,T> &v1, const Vec<D,T> &v2)\n\n{\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tswap(v1[i], v2[i]);\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const T len2(const Vec<D,T> &v)\n\n{\n\n\tT l2 = v[0] * v[0];\n\n\tfor (int i = 1; i < D; i++)\n\n\t\tl2 += v[i] * v[i];\n\n\treturn l2;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline const T len(const Vec<D,T> &v)\n\n{\n\n\treturn sqrt(len2(v));\n\n}\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":46,"score":67328.55996081686},{"content":"static inline T reflect(const Vec<D,T> &I, const Vec<D,T> &N)\n\n{\n\n\treturn I - (T(2) * (N DOT I)) * N;\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline T refract(const Vec<D,T> &I, const Vec<D,T> &N,\n\n\t\t\tconst T &eta)\n\n{\n\n\tT NdotI = N DOT I;\n\n\tT k = T(1) - sqr(eta) * (T(1) - sqr(NdotI));\n\n\treturn (k < T(0)) ? T(0) : eta * I - (eta * NdotI * sqrt(k)) * N;\n\n}\n\n\n\n\n\n// Generic macros for declaring 1-, 2-, and 3- argument\n\n// componentwise functions on vecs\n\n#define VEC_DECLARE_ONEARG(name) \\\n\n template <int D, class T> \\\n\n static inline Vec<D,T> name(const Vec<D,T> &v) \\\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":47,"score":67328.55996081686},{"content":"\t\tz -= floor(z);\n\n\n\n\t\tint X = int(x*xsize);\n\n\t\tint Y = int(y*ysize);\n\n\t\tint Z = int(z*zsize);\n\n\t\tint X1 = X+1; if (X1 == xsize) X1 = 0;\n\n\t\tint Y1 = Y+1; if (Y1 == ysize) Y1 = 0;\n\n\t\tint Z1 = Z+1; if (Z1 == zsize) Z1 = 0;\n\n\n\n\t\tfloat xf = x*xsize - X, xf1 = 1.0-xf;\n\n\t\tfloat yf = y*ysize - Y, yf1 = 1.0-yf;\n\n\t\tfloat zf = z*zsize - Z, zf1 = 1.0-zf;\n\n\n\n\t\treturn xf1*(yf1*(zf1*r[coord2index(X , Y , Z )] +\n\n\t\t\t\t zf *r[coord2index(X , Y , Z1)]) +\n\n\t\t\t yf *(zf1*r[coord2index(X , Y1, Z )] +\n\n\t\t\t\t zf *r[coord2index(X , Y1, Z1)])) +\n\n\t\t xf *(yf1*(zf1*r[coord2index(X1, Y , Z )] +\n\n\t\t\t\t zf *r[coord2index(X1, Y , Z1)]) +\n\n\t\t\t yf *(zf1*r[coord2index(X1, Y1, Z )] +\n\n\t\t\t\t zf *r[coord2index(X1, Y1, Z1)]));\n\n\t}\n\n\n\n\tvirtual ~Noise3D() {}\n\n};\n\n\n\n\n\n#define MAGIC_SCALE 1.5707963f\n\n\n","file_path":"ExternalLibs/trimesh2/include/noise3d.h","rank":48,"score":67328.55996081686},{"content":"\t\t\treturn;\n\n\t\tstd::vector<void *> v;\n\n\t\tvoid *p;\n\n\t\tfor (p = freelist; *(void **)p; p = *(void **)p)\n\n\t\t\tv.push_back(p);\n\n\t\tstd::sort(v.begin(), v.end());\n\n\t\tp = freelist = v[0];\n\n\t\tfor (size_t i = 1; i < v.size(); i++) {\n\n\t\t\t*(void **)p = v[i];\n\n\t\t\tp = *(void **)p;\n\n\t\t}\n\n\t\t*(void **)p = NULL;\n\n\t}\n\n};\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/mempool.h","rank":49,"score":67328.55996081686},{"content":"{\n\n\treturn x < a ? T(0) : T(1);\n\n}\n\n\n\ntemplate <class T>\n\nstatic inline T smoothstep(const T &x, const T &a, const T &b)\n\n{\n\n\tif (b <= a) return step(x,a);\n\n\tT t = (x - a) / (b - a);\n\n\treturn t <= T(0) ? T(0) : t >= T(1) ? T(1) : t * t * (T(3) - T(2) * t);\n\n}\n\n\n\ntemplate <int D, class T>\n\nstatic inline T faceforward(const Vec<D,T> &N, const Vec<D,T> &I,\n\n\t\t\t const Vec<D,T> &Nref)\n\n{\n\n\treturn ((Nref DOT I) < T(0)) ? N : -N;\n\n}\n\n\n\ntemplate <int D, class T>\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":50,"score":67328.55996081686},{"content":"\t\t}\n\n\t}\n\n\n\n\t// Linear to nonlinear - raises values to the power of 1/g\n\n\tconst Color gamma(float g) const\n\n\t{\n\n\t\tfloat g1 = 1.0f / g;\n\n\t\treturn Color(pow(v[0],g1), pow(v[1],g1), pow(v[2],g1));\n\n\t}\n\n\n\n\t// Just apply the nonlinearity, not full colorspace conversion\n\n\tconst Color gamma(Colorspace dst) const\n\n\t{\n\n\t\tswitch (dst) {\n\n\t\t\tcase CIELAB:\n\n\t\t\t\treturn Color(cielab_nonlinearity(v[0]),\n\n\t\t\t\t\t cielab_nonlinearity(v[1]),\n\n\t\t\t\t\t cielab_nonlinearity(v[2]));\n\n\t\t\tcase SRGB:\n\n\t\t\tcase YCBCR:\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":51,"score":67328.55996081686},{"content":"\t\t\t 1.0f, -0.344136f, -0.714136f,\n\n\t\t\t 1.0f, 1.772f, 0.0f);\n\n\t}\n\n\n\npublic:\n\n\tenum Colorspace { CIELAB, XYZ, RGB, SRGB, YCBCR, HSV };\n\n\tconst Color convert(Colorspace src, Colorspace dst) const\n\n\t{\n\n\t\tif (src == dst)\n\n\t\t\treturn Color(*this);\n\n\t\tif (src == HSV)\n\n\t\t\treturn Color::hsv(v[0],v[1],v[2]).convert(SRGB, dst);\n\n\t\telse if (dst == HSV)\n\n\t\t\treturn convert(src, SRGB).srgb2hsv();\n\n\t\t// Else we have a natural order in which to convert things\n\n\t\tint srcnum = int(src), dstnum = int(dst);\n\n\t\tif (srcnum < dstnum) switch (src) {\n\n\t\t\tcase CIELAB:\n\n\t\t\t\treturn (dst == XYZ) ? cielab2xyz() :\n\n\t\t\t\t\tcielab2xyz().convert(XYZ, dst);\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":52,"score":67328.55996081686},{"content":"\tIt t = ++L.begin();\n\n\tmtf_mb(t);\n\n\tT max_e, old_sqr_r = T(0);\n\n\tdo {\n\n\t\tIt pivot;\n\n\t\tmax_e = max_excess(t, i, pivot);\n\n\t\tif (max_e > 0) {\n\n\t\t\tt = support_end;\n\n\t\t\tif (t == pivot)\n\n\t\t\t\tt++;\n\n\t\t\told_sqr_r = B.squared_radius();\n\n\t\t\tB.push(*pivot);\n\n\t\t\tmtf_mb(support_end);\n\n\t\t\tB.pop();\n\n\t\t\tmove_to_front(pivot);\n\n\t\t}\n\n\t} while (max_e > 0 && B.squared_radius() > old_sqr_r);\n\n}\n\n\n\n\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":53,"score":67328.55996081686},{"content":"T Miniball<D,T>::max_excess(It t, It i, It &pivot) const\n\n{\n\n\tconst T *c = B.center(), sqr_r = B.squared_radius();\n\n\tT e, max_e = 0;\n\n\tfor (It k = t; k != i; k++) {\n\n\t\tconst Vec<D,T> &p = *k;\n\n\t\te = -sqr_r;\n\n\t\tfor (int j = 0; j < D; j++)\n\n\t\t\te += sqr(p[j] - c[j]);\n\n\t\tif (e > max_e) {\n\n\t\t\tmax_e = e;\n\n\t\t\tpivot = k;\n\n\t\t}\n\n\t}\n\n\treturn max_e;\n\n}\n\n\n\n\n\ntemplate <int D, class T>\n\nvoid Miniball<D,T>::mtf_mb(It i)\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":54,"score":67328.55996081686},{"content":"#ifndef MEMPOOL_H\n\n#define MEMPOOL_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nmempool.h\n\nReplacement memory management for a class using a memory pool.\n\n\n\nSample usage:\n","file_path":"ExternalLibs/trimesh2/include/mempool.h","rank":55,"score":67328.55996081686},{"content":"\t// Constructor from anything that can be accessed using []\n\n\t// Pretty aggressive, so marked as explicit.\n\n\ttemplate <class S> explicit Vec(const S &x)\n\n\t\t{ for (int i = 0; i < D; i++) v[i] = T(x[i]); }\n\n\n\n\t// No destructor or assignment operator needed\n\n\n\n\t// Array reference and conversion to pointer - no bounds checking\n\n\tconst T &operator [] (int i) const\n\n\t\t{ return v[i]; }\n\n\tT &operator [] (int i)\n\n\t\t{ return v[i]; }\n\n\toperator const T * () const\n\n\t\t{ return v; }\n\n\toperator const T * ()\n\n\t\t{ return v; }\n\n\toperator T * ()\n\n\t\t{ return v; }\n\n\n\n\t// Member operators\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":56,"score":67328.55996081686},{"content":"\t}\n\n\n\n\tstatic inline float srgb_nonlinearity(float x)\n\n\t{\n\n\t\tif (x > 0.0031308f)\n\n\t\t\treturn 1.055f * pow(x, 1.0f/2.4f) - 0.055f;\n\n\t\telse\n\n\t\t\treturn x * 12.92f;\n\n\t}\n\n\tstatic inline float inv_srgb_nonlinearity(float x)\n\n\t{\n\n\t\tif (x > (0.0031308f * 12.92f))\n\n\t\t\treturn pow((x + 0.055f) * (1.0f / 1.055f), 2.4f);\n\n\t\telse\n\n\t\t\treturn x * (1.0f / 12.92f);\n\n\t}\n\n\tconst Color rgb2srgb() const\n\n\t{\n\n\t\treturn Color(srgb_nonlinearity(v[0]),\n\n\t\t\t srgb_nonlinearity(v[1]),\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":57,"score":67328.55996081686},{"content":"\t\tif (!freelist)\n\n\t\t\tgrow_freelist();\n\n\t\tvoid *next = freelist;\n\n\t\tfreelist = *(void **)next;\n\n\t\treturn next;\n\n\t}\n\n\tvoid free(void *p, size_t n)\n\n\t{\n\n\t\tif (!p)\n\n\t\t\treturn;\n\n\t\telse if (n != itemsize)\n\n\t\t\t::operator delete(p);\n\n\t\telse {\n\n\t\t\t*(void **)p = freelist;\n\n\t\t\tfreelist = p;\n\n\t\t}\n\n\t}\n\n\tvoid sort_freelist()\n\n\t{\n\n\t\tif (!freelist)\n","file_path":"ExternalLibs/trimesh2/include/mempool.h","rank":58,"score":67328.55996081686},{"content":"}\n\n \n\n\n\ntemplate <int D, class T>\n\nvoid Basis<D,T>::pop()\n\n{\n\n\tm--;\n\n}\n\n \n\n\n\ntemplate <int D, class T>\n\nvoid Miniball<D,T>::move_to_front(It j)\n\n{\n\n\tif (support_end == j)\n\n\t\tsupport_end++;\n\n\tL.splice(L.begin(), L, j);\n\n}\n\n\n\n\n\ntemplate <int D, class T>\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":59,"score":67328.55996081686},{"content":"template <class T>\n\nstatic inline T fract(const T &x)\n\n{\n\n\treturn x - floor(x);\n\n}\n\n\n\ntemplate <class T>\n\nstatic inline T clamp(const T &x, const T &a, const T &b)\n\n{\n\n\treturn x > a ? x < b ? x : b : a; // returns a on NaN\n\n}\n\n\n\ntemplate <class T, class S>\n\nstatic inline T mix(const T &x, const T &y, const S &a)\n\n{\n\n\treturn (S(1)-a) * x + a * y;\n\n}\n\n\n\ntemplate <class T>\n\nstatic inline T step(const T &x, const T &a)\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":60,"score":67328.55996081686},{"content":"// We pick up most of the operators and functions from vecs automatically.\n\n// The only ones we need to worry about are min and max,\n\n// since otherwise we'd get the ones from std::\n\nstatic inline const Color min(const Color &c1, const Color &c2)\n\n{\n\n\treturn Color(c1).min(c2);\n\n}\n\n\n\nstatic inline const Color max(const Color &c1, const Color &c2)\n\n{\n\n\treturn Color(c1).max(c2);\n\n}\n\n\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":61,"score":67328.55996081686},{"content":"};\n\n\n\n/**\n\n * reduce is an abstraction of mapping over threads to simplify (and restrict) things a bit.\n\n *\n\n * the passed in functor should have an:\n\n * TOutput operator()(TInputImage::ConstPointer in, const TOutputImage::RegionType & threadRegion)\n\n * and\n\n * TOutput operator()(const std::vector<TOutput> & in)\n\n *\n\n * where the reduce is two steps, first each thread reduces it's region to a single output object,\n\n * and the second step reduces a list (std::vector) of those objects to a single output object.\n\n *\n\n * For example to compute the mean, you might use a std::pair<float,size_t> obj, where obj.first = sum, obj.second = count,\n\n * then in the second step you would sum all the obj.first and obj.second and divide first by the scond to get the mean.\n\n */\n\ntemplate<class TInputImage,\n","file_path":"ExternalLibs/trimesh2/include/map.h","rank":62,"score":67328.55996081686},{"content":"// (at your option) any later version.\n\n//\n\n// This program is distributed in the hope that it will be useful,\n\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n// GNU General Public License for more details.\n\n//\n\n// You should have received a copy of the GNU General Public License\n\n// along with this program; if not, write to the Free Software\n\n// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA,\n\n// or download the License terms from prep.ai.mit.edu/pub/gnu/COPYING-2.0.\n\n//\n\n// Contact:\n\n// --------\n\n// Bernd Gaertner\n\n// Institut f. Informatik\n\n// ETH Zuerich\n\n// ETH-Zentrum\n\n// CH-8092 Zuerich, Switzerland\n\n// http://www.inf.ethz.ch/personal/gaertner\n\n//\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":63,"score":67328.55996081686},{"content":"template <int D, class T>\n\nvoid Miniball<D,T>::build(bool pivoting /* = true */)\n\n{\n\n\tB.reset();\n\n\tsupport_end = L.begin();\n\n\tif (pivoting)\n\n\t\tpivot_mb(L.end());\n\n\telse\n\n\t\tmtf_mb(L.end());\n\n}\n\n\n\n\n\n//\n\n// Original copyright of miniball code follows:\n\n//\n\n// Copright (C) 1999\n\n//\n\n// This program is free software; you can redistribute it and/or modify\n\n// it under the terms of the GNU General Public License as published by\n\n// the Free Software Foundation; either version 2 of the License, or\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":64,"score":67328.55996081686},{"content":"\t// 3x3 color transform - matrix given in *row-major* order\n\n\tconst Color col_transform(float m11, float m12, float m13,\n\n\t\t\t\t float m21, float m22, float m23,\n\n\t\t\t\t float m31, float m32, float m33) const\n\n\t{\n\n\t\treturn Color(m11*v[0]+m12*v[1]+m13*v[2],\n\n\t\t\t m21*v[0]+m22*v[1]+m23*v[2],\n\n\t\t\t m31*v[0]+m32*v[1]+m33*v[2]);\n\n\t}\n\n\n\nprivate:\n\n\tconst Color hsv2srgb() const\n\n\t{\n\n\t\t// From FvD\n\n\t\tfloat H = v[0], S = v[1], V = v[2];\n\n\t\tif (S <= 0.0f)\n\n\t\t\treturn Color(V,V,V);\n\n\t\tH = fmod(H, float(2.0 * M_PI));\n\n\t\tif (H < 0.0f)\n\n\t\t\tH += float(2.0 * M_PI);\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":65,"score":67328.55996081686},{"content":"\t\treturn *this;\n\n\t}\n\n\n\n\t// Set each component to min/max of this and the other vector\n\n\tVec<D,T> &min(const Vec<D,T> &x)\n\n\t{\n\n#pragma omp critical\n\n\t\tfor (int i = 0; i < D; i++)\n\n\t\t\tif (x[i] < v[i]) v[i] = x[i];\n\n\t\treturn *this;\n\n\t}\n\n\tVec<D,T> &max(const Vec<D,T> &x)\n\n\t{\n\n#pragma omp critical\n\n\t\tfor (int i = 0; i < D; i++)\n\n\t\t\tif (x[i] > v[i]) v[i] = x[i];\n\n\t\treturn *this;\n\n\t}\n\n\n\n\t// Outside of class: + - * / % ^ << >>\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":66,"score":67328.55996081686},{"content":"\t\t\tcase XYZ:\n\n\t\t\t\treturn (dst == RGB) ? xyz2rgb() :\n\n\t\t\t\t\txyz2rgb().convert(RGB, dst);\n\n\t\t\tcase RGB:\n\n\t\t\t\treturn (dst == SRGB) ? rgb2srgb() :\n\n\t\t\t\t\trgb2srgb().convert(SRGB, dst);\n\n\t\t\tdefault:\n\n\t\t\t\treturn srgb2ycbcr();\n\n\t\t} else switch (src) {\n\n\t\t\tcase YCBCR:\n\n\t\t\t\treturn (dst == SRGB) ? ycbcr2srgb() :\n\n\t\t\t\t\tycbcr2srgb().convert(SRGB, dst);\n\n\t\t\tcase SRGB:\n\n\t\t\t\treturn (dst == RGB) ? srgb2rgb() :\n\n\t\t\t\t\tsrgb2rgb().convert(RGB, dst);\n\n\t\t\tcase RGB:\n\n\t\t\t\treturn (dst == XYZ) ? rgb2xyz() :\n\n\t\t\t\t\trgb2xyz().convert(XYZ, dst);\n\n\t\t\tdefault:\n\n\t\t\t\treturn xyz2cielab();\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":67,"score":67328.55996081686},{"content":"\t\tz[m] *= T(2);\n\n \n\n\t\t// reject push if z_m too small\n\n\t\tif (z[m] < eps*current_sqr_r)\n\n\t\t\treturn false;\n\n \n\n\t\t// update c, sqr_r\n\n\t\tT e = -sqr_r[m-1];\n\n\t\tfor (i = 0; i < D; i++)\n\n\t\t\te += sqr(p[i] - c[m-1][i]);\n\n\t\tf[m] = e / z[m];\n\n \n\n\t\tfor (i = 0; i < D; i++)\n\n\t\t\tc[m][i] = c[m-1][i] + f[m]*v[m][i];\n\n\t\tsqr_r[m] = sqr_r[m-1] + e*f[m]*T(0.5);\n\n }\n\n current_c = c[m];\n\n current_sqr_r = sqr_r[m];\n\n s = ++m;\n\n return true;\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":68,"score":67328.55996081686},{"content":"\t\t\tv[m][i] = p[i] - q0[i];\n\n \n\n\t\t// compute the a_{m,i}, i < m\n\n\t\tfor (i = 1; i < m; i++) {\n\n\t\t\ta[m][i] = 0;\n\n\t\t\tfor (j = 0; j < D; j++)\n\n\t\t\t\ta[m][i] += v[i][j] * v[m][j];\n\n\t\t\ta[m][i] *= (T(2) / z[i]);\n\n\t\t}\n\n \n\n\t\t// update v_m to Q_m-\\bar{Q}_m\n\n\t\tfor (i = 1; i < m; i++) {\n\n\t\t\tfor (j = 0; j < D; j++)\n\n\t\t\t\tv[m][j] -= a[m][i] * v[i][j];\n\n\t\t}\n\n \n\n\t\t// compute z_m\n\n\t\tz[m] = 0;\n\n\t\tfor (j = 0; j < D; j++)\n\n\t\t\tz[m] += sqr(v[m][j]);\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":69,"score":67328.55996081686},{"content":"{\n\n\tsupport_end = L.begin();\n\n\tif (B.size() == D+1)\n\n\t\treturn;\n\n\tfor (It k = L.begin(); k != i; ) {\n\n\t\tIt j = k++;\n\n\t\tif (B.excess(*j) > 0) {\n\n\t\t\tif (B.push(*j)) {\n\n\t\t\t\tmtf_mb(j);\n\n\t\t\t\tB.pop();\n\n\t\t\t\tmove_to_front(j);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\n\n\ntemplate <int D, class T>\n\nvoid Miniball<D,T>::pivot_mb(It i)\n\n{\n","file_path":"ExternalLibs/trimesh2/include/bsphere.h","rank":70,"score":67328.55996081686},{"content":"\t\t\t\treturn Color(srgb_nonlinearity(v[0]),\n\n\t\t\t\t\t srgb_nonlinearity(v[1]),\n\n\t\t\t\t\t srgb_nonlinearity(v[2]));\n\n\t\t\tdefault:\n\n\t\t\t\treturn Color(*this);\n\n\t\t}\n\n\t}\n\n\n\n\t// Nonlinear to linear - raises values to the power of g\n\n\tconst Color ungamma(float g) const\n\n\t{\n\n\t\treturn Color(pow(v[0],g), pow(v[1],g), pow(v[2],g));\n\n\t}\n\n\n\n\tconst Color ungamma(Colorspace dst) const\n\n\t{\n\n\t\tswitch (dst) {\n\n\t\t\tcase CIELAB:\n\n\t\t\t\treturn Color(inv_cielab_nonlinearity(v[0]),\n\n\t\t\t\t\t inv_cielab_nonlinearity(v[1]),\n","file_path":"ExternalLibs/trimesh2/include/Color.h","rank":71,"score":67328.55996081686},{"content":"\tif (unlikely(l <= T(0))) {\n\n\t\tv[0] = T(1);\n\n\t\tfor (int i = 1; i < D; i++)\n\n\t\t\tv[i] = T(0);\n\n\t\treturn v;\n\n\t}\n\n\n\n\tl = T(1) / l;\n\n\tfor (int i = 0; i < D; i++)\n\n\t\tv[i] *= l;\n\n\n\n\treturn v;\n\n}\n\n\n\n\n\n// Area-weighted triangle face normal\n\ntemplate <class T>\n\nstatic inline T trinorm(const T &v0, const T &v1, const T &v2)\n\n{\n\n\treturn (typename T::value_type) 0.5 * ((v1 - v0) CROSS (v2 - v0));\n","file_path":"ExternalLibs/trimesh2/include/Vec.h","rank":72,"score":67328.55996081686},{"content":"#include \"math.h\"\n\n#include <vector>\n\n#include <list>\n\n#include <map>\n\n#include <limits>\n\n#include <iostream>\n\n#include <fstream>\n\n\n\n// SHIREEN\n\n#include <iterator> // -- PM\n\n#include <vnl/vnl_math.h>\n\n#include <vnl/vnl_sparse_matrix.h>\n\n#include <vnl/algo/vnl_svd.h>\n\n#include <vnl/algo/vnl_sparse_lu.h>\n\n#include <vcl_legacy_aliases.h>\n\n\n\n//#define SHOW_WARNING 1\n\n\n\n#define NUM_THREADS 8\n\n\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":73,"score":66285.69894069678},{"content":"\txf=xf * xf2;\t\t\t// Matrix-matrix multiplication\n\n\txf=inv(xf2);\t\t\t// Inverse\n\n\tvec v = xf * vec(1,2,3);\t// Matrix-vector multiplication\n\n\txf2=rot_only(xf);\t\t// Just the upper 3x3 of xf\n\n\txf2=trans_only(xf);\t\t// Just the translation of xf\n\n\txf2=norm_xf(xf);\t\t// Inverse transpose, no translation\n\n\tinvert(xf);\t\t\t// Inverts xform in place\n\n\torthogonalize(xf);\t\t// Makes matrix orthogonal\n\n\txf(1,2)=3.0;\t\t\t// Access by row/column\n\n\txf[4]=5.0;\t\t\t// Access in column-major order\n\n\txfname(\"file.ply\")\t\t// Returns string(\"file.xf\")\n\n*/\n\n\n\n#include \"lineqn.h\"\n\n#include <cmath>\n\n#include <algorithm>\n\n#include <iostream>\n\n#include <fstream>\n\n#include <string>\n\nusing std::min;\n\nusing std::max;\n\nusing std::swap;\n\nusing std::sqrt;\n\n\n\ntemplate <class T>\n","file_path":"ExternalLibs/trimesh2/include/XForm.h","rank":74,"score":66283.50570538893},{"content":"#ifdef MP_USE_OPENMP\n\n#include <omp.h> // -- PM\n\n#endif\n\n\n\n// end SHIREEN\n\n\n\n// Praful\n\n#include <vgl/algo/vgl_homg_operators_2d.h>\n\n#include <vgl/vgl_conic.h>\n\n#include <vnl/vnl_matrix.h>\n\n#include <vnl/vnl_vector.h>\n\n#include <vnl/algo/vnl_matrix_inverse.h>\n\n#include <string>\n\n#include <fstream>\n\n#include <cstdlib>\n\n\n\n#include <vcl_compiler.h>\n\n\n\n// Praful end\n\n\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":75,"score":66280.43747655174},{"content":"\n\n// itk files to generate Face Index -- PM\n\n#include \"itkImage.h\"\n\n#include \"itkImageRegionConstIteratorWithIndex.h\"\n\n#include \"itkImageRegionIteratorWithIndex.h\"\n\n#include \"itkImageFileWriter.h\"\n\n#include \"itkTimeProbe.h\"\n\n#include \"itkResampleImageFilter.h\"\n\n#include \"itkIdentityTransform.h\"\n\n#include \"itkLinearInterpolateImageFunction.h\"\n\n#include \"itkBSplineInterpolateImageFunction.h\"\n\n// sets for the face index set\n\n#include <set>\n\n\n\n// Danny Perry's functor\n\n#include \"map.h\"\n\n\n\n///* Prateep */\n\n//// include alglib headers\n\n//#include \"alglib/ap.h\"\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":76,"score":66280.3815230725},{"content":"//#include \"alglibinternal.h\"\n\n//#include \"alglibmisc.h\"\n\n//#include \"solvers.h\"\n\n//#include \"optimization.h\"\n\n//#include \"interpolation.h\"\n\n\n\ntypedef float PixelType;\n\n\n\n//using std::set; // -- PM\n\n\n\n// end SHIREEN\n\n\n\nusing std::vector;\n\nusing std::map;\n\n\n\n// SHIREEN\n\n#include <algorithm>\n\n\n\n#define PI 3.141592653589793\n\n\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":77,"score":66280.21224950379},{"content":"#ifndef TRIMESH_H\n\n#define TRIMESH_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nTriMesh.h\n\nClass for triangle meshes.\n\n*/\n\n\n\n#define LARGENUM 10000000.0\n\n#define ONE 1\n\n#define CURVATURE 2\n\n#define NOISE 3\n\n#define SPEEDTYPE NOISE\n\n\n\n#include \"Vec.h\"\n\n#include \"Color.h\"\n\n#include \"math.h\"\n\n#include <vector>\n\n#include <list>\n\nusing std::vector;\n\n\n\n#define PI 3.1415927\n\n\n","file_path":"ExternalLibs/trimesh2/include/TriMesh2.h","rank":78,"score":66279.85519823593},{"content":"#ifndef TRIMESH_H\n\n#define TRIMESH_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nTriMesh.h\n\nClass for triangle meshes.\n\n*/\n\n\n\n#define LARGENUM 10000000.0\n\n#define ONE 1 \n\n#define CURVATURE 2 \n\n#define NOISE 3\n\n#define EPS 1e-6\n\n//#define SPEEDTYPE ONE\n\n\n\n#include \"Vec.h\"\n\n#include \"Color.h\"\n\n#include \"KDtree.h\"\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":79,"score":66279.31483577761},{"content":"/*\n\n * Copyright (c) 2013 University of Utah\n\n */\n\n\n\n#ifndef __ReduceFilter_H\n\n#define __ReduceFilter_H\n\n\n\n#include <itkImageToImageFilter.h>\n\n\n\ntemplate< \n","file_path":"ExternalLibs/trimesh2/include/ReduceFilter.h","rank":80,"score":66277.96484696813},{"content":"/*\n\n * Copyright (c) 2013 University of Utah\n\n */\n\n\n\n#ifndef __MapFilter_H\n\n#define __MapFilter_H\n\n\n\n#include <itkImageToImageFilter.h>\n\n\n\ntemplate< \n","file_path":"ExternalLibs/trimesh2/include/MapFilter.h","rank":81,"score":66277.96484696813},{"content":"#ifndef KDTREE_H\n\n#define KDTREE_H\n\n/*\n\nSzymon Rusinkiewicz\n\nPrinceton University\n\n\n\nKDtree.h\n\nA K-D tree for points, with limited capabilities (find nearest point to \n\na given point, or to a ray). \n\n*/\n\n\n\n#include <vector>\n\n\n","file_path":"ExternalLibs/trimesh2/include/KDtree.h","rank":82,"score":66277.54235809873},{"content":"\tT h = xf[3]*v[0] + xf[7]*v[1] + xf[11]*v[2] + xf[15];\n\n\th = T(1) / h;\n\n\n\n\treturn S(float(h*(xf[0]*v[0] + xf[4]*v[1] + xf[8]*v[2] + xf[12])),\n\n\t\t float(h*(xf[1]*v[0] + xf[5]*v[1] + xf[9]*v[2] + xf[13])),\n\n\t\t float(h*(xf[2]*v[0] + xf[6]*v[1] + xf[10]*v[2] + xf[14])));\n\n}\n\n\n\n// iostream operators\n\ntemplate <class T>\n\nstatic inline std::ostream &operator << (std::ostream &os, const XForm<T> &m)\n\n{\n\n\tfor (int i = 0; i < 4; i++) {\n\n\t\tfor (int j = 0; j < 4; j++) {\n\n\t\t\tos << m[i+4*j];\n\n\t\t\tif (j == 3)\n\n\t\t\t\tos << std::endl;\n\n\t\t\telse\n\n\t\t\t\tos << \" \";\n\n\t\t}\n","file_path":"ExternalLibs/trimesh2/include/XForm.h","rank":83,"score":66276.93076362945},{"content":" void SetFunctor(FType * f) { m_functor = f; }\n\n const FType * GetFunctor() const { return m_functor; }\n\n FType * GetFunctor() { return m_functor; }\n\n void SetRequestedRegion( const OutRegion & outRegion ){ m_region = outRegion; }\n\n\n\nprotected:\n\n MapFilter();\n\n virtual void AllocateOutputs();\n\n virtual void ThreadedGenerateData(const OutRegion & outputRegionForThread,\n\n itk::ThreadIdType threadId);\n\n\n\nprivate:\n\n FType * m_functor;\n\n OutRegion m_region;\n\n \n\n};\n\n\n\n#include \"MapFilter.hxx\" // implementation\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/MapFilter.h","rank":84,"score":66276.49602396411},{"content":" FType * GetFunctor() { return m_functor; }\n\n\n\n const OutType & GetResult() const { return m_result; }\n\n OutType & GetResult() { return m_result; }\n\n\n\nprotected:\n\n ReduceFilter();\n\n\n\n virtual void BeforeThreadedGenerateData();\n\n virtual void AllocateOutputs();\n\n virtual void ThreadedGenerateData(const InRegion & outputRegionForThread,\n\n itk::ThreadIdType threadId);\n\n virtual void AfterThreadedGenerateData();\n\n\n\nprivate:\n\n FType * m_functor;\n\n OutList m_list;\n\n OutType m_result;\n\n};\n\n\n\n#include \"ReduceFilter.hxx\" // implementation\n\n\n\n#endif\n","file_path":"ExternalLibs/trimesh2/include/ReduceFilter.h","rank":85,"score":66276.46649495444},{"content":" }\n\n }\n\n }\n\n }\n\n else\n\n {\n\n#if SHOW_WARNING\n\n std::cout << \"warning: using kdtree for triangle info because there is no face index map !!! ...\\n\" ;\n\n#endif\n\n\n\n // get vertex closest to first point - x\n\n int vertX = this->FindNearestVertex(x);\n\n unsigned int fNumber;\n\n\n\n // scan all adjacent faces to see which face (f) includes point x\n\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\n\n faceID = this->adjacentfaces[vertX][0];\n\n for (fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\n\n {\n\n // check if face contains x and store barycentric coordinates for x in face f\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":86,"score":66276.40849648166},{"content":" }\n\n }\n\n }\n\n else\n\n {\n\n#if SHOW_WARNING\n\n std::cout << \"warning: using kdtree for triangle info because there is no face index map !!! ...\\n\" ;\n\n#endif\n\n\n\n // get vertex closest to first point - x\n\n vertX = this->FindNearestVertex(x);\n\n\n\n // scan all adjacent faces to see which face (f) includes point x\n\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\n\n for (unsigned int fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\n\n {\n\n // check if face contains x and store barycentric coordinates for x in face f\n\n triangleX = this->faces[ this->adjacentfaces[vertX][fNumber] ];\n\n vec barycentric = this->ComputeBarycentricCoordinates(x,triangleX);\n\n alphaX = barycentric[0];\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":87,"score":66276.13814055776},{"content":" // get vertex closest to first point - x\n\n vertX = this->FindNearestVertex(x);\n\n\n\n // scan all adjacent faces to see which face (f) includes point x\n\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\n\n for (unsigned int fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\n\n {\n\n // check if face contains x and store barycentric coordinates for x in face f\n\n triangleX = this->faces[ this->adjacentfaces[vertX][fNumber] ];\n\n vec barycentric = this->ComputeBarycentricCoordinates(x,triangleX);\n\n alphaX = barycentric[0];\n\n betaX = barycentric[1];\n\n gammaX = barycentric[2];\n\n\n\n if ( ( ( barycentric[0] >= 0 ) && ( barycentric[0] <= 1 ) ) &&\n\n ( ( barycentric[1] >= 0 ) && ( barycentric[1] <= 1 ) ) &&\n\n ( ( barycentric[2] >= 0 ) && ( barycentric[2] <= 1 ) ) )\n\n {\n\n fNumber = this->adjacentfaces[vertX].size();\n\n }\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":88,"score":66276.01409037704},{"content":" // get vertex closest to first point - x\n\n int vertX = this->FindNearestVertex(x);\n\n\n\n // scan all adjacent faces to see which face (f) includes point x\n\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\n\n for (unsigned int fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\n\n {\n\n // check if face contains x and store barycentric coordinates for x in face f\n\n triangleX = this->faces[ this->adjacentfaces[vertX][fNumber] ];\n\n faceID = this->adjacentfaces[vertX][fNumber] ;\n\n vec barycentric = this->ComputeBarycentricCoordinates(x,triangleX);\n\n alphaX = barycentric[0];\n\n betaX = barycentric[1];\n\n gammaX = barycentric[2];\n\n\n\n if ( ( ( barycentric[0] >= 0 ) && ( barycentric[0] <= 1 ) ) &&\n\n ( ( barycentric[1] >= 0 ) && ( barycentric[1] <= 1 ) ) &&\n\n ( ( barycentric[2] >= 0 ) && ( barycentric[2] <= 1 ) ) )\n\n {\n\n fNumber = this->adjacentfaces[vertX].size();\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":89,"score":66275.85143416877},{"content":"\t\txf1[ 1]*xf2[ 4]+xf1[ 5]*xf2[ 5]+xf1[ 9]*xf2[ 6]+xf1[13]*xf2[ 7],\n\n\t\txf1[ 2]*xf2[ 4]+xf1[ 6]*xf2[ 5]+xf1[10]*xf2[ 6]+xf1[14]*xf2[ 7],\n\n\t\txf1[ 3]*xf2[ 4]+xf1[ 7]*xf2[ 5]+xf1[11]*xf2[ 6]+xf1[15]*xf2[ 7],\n\n\t\txf1[ 0]*xf2[ 8]+xf1[ 4]*xf2[ 9]+xf1[ 8]*xf2[10]+xf1[12]*xf2[11],\n\n\t\txf1[ 1]*xf2[ 8]+xf1[ 5]*xf2[ 9]+xf1[ 9]*xf2[10]+xf1[13]*xf2[11],\n\n\t\txf1[ 2]*xf2[ 8]+xf1[ 6]*xf2[ 9]+xf1[10]*xf2[10]+xf1[14]*xf2[11],\n\n\t\txf1[ 3]*xf2[ 8]+xf1[ 7]*xf2[ 9]+xf1[11]*xf2[10]+xf1[15]*xf2[11],\n\n\t\txf1[ 0]*xf2[12]+xf1[ 4]*xf2[13]+xf1[ 8]*xf2[14]+xf1[12]*xf2[15],\n\n\t\txf1[ 1]*xf2[12]+xf1[ 5]*xf2[13]+xf1[ 9]*xf2[14]+xf1[13]*xf2[15],\n\n\t\txf1[ 2]*xf2[12]+xf1[ 6]*xf2[13]+xf1[10]*xf2[14]+xf1[14]*xf2[15],\n\n\t\txf1[ 3]*xf2[12]+xf1[ 7]*xf2[13]+xf1[11]*xf2[14]+xf1[15]*xf2[15]\n\n\t);\n\n}\n\n\n\n\n\n// Component-wise equality and inequality (#include the usual caveats\n\n// about comparing floats for equality...)\n\ntemplate <class T>\n\nstatic inline bool operator == (const XForm<T> &xf1, const XForm<T> &xf2)\n\n{\n","file_path":"ExternalLibs/trimesh2/include/XForm.h","rank":90,"score":66275.23895274666},{"content":" {}\n\n\n\n // Mark invalid\n\n void clear()\n\n {\n\n min = point(std::numeric_limits<float>::max(),\n\n std::numeric_limits<float>::max(),\n\n std::numeric_limits<float>::max());\n\n max = point(std::numeric_limits<float>::min(),\n\n std::numeric_limits<float>::min(),\n\n std::numeric_limits<float>::min());\n\n valid = false;\n\n }\n\n\n\n // Return center point and (vector) diagonal\n\n point center() const { return 0.5f * (min+max); }\n\n vec size() const { return max - min; }\n\n\n\n // Grow a bounding box to encompass a point\n\n BBox &operator += (const point &p)\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":91,"score":66271.6173335092},{"content":"\n\n std::cout << \"Iteratio : \" << ITER_BLOCK << std::endl;\n\n\n\n typedef itk::ImageRegionConstIteratorWithIndex<TIn> It;\n\n It itI(in, threadRegion);\n\n\n\n for(itI.GoToBegin(); !itI.IsAtEnd(); ++itI)\n\n {\n\n if(itI.Get() == 1)\n\n {\n\n point tmPoint;\n\n itk::Image<PixelType, 3>::PointType itkPoint;\n\n in->TransformIndexToPhysicalPoint(itI.GetIndex(), itkPoint);\n\n for(int i = 0; i < 3; i++) { tmPoint[i] = itkPoint[i]; }\n\n\n\n // Get neartest vertex\n\n const float *match = kd->closest_to_pt( tmPoint, 10.0 * sqr( mesh.getMaximumEdgeLength() ) );\n\n if(!match)\n\n {\n\n out_->SetPixel(itI.GetIndex(), -1);\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":92,"score":66271.6173335092},{"content":" }\n\n out_->SetPixel(itI.GetIndex(), fid);\n\n adjFaces.clear();\n\n }\n\n } else {\n\n out_->SetPixel(itI.GetIndex(), -1);\n\n }\n\n\n\n }\n\n }\n\n};\n\n\n\n\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":93,"score":66271.6173335092},{"content":" vector<int> adjFaces; adjFaces.clear();\n\n vector<int>::iterator adjFacesIt;\n\n // find triangles enclosed inside each supervoxel\n\n int tmpInd = mesh.physicalPointToLinearIndex(tmPoint, supVoxelOrigin, supVoxelSpacing, supVoxelSize);\n\n\n\n for(vector<int>::iterator it = superVoxelFaceList[tmpInd].begin(); it != superVoxelFaceList[tmpInd].end(); it++) {\n\n adjFaces.push_back((*it));\n\n }\n\n\n\n // std::cout << \"Number of neighbors : \" << adjFaces.size() << std::endl;\n\n if(adjFaces.empty() )\n\n {\n\n // We can either abort here or ignore the voxel\n\n // typename TIn::IndexType ind = itI.GetIndex();\n\n // std::cout << \"-1 : \" << ind[0] << ' ' << ind[1] << ' ' << ind[2] << std::endl;\n\n out_->SetPixel(itI.GetIndex(), -1);\n\n } else {\n\n\n\n //std::cout << \"Adjacent faces : \" << this->adjacentfaces[imatch].size() << std::endl;\n\n double minDist = LARGENUM;\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":94,"score":66271.6173335092},{"content":" int fid = -1;\n\n for(adjFacesIt = adjFaces.begin(); adjFacesIt != adjFaces.end(); adjFacesIt++) {\n\n point projPoint;\n\n double dist = mesh.pointTriangleDistance(tmPoint, mesh.faces[*(adjFacesIt)], projPoint);\n\n if(dist + EPS <= minDist) {\n\n minDist = dist;\n\n fid = *(adjFacesIt);\n\n }\n\n }\n\n out_->SetPixel(itI.GetIndex(), fid);\n\n adjFaces.clear();\n\n }\n\n\n\n } else {\n\n // typename TIn::IndexType ind = itI.GetIndex();\n\n // std::cout << \"-1 : \" << ind[0] << ' ' << ind[1] << ' ' << ind[2] << std::endl;\n\n out_->SetPixel(itI.GetIndex(), -1);\n\n }\n\n\n\n }\n\n }\n\n};\n\n\n\n/* Prateep */\n\ntemplate<class TIn, class TOut, class Mesh>\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":95,"score":66271.6173335092},{"content":"#ifndef MIN\n\n#define MIN(a,b) ((a)<(b))?(a):(b)\n\n#endif\n\n\n\n#ifndef MAX\n\n#define MAX(a,b) ((a)>(b))?(a):(b)\n\n#endif\n\n\n\nstatic int ITER_BLOCK = 0;\n\n\n\n/*Prateep */\n\ntemplate<class TIn, class TOut, class Mesh>\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":96,"score":66271.6173335092},{"content":" } else {\n\n int imatch = (match - (const float*) &(mesh.vertices[0][0])) / 3;\n\n //std::cout << \"Adjacent faces : \" << mesh.adjacentfaces[imatch].size() << std::endl;\n\n vector<int> adjFaces; adjFaces.clear();\n\n vector<int>::iterator adjFacesIt;\n\n // Check one-ring to get list of adjacent faces\n\n for(size_t f = 0; f < mesh.adjacentfaces[imatch].size(); f++)\n\n {\n\n adjFaces.push_back(mesh.adjacentfaces[imatch][f]);\n\n }\n\n\n\n int fid = 0;\n\n double minDist = LARGENUM;\n\n for(adjFacesIt = adjFaces.begin(); adjFacesIt != adjFaces.end(); adjFacesIt++) {\n\n point projPoint;\n\n double dist = mesh.pointTriangleDistance(tmPoint, mesh.faces[*(adjFacesIt)], projPoint);\n\n if(dist + EPS <= minDist) {\n\n minDist = dist;\n\n fid = *(adjFacesIt);\n\n }\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":97,"score":66271.6173335092},{"content":" }\n\n int &operator[] (int i) { return v[i]; }\n\n const int &operator[] (int i) const { return v[i]; }\n\n operator const int * () const { return &(v[0]); }\n\n operator const int * () { return &(v[0]); }\n\n operator int * () { return &(v[0]); }\n\n int indexof(int v_) const\n\n {\n\n return (v[0] == v_) ? 0 :\n\n (v[1] == v_) ? 1 :\n\n (v[2] == v_) ? 2 : -1;\n\n }\n\n };\n\n\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":98,"score":66271.6173335092},{"content":"\n\n void operator()(const TInP &in, const OutRegion & threadRegion)\n\n {\n\n ITER_BLOCK = ITER_BLOCK + 1;\n\n\n\n std::cout << \"Iteration : \" << ITER_BLOCK << std::endl;\n\n\n\n typedef itk::ImageRegionConstIteratorWithIndex<TIn> It;\n\n It itI(in, threadRegion);\n\n\n\n for(itI.GoToBegin(); !itI.IsAtEnd(); ++itI) {\n\n\n\n if(itI.Get() == 1)\n\n {\n\n point tmPoint;\n\n typename TIn::PointType itkPoint;\n\n in->TransformIndexToPhysicalPoint(itI.GetIndex(), itkPoint);\n\n for(int i = 0; i < 3; i++) { tmPoint[i] = itkPoint[i]; }\n\n\n\n // Get neartest k vertices\n","file_path":"ExternalLibs/trimesh2/include/TriMesh.h","rank":99,"score":66271.6173335092}],"string":"[\n {\n \"content\": \"// Constrained Delaunay Triangulation types\\n\\n#include <CGAL/Constrained_Delaunay_triangulation_2.h>\\n\\n#include <CGAL/Constrained_triangulation_plus_2.h>\\n\\n\\n\\n// Axis-align boxes for all-pairs self-intersection detection\\n\\n#include <CGAL/point_generators_3.h>\\n\\n#include <CGAL/Bbox_3.h>\\n\\n#include <CGAL/box_intersection_d.h>\\n\\n#include <CGAL/function_objects.h>\\n\\n#include <CGAL/Join_input_iterator.h>\\n\\n#include <CGAL/algorithm.h>\\n\\n#include <vector>\\n\\n\\n\\n// Axis-aligned bounding box tree for tet tri intersection\\n\\n#include <CGAL/AABB_tree.h>\\n\\n#include <CGAL/AABB_traits.h>\\n\\n#include <CGAL/AABB_triangle_primitive.h>\\n\\n\\n\\n// Boolean operations\\n\\n#include <CGAL/Polyhedron_3.h>\\n\",\n \"file_path\": \"Post/source/ShapeWorksPost-V1/include/igl/copyleft/cgal/CGAL_includes.hpp\",\n \"rank\": 0,\n \"score\": 73865.9029288347\n },\n {\n \"content\": \"// Is this actually used?\\n\\n//#include <CGAL/Nef_polyhedron_3.h>\\n\\n\\n\\n// Delaunay Triangulation in 3D\\n\\n#include <CGAL/Delaunay_triangulation_3.h>\\n\\n\\n\\n#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>\\n\\n#include <CGAL/Exact_predicates_exact_constructions_kernel.h>\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Post/source/ShapeWorksPost-V1/include/igl/copyleft/cgal/CGAL_includes.hpp\",\n \"rank\": 1,\n \"score\": 73865.38533171169\n },\n {\n \"content\": \"// This file is part of libigl, a simple c++ geometry processing library.\\n\\n// \\n\\n// Copyright (C) 2014 Alec Jacobson <alecjacobson@gmail.com>\\n\\n// \\n\\n// This Source Code Form is subject to the terms of the Mozilla Public License \\n\\n// v. 2.0. If a copy of the MPL was not distributed with this file, You can \\n\\n// obtain one at http://mozilla.org/MPL/2.0/.\\n\\n#ifndef IGL_CGAL_INCLUDES_H\\n\\n#define IGL_CGAL_INCLUDES_H\\n\\n\\n\\n// This causes unknown bugs during intersection meshing:\\n\\n//// http://www.alecjacobson.com/weblog/?p=4291\\n\\n//#define CGAL_INTERSECTION_VERSION 1\\n\\n// Use this instead to mute errors resulting from bad CGAL assertions\\n\\n#define CGAL_KERNEL_NO_ASSERTIONS\\n\\n// Triangle triangle intersection\\n\\n#include <CGAL/intersections.h>\\n\\n// THIS CANNOT BE INCLUDED IN THE SAME FILE AS <CGAL/intersections.h>\\n\\n// #include <CGAL/Boolean_set_operations_2.h>\\n\\n\\n\",\n \"file_path\": \"Post/source/ShapeWorksPost-V1/include/igl/copyleft/cgal/CGAL_includes.hpp\",\n \"rank\": 2,\n \"score\": 73864.69994437615\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_ARB_shading_language_include;\\n\",\n \"file_path\": \"Post/source/ShapeWorksPost-V1/external/nanogui/ext/glew/include/GL/glew.h\",\n \"rank\": 3,\n \"score\": 68466.86863569455\n },\n {\n \"content\": \"\\n\\nAlso defines the utility functions sqr, cube, sgn, fract, clamp, mix,\\n\\nstep, smoothstep, faceforward, reflect, and refract\\n\\n*/\\n\\n\\n\\n\\n\\n// Windows defines these as macros, which prevents us from using the\\n\\n// type-safe versions from std::, as well as interfering with method defns\\n\\n#undef min\\n\\n#undef max\\n\\n\\n\\n\\n\\n#include <cmath>\\n\\n#include <iostream>\\n\\n#include <algorithm>\\n\\nusing std::min;\\n\\nusing std::max;\\n\\nusing std::swap;\\n\\nusing std::sqrt;\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 4,\n \"score\": 67340.98445279848\n },\n {\n \"content\": \"#include \\\"Vec.h\\\"\\n\\n#include <cmath>\\n\\n#include <algorithm>\\n\\nusing std::fmod;\\n\\nusing std::floor;\\n\\nusing std::min;\\n\\nusing std::max;\\n\\n#ifndef M_PI\\n\\n# define M_PI 3.14159265358979323846\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 5,\n \"score\": 67336.53854041098\n },\n {\n \"content\": \"#ifndef NOISE3D_H\\n\\n#define NOISE3D_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nnoise3d.h\\n\\nA class for 3-D noise functions, including white noise and 1/f noise\\n\\n*/\\n\\n\\n\\n#include <math.h>\\n\\n#include <algorithm>\\n\\n#include <vector>\\n\\nusing std::max;\\n\\nusing std::swap;\\n\\nusing std::vector;\\n\\n\\n\\n\\n\\n// Quick 'n dirty portable random number generator \\n\\nstatic inline float tinyrnd()\\n\\n{\\n\\n\\tstatic unsigned trand = 0;\\n\\n\\ttrand = 1664525u * trand + 1013904223u;\\n\\n\\treturn (float) trand / 4294967296.0f;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/noise3d.h\",\n \"rank\": 6,\n \"score\": 67336.35232051015\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2013 University of Utah\\n\\n */\\n\\n\\n\\n#ifndef __map_H\\n\\n#define __map_H\\n\\n\\n\\n#include \\\"MapFilter.h\\\"\\n\\n#include \\\"ReduceFilter.h\\\"\\n\\n\\n\\nnamespace bambam\\n\\n{\\n\\n\\n\\n/**\\n\\n * map is an abstraction of mapping over threads to simplify (and restrict) things a bit.\\n\\n *\\n\\n * the passed in functor should have an \\n\\n * void operator()(TInputImage::ConstPointer in, const TOutputImage::RegionType & threadRegion)\\n\\n *\\n\\n * with the idea of updating out with the results of the map and the functor will hold any state information you need as you go.\\n\\n */\\n\\ntemplate<class TInputImage,\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/map.h\",\n \"rank\": 7,\n \"score\": 67334.98907264895\n },\n {\n \"content\": \"#ifndef BSPHERE_H\\n\\n#define BSPHERE_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nbsphere.h\\n\\nBounding sphere computation, based on the \\\"miniball\\\" package by\\n\\nBernd Gaertner, based on algorithms by Welzl and Gaertner. The\\n\\noriginal code is distributed under the GPL, and is available from\\n\\nhttp://www.inf.ethz.ch/personal/gaertner/miniball.html\\n\\nThe original copyright notice can be found at the end of this file.\\n\\n*/\\n\\n\\n\\n\\n\\n#include \\\"Vec.h\\\"\\n\\n#include <list>\\n\\n\\n\\n\\n\\n// Class for a basis of points supporting a bounding sphere\\n\\ntemplate<int D, class T>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 8,\n \"score\": 67334.98907264895\n },\n {\n \"content\": \"\\t\\t\\t\\t// NOTE: scalar has to be the same type:\\n\\n\\t\\t\\t\\t// it won't work to do double * vec<float>\\n\\n\\tv1 = min(v2,v3);\\t// Componentwise min/max\\n\\n\\tv1 = sin(v2);\\t\\t// Componentwise - all the usual functions...\\n\\n\\tswap(v1,v2);\\t\\t// In-place swap\\n\\n\\n\\n\\tv3 = v1 DOT v2;\\t\\t// Actually operator^\\n\\n\\tv3 = v1 CROSS v2;\\t// Actually operator%\\n\\n\\n\\n\\tfloat f = v1[0];\\t// Subscript\\n\\n\\tfloat *fp = v1;\\t\\t// Implicit conversion to float *\\n\\n\\n\\n\\tf = len(v1);\\t\\t// Length (also len2 == squared length)\\n\\n\\tf = dist(p1, p2);\\t// Distance (also dist2 == squared distance)\\n\\n\\tnormalize(v1);\\t\\t// Normalize (i.e., make it unit length)\\n\\n\\t\\t\\t\\t// normalize(vec(0,0,0)) => vec(1,0,0)\\n\\n\\tv1 = trinorm(p1,p2,p3); // Normal of triangle\\n\\n\\n\\n\\tcout << v1 << endl;\\t// iostream output in the form (1,2,3)\\n\\n\\tcin >> v2;\\t\\t// iostream input using the same syntax\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 9,\n \"score\": 67334.35299268759\n },\n {\n \"content\": \"\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = x / v[i];\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator / (const Vec<D,T> &v, const T &x)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = v[i] / x;\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\n\\n\\n// iostream operators\\n\\ntemplate <int D, class T>\\n\\nstatic inline std::ostream &operator << (std::ostream &os, const Vec<D,T> &v)\\n\\n\\n\\n{\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 10,\n \"score\": 67333.80448238988\n },\n {\n \"content\": \"#ifndef COLOR_H\\n\\n#define COLOR_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nColor.h\\n\\nRandom class for encapsulating colors...\\n\\n\\n\\nDue to all the possible colorspace variants, here's the documentation of\\n\\nwhat is actually implemented:\\n\\n - CIE 1931 2-degree observer\\n\\n - D65 illuminant (including for CIELAB - it's not D50)\\n\\n - Rec. 709 primaries\\n\\n - Range of [0..1] for all spaces except CIELAB and hue in HSV\\n\\n - \\\"RGB\\\" means linear-scaled RGB with the above illuminant and primaries\\n\\n - HSV is single-hexcone, sRGB\\n\\n - Y'CbCr is JFIF-standard (Rec. 601 scaling, full excursion) starting from sRGB\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 11,\n \"score\": 67333.32264172882\n },\n {\n \"content\": \"#define DOT ^\\n\\n\\n\\n// Cross product - only in 3 dimensions\\n\\ntemplate <class T>\\n\\nstatic inline const Vec<3,T> operator % (const Vec<3,T> &v1, const Vec<3,T> &v2)\\n\\n{\\n\\n\\treturn Vec<3,T>(v1[1]*v2[2] - v1[2]*v2[1],\\n\\n\\t\\t\\tv1[2]*v2[0] - v1[0]*v2[2],\\n\\n\\t\\t\\tv1[0]*v2[1] - v1[1]*v2[0]);\\n\\n}\\n\\n#define CROSS %\\n\\n\\n\\n\\n\\n// Component-wise equality and inequality (#include the usual caveats\\n\\n// about comparing floats for equality...)\\n\\ntemplate <int D, class T>\\n\\nstatic inline bool operator == (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tif (v1[i] != v2[i])\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 12,\n \"score\": 67333.1851643283\n },\n {\n \"content\": \"\\t\\t\\treturn false;\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline bool operator != (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tif (v1[i] != v2[i])\\n\\n\\t\\t\\treturn true;\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\n\\n\\n// Unary operators\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> &operator + (const Vec<D,T> &v)\\n\\n{\\n\\n\\treturn v;\\n\\n}\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 13,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \" { \\\\\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED); \\\\\\n\\n\\tfor (int i = 0; i < D; i++) \\\\\\n\\n\\t\\tresult[i] = name(v[i]); \\\\\\n\\n\\treturn result; \\\\\\n\\n }\\n\\n\\n\\n#define VEC_DECLARE_TWOARG(name) \\\\\\n\\n template <int D, class T> \\\\\\n\\n static inline Vec<D,T> name(const Vec<D,T> &v, const T &w) \\\\\\n\\n { \\\\\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED); \\\\\\n\\n\\tfor (int i = 0; i < D; i++) \\\\\\n\\n\\t\\tresult[i] = name(v[i], w); \\\\\\n\\n\\treturn result; \\\\\\n\\n } \\\\\\n\\n template <int D, class T> \\\\\\n\\n static inline Vec<D,T> name(const Vec<D,T> &v, const Vec<D,T> &w) \\\\\\n\\n { \\\\\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED); \\\\\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 14,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\n\\n// Let gcc optimize conditional branches a bit better...\\n\\n#ifndef likely\\n\\n# if !defined(__GNUC__) || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)\\n\\n# define likely(x) (x)\\n\\n# define unlikely(x) (x)\\n\\n# else\\n\\n# define likely(x) (__builtin_expect((x), 1))\\n\\n# define unlikely(x) (__builtin_expect((x), 0))\\n\\n# endif\\n\\n#endif\\n\\n\\n\\n\\n\\n// Boost-like compile-time assertion checking\\n\\ntemplate <bool X> struct VEC_STATIC_ASSERTION_FAILURE;\\n\\ntemplate <> struct VEC_STATIC_ASSERTION_FAILURE<true>\\n\\n\\t{ void operator () () {} };\\n\\n#define VEC_STATIC_CHECK(expr) VEC_STATIC_ASSERTION_FAILURE<bool(expr)>()\\n\\n\\n\\n\\n\\ntemplate <int D, class T = float>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 15,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\n\\n\\t// Some partial compatibility with valarrays and vectors\\n\\n\\ttypedef T value_type;\\n\\n\\tsize_t size() const\\n\\n\\t\\t{ return D; }\\n\\n\\tT sum() const\\n\\n\\t\\t{ T total = v[0];\\n\\n\\t\\t for (int i = 1; i < D; i++) total += v[i];\\n\\n\\t\\t return total; }\\n\\n\\tT avg() const\\n\\n\\t\\t{ return sum() / D; }\\n\\n\\tT product() const\\n\\n\\t\\t{ T total = v[0];\\n\\n\\t\\t for (int i = 1; i < D; i++) total *= v[i];\\n\\n\\t\\t return total; }\\n\\n\\tT min() const\\n\\n\\t\\t{ T m = v[0];\\n\\n\\t\\t for (int i = 1; i < D; i++)\\n\\n\\t\\t\\tif (v[i] < m) m = v[i];\\n\\n\\t\\t return m; }\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 16,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tT max() const\\n\\n\\t\\t{ T m = v[0];\\n\\n\\t\\t for (int i = 1; i < D; i++)\\n\\n\\t\\t\\tif (v[i] > m) m = v[i];\\n\\n\\t\\t return m; }\\n\\n\\tT *begin() { return &(v[0]); }\\n\\n\\tconst T *begin() const { return &(v[0]); }\\n\\n\\tT *end() { return begin() + D; }\\n\\n\\tconst T *end() const { return begin() + D; }\\n\\n\\tvoid clear() { for (int i = 0; i < D; i++) v[i] = T(0); }\\n\\n\\tbool empty() const\\n\\n\\t\\t{ for (int i = 0; i < D; i++)\\n\\n\\t\\t\\tif (v[i]) return false;\\n\\n\\t\\t return true; }\\n\\n\\tVec<D,T> apply(T func(T)) const\\n\\n\\t\\t{ Vec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\t\\t for (int i = 0; i < D; i++) result[i] = func(v[i]);\\n\\n\\t\\t return result; }\\n\\n\\tVec<D,T> apply(T func(const T&)) const\\n\\n\\t\\t{ Vec<D,T> result(VEC_UNINITIALIZED);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 17,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t inv_cielab_nonlinearity(v[2]));\\n\\n\\t\\t\\tcase SRGB:\\n\\n\\t\\t\\tcase YCBCR:\\n\\n\\t\\t\\t\\treturn Color(inv_srgb_nonlinearity(v[0]),\\n\\n\\t\\t\\t\\t\\t inv_srgb_nonlinearity(v[1]),\\n\\n\\t\\t\\t\\t\\t inv_srgb_nonlinearity(v[2]));\\n\\n\\t\\t\\tdefault:\\n\\n\\t\\t\\t\\treturn Color(*this);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t// For backwards compatibility with earlier versions of Color.h,\\n\\n\\t// this stays as a static method. New code should use convert().\\n\\n\\tstatic Color hsv(float h, float s, float v)\\n\\n\\t{\\n\\n\\t\\treturn Color(h,s,v).hsv2srgb();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 18,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\tysize = 2;\\n\\n\\n\\n\\t\\tint i;\\n\\n\\t\\tint pxy = max(xsize, ysize);\\n\\n\\t\\tfor (i = 0; i < pxy; i++)\\n\\n\\t\\t\\tp.push_back(i);\\n\\n\\t\\tfor (i = 0; i < pxy; i++) {\\n\\n\\t\\t\\tint j = int(tinyrnd()*pxy);\\n\\n\\t\\t\\tswap(p[i], p[j]);\\n\\n\\t\\t}\\n\\n\\t\\tfor (i = pxy; i < pxy+ysize; i++)\\n\\n\\t\\t\\tp.push_back(p[i-pxy]);\\n\\n\\t\\tfor (i = 0; i < pxy + zsize; i++)\\n\\n\\t\\t\\tr.push_back(tinyrnd());\\n\\n\\t}\\n\\n\\n\\n\\tvirtual float lookup(float x, float y, float z) const\\n\\n\\t{\\n\\n\\t\\tx -= floor(x);\\n\\n\\t\\ty -= floor(y);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/noise3d.h\",\n \"rank\": 19,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tfloat fy = (v[0] + 16.0f) * (1.0f / 116.0f);\\n\\n\\t\\tfloat fx = fy + v[1] * 0.002f;\\n\\n\\t\\tfloat fz = fy - v[2] * 0.005f;\\n\\n\\t\\treturn Color(0.95047f * inv_cielab_nonlinearity(fx),\\n\\n\\t\\t\\t inv_cielab_nonlinearity(fy),\\n\\n\\t\\t\\t 1.08883f * inv_cielab_nonlinearity(fz));\\n\\n\\t}\\n\\n\\n\\n\\tconst Color xyz2rgb() const\\n\\n\\t{\\n\\n\\t\\treturn col_transform(3.24071f, -1.53726f, -0.498571f,\\n\\n \\t\\t\\t\\t -0.969258f, 1.87599f, 0.0415557f,\\n\\n\\t\\t\\t\\t 0.0556352f, -0.203996f, 1.05707f);\\n\\n\\t}\\n\\n\\tconst Color rgb2xyz() const\\n\\n\\t{\\n\\n\\t\\treturn col_transform(0.412424f, 0.357579f, 0.180464f,\\n\\n\\t\\t\\t\\t 0.212656f, 0.715158f, 0.0721856f,\\n\\n\\t\\t\\t\\t 0.0193324f, 0.119193f, 0.950444f);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 20,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tVec<D,T> &operator += (const Vec<D,T> &x)\\n\\n\\t{\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n#pragma omp atomic\\n\\n\\t\\t\\tv[i] += x[i];\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\tVec<D,T> &operator -= (const Vec<D,T> &x)\\n\\n\\t{\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n#pragma omp atomic\\n\\n\\t\\t\\tv[i] -= x[i];\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\tVec<D,T> &operator *= (const Vec<D,T> &x)\\n\\n\\t{\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n#pragma omp atomic\\n\\n\\t\\t\\tv[i] *= x[i];\\n\\n\\t\\treturn *this;\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 21,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator / (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = v1[i] / v2[i];\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\n// Dot product in any dimension\\n\\ntemplate <int D, class T>\\n\\nstatic inline const T operator ^ (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tT sum = v1[0] * v2[0];\\n\\n\\tfor (int i = 1; i < D; i++)\\n\\n\\t\\tsum += v1[i] * v2[i];\\n\\n\\treturn sum;\\n\\n}\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 22,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tc[0][j] = 0;\\n\\n\\tcurrent_c = c[0];\\n\\n\\tcurrent_sqr_r = -1;\\n\\n}\\n\\n\\n\\n\\n\\ntemplate <int D, class T>\\n\\nbool Basis<D,T>::push(const Vec<D,T> &p)\\n\\n{\\n\\n\\tint i, j;\\n\\n\\tconst T eps = T(1.0e-13);\\n\\n\\tif (m == 0) {\\n\\n\\t\\tfor (i = 0; i < D; i++)\\n\\n\\t\\t\\tq0[i] = p[i];\\n\\n\\t\\tfor (i = 0; i < D; i++)\\n\\n\\t\\t\\tc[0][i] = q0[i];\\n\\n\\t\\tsqr_r[0] = 0;\\n\\n\\t} else {\\n\\n\\t\\t// set v_m to Q_m\\n\\n\\t\\tfor (i = 0; i < D; i++)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 23,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t for (int i = 0; i < D; i++) result[i] = func(v[i]);\\n\\n\\t\\t return result; }\\n\\n};\\n\\n\\n\\ntypedef Vec<3,float> vec;\\n\\ntypedef Vec<3,float> point;\\n\\ntypedef Vec<2,float> vec2;\\n\\ntypedef Vec<3,float> vec3;\\n\\ntypedef Vec<4,float> vec4;\\n\\ntypedef Vec<2,int> ivec2;\\n\\ntypedef Vec<3,int> ivec3;\\n\\ntypedef Vec<4,int> ivec4;\\n\\n\\n\\n\\n\\n// Nonmember operators that take two Vecs\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator + (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 24,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t}\\n\\n\\tVec<D,T> &operator *= (const T &x)\\n\\n\\t{\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n#pragma omp atomic\\n\\n\\t\\t\\tv[i] *= x;\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\tVec<D,T> &operator /= (const Vec<D,T> &x)\\n\\n\\t{\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n#pragma omp atomic\\n\\n\\t\\t\\tv[i] /= x[i];\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\tVec<D,T> &operator /= (const T &x)\\n\\n\\t{\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n#pragma omp atomic\\n\\n\\t\\t\\tv[i] /= x;\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 25,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = x * v[i];\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator * (const Vec<D,T> &v, const T &x)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = v[i] * x;\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator / (const T &x, const Vec<D,T> &v)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 26,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"}\\n\\n\\n\\n// Square function moved up -- pm\\n\\n\\n\\ntemplate <class T>\\n\\nstatic inline T cube(const T &x)\\n\\n{\\n\\n\\treturn x*x*x;\\n\\n}\\n\\n\\n\\n\\n\\n// Sign of a scalar\\n\\ntemplate <class T>\\n\\nstatic inline T sgn(const T &x)\\n\\n{\\n\\n\\treturn (x < T(0)) ? T(-1) : T(1);\\n\\n}\\n\\n\\n\\n\\n\\n// Utility functions based on GLSL\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 27,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tif (c1 == '(' && c2 != ')')\\n\\n\\t\\tis.setstate(std::ios::failbit);\\n\\n\\telse if (c1 == '[' && c2 != ']')\\n\\n\\t\\tis.setstate(std::ios::failbit);\\n\\n\\n\\n\\treturn is;\\n\\n}\\n\\n\\n\\n// Utility functions for square and cube, to go along with sqrt and cbrt\\n\\ntemplate <class T>\\n\\nstatic inline T sqr(const T &x)\\n\\n{\\n\\n\\treturn x*x;\\n\\n}\\n\\n\\n\\n\\n\\n// Functions on Vecs\\n\\ntemplate <int D, class T>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 28,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \" }\\n\\n\\n\\nVEC_DECLARE_ONEARG(fabs)\\n\\nVEC_DECLARE_ONEARG(floor)\\n\\nVEC_DECLARE_ONEARG(ceil)\\n\\nVEC_DECLARE_ONEARG(round)\\n\\nVEC_DECLARE_ONEARG(trunc)\\n\\nVEC_DECLARE_ONEARG(sin)\\n\\nVEC_DECLARE_ONEARG(asin)\\n\\nVEC_DECLARE_ONEARG(cos)\\n\\nVEC_DECLARE_ONEARG(acos)\\n\\nVEC_DECLARE_ONEARG(tan)\\n\\nVEC_DECLARE_ONEARG(atan)\\n\\nVEC_DECLARE_ONEARG(exp)\\n\\nVEC_DECLARE_ONEARG(log)\\n\\nVEC_DECLARE_ONEARG(sqrt)\\n\\nVEC_DECLARE_ONEARG(sqr)\\n\\nVEC_DECLARE_ONEARG(cbrt)\\n\\nVEC_DECLARE_ONEARG(cube)\\n\\nVEC_DECLARE_ONEARG(sgn)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 29,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tos << \\\"(\\\";\\n\\n\\tfor (int i = 0; i < D-1; i++)\\n\\n\\t\\tos << v[i] << \\\", \\\";\\n\\n\\treturn os << v[D-1] << \\\")\\\";\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline std::istream &operator >> (std::istream &is, Vec<D,T> &v)\\n\\n{\\n\\n\\tchar c1 = 0, c2 = 0;\\n\\n\\n\\n\\tis >> c1;\\n\\n\\tif (c1 == '(' || c1 == '[') {\\n\\n\\t\\tis >> v[0] >> std::ws >> c2;\\n\\n\\t\\tfor (int i = 1; i < D; i++) {\\n\\n\\t\\t\\tif (c2 == ',')\\n\\n\\t\\t\\t\\tis >> v[i] >> std::ws >> c2;\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t\\tis.setstate(std::ios::failbit);\\n\\n\\t\\t}\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 30,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tColor &operator = (int c)\\n\\n\\t\\t{ return *this = Color(c); }\\n\\n\\n\\n\\tstatic Color black()\\n\\n\\t\\t{ return Color(0.0f, 0.0f, 0.0f); }\\n\\n\\tstatic Color white()\\n\\n\\t\\t{ return Color(1.0f, 1.0f, 1.0f); }\\n\\n\\tstatic Color red()\\n\\n\\t\\t{ return Color(1.0f, 0.0f, 0.0f); }\\n\\n\\tstatic Color green()\\n\\n\\t\\t{ return Color(0.0f, 1.0f, 0.0f); }\\n\\n\\tstatic Color blue()\\n\\n\\t\\t{ return Color(0.0f, 0.0f, 1.0f); }\\n\\n\\tstatic Color yellow()\\n\\n\\t\\t{ return Color(1.0f, 1.0f, 0.0f); }\\n\\n\\tstatic Color cyan()\\n\\n\\t\\t{ return Color(0.0f, 1.0f, 1.0f); }\\n\\n\\tstatic Color magenta()\\n\\n\\t\\t{ return Color(1.0f, 0.0f, 1.0f); }\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 31,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tresult[i] = v1[i] + v2[i];\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator - (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = v1[i] - v2[i];\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator * (const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = v1[i] * v2[i];\\n\\n\\treturn result;\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 32,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\telse\\n\\n\\t\\t\\treturn 4.0f / 29.0f + (841.0f / 108.0f) * x;\\n\\n\\t}\\n\\n\\tstatic inline float inv_cielab_nonlinearity(float x)\\n\\n\\t{\\n\\n\\t\\tif (x > (6.0f / 29.0f))\\n\\n\\t\\t\\treturn cube(x);\\n\\n\\t\\telse\\n\\n\\t\\t\\treturn (x - 4.0f / 29.0f) * (108.0f / 841.0f);\\n\\n\\t}\\n\\n\\tconst Color xyz2cielab() const\\n\\n\\t{\\n\\n\\t\\tfloat fx = cielab_nonlinearity(v[0] * (1.0f / 0.95047f));\\n\\n\\t\\tfloat fy = cielab_nonlinearity(v[1]);\\n\\n\\t\\tfloat fz = cielab_nonlinearity(v[2] * (1.0f / 1.08883f));\\n\\n\\t\\treturn Color(116.0f * fy - 16.0f,\\n\\n\\t\\t\\t 500.0f * (fx - fy),\\n\\n\\t\\t\\t 200.0f * (fy - fz));\\n\\n\\t}\\n\\n\\tconst Color cielab2xyz() const\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 33,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tfor (int pass = 0 ; pass < passes; pass++, factor *= MAGIC_SCALE) {\\n\\n\\t\\t\\tfloat r = 1.0f / factor;\\n\\n\\t\\t\\tt += Noise3D::lookup(x*r,y*r,z*r) * factor;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\treturn t * correction;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/noise3d.h\",\n \"rank\": 34,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tfloat H = 0.0f;\\n\\n\\t\\tif (S == 0.0f)\\n\\n\\t\\t\\treturn Color(H, S, V);\\n\\n\\t\\tif (V == v[0])\\n\\n\\t\\t\\tH = (v[1] - v[2]) / diff;\\n\\n\\t\\telse if (V == v[1])\\n\\n\\t\\t\\tH = (v[2] - v[0]) / diff + 2.0f;\\n\\n\\t\\telse\\n\\n\\t\\t\\tH = (v[0] - v[1]) / diff + 4.0f;\\n\\n\\t\\tH *= float(M_PI / 3.0);\\n\\n\\t\\tif (H < 0.0f)\\n\\n\\t\\t\\tH += float(2.0 * M_PI);\\n\\n\\t\\treturn Color(H, S, V);\\n\\n\\t}\\n\\n\\n\\n\\tstatic inline float cielab_nonlinearity(float x)\\n\\n\\t{\\n\\n\\t\\tif (x > 216.0f / 24389.0f)\\n\\n\\t\\t\\t//return cbrt(x);\\n\\n return (float)(std::pow( std::abs ( x ), 1.0f / 3.0f ));\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 35,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator - (const Vec<D,T> &v)\\n\\n{\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED);\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tresult[i] = -v[i];\\n\\n\\treturn result;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline bool operator ! (const Vec<D,T> &v)\\n\\n{\\n\\n\\treturn v.empty();\\n\\n}\\n\\n\\n\\n\\n\\n// Vec/scalar operators\\n\\ntemplate <int D, class T>\\n\\nstatic inline const Vec<D,T> operator * (const T &x, const Vec<D,T> &v)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 36,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tH *= float(3.0 / M_PI);\\n\\n\\t\\tint i = int(floor(H));\\n\\n\\t\\tfloat f = H - i;\\n\\n\\t\\tfloat p = V * (1.0f - S);\\n\\n\\t\\tfloat q = V * (1.0f - (S*f));\\n\\n\\t\\tfloat t = V * (1.0f - (S*(1.0f-f)));\\n\\n\\t\\tswitch(i) {\\n\\n\\t\\t\\tcase 0: return Color(V, t, p);\\n\\n\\t\\t\\tcase 1: return Color(q, V, p);\\n\\n\\t\\t\\tcase 2: return Color(p, V, t);\\n\\n\\t\\t\\tcase 3: return Color(p, q, V);\\n\\n\\t\\t\\tcase 4: return Color(t, p, V);\\n\\n\\t\\t\\tdefault: return Color(V, p, q);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tconst Color srgb2hsv() const\\n\\n\\t{\\n\\n\\t\\tfloat V = std::max(std::max(v[0], v[1]), v[2]);\\n\\n\\t\\tfloat diff = V - std::min(std::min(v[0], v[1]), v[2]);\\n\\n\\t\\tfloat S = diff / V;\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 37,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\t srgb_nonlinearity(v[2]));\\n\\n\\t}\\n\\n\\tconst Color srgb2rgb() const\\n\\n\\t{\\n\\n\\t\\treturn Color(inv_srgb_nonlinearity(v[0]),\\n\\n\\t\\t\\t inv_srgb_nonlinearity(v[1]),\\n\\n\\t\\t\\t inv_srgb_nonlinearity(v[2]));\\n\\n\\t}\\n\\n\\n\\n\\tconst Color srgb2ycbcr() const\\n\\n\\t{\\n\\n\\t\\treturn Color(0.0f, 0.5f, 0.5f) + col_transform(\\n\\n\\t\\t\\t0.299f, 0.587f, 0.114f,\\n\\n\\t\\t\\t-0.168736f, -0.331264f, 0.5f,\\n\\n\\t\\t\\t0.5f, -0.418688f, -0.081312f);\\n\\n\\t}\\n\\n\\tconst Color ycbcr2srgb() const\\n\\n\\t{\\n\\n\\t\\treturn Color(v[0], v[1] - 0.5f, v[2] - 0.5f).col_transform(\\n\\n\\t\\t\\t 1.0f, 0.0f, 1.402f,\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 38,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tfor (int i = 0; i < D; i++) \\\\\\n\\n\\t\\tresult[i] = name(v[i], w[i]); \\\\\\n\\n\\treturn result; \\\\\\n\\n }\\n\\n#define VEC_DECLARE_THREEARG(name) \\\\\\n\\n template <int D, class T> \\\\\\n\\n static inline Vec<D,T> name(const Vec<D,T> &v, const T &w, const T &x) \\\\\\n\\n { \\\\\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED); \\\\\\n\\n\\tfor (int i = 0; i < D; i++) \\\\\\n\\n\\t\\tresult[i] = name(v[i], w, x); \\\\\\n\\n\\treturn result; \\\\\\n\\n } \\\\\\n\\n template <int D, class T> \\\\\\n\\n static inline Vec<D,T> name(const Vec<D,T> &v, const Vec<D,T> &w, const Vec<D,T> &x) \\\\\\n\\n { \\\\\\n\\n\\tVec<D,T> result(VEC_UNINITIALIZED); \\\\\\n\\n\\tfor (int i = 0; i < D; i++) \\\\\\n\\n\\t\\tresult[i] = name(v[i], w[i], x[i]); \\\\\\n\\n\\treturn result; \\\\\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 39,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"#ifndef VEC_H\\n\\n#define VEC_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nVec.h\\n\\nClass for a constant-length vector\\n\\n\\n\\nSupports the following operations:\\n\\n\\tvec v1;\\t\\t\\t// Initialized to (0,0,0)\\n\\n\\tvec v2(1,2,3);\\t\\t// Initialized to (1,2,3)\\n\\n\\tvec v3(v2);\\t\\t// Copy constructor\\n\\n\\tfloat farray[3];\\n\\n\\tvec v4 = vec(farray);\\t// Explicit: \\\"v4 = farray\\\" won't work\\n\\n\\tVec<3,double> vd;\\t// The \\\"vec\\\" used above is Vec<3,float>\\n\\n\\tpoint p1, p2, p3;\\t// Same as vec\\n\\n\\n\\n\\tv3 = v1 + v2;\\t\\t// Also -, *, / (all componentwise)\\n\\n\\tv3 = 3.5f * v1;\\t\\t// Also vec * scalar, vec / scalar\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 40,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tT squared_radius() const { return B.squared_radius(); }\\n\\n};\\n\\n\\n\\n\\n\\ntemplate <int D, class T>\\n\\nT Basis<D,T>::excess(const Vec<D,T> &p) const\\n\\n{\\n\\n\\tT e = -current_sqr_r;\\n\\n\\tfor (int k = 0; k < D; k++)\\n\\n\\t\\te += sqr(p[k] - current_c[k]);\\n\\n\\treturn e;\\n\\n}\\n\\n\\n\\n\\n\\ntemplate <int D, class T>\\n\\nvoid Basis<D,T>::reset()\\n\\n{\\n\\n\\tm = s = 0;\\n\\n\\t// we misuse c[0] for the center of the empty sphere\\n\\n\\tfor (int j = 0; j < D; j++)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 41,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\n\\ntemplate <int D, class T>\\n\\nstatic inline const T dist2(const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tT d2 = sqr(v2[0]-v1[0]);\\n\\n\\tfor (int i = 1; i < D; i++)\\n\\n\\t\\td2 += sqr(v2[i]-v1[i]);\\n\\n\\treturn d2;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const T dist(const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\treturn sqrt(dist2(v1,v2));\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline Vec<D,T> normalize(Vec<D,T> &v)\\n\\n{\\n\\n\\tT l = len(v);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 42,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t{}\\n\\n\\texplicit Color(double c) : Vec<3,float>((float)c, (float)c, (float)c)\\n\\n\\t\\t{}\\n\\n\\tColor &operator = (float c)\\n\\n\\t\\t{ return *this = Color(c); }\\n\\n\\tColor &operator = (double c)\\n\\n\\t\\t{ return *this = Color(c); }\\n\\n\\n\\n\\t// Assigning from ints divides by 255\\n\\n\\tColor(int r, int g, int b)\\n\\n\\t{\\n\\n\\t\\tconst float mult = 1.0f / 255.0f;\\n\\n\\t\\t*this = Color(mult*r, mult*g, mult*b);\\n\\n\\t}\\n\\n\\texplicit Color(const int *rgb)\\n\\n\\t\\t{ *this = Color(rgb[0], rgb[1], rgb[2]); }\\n\\n\\texplicit Color(const unsigned char *rgb)\\n\\n\\t\\t{ *this = Color(rgb[0], rgb[1], rgb[2]); }\\n\\n\\texplicit Color(int c)\\n\\n\\t\\t{ *this = Color(c,c,c); }\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 43,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"VEC_DECLARE_TWOARG(min)\\n\\nVEC_DECLARE_TWOARG(max)\\n\\nVEC_DECLARE_TWOARG(atan2)\\n\\nVEC_DECLARE_TWOARG(pow)\\n\\nVEC_DECLARE_TWOARG(fmod)\\n\\nVEC_DECLARE_TWOARG(step)\\n\\nVEC_DECLARE_THREEARG(smoothstep)\\n\\nVEC_DECLARE_THREEARG(clamp)\\n\\n\\n\\n#undef VEC_DECLARE_ONEARG\\n\\n#undef VEC_DECLARE_TWOARG\\n\\n#undef VEC_DECLARE_THREEARG\\n\\n\\n\\n\\n\\n// Both valarrays and GLSL use abs() on a vector to mean fabs().\\n\\n// Let's be compatible...\\n\\ntemplate <int D, class T>\\n\\nstatic inline Vec<D,T> abs(const Vec<D,T> &v)\\n\\n{\\n\\n\\treturn fabs(v);\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 44,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \" void\\n\\n run( const InTypeP in, FType & functor , size_t numThreads = 1, OutRegion outRegion = OutRegion())\\n\\n {\\n\\n typedef MapFilter<FType,InType,OutType> MF;\\n\\n typename MF::Pointer mf = MF::New();\\n\\n mf->SetFunctor(&functor); // handles output\\n\\n if(numThreads>0)\\n\\n mf->SetNumberOfThreads(numThreads);\\n\\n mf->SetInput(in);\\n\\n if(outRegion.GetSize()[0] > 0)\\n\\n {\\n\\n mf->GetOutput()->SetRequestedRegion(outRegion);\\n\\n }\\n\\n else\\n\\n {\\n\\n mf->GetOutput()->SetRequestedRegion(in->GetLargestPossibleRegion());\\n\\n }\\n\\n\\n\\n mf->Update(); // throws\\n\\n }\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/map.h\",\n \"rank\": 45,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"static inline void swap(const Vec<D,T> &v1, const Vec<D,T> &v2)\\n\\n{\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tswap(v1[i], v2[i]);\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const T len2(const Vec<D,T> &v)\\n\\n{\\n\\n\\tT l2 = v[0] * v[0];\\n\\n\\tfor (int i = 1; i < D; i++)\\n\\n\\t\\tl2 += v[i] * v[i];\\n\\n\\treturn l2;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline const T len(const Vec<D,T> &v)\\n\\n{\\n\\n\\treturn sqrt(len2(v));\\n\\n}\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 46,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"static inline T reflect(const Vec<D,T> &I, const Vec<D,T> &N)\\n\\n{\\n\\n\\treturn I - (T(2) * (N DOT I)) * N;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline T refract(const Vec<D,T> &I, const Vec<D,T> &N,\\n\\n\\t\\t\\tconst T &eta)\\n\\n{\\n\\n\\tT NdotI = N DOT I;\\n\\n\\tT k = T(1) - sqr(eta) * (T(1) - sqr(NdotI));\\n\\n\\treturn (k < T(0)) ? T(0) : eta * I - (eta * NdotI * sqrt(k)) * N;\\n\\n}\\n\\n\\n\\n\\n\\n// Generic macros for declaring 1-, 2-, and 3- argument\\n\\n// componentwise functions on vecs\\n\\n#define VEC_DECLARE_ONEARG(name) \\\\\\n\\n template <int D, class T> \\\\\\n\\n static inline Vec<D,T> name(const Vec<D,T> &v) \\\\\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 47,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tz -= floor(z);\\n\\n\\n\\n\\t\\tint X = int(x*xsize);\\n\\n\\t\\tint Y = int(y*ysize);\\n\\n\\t\\tint Z = int(z*zsize);\\n\\n\\t\\tint X1 = X+1; if (X1 == xsize) X1 = 0;\\n\\n\\t\\tint Y1 = Y+1; if (Y1 == ysize) Y1 = 0;\\n\\n\\t\\tint Z1 = Z+1; if (Z1 == zsize) Z1 = 0;\\n\\n\\n\\n\\t\\tfloat xf = x*xsize - X, xf1 = 1.0-xf;\\n\\n\\t\\tfloat yf = y*ysize - Y, yf1 = 1.0-yf;\\n\\n\\t\\tfloat zf = z*zsize - Z, zf1 = 1.0-zf;\\n\\n\\n\\n\\t\\treturn xf1*(yf1*(zf1*r[coord2index(X , Y , Z )] +\\n\\n\\t\\t\\t\\t zf *r[coord2index(X , Y , Z1)]) +\\n\\n\\t\\t\\t yf *(zf1*r[coord2index(X , Y1, Z )] +\\n\\n\\t\\t\\t\\t zf *r[coord2index(X , Y1, Z1)])) +\\n\\n\\t\\t xf *(yf1*(zf1*r[coord2index(X1, Y , Z )] +\\n\\n\\t\\t\\t\\t zf *r[coord2index(X1, Y , Z1)]) +\\n\\n\\t\\t\\t yf *(zf1*r[coord2index(X1, Y1, Z )] +\\n\\n\\t\\t\\t\\t zf *r[coord2index(X1, Y1, Z1)]));\\n\\n\\t}\\n\\n\\n\\n\\tvirtual ~Noise3D() {}\\n\\n};\\n\\n\\n\\n\\n\\n#define MAGIC_SCALE 1.5707963f\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/noise3d.h\",\n \"rank\": 48,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\treturn;\\n\\n\\t\\tstd::vector<void *> v;\\n\\n\\t\\tvoid *p;\\n\\n\\t\\tfor (p = freelist; *(void **)p; p = *(void **)p)\\n\\n\\t\\t\\tv.push_back(p);\\n\\n\\t\\tstd::sort(v.begin(), v.end());\\n\\n\\t\\tp = freelist = v[0];\\n\\n\\t\\tfor (size_t i = 1; i < v.size(); i++) {\\n\\n\\t\\t\\t*(void **)p = v[i];\\n\\n\\t\\t\\tp = *(void **)p;\\n\\n\\t\\t}\\n\\n\\t\\t*(void **)p = NULL;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/mempool.h\",\n \"rank\": 49,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"{\\n\\n\\treturn x < a ? T(0) : T(1);\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\nstatic inline T smoothstep(const T &x, const T &a, const T &b)\\n\\n{\\n\\n\\tif (b <= a) return step(x,a);\\n\\n\\tT t = (x - a) / (b - a);\\n\\n\\treturn t <= T(0) ? T(0) : t >= T(1) ? T(1) : t * t * (T(3) - T(2) * t);\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\\nstatic inline T faceforward(const Vec<D,T> &N, const Vec<D,T> &I,\\n\\n\\t\\t\\t const Vec<D,T> &Nref)\\n\\n{\\n\\n\\treturn ((Nref DOT I) < T(0)) ? N : -N;\\n\\n}\\n\\n\\n\\ntemplate <int D, class T>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 50,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t// Linear to nonlinear - raises values to the power of 1/g\\n\\n\\tconst Color gamma(float g) const\\n\\n\\t{\\n\\n\\t\\tfloat g1 = 1.0f / g;\\n\\n\\t\\treturn Color(pow(v[0],g1), pow(v[1],g1), pow(v[2],g1));\\n\\n\\t}\\n\\n\\n\\n\\t// Just apply the nonlinearity, not full colorspace conversion\\n\\n\\tconst Color gamma(Colorspace dst) const\\n\\n\\t{\\n\\n\\t\\tswitch (dst) {\\n\\n\\t\\t\\tcase CIELAB:\\n\\n\\t\\t\\t\\treturn Color(cielab_nonlinearity(v[0]),\\n\\n\\t\\t\\t\\t\\t cielab_nonlinearity(v[1]),\\n\\n\\t\\t\\t\\t\\t cielab_nonlinearity(v[2]));\\n\\n\\t\\t\\tcase SRGB:\\n\\n\\t\\t\\tcase YCBCR:\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 51,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\t 1.0f, -0.344136f, -0.714136f,\\n\\n\\t\\t\\t 1.0f, 1.772f, 0.0f);\\n\\n\\t}\\n\\n\\n\\npublic:\\n\\n\\tenum Colorspace { CIELAB, XYZ, RGB, SRGB, YCBCR, HSV };\\n\\n\\tconst Color convert(Colorspace src, Colorspace dst) const\\n\\n\\t{\\n\\n\\t\\tif (src == dst)\\n\\n\\t\\t\\treturn Color(*this);\\n\\n\\t\\tif (src == HSV)\\n\\n\\t\\t\\treturn Color::hsv(v[0],v[1],v[2]).convert(SRGB, dst);\\n\\n\\t\\telse if (dst == HSV)\\n\\n\\t\\t\\treturn convert(src, SRGB).srgb2hsv();\\n\\n\\t\\t// Else we have a natural order in which to convert things\\n\\n\\t\\tint srcnum = int(src), dstnum = int(dst);\\n\\n\\t\\tif (srcnum < dstnum) switch (src) {\\n\\n\\t\\t\\tcase CIELAB:\\n\\n\\t\\t\\t\\treturn (dst == XYZ) ? cielab2xyz() :\\n\\n\\t\\t\\t\\t\\tcielab2xyz().convert(XYZ, dst);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 52,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tIt t = ++L.begin();\\n\\n\\tmtf_mb(t);\\n\\n\\tT max_e, old_sqr_r = T(0);\\n\\n\\tdo {\\n\\n\\t\\tIt pivot;\\n\\n\\t\\tmax_e = max_excess(t, i, pivot);\\n\\n\\t\\tif (max_e > 0) {\\n\\n\\t\\t\\tt = support_end;\\n\\n\\t\\t\\tif (t == pivot)\\n\\n\\t\\t\\t\\tt++;\\n\\n\\t\\t\\told_sqr_r = B.squared_radius();\\n\\n\\t\\t\\tB.push(*pivot);\\n\\n\\t\\t\\tmtf_mb(support_end);\\n\\n\\t\\t\\tB.pop();\\n\\n\\t\\t\\tmove_to_front(pivot);\\n\\n\\t\\t}\\n\\n\\t} while (max_e > 0 && B.squared_radius() > old_sqr_r);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 53,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"T Miniball<D,T>::max_excess(It t, It i, It &pivot) const\\n\\n{\\n\\n\\tconst T *c = B.center(), sqr_r = B.squared_radius();\\n\\n\\tT e, max_e = 0;\\n\\n\\tfor (It k = t; k != i; k++) {\\n\\n\\t\\tconst Vec<D,T> &p = *k;\\n\\n\\t\\te = -sqr_r;\\n\\n\\t\\tfor (int j = 0; j < D; j++)\\n\\n\\t\\t\\te += sqr(p[j] - c[j]);\\n\\n\\t\\tif (e > max_e) {\\n\\n\\t\\t\\tmax_e = e;\\n\\n\\t\\t\\tpivot = k;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\treturn max_e;\\n\\n}\\n\\n\\n\\n\\n\\ntemplate <int D, class T>\\n\\nvoid Miniball<D,T>::mtf_mb(It i)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 54,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"#ifndef MEMPOOL_H\\n\\n#define MEMPOOL_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nmempool.h\\n\\nReplacement memory management for a class using a memory pool.\\n\\n\\n\\nSample usage:\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/mempool.h\",\n \"rank\": 55,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t// Constructor from anything that can be accessed using []\\n\\n\\t// Pretty aggressive, so marked as explicit.\\n\\n\\ttemplate <class S> explicit Vec(const S &x)\\n\\n\\t\\t{ for (int i = 0; i < D; i++) v[i] = T(x[i]); }\\n\\n\\n\\n\\t// No destructor or assignment operator needed\\n\\n\\n\\n\\t// Array reference and conversion to pointer - no bounds checking\\n\\n\\tconst T &operator [] (int i) const\\n\\n\\t\\t{ return v[i]; }\\n\\n\\tT &operator [] (int i)\\n\\n\\t\\t{ return v[i]; }\\n\\n\\toperator const T * () const\\n\\n\\t\\t{ return v; }\\n\\n\\toperator const T * ()\\n\\n\\t\\t{ return v; }\\n\\n\\toperator T * ()\\n\\n\\t\\t{ return v; }\\n\\n\\n\\n\\t// Member operators\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 56,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tstatic inline float srgb_nonlinearity(float x)\\n\\n\\t{\\n\\n\\t\\tif (x > 0.0031308f)\\n\\n\\t\\t\\treturn 1.055f * pow(x, 1.0f/2.4f) - 0.055f;\\n\\n\\t\\telse\\n\\n\\t\\t\\treturn x * 12.92f;\\n\\n\\t}\\n\\n\\tstatic inline float inv_srgb_nonlinearity(float x)\\n\\n\\t{\\n\\n\\t\\tif (x > (0.0031308f * 12.92f))\\n\\n\\t\\t\\treturn pow((x + 0.055f) * (1.0f / 1.055f), 2.4f);\\n\\n\\t\\telse\\n\\n\\t\\t\\treturn x * (1.0f / 12.92f);\\n\\n\\t}\\n\\n\\tconst Color rgb2srgb() const\\n\\n\\t{\\n\\n\\t\\treturn Color(srgb_nonlinearity(v[0]),\\n\\n\\t\\t\\t srgb_nonlinearity(v[1]),\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 57,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tif (!freelist)\\n\\n\\t\\t\\tgrow_freelist();\\n\\n\\t\\tvoid *next = freelist;\\n\\n\\t\\tfreelist = *(void **)next;\\n\\n\\t\\treturn next;\\n\\n\\t}\\n\\n\\tvoid free(void *p, size_t n)\\n\\n\\t{\\n\\n\\t\\tif (!p)\\n\\n\\t\\t\\treturn;\\n\\n\\t\\telse if (n != itemsize)\\n\\n\\t\\t\\t::operator delete(p);\\n\\n\\t\\telse {\\n\\n\\t\\t\\t*(void **)p = freelist;\\n\\n\\t\\t\\tfreelist = p;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tvoid sort_freelist()\\n\\n\\t{\\n\\n\\t\\tif (!freelist)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/mempool.h\",\n \"rank\": 58,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"}\\n\\n \\n\\n\\n\\ntemplate <int D, class T>\\n\\nvoid Basis<D,T>::pop()\\n\\n{\\n\\n\\tm--;\\n\\n}\\n\\n \\n\\n\\n\\ntemplate <int D, class T>\\n\\nvoid Miniball<D,T>::move_to_front(It j)\\n\\n{\\n\\n\\tif (support_end == j)\\n\\n\\t\\tsupport_end++;\\n\\n\\tL.splice(L.begin(), L, j);\\n\\n}\\n\\n\\n\\n\\n\\ntemplate <int D, class T>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 59,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"template <class T>\\n\\nstatic inline T fract(const T &x)\\n\\n{\\n\\n\\treturn x - floor(x);\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\nstatic inline T clamp(const T &x, const T &a, const T &b)\\n\\n{\\n\\n\\treturn x > a ? x < b ? x : b : a; // returns a on NaN\\n\\n}\\n\\n\\n\\ntemplate <class T, class S>\\n\\nstatic inline T mix(const T &x, const T &y, const S &a)\\n\\n{\\n\\n\\treturn (S(1)-a) * x + a * y;\\n\\n}\\n\\n\\n\\ntemplate <class T>\\n\\nstatic inline T step(const T &x, const T &a)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 60,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"// We pick up most of the operators and functions from vecs automatically.\\n\\n// The only ones we need to worry about are min and max,\\n\\n// since otherwise we'd get the ones from std::\\n\\nstatic inline const Color min(const Color &c1, const Color &c2)\\n\\n{\\n\\n\\treturn Color(c1).min(c2);\\n\\n}\\n\\n\\n\\nstatic inline const Color max(const Color &c1, const Color &c2)\\n\\n{\\n\\n\\treturn Color(c1).max(c2);\\n\\n}\\n\\n\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 61,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"};\\n\\n\\n\\n/**\\n\\n * reduce is an abstraction of mapping over threads to simplify (and restrict) things a bit.\\n\\n *\\n\\n * the passed in functor should have an:\\n\\n * TOutput operator()(TInputImage::ConstPointer in, const TOutputImage::RegionType & threadRegion)\\n\\n * and\\n\\n * TOutput operator()(const std::vector<TOutput> & in)\\n\\n *\\n\\n * where the reduce is two steps, first each thread reduces it's region to a single output object,\\n\\n * and the second step reduces a list (std::vector) of those objects to a single output object.\\n\\n *\\n\\n * For example to compute the mean, you might use a std::pair<float,size_t> obj, where obj.first = sum, obj.second = count,\\n\\n * then in the second step you would sum all the obj.first and obj.second and divide first by the scond to get the mean.\\n\\n */\\n\\ntemplate<class TInputImage,\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/map.h\",\n \"rank\": 62,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"// (at your option) any later version.\\n\\n//\\n\\n// This program is distributed in the hope that it will be useful,\\n\\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n// GNU General Public License for more details.\\n\\n//\\n\\n// You should have received a copy of the GNU General Public License\\n\\n// along with this program; if not, write to the Free Software\\n\\n// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA,\\n\\n// or download the License terms from prep.ai.mit.edu/pub/gnu/COPYING-2.0.\\n\\n//\\n\\n// Contact:\\n\\n// --------\\n\\n// Bernd Gaertner\\n\\n// Institut f. Informatik\\n\\n// ETH Zuerich\\n\\n// ETH-Zentrum\\n\\n// CH-8092 Zuerich, Switzerland\\n\\n// http://www.inf.ethz.ch/personal/gaertner\\n\\n//\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 63,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"template <int D, class T>\\n\\nvoid Miniball<D,T>::build(bool pivoting /* = true */)\\n\\n{\\n\\n\\tB.reset();\\n\\n\\tsupport_end = L.begin();\\n\\n\\tif (pivoting)\\n\\n\\t\\tpivot_mb(L.end());\\n\\n\\telse\\n\\n\\t\\tmtf_mb(L.end());\\n\\n}\\n\\n\\n\\n\\n\\n//\\n\\n// Original copyright of miniball code follows:\\n\\n//\\n\\n// Copright (C) 1999\\n\\n//\\n\\n// This program is free software; you can redistribute it and/or modify\\n\\n// it under the terms of the GNU General Public License as published by\\n\\n// the Free Software Foundation; either version 2 of the License, or\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 64,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t// 3x3 color transform - matrix given in *row-major* order\\n\\n\\tconst Color col_transform(float m11, float m12, float m13,\\n\\n\\t\\t\\t\\t float m21, float m22, float m23,\\n\\n\\t\\t\\t\\t float m31, float m32, float m33) const\\n\\n\\t{\\n\\n\\t\\treturn Color(m11*v[0]+m12*v[1]+m13*v[2],\\n\\n\\t\\t\\t m21*v[0]+m22*v[1]+m23*v[2],\\n\\n\\t\\t\\t m31*v[0]+m32*v[1]+m33*v[2]);\\n\\n\\t}\\n\\n\\n\\nprivate:\\n\\n\\tconst Color hsv2srgb() const\\n\\n\\t{\\n\\n\\t\\t// From FvD\\n\\n\\t\\tfloat H = v[0], S = v[1], V = v[2];\\n\\n\\t\\tif (S <= 0.0f)\\n\\n\\t\\t\\treturn Color(V,V,V);\\n\\n\\t\\tH = fmod(H, float(2.0 * M_PI));\\n\\n\\t\\tif (H < 0.0f)\\n\\n\\t\\t\\tH += float(2.0 * M_PI);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 65,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\treturn *this;\\n\\n\\t}\\n\\n\\n\\n\\t// Set each component to min/max of this and the other vector\\n\\n\\tVec<D,T> &min(const Vec<D,T> &x)\\n\\n\\t{\\n\\n#pragma omp critical\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\t\\tif (x[i] < v[i]) v[i] = x[i];\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\tVec<D,T> &max(const Vec<D,T> &x)\\n\\n\\t{\\n\\n#pragma omp critical\\n\\n\\t\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\t\\tif (x[i] > v[i]) v[i] = x[i];\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\n\\n\\t// Outside of class: + - * / % ^ << >>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 66,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\tcase XYZ:\\n\\n\\t\\t\\t\\treturn (dst == RGB) ? xyz2rgb() :\\n\\n\\t\\t\\t\\t\\txyz2rgb().convert(RGB, dst);\\n\\n\\t\\t\\tcase RGB:\\n\\n\\t\\t\\t\\treturn (dst == SRGB) ? rgb2srgb() :\\n\\n\\t\\t\\t\\t\\trgb2srgb().convert(SRGB, dst);\\n\\n\\t\\t\\tdefault:\\n\\n\\t\\t\\t\\treturn srgb2ycbcr();\\n\\n\\t\\t} else switch (src) {\\n\\n\\t\\t\\tcase YCBCR:\\n\\n\\t\\t\\t\\treturn (dst == SRGB) ? ycbcr2srgb() :\\n\\n\\t\\t\\t\\t\\tycbcr2srgb().convert(SRGB, dst);\\n\\n\\t\\t\\tcase SRGB:\\n\\n\\t\\t\\t\\treturn (dst == RGB) ? srgb2rgb() :\\n\\n\\t\\t\\t\\t\\tsrgb2rgb().convert(RGB, dst);\\n\\n\\t\\t\\tcase RGB:\\n\\n\\t\\t\\t\\treturn (dst == XYZ) ? rgb2xyz() :\\n\\n\\t\\t\\t\\t\\trgb2xyz().convert(XYZ, dst);\\n\\n\\t\\t\\tdefault:\\n\\n\\t\\t\\t\\treturn xyz2cielab();\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 67,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\tz[m] *= T(2);\\n\\n \\n\\n\\t\\t// reject push if z_m too small\\n\\n\\t\\tif (z[m] < eps*current_sqr_r)\\n\\n\\t\\t\\treturn false;\\n\\n \\n\\n\\t\\t// update c, sqr_r\\n\\n\\t\\tT e = -sqr_r[m-1];\\n\\n\\t\\tfor (i = 0; i < D; i++)\\n\\n\\t\\t\\te += sqr(p[i] - c[m-1][i]);\\n\\n\\t\\tf[m] = e / z[m];\\n\\n \\n\\n\\t\\tfor (i = 0; i < D; i++)\\n\\n\\t\\t\\tc[m][i] = c[m-1][i] + f[m]*v[m][i];\\n\\n\\t\\tsqr_r[m] = sqr_r[m-1] + e*f[m]*T(0.5);\\n\\n }\\n\\n current_c = c[m];\\n\\n current_sqr_r = sqr_r[m];\\n\\n s = ++m;\\n\\n return true;\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 68,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\tv[m][i] = p[i] - q0[i];\\n\\n \\n\\n\\t\\t// compute the a_{m,i}, i < m\\n\\n\\t\\tfor (i = 1; i < m; i++) {\\n\\n\\t\\t\\ta[m][i] = 0;\\n\\n\\t\\t\\tfor (j = 0; j < D; j++)\\n\\n\\t\\t\\t\\ta[m][i] += v[i][j] * v[m][j];\\n\\n\\t\\t\\ta[m][i] *= (T(2) / z[i]);\\n\\n\\t\\t}\\n\\n \\n\\n\\t\\t// update v_m to Q_m-\\\\bar{Q}_m\\n\\n\\t\\tfor (i = 1; i < m; i++) {\\n\\n\\t\\t\\tfor (j = 0; j < D; j++)\\n\\n\\t\\t\\t\\tv[m][j] -= a[m][i] * v[i][j];\\n\\n\\t\\t}\\n\\n \\n\\n\\t\\t// compute z_m\\n\\n\\t\\tz[m] = 0;\\n\\n\\t\\tfor (j = 0; j < D; j++)\\n\\n\\t\\t\\tz[m] += sqr(v[m][j]);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 69,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"{\\n\\n\\tsupport_end = L.begin();\\n\\n\\tif (B.size() == D+1)\\n\\n\\t\\treturn;\\n\\n\\tfor (It k = L.begin(); k != i; ) {\\n\\n\\t\\tIt j = k++;\\n\\n\\t\\tif (B.excess(*j) > 0) {\\n\\n\\t\\t\\tif (B.push(*j)) {\\n\\n\\t\\t\\t\\tmtf_mb(j);\\n\\n\\t\\t\\t\\tB.pop();\\n\\n\\t\\t\\t\\tmove_to_front(j);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\ntemplate <int D, class T>\\n\\nvoid Miniball<D,T>::pivot_mb(It i)\\n\\n{\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/bsphere.h\",\n \"rank\": 70,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\t\\t\\t\\treturn Color(srgb_nonlinearity(v[0]),\\n\\n\\t\\t\\t\\t\\t srgb_nonlinearity(v[1]),\\n\\n\\t\\t\\t\\t\\t srgb_nonlinearity(v[2]));\\n\\n\\t\\t\\tdefault:\\n\\n\\t\\t\\t\\treturn Color(*this);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t// Nonlinear to linear - raises values to the power of g\\n\\n\\tconst Color ungamma(float g) const\\n\\n\\t{\\n\\n\\t\\treturn Color(pow(v[0],g), pow(v[1],g), pow(v[2],g));\\n\\n\\t}\\n\\n\\n\\n\\tconst Color ungamma(Colorspace dst) const\\n\\n\\t{\\n\\n\\t\\tswitch (dst) {\\n\\n\\t\\t\\tcase CIELAB:\\n\\n\\t\\t\\t\\treturn Color(inv_cielab_nonlinearity(v[0]),\\n\\n\\t\\t\\t\\t\\t inv_cielab_nonlinearity(v[1]),\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Color.h\",\n \"rank\": 71,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"\\tif (unlikely(l <= T(0))) {\\n\\n\\t\\tv[0] = T(1);\\n\\n\\t\\tfor (int i = 1; i < D; i++)\\n\\n\\t\\t\\tv[i] = T(0);\\n\\n\\t\\treturn v;\\n\\n\\t}\\n\\n\\n\\n\\tl = T(1) / l;\\n\\n\\tfor (int i = 0; i < D; i++)\\n\\n\\t\\tv[i] *= l;\\n\\n\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\n\\n\\n// Area-weighted triangle face normal\\n\\ntemplate <class T>\\n\\nstatic inline T trinorm(const T &v0, const T &v1, const T &v2)\\n\\n{\\n\\n\\treturn (typename T::value_type) 0.5 * ((v1 - v0) CROSS (v2 - v0));\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/Vec.h\",\n \"rank\": 72,\n \"score\": 67328.55996081686\n },\n {\n \"content\": \"#include \\\"math.h\\\"\\n\\n#include <vector>\\n\\n#include <list>\\n\\n#include <map>\\n\\n#include <limits>\\n\\n#include <iostream>\\n\\n#include <fstream>\\n\\n\\n\\n// SHIREEN\\n\\n#include <iterator> // -- PM\\n\\n#include <vnl/vnl_math.h>\\n\\n#include <vnl/vnl_sparse_matrix.h>\\n\\n#include <vnl/algo/vnl_svd.h>\\n\\n#include <vnl/algo/vnl_sparse_lu.h>\\n\\n#include <vcl_legacy_aliases.h>\\n\\n\\n\\n//#define SHOW_WARNING 1\\n\\n\\n\\n#define NUM_THREADS 8\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 73,\n \"score\": 66285.69894069678\n },\n {\n \"content\": \"\\txf=xf * xf2;\\t\\t\\t// Matrix-matrix multiplication\\n\\n\\txf=inv(xf2);\\t\\t\\t// Inverse\\n\\n\\tvec v = xf * vec(1,2,3);\\t// Matrix-vector multiplication\\n\\n\\txf2=rot_only(xf);\\t\\t// Just the upper 3x3 of xf\\n\\n\\txf2=trans_only(xf);\\t\\t// Just the translation of xf\\n\\n\\txf2=norm_xf(xf);\\t\\t// Inverse transpose, no translation\\n\\n\\tinvert(xf);\\t\\t\\t// Inverts xform in place\\n\\n\\torthogonalize(xf);\\t\\t// Makes matrix orthogonal\\n\\n\\txf(1,2)=3.0;\\t\\t\\t// Access by row/column\\n\\n\\txf[4]=5.0;\\t\\t\\t// Access in column-major order\\n\\n\\txfname(\\\"file.ply\\\")\\t\\t// Returns string(\\\"file.xf\\\")\\n\\n*/\\n\\n\\n\\n#include \\\"lineqn.h\\\"\\n\\n#include <cmath>\\n\\n#include <algorithm>\\n\\n#include <iostream>\\n\\n#include <fstream>\\n\\n#include <string>\\n\\nusing std::min;\\n\\nusing std::max;\\n\\nusing std::swap;\\n\\nusing std::sqrt;\\n\\n\\n\\ntemplate <class T>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/XForm.h\",\n \"rank\": 74,\n \"score\": 66283.50570538893\n },\n {\n \"content\": \"#ifdef MP_USE_OPENMP\\n\\n#include <omp.h> // -- PM\\n\\n#endif\\n\\n\\n\\n// end SHIREEN\\n\\n\\n\\n// Praful\\n\\n#include <vgl/algo/vgl_homg_operators_2d.h>\\n\\n#include <vgl/vgl_conic.h>\\n\\n#include <vnl/vnl_matrix.h>\\n\\n#include <vnl/vnl_vector.h>\\n\\n#include <vnl/algo/vnl_matrix_inverse.h>\\n\\n#include <string>\\n\\n#include <fstream>\\n\\n#include <cstdlib>\\n\\n\\n\\n#include <vcl_compiler.h>\\n\\n\\n\\n// Praful end\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 75,\n \"score\": 66280.43747655174\n },\n {\n \"content\": \"\\n\\n// itk files to generate Face Index -- PM\\n\\n#include \\\"itkImage.h\\\"\\n\\n#include \\\"itkImageRegionConstIteratorWithIndex.h\\\"\\n\\n#include \\\"itkImageRegionIteratorWithIndex.h\\\"\\n\\n#include \\\"itkImageFileWriter.h\\\"\\n\\n#include \\\"itkTimeProbe.h\\\"\\n\\n#include \\\"itkResampleImageFilter.h\\\"\\n\\n#include \\\"itkIdentityTransform.h\\\"\\n\\n#include \\\"itkLinearInterpolateImageFunction.h\\\"\\n\\n#include \\\"itkBSplineInterpolateImageFunction.h\\\"\\n\\n// sets for the face index set\\n\\n#include <set>\\n\\n\\n\\n// Danny Perry's functor\\n\\n#include \\\"map.h\\\"\\n\\n\\n\\n///* Prateep */\\n\\n//// include alglib headers\\n\\n//#include \\\"alglib/ap.h\\\"\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 76,\n \"score\": 66280.3815230725\n },\n {\n \"content\": \"//#include \\\"alglibinternal.h\\\"\\n\\n//#include \\\"alglibmisc.h\\\"\\n\\n//#include \\\"solvers.h\\\"\\n\\n//#include \\\"optimization.h\\\"\\n\\n//#include \\\"interpolation.h\\\"\\n\\n\\n\\ntypedef float PixelType;\\n\\n\\n\\n//using std::set; // -- PM\\n\\n\\n\\n// end SHIREEN\\n\\n\\n\\nusing std::vector;\\n\\nusing std::map;\\n\\n\\n\\n// SHIREEN\\n\\n#include <algorithm>\\n\\n\\n\\n#define PI 3.141592653589793\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 77,\n \"score\": 66280.21224950379\n },\n {\n \"content\": \"#ifndef TRIMESH_H\\n\\n#define TRIMESH_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nTriMesh.h\\n\\nClass for triangle meshes.\\n\\n*/\\n\\n\\n\\n#define LARGENUM 10000000.0\\n\\n#define ONE 1\\n\\n#define CURVATURE 2\\n\\n#define NOISE 3\\n\\n#define SPEEDTYPE NOISE\\n\\n\\n\\n#include \\\"Vec.h\\\"\\n\\n#include \\\"Color.h\\\"\\n\\n#include \\\"math.h\\\"\\n\\n#include <vector>\\n\\n#include <list>\\n\\nusing std::vector;\\n\\n\\n\\n#define PI 3.1415927\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh2.h\",\n \"rank\": 78,\n \"score\": 66279.85519823593\n },\n {\n \"content\": \"#ifndef TRIMESH_H\\n\\n#define TRIMESH_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nTriMesh.h\\n\\nClass for triangle meshes.\\n\\n*/\\n\\n\\n\\n#define LARGENUM 10000000.0\\n\\n#define ONE 1 \\n\\n#define CURVATURE 2 \\n\\n#define NOISE 3\\n\\n#define EPS 1e-6\\n\\n//#define SPEEDTYPE ONE\\n\\n\\n\\n#include \\\"Vec.h\\\"\\n\\n#include \\\"Color.h\\\"\\n\\n#include \\\"KDtree.h\\\"\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 79,\n \"score\": 66279.31483577761\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2013 University of Utah\\n\\n */\\n\\n\\n\\n#ifndef __ReduceFilter_H\\n\\n#define __ReduceFilter_H\\n\\n\\n\\n#include <itkImageToImageFilter.h>\\n\\n\\n\\ntemplate< \\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/ReduceFilter.h\",\n \"rank\": 80,\n \"score\": 66277.96484696813\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2013 University of Utah\\n\\n */\\n\\n\\n\\n#ifndef __MapFilter_H\\n\\n#define __MapFilter_H\\n\\n\\n\\n#include <itkImageToImageFilter.h>\\n\\n\\n\\ntemplate< \\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/MapFilter.h\",\n \"rank\": 81,\n \"score\": 66277.96484696813\n },\n {\n \"content\": \"#ifndef KDTREE_H\\n\\n#define KDTREE_H\\n\\n/*\\n\\nSzymon Rusinkiewicz\\n\\nPrinceton University\\n\\n\\n\\nKDtree.h\\n\\nA K-D tree for points, with limited capabilities (find nearest point to \\n\\na given point, or to a ray). \\n\\n*/\\n\\n\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/KDtree.h\",\n \"rank\": 82,\n \"score\": 66277.54235809873\n },\n {\n \"content\": \"\\tT h = xf[3]*v[0] + xf[7]*v[1] + xf[11]*v[2] + xf[15];\\n\\n\\th = T(1) / h;\\n\\n\\n\\n\\treturn S(float(h*(xf[0]*v[0] + xf[4]*v[1] + xf[8]*v[2] + xf[12])),\\n\\n\\t\\t float(h*(xf[1]*v[0] + xf[5]*v[1] + xf[9]*v[2] + xf[13])),\\n\\n\\t\\t float(h*(xf[2]*v[0] + xf[6]*v[1] + xf[10]*v[2] + xf[14])));\\n\\n}\\n\\n\\n\\n// iostream operators\\n\\ntemplate <class T>\\n\\nstatic inline std::ostream &operator << (std::ostream &os, const XForm<T> &m)\\n\\n{\\n\\n\\tfor (int i = 0; i < 4; i++) {\\n\\n\\t\\tfor (int j = 0; j < 4; j++) {\\n\\n\\t\\t\\tos << m[i+4*j];\\n\\n\\t\\t\\tif (j == 3)\\n\\n\\t\\t\\t\\tos << std::endl;\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t\\tos << \\\" \\\";\\n\\n\\t\\t}\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/XForm.h\",\n \"rank\": 83,\n \"score\": 66276.93076362945\n },\n {\n \"content\": \" void SetFunctor(FType * f) { m_functor = f; }\\n\\n const FType * GetFunctor() const { return m_functor; }\\n\\n FType * GetFunctor() { return m_functor; }\\n\\n void SetRequestedRegion( const OutRegion & outRegion ){ m_region = outRegion; }\\n\\n\\n\\nprotected:\\n\\n MapFilter();\\n\\n virtual void AllocateOutputs();\\n\\n virtual void ThreadedGenerateData(const OutRegion & outputRegionForThread,\\n\\n itk::ThreadIdType threadId);\\n\\n\\n\\nprivate:\\n\\n FType * m_functor;\\n\\n OutRegion m_region;\\n\\n \\n\\n};\\n\\n\\n\\n#include \\\"MapFilter.hxx\\\" // implementation\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/MapFilter.h\",\n \"rank\": 84,\n \"score\": 66276.49602396411\n },\n {\n \"content\": \" FType * GetFunctor() { return m_functor; }\\n\\n\\n\\n const OutType & GetResult() const { return m_result; }\\n\\n OutType & GetResult() { return m_result; }\\n\\n\\n\\nprotected:\\n\\n ReduceFilter();\\n\\n\\n\\n virtual void BeforeThreadedGenerateData();\\n\\n virtual void AllocateOutputs();\\n\\n virtual void ThreadedGenerateData(const InRegion & outputRegionForThread,\\n\\n itk::ThreadIdType threadId);\\n\\n virtual void AfterThreadedGenerateData();\\n\\n\\n\\nprivate:\\n\\n FType * m_functor;\\n\\n OutList m_list;\\n\\n OutType m_result;\\n\\n};\\n\\n\\n\\n#include \\\"ReduceFilter.hxx\\\" // implementation\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/ReduceFilter.h\",\n \"rank\": 85,\n \"score\": 66276.46649495444\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n }\\n\\n else\\n\\n {\\n\\n#if SHOW_WARNING\\n\\n std::cout << \\\"warning: using kdtree for triangle info because there is no face index map !!! ...\\\\n\\\" ;\\n\\n#endif\\n\\n\\n\\n // get vertex closest to first point - x\\n\\n int vertX = this->FindNearestVertex(x);\\n\\n unsigned int fNumber;\\n\\n\\n\\n // scan all adjacent faces to see which face (f) includes point x\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\\n\\n faceID = this->adjacentfaces[vertX][0];\\n\\n for (fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\\n\\n {\\n\\n // check if face contains x and store barycentric coordinates for x in face f\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 86,\n \"score\": 66276.40849648166\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n else\\n\\n {\\n\\n#if SHOW_WARNING\\n\\n std::cout << \\\"warning: using kdtree for triangle info because there is no face index map !!! ...\\\\n\\\" ;\\n\\n#endif\\n\\n\\n\\n // get vertex closest to first point - x\\n\\n vertX = this->FindNearestVertex(x);\\n\\n\\n\\n // scan all adjacent faces to see which face (f) includes point x\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\\n\\n for (unsigned int fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\\n\\n {\\n\\n // check if face contains x and store barycentric coordinates for x in face f\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][fNumber] ];\\n\\n vec barycentric = this->ComputeBarycentricCoordinates(x,triangleX);\\n\\n alphaX = barycentric[0];\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 87,\n \"score\": 66276.13814055776\n },\n {\n \"content\": \" // get vertex closest to first point - x\\n\\n vertX = this->FindNearestVertex(x);\\n\\n\\n\\n // scan all adjacent faces to see which face (f) includes point x\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\\n\\n for (unsigned int fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\\n\\n {\\n\\n // check if face contains x and store barycentric coordinates for x in face f\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][fNumber] ];\\n\\n vec barycentric = this->ComputeBarycentricCoordinates(x,triangleX);\\n\\n alphaX = barycentric[0];\\n\\n betaX = barycentric[1];\\n\\n gammaX = barycentric[2];\\n\\n\\n\\n if ( ( ( barycentric[0] >= 0 ) && ( barycentric[0] <= 1 ) ) &&\\n\\n ( ( barycentric[1] >= 0 ) && ( barycentric[1] <= 1 ) ) &&\\n\\n ( ( barycentric[2] >= 0 ) && ( barycentric[2] <= 1 ) ) )\\n\\n {\\n\\n fNumber = this->adjacentfaces[vertX].size();\\n\\n }\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 88,\n \"score\": 66276.01409037704\n },\n {\n \"content\": \" // get vertex closest to first point - x\\n\\n int vertX = this->FindNearestVertex(x);\\n\\n\\n\\n // scan all adjacent faces to see which face (f) includes point x\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][0] ];\\n\\n for (unsigned int fNumber = 0; fNumber < this->adjacentfaces[vertX].size(); fNumber++)\\n\\n {\\n\\n // check if face contains x and store barycentric coordinates for x in face f\\n\\n triangleX = this->faces[ this->adjacentfaces[vertX][fNumber] ];\\n\\n faceID = this->adjacentfaces[vertX][fNumber] ;\\n\\n vec barycentric = this->ComputeBarycentricCoordinates(x,triangleX);\\n\\n alphaX = barycentric[0];\\n\\n betaX = barycentric[1];\\n\\n gammaX = barycentric[2];\\n\\n\\n\\n if ( ( ( barycentric[0] >= 0 ) && ( barycentric[0] <= 1 ) ) &&\\n\\n ( ( barycentric[1] >= 0 ) && ( barycentric[1] <= 1 ) ) &&\\n\\n ( ( barycentric[2] >= 0 ) && ( barycentric[2] <= 1 ) ) )\\n\\n {\\n\\n fNumber = this->adjacentfaces[vertX].size();\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 89,\n \"score\": 66275.85143416877\n },\n {\n \"content\": \"\\t\\txf1[ 1]*xf2[ 4]+xf1[ 5]*xf2[ 5]+xf1[ 9]*xf2[ 6]+xf1[13]*xf2[ 7],\\n\\n\\t\\txf1[ 2]*xf2[ 4]+xf1[ 6]*xf2[ 5]+xf1[10]*xf2[ 6]+xf1[14]*xf2[ 7],\\n\\n\\t\\txf1[ 3]*xf2[ 4]+xf1[ 7]*xf2[ 5]+xf1[11]*xf2[ 6]+xf1[15]*xf2[ 7],\\n\\n\\t\\txf1[ 0]*xf2[ 8]+xf1[ 4]*xf2[ 9]+xf1[ 8]*xf2[10]+xf1[12]*xf2[11],\\n\\n\\t\\txf1[ 1]*xf2[ 8]+xf1[ 5]*xf2[ 9]+xf1[ 9]*xf2[10]+xf1[13]*xf2[11],\\n\\n\\t\\txf1[ 2]*xf2[ 8]+xf1[ 6]*xf2[ 9]+xf1[10]*xf2[10]+xf1[14]*xf2[11],\\n\\n\\t\\txf1[ 3]*xf2[ 8]+xf1[ 7]*xf2[ 9]+xf1[11]*xf2[10]+xf1[15]*xf2[11],\\n\\n\\t\\txf1[ 0]*xf2[12]+xf1[ 4]*xf2[13]+xf1[ 8]*xf2[14]+xf1[12]*xf2[15],\\n\\n\\t\\txf1[ 1]*xf2[12]+xf1[ 5]*xf2[13]+xf1[ 9]*xf2[14]+xf1[13]*xf2[15],\\n\\n\\t\\txf1[ 2]*xf2[12]+xf1[ 6]*xf2[13]+xf1[10]*xf2[14]+xf1[14]*xf2[15],\\n\\n\\t\\txf1[ 3]*xf2[12]+xf1[ 7]*xf2[13]+xf1[11]*xf2[14]+xf1[15]*xf2[15]\\n\\n\\t);\\n\\n}\\n\\n\\n\\n\\n\\n// Component-wise equality and inequality (#include the usual caveats\\n\\n// about comparing floats for equality...)\\n\\ntemplate <class T>\\n\\nstatic inline bool operator == (const XForm<T> &xf1, const XForm<T> &xf2)\\n\\n{\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/XForm.h\",\n \"rank\": 90,\n \"score\": 66275.23895274666\n },\n {\n \"content\": \" {}\\n\\n\\n\\n // Mark invalid\\n\\n void clear()\\n\\n {\\n\\n min = point(std::numeric_limits<float>::max(),\\n\\n std::numeric_limits<float>::max(),\\n\\n std::numeric_limits<float>::max());\\n\\n max = point(std::numeric_limits<float>::min(),\\n\\n std::numeric_limits<float>::min(),\\n\\n std::numeric_limits<float>::min());\\n\\n valid = false;\\n\\n }\\n\\n\\n\\n // Return center point and (vector) diagonal\\n\\n point center() const { return 0.5f * (min+max); }\\n\\n vec size() const { return max - min; }\\n\\n\\n\\n // Grow a bounding box to encompass a point\\n\\n BBox &operator += (const point &p)\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 91,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \"\\n\\n std::cout << \\\"Iteratio : \\\" << ITER_BLOCK << std::endl;\\n\\n\\n\\n typedef itk::ImageRegionConstIteratorWithIndex<TIn> It;\\n\\n It itI(in, threadRegion);\\n\\n\\n\\n for(itI.GoToBegin(); !itI.IsAtEnd(); ++itI)\\n\\n {\\n\\n if(itI.Get() == 1)\\n\\n {\\n\\n point tmPoint;\\n\\n itk::Image<PixelType, 3>::PointType itkPoint;\\n\\n in->TransformIndexToPhysicalPoint(itI.GetIndex(), itkPoint);\\n\\n for(int i = 0; i < 3; i++) { tmPoint[i] = itkPoint[i]; }\\n\\n\\n\\n // Get neartest vertex\\n\\n const float *match = kd->closest_to_pt( tmPoint, 10.0 * sqr( mesh.getMaximumEdgeLength() ) );\\n\\n if(!match)\\n\\n {\\n\\n out_->SetPixel(itI.GetIndex(), -1);\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 92,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \" }\\n\\n out_->SetPixel(itI.GetIndex(), fid);\\n\\n adjFaces.clear();\\n\\n }\\n\\n } else {\\n\\n out_->SetPixel(itI.GetIndex(), -1);\\n\\n }\\n\\n\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 93,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \" vector<int> adjFaces; adjFaces.clear();\\n\\n vector<int>::iterator adjFacesIt;\\n\\n // find triangles enclosed inside each supervoxel\\n\\n int tmpInd = mesh.physicalPointToLinearIndex(tmPoint, supVoxelOrigin, supVoxelSpacing, supVoxelSize);\\n\\n\\n\\n for(vector<int>::iterator it = superVoxelFaceList[tmpInd].begin(); it != superVoxelFaceList[tmpInd].end(); it++) {\\n\\n adjFaces.push_back((*it));\\n\\n }\\n\\n\\n\\n // std::cout << \\\"Number of neighbors : \\\" << adjFaces.size() << std::endl;\\n\\n if(adjFaces.empty() )\\n\\n {\\n\\n // We can either abort here or ignore the voxel\\n\\n // typename TIn::IndexType ind = itI.GetIndex();\\n\\n // std::cout << \\\"-1 : \\\" << ind[0] << ' ' << ind[1] << ' ' << ind[2] << std::endl;\\n\\n out_->SetPixel(itI.GetIndex(), -1);\\n\\n } else {\\n\\n\\n\\n //std::cout << \\\"Adjacent faces : \\\" << this->adjacentfaces[imatch].size() << std::endl;\\n\\n double minDist = LARGENUM;\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 94,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \" int fid = -1;\\n\\n for(adjFacesIt = adjFaces.begin(); adjFacesIt != adjFaces.end(); adjFacesIt++) {\\n\\n point projPoint;\\n\\n double dist = mesh.pointTriangleDistance(tmPoint, mesh.faces[*(adjFacesIt)], projPoint);\\n\\n if(dist + EPS <= minDist) {\\n\\n minDist = dist;\\n\\n fid = *(adjFacesIt);\\n\\n }\\n\\n }\\n\\n out_->SetPixel(itI.GetIndex(), fid);\\n\\n adjFaces.clear();\\n\\n }\\n\\n\\n\\n } else {\\n\\n // typename TIn::IndexType ind = itI.GetIndex();\\n\\n // std::cout << \\\"-1 : \\\" << ind[0] << ' ' << ind[1] << ' ' << ind[2] << std::endl;\\n\\n out_->SetPixel(itI.GetIndex(), -1);\\n\\n }\\n\\n\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\n/* Prateep */\\n\\ntemplate<class TIn, class TOut, class Mesh>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 95,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \"#ifndef MIN\\n\\n#define MIN(a,b) ((a)<(b))?(a):(b)\\n\\n#endif\\n\\n\\n\\n#ifndef MAX\\n\\n#define MAX(a,b) ((a)>(b))?(a):(b)\\n\\n#endif\\n\\n\\n\\nstatic int ITER_BLOCK = 0;\\n\\n\\n\\n/*Prateep */\\n\\ntemplate<class TIn, class TOut, class Mesh>\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 96,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \" } else {\\n\\n int imatch = (match - (const float*) &(mesh.vertices[0][0])) / 3;\\n\\n //std::cout << \\\"Adjacent faces : \\\" << mesh.adjacentfaces[imatch].size() << std::endl;\\n\\n vector<int> adjFaces; adjFaces.clear();\\n\\n vector<int>::iterator adjFacesIt;\\n\\n // Check one-ring to get list of adjacent faces\\n\\n for(size_t f = 0; f < mesh.adjacentfaces[imatch].size(); f++)\\n\\n {\\n\\n adjFaces.push_back(mesh.adjacentfaces[imatch][f]);\\n\\n }\\n\\n\\n\\n int fid = 0;\\n\\n double minDist = LARGENUM;\\n\\n for(adjFacesIt = adjFaces.begin(); adjFacesIt != adjFaces.end(); adjFacesIt++) {\\n\\n point projPoint;\\n\\n double dist = mesh.pointTriangleDistance(tmPoint, mesh.faces[*(adjFacesIt)], projPoint);\\n\\n if(dist + EPS <= minDist) {\\n\\n minDist = dist;\\n\\n fid = *(adjFacesIt);\\n\\n }\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 97,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \" }\\n\\n int &operator[] (int i) { return v[i]; }\\n\\n const int &operator[] (int i) const { return v[i]; }\\n\\n operator const int * () const { return &(v[0]); }\\n\\n operator const int * () { return &(v[0]); }\\n\\n operator int * () { return &(v[0]); }\\n\\n int indexof(int v_) const\\n\\n {\\n\\n return (v[0] == v_) ? 0 :\\n\\n (v[1] == v_) ? 1 :\\n\\n (v[2] == v_) ? 2 : -1;\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 98,\n \"score\": 66271.6173335092\n },\n {\n \"content\": \"\\n\\n void operator()(const TInP &in, const OutRegion & threadRegion)\\n\\n {\\n\\n ITER_BLOCK = ITER_BLOCK + 1;\\n\\n\\n\\n std::cout << \\\"Iteration : \\\" << ITER_BLOCK << std::endl;\\n\\n\\n\\n typedef itk::ImageRegionConstIteratorWithIndex<TIn> It;\\n\\n It itI(in, threadRegion);\\n\\n\\n\\n for(itI.GoToBegin(); !itI.IsAtEnd(); ++itI) {\\n\\n\\n\\n if(itI.Get() == 1)\\n\\n {\\n\\n point tmPoint;\\n\\n typename TIn::PointType itkPoint;\\n\\n in->TransformIndexToPhysicalPoint(itI.GetIndex(), itkPoint);\\n\\n for(int i = 0; i < 3; i++) { tmPoint[i] = itkPoint[i]; }\\n\\n\\n\\n // Get neartest k vertices\\n\",\n \"file_path\": \"ExternalLibs/trimesh2/include/TriMesh.h\",\n \"rank\": 99,\n \"score\": 66271.6173335092\n }\n]","isConversational":false}}},{"rowIdx":89,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"owGame/M2/M2_AnimatorComponent.cpp"},"repo_name":{"kind":"string","value":"Chaos192/OpenWow"},"commit":{"kind":"string","value":"1d91a51fafeedadc67122a3e9372ec4637a48434"},"file_code":{"kind":"string","value":"#include \"stdafx.h\"\n\n#include \"M2.h\"\n#include \"M2_Base_Instance.h\"\n\n#include \"M2_AnimatorComponent.h\"\n\nCM2AnimatorComponent::CM2AnimatorComponent(const CM2_Base_Instance& OwnerNode)\n\t: CSceneNodeComponentBase(OwnerNode)\n\t\n\t, m_CurrentAnimationID(EAnimationID::Stand)\n\t, m_CurrentAnimation(nullptr)\n\t\n\t, m_IsLoop(false)\n\t, m_IsStopped(false)\n\n\t, m_AnimTime(0.0)\n\t, m_CurrentTime(0)\n{\n\n}\n\nCM2AnimatorComponent::~CM2AnimatorComponent()\n{\n}\n\nvoid CM2AnimatorComponent::LoadAnimations()\n{\n\tconst auto& sequences = GetM2OwnerNode().GetM2().getSkeleton().GetSequences();\n\tfor (uint16 j = 0; j < sequences.size(); j++)\n\t{\n\t\tconst auto& sequence = sequences[j];\n\t\tif (sequence.variationIndex == 0)\n\t\t{\n\t\t\tconst DBC_AnimationDataRecord* dbcAnimationRecord = GetBaseManager().GetManager<CDBCStorage>()->DBC_AnimationData()[sequence.__animID];\n\t\t\tif (dbcAnimationRecord == nullptr)\n\t\t\t\tthrow CException(\"CM2AnimatorComponent::CM2AnimatorComponent: Sequence '%d' not found in 'DBC_AnimationData'.\", sequence.__animID);\n\n\t\t\tm_Animations.insert(std::make_pair(sequence.__animID, MakeShared(CM2_Animation, GetM2OwnerNode().GetM2(), sequence, dbcAnimationRecord->Get_Name(), j)));\n\t\t}\n\t}\n\n\t_ASSERT(m_Animations.size() > 0);\n\tPlayAnimation(m_CurrentAnimationID, true);\n}\n\nvoid CM2AnimatorComponent::PlayAnimation(EAnimationID AnimationId, bool Loop)\n{\n\tif (Loop && m_CurrentAnimationID == AnimationId && m_CurrentAnimation && m_CurrentAnimation->getAnimID() == AnimationId)\n\t\treturn;\n\n\tconst auto& animIt = m_Animations.find((uint16)AnimationId);\n\tif (animIt != m_Animations.end())\n\t{\n\t\tm_CurrentAnimationID = AnimationId;\n\t\tm_CurrentAnimation = animIt->second.get();\n\t}\n\telse\n\t{\n\t\tm_CurrentAnimationID = EAnimationID::Stand;\n\t\tm_CurrentAnimation = m_Animations.begin()->second.get();\n\t\t\n\t}\n\n\tm_IsLoop = Loop;\n\tm_IsStopped = false;\n\tm_AnimTime = 0.0;\n\tm_CurrentTime = m_CurrentAnimation->getStart();\n}\n\nvoid CM2AnimatorComponent::SetAnimationEventListener(std::shared_ptr<IM2AnimationEventsListener> M2AnimationEventListener)\n{\n\tm_M2AnimationEventListener = M2AnimationEventListener;\n}\n\nvoid CM2AnimatorComponent::PrintList()\n{\n\tfor (auto& it : m_Animations)\n\t{\n\t\tLog::Warn(\"[%d] is [%s]\", it.first, it.second->getAnimationName().c_str());\n\t}\n}\n\nvoid CM2AnimatorComponent::Update(const UpdateEventArgs & e)\n{\n\tif (m_CurrentAnimation == nullptr)\n\t\treturn;\n\n\tif (m_IsStopped)\n\t\treturn;\n\n\tm_AnimTime += e.DeltaTime;\n\tm_CurrentTime = m_CurrentAnimation->getStart() + static_cast<uint32>(m_AnimTime);\n\n\t\n\tif (m_CurrentTime < m_CurrentAnimation->getEnd())\n\t{\n\t\treturn;\n\t}\n\n\tif (auto animationEventListener = m_M2AnimationEventListener.lock())\n\t\tanimationEventListener->OnAnimationEnded(m_CurrentAnimationID);\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\tif (m_IsLoop)\n\t{\n\t\tm_IsStopped = false;\n\t\tm_AnimTime = 0.0;\n\t\tm_CurrentTime = m_CurrentAnimation->getStart();\n\t}\n\telse\n\t{\n\t\tm_IsStopped = true;\n\t\tm_AnimTime = 0.0;\n\t\tm_CurrentTime = m_CurrentAnimation->getEnd() - 1;\n\t}\n}\n\nconst CM2_Base_Instance & CM2AnimatorComponent::GetM2OwnerNode() const\n{\n\treturn dynamic_cast<const CM2_Base_Instance&>(GetOwnerNode());\n}\n"},"prefix":{"kind":"string","value":"#include \"stdafx.h\"\n\n#include \"M2.h\"\n#include \"M2_Base_Instance.h\"\n\n#include \"M2_AnimatorComponent.h\"\n\nCM2AnimatorComponent::CM2AnimatorComponent(const CM2_Base_Instance& OwnerNode)\n\t: CSceneNodeComponentBase(OwnerNode)\n\t\n\t, m_CurrentAnimationID(EAnimationID::Stand)\n\t, m_CurrentAnimation(nullptr)\n\t\n\t, m_IsLoop(false)\n\t, m_IsStopped(false)\n\n\t, m_AnimTime(0.0)\n\t, m_CurrentTime(0)\n{\n\n}\n\nCM2AnimatorComponent::~CM2AnimatorComponent()\n{\n}\n\nvoid CM2AnimatorComponent::LoadAnimations()\n{\n\tconst auto& sequences = GetM2OwnerNode().GetM2().getSkeleton().GetSequences();\n\tfor (uint16 j = 0; j < sequences.size(); j++)\n\t{\n\t\tconst auto& sequence = sequences[j];\n\t\tif (sequence.variationIndex == 0)\n\t\t{\n\t\t\tconst DBC_AnimationDataRecord* dbcAnimationRecord = GetBaseManager().GetManager<CDBCStorage>()->DBC_AnimationData()[sequence.__animID];\n\t\t\tif (dbcAnimationRecord == nullptr)\n\t\t\t\tthrow CException(\"CM2AnimatorComponent::CM2AnimatorComponent: Sequence '%d' not found in 'DBC_AnimationData'.\", sequence.__animID);\n\n\t\t\tm_Animations.insert(std::make_pair(sequence.__animID, MakeShared(CM2_Animation, GetM2OwnerNode().GetM2(), sequence, dbcAnimationRecord->Get_Name(), j)));\n\t\t}\n\t}\n\n\t_ASSERT(m_Animations.size() > 0);\n\tPlayAnimation(m_CurrentAnimationID, true);\n}\n\nvoid CM2AnimatorComponent::PlayAnimation(EAnimationID AnimationId, bool Loop)\n{\n\tif (Loop && m_CurrentAnimationID == AnimationId && m_CurrentAnimation && m_CurrentAnimation->getAnimID() == AnimationId)\n\t\treturn;\n\n\tconst auto& animIt = m_Animations.find((uint16)AnimationId);\n\tif (animIt != m_Animations.end())\n\t{\n\t\tm_CurrentAnimationID = AnimationId;\n\t\tm_CurrentAnimation = animIt->second.get();\n\t}\n\telse\n\t{\n\t\tm_CurrentAnimationID = EAnimationID::Stand;\n\t\tm_CurrentAnimation = m_Animations.begin()->second.get();\n\t\t\n\t}\n\n\tm_IsLoop = Loop;\n\tm_IsStopped = false;\n\tm_AnimTime = 0.0;\n\tm_CurrentTime = m_CurrentAnimation->getStart();\n}\n\nvoid CM2AnimatorComponent::SetAnimationEventListener(std::shared_ptr<IM2AnimationEventsListener> M2AnimationEventListener)\n{\n\tm_M2AnimationEventListener = M2AnimationEventListener;\n}\n\nvoid CM2AnimatorComponent::PrintList()\n{\n\tfor (auto& it : m_Animations)\n\t{\n\t\tLog::Warn(\"[%d] is [%s]\", it.first, it.second->getAnimationName().c_str());\n\t}\n}\n\n"},"suffix":{"kind":"string","value":"\n\nconst CM2_Base_Instance & CM2AnimatorComponent::GetM2OwnerNode() const\n{\n\treturn dynamic_cast<const CM2_Base_Instance&>(GetOwnerNode());\n}\n"},"middle":{"kind":"string","value":"void CM2AnimatorComponent::Update(const UpdateEventArgs & e)\n{\n\tif (m_CurrentAnimation == nullptr)\n\t\treturn;\n\n\tif (m_IsStopped)\n\t\treturn;\n\n\tm_AnimTime += e.DeltaTime;\n\tm_CurrentTime = m_CurrentAnimation->getStart() + static_cast<uint32>(m_AnimTime);\n\n\t\n\tif (m_CurrentTime < m_CurrentAnimation->getEnd())\n\t{\n\t\treturn;\n\t}\n\n\tif (auto animationEventListener = m_M2AnimationEventListener.lock())\n\t\tanimationEventListener->OnAnimationEnded(m_CurrentAnimationID);\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\tif (m_IsLoop)\n\t{\n\t\tm_IsStopped = false;\n\t\tm_AnimTime = 0.0;\n\t\tm_CurrentTime = m_CurrentAnimation->getStart();\n\t}\n\telse\n\t{\n\t\tm_IsStopped = true;\n\t\tm_AnimTime = 0.0;\n\t\tm_CurrentTime = m_CurrentAnimation->getEnd() - 1;\n\t}\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"enum Opcodes : uint16\n\n{\n\n\tNULL_ACTION = 0x000,\n\n\tCMSG_BOOTME = 0x001,\n\n\tCMSG_DBLOOKUP = 0x002,\n\n\tSMSG_DBLOOKUP = 0x003,\n\n\tCMSG_QUERY_OBJECT_POSITION = 0x004,\n\n\tSMSG_QUERY_OBJECT_POSITION = 0x005,\n\n\tCMSG_QUERY_OBJECT_ROTATION = 0x006,\n\n\tSMSG_QUERY_OBJECT_ROTATION = 0x007,\n\n\tCMSG_WORLD_TELEPORT = 0x008,\n\n\tCMSG_TELEPORT_TO_UNIT = 0x009,\n\n\tCMSG_ZONE_MAP = 0x00A,\n\n\tSMSG_ZONE_MAP = 0x00B,\n\n\tCMSG_DEBUG_CHANGECELLZONE = 0x00C,\n\n\tCMSG_MOVE_CHARACTER_CHEAT = 0x00D,\n\n\tSMSG_MOVE_CHARACTER_CHEAT = 0x00E,\n\n\tCMSG_RECHARGE = 0x00F,\n\n\tCMSG_LEARN_SPELL = 0x010,\n\n\tCMSG_CREATEMONSTER = 0x011,\n\n\tCMSG_DESTROYMONSTER = 0x012,\n\n\tCMSG_CREATEITEM = 0x013,\n\n\tCMSG_CREATEGAMEOBJECT = 0x014,\n\n\tSMSG_CHECK_FOR_BOTS = 0x015,\n\n\tCMSG_MAKEMONSTERATTACKGUID = 0x016,\n\n\tCMSG_BOT_DETECTED2 = 0x017,\n\n\tCMSG_FORCEACTION = 0x018,\n\n\tCMSG_FORCEACTIONONOTHER = 0x019,\n\n\tCMSG_FORCEACTIONSHOW = 0x01A,\n\n\tSMSG_FORCEACTIONSHOW = 0x01B,\n\n\tCMSG_PETGODMODE = 0x01C,\n\n\tSMSG_PETGODMODE = 0x01D,\n\n\tSMSG_REFER_A_FRIEND_EXPIRED = 0x01E,\n\n\tCMSG_WEATHER_SPEED_CHEAT = 0x01F,\n\n\tCMSG_UNDRESSPLAYER = 0x020,\n\n\tCMSG_BEASTMASTER = 0x021,\n\n\tCMSG_GODMODE = 0x022,\n\n\tSMSG_GODMODE = 0x023,\n\n\tCMSG_CHEAT_SETMONEY = 0x024,\n\n\tCMSG_LEVEL_CHEAT = 0x025,\n\n\tCMSG_PET_LEVEL_CHEAT = 0x026,\n\n\tCMSG_SET_WORLDSTATE = 0x027,\n\n\tCMSG_COOLDOWN_CHEAT = 0x028,\n\n\tCMSG_USE_SKILL_CHEAT = 0x029,\n\n\tCMSG_FLAG_QUEST = 0x02A,\n\n\tCMSG_FLAG_QUEST_FINISH = 0x02B,\n\n\tCMSG_CLEAR_QUEST = 0x02C,\n\n\tCMSG_SEND_EVENT = 0x02D,\n\n\tCMSG_DEBUG_AISTATE = 0x02E,\n\n\tSMSG_DEBUG_AISTATE = 0x02F,\n\n\tCMSG_DISABLE_PVP_CHEAT = 0x030,\n\n\tCMSG_ADVANCE_SPAWN_TIME = 0x031,\n\n\tSMSG_DESTRUCTIBLE_BUILDING_DAMAGE = 0x032,\n\n\tCMSG_AUTH_SRP6_BEGIN = 0x033,\n\n\tCMSG_AUTH_SRP6_PROOF = 0x034,\n\n\tCMSG_AUTH_SRP6_RECODE = 0x035,\n\n\tCMSG_CHAR_CREATE = 0x036,\n\n\tCMSG_CHAR_ENUM = 0x037,\n\n\tCMSG_CHAR_DELETE = 0x038,\n\n\tSMSG_AUTH_SRP6_RESPONSE = 0x039,\n\n\tSMSG_CHAR_CREATE = 0x03A,\n\n\tSMSG_CHAR_ENUM = 0x03B,\n\n\tSMSG_CHAR_DELETE = 0x03C,\n\n\tCMSG_PLAYER_LOGIN = 0x03D,\n\n\tSMSG_NEW_WORLD = 0x03E,\n\n\tSMSG_TRANSFER_PENDING = 0x03F,\n\n\tSMSG_TRANSFER_ABORTED = 0x040,\n\n\tSMSG_CHARACTER_LOGIN_FAILED = 0x041,\n\n\tSMSG_LOGIN_SET_TIME_SPEED = 0x042,\n\n\tSMSG_GAMETIME_UPDATE = 0x043,\n\n\tCMSG_GAMETIME_SET = 0x044,\n\n\tSMSG_GAMETIME_SET = 0x045,\n\n\tCMSG_GAMESPEED_SET = 0x046,\n\n\tSMSG_GAMESPEED_SET = 0x047,\n\n\tCMSG_SERVERTIME = 0x048,\n\n\tSMSG_SERVERTIME = 0x049,\n\n\tCMSG_PLAYER_LOGOUT = 0x04A,\n\n\tCMSG_LOGOUT_REQUEST = 0x04B,\n\n\tSMSG_LOGOUT_RESPONSE = 0x04C,\n\n\tSMSG_LOGOUT_COMPLETE = 0x04D,\n\n\tCMSG_LOGOUT_CANCEL = 0x04E,\n\n\tSMSG_LOGOUT_CANCEL_ACK = 0x04F,\n\n\tCMSG_NAME_QUERY = 0x050,\n\n\tSMSG_NAME_QUERY_RESPONSE = 0x051,\n\n\tCMSG_PET_NAME_QUERY = 0x052,\n\n\tSMSG_PET_NAME_QUERY_RESPONSE = 0x053,\n\n\tCMSG_GUILD_QUERY = 0x054,\n\n\tSMSG_GUILD_QUERY_RESPONSE = 0x055,\n\n\tCMSG_ITEM_QUERY_SINGLE = 0x056,\n\n\tCMSG_ITEM_QUERY_MULTIPLE = 0x057,\n\n\tSMSG_ITEM_QUERY_SINGLE_RESPONSE = 0x058,\n\n\tSMSG_ITEM_QUERY_MULTIPLE_RESPONSE = 0x059,\n\n\tCMSG_PAGE_TEXT_QUERY = 0x05A,\n\n\tSMSG_PAGE_TEXT_QUERY_RESPONSE = 0x05B,\n\n\tCMSG_QUEST_QUERY = 0x05C,\n\n\tSMSG_QUEST_QUERY_RESPONSE = 0x05D,\n\n\tCMSG_GAMEOBJECT_QUERY = 0x05E,\n\n\tSMSG_GAMEOBJECT_QUERY_RESPONSE = 0x05F,\n\n\tCMSG_CREATURE_QUERY = 0x060,\n\n\tSMSG_CREATURE_QUERY_RESPONSE = 0x061,\n\n\tCMSG_WHO = 0x062,\n\n\tSMSG_WHO = 0x063,\n\n\tCMSG_WHOIS = 0x064,\n\n\tSMSG_WHOIS = 0x065,\n\n\tCMSG_CONTACT_LIST = 0x066,\n\n\tSMSG_CONTACT_LIST = 0x067,\n\n\tSMSG_FRIEND_STATUS = 0x068,\n\n\tCMSG_ADD_FRIEND = 0x069,\n\n\tCMSG_DEL_FRIEND = 0x06A,\n\n\tCMSG_SET_CONTACT_NOTES = 0x06B,\n\n\tCMSG_ADD_IGNORE = 0x06C,\n\n\tCMSG_DEL_IGNORE = 0x06D,\n\n\tCMSG_GROUP_INVITE = 0x06E,\n\n\tSMSG_GROUP_INVITE = 0x06F,\n\n\tCMSG_GROUP_CANCEL = 0x070,\n\n\tSMSG_GROUP_CANCEL = 0x071,\n\n\tCMSG_GROUP_ACCEPT = 0x072,\n\n\tCMSG_GROUP_DECLINE = 0x073,\n\n\tSMSG_GROUP_DECLINE = 0x074,\n\n\tCMSG_GROUP_UNINVITE = 0x075,\n\n\tCMSG_GROUP_UNINVITE_GUID = 0x076,\n\n\tSMSG_GROUP_UNINVITE = 0x077,\n\n\tCMSG_GROUP_SET_LEADER = 0x078,\n\n\tSMSG_GROUP_SET_LEADER = 0x079,\n\n\tCMSG_LOOT_METHOD = 0x07A,\n\n\tCMSG_GROUP_DISBAND = 0x07B,\n\n\tSMSG_GROUP_DESTROYED = 0x07C,\n\n\tSMSG_GROUP_LIST = 0x07D,\n\n\tSMSG_PARTY_MEMBER_STATS = 0x07E,\n\n\tSMSG_PARTY_COMMAND_RESULT = 0x07F,\n\n\tUMSG_UPDATE_GROUP_MEMBERS = 0x080,\n\n\tCMSG_GUILD_CREATE = 0x081,\n\n\tCMSG_GUILD_INVITE = 0x082,\n\n\tSMSG_GUILD_INVITE = 0x083,\n\n\tCMSG_GUILD_ACCEPT = 0x084,\n\n\tCMSG_GUILD_DECLINE = 0x085,\n\n\tSMSG_GUILD_DECLINE = 0x086,\n\n\tCMSG_GUILD_INFO = 0x087,\n\n\tSMSG_GUILD_INFO = 0x088,\n\n\tCMSG_GUILD_ROSTER = 0x089,\n\n\tSMSG_GUILD_ROSTER = 0x08A,\n\n\tCMSG_GUILD_PROMOTE = 0x08B,\n\n\tCMSG_GUILD_DEMOTE = 0x08C,\n\n\tCMSG_GUILD_LEAVE = 0x08D,\n\n\tCMSG_GUILD_REMOVE = 0x08E,\n\n\tCMSG_GUILD_DISBAND = 0x08F,\n\n\tCMSG_GUILD_LEADER = 0x090,\n\n\tCMSG_GUILD_MOTD = 0x091,\n\n\tSMSG_GUILD_EVENT = 0x092,\n\n\tSMSG_GUILD_COMMAND_RESULT = 0x093,\n\n\tUMSG_UPDATE_GUILD = 0x094,\n\n\tCMSG_MESSAGECHAT = 0x095,\n\n\tSMSG_MESSAGECHAT = 0x096,\n\n\tCMSG_JOIN_CHANNEL = 0x097,\n\n\tCMSG_LEAVE_CHANNEL = 0x098,\n\n\tSMSG_CHANNEL_NOTIFY = 0x099,\n\n\tCMSG_CHANNEL_LIST = 0x09A,\n\n\tSMSG_CHANNEL_LIST = 0x09B,\n\n\tCMSG_CHANNEL_PASSWORD = 0x09C,\n\n\tCMSG_CHANNEL_SET_OWNER = 0x09D,\n\n\tCMSG_CHANNEL_OWNER = 0x09E,\n\n\tCMSG_CHANNEL_MODERATOR = 0x09F,\n\n\tCMSG_CHANNEL_UNMODERATOR = 0x0A0,\n\n\tCMSG_CHANNEL_MUTE = 0x0A1,\n\n\tCMSG_CHANNEL_UNMUTE = 0x0A2,\n\n\tCMSG_CHANNEL_INVITE = 0x0A3,\n\n\tCMSG_CHANNEL_KICK = 0x0A4,\n\n\tCMSG_CHANNEL_BAN = 0x0A5,\n\n\tCMSG_CHANNEL_UNBAN = 0x0A6,\n\n\tCMSG_CHANNEL_ANNOUNCEMENTS = 0x0A7,\n\n\tCMSG_CHANNEL_MODERATE = 0x0A8,\n\n\tSMSG_UPDATE_OBJECT = 0x0A9,\n\n\tSMSG_DESTROY_OBJECT = 0x0AA,\n\n\tCMSG_USE_ITEM = 0x0AB,\n\n\tCMSG_OPEN_ITEM = 0x0AC,\n\n\tCMSG_READ_ITEM = 0x0AD,\n\n\tSMSG_READ_ITEM_OK = 0x0AE,\n\n\tSMSG_READ_ITEM_FAILED = 0x0AF,\n\n\tSMSG_ITEM_COOLDOWN = 0x0B0,\n\n\tCMSG_GAMEOBJ_USE = 0x0B1,\n\n\tCMSG_DESTROY_ITEMS = 0x0B2,\n\n\tSMSG_GAMEOBJECT_CUSTOM_ANIM = 0x0B3,\n\n\tCMSG_AREATRIGGER = 0x0B4,\n\n\tMSG_MOVE_START_FORWARD = 0x0B5,\n\n\tMSG_MOVE_START_BACKWARD = 0x0B6,\n\n\tMSG_MOVE_STOP = 0x0B7,\n\n\tMSG_MOVE_START_STRAFE_LEFT = 0x0B8,\n\n\tMSG_MOVE_START_STRAFE_RIGHT = 0x0B9,\n\n\tMSG_MOVE_STOP_STRAFE = 0x0BA,\n\n\tMSG_MOVE_JUMP = 0x0BB,\n\n\tMSG_MOVE_START_TURN_LEFT = 0x0BC,\n\n\tMSG_MOVE_START_TURN_RIGHT = 0x0BD,\n\n\tMSG_MOVE_STOP_TURN = 0x0BE,\n\n\tMSG_MOVE_START_PITCH_UP = 0x0BF,\n\n\tMSG_MOVE_START_PITCH_DOWN = 0x0C0,\n\n\tMSG_MOVE_STOP_PITCH = 0x0C1,\n\n\tMSG_MOVE_SET_RUN_MODE = 0x0C2,\n\n\tMSG_MOVE_SET_WALK_MODE = 0x0C3,\n\n\tMSG_MOVE_TOGGLE_LOGGING = 0x0C4,\n\n\tMSG_MOVE_TELEPORT = 0x0C5,\n\n\tMSG_MOVE_TELEPORT_CHEAT = 0x0C6,\n\n\tMSG_MOVE_TELEPORT_ACK = 0x0C7,\n\n\tMSG_MOVE_TOGGLE_FALL_LOGGING = 0x0C8,\n\n\tMSG_MOVE_FALL_LAND = 0x0C9,\n\n\tMSG_MOVE_START_SWIM = 0x0CA,\n\n\tMSG_MOVE_STOP_SWIM = 0x0CB,\n\n\tMSG_MOVE_SET_RUN_SPEED_CHEAT = 0x0CC,\n\n\tMSG_MOVE_SET_RUN_SPEED = 0x0CD,\n\n\tMSG_MOVE_SET_RUN_BACK_SPEED_CHEAT = 0x0CE,\n\n\tMSG_MOVE_SET_RUN_BACK_SPEED = 0x0CF,\n\n\tMSG_MOVE_SET_WALK_SPEED_CHEAT = 0x0D0,\n\n\tMSG_MOVE_SET_WALK_SPEED = 0x0D1,\n\n\tMSG_MOVE_SET_SWIM_SPEED_CHEAT = 0x0D2,\n\n\tMSG_MOVE_SET_SWIM_SPEED = 0x0D3,\n\n\tMSG_MOVE_SET_SWIM_BACK_SPEED_CHEAT = 0x0D4,\n\n\tMSG_MOVE_SET_SWIM_BACK_SPEED = 0x0D5,\n\n\tMSG_MOVE_SET_ALL_SPEED_CHEAT = 0x0D6,\n\n\tMSG_MOVE_SET_TURN_RATE_CHEAT = 0x0D7,\n\n\tMSG_MOVE_SET_TURN_RATE = 0x0D8,\n\n\tMSG_MOVE_TOGGLE_COLLISION_CHEAT = 0x0D9,\n\n\tMSG_MOVE_SET_FACING = 0x0DA,\n\n\tMSG_MOVE_SET_PITCH = 0x0DB,\n\n\tMSG_MOVE_WORLDPORT_ACK = 0x0DC,\n\n\tSMSG_MONSTER_MOVE = 0x0DD,\n\n\tSMSG_MOVE_WATER_WALK = 0x0DE,\n\n\tSMSG_MOVE_LAND_WALK = 0x0DF,\n\n\tCMSG_MOVE_CHARM_PORT_CHEAT = 0x0E0,\n\n\tCMSG_MOVE_SET_RAW_POSITION = 0x0E1,\n\n\tSMSG_FORCE_RUN_SPEED_CHANGE = 0x0E2,\n\n\tCMSG_FORCE_RUN_SPEED_CHANGE_ACK = 0x0E3,\n\n\tSMSG_FORCE_RUN_BACK_SPEED_CHANGE = 0x0E4,\n\n\tCMSG_FORCE_RUN_BACK_SPEED_CHANGE_ACK = 0x0E5,\n\n\tSMSG_FORCE_SWIM_SPEED_CHANGE = 0x0E6,\n\n\tCMSG_FORCE_SWIM_SPEED_CHANGE_ACK = 0x0E7,\n\n\tSMSG_FORCE_MOVE_ROOT = 0x0E8,\n\n\tCMSG_FORCE_MOVE_ROOT_ACK = 0x0E9,\n\n\tSMSG_FORCE_MOVE_UNROOT = 0x0EA,\n\n\tCMSG_FORCE_MOVE_UNROOT_ACK = 0x0EB,\n\n\tMSG_MOVE_ROOT = 0x0EC,\n\n\tMSG_MOVE_UNROOT = 0x0ED,\n\n\tMSG_MOVE_HEARTBEAT = 0x0EE,\n\n\tSMSG_MOVE_KNOCK_BACK = 0x0EF,\n\n\tCMSG_MOVE_KNOCK_BACK_ACK = 0x0F0,\n\n\tMSG_MOVE_KNOCK_BACK = 0x0F1,\n\n\tSMSG_MOVE_FEATHER_FALL = 0x0F2,\n\n\tSMSG_MOVE_NORMAL_FALL = 0x0F3,\n\n\tSMSG_MOVE_SET_HOVER = 0x0F4,\n\n\tSMSG_MOVE_UNSET_HOVER = 0x0F5,\n\n\tCMSG_MOVE_HOVER_ACK = 0x0F6,\n\n\tMSG_MOVE_HOVER = 0x0F7,\n\n\tCMSG_TRIGGER_CINEMATIC_CHEAT = 0x0F8,\n\n\tCMSG_OPENING_CINEMATIC = 0x0F9,\n\n\tSMSG_TRIGGER_CINEMATIC = 0x0FA,\n\n\tCMSG_NEXT_CINEMATIC_CAMERA = 0x0FB,\n\n\tCMSG_COMPLETE_CINEMATIC = 0x0FC,\n\n\tSMSG_TUTORIAL_FLAGS = 0x0FD,\n\n\tCMSG_TUTORIAL_FLAG = 0x0FE,\n\n\tCMSG_TUTORIAL_CLEAR = 0x0FF,\n\n\tCMSG_TUTORIAL_RESET = 0x100,\n\n\tCMSG_STANDSTATECHANGE = 0x101,\n\n\tCMSG_EMOTE = 0x102,\n\n\tSMSG_EMOTE = 0x103,\n\n\tCMSG_TEXT_EMOTE = 0x104,\n\n\tSMSG_TEXT_EMOTE = 0x105,\n\n\tCMSG_AUTOEQUIP_GROUND_ITEM = 0x106,\n\n\tCMSG_AUTOSTORE_GROUND_ITEM = 0x107,\n\n\tCMSG_AUTOSTORE_LOOT_ITEM = 0x108,\n\n\tCMSG_STORE_LOOT_IN_SLOT = 0x109,\n\n\tCMSG_AUTOEQUIP_ITEM = 0x10A,\n\n\tCMSG_AUTOSTORE_BAG_ITEM = 0x10B,\n\n\tCMSG_SWAP_ITEM = 0x10C,\n\n\tCMSG_SWAP_INV_ITEM = 0x10D,\n\n\tCMSG_SPLIT_ITEM = 0x10E,\n\n\tCMSG_AUTOEQUIP_ITEM_SLOT = 0x10F,\n\n\tCMSG_UNCLAIM_LICENSE = 0x110,\n\n\tCMSG_DESTROYITEM = 0x111,\n\n\tSMSG_INVENTORY_CHANGE_FAILURE = 0x112,\n\n\tSMSG_OPEN_CONTAINER = 0x113,\n\n\tCMSG_INSPECT = 0x114,\n\n\tSMSG_INSPECT_RESULTS_UPDATE = 0x115,\n\n\tCMSG_INITIATE_TRADE = 0x116,\n\n\tCMSG_BEGIN_TRADE = 0x117,\n\n\tCMSG_BUSY_TRADE = 0x118,\n\n\tCMSG_IGNORE_TRADE = 0x119,\n\n\tCMSG_ACCEPT_TRADE = 0x11A,\n\n\tCMSG_UNACCEPT_TRADE = 0x11B,\n\n\tCMSG_CANCEL_TRADE = 0x11C,\n\n\tCMSG_SET_TRADE_ITEM = 0x11D,\n\n\tCMSG_CLEAR_TRADE_ITEM = 0x11E,\n\n\tCMSG_SET_TRADE_GOLD = 0x11F,\n\n\tSMSG_TRADE_STATUS = 0x120,\n\n\tSMSG_TRADE_STATUS_EXTENDED = 0x121,\n\n\tSMSG_INITIALIZE_FACTIONS = 0x122,\n\n\tSMSG_SET_FACTION_VISIBLE = 0x123,\n\n\tSMSG_SET_FACTION_STANDING = 0x124,\n\n\tCMSG_SET_FACTION_ATWAR = 0x125,\n\n\tCMSG_SET_FACTION_CHEAT = 0x126,\n\n\tSMSG_SET_PROFICIENCY = 0x127,\n\n\tCMSG_SET_ACTION_BUTTON = 0x128,\n\n\tSMSG_ACTION_BUTTONS = 0x129,\n\n\tSMSG_INITIAL_SPELLS = 0x12A,\n\n\tSMSG_LEARNED_SPELL = 0x12B,\n\n\tSMSG_SUPERCEDED_SPELL = 0x12C,\n\n\tCMSG_NEW_SPELL_SLOT = 0x12D,\n\n\tCMSG_CAST_SPELL = 0x12E,\n\n\tCMSG_CANCEL_CAST = 0x12F,\n\n\tSMSG_CAST_FAILED = 0x130,\n\n\tSMSG_SPELL_START = 0x131,\n\n\tSMSG_SPELL_GO = 0x132,\n\n\tSMSG_SPELL_FAILURE = 0x133,\n\n\tSMSG_SPELL_COOLDOWN = 0x134,\n\n\tSMSG_COOLDOWN_EVENT = 0x135,\n\n\tCMSG_CANCEL_AURA = 0x136,\n\n\tSMSG_EQUIPMENT_SET_SAVED = 0x137,\n\n\tSMSG_PET_CAST_FAILED = 0x138,\n\n\tMSG_CHANNEL_START = 0x139,\n\n\tMSG_CHANNEL_UPDATE = 0x13A,\n\n\tCMSG_CANCEL_CHANNELLING = 0x13B,\n\n\tSMSG_AI_REACTION = 0x13C,\n\n\tCMSG_SET_SELECTION = 0x13D,\n\n\tCMSG_DELETEEQUIPMENT_SET = 0x13E,\n\n\tCMSG_INSTANCE_LOCK_RESPONSE = 0x13F,\n\n\tCMSG_DEBUG_PASSIVE_AURA = 0x140,\n\n\tCMSG_ATTACK_SWING = 0x141,\n\n\tCMSG_ATTACK_STOP = 0x142,\n\n\tSMSG_ATTACK_START = 0x143,\n\n\tSMSG_ATTACK_STOP = 0x144,\n\n\tSMSG_ATTACK_SWING_NOT_IN_RANGE = 0x145,\n\n\tSMSG_ATTACK_SWING_BAD_FACING = 0x146,\n\n\tSMSG_INSTANCE_LOCK_WARNING_QUERY = 0x147,\n\n\tSMSG_ATTACK_SWING_DEAD_TARGET = 0x148,\n\n\tSMSG_ATTACK_SWING_CANT_ATTACK = 0x149,\n\n\tSMSG_ATTACKERSTATEUPDATE = 0x14A,\n\n\tSMSG_BATTLEFIELD_PORT_DENIED = 0x14B,\n\n\tCMSG_PERFORM_ACTION_SET = 0x14C,\n\n\tSMSG_RESUME_CAST_BAR = 0x14D,\n\n\tSMSG_CANCEL_COMBAT = 0x14E,\n\n\tSMSG_SPELLBREAKLOG = 0x14F,\n\n\tSMSG_SPELLHEALLOG = 0x150,\n\n\tSMSG_SPELLENERGIZELOG = 0x151,\n\n\tSMSG_BREAK_TARGET = 0x152,\n\n\tCMSG_SAVE_PLAYER = 0x153,\n\n\tCMSG_SETDEATHBINDPOINT = 0x154,\n\n\tSMSG_BIND_POINT_UPDATE = 0x155,\n\n\tCMSG_GETDEATHBINDZONE = 0x156,\n\n\tSMSG_BINDZONEREPLY = 0x157,\n\n\tSMSG_PLAYER_BOUND = 0x158,\n\n\tSMSG_CLIENT_CONTROL_UPDATE = 0x159,\n\n\tCMSG_REPOP_REQUEST = 0x15A,\n\n\tSMSG_RESURRECT_REQUEST = 0x15B,\n\n\tCMSG_RESURRECT_RESPONSE = 0x15C,\n\n\tCMSG_LOOT = 0x15D,\n\n\tCMSG_LOOT_MONEY = 0x15E,\n\n\tCMSG_LOOT_RELEASE = 0x15F,\n\n\tSMSG_LOOT_RESPONSE = 0x160,\n\n\tSMSG_LOOT_RELEASE_RESPONSE = 0x161,\n\n\tSMSG_LOOT_REMOVED = 0x162,\n\n\tSMSG_LOOT_MONEY_NOTIFY = 0x163,\n\n\tSMSG_LOOT_ITEM_NOTIFY = 0x164,\n\n\tSMSG_LOOT_CLEAR_MONEY = 0x165,\n\n\tSMSG_ITEM_PUSH_RESULT = 0x166,\n\n\tSMSG_DUEL_REQUESTED = 0x167,\n\n\tSMSG_DUEL_OUTOFBOUNDS = 0x168,\n\n\tSMSG_DUEL_INBOUNDS = 0x169,\n\n\tSMSG_DUEL_COMPLETE = 0x16A,\n\n\tSMSG_DUEL_WINNER = 0x16B,\n\n\tCMSG_DUEL_ACCEPTED = 0x16C,\n\n\tCMSG_DUEL_CANCELLED = 0x16D,\n\n\tSMSG_MOUNTRESULT = 0x16E,\n\n\tSMSG_DISMOUNTRESULT = 0x16F,\n\n\tSMSG_REMOVED_FROM_PVP_QUEUE = 0x170,\n\n\tCMSG_MOUNTSPECIAL_ANIM = 0x171,\n\n\tSMSG_MOUNTSPECIAL_ANIM = 0x172,\n\n\tSMSG_PET_TAME_FAILURE = 0x173,\n\n\tCMSG_PET_SET_ACTION = 0x174,\n\n\tCMSG_PET_ACTION = 0x175,\n\n\tCMSG_PET_ABANDON = 0x176,\n\n\tCMSG_PET_RENAME = 0x177,\n\n\tSMSG_PET_NAME_INVALID = 0x178,\n\n\tSMSG_PET_SPELLS = 0x179,\n\n\tSMSG_PET_MODE = 0x17A,\n\n\tCMSG_GOSSIP_HELLO = 0x17B,\n\n\tCMSG_GOSSIP_SELECT_OPTION = 0x17C,\n\n\tSMSG_GOSSIP_MESSAGE = 0x17D,\n\n\tSMSG_GOSSIP_COMPLETE = 0x17E,\n\n\tCMSG_NPC_TEXT_QUERY = 0x17F,\n\n\tSMSG_NPC_TEXT_UPDATE = 0x180,\n\n\tSMSG_NPC_WONT_TALK = 0x181,\n\n\tCMSG_QUESTGIVER_STATUS_QUERY = 0x182,\n\n\tSMSG_QUESTGIVER_STATUS = 0x183,\n\n\tCMSG_QUESTGIVER_HELLO = 0x184,\n\n\tSMSG_QUESTGIVER_QUEST_LIST = 0x185,\n\n\tCMSG_QUESTGIVER_QUERY_QUEST = 0x186,\n\n\tCMSG_QUESTGIVER_QUEST_AUTOLAUNCH = 0x187,\n\n\tSMSG_QUESTGIVER_QUEST_DETAILS = 0x188,\n\n\tCMSG_QUESTGIVER_ACCEPT_QUEST = 0x189,\n\n\tCMSG_QUESTGIVER_COMPLETE_QUEST = 0x18A,\n\n\tSMSG_QUESTGIVER_REQUEST_ITEMS = 0x18B,\n\n\tCMSG_QUESTGIVER_REQUEST_REWARD = 0x18C,\n\n\tSMSG_QUESTGIVER_OFFER_REWARD = 0x18D,\n\n\tCMSG_QUESTGIVER_CHOOSE_REWARD = 0x18E,\n\n\tSMSG_QUESTGIVER_QUEST_INVALID = 0x18F,\n\n\tCMSG_QUESTGIVER_CANCEL = 0x190,\n\n\tSMSG_QUESTGIVER_QUEST_COMPLETE = 0x191,\n\n\tSMSG_QUESTGIVER_QUEST_FAILED = 0x192,\n\n\tCMSG_QUESTLOG_SWAP_QUEST = 0x193,\n\n\tCMSG_QUESTLOG_REMOVE_QUEST = 0x194,\n\n\tSMSG_QUESTLOG_FULL = 0x195,\n\n\tSMSG_QUESTUPDATE_FAILED = 0x196,\n\n\tSMSG_QUESTUPDATE_FAILEDTIMER = 0x197,\n\n\tSMSG_QUESTUPDATE_COMPLETE = 0x198,\n\n\tSMSG_QUESTUPDATE_ADD_KILL = 0x199,\n\n\tSMSG_QUESTUPDATE_ADD_ITEM = 0x19A,\n\n\tCMSG_QUEST_CONFIRM_ACCEPT = 0x19B,\n\n\tSMSG_QUEST_CONFIRM_ACCEPT = 0x19C,\n\n\tCMSG_PUSHQUESTTOPARTY = 0x19D,\n\n\tCMSG_LIST_INVENTORY = 0x19E,\n\n\tSMSG_LIST_INVENTORY = 0x19F,\n\n\tCMSG_SELL_ITEM = 0x1A0,\n\n\tSMSG_SELL_ITEM = 0x1A1,\n\n\tCMSG_BUY_ITEM = 0x1A2,\n\n\tCMSG_BUY_ITEM_IN_SLOT = 0x1A3,\n\n\tSMSG_BUY_ITEM = 0x1A4,\n\n\tSMSG_BUY_FAILED = 0x1A5,\n\n\tCMSG_TAXICLEARALLNODES = 0x1A6,\n\n\tCMSG_TAXIENABLEALLNODES = 0x1A7,\n\n\tCMSG_TAXISHOWNODES = 0x1A8,\n\n\tSMSG_SHOWTAXINODES = 0x1A9,\n\n\tCMSG_TAXINODE_STATUS_QUERY = 0x1AA,\n\n\tSMSG_TAXINODE_STATUS = 0x1AB,\n\n\tCMSG_TAXIQUERYAVAILABLENODES = 0x1AC,\n\n\tCMSG_ACTIVATETAXI = 0x1AD,\n\n\tSMSG_ACTIVATETAXIREPLY = 0x1AE,\n\n\tSMSG_NEW_TAXI_PATH = 0x1AF,\n\n\tCMSG_TRAINER_LIST = 0x1B0,\n\n\tSMSG_TRAINER_LIST = 0x1B1,\n\n\tCMSG_TRAINER_BUY_SPELL = 0x1B2,\n\n\tSMSG_TRAINER_BUY_SUCCEEDED = 0x1B3,\n\n\tSMSG_TRAINER_BUY_FAILED = 0x1B4,\n\n\tCMSG_BINDER_ACTIVATE = 0x1B5,\n\n\tSMSG_PLAYERBINDERROR = 0x1B6,\n\n\tCMSG_BANKER_ACTIVATE = 0x1B7,\n\n\tSMSG_SHOW_BANK = 0x1B8,\n\n\tCMSG_BUY_BANK_SLOT = 0x1B9,\n\n\tSMSG_BUY_BANK_SLOT_RESULT = 0x1BA,\n\n\tCMSG_PETITION_SHOWLIST = 0x1BB,\n\n\tSMSG_PETITION_SHOWLIST = 0x1BC,\n\n\tCMSG_PETITION_BUY = 0x1BD,\n\n\tCMSG_PETITION_SHOW_SIGNATURES = 0x1BE,\n\n\tSMSG_PETITION_SHOW_SIGNATURES = 0x1BF,\n\n\tCMSG_PETITION_SIGN = 0x1C0,\n\n\tSMSG_PETITION_SIGN_RESULTS = 0x1C1,\n\n\tMSG_PETITION_DECLINE = 0x1C2,\n\n\tCMSG_OFFER_PETITION = 0x1C3,\n\n\tCMSG_TURN_IN_PETITION = 0x1C4,\n\n\tSMSG_TURN_IN_PETITION_RESULTS = 0x1C5,\n\n\tCMSG_PETITION_QUERY = 0x1C6,\n\n\tSMSG_PETITION_QUERY_RESPONSE = 0x1C7,\n\n\tSMSG_FISH_NOT_HOOKED = 0x1C8,\n\n\tSMSG_FISH_ESCAPED = 0x1C9,\n\n\tCMSG_BUG = 0x1CA,\n\n\tSMSG_NOTIFICATION = 0x1CB,\n\n\tCMSG_PLAYED_TIME = 0x1CC,\n\n\tSMSG_PLAYED_TIME = 0x1CD,\n\n\tCMSG_QUERY_TIME = 0x1CE,\n\n\tSMSG_QUERY_TIME_RESPONSE = 0x1CF,\n\n\tSMSG_LOG_XPGAIN = 0x1D0,\n\n\tSMSG_AURACASTLOG = 0x1D1,\n\n\tCMSG_RECLAIM_CORPSE = 0x1D2,\n\n\tCMSG_WRAP_ITEM = 0x1D3,\n\n\tSMSG_LEVELUP_INFO = 0x1D4,\n\n\tMSG_MINIMAP_PING = 0x1D5,\n\n\tSMSG_RESISTLOG = 0x1D6,\n\n\tSMSG_ENCHANTMENTLOG = 0x1D7,\n\n\tCMSG_SET_SKILL_CHEAT = 0x1D8,\n\n\tSMSG_START_MIRROR_TIMER = 0x1D9,\n\n\tSMSG_PAUSE_MIRROR_TIMER = 0x1DA,\n\n\tSMSG_STOP_MIRROR_TIMER = 0x1DB,\n\n\tCMSG_PING = 0x1DC,\n\n\tSMSG_PONG = 0x1DD,\n\n\tSMSG_CLEAR_COOLDOWN = 0x1DE,\n\n\tSMSG_GAMEOBJECT_PAGETEXT = 0x1DF,\n\n\tCMSG_SETSHEATHED = 0x1E0,\n\n\tSMSG_COOLDOWN_CHEAT = 0x1E1,\n\n\tSMSG_SPELL_DELAYED = 0x1E2,\n\n\tCMSG_QUEST_POI_QUERY = 0x1E3,\n\n\tSMSG_QUEST_POI_QUERY_RESPONSE = 0x1E4,\n\n\tCMSG_GHOST = 0x1E5,\n\n\tCMSG_GM_INVIS = 0x1E6,\n\n\tSMSG_INVALID_PROMOTION_CODE = 0x1E7,\n\n\tMSG_GM_BIND_OTHER = 0x1E8,\n\n\tMSG_GM_SUMMON = 0x1E9,\n\n\tSMSG_ITEM_TIME_UPDATE = 0x1EA,\n\n\tSMSG_ITEM_ENCHANT_TIME_UPDATE = 0x1EB,\n\n\tSMSG_AUTH_CHALLENGE = 0x1EC,\n\n\tCMSG_AUTH_SESSION = 0x1ED,\n\n\tSMSG_AUTH_RESPONSE = 0x1EE,\n\n\tMSG_GM_SHOWLABEL = 0x1EF,\n\n\tCMSG_PET_CAST_SPELL = 0x1F0,\n\n\tMSG_SAVE_GUILD_EMBLEM = 0x1F1,\n\n\tMSG_TABARDVENDOR_ACTIVATE = 0x1F2,\n\n\tSMSG_PLAY_SPELL_VISUAL = 0x1F3,\n\n\tCMSG_ZONEUPDATE = 0x1F4,\n\n\tSMSG_PARTYKILLLOG = 0x1F5,\n\n\tSMSG_COMPRESSED_UPDATE_OBJECT = 0x1F6,\n\n\tSMSG_PLAY_SPELL_IMPACT = 0x1F7,\n\n\tSMSG_EXPLORATION_EXPERIENCE = 0x1F8,\n\n\tCMSG_GM_SET_SECURITY_GROUP = 0x1F9,\n\n\tCMSG_GM_NUKE = 0x1FA,\n\n\tMSG_RANDOM_ROLL = 0x1FB,\n\n\tSMSG_ENVIRONMENTALDAMAGELOG = 0x1FC,\n\n\tCMSG_CHANGEPLAYER_DIFFICULTY = 0x1FD,\n\n\tSMSG_RWHOIS = 0x1FE,\n\n\tSMSG_LFG_PLAYER_REWARD = 0x1FF, // uint32, uint8, uint32, uint32, uint32, uint32, uint32, uint8, for (uint8) {uint32, uint32, uint32}\n\n\tSMSG_LFG_TELEPORT_DENIED = 0x200, // uint32 (1, 2, 4, 6;0, 5, 7)\n\n\tCMSG_UNLEARN_SPELL = 0x201,\n\n\tCMSG_UNLEARN_SKILL = 0x202,\n\n\tSMSG_REMOVED_SPELL = 0x203,\n\n\tCMSG_DECHARGE = 0x204,\n\n\tCMSG_GMTICKET_CREATE = 0x205,\n\n\tSMSG_GMTICKET_CREATE = 0x206,\n\n\tCMSG_GMTICKET_UPDATETEXT = 0x207,\n\n\tSMSG_GMTICKET_UPDATETEXT = 0x208,\n\n\tSMSG_ACCOUNT_DATA_TIMES = 0x209,\n\n\tCMSG_REQUEST_ACCOUNT_DATA = 0x20A,\n\n\tCMSG_UPDATE_ACCOUNT_DATA = 0x20B,\n\n\tSMSG_UPDATE_ACCOUNT_DATA = 0x20C,\n\n\tSMSG_CLEAR_FAR_SIGHT_IMMEDIATE = 0x20D,\n\n\tSMSG_CHANGEPLAYER_DIFFICULTY_RESULT = 0x20E,\n\n\tCMSG_GM_TEACH = 0x20F,\n\n\tCMSG_GM_CREATE_ITEM_TARGET = 0x210,\n\n\tCMSG_GMTICKET_GETTICKET = 0x211,\n\n\tSMSG_GMTICKET_GETTICKET = 0x212,\n\n\tCMSG_UNLEARN_TALENTS = 0x213,\n\n\tSMSG_UPDATE_INSTANCE_ENCOUNTER_UNIT = 0x214,\n\n\tSMSG_GAMEOBJECT_DESPAWN_ANIM = 0x215,\n\n\tMSG_CORPSE_QUERY = 0x216,\n\n\tCMSG_GMTICKET_DELETETICKET = 0x217,\n\n\tSMSG_GMTICKET_DELETETICKET = 0x218,\n\n\tSMSG_CHAT_WRONG_FACTION = 0x219,\n\n\tCMSG_GMTICKET_SYSTEMSTATUS = 0x21A,\n\n\tSMSG_GMTICKET_SYSTEMSTATUS = 0x21B,\n\n\tCMSG_SPIRIT_HEALER_ACTIVATE = 0x21C,\n\n\tCMSG_SET_STAT_CHEAT = 0x21D,\n\n\tSMSG_QUEST_FORCE_REMOVE = 0x21E, // uint32 questid\n\n\tCMSG_SKILL_BUY_STEP = 0x21F,\n\n\tCMSG_SKILL_BUY_RANK = 0x220,\n\n\tCMSG_XP_CHEAT = 0x221,\n\n\tSMSG_SPIRIT_HEALER_CONFIRM = 0x222,\n\n\tCMSG_CHARACTER_POINT_CHEAT = 0x223,\n\n\tSMSG_GOSSIP_POI = 0x224,\n\n\tCMSG_CHAT_IGNORED = 0x225,\n\n\tCMSG_GM_VISION = 0x226,\n\n\tCMSG_SERVER_COMMAND = 0x227,\n\n\tCMSG_GM_SILENCE = 0x228,\n\n\tCMSG_GM_REVEALTO = 0x229,\n\n\tCMSG_GM_RESURRECT = 0x22A,\n\n\tCMSG_GM_SUMMONMOB = 0x22B,\n\n\tCMSG_GM_MOVECORPSE = 0x22C,\n\n\tCMSG_GM_FREEZE = 0x22D,\n\n\tCMSG_GM_UBERINVIS = 0x22E,\n\n\tCMSG_GM_REQUEST_PLAYER_INFO = 0x22F,\n\n\tSMSG_GM_PLAYER_INFO = 0x230,\n\n\tCMSG_GUILD_RANK = 0x231,\n\n\tCMSG_GUILD_ADD_RANK = 0x232,\n\n\tCMSG_GUILD_DEL_RANK = 0x233,\n\n\tCMSG_GUILD_SET_PUBLIC_NOTE = 0x234,\n\n\tCMSG_GUILD_SET_OFFICER_NOTE = 0x235,\n\n\tSMSG_LOGIN_VERIFY_WORLD = 0x236,\n\n\tCMSG_CLEAR_EXPLORATION = 0x237,\n\n\tCMSG_SEND_MAIL = 0x238,\n\n\tSMSG_SEND_MAIL_RESULT = 0x239,\n\n\tCMSG_GET_MAIL_LIST = 0x23A,\n\n\tSMSG_MAIL_LIST_RESULT = 0x23B,\n\n\tCMSG_BATTLEFIELD_LIST = 0x23C,\n\n\tSMSG_BATTLEFIELD_LIST = 0x23D,\n\n\tCMSG_BATTLEFIELD_JOIN = 0x23E,\n\n\tSMSG_FORCE_SET_VEHICLE_REC_ID = 0x23F,\n\n\tCMSG_SET_VEHICLE_REC_ID_ACK = 0x240,\n\n\tCMSG_TAXICLEARNODE = 0x241,\n\n\tCMSG_TAXIENABLENODE = 0x242,\n\n\tCMSG_ITEM_TEXT_QUERY = 0x243,\n\n\tSMSG_ITEM_TEXT_QUERY_RESPONSE = 0x244,\n\n\tCMSG_MAIL_TAKE_MONEY = 0x245,\n\n\tCMSG_MAIL_TAKE_ITEM = 0x246,\n\n\tCMSG_MAIL_MARK_AS_READ = 0x247,\n\n\tCMSG_MAIL_RETURN_TO_SENDER = 0x248,\n\n\tCMSG_MAIL_DELETE = 0x249,\n\n\tCMSG_MAIL_CREATE_TEXT_ITEM = 0x24A,\n\n\tSMSG_SPELLLOGMISS = 0x24B,\n\n\tSMSG_SPELLLOGEXECUTE = 0x24C,\n\n\tSMSG_DEBUGAURAPROC = 0x24D,\n\n\tSMSG_PERIODICAURALOG = 0x24E,\n\n\tSMSG_SPELLDAMAGESHIELD = 0x24F,\n\n\tSMSG_SPELLNONMELEEDAMAGELOG = 0x250,\n\n\tCMSG_LEARN_TALENT = 0x251,\n\n\tSMSG_RESURRECT_FAILED = 0x252,\n\n\tCMSG_TOGGLE_PVP = 0x253,\n\n\tSMSG_ZONE_UNDER_ATTACK = 0x254,\n\n\tMSG_AUCTION_HELLO = 0x255,\n\n\tCMSG_AUCTION_SELL_ITEM = 0x256,\n\n\tCMSG_AUCTION_REMOVE_ITEM = 0x257,\n\n\tCMSG_AUCTION_LIST_ITEMS = 0x258,\n\n\tCMSG_AUCTION_LIST_OWNER_ITEMS = 0x259,\n\n\tCMSG_AUCTION_PLACE_BID = 0x25A,\n\n\tSMSG_AUCTION_COMMAND_RESULT = 0x25B,\n\n\tSMSG_AUCTION_LIST_RESULT = 0x25C,\n\n\tSMSG_AUCTION_OWNER_LIST_RESULT = 0x25D,\n\n\tSMSG_AUCTION_BIDDER_NOTIFICATION = 0x25E,\n\n\tSMSG_AUCTION_OWNER_NOTIFICATION = 0x25F,\n\n\tSMSG_PROCRESIST = 0x260,\n\n\tSMSG_COMBAT_EVENT_FAILED = 0x261,\n\n\tSMSG_DISPEL_FAILED = 0x262,\n\n\tSMSG_SPELLORDAMAGE_IMMUNE = 0x263,\n\n\tCMSG_AUCTION_LIST_BIDDER_ITEMS = 0x264,\n\n\tSMSG_AUCTION_BIDDER_LIST_RESULT = 0x265,\n\n\tSMSG_SET_FLAT_SPELL_MODIFIER = 0x266,\n\n\tSMSG_SET_PCT_SPELL_MODIFIER = 0x267,\n\n\tCMSG_SET_AMMO = 0x268,\n\n\tSMSG_CORPSE_RECLAIM_DELAY = 0x269,\n\n\tCMSG_SET_ACTIVE_MOVER = 0x26A,\n\n\tCMSG_PET_CANCEL_AURA = 0x26B,\n\n\tCMSG_PLAYER_AI_CHEAT = 0x26C,\n\n\tCMSG_CANCEL_AUTO_REPEAT_SPELL = 0x26D,\n\n\tMSG_GM_ACCOUNT_ONLINE = 0x26E,\n\n\tMSG_LIST_STABLED_PETS = 0x26F,\n\n\tCMSG_STABLE_PET = 0x270,\n\n\tCMSG_UNSTABLE_PET = 0x271,\n\n\tCMSG_BUY_STABLE_SLOT = 0x272,\n\n\tSMSG_STABLE_RESULT = 0x273,\n\n\tCMSG_STABLE_REVIVE_PET = 0x274,\n\n\tCMSG_STABLE_SWAP_PET = 0x275,\n\n\tMSG_QUEST_PUSH_RESULT = 0x276,\n\n\tSMSG_PLAY_MUSIC = 0x277,\n\n\tSMSG_PLAY_OBJECT_SOUND = 0x278,\n\n\tCMSG_REQUEST_PET_INFO = 0x279,\n\n\tCMSG_FAR_SIGHT = 0x27A,\n\n\tSMSG_SPELLDISPELLOG = 0x27B,\n\n\tSMSG_DAMAGE_CALC_LOG = 0x27C,\n\n\tCMSG_ENABLE_DAMAGE_LOG = 0x27D,\n\n\tCMSG_GROUP_CHANGE_SUB_GROUP = 0x27E,\n\n\tCMSG_REQUEST_PARTY_MEMBER_STATS = 0x27F,\n\n\tCMSG_GROUP_SWAP_SUB_GROUP = 0x280,\n\n\tCMSG_RESET_FACTION_CHEAT = 0x281,\n\n\tCMSG_AUTOSTORE_BANK_ITEM = 0x282,\n\n\tCMSG_AUTOBANK_ITEM = 0x283,\n\n\tMSG_QUERY_NEXT_MAIL_TIME = 0x284,\n\n\tSMSG_RECEIVED_MAIL = 0x285,\n\n\tSMSG_RAID_GROUP_ONLY = 0x286,\n\n\tCMSG_SET_DURABILITY_CHEAT = 0x287,\n\n\tCMSG_SET_PVP_RANK_CHEAT = 0x288,\n\n\tCMSG_ADD_PVP_MEDAL_CHEAT = 0x289,\n\n\tCMSG_DEL_PVP_MEDAL_CHEAT = 0x28A,\n\n\tCMSG_SET_PVP_TITLE = 0x28B,\n\n\tSMSG_PVP_CREDIT = 0x28C,\n\n\tSMSG_AUCTION_REMOVED_NOTIFICATION = 0x28D,\n\n\tCMSG_GROUP_RAID_CONVERT = 0x28E,\n\n\tCMSG_GROUP_ASSISTANT_LEADER = 0x28F,\n\n\tCMSG_BUYBACK_ITEM = 0x290,\n\n\tSMSG_SERVER_MESSAGE = 0x291,\n\n\tCMSG_SET_SAVED_INSTANCE_EXTEND = 0x292,\n\n\tSMSG_LFG_OFFER_CONTINUE = 0x293,\n\n\tCMSG_TEST_DROP_RATE = 0x294,\n\n\tSMSG_TEST_DROP_RATE_RESULT = 0x295,\n\n\tCMSG_LFG_GET_STATUS = 0x296,\n\n\tSMSG_SHOW_MAILBOX = 0x297,\n\n\tSMSG_RESET_RANGED_COMBAT_TIMER = 0x298,\n\n\tSMSG_CHAT_NOT_IN_PARTY = 0x299, // uint32, errors: ERR_NOT_IN_GROUP (2, 51) and ERR_NOT_IN_RAID (3, 39, 40)\n\n\tCMSG_GMTICKETSYSTEM_TOGGLE = 0x29A,\n\n\tCMSG_CANCEL_GROWTH_AURA = 0x29B,\n\n\tSMSG_CANCEL_AUTO_REPEAT = 0x29C,\n\n\tSMSG_STANDSTATE_UPDATE = 0x29D,\n\n\tSMSG_LOOT_ALL_PASSED = 0x29E,\n\n\tSMSG_LOOT_ROLL_WON = 0x29F,\n\n\tCMSG_LOOT_ROLL = 0x2A0,\n\n\tSMSG_LOOT_START_ROLL = 0x2A1,\n\n\tSMSG_LOOT_ROLL = 0x2A2,\n\n\tCMSG_LOOT_MASTER_GIVE = 0x2A3,\n\n\tSMSG_LOOT_MASTER_LIST = 0x2A4,\n\n\tSMSG_SET_FORCED_REACTIONS = 0x2A5,\n\n\tSMSG_SPELL_FAILED_OTHER = 0x2A6,\n\n\tSMSG_GAMEOBJECT_RESET_STATE = 0x2A7,\n\n\tCMSG_REPAIR_ITEM = 0x2A8,\n\n\tSMSG_CHAT_PLAYER_NOT_FOUND = 0x2A9,\n\n\tMSG_TALENT_WIPE_CONFIRM = 0x2AA,\n\n\tSMSG_SUMMON_REQUEST = 0x2AB,\n\n\tCMSG_SUMMON_RESPONSE = 0x2AC,\n\n\tMSG_DEV_SHOWLABEL = 0x2AD,\n\n\tSMSG_MONSTER_MOVE_TRANSPORT = 0x2AE,\n\n\tSMSG_PET_BROKEN = 0x2AF,\n\n\tMSG_MOVE_FEATHER_FALL = 0x2B0,\n\n\tMSG_MOVE_WATER_WALK = 0x2B1,\n\n\tCMSG_SERVER_BROADCAST = 0x2B2,\n\n\tCMSG_SELF_RES = 0x2B3,\n\n\tSMSG_FEIGN_DEATH_RESISTED = 0x2B4,\n\n\tCMSG_RUN_SCRIPT = 0x2B5,\n\n\tSMSG_SCRIPT_MESSAGE = 0x2B6,\n\n\tSMSG_DUEL_COUNTDOWN = 0x2B7,\n\n\tSMSG_AREA_TRIGGER_MESSAGE = 0x2B8,\n\n\tCMSG_SHOWING_HELM = 0x2B9,\n\n\tCMSG_SHOWING_CLOAK = 0x2BA,\n\n\tSMSG_LFG_ROLE_CHOSEN = 0x2BB,\n\n\tSMSG_PLAYER_SKINNED = 0x2BC,\n\n\tSMSG_DURABILITY_DAMAGE_DEATH = 0x2BD,\n\n\tCMSG_SET_EXPLORATION = 0x2BE,\n\n\tCMSG_SET_ACTIONBAR_TOGGLES = 0x2BF,\n\n\tUMSG_DELETE_GUILD_CHARTER = 0x2C0,\n\n\tMSG_PETITION_RENAME = 0x2C1,\n\n\tSMSG_INIT_WORLD_STATES = 0x2C2,\n\n\tSMSG_UPDATE_WORLD_STATE = 0x2C3,\n\n\tCMSG_ITEM_NAME_QUERY = 0x2C4,\n\n\tSMSG_ITEM_NAME_QUERY_RESPONSE = 0x2C5,\n\n\tSMSG_PET_ACTION_FEEDBACK = 0x2C6,\n\n\tCMSG_CHAR_RENAME = 0x2C7,\n\n\tSMSG_CHAR_RENAME = 0x2C8,\n\n\tCMSG_MOVE_SPLINE_DONE = 0x2C9,\n\n\tCMSG_MOVE_FALL_RESET = 0x2CA,\n\n\tSMSG_INSTANCE_SAVE_CREATED = 0x2CB,\n\n\tSMSG_RAID_INSTANCE_INFO = 0x2CC,\n\n\tCMSG_REQUEST_RAID_INFO = 0x2CD,\n\n\tCMSG_MOVE_TIME_SKIPPED = 0x2CE,\n\n\tCMSG_MOVE_FEATHER_FALL_ACK = 0x2CF,\n\n\tCMSG_MOVE_WATER_WALK_ACK = 0x2D0,\n\n\tCMSG_MOVE_NOT_ACTIVE_MOVER = 0x2D1,\n\n\tSMSG_PLAY_SOUND = 0x2D2,\n\n\tCMSG_BATTLEFIELD_STATUS = 0x2D3,\n\n\tSMSG_BATTLEFIELD_STATUS = 0x2D4,\n\n\tCMSG_BATTLEFIELD_PORT = 0x2D5,\n\n\tMSG_INSPECT_HONOR_STATS = 0x2D6,\n\n\tCMSG_BATTLEMASTER_HELLO = 0x2D7,\n\n\tCMSG_MOVE_START_SWIM_CHEAT = 0x2D8,\n\n\tCMSG_MOVE_STOP_SWIM_CHEAT = 0x2D9,\n\n\tSMSG_FORCE_WALK_SPEED_CHANGE = 0x2DA,\n\n\tCMSG_FORCE_WALK_SPEED_CHANGE_ACK = 0x2DB,\n\n\tSMSG_FORCE_SWIM_BACK_SPEED_CHANGE = 0x2DC,\n\n\tCMSG_FORCE_SWIM_BACK_SPEED_CHANGE_ACK = 0x2DD,\n\n\tSMSG_FORCE_TURN_RATE_CHANGE = 0x2DE,\n\n\tCMSG_FORCE_TURN_RATE_CHANGE_ACK = 0x2DF,\n\n\tMSG_PVP_LOG_DATA = 0x2E0,\n\n\tCMSG_LEAVE_BATTLEFIELD = 0x2E1,\n\n\tCMSG_AREA_SPIRIT_HEALER_QUERY = 0x2E2,\n\n\tCMSG_AREA_SPIRIT_HEALER_QUEUE = 0x2E3,\n\n\tSMSG_AREA_SPIRIT_HEALER_TIME = 0x2E4,\n\n\tCMSG_GM_UNTEACH = 0x2E5,\n\n\tSMSG_WARDEN_DATA = 0x2E6,\n\n\tCMSG_WARDEN_DATA = 0x2E7,\n\n\tSMSG_GROUP_JOINED_BATTLEGROUND = 0x2E8,\n\n\tMSG_BATTLEGROUND_PLAYER_POSITIONS = 0x2E9,\n\n\tCMSG_PET_STOP_ATTACK = 0x2EA,\n\n\tSMSG_BINDER_CONFIRM = 0x2EB,\n\n\tSMSG_BATTLEGROUND_PLAYER_JOINED = 0x2EC,\n\n\tSMSG_BATTLEGROUND_PLAYER_LEFT = 0x2ED,\n\n\tCMSG_BATTLEMASTER_JOIN = 0x2EE,\n\n\tSMSG_ADDON_INFO = 0x2EF,\n\n\tCMSG_PET_UNLEARN = 0x2F0, // Deprecated 3.x\n\n\tSMSG_PET_UNLEARN_CONFIRM = 0x2F1, // Deprecated 3.x\n\n\tSMSG_PARTY_MEMBER_STATS_FULL = 0x2F2,\n\n\tCMSG_PET_SPELL_AUTOCAST = 0x2F3,\n\n\tSMSG_WEATHER = 0x2F4,\n\n\tSMSG_PLAY_TIME_WARNING = 0x2F5,\n\n\tSMSG_MINIGAME_SETUP = 0x2F6,\n\n\tSMSG_MINIGAME_STATE = 0x2F7,\n\n\tCMSG_MINIGAME_MOVE = 0x2F8,\n\n\tSMSG_MINIGAME_MOVE_FAILED = 0x2F9,\n\n\tSMSG_RAID_INSTANCE_MESSAGE = 0x2FA,\n\n\tSMSG_COMPRESSED_MOVES = 0x2FB,\n\n\tCMSG_GUILD_INFO_TEXT = 0x2FC,\n\n\tSMSG_CHAT_RESTRICTED = 0x2FD,\n\n\tSMSG_SPLINE_SET_RUN_SPEED = 0x2FE,\n\n\tSMSG_SPLINE_SET_RUN_BACK_SPEED = 0x2FF,\n\n\tSMSG_SPLINE_SET_SWIM_SPEED = 0x300,\n\n\tSMSG_SPLINE_SET_WALK_SPEED = 0x301,\n\n\tSMSG_SPLINE_SET_SWIM_BACK_SPEED = 0x302,\n\n\tSMSG_SPLINE_SET_TURN_RATE = 0x303,\n\n\tSMSG_SPLINE_MOVE_UNROOT = 0x304,\n\n\tSMSG_SPLINE_MOVE_FEATHER_FALL = 0x305,\n\n\tSMSG_SPLINE_MOVE_NORMAL_FALL = 0x306,\n\n\tSMSG_SPLINE_MOVE_SET_HOVER = 0x307,\n\n\tSMSG_SPLINE_MOVE_UNSET_HOVER = 0x308,\n\n\tSMSG_SPLINE_MOVE_WATER_WALK = 0x309,\n\n\tSMSG_SPLINE_MOVE_LAND_WALK = 0x30A,\n\n\tSMSG_SPLINE_MOVE_START_SWIM = 0x30B,\n\n\tSMSG_SPLINE_MOVE_STOP_SWIM = 0x30C,\n\n\tSMSG_SPLINE_MOVE_SET_RUN_MODE = 0x30D,\n\n\tSMSG_SPLINE_MOVE_SET_WALK_MODE = 0x30E,\n\n\tCMSG_GM_NUKE_ACCOUNT = 0x30F,\n\n\tMSG_GM_DESTROY_CORPSE = 0x310,\n\n\tCMSG_GM_DESTROY_ONLINE_CORPSE = 0x311,\n\n\tCMSG_ACTIVATETAXIEXPRESS = 0x312,\n\n\tSMSG_SET_FACTION_ATWAR = 0x313,\n\n\tSMSG_GAMETIMEBIAS_SET = 0x314,\n\n\tCMSG_DEBUG_ACTIONS_START = 0x315,\n\n\tCMSG_DEBUG_ACTIONS_STOP = 0x316,\n\n\tCMSG_SET_FACTION_INACTIVE = 0x317,\n\n\tCMSG_SET_WATCHED_FACTION = 0x318,\n\n\tMSG_MOVE_TIME_SKIPPED = 0x319,\n\n\tSMSG_SPLINE_MOVE_ROOT = 0x31A,\n\n\tCMSG_SET_EXPLORATION_ALL = 0x31B,\n\n\tSMSG_INVALIDATE_PLAYER = 0x31C,\n\n\tCMSG_RESET_INSTANCES = 0x31D,\n\n\tSMSG_INSTANCE_RESET = 0x31E,\n\n\tSMSG_INSTANCE_RESET_FAILED = 0x31F,\n\n\tSMSG_UPDATE_LAST_INSTANCE = 0x320,\n\n\tMSG_RAID_TARGET_UPDATE = 0x321,\n\n\tMSG_RAID_READY_CHECK = 0x322,\n\n\tCMSG_LUA_USAGE = 0x323,\n\n\tSMSG_PET_ACTION_SOUND = 0x324,\n\n\tSMSG_PET_DISMISS_SOUND = 0x325,\n\n\tSMSG_GHOSTEE_GONE = 0x326,\n\n\tCMSG_GM_UPDATE_TICKET_STATUS = 0x327,\n\n\tSMSG_GM_TICKET_STATUS_UPDATE = 0x328,\n\n\tMSG_SET_DUNGEON_DIFFICULTY = 0x329,\n\n\tCMSG_GMSURVEY_SUBMIT = 0x32A,\n\n\tSMSG_UPDATE_INSTANCE_OWNERSHIP = 0x32B,\n\n\tCMSG_IGNORE_KNOCKBACK_CHEAT = 0x32C,\n\n\tSMSG_CHAT_PLAYER_AMBIGUOUS = 0x32D,\n\n\tMSG_DELAY_GHOST_TELEPORT = 0x32E,\n\n\tSMSG_SPELLINSTAKILLLOG = 0x32F,\n\n\tSMSG_SPELL_UPDATE_CHAIN_TARGETS = 0x330,\n\n\tCMSG_CHAT_FILTERED = 0x331,\n\n\tSMSG_EXPECTED_SPAM_RECORDS = 0x332,\n\n\tSMSG_SPELLSTEALLOG = 0x333,\n\n\tCMSG_LOTTERY_QUERY_OBSOLETE = 0x334,\n\n\tSMSG_LOTTERY_QUERY_RESULT_OBSOLETE = 0x335,\n\n\tCMSG_BUY_LOTTERY_TICKET_OBSOLETE = 0x336,\n\n\tSMSG_LOTTERY_RESULT_OBSOLETE = 0x337,\n\n\tSMSG_CHARACTER_PROFILE = 0x338,\n\n\tSMSG_CHARACTER_PROFILE_REALM_CONNECTED = 0x339,\n\n\tSMSG_DEFENSE_MESSAGE = 0x33A,\n\n\tSMSG_INSTANCE_DIFFICULTY = 0x33B,\n\n\tMSG_GM_RESETINSTANCELIMIT = 0x33C,\n\n\tSMSG_MOTD = 0x33D,\n\n\tSMSG_MOVE_SET_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY = 0x33E,\n\n\tSMSG_MOVE_UNSET_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY = 0x33F,\n\n\tCMSG_MOVE_SET_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY_ACK = 0x340,\n\n\tMSG_MOVE_START_SWIM_CHEAT = 0x341,\n\n\tMSG_MOVE_STOP_SWIM_CHEAT = 0x342,\n\n\tSMSG_MOVE_SET_CAN_FLY = 0x343,\n\n\tSMSG_MOVE_UNSET_CAN_FLY = 0x344,\n\n\tCMSG_MOVE_SET_CAN_FLY_ACK = 0x345,\n\n\tCMSG_MOVE_SET_FLY = 0x346,\n\n\tCMSG_SOCKET_GEMS = 0x347,\n\n\tCMSG_ARENA_TEAM_CREATE = 0x348,\n\n\tSMSG_ARENA_TEAM_COMMAND_RESULT = 0x349,\n\n\tMSG_MOVE_UPDATE_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY = 0x34A,\n\n\tCMSG_ARENA_TEAM_QUERY = 0x34B,\n\n\tSMSG_ARENA_TEAM_QUERY_RESPONSE = 0x34C,\n\n\tCMSG_ARENA_TEAM_ROSTER = 0x34D,\n\n\tSMSG_ARENA_TEAM_ROSTER = 0x34E,\n\n\tCMSG_ARENA_TEAM_INVITE = 0x34F,\n\n\tSMSG_ARENA_TEAM_INVITE = 0x350,\n\n\tCMSG_ARENA_TEAM_ACCEPT = 0x351,\n\n\tCMSG_ARENA_TEAM_DECLINE = 0x352,\n\n\tCMSG_ARENA_TEAM_LEAVE = 0x353,\n\n\tCMSG_ARENA_TEAM_REMOVE = 0x354,\n\n\tCMSG_ARENA_TEAM_DISBAND = 0x355,\n\n\tCMSG_ARENA_TEAM_LEADER = 0x356,\n\n\tSMSG_ARENA_TEAM_EVENT = 0x357,\n\n\tCMSG_BATTLEMASTER_JOIN_ARENA = 0x358,\n\n\tMSG_MOVE_START_ASCEND = 0x359,\n\n\tMSG_MOVE_STOP_ASCEND = 0x35A,\n\n\tSMSG_ARENA_TEAM_STATS = 0x35B,\n\n\tCMSG_LFG_JOIN = 0x35C,\n\n\tCMSG_LFG_LEAVE = 0x35D,\n\n\tCMSG_SEARCH_LFG_JOIN = 0x35E,\n\n\tCMSG_SEARCH_LFG_LEAVE = 0x35F,\n\n\tSMSG_UPDATE_LFG_LIST = 0x360, // uint32, uint32, if (uint8) { uint32 count, for (count) { uint64} }, uint32 count2, uint32, for (count2) { uint64, uint32 flags, if (flags & 0x2) {string}, if (flags & 0x10) {for (3) uint8}, if (flags & 0x80) {uint64, uint32}}, uint32 count3, uint32, for (count3) {uint64, uint32 flags, if (flags & 0x1) {uint8, uint8, uint8, for (3) uint8, uint32, uint32, uint32, uint32, uint32, uint32, float, float, uint32, uint32, uint32, uint32, uint32, float, uint32, uint32, uint32, uint32, uint32, uint32}, if (flags&0x2) string, if (flags&0x4) uint8, if (flags&0x8) uint64, if (flags&0x10) uint8, if (flags&0x20) uint32, if (flags&0x40) uint8, if (flags& 0x80) {uint64, uint32}}\n\n\tSMSG_LFG_PROPOSAL_UPDATE = 0x361, // uint32, uint8, uint32, uint32, uint8, for (uint8) {uint32, uint8, uint8, uint8, uint8}\n\n\tCMSG_LFG_PROPOSAL_RESULT = 0x362,\n\n\tSMSG_LFG_ROLE_CHECK_UPDATE = 0x363, // uint32, uint8, for (uint8) uint32, uint8, for (uint8) { uint64, uint8, uint32, uint8, }\n\n\tSMSG_LFG_JOIN_RESULT = 0x364, // uint32 unk, uint32, if (unk == 6) { uint8 count, for (count) uint64 }\n\n\tSMSG_LFG_QUEUE_STATUS = 0x365, // uint32 dungeon, uint32 lfgtype, uint32, uint32, uint32, uint32, uint8, uint8, uint8, uint8\n\n\tCMSG_SET_LFG_COMMENT = 0x366,\n\n\tSMSG_LFG_UPDATE_PLAYER = 0x367, // uint8, if (uint8) { uint8, uint8, uint8, uint8, if (uint8) for (uint8) uint32, string}\n\n\tSMSG_LFG_UPDATE_PARTY = 0x368, // uint8, if (uint8) { uint8, uint8, uint8, for (3) uint8, uint8, if (uint8) for (uint8) uint32, string}\n\n\tSMSG_LFG_UPDATE_SEARCH = 0x369, // uint8\n\n\tCMSG_LFG_SET_ROLES = 0x36A,\n\n\tCMSG_LFG_SET_NEEDS = 0x36B,\n\n\tCMSG_LFG_SET_BOOT_VOTE = 0x36C,\n\n\tSMSG_LFG_BOOT_PROPOSAL_UPDATE = 0x36D, // uint8, uint8, uint8, uint64, uint32, uint32, uint32, uint32\n\n\tCMSG_LFD_PLAYER_LOCK_INFO_REQUEST = 0x36E,\n\n\tSMSG_LFG_PLAYER_INFO = 0x36F, // uint8, for (uint8) { uint32, uint8, uint32, uint32, uint32, uint32, uint8, for (uint8) {uint32, uint32, uint32}}, uint32, for (uint32) {uint32, uint32}\n\n\tCMSG_LFG_TELEPORT = 0x370,\n\n\tCMSG_LFD_PARTY_LOCK_INFO_REQUEST = 0x371,\n\n\tSMSG_LFG_PARTY_INFO = 0x372, // uint8, for (uint8) uint64\n\n\tSMSG_TITLE_EARNED = 0x373,\n\n\tCMSG_SET_TITLE = 0x374,\n\n\tCMSG_CANCEL_MOUNT_AURA = 0x375,\n\n\tSMSG_ARENA_ERROR = 0x376,\n\n\tMSG_INSPECT_ARENA_TEAMS = 0x377,\n\n\tSMSG_DEATH_RELEASE_LOC = 0x378,\n\n\tCMSG_CANCEL_TEMP_ENCHANTMENT = 0x379,\n\n\tSMSG_FORCED_DEATH_UPDATE = 0x37A,\n\n\tCMSG_CHEAT_SET_HONOR_CURRENCY = 0x37B,\n\n\tCMSG_CHEAT_SET_ARENA_CURRENCY = 0x37C,\n\n\tMSG_MOVE_SET_FLIGHT_SPEED_CHEAT = 0x37D,\n\n\tMSG_MOVE_SET_FLIGHT_SPEED = 0x37E,\n\n\tMSG_MOVE_SET_FLIGHT_BACK_SPEED_CHEAT = 0x37F,\n\n\tMSG_MOVE_SET_FLIGHT_BACK_SPEED = 0x380,\n\n\tSMSG_FORCE_FLIGHT_SPEED_CHANGE = 0x381,\n\n\tCMSG_FORCE_FLIGHT_SPEED_CHANGE_ACK = 0x382,\n\n\tSMSG_FORCE_FLIGHT_BACK_SPEED_CHANGE = 0x383,\n\n\tCMSG_FORCE_FLIGHT_BACK_SPEED_CHANGE_ACK = 0x384,\n\n\tSMSG_SPLINE_SET_FLIGHT_SPEED = 0x385,\n\n\tSMSG_SPLINE_SET_FLIGHT_BACK_SPEED = 0x386,\n\n\tCMSG_MAELSTROM_INVALIDATE_CACHE = 0x387,\n\n\tSMSG_FLIGHT_SPLINE_SYNC = 0x388,\n\n\tCMSG_SET_TAXI_BENCHMARK_MODE = 0x389,\n\n\tSMSG_JOINED_BATTLEGROUND_QUEUE = 0x38A,\n\n\tSMSG_REALM_SPLIT = 0x38B,\n\n\tCMSG_REALM_SPLIT = 0x38C,\n\n\tCMSG_MOVE_CHNG_TRANSPORT = 0x38D,\n\n\tMSG_PARTY_ASSIGNMENT = 0x38E,\n\n\tSMSG_OFFER_PETITION_ERROR = 0x38F,\n\n\tSMSG_TIME_SYNC_REQ = 0x390,\n\n\tCMSG_TIME_SYNC_RESP = 0x391,\n\n\tCMSG_SEND_LOCAL_EVENT = 0x392,\n\n\tCMSG_SEND_GENERAL_TRIGGER = 0x393,\n\n\tCMSG_SEND_COMBAT_TRIGGER = 0x394,\n\n\tCMSG_MAELSTROM_GM_SENT_MAIL = 0x395,\n\n\tSMSG_RESET_FAILED_NOTIFY = 0x396,\n\n\tSMSG_REAL_GROUP_UPDATE = 0x397,\n\n\tSMSG_LFG_DISABLED = 0x398,\n\n\tCMSG_ACTIVE_PVP_CHEAT = 0x399,\n\n\tCMSG_CHEAT_DUMP_ITEMS_DEBUG_ONLY = 0x39A,\n\n\tSMSG_CHEAT_DUMP_ITEMS_DEBUG_ONLY_RESPONSE = 0x39B,\n\n\tSMSG_CHEAT_DUMP_ITEMS_DEBUG_ONLY_RESPONSE_WRITE_FILE = 0x39C,\n\n\tSMSG_UPDATE_COMBO_POINTS = 0x39D,\n\n\tSMSG_VOICE_SESSION_ROSTER_UPDATE = 0x39E,\n\n\tSMSG_VOICE_SESSION_LEAVE = 0x39F,\n\n\tSMSG_VOICE_SESSION_ADJUST_PRIORITY = 0x3A0,\n\n\tCMSG_VOICE_SET_TALKER_MUTED_REQUEST = 0x3A1,\n\n\tSMSG_VOICE_SET_TALKER_MUTED = 0x3A2,\n\n\tSMSG_INIT_EXTRA_AURA_INFO_OBSOLETE = 0x3A3,\n\n\tSMSG_SET_EXTRA_AURA_INFO_OBSOLETE = 0x3A4,\n\n\tSMSG_SET_EXTRA_AURA_INFO_NEED_UPDATE_OBSOLETE = 0x3A5,\n\n\tSMSG_CLEAR_EXTRA_AURA_INFO_OBSOLETE = 0x3A6,\n\n\tMSG_MOVE_START_DESCEND = 0x3A7,\n\n\tCMSG_IGNORE_REQUIREMENTS_CHEAT = 0x3A8,\n\n\tSMSG_IGNORE_REQUIREMENTS_CHEAT = 0x3A9,\n\n\tSMSG_SPELL_CHANCE_PROC_LOG = 0x3AA,\n\n\tCMSG_MOVE_SET_RUN_SPEED = 0x3AB,\n\n\tSMSG_DISMOUNT = 0x3AC,\n\n\tMSG_MOVE_UPDATE_CAN_FLY = 0x3AD,\n\n\tMSG_RAID_READY_CHECK_CONFIRM = 0x3AE,\n\n\tCMSG_VOICE_SESSION_ENABLE = 0x3AF,\n\n\tSMSG_VOICE_SESSION_ENABLE = 0x3B0,\n\n\tSMSG_VOICE_PARENTAL_CONTROLS = 0x3B1,\n\n\tCMSG_GM_WHISPER = 0x3B2,\n\n\tSMSG_GM_MESSAGECHAT = 0x3B3,\n\n\tMSG_GM_GEARRATING = 0x3B4,\n\n\tCMSG_COMMENTATOR_ENABLE = 0x3B5,\n\n\tSMSG_COMMENTATOR_STATE_CHANGED = 0x3B6,\n\n\tCMSG_COMMENTATOR_GET_MAP_INFO = 0x3B7,\n\n\tSMSG_COMMENTATOR_MAP_INFO = 0x3B8,\n\n\tCMSG_COMMENTATOR_GET_PLAYER_INFO = 0x3B9,\n\n\tSMSG_COMMENTATOR_GET_PLAYER_INFO = 0x3BA,\n\n\tSMSG_COMMENTATOR_PLAYER_INFO = 0x3BB,\n\n\tCMSG_COMMENTATOR_ENTER_INSTANCE = 0x3BC,\n\n\tCMSG_COMMENTATOR_EXIT_INSTANCE = 0x3BD,\n\n\tCMSG_COMMENTATOR_INSTANCE_COMMAND = 0x3BE,\n\n\tSMSG_CLEAR_TARGET = 0x3BF,\n\n\tCMSG_BOT_DETECTED = 0x3C0,\n\n\tSMSG_CROSSED_INEBRIATION_THRESHOLD = 0x3C1,\n\n\tCMSG_CHEAT_PLAYER_LOGIN = 0x3C2,\n\n\tCMSG_CHEAT_PLAYER_LOOKUP = 0x3C3,\n\n\tSMSG_CHEAT_PLAYER_LOOKUP = 0x3C4,\n\n\tSMSG_KICK_REASON = 0x3C5,\n\n\tMSG_RAID_READY_CHECK_FINISHED = 0x3C6,\n\n\tCMSG_COMPLAIN = 0x3C7,\n\n\tSMSG_COMPLAIN_RESULT = 0x3C8,\n\n\tSMSG_FEATURE_SYSTEM_STATUS = 0x3C9,\n\n\tCMSG_GM_SHOW_COMPLAINTS = 0x3CA,\n\n\tCMSG_GM_UNSQUELCH = 0x3CB,\n\n\tCMSG_CHANNEL_SILENCE_VOICE = 0x3CC,\n\n\tCMSG_CHANNEL_SILENCE_ALL = 0x3CD,\n\n\tCMSG_CHANNEL_UNSILENCE_VOICE = 0x3CE,\n\n\tCMSG_CHANNEL_UNSILENCE_ALL = 0x3CF,\n\n\tCMSG_TARGET_CAST = 0x3D0,\n\n\tCMSG_TARGET_SCRIPT_CAST = 0x3D1,\n\n\tCMSG_CHANNEL_DISPLAY_LIST = 0x3D2,\n\n\tCMSG_SET_ACTIVE_VOICE_CHANNEL = 0x3D3,\n\n\tCMSG_GET_CHANNEL_MEMBER_COUNT = 0x3D4,\n\n\tSMSG_CHANNEL_MEMBER_COUNT = 0x3D5,\n\n\tCMSG_CHANNEL_VOICE_ON = 0x3D6,\n\n\tCMSG_CHANNEL_VOICE_OFF = 0x3D7,\n\n\tCMSG_DEBUG_LIST_TARGETS = 0x3D8,\n\n\tSMSG_DEBUG_LIST_TARGETS = 0x3D9,\n\n\tSMSG_AVAILABLE_VOICE_CHANNEL = 0x3DA,\n\n\tCMSG_ADD_VOICE_IGNORE = 0x3DB,\n\n\tCMSG_DEL_VOICE_IGNORE = 0x3DC,\n\n\tCMSG_PARTY_SILENCE = 0x3DD,\n\n\tCMSG_PARTY_UNSILENCE = 0x3DE,\n\n\tMSG_NOTIFY_PARTY_SQUELCH = 0x3DF,\n\n\tSMSG_COMSAT_RECONNECT_TRY = 0x3E0,\n\n\tSMSG_COMSAT_DISCONNECT = 0x3E1,\n\n\tSMSG_COMSAT_CONNECT_FAIL = 0x3E2,\n\n\tSMSG_VOICE_CHAT_STATUS = 0x3E3,\n\n\tCMSG_REPORT_PVP_AFK = 0x3E4,\n\n\tSMSG_REPORT_PVP_AFK_RESULT = 0x3E5,\n\n\tCMSG_GUILD_BANKER_ACTIVATE = 0x3E6,\n\n\tCMSG_GUILD_BANK_QUERY_TAB = 0x3E7,\n\n\tSMSG_GUILD_BANK_LIST = 0x3E8,\n\n\tCMSG_GUILD_BANK_SWAP_ITEMS = 0x3E9,\n\n\tCMSG_GUILD_BANK_BUY_TAB = 0x3EA,\n\n\tCMSG_GUILD_BANK_UPDATE_TAB = 0x3EB,\n\n\tCMSG_GUILD_BANK_DEPOSIT_MONEY = 0x3EC,\n\n\tCMSG_GUILD_BANK_WITHDRAW_MONEY = 0x3ED,\n\n\tMSG_GUILD_BANK_LOG_QUERY = 0x3EE,\n\n\tCMSG_SET_CHANNEL_WATCH = 0x3EF,\n\n\tSMSG_USERLIST_ADD = 0x3F0,\n\n\tSMSG_USERLIST_REMOVE = 0x3F1,\n\n\tSMSG_USERLIST_UPDATE = 0x3F2,\n\n\tCMSG_CLEAR_CHANNEL_WATCH = 0x3F3,\n\n\tSMSG_INSPECT_TALENT = 0x3F4,\n\n\tSMSG_GOGOGO_OBSOLETE = 0x3F5,\n\n\tSMSG_ECHO_PARTY_SQUELCH = 0x3F6,\n\n\tCMSG_SET_TITLE_SUFFIX = 0x3F7,\n\n\tCMSG_SPELLCLICK = 0x3F8,\n\n\tSMSG_LOOT_LIST = 0x3F9,\n\n\tCMSG_GM_CHARACTER_RESTORE = 0x3FA,\n\n\tCMSG_GM_CHARACTER_SAVE = 0x3FB,\n\n\tSMSG_VOICESESSION_FULL = 0x3FC,\n\n\tMSG_GUILD_PERMISSIONS = 0x3FD,\n\n\tMSG_GUILD_BANK_MONEY_WITHDRAWN = 0x3FE,\n\n\tMSG_GUILD_EVENT_LOG_QUERY = 0x3FF,\n\n\tCMSG_MAELSTROM_RENAME_GUILD = 0x400,\n\n\tCMSG_GET_MIRRORIMAGE_DATA = 0x401,\n\n\tSMSG_MIRRORIMAGE_DATA = 0x402,\n\n\tSMSG_FORCE_DISPLAY_UPDATE = 0x403,\n\n\tSMSG_SPELL_CHANCE_RESIST_PUSHBACK = 0x404,\n\n\tCMSG_IGNORE_DIMINISHING_RETURNS_CHEAT = 0x405,\n\n\tSMSG_IGNORE_DIMINISHING_RETURNS_CHEAT = 0x406,\n\n\tCMSG_KEEP_ALIVE = 0x407,\n\n\tSMSG_RAID_READY_CHECK_ERROR = 0x408,\n\n\tCMSG_OPT_OUT_OF_LOOT = 0x409,\n\n\tMSG_QUERY_GUILD_BANK_TEXT = 0x40A,\n\n\tCMSG_SET_GUILD_BANK_TEXT = 0x40B,\n\n\tCMSG_SET_GRANTABLE_LEVELS = 0x40C,\n\n\tCMSG_GRANT_LEVEL = 0x40D,\n\n\tCMSG_REFER_A_FRIEND = 0x40E,\n\n\tMSG_GM_CHANGE_ARENA_RATING = 0x40F,\n\n\tCMSG_DECLINE_CHANNEL_INVITE = 0x410,\n\n\tSMSG_GROUPACTION_THROTTLED = 0x411,\n\n\tSMSG_OVERRIDE_LIGHT = 0x412, // uint32 defaultMapLight, uint32 overrideLight, uint32 transitionTimeMs\n\n\tSMSG_TOTEM_CREATED = 0x413,\n\n\tCMSG_TOTEM_DESTROYED = 0x414,\n\n\tCMSG_EXPIRE_RAID_INSTANCE = 0x415,\n\n\tCMSG_NO_SPELL_VARIANCE = 0x416,\n\n\tCMSG_QUESTGIVER_STATUS_MULTIPLE_QUERY = 0x417,\n\n\tSMSG_QUESTGIVER_STATUS_MULTIPLE = 0x418,\n\n\tCMSG_SET_PLAYER_DECLINED_NAMES = 0x419,\n\n\tSMSG_SET_PLAYER_DECLINED_NAMES_RESULT = 0x41A,\n\n\tCMSG_QUERY_SERVER_BUCK_DATA = 0x41B,\n\n\tCMSG_CLEAR_SERVER_BUCK_DATA = 0x41C,\n\n\tSMSG_SERVER_BUCK_DATA = 0x41D,\n\n\tSMSG_SEND_UNLEARN_SPELLS = 0x41E,\n\n\tSMSG_PROPOSE_LEVEL_GRANT = 0x41F,\n\n\tCMSG_ACCEPT_LEVEL_GRANT = 0x420,\n\n\tSMSG_REFER_A_FRIEND_FAILURE = 0x421,\n\n\tSMSG_SPLINE_MOVE_SET_FLYING = 0x422,\n\n\tSMSG_SPLINE_MOVE_UNSET_FLYING = 0x423,\n\n\tSMSG_SUMMON_CANCEL = 0x424,\n\n\tCMSG_CHANGE_PERSONAL_ARENA_RATING = 0x425,\n\n\tCMSG_ALTER_APPEARANCE = 0x426,\n\n\tSMSG_ENABLE_BARBER_SHOP = 0x427,\n\n\tSMSG_BARBER_SHOP_RESULT = 0x428,\n\n\tCMSG_CALENDAR_GET_CALENDAR = 0x429,\n\n\tCMSG_CALENDAR_GET_EVENT = 0x42A,\n\n\tCMSG_CALENDAR_GUILD_FILTER = 0x42B,\n\n\tCMSG_CALENDAR_ARENA_TEAM = 0x42C,\n\n\tCMSG_CALENDAR_ADD_EVENT = 0x42D,\n\n\tCMSG_CALENDAR_UPDATE_EVENT = 0x42E,\n\n\tCMSG_CALENDAR_REMOVE_EVENT = 0x42F,\n\n\tCMSG_CALENDAR_COPY_EVENT = 0x430,\n\n\tCMSG_CALENDAR_EVENT_INVITE = 0x431,\n\n\tCMSG_CALENDAR_EVENT_RSVP = 0x432,\n\n\tCMSG_CALENDAR_EVENT_REMOVE_INVITE = 0x433,\n\n\tCMSG_CALENDAR_EVENT_STATUS = 0x434,\n\n\tCMSG_CALENDAR_EVENT_MODERATOR_STATUS = 0x435,\n\n\tSMSG_CALENDAR_SEND_CALENDAR = 0x436,\n\n\tSMSG_CALENDAR_SEND_EVENT = 0x437,\n\n\tSMSG_CALENDAR_FILTER_GUILD = 0x438,\n\n\tSMSG_CALENDAR_ARENA_TEAM = 0x439,\n\n\tSMSG_CALENDAR_EVENT_INVITE = 0x43A,\n\n\tSMSG_CALENDAR_EVENT_INVITE_REMOVED = 0x43B,\n\n\tSMSG_CALENDAR_EVENT_STATUS = 0x43C,\n\n\tSMSG_CALENDAR_COMMAND_RESULT = 0x43D,\n\n\tSMSG_CALENDAR_RAID_LOCKOUT_ADDED = 0x43E,\n\n\tSMSG_CALENDAR_RAID_LOCKOUT_REMOVED = 0x43F,\n\n\tSMSG_CALENDAR_EVENT_INVITE_ALERT = 0x440,\n\n\tSMSG_CALENDAR_EVENT_INVITE_REMOVED_ALERT = 0x441,\n\n\tSMSG_CALENDAR_EVENT_INVITE_STATUS_ALERT = 0x442,\n\n\tSMSG_CALENDAR_EVENT_REMOVED_ALERT = 0x443,\n\n\tSMSG_CALENDAR_EVENT_UPDATED_ALERT = 0x444,\n\n\tSMSG_CALENDAR_EVENT_MODERATOR_STATUS_ALERT = 0x445,\n\n\tCMSG_CALENDAR_COMPLAIN = 0x446,\n\n\tCMSG_CALENDAR_GET_NUM_PENDING = 0x447,\n\n\tSMSG_CALENDAR_SEND_NUM_PENDING = 0x448,\n\n\tCMSG_SAVE_DANCE = 0x449,\n\n\tSMSG_NOTIFY_DANCE = 0x44A,\n\n\tCMSG_PLAY_DANCE = 0x44B,\n\n\tSMSG_PLAY_DANCE = 0x44C,\n\n\tCMSG_LOAD_DANCES = 0x44D,\n\n\tCMSG_STOP_DANCE = 0x44E,\n\n\tSMSG_STOP_DANCE = 0x44F,\n\n\tCMSG_SYNC_DANCE = 0x450,\n\n\tCMSG_DANCE_QUERY = 0x451,\n\n\tSMSG_DANCE_QUERY_RESPONSE = 0x452,\n\n\tSMSG_INVALIDATE_DANCE = 0x453,\n\n\tCMSG_DELETE_DANCE = 0x454,\n\n\tSMSG_LEARNED_DANCE_MOVES = 0x455,\n\n\tCMSG_LEARN_DANCE_MOVE = 0x456,\n\n\tCMSG_UNLEARN_DANCE_MOVE = 0x457,\n\n\tCMSG_SET_RUNE_COUNT = 0x458,\n\n\tCMSG_SET_RUNE_COOLDOWN = 0x459,\n\n\tMSG_MOVE_SET_PITCH_RATE_CHEAT = 0x45A,\n\n\tMSG_MOVE_SET_PITCH_RATE = 0x45B,\n\n\tSMSG_FORCE_PITCH_RATE_CHANGE = 0x45C,\n\n\tCMSG_FORCE_PITCH_RATE_CHANGE_ACK = 0x45D,\n\n\tSMSG_SPLINE_SET_PITCH_RATE = 0x45E,\n\n\tCMSG_CALENDAR_EVENT_INVITE_NOTES = 0x45F,\n\n\tSMSG_CALENDAR_EVENT_INVITE_NOTES = 0x460,\n\n\tSMSG_CALENDAR_EVENT_INVITE_NOTES_ALERT = 0x461,\n\n\tCMSG_UPDATE_MISSILE_TRAJECTORY = 0x462,\n\n\tSMSG_UPDATE_ACCOUNT_DATA_COMPLETE = 0x463,\n\n\tSMSG_TRIGGER_MOVIE = 0x464,\n\n\tCMSG_COMPLETE_MOVIE = 0x465,\n\n\tCMSG_SET_GLYPH_SLOT = 0x466,\n\n\tCMSG_SET_GLYPH = 0x467,\n\n\tSMSG_ACHIEVEMENT_EARNED = 0x468,\n\n\tSMSG_DYNAMIC_DROP_ROLL_RESULT = 0x469,\n\n\tSMSG_CRITERIA_UPDATE = 0x46A,\n\n\tCMSG_QUERY_INSPECT_ACHIEVEMENTS = 0x46B,\n\n\tSMSG_RESPOND_INSPECT_ACHIEVEMENTS = 0x46C,\n\n\tCMSG_DISMISS_CONTROLLED_VEHICLE = 0x46D,\n\n\tCMSG_COMPLETE_ACHIEVEMENT_CHEAT = 0x46E,\n\n\tSMSG_QUESTUPDATE_ADD_PVP_KILL = 0x46F,\n\n\tCMSG_SET_CRITERIA_CHEAT = 0x470,\n\n\tSMSG_CALENDAR_RAID_LOCKOUT_UPDATED = 0x471,\n\n\tCMSG_UNITANIMTIER_CHEAT = 0x472,\n\n\tCMSG_CHAR_CUSTOMIZE = 0x473,\n\n\tSMSG_CHAR_CUSTOMIZE = 0x474,\n\n\tSMSG_PET_RENAMEABLE = 0x475,\n\n\tCMSG_REQUEST_VEHICLE_EXIT = 0x476,\n\n\tCMSG_REQUEST_VEHICLE_PREV_SEAT = 0x477,\n\n\tCMSG_REQUEST_VEHICLE_NEXT_SEAT = 0x478,\n\n\tCMSG_REQUEST_VEHICLE_SWITCH_SEAT = 0x479,\n\n\tCMSG_PET_LEARN_TALENT = 0x47A,\n\n\tCMSG_PET_UNLEARN_TALENTS = 0x47B,\n\n\tSMSG_SET_PHASE_SHIFT = 0x47C,\n\n\tSMSG_ALL_ACHIEVEMENT_DATA = 0x47D,\n\n\tCMSG_FORCE_SAY_CHEAT = 0x47E,\n\n\tSMSG_HEALTH_UPDATE = 0x47F,\n\n\tSMSG_POWER_UPDATE = 0x480,\n\n\tCMSG_GAMEOBJ_REPORT_USE = 0x481,\n\n\tSMSG_HIGHEST_THREAT_UPDATE = 0x482,\n\n\tSMSG_THREAT_UPDATE = 0x483,\n\n\tSMSG_THREAT_REMOVE = 0x484,\n\n\tSMSG_THREAT_CLEAR = 0x485,\n\n\tSMSG_CONVERT_RUNE = 0x486,\n\n\tSMSG_RESYNC_RUNES = 0x487,\n\n\tSMSG_ADD_RUNE_POWER = 0x488,\n\n\tCMSG_START_QUEST = 0x489,\n\n\tCMSG_REMOVE_GLYPH = 0x48A,\n\n\tCMSG_DUMP_OBJECTS = 0x48B,\n\n\tSMSG_DUMP_OBJECTS_DATA = 0x48C,\n\n\tCMSG_DISMISS_CRITTER = 0x48D,\n\n\tSMSG_NOTIFY_DEST_LOC_SPELL_CAST = 0x48E,\n\n\tCMSG_AUCTION_LIST_PENDING_SALES = 0x48F,\n\n\tSMSG_AUCTION_LIST_PENDING_SALES = 0x490,\n\n\tSMSG_MODIFY_COOLDOWN = 0x491,\n\n\tSMSG_PET_UPDATE_COMBO_POINTS = 0x492,\n\n\tCMSG_ENABLETAXI = 0x493,\n\n\tSMSG_PRE_RESURRECT = 0x494,\n\n\tSMSG_AURA_UPDATE_ALL = 0x495,\n\n\tSMSG_AURA_UPDATE = 0x496,\n\n\tCMSG_FLOOD_GRACE_CHEAT = 0x497,\n\n\tSMSG_SERVER_FIRST_ACHIEVEMENT = 0x498,\n\n\tSMSG_PET_LEARNED_SPELL = 0x499,\n\n\tSMSG_PET_REMOVED_SPELL = 0x49A,\n\n\tCMSG_CHANGE_SEATS_ON_CONTROLLED_VEHICLE = 0x49B,\n\n\tCMSG_HEARTH_AND_RESURRECT = 0x49C,\n\n\tSMSG_ON_CANCEL_EXPECTED_RIDE_VEHICLE_AURA = 0x49D,\n\n\tSMSG_CRITERIA_DELETED = 0x49E,\n\n\tSMSG_ACHIEVEMENT_DELETED = 0x49F,\n\n\tCMSG_SERVER_INFO_QUERY = 0x4A0,\n\n\tSMSG_SERVER_INFO_RESPONSE = 0x4A1,\n\n\tCMSG_CHECK_LOGIN_CRITERIA = 0x4A2,\n\n\tSMSG_SERVER_BUCK_DATA_START = 0x4A3,\n\n\tCMSG_SET_BREATH = 0x4A4,\n\n\tCMSG_QUERY_VEHICLE_STATUS = 0x4A5,\n\n\tSMSG_BATTLEGROUND_INFO_THROTTLED = 0x4A6, // empty, \"You can't do that yet\"\n\n\tSMSG_PLAYER_VEHICLE_DATA = 0x4A7, // guid+uint32 (vehicle)\n\n\tCMSG_PLAYER_VEHICLE_ENTER = 0x4A8, // uint64\n\n\tCMSG_CONTROLLER_EJECT_PASSENGER = 0x4A9, // uint64\n\n\tSMSG_PET_GUIDS = 0x4AA,\n\n\tSMSG_CLIENTCACHE_VERSION = 0x4AB,\n\n\tCMSG_CHANGE_GDF_ARENA_RATING = 0x4AC,\n\n\tCMSG_SET_ARENA_TEAM_RATING_BY_INDEX = 0x4AD,\n\n\tCMSG_SET_ARENA_TEAM_WEEKLY_GAMES = 0x4AE,\n\n\tCMSG_SET_ARENA_TEAM_SEASON_GAMES = 0x4AF,\n\n\tCMSG_SET_ARENA_MEMBER_WEEKLY_GAMES = 0x4B0,\n\n\tCMSG_SET_ARENA_MEMBER_SEASON_GAMES = 0x4B1,\n\n\tSMSG_ITEM_REFUND_INFO_RESPONSE = 0x4B2,\n\n\tCMSG_ITEM_REFUND_INFO = 0x4B3,\n\n\tCMSG_ITEM_REFUND = 0x4B4, // lua: ContainerRefundItemPurchase\n\n\tSMSG_ITEM_REFUND_RESULT = 0x4B5,\n\n\tCMSG_CORPSE_MAP_POSITION_QUERY = 0x4B6, // uint32\n\n\tSMSG_CORPSE_MAP_POSITION_QUERY_RESPONSE = 0x4B7, // 3*float+float\n\n\tCMSG_UNUSED5 = 0x4B8,\n\n\tCMSG_UNUSED6 = 0x4B9,\n\n\tCMSG_CALENDAR_EVENT_SIGNUP = 0x4BA, // uint64\n\n\tSMSG_CALENDAR_CLEAR_PENDING_ACTION = 0x4BB,\n\n\tSMSG_EQUIPMENT_SET_LIST = 0x4BC, // equipment manager list?\n\n\tCMSG_EQUIPMENT_SET_SAVE = 0x4BD,\n\n\tCMSG_UPDATE_PROJECTILE_POSITION = 0x4BE,\n\n\tSMSG_SET_PROJECTILE_POSITION = 0x4BF,\n\n\tSMSG_TALENTS_INFO = 0x4C0,\n\n\tCMSG_LEARN_PREVIEW_TALENTS = 0x4C1,\n\n\tCMSG_LEARN_PREVIEW_TALENTS_PET = 0x4C2,\n\n\tCMSG_SET_ACTIVE_TALENT_GROUP_OBSOLETE = 0x4C3,\n\n\tCMSG_GM_GRANT_ACHIEVEMENT = 0x4C4,\n\n\tCMSG_GM_REMOVE_ACHIEVEMENT = 0x4C5,\n\n\tCMSG_GM_SET_CRITERIA_FOR_PLAYER = 0x4C6,\n\n\tSMSG_ARENA_UNIT_DESTROYED = 0x4C7,\n\n\tSMSG_ARENA_TEAM_CHANGE_FAILED_QUEUED = 0x4C8, // uint32 \"Can't modify arena team while queued or in a match.\"\n\n\tCMSG_PROFILEDATA_REQUEST = 0x4C9,\n\n\tSMSG_PROFILEDATA_RESPONSE = 0x4CA,\n\n\tCMSG_START_BATTLEFIELD_CHEAT = 0x4CB,\n\n\tCMSG_END_BATTLEFIELD_CHEAT = 0x4CC,\n\n\tSMSG_MULTIPLE_PACKETS = 0x4CD,\n\n\tSMSG_MOVE_GRAVITY_DISABLE = 0x4CE,\n\n\tCMSG_MOVE_GRAVITY_DISABLE_ACK = 0x4CF,\n\n\tSMSG_MOVE_GRAVITY_ENABLE = 0x4D0,\n\n\tCMSG_MOVE_GRAVITY_ENABLE_ACK = 0x4D1,\n\n\tMSG_MOVE_GRAVITY_CHNG = 0x4D2,\n\n\tSMSG_SPLINE_MOVE_GRAVITY_DISABLE = 0x4D3,\n\n\tSMSG_SPLINE_MOVE_GRAVITY_ENABLE = 0x4D4,\n\n\tCMSG_EQUIPMENT_SET_USE = 0x4D5,\n\n\tSMSG_EQUIPMENT_SET_USE_RESULT = 0x4D6,\n\n\tCMSG_FORCE_ANIM = 0x4D7,\n\n\tSMSG_FORCE_ANIM = 0x4D8,\n\n\tCMSG_CHAR_FACTION_CHANGE = 0x4D9,\n\n\tSMSG_CHAR_FACTION_CHANGE = 0x4DA,\n\n\tCMSG_PVP_QUEUE_STATS_REQUEST = 0x4DB,\n\n\tSMSG_PVP_QUEUE_STATS = 0x4DC,\n\n\tCMSG_SET_PAID_SERVICE_CHEAT = 0x4DD,\n\n\tSMSG_BATTLEFIELD_MGR_ENTRY_INVITE = 0x4DE, // uint32\n\n\tCMSG_BATTLEFIELD_MGR_ENTRY_INVITE_RESPONSE = 0x4DF,\n\n\tSMSG_BATTLEFIELD_MGR_ENTERED = 0x4E0, // uint32, uint8, uint8\n\n\tSMSG_BATTLEFIELD_MGR_QUEUE_INVITE = 0x4E1, // uint32\n\n\tCMSG_BATTLEFIELD_MGR_QUEUE_INVITE_RESPONSE = 0x4E2,\n\n\tCMSG_BATTLEFIELD_MGR_QUEUE_REQUEST = 0x4E3,\n\n\tSMSG_BATTLEFIELD_MGR_QUEUE_REQUEST_RESPONSE = 0x4E4, // uint32, uint8\n\n\tSMSG_BATTLEFIELD_MGR_EJECT_PENDING = 0x4E5, // uint32\n\n\tSMSG_BATTLEFIELD_MGR_EJECTED = 0x4E6, // uint32, uint32, uint8\n\n\tCMSG_BATTLEFIELD_MGR_EXIT_REQUEST = 0x4E7,\n\n\tSMSG_BATTLEFIELD_MGR_STATE_CHANGE = 0x4E8, // uint32, uint32\n\n\tCMSG_BATTLEFIELD_MANAGER_ADVANCE_STATE = 0x4E9,\n\n\tCMSG_BATTLEFIELD_MANAGER_SET_NEXT_TRANSITION_TIME = 0x4EA,\n\n\tMSG_SET_RAID_DIFFICULTY = 0x4EB,\n\n\tCMSG_TOGGLE_XP_GAIN = 0x4EC,\n\n\tSMSG_TOGGLE_XP_GAIN = 0x4ED, // enable/disable XP gain console message\n\n\tSMSG_GMRESPONSE_DB_ERROR = 0x4EE, // empty\n\n\tSMSG_GMRESPONSE_RECEIVED = 0x4EF, // uint32, uint32, string[2000], string[4000][4]\n\n\tCMSG_GMRESPONSE_RESOLVE = 0x4F0,\n\n\tSMSG_GMRESPONSE_STATUS_UPDATE = 0x4F1, // uint8 (1 - EVENT_GMSURVEY_DISPLAY, 0 - EVENT_UPDATE_TICKET)\n\n\tSMSG_GMRESPONSE_CREATE_TICKET = 0x4F2,\n\n\tCMSG_GMRESPONSE_CREATE_TICKET = 0x4F3,\n\n\tCMSG_SERVERINFO = 0x4F4,\n\n\tSMSG_SERVERINFO = 0x4F5,\n\n\tCMSG_WORLD_STATE_UI_TIMER_UPDATE = 0x4F6,\n\n\tSMSG_WORLD_STATE_UI_TIMER_UPDATE = 0x4F7,\n\n\tCMSG_CHAR_RACE_CHANGE = 0x4F8,\n\n\tMSG_VIEW_PHASE_SHIFT = 0x4F9,\n\n\tSMSG_TALENTS_INVOLUNTARILY_RESET = 0x4FA, // uint8\n\n\tCMSG_DEBUG_SERVER_GEO = 0x4FB,\n\n\tSMSG_DEBUG_SERVER_GEO = 0x4FC,\n\n\tSMSG_LOOT_SLOT_CHANGED = 0x4FD,\n\n\tUMSG_UPDATE_GROUP_INFO = 0x4FE,\n\n\tCMSG_READY_FOR_ACCOUNT_DATA_TIMES = 0x4FF,\n\n\tCMSG_QUERY_QUESTS_COMPLETED = 0x500,\n\n\tSMSG_QUERY_QUESTS_COMPLETED_RESPONSE = 0x501,\n\n\tCMSG_GM_REPORT_LAG = 0x502,\n\n\tCMSG_AFK_MONITOR_INFO_REQUEST = 0x503,\n\n\tSMSG_AFK_MONITOR_INFO_RESPONSE = 0x504,\n\n\tCMSG_AFK_MONITOR_INFO_CLEAR = 0x505,\n\n\tSMSG_CORPSE_NOT_IN_INSTANCE = 0x506,\n\n\tCMSG_GM_NUKE_CHARACTER = 0x507,\n\n\tCMSG_SET_ALLOW_LOW_LEVEL_RAID1 = 0x508,\n\n\tCMSG_SET_ALLOW_LOW_LEVEL_RAID2 = 0x509,\n\n\tSMSG_CAMERA_SHAKE = 0x50A, // uint32 SpellEffectCameraShakes.dbc index, uint32\n\n\tSMSG_SOCKET_GEMS_RESULT = 0x50B,\n\n\tCMSG_SET_CHARACTER_MODEL = 0x50C,\n\n\tSMSG_REDIRECT_CLIENT = 0x50D, // uint32 ip, uint16 port, uint32 unk, uint8[20] hash (ip + port, seed=sessionkey)\n\n\tCMSG_REDIRECTION_FAILED = 0x50E, // something with networking\n\n\tSMSG_SUSPEND_COMMS = 0x50F,\n\n\tCMSG_SUSPEND_COMMS_ACK = 0x510,\n\n\tSMSG_FORCE_SEND_QUEUED_PACKETS = 0x511,\n\n\tCMSG_REDIRECTION_AUTH_PROOF = 0x512,\n\n\tCMSG_DROP_NEW_CONNECTION = 0x513,\n\n\tSMSG_SEND_ALL_COMBAT_LOG = 0x514,\n\n\tSMSG_OPEN_LFG_DUNGEON_FINDER = 0x515,\n\n\tSMSG_MOVE_SET_COLLISION_HGT = 0x516,\n\n\tCMSG_MOVE_SET_COLLISION_HGT_ACK = 0x517,\n\n\tMSG_MOVE_SET_COLLISION_HGT = 0x518,\n\n\tCMSG_CLEAR_RANDOM_BG_WIN_TIME = 0x519,\n\n\tCMSG_CLEAR_HOLIDAY_BG_WIN_TIME = 0x51A,\n\n\tCMSG_COMMENTATOR_SKIRMISH_QUEUE_COMMAND = 0x51B,\n\n\tSMSG_COMMENTATOR_SKIRMISH_QUEUE_RESULT1 = 0x51C,\n\n\tSMSG_COMMENTATOR_SKIRMISH_QUEUE_RESULT2 = 0x51D,\n\n\tSMSG_MULTIPLE_MOVES = 0x51E, // uncompressed version of SMSG_COMPRESSED_MOVES\n\n\tNUM_MSG_TYPES = 0x51F\n","file_path":"owClient/WorldSocket/Opcodes.h","rank":0,"score":88797.40201669149},{"content":"#define SN_netscape_cert_sequence \"nsCertSequence\"\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":1,"score":75441.28331141104},{"content":"#define NID_netscape_cert_sequence 79\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":2,"score":75441.28331141104},{"content":"#define OBJ_netscape_cert_sequence OBJ_netscape_data_type,5L\n\n\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":3,"score":75441.28331141104},{"content":"#define LN_netscape_cert_sequence \"Netscape Certificate Sequence\"\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":4,"score":75441.28331141104},{"content":"#define NID_id_cmc_dataReturn 330\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":5,"score":73547.06373468976},{"content":"#define OBJ_id_cmc_dataReturn OBJ_id_cmc,4L\n\n\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":6,"score":73547.06373468976},{"content":"#define SN_id_cmc_dataReturn \"id-cmc-dataReturn\"\n","file_path":"Externals/OpenSSL/include/openssl/obj_mac.h","rank":7,"score":73547.06373468976},{"content":"#define __DBC_TVALUE(type, _name, _field) \\\n\ntype CONCAT_GET(_name)() const \\\n\n{ \\\n\n\treturn getValue<type>(static_cast<uint32>(_field - 1)); \\\n\n}\n\n\n\n#define __DBC_TARRAY(_type, _name, _field, _size) \\\n\n_type CONCAT_GET(_name)(uint8 _index) const \\\n\n{ \\\n\n _ASSERT(_index < _size); \\\n\n\treturn getValue<_type>(static_cast<uint32>(_field - 1 + _index)); \\\n\n}\n\n\n\n#define __DBC_STRING(_name, _field) \\\n\nstd::string CONCAT_GET(_name)() const \\\n\n{ \\\n\n\treturn getString(static_cast<uint32>(_field - 1)); \\\n\n}\n\n\n\n#define __DBC_STRARR(_name, _field, _size) \\\n\nstd::string CONCAT_GET(_name)(uint8 _index) const \\\n","file_path":"owGame/DBC/DBC__Macros.h","rank":8,"score":68140.65998280243},{"content":"enum class EWoWObjectHighGuid : uint16\n\n{\n\n Item = 0x4000, // blizz 4000\n\n Container = 0x4000, // blizz 4000\n\n Player = 0x0000, // blizz 0000\n\n GameObject = 0xF110, // blizz F110\n\n Transport = 0xF120, // blizz F120 (for GAMEOBJECT_TYPE_TRANSPORT)\n\n Unit = 0xF130, // blizz F130\n\n Pet = 0xF140, // blizz F140\n\n Vehicle = 0xF150, // blizz F550\n\n DynamicObject = 0xF100, // blizz F100\n\n Corpse = 0xF101, // blizz F100\n\n Mo_Transport = 0x1FC0, // blizz 1FC0 (for GAMEOBJECT_TYPE_MO_TRANSPORT)\n\n Instance = 0x1F40, // blizz 1F40\n\n Group = 0x1F50,\n\n};\n\n\n","file_path":"owClient/World/WoWGUID.h","rank":9,"score":63004.6695290205},{"content":"struct SM2_Loop\n\n{\n\n\tuint32 timestamp;\n","file_path":"owGame/M2/M2_Types.h","rank":10,"score":44571.486098594636},{"content":"struct SM2_Sequence\n\n{\n\n\tFOREIGN_KEY_ID(uint16, DBC_AnimationData, animID); // Animation id in AnimationData.dbc\t\n\n\tuint16 variationIndex;\t\t\t// Sub-animation id: Which number in a row of animations this one is.\n\n\n\n#if WOW_CLIENT_VERSION <= WOW_BC_2_4_3\n\n\tuint32_t start_timestamp;\n\n\tuint32_t end_timestamp;\n\n#else\n\n\tuint32_t duration;\n\n#endif\n\n\n\n\tfloat movespeed;\t\t\t\t// This is the speed the character moves with in this animation.\n\n\n\n\tstruct Flags\n\n\t{\n\n\t\tuint32 unk0x01 : 1;\n\n\t\tuint32 unk0x02 : 1;\n\n\t\tuint32 unk0x04 : 1;\n\n\t\tuint32 unk0x08 : 1;\n\n\t\tuint32 LowPrioritySeq : 1;\n\n\t\tuint32 DataInM2 : 1; // If set, the animation data is in the .m2 file. If not set, the animation data is in an .anim file.\n\n\t\tuint32 HasNext : 1; // (To find the animation data, the client skips these by following aliasNext until an animation without 0x40 is found.)\n\n\t\tuint32 IsBlended : 1; // (if either side of a transition has 0x80, lerp between end->start states, unless end==start by comparing bone values)\n\n\t\tuint32 : 24;\n\n\t} flags;\n\n\tint16\t\tfrequency;\t\t\t\t// This is used to determine how often the animation is played. For all animations of the same type, this adds up to 0x7FFF (32767).\n\n\tuint16\t\tunk0;\n\n\tM2Range\t\treplay;\t\t\t\t\t// May both be 0 to not repeat. Client will pick a random number of repetitions within bounds if given.\n\n\tuint32\t\tblendTime;\n\n\n\n\tM2Bounds\tbounds;\n\n\tint16\t\tvariationNext;\t\t\t// id of the following animation of this AnimationID, points to an Index or is -1 if none.\n\n\tuint16\t\taliasNext;\t\t\t\t// id in the list of animations. Used to find actual animation if this sequence is an alias (flags & 0x40)\n","file_path":"owGame/M2/M2_Types.h","rank":11,"score":44566.94643720141},{"content":" int16\t\t\t\t\t\t\t\tglobal_sequence;\n","file_path":"owGame/M2/M2_CommonTypes.h","rank":12,"score":43321.11626601458},{"content":"const float C_ChunkSize = C_TileSize / 16.0f;\n","file_path":"owGame/Utils/WowConsts.h","rank":13,"score":43316.86666275927},{"content":"const float C_UnitSize = C_ChunkSize / 8.0f;\n","file_path":"owGame/Utils/WowConsts.h","rank":14,"score":43316.86666275927},{"content":"const uint32 C_RenderedTiles = 1u;\n","file_path":"owGame/Utils/WowConsts.h","rank":15,"score":43316.86666275927},{"content":"const uint32 C_TilesInMap = 64u;\n","file_path":"owGame/Utils/WowConsts.h","rank":16,"score":43316.86666275927},{"content":"const float C_ZeroPoint = 32.0f * C_TileSize; // 17066.66656\n","file_path":"owGame/Utils/WowConsts.h","rank":17,"score":43316.86666275927},{"content":"const int32 C_ChunksInTile = 16;\n","file_path":"owGame/Utils/WowConsts.h","rank":18,"score":43316.86666275927},{"content":"const float C_DetailSize = 8.0f;\n","file_path":"owGame/Utils/WowConsts.h","rank":19,"score":43316.86666275927},{"content":"const float C_TileSize = 533.3333333333f;\n","file_path":"owGame/Utils/WowConsts.h","rank":20,"score":43316.86666275927},{"content":"const float C_AlphaSize = 1.0f;\n","file_path":"owGame/Utils/WowConsts.h","rank":21,"score":43316.86666275927},{"content":"DBC_DEF_BEGIN(DBC_CinematicSequences)\n\n\n","file_path":"owGame/DBC/Tables/DBC_CinematicSequences.h","rank":22,"score":42143.04417151918},{"content":"const int32 C_ChunksInTileGlobal = C_ChunksInTile * C_ChunksInTile;\n","file_path":"owGame/Utils/WowConsts.h","rank":23,"score":42138.91013174513},{"content":"const uint32 C_TilesCacheSize = ((C_RenderedTiles + 1u) * (C_RenderedTiles + 1u));\n","file_path":"owGame/Utils/WowConsts.h","rank":24,"score":42138.91013174513},{"content":"const int32 C_MapBufferSize = 9 * 9 + 8 * 8;\n","file_path":"owGame/Utils/WowConsts.h","rank":25,"score":42138.91013174513},{"content":" DES_cblock h, hh;\n","file_path":"Externals/OpenSSL/include/openssl/mdc2.h","rank":26,"score":40723.64097802318},{"content":" ASN1_TIME *notBefore;\n","file_path":"Externals/OpenSSL/include/openssl/x509.h","rank":27,"score":40723.64097802318},{"content":" union {\n\n SHA_LONG64 d[SHA_LBLOCK];\n\n unsigned char p[SHA512_CBLOCK];\n","file_path":"Externals/OpenSSL/include/openssl/sha.h","rank":28,"score":40723.64097802318},{"content":" MD4_LONG A, B, C, D;\n","file_path":"Externals/OpenSSL/include/openssl/md4.h","rank":29,"score":40723.64097802318},{"content":" ASN1_ITEM_EXP *it;\n","file_path":"Externals/OpenSSL/include/openssl/x509v3.h","rank":30,"score":40723.64097802318},{"content":" int (*check_purpose) (const struct x509_purpose_st *, const X509 *, int);\n","file_path":"Externals/OpenSSL/include/openssl/x509v3.h","rank":31,"score":40723.64097802318},{"content":" unsigned char *out;\n","file_path":"Externals/OpenSSL/include/openssl/evp.h","rank":32,"score":40723.64097802318},{"content":" int (*adb_cb)(long *psel); /* Application callback */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":33,"score":40723.64097802318},{"content":" RIPEMD160_LONG A, B, C, D, E;\n","file_path":"Externals/OpenSSL/include/openssl/ripemd.h","rank":34,"score":40723.64097802318},{"content":" union {\n\n double d; /* ensures 64-bit align */\n\n KEY_TABLE_TYPE rd_key;\n","file_path":"Externals/OpenSSL/include/openssl/camellia.h","rank":35,"score":40723.64097802318},{"content":" union {\n\n ASN1_NULL *inherit;\n\n IPAddressOrRanges *addressesOrRanges;\n","file_path":"Externals/OpenSSL/include/openssl/x509v3.h","rank":36,"score":40723.64097802318},{"content":" const BIGNUM *g;\n","file_path":"Externals/OpenSSL/include/openssl/srp.h","rank":37,"score":40723.64097802318},{"content":" BIGNUM *s;\n","file_path":"Externals/OpenSSL/include/openssl/srp.h","rank":38,"score":40723.64097802318},{"content":" MD5_LONG A, B, C, D;\n","file_path":"Externals/OpenSSL/include/openssl/md5.h","rank":39,"score":40723.64097802318},{"content":" SHA_LONG64 h[8];\n","file_path":"Externals/OpenSSL/include/openssl/sha.h","rank":40,"score":40723.64097802318},{"content":" RC4_INT x, y;\n","file_path":"Externals/OpenSSL/include/openssl/rc4.h","rank":41,"score":40723.64097802318},{"content":" ASN1_GENERALIZEDTIME *notAfter;\n","file_path":"Externals/OpenSSL/include/openssl/x509v3.h","rank":42,"score":40723.64097802318},{"content":" BIGNUM *v;\n","file_path":"Externals/OpenSSL/include/openssl/srp.h","rank":43,"score":40723.64097802318},{"content":" int (*load) (CONF *conf, const char *name, long *eline);\n","file_path":"Externals/OpenSSL/include/openssl/conf.h","rank":44,"score":40723.64097802318},{"content":" ASN1_GENERALIZEDTIME *notBefore;\n","file_path":"Externals/OpenSSL/include/openssl/x509v3.h","rank":45,"score":40723.64097802318},{"content":" union {\n\n ASN1_IA5STRING *cpsuri;\n\n USERNOTICE *usernotice;\n\n ASN1_TYPE *other;\n","file_path":"Externals/OpenSSL/include/openssl/x509v3.h","rank":46,"score":40723.64097802318},{"content":" int (*check_trust) (struct x509_trust_st *, X509 *, int);\n","file_path":"Externals/OpenSSL/include/openssl/x509.h","rank":47,"score":40723.64097802318},{"content":" BIO *out;\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":48,"score":40723.64097802318},{"content":" ASN1_TIME *notAfter;\n","file_path":"Externals/OpenSSL/include/openssl/x509.h","rank":49,"score":40723.64097802318},{"content":" union {\n\n char *ptr;\n\n /* NID_pkcs7_data */\n\n ASN1_OCTET_STRING *data;\n\n /* NID_pkcs7_signed */\n\n PKCS7_SIGNED *sign;\n\n /* NID_pkcs7_enveloped */\n\n PKCS7_ENVELOPE *enveloped;\n\n /* NID_pkcs7_signedAndEnveloped */\n\n PKCS7_SIGN_ENVELOPE *signed_and_enveloped;\n\n /* NID_pkcs7_digest */\n\n PKCS7_DIGEST *digest;\n\n /* NID_pkcs7_encrypted */\n\n PKCS7_ENCRYPT *encrypted;\n\n /* Anything else */\n\n ASN1_TYPE *other;\n","file_path":"Externals/OpenSSL/include/openssl/pkcs7.h","rank":50,"score":40723.64097802318},{"content":" int (*status) (void);\n","file_path":"Externals/OpenSSL/include/openssl/rand.h","rank":51,"score":40723.64097802318},{"content":" long plen; /* length */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":52,"score":39558.11710804085},{"content":" const void *funcs; /* functions that handle this type */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":53,"score":39557.91970742002},{"content":" long tcount; /* Number of templates if SEQUENCE or CHOICE */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":54,"score":39557.91970742002},{"content":" long utype; /* underlying type */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":55,"score":39557.74866401569},{"content":" int bitnum;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":56,"score":39552.50909168249},{"content":" unsigned char *enc; /* DER encoding */\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":57,"score":39552.50909168249},{"content":" int modified; /* set to 1 if 'enc' is invalid */\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":58,"score":39552.50909168249},{"content":" int type;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":59,"score":39552.50909168249},{"content":" const char *lname;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":60,"score":39552.50909168249},{"content":" unsigned long flags; /* Various flags */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":61,"score":39552.50909168249},{"content":" union {\n\n char *ptr;\n\n ASN1_BOOLEAN boolean;\n\n ASN1_STRING *asn1_string;\n\n ASN1_OBJECT *object;\n\n ASN1_INTEGER *integer;\n\n ASN1_ENUMERATED *enumerated;\n\n ASN1_BIT_STRING *bit_string;\n\n ASN1_OCTET_STRING *octet_string;\n\n ASN1_PRINTABLESTRING *printablestring;\n\n ASN1_T61STRING *t61string;\n\n ASN1_IA5STRING *ia5string;\n\n ASN1_GENERALSTRING *generalstring;\n\n ASN1_BMPSTRING *bmpstring;\n\n ASN1_UNIVERSALSTRING *universalstring;\n\n ASN1_UTCTIME *utctime;\n\n ASN1_GENERALIZEDTIME *generalizedtime;\n\n ASN1_VISIBLESTRING *visiblestring;\n\n ASN1_UTF8STRING *utf8string;\n\n /*\n\n * set and sequence are left complete and still contain the set or\n\n * sequence bytes\n\n */\n\n ASN1_STRING *set;\n\n ASN1_STRING *sequence;\n\n ASN1_VALUE *asn1_value;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":62,"score":39552.50909168249},{"content":" unsigned long offset; /* Offset of this field in structure */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":63,"score":39552.50909168249},{"content":" unsigned long flags;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":64,"score":39552.50909168249},{"content":" const char *sname;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":65,"score":39552.50909168249},{"content":" long maxsize;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":66,"score":39552.50909168249},{"content":" long tag; /* tag, not used if no tagging */\n","file_path":"Externals/OpenSSL/include/openssl/asn1t.h","rank":67,"score":39552.50909168249},{"content":" int nid;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":68,"score":39552.50909168249},{"content":" long minsize;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":69,"score":39552.50909168249},{"content":" unsigned char *data;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":70,"score":39552.50909168249},{"content":" long len; /* Length of encoding */\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":71,"score":39552.50909168249},{"content":" int length;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":72,"score":39552.50909168249},{"content":" unsigned long mask;\n","file_path":"Externals/OpenSSL/include/openssl/asn1.h","rank":73,"score":39552.50909168249},{"content":"\t\tif (SequenceIndex < GetCount())\n\n\t\t{\n\n\t\t\tif (m_Values[SequenceIndex].empty())\n\n\t\t\t\treturn false;\n\n\n\n\t\t\treturn true;\n\n\t\t}\n\n\n\n\t\treturn false;\n\n\t}\n\n\n\n\tinline T GetValue(uint16 SequenceIndex, uint32 time, const std::vector<SM2_Loop>& GlobalLoop, const uint32 GlobalTime, bool ForceLinear = false) const\n\n\t{\n\n\t\tif (IsStaticValue())\n\n\t\t{\n\n\t\t\treturn m_Values.at(0).at(0);\n\n\t\t}\n\n\n\n\t\t// obtain a time value and a values range\n\n\t\tif (m_GlobalSecIndex != -1)\n","file_path":"owGame/M2/M2_Animated.h","rank":75,"score":19.57350032290633},{"content":"void CM2_Comp_Skeleton::Load(const SM2_Header& M2Header, const std::shared_ptr<IByteBuffer>& File)\n\n{\n\n\tif (M2Header.global_loops.size > 0)\n\n\t{\n\n\t\tconst SM2_Loop* GlobalLoops = (const SM2_Loop*)(File->getData() + M2Header.global_loops.offset);\n\n\t\tfor (uint32 i = 0; i < M2Header.global_loops.size; i++)\n\n\t\t\tm_GlobalLoops.push_back(GlobalLoops[i]);\n\n\t}\n\n\n\n\t// Sequences\n\n\tif (M2Header.sequences.size > 0)\n\n\t{\n\n\t\tconst SM2_Sequence* Sequences = (const SM2_Sequence*)(File->getData() + M2Header.sequences.offset);\n\n\t\tfor (uint32 i = 0; i < M2Header.sequences.size; i++)\n\n\t\t{\n\n\t\t\tm_Sequences.push_back(Sequences[i]);\n\n\n\n\t\t\tif (Sequences[i].flags.DataInM2)\n\n\t\t\t{\n\n\t\t\t\tanimFiles.push_back(nullptr);\n","file_path":"owGame/M2/M2_Comp_Skeleton.cpp","rank":77,"score":16.850029349490654},{"content":"\t\t\t\t\t\tm_ValuesHermiteIn[j].push_back(fixfunc(Conv::conv(values[i * 3 + 1])));\n\n\t\t\t\t\t\tm_ValuesHermiteOut[j].push_back(fixfunc(Conv::conv(values[i * 3 + 2])));\n\n\t\t\t\t\t\tbreak;\n\n\n\n\t\t\t\t\t\t//default:\n\n\t\t\t\t\t\t//\t_ASSERT_EXPR(false, \"M2_Animated: Unknown interpolation type.\");\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\tinline bool IsUsesBySequence(uint16 SequenceIndex) const\n\n\t{\n\n\t\tif (IsStaticValue())\n\n\t\t\treturn true;\n\n\n\n\t\t// Global sec always use\n\n\t\tif (m_GlobalSecIndex != -1)\n\n\t\t\treturn true;\n\n\n","file_path":"owGame/M2/M2_Animated.h","rank":78,"score":15.727656540650248},{"content":"\t_ASSERT(M2Instance != nullptr);\n\n\n\n\tif (const auto& animator = M2Instance->GetAnimatorComponent())\n\n\t\tif (m_ColorAnimated.IsUsesBySequence(animator->getSequenceIndex()))\n\n\t\t\treturn m_ColorAnimated.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), GlobalTime);\n\n\treturn glm::vec3(1.0f, 0.0f, 0.0f);\n\n}\n\n\n\nfloat CM2_Part_Color::GetAlpha(const CM2_Base_Instance* M2Instance, uint32 GlobalTime) const\n\n{\n\n\t_ASSERT(M2Instance != nullptr);\n\n\n\n\tif (const auto& animator = M2Instance->GetAnimatorComponent())\n\n\t\tif (m_AlphaAnimated.IsUsesBySequence(animator->getSequenceIndex()))\n\n\t\t\treturn m_AlphaAnimated.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), GlobalTime);\n\n\treturn 0.5f;\n\n}\n","file_path":"owGame/M2/M2_Part_Color.cpp","rank":79,"score":15.295830860716789},{"content":"\t\tfloat horizontalRangeValue = horizontalRange.GetValue(sequence, sequenceTime, m_M2Object.getSkeleton().getGlobalLoops(), globalTime);\n\n\n\n\t\tbool enabledValue = true;\n\n\t\tif (enabled.IsUsesBySequence(sequence))\n\n\t\t\tenabledValue = enabled.GetValue(sequence, sequenceTime, m_M2Object.getSkeleton().getGlobalLoops(), globalTime) != 0;\n\n\n\n\t\tif (false == enabledValue)\n\n\t\t\treturn;\n\n\n\n\t\tfor (int i = 0; i < tospawn; i++)\n\n\t\t{\n\n\t\t\tsize_t freeIndex = -1;\n\n\t\t\tfor (size_t ind = 0; ind < MAX_PARTICLES; ind++)\n\n\t\t\t{\n\n\t\t\t\tif (false == Particles[ind].Active)\n\n\t\t\t\t{\n\n\t\t\t\t\tfreeIndex = ind;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n","file_path":"owGame/M2/M2_Part_ParticleSystem.cpp","rank":80,"score":15.009433618092208},{"content":"\n\n\t\tif (m_GlobalSecIndex == -1 && m_Ranges.size() <= SequenceIndex)\n\n\t\t\treturn false;\n\n\n\n\t\tif (m_Values.empty())\n\n\t\t\treturn false; // ????\n\n\n\n\t\treturn true;\n\n\t}\n\n\n\n\tinline T GetValue(uint16 SequenceIndex, uint32 time, const std::vector<SM2_Loop>& GlobalLoop, const uint32 GlobalTime) const\n\n\t{\n\n\t\t_ASSERT(m_Values.empty() == false);\n\n\t\tif (m_Values.size() == 1)\n\n\t\t\treturn m_Values[0];\n\n\n\n std::pair<uint32, uint32> range = std::make_pair(0, m_Values.size() - 1);\n\n\n\n\t\t// obtain a time value and a values range\n\n\t\tif (m_GlobalSecIndex != -1)\n","file_path":"owGame/M2/M2_Animated.h","rank":81,"score":14.46424231463656},{"content":"\n\n\n\n\n\n\n\n\n\n\n\nvoid CWorldSocket::AddHandler(Opcodes Opcode, std::function<void(CServerPacket&)> Handler)\n\n{\n\n\t_ASSERT(Handler != nullptr);\n\n\tm_Handlers.insert(std::make_pair(Opcode, Handler));\n\n}\n\n\n\nbool CWorldSocket::ProcessPacket(CServerPacket& ServerPacket)\n\n{\n\n\tServerPacket.seek(0);\n\n\n\n\tconst auto& handler = m_Handlers.find(ServerPacket.GetPacketOpcode());\n\n\tif (handler != m_Handlers.end())\n\n\t{\n\n\t\t_ASSERT(handler->second != nullptr);\n","file_path":"owClient/WorldSocket/WorldSocket.cpp","rank":82,"score":14.363836726913515},{"content":"#include \"stdafx.h\"\n\n\n\n// Include\n\n#include \"M2.h\"\n\n\n\n// General\n\n#include \"M2_Animation.h\"\n\n\n\nCM2_Animation::CM2_Animation(const CM2& M2Model, const SM2_Sequence& Sequence, std::string AnimationName, uint16 IndexIntoSeq)\n\n\t: m_AnimID((EAnimationID)Sequence.__animID)\n\n\t, m_AnimationName(AnimationName + \"_\" + std::to_string(IndexIntoSeq))\n\n\t, m_SequenceIndex(IndexIntoSeq)\n\n#if WOW_CLIENT_VERSION <= WOW_BC_2_4_3\n\n\t, m_StartTimeStamp(Sequence.start_timestamp)\n\n , m_EndTimeStamp(Sequence.end_timestamp)\n\n#else\n\n\t, m_Duration(Sequence.duration)\n\n#endif\n\n{\n\n\tif (Sequence.variationNext != -1)\n","file_path":"owGame/M2/M2_Animation.cpp","rank":83,"score":13.811921717620134},{"content":"}\n\n\n\nbool CWMO_Base_Instance::IsDoodadInSet(uint16 doodadIndex) const\n\n{\n\n\tif (GetWMO().IsDoodadInSet(0, doodadIndex))\n\n\t\treturn true;\n\n\n\n\tif (GetDoodadSetIndex() != 0)\n\n\t\treturn GetWMO().IsDoodadInSet(GetDoodadSetIndex(), doodadIndex);\n\n\n\n\treturn false;\n\n}\n\n\n\n\n\n\n\n//\n\n// ISceneNode\n\n//\n\nvoid CWMO_Base_Instance::Initialize()\n\n{\n","file_path":"owGame/WMO/WMO_Base_Instance.cpp","rank":84,"score":13.767590745128237},{"content":"void CWorldServer::AddHandler(Opcodes Opcode, std::function<void(CServerPacket&)> Handler)\n\n{\n\n\t_ASSERT(Handler != nullptr);\n\n\tm_Handlers.insert(std::make_pair(Opcode, Handler));\n\n}\n\n\n\nbool CWorldServer::ProcessPacket(CServerPacket& ServerPacket)\n\n{\n\n\tconst auto& handler = m_Handlers.find(ServerPacket.GetPacketOpcode());\n\n\tif (handler != m_Handlers.end())\n\n\t{\n\n\t\t_ASSERT(handler->second != nullptr);\n\n\t\t(handler->second).operator()(ServerPacket);\n\n\n\n\t\tif (ServerPacket.getPos() != ServerPacket.getSize())\n\n\t\t\tthrow CException(\"CWorldServer::ProcessPacket: Packet '%d' is not fully readed. %d of %d.\", ServerPacket.GetPacketOpcode(), ServerPacket.getPos(), ServerPacket.getSize());\n\n\n\n\t\treturn true;\n\n\t}\n\n\n","file_path":"owClient/World/WorldServer.cpp","rank":85,"score":13.725974297212709},{"content":"\t\t}\n\n\t}\n\n}\n\n\n\nMinimapDir* CMinimapProvider::getMinimap(std::string _name)\n\n{\n\n\tfor (auto& it : m_Minimaps)\n\n\t{\n\n\t\tif (it->name == _name)\n\n\t\t{\n\n\t\t\treturn it;\n\n\t\t}\n\n\t}\n\n\t\n\n\treturn nullptr;\n\n}\n\n\n\nvoid MinimapDir::Load()\n\n{\n\n\t/*for (auto& it : data)\n","file_path":"owGame/Map/MinimapProvider.cpp","rank":86,"score":13.623692228570713},{"content":"\tvoid Update(const UpdateEventArgs& e) override;\n\n\n\nprotected:\n\n\tconst CM2_Base_Instance& GetM2OwnerNode() const;\n\n\n\nprivate:\n\n\tstd::unordered_map<uint16, std::shared_ptr<CM2_Animation>>\tm_Animations;\n\n\n\n\tEAnimationID m_CurrentAnimationID;\n\n\tconst CM2_Animation*\t\tm_CurrentAnimation;\n\n\n\n\tbool\t\t\t\t\t\tm_IsLoop;\n\n\tbool\t\t\t\t\t\tm_IsStopped;\n\n\n\n\tstd::weak_ptr<IM2AnimationEventsListener> m_M2AnimationEventListener;\n\n\n\n\tdouble\t\t\t\t\t\tm_AnimTime;\n\n\tuint32\t\t\t\t\t\tm_CurrentTime;\n\n};\n","file_path":"owGame/M2/M2_AnimatorComponent.h","rank":87,"score":13.088700064197528},{"content":"#include \"stdafx.h\"\n\n\n\n // General\n\n#include \"AuthCrypt.h\"\n\n\n\n // Additional\n\n#include \"HMACSHA1.h\"\n\n\n\n#if WOW_CLIENT_VERSION < WOW_WOTLK_3_3_5\n\n\n\nAuthCrypt::AuthCrypt()\n\n{\n\n _initialized = false;\n\n}\n\n\n\nvoid AuthCrypt::Init()\n\n{\n\n _send_i = _send_j = _recv_i = _recv_j = 0;\n\n _initialized = true;\n\n}\n","file_path":"owClient/AuthSocket/Cryptography/AuthCrypt.cpp","rank":88,"score":13.05176087623277},{"content":"#include \"stdafx.h\"\n\n\n\n// General\n\n#include \"WDBCreatureCache.h\"\n\n\n\nCowWDBCreatureCache::CowWDBCreatureCache(IFilesManager * FilesManager)\n\n\t: CowWDBFile(FilesManager, \"creaturecache.wdb\")\n\n{\n\n\tauto file = LoadFile();\n\n\tif (file == nullptr)\n\n\t{\n\n\t\tLog::Warn(\"CowWDBCreatureCache:: File '%s' not found.\", m_FileName.c_str());\n\n\t}\n\n\n\n\twhile (false == file->isEof())\n\n\t{\n\n\t\tuint32 entry;\n\n\t\tfile->read(&entry);\n\n\n\n\t\tuint32 entrySize;\n","file_path":"owClient/Client/WDB/WDBCreatureCache.cpp","rank":89,"score":13.037761915916448},{"content":"#include \"stdafx.h\"\n\n\n\n// General\n\n#include \"WDBItemCache.h\"\n\n\n\nCowWDBItemCache::CowWDBItemCache(IFilesManager * FilesManager)\n\n\t: CowWDBFile(FilesManager, \"itemcache.wdb\")\n\n{\n\n\tauto file = LoadFile();\n\n\tif (file == nullptr)\n\n\t{\n\n\t\tLog::Warn(\"CowWDBItemCache:: File '%s' not found.\", m_FileName.c_str());\n\n\t}\n\n\n\n\twhile (false == file->isEof())\n\n\t{\n\n\t\tuint32 entry;\n\n\t\tfile->read(&entry);\n\n\n\n\t\tuint32 entrySize;\n","file_path":"owClient/Client/WDB/WDBItemCache.cpp","rank":90,"score":13.037761915916448},{"content":"\t}\n\n\n\n\t// kill stuff from the end\n\n\tfloat l = 0;\n\n\tbool erasemode = false;\n\n\tfor (auto it = m_Segments.begin(); it != m_Segments.end(); )\n\n\t{\n\n\t\tif (!erasemode)\n\n\t\t{\n\n\t\t\tl += it->len;\n\n\t\t\tif (l > length)\n\n\t\t\t{\n\n\t\t\t\tit->len = l - length;\n\n\t\t\t\terasemode = true;\n\n\t\t\t}\n\n\t\t\t++it;\n\n\t\t}\n\n\t\telse\n\n\t\t{\n\n\t\t\tm_Segments.erase(it++);\n","file_path":"owGame/M2/M2_RibbonEmitters.cpp","rank":91,"score":12.880766528519281},{"content":"","file_path":"owClient/AuthSocket/AuthSocket.cpp","rank":92,"score":12.772791024735021},{"content":"\tm_Targets.Initialize(M2Camera.target_position, ByteBuffer, M2Object.getSkeleton().GetAnimFiles(), Fix_From_XZmY_To_XYZ);\n\n\tm_Rolls.Initialize(M2Camera.roll, ByteBuffer, M2Object.getSkeleton().GetAnimFiles());\n\n}\n\n\n\nCM2_Part_Camera::~CM2_Part_Camera()\n\n{\n\n}\n\n\n\nbool CM2_Part_Camera::Calculate(const CM2_Base_Instance& M2Instance, uint32 globalTime, float AspectRatio, const glm::mat4& OriginMatrix, glm::vec3 * Position, glm::vec3 * Direction, glm::mat4 * Projection, glm::mat4 * View) const\n\n{\n\n\tconst auto& animator = M2Instance.GetAnimatorComponent();\n\n\tif (animator == nullptr)\n\n\t\treturn false;\n\n\n\n\tglm::vec3 position = m_PositionBase;\n\n\tif (m_Positions.IsUsesBySequence(animator->getSequenceIndex()))\n\n\t\tposition += m_Positions.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), globalTime, true);\n\n\tposition = OriginMatrix * glm::vec4(position, 1.0f);\n\n\t*Position = position;\n\n\n","file_path":"owGame/M2/M2_Part_Camera.cpp","rank":93,"score":12.749172517017621},{"content":"#include \"stdafx.h\"\n\n\n\n// General\n\n#include \"WDBGameObjectCache.h\"\n\n\n\nCowWDBGameObjectCache::CowWDBGameObjectCache(IFilesManager * FilesManager)\n\n\t: CowWDBFile(FilesManager, \"gameobjectcache.wdb\")\n\n{\n\n\tauto file = LoadFile();\n\n\tif (file == nullptr)\n\n\t{\n\n\t\tLog::Warn(\"CowWDBGameObjectCache:: File '%s' not found.\", m_FileName.c_str());\n\n\t}\n\n\n\n\twhile (false == file->isEof())\n\n\t{\n\n\t\tuint32 entry;\n\n\t\tfile->read(&entry);\n\n\n\n\t\tuint32 entrySize;\n","file_path":"owClient/Client/WDB/WDBGameObjectCache.cpp","rank":94,"score":12.625567202353478},{"content":"CWorldSocket::~CWorldSocket()\n\n{\n\n\tDisconnect();\n\n\n\n\tm_UpdateThreadExiter.set_value();\n\n\t//while (false == m_UpdateThread.joinable());\n\n\t//m_UpdateThread.join();\n\n}\n\n\n\nvoid CWorldSocket::Open(std::string Host, uint16 Port)\n\n{\n\n\tif (false == Connect(Host, Port))\n\n\t\tthrow CException(\"CWorldSocket: Unable to connect to '%s:%d'\", Host.c_str(), Port);\n\n\n\n\tSetBlocking(true);\n\n}\n\n\n\nvoid CWorldSocket::Update()\n\n{\n\n\twhile (const auto& packet = m_PacketsQueue.GetNextItem())\n","file_path":"owClient/WorldSocket/WorldSocket.cpp","rank":95,"score":12.593837785289615},{"content":"}\n\n\n\n\n\n\n\n//\n\n// CM2_Base_Instance\n\n//\n\nbool CMapM2Instance::IsInstansingEnabled() const\n\n{\n\n\treturn true;\n\n}\n\n\n\n\n\n\n\n//\n\n// ISceneNode\n\n//\n\nvoid CMapM2Instance::Initialize()\n\n{\n\n\t__super::Initialize();\n","file_path":"owGame/Map/Instances/MapM2Instance.cpp","rank":96,"score":12.541153021974955},{"content":"\t\tcollisonIndexBuffer = m_RenderDevice.GetObjectsFactory().CreateIndexBuffer(collisionTrianglesArray);\n\n\t}\n\n\n\n\tif (collisonVertexBuffer != nullptr && collisonIndexBuffer != nullptr)\n\n\t{\n\n\t\tauto collisionGeometry = GetRenderDevice().GetObjectsFactory().CreateGeometry();\n\n\t\tcollisionGeometry->SetVertexBuffer(collisonVertexBuffer);\n\n\t\tcollisionGeometry->SetIndexBuffer(collisonIndexBuffer);\n\n\t\tm_CollisionGeom = collisionGeometry;\n\n\t}\n\n\telse\n\n\t{\n\n\t\tm_CollisionGeom = nullptr;\n\n\t}\n\n#endif\n\n\n\n\tm_IsAnimated = getSkeleton().isAnimBones() || getSkeleton().isBillboard() || getMaterials().IsAnimTextures() || getMiscellaneous().IsAnimated() || true;\n\n\t_ASSERT(m_Bytes.use_count() == 1);\n\n\tm_Bytes.reset();\n\n\n\n\treturn true;\n\n}\n\n\n\nbool CM2::Delete()\n\n{\n\n\treturn false;\n\n}\n","file_path":"owGame/M2/M2.cpp","rank":97,"score":12.534620813200263},{"content":"\n\nvoid CWorldSocket::OnDisconnected()\n\n{\n\n\tLog::Warn(\"CWorldSocket::OnDisconnected.\");\n\n}\n\n\n\nvoid CWorldSocket::SendPacket(CClientPacket& Packet)\n\n{\n\n Packet.Complete();\n\n\n\n m_WoWCryptoUtils.EncryptSend(Packet.getDataEx(), sizeof(uint16) /*Size*/ + sizeof(uint32) /*Opcode*/);\n\n\n\n Send(Packet.getDataEx(), Packet.getSize());\n\n}\n\n\n\nvoid CWorldSocket::SetExternalHandler(std::function<bool(CServerPacket&)> Handler)\n\n{\n\n\t_ASSERT(Handler != nullptr);\n\n\tm_ExternalHandler = Handler;\n\n}\n","file_path":"owClient/WorldSocket/WorldSocket.cpp","rank":98,"score":12.50950048003238},{"content":"#include \"stdafx.h\"\n\n\n\n// Include\n\n#include \"M2.h\"\n\n#include \"M2_Base_Instance.h\"\n\n\n\n// General\n\n#include \"M2_Part_TextureWeight.h\"\n\n\n\nCM2_Part_TextureWeight::CM2_Part_TextureWeight(const CM2& M2Object, const std::shared_ptr<IByteBuffer>& File, const SM2_TextureWeight& M2TextureWeight)\n\n\t: m_M2Object(M2Object)\n\n{\n\n\tm_WeightAnimated.Initialize(M2TextureWeight.weight, File, M2Object.getSkeleton().GetAnimFiles());\n\n}\n\n\n\nCM2_Part_TextureWeight::~CM2_Part_TextureWeight()\n\n{\n\n}\n\n\n\nfloat CM2_Part_TextureWeight::GetWeight(const CM2_Base_Instance* M2Instance, uint32 GlobalTime) const\n\n{\n\n\tif (const auto& animator = M2Instance->GetAnimatorComponent())\n\n\t\tif (m_WeightAnimated.IsUsesBySequence(animator->getSequenceIndex()))\n\n\t\t\treturn m_WeightAnimated.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), GlobalTime);\n\n\treturn 1.0f;\n\n}\n","file_path":"owGame/M2/M2_Part_TextureWeight.cpp","rank":99,"score":12.25106216636241}],"string":"[\n {\n \"content\": \"enum Opcodes : uint16\\n\\n{\\n\\n\\tNULL_ACTION = 0x000,\\n\\n\\tCMSG_BOOTME = 0x001,\\n\\n\\tCMSG_DBLOOKUP = 0x002,\\n\\n\\tSMSG_DBLOOKUP = 0x003,\\n\\n\\tCMSG_QUERY_OBJECT_POSITION = 0x004,\\n\\n\\tSMSG_QUERY_OBJECT_POSITION = 0x005,\\n\\n\\tCMSG_QUERY_OBJECT_ROTATION = 0x006,\\n\\n\\tSMSG_QUERY_OBJECT_ROTATION = 0x007,\\n\\n\\tCMSG_WORLD_TELEPORT = 0x008,\\n\\n\\tCMSG_TELEPORT_TO_UNIT = 0x009,\\n\\n\\tCMSG_ZONE_MAP = 0x00A,\\n\\n\\tSMSG_ZONE_MAP = 0x00B,\\n\\n\\tCMSG_DEBUG_CHANGECELLZONE = 0x00C,\\n\\n\\tCMSG_MOVE_CHARACTER_CHEAT = 0x00D,\\n\\n\\tSMSG_MOVE_CHARACTER_CHEAT = 0x00E,\\n\\n\\tCMSG_RECHARGE = 0x00F,\\n\\n\\tCMSG_LEARN_SPELL = 0x010,\\n\\n\\tCMSG_CREATEMONSTER = 0x011,\\n\\n\\tCMSG_DESTROYMONSTER = 0x012,\\n\\n\\tCMSG_CREATEITEM = 0x013,\\n\\n\\tCMSG_CREATEGAMEOBJECT = 0x014,\\n\\n\\tSMSG_CHECK_FOR_BOTS = 0x015,\\n\\n\\tCMSG_MAKEMONSTERATTACKGUID = 0x016,\\n\\n\\tCMSG_BOT_DETECTED2 = 0x017,\\n\\n\\tCMSG_FORCEACTION = 0x018,\\n\\n\\tCMSG_FORCEACTIONONOTHER = 0x019,\\n\\n\\tCMSG_FORCEACTIONSHOW = 0x01A,\\n\\n\\tSMSG_FORCEACTIONSHOW = 0x01B,\\n\\n\\tCMSG_PETGODMODE = 0x01C,\\n\\n\\tSMSG_PETGODMODE = 0x01D,\\n\\n\\tSMSG_REFER_A_FRIEND_EXPIRED = 0x01E,\\n\\n\\tCMSG_WEATHER_SPEED_CHEAT = 0x01F,\\n\\n\\tCMSG_UNDRESSPLAYER = 0x020,\\n\\n\\tCMSG_BEASTMASTER = 0x021,\\n\\n\\tCMSG_GODMODE = 0x022,\\n\\n\\tSMSG_GODMODE = 0x023,\\n\\n\\tCMSG_CHEAT_SETMONEY = 0x024,\\n\\n\\tCMSG_LEVEL_CHEAT = 0x025,\\n\\n\\tCMSG_PET_LEVEL_CHEAT = 0x026,\\n\\n\\tCMSG_SET_WORLDSTATE = 0x027,\\n\\n\\tCMSG_COOLDOWN_CHEAT = 0x028,\\n\\n\\tCMSG_USE_SKILL_CHEAT = 0x029,\\n\\n\\tCMSG_FLAG_QUEST = 0x02A,\\n\\n\\tCMSG_FLAG_QUEST_FINISH = 0x02B,\\n\\n\\tCMSG_CLEAR_QUEST = 0x02C,\\n\\n\\tCMSG_SEND_EVENT = 0x02D,\\n\\n\\tCMSG_DEBUG_AISTATE = 0x02E,\\n\\n\\tSMSG_DEBUG_AISTATE = 0x02F,\\n\\n\\tCMSG_DISABLE_PVP_CHEAT = 0x030,\\n\\n\\tCMSG_ADVANCE_SPAWN_TIME = 0x031,\\n\\n\\tSMSG_DESTRUCTIBLE_BUILDING_DAMAGE = 0x032,\\n\\n\\tCMSG_AUTH_SRP6_BEGIN = 0x033,\\n\\n\\tCMSG_AUTH_SRP6_PROOF = 0x034,\\n\\n\\tCMSG_AUTH_SRP6_RECODE = 0x035,\\n\\n\\tCMSG_CHAR_CREATE = 0x036,\\n\\n\\tCMSG_CHAR_ENUM = 0x037,\\n\\n\\tCMSG_CHAR_DELETE = 0x038,\\n\\n\\tSMSG_AUTH_SRP6_RESPONSE = 0x039,\\n\\n\\tSMSG_CHAR_CREATE = 0x03A,\\n\\n\\tSMSG_CHAR_ENUM = 0x03B,\\n\\n\\tSMSG_CHAR_DELETE = 0x03C,\\n\\n\\tCMSG_PLAYER_LOGIN = 0x03D,\\n\\n\\tSMSG_NEW_WORLD = 0x03E,\\n\\n\\tSMSG_TRANSFER_PENDING = 0x03F,\\n\\n\\tSMSG_TRANSFER_ABORTED = 0x040,\\n\\n\\tSMSG_CHARACTER_LOGIN_FAILED = 0x041,\\n\\n\\tSMSG_LOGIN_SET_TIME_SPEED = 0x042,\\n\\n\\tSMSG_GAMETIME_UPDATE = 0x043,\\n\\n\\tCMSG_GAMETIME_SET = 0x044,\\n\\n\\tSMSG_GAMETIME_SET = 0x045,\\n\\n\\tCMSG_GAMESPEED_SET = 0x046,\\n\\n\\tSMSG_GAMESPEED_SET = 0x047,\\n\\n\\tCMSG_SERVERTIME = 0x048,\\n\\n\\tSMSG_SERVERTIME = 0x049,\\n\\n\\tCMSG_PLAYER_LOGOUT = 0x04A,\\n\\n\\tCMSG_LOGOUT_REQUEST = 0x04B,\\n\\n\\tSMSG_LOGOUT_RESPONSE = 0x04C,\\n\\n\\tSMSG_LOGOUT_COMPLETE = 0x04D,\\n\\n\\tCMSG_LOGOUT_CANCEL = 0x04E,\\n\\n\\tSMSG_LOGOUT_CANCEL_ACK = 0x04F,\\n\\n\\tCMSG_NAME_QUERY = 0x050,\\n\\n\\tSMSG_NAME_QUERY_RESPONSE = 0x051,\\n\\n\\tCMSG_PET_NAME_QUERY = 0x052,\\n\\n\\tSMSG_PET_NAME_QUERY_RESPONSE = 0x053,\\n\\n\\tCMSG_GUILD_QUERY = 0x054,\\n\\n\\tSMSG_GUILD_QUERY_RESPONSE = 0x055,\\n\\n\\tCMSG_ITEM_QUERY_SINGLE = 0x056,\\n\\n\\tCMSG_ITEM_QUERY_MULTIPLE = 0x057,\\n\\n\\tSMSG_ITEM_QUERY_SINGLE_RESPONSE = 0x058,\\n\\n\\tSMSG_ITEM_QUERY_MULTIPLE_RESPONSE = 0x059,\\n\\n\\tCMSG_PAGE_TEXT_QUERY = 0x05A,\\n\\n\\tSMSG_PAGE_TEXT_QUERY_RESPONSE = 0x05B,\\n\\n\\tCMSG_QUEST_QUERY = 0x05C,\\n\\n\\tSMSG_QUEST_QUERY_RESPONSE = 0x05D,\\n\\n\\tCMSG_GAMEOBJECT_QUERY = 0x05E,\\n\\n\\tSMSG_GAMEOBJECT_QUERY_RESPONSE = 0x05F,\\n\\n\\tCMSG_CREATURE_QUERY = 0x060,\\n\\n\\tSMSG_CREATURE_QUERY_RESPONSE = 0x061,\\n\\n\\tCMSG_WHO = 0x062,\\n\\n\\tSMSG_WHO = 0x063,\\n\\n\\tCMSG_WHOIS = 0x064,\\n\\n\\tSMSG_WHOIS = 0x065,\\n\\n\\tCMSG_CONTACT_LIST = 0x066,\\n\\n\\tSMSG_CONTACT_LIST = 0x067,\\n\\n\\tSMSG_FRIEND_STATUS = 0x068,\\n\\n\\tCMSG_ADD_FRIEND = 0x069,\\n\\n\\tCMSG_DEL_FRIEND = 0x06A,\\n\\n\\tCMSG_SET_CONTACT_NOTES = 0x06B,\\n\\n\\tCMSG_ADD_IGNORE = 0x06C,\\n\\n\\tCMSG_DEL_IGNORE = 0x06D,\\n\\n\\tCMSG_GROUP_INVITE = 0x06E,\\n\\n\\tSMSG_GROUP_INVITE = 0x06F,\\n\\n\\tCMSG_GROUP_CANCEL = 0x070,\\n\\n\\tSMSG_GROUP_CANCEL = 0x071,\\n\\n\\tCMSG_GROUP_ACCEPT = 0x072,\\n\\n\\tCMSG_GROUP_DECLINE = 0x073,\\n\\n\\tSMSG_GROUP_DECLINE = 0x074,\\n\\n\\tCMSG_GROUP_UNINVITE = 0x075,\\n\\n\\tCMSG_GROUP_UNINVITE_GUID = 0x076,\\n\\n\\tSMSG_GROUP_UNINVITE = 0x077,\\n\\n\\tCMSG_GROUP_SET_LEADER = 0x078,\\n\\n\\tSMSG_GROUP_SET_LEADER = 0x079,\\n\\n\\tCMSG_LOOT_METHOD = 0x07A,\\n\\n\\tCMSG_GROUP_DISBAND = 0x07B,\\n\\n\\tSMSG_GROUP_DESTROYED = 0x07C,\\n\\n\\tSMSG_GROUP_LIST = 0x07D,\\n\\n\\tSMSG_PARTY_MEMBER_STATS = 0x07E,\\n\\n\\tSMSG_PARTY_COMMAND_RESULT = 0x07F,\\n\\n\\tUMSG_UPDATE_GROUP_MEMBERS = 0x080,\\n\\n\\tCMSG_GUILD_CREATE = 0x081,\\n\\n\\tCMSG_GUILD_INVITE = 0x082,\\n\\n\\tSMSG_GUILD_INVITE = 0x083,\\n\\n\\tCMSG_GUILD_ACCEPT = 0x084,\\n\\n\\tCMSG_GUILD_DECLINE = 0x085,\\n\\n\\tSMSG_GUILD_DECLINE = 0x086,\\n\\n\\tCMSG_GUILD_INFO = 0x087,\\n\\n\\tSMSG_GUILD_INFO = 0x088,\\n\\n\\tCMSG_GUILD_ROSTER = 0x089,\\n\\n\\tSMSG_GUILD_ROSTER = 0x08A,\\n\\n\\tCMSG_GUILD_PROMOTE = 0x08B,\\n\\n\\tCMSG_GUILD_DEMOTE = 0x08C,\\n\\n\\tCMSG_GUILD_LEAVE = 0x08D,\\n\\n\\tCMSG_GUILD_REMOVE = 0x08E,\\n\\n\\tCMSG_GUILD_DISBAND = 0x08F,\\n\\n\\tCMSG_GUILD_LEADER = 0x090,\\n\\n\\tCMSG_GUILD_MOTD = 0x091,\\n\\n\\tSMSG_GUILD_EVENT = 0x092,\\n\\n\\tSMSG_GUILD_COMMAND_RESULT = 0x093,\\n\\n\\tUMSG_UPDATE_GUILD = 0x094,\\n\\n\\tCMSG_MESSAGECHAT = 0x095,\\n\\n\\tSMSG_MESSAGECHAT = 0x096,\\n\\n\\tCMSG_JOIN_CHANNEL = 0x097,\\n\\n\\tCMSG_LEAVE_CHANNEL = 0x098,\\n\\n\\tSMSG_CHANNEL_NOTIFY = 0x099,\\n\\n\\tCMSG_CHANNEL_LIST = 0x09A,\\n\\n\\tSMSG_CHANNEL_LIST = 0x09B,\\n\\n\\tCMSG_CHANNEL_PASSWORD = 0x09C,\\n\\n\\tCMSG_CHANNEL_SET_OWNER = 0x09D,\\n\\n\\tCMSG_CHANNEL_OWNER = 0x09E,\\n\\n\\tCMSG_CHANNEL_MODERATOR = 0x09F,\\n\\n\\tCMSG_CHANNEL_UNMODERATOR = 0x0A0,\\n\\n\\tCMSG_CHANNEL_MUTE = 0x0A1,\\n\\n\\tCMSG_CHANNEL_UNMUTE = 0x0A2,\\n\\n\\tCMSG_CHANNEL_INVITE = 0x0A3,\\n\\n\\tCMSG_CHANNEL_KICK = 0x0A4,\\n\\n\\tCMSG_CHANNEL_BAN = 0x0A5,\\n\\n\\tCMSG_CHANNEL_UNBAN = 0x0A6,\\n\\n\\tCMSG_CHANNEL_ANNOUNCEMENTS = 0x0A7,\\n\\n\\tCMSG_CHANNEL_MODERATE = 0x0A8,\\n\\n\\tSMSG_UPDATE_OBJECT = 0x0A9,\\n\\n\\tSMSG_DESTROY_OBJECT = 0x0AA,\\n\\n\\tCMSG_USE_ITEM = 0x0AB,\\n\\n\\tCMSG_OPEN_ITEM = 0x0AC,\\n\\n\\tCMSG_READ_ITEM = 0x0AD,\\n\\n\\tSMSG_READ_ITEM_OK = 0x0AE,\\n\\n\\tSMSG_READ_ITEM_FAILED = 0x0AF,\\n\\n\\tSMSG_ITEM_COOLDOWN = 0x0B0,\\n\\n\\tCMSG_GAMEOBJ_USE = 0x0B1,\\n\\n\\tCMSG_DESTROY_ITEMS = 0x0B2,\\n\\n\\tSMSG_GAMEOBJECT_CUSTOM_ANIM = 0x0B3,\\n\\n\\tCMSG_AREATRIGGER = 0x0B4,\\n\\n\\tMSG_MOVE_START_FORWARD = 0x0B5,\\n\\n\\tMSG_MOVE_START_BACKWARD = 0x0B6,\\n\\n\\tMSG_MOVE_STOP = 0x0B7,\\n\\n\\tMSG_MOVE_START_STRAFE_LEFT = 0x0B8,\\n\\n\\tMSG_MOVE_START_STRAFE_RIGHT = 0x0B9,\\n\\n\\tMSG_MOVE_STOP_STRAFE = 0x0BA,\\n\\n\\tMSG_MOVE_JUMP = 0x0BB,\\n\\n\\tMSG_MOVE_START_TURN_LEFT = 0x0BC,\\n\\n\\tMSG_MOVE_START_TURN_RIGHT = 0x0BD,\\n\\n\\tMSG_MOVE_STOP_TURN = 0x0BE,\\n\\n\\tMSG_MOVE_START_PITCH_UP = 0x0BF,\\n\\n\\tMSG_MOVE_START_PITCH_DOWN = 0x0C0,\\n\\n\\tMSG_MOVE_STOP_PITCH = 0x0C1,\\n\\n\\tMSG_MOVE_SET_RUN_MODE = 0x0C2,\\n\\n\\tMSG_MOVE_SET_WALK_MODE = 0x0C3,\\n\\n\\tMSG_MOVE_TOGGLE_LOGGING = 0x0C4,\\n\\n\\tMSG_MOVE_TELEPORT = 0x0C5,\\n\\n\\tMSG_MOVE_TELEPORT_CHEAT = 0x0C6,\\n\\n\\tMSG_MOVE_TELEPORT_ACK = 0x0C7,\\n\\n\\tMSG_MOVE_TOGGLE_FALL_LOGGING = 0x0C8,\\n\\n\\tMSG_MOVE_FALL_LAND = 0x0C9,\\n\\n\\tMSG_MOVE_START_SWIM = 0x0CA,\\n\\n\\tMSG_MOVE_STOP_SWIM = 0x0CB,\\n\\n\\tMSG_MOVE_SET_RUN_SPEED_CHEAT = 0x0CC,\\n\\n\\tMSG_MOVE_SET_RUN_SPEED = 0x0CD,\\n\\n\\tMSG_MOVE_SET_RUN_BACK_SPEED_CHEAT = 0x0CE,\\n\\n\\tMSG_MOVE_SET_RUN_BACK_SPEED = 0x0CF,\\n\\n\\tMSG_MOVE_SET_WALK_SPEED_CHEAT = 0x0D0,\\n\\n\\tMSG_MOVE_SET_WALK_SPEED = 0x0D1,\\n\\n\\tMSG_MOVE_SET_SWIM_SPEED_CHEAT = 0x0D2,\\n\\n\\tMSG_MOVE_SET_SWIM_SPEED = 0x0D3,\\n\\n\\tMSG_MOVE_SET_SWIM_BACK_SPEED_CHEAT = 0x0D4,\\n\\n\\tMSG_MOVE_SET_SWIM_BACK_SPEED = 0x0D5,\\n\\n\\tMSG_MOVE_SET_ALL_SPEED_CHEAT = 0x0D6,\\n\\n\\tMSG_MOVE_SET_TURN_RATE_CHEAT = 0x0D7,\\n\\n\\tMSG_MOVE_SET_TURN_RATE = 0x0D8,\\n\\n\\tMSG_MOVE_TOGGLE_COLLISION_CHEAT = 0x0D9,\\n\\n\\tMSG_MOVE_SET_FACING = 0x0DA,\\n\\n\\tMSG_MOVE_SET_PITCH = 0x0DB,\\n\\n\\tMSG_MOVE_WORLDPORT_ACK = 0x0DC,\\n\\n\\tSMSG_MONSTER_MOVE = 0x0DD,\\n\\n\\tSMSG_MOVE_WATER_WALK = 0x0DE,\\n\\n\\tSMSG_MOVE_LAND_WALK = 0x0DF,\\n\\n\\tCMSG_MOVE_CHARM_PORT_CHEAT = 0x0E0,\\n\\n\\tCMSG_MOVE_SET_RAW_POSITION = 0x0E1,\\n\\n\\tSMSG_FORCE_RUN_SPEED_CHANGE = 0x0E2,\\n\\n\\tCMSG_FORCE_RUN_SPEED_CHANGE_ACK = 0x0E3,\\n\\n\\tSMSG_FORCE_RUN_BACK_SPEED_CHANGE = 0x0E4,\\n\\n\\tCMSG_FORCE_RUN_BACK_SPEED_CHANGE_ACK = 0x0E5,\\n\\n\\tSMSG_FORCE_SWIM_SPEED_CHANGE = 0x0E6,\\n\\n\\tCMSG_FORCE_SWIM_SPEED_CHANGE_ACK = 0x0E7,\\n\\n\\tSMSG_FORCE_MOVE_ROOT = 0x0E8,\\n\\n\\tCMSG_FORCE_MOVE_ROOT_ACK = 0x0E9,\\n\\n\\tSMSG_FORCE_MOVE_UNROOT = 0x0EA,\\n\\n\\tCMSG_FORCE_MOVE_UNROOT_ACK = 0x0EB,\\n\\n\\tMSG_MOVE_ROOT = 0x0EC,\\n\\n\\tMSG_MOVE_UNROOT = 0x0ED,\\n\\n\\tMSG_MOVE_HEARTBEAT = 0x0EE,\\n\\n\\tSMSG_MOVE_KNOCK_BACK = 0x0EF,\\n\\n\\tCMSG_MOVE_KNOCK_BACK_ACK = 0x0F0,\\n\\n\\tMSG_MOVE_KNOCK_BACK = 0x0F1,\\n\\n\\tSMSG_MOVE_FEATHER_FALL = 0x0F2,\\n\\n\\tSMSG_MOVE_NORMAL_FALL = 0x0F3,\\n\\n\\tSMSG_MOVE_SET_HOVER = 0x0F4,\\n\\n\\tSMSG_MOVE_UNSET_HOVER = 0x0F5,\\n\\n\\tCMSG_MOVE_HOVER_ACK = 0x0F6,\\n\\n\\tMSG_MOVE_HOVER = 0x0F7,\\n\\n\\tCMSG_TRIGGER_CINEMATIC_CHEAT = 0x0F8,\\n\\n\\tCMSG_OPENING_CINEMATIC = 0x0F9,\\n\\n\\tSMSG_TRIGGER_CINEMATIC = 0x0FA,\\n\\n\\tCMSG_NEXT_CINEMATIC_CAMERA = 0x0FB,\\n\\n\\tCMSG_COMPLETE_CINEMATIC = 0x0FC,\\n\\n\\tSMSG_TUTORIAL_FLAGS = 0x0FD,\\n\\n\\tCMSG_TUTORIAL_FLAG = 0x0FE,\\n\\n\\tCMSG_TUTORIAL_CLEAR = 0x0FF,\\n\\n\\tCMSG_TUTORIAL_RESET = 0x100,\\n\\n\\tCMSG_STANDSTATECHANGE = 0x101,\\n\\n\\tCMSG_EMOTE = 0x102,\\n\\n\\tSMSG_EMOTE = 0x103,\\n\\n\\tCMSG_TEXT_EMOTE = 0x104,\\n\\n\\tSMSG_TEXT_EMOTE = 0x105,\\n\\n\\tCMSG_AUTOEQUIP_GROUND_ITEM = 0x106,\\n\\n\\tCMSG_AUTOSTORE_GROUND_ITEM = 0x107,\\n\\n\\tCMSG_AUTOSTORE_LOOT_ITEM = 0x108,\\n\\n\\tCMSG_STORE_LOOT_IN_SLOT = 0x109,\\n\\n\\tCMSG_AUTOEQUIP_ITEM = 0x10A,\\n\\n\\tCMSG_AUTOSTORE_BAG_ITEM = 0x10B,\\n\\n\\tCMSG_SWAP_ITEM = 0x10C,\\n\\n\\tCMSG_SWAP_INV_ITEM = 0x10D,\\n\\n\\tCMSG_SPLIT_ITEM = 0x10E,\\n\\n\\tCMSG_AUTOEQUIP_ITEM_SLOT = 0x10F,\\n\\n\\tCMSG_UNCLAIM_LICENSE = 0x110,\\n\\n\\tCMSG_DESTROYITEM = 0x111,\\n\\n\\tSMSG_INVENTORY_CHANGE_FAILURE = 0x112,\\n\\n\\tSMSG_OPEN_CONTAINER = 0x113,\\n\\n\\tCMSG_INSPECT = 0x114,\\n\\n\\tSMSG_INSPECT_RESULTS_UPDATE = 0x115,\\n\\n\\tCMSG_INITIATE_TRADE = 0x116,\\n\\n\\tCMSG_BEGIN_TRADE = 0x117,\\n\\n\\tCMSG_BUSY_TRADE = 0x118,\\n\\n\\tCMSG_IGNORE_TRADE = 0x119,\\n\\n\\tCMSG_ACCEPT_TRADE = 0x11A,\\n\\n\\tCMSG_UNACCEPT_TRADE = 0x11B,\\n\\n\\tCMSG_CANCEL_TRADE = 0x11C,\\n\\n\\tCMSG_SET_TRADE_ITEM = 0x11D,\\n\\n\\tCMSG_CLEAR_TRADE_ITEM = 0x11E,\\n\\n\\tCMSG_SET_TRADE_GOLD = 0x11F,\\n\\n\\tSMSG_TRADE_STATUS = 0x120,\\n\\n\\tSMSG_TRADE_STATUS_EXTENDED = 0x121,\\n\\n\\tSMSG_INITIALIZE_FACTIONS = 0x122,\\n\\n\\tSMSG_SET_FACTION_VISIBLE = 0x123,\\n\\n\\tSMSG_SET_FACTION_STANDING = 0x124,\\n\\n\\tCMSG_SET_FACTION_ATWAR = 0x125,\\n\\n\\tCMSG_SET_FACTION_CHEAT = 0x126,\\n\\n\\tSMSG_SET_PROFICIENCY = 0x127,\\n\\n\\tCMSG_SET_ACTION_BUTTON = 0x128,\\n\\n\\tSMSG_ACTION_BUTTONS = 0x129,\\n\\n\\tSMSG_INITIAL_SPELLS = 0x12A,\\n\\n\\tSMSG_LEARNED_SPELL = 0x12B,\\n\\n\\tSMSG_SUPERCEDED_SPELL = 0x12C,\\n\\n\\tCMSG_NEW_SPELL_SLOT = 0x12D,\\n\\n\\tCMSG_CAST_SPELL = 0x12E,\\n\\n\\tCMSG_CANCEL_CAST = 0x12F,\\n\\n\\tSMSG_CAST_FAILED = 0x130,\\n\\n\\tSMSG_SPELL_START = 0x131,\\n\\n\\tSMSG_SPELL_GO = 0x132,\\n\\n\\tSMSG_SPELL_FAILURE = 0x133,\\n\\n\\tSMSG_SPELL_COOLDOWN = 0x134,\\n\\n\\tSMSG_COOLDOWN_EVENT = 0x135,\\n\\n\\tCMSG_CANCEL_AURA = 0x136,\\n\\n\\tSMSG_EQUIPMENT_SET_SAVED = 0x137,\\n\\n\\tSMSG_PET_CAST_FAILED = 0x138,\\n\\n\\tMSG_CHANNEL_START = 0x139,\\n\\n\\tMSG_CHANNEL_UPDATE = 0x13A,\\n\\n\\tCMSG_CANCEL_CHANNELLING = 0x13B,\\n\\n\\tSMSG_AI_REACTION = 0x13C,\\n\\n\\tCMSG_SET_SELECTION = 0x13D,\\n\\n\\tCMSG_DELETEEQUIPMENT_SET = 0x13E,\\n\\n\\tCMSG_INSTANCE_LOCK_RESPONSE = 0x13F,\\n\\n\\tCMSG_DEBUG_PASSIVE_AURA = 0x140,\\n\\n\\tCMSG_ATTACK_SWING = 0x141,\\n\\n\\tCMSG_ATTACK_STOP = 0x142,\\n\\n\\tSMSG_ATTACK_START = 0x143,\\n\\n\\tSMSG_ATTACK_STOP = 0x144,\\n\\n\\tSMSG_ATTACK_SWING_NOT_IN_RANGE = 0x145,\\n\\n\\tSMSG_ATTACK_SWING_BAD_FACING = 0x146,\\n\\n\\tSMSG_INSTANCE_LOCK_WARNING_QUERY = 0x147,\\n\\n\\tSMSG_ATTACK_SWING_DEAD_TARGET = 0x148,\\n\\n\\tSMSG_ATTACK_SWING_CANT_ATTACK = 0x149,\\n\\n\\tSMSG_ATTACKERSTATEUPDATE = 0x14A,\\n\\n\\tSMSG_BATTLEFIELD_PORT_DENIED = 0x14B,\\n\\n\\tCMSG_PERFORM_ACTION_SET = 0x14C,\\n\\n\\tSMSG_RESUME_CAST_BAR = 0x14D,\\n\\n\\tSMSG_CANCEL_COMBAT = 0x14E,\\n\\n\\tSMSG_SPELLBREAKLOG = 0x14F,\\n\\n\\tSMSG_SPELLHEALLOG = 0x150,\\n\\n\\tSMSG_SPELLENERGIZELOG = 0x151,\\n\\n\\tSMSG_BREAK_TARGET = 0x152,\\n\\n\\tCMSG_SAVE_PLAYER = 0x153,\\n\\n\\tCMSG_SETDEATHBINDPOINT = 0x154,\\n\\n\\tSMSG_BIND_POINT_UPDATE = 0x155,\\n\\n\\tCMSG_GETDEATHBINDZONE = 0x156,\\n\\n\\tSMSG_BINDZONEREPLY = 0x157,\\n\\n\\tSMSG_PLAYER_BOUND = 0x158,\\n\\n\\tSMSG_CLIENT_CONTROL_UPDATE = 0x159,\\n\\n\\tCMSG_REPOP_REQUEST = 0x15A,\\n\\n\\tSMSG_RESURRECT_REQUEST = 0x15B,\\n\\n\\tCMSG_RESURRECT_RESPONSE = 0x15C,\\n\\n\\tCMSG_LOOT = 0x15D,\\n\\n\\tCMSG_LOOT_MONEY = 0x15E,\\n\\n\\tCMSG_LOOT_RELEASE = 0x15F,\\n\\n\\tSMSG_LOOT_RESPONSE = 0x160,\\n\\n\\tSMSG_LOOT_RELEASE_RESPONSE = 0x161,\\n\\n\\tSMSG_LOOT_REMOVED = 0x162,\\n\\n\\tSMSG_LOOT_MONEY_NOTIFY = 0x163,\\n\\n\\tSMSG_LOOT_ITEM_NOTIFY = 0x164,\\n\\n\\tSMSG_LOOT_CLEAR_MONEY = 0x165,\\n\\n\\tSMSG_ITEM_PUSH_RESULT = 0x166,\\n\\n\\tSMSG_DUEL_REQUESTED = 0x167,\\n\\n\\tSMSG_DUEL_OUTOFBOUNDS = 0x168,\\n\\n\\tSMSG_DUEL_INBOUNDS = 0x169,\\n\\n\\tSMSG_DUEL_COMPLETE = 0x16A,\\n\\n\\tSMSG_DUEL_WINNER = 0x16B,\\n\\n\\tCMSG_DUEL_ACCEPTED = 0x16C,\\n\\n\\tCMSG_DUEL_CANCELLED = 0x16D,\\n\\n\\tSMSG_MOUNTRESULT = 0x16E,\\n\\n\\tSMSG_DISMOUNTRESULT = 0x16F,\\n\\n\\tSMSG_REMOVED_FROM_PVP_QUEUE = 0x170,\\n\\n\\tCMSG_MOUNTSPECIAL_ANIM = 0x171,\\n\\n\\tSMSG_MOUNTSPECIAL_ANIM = 0x172,\\n\\n\\tSMSG_PET_TAME_FAILURE = 0x173,\\n\\n\\tCMSG_PET_SET_ACTION = 0x174,\\n\\n\\tCMSG_PET_ACTION = 0x175,\\n\\n\\tCMSG_PET_ABANDON = 0x176,\\n\\n\\tCMSG_PET_RENAME = 0x177,\\n\\n\\tSMSG_PET_NAME_INVALID = 0x178,\\n\\n\\tSMSG_PET_SPELLS = 0x179,\\n\\n\\tSMSG_PET_MODE = 0x17A,\\n\\n\\tCMSG_GOSSIP_HELLO = 0x17B,\\n\\n\\tCMSG_GOSSIP_SELECT_OPTION = 0x17C,\\n\\n\\tSMSG_GOSSIP_MESSAGE = 0x17D,\\n\\n\\tSMSG_GOSSIP_COMPLETE = 0x17E,\\n\\n\\tCMSG_NPC_TEXT_QUERY = 0x17F,\\n\\n\\tSMSG_NPC_TEXT_UPDATE = 0x180,\\n\\n\\tSMSG_NPC_WONT_TALK = 0x181,\\n\\n\\tCMSG_QUESTGIVER_STATUS_QUERY = 0x182,\\n\\n\\tSMSG_QUESTGIVER_STATUS = 0x183,\\n\\n\\tCMSG_QUESTGIVER_HELLO = 0x184,\\n\\n\\tSMSG_QUESTGIVER_QUEST_LIST = 0x185,\\n\\n\\tCMSG_QUESTGIVER_QUERY_QUEST = 0x186,\\n\\n\\tCMSG_QUESTGIVER_QUEST_AUTOLAUNCH = 0x187,\\n\\n\\tSMSG_QUESTGIVER_QUEST_DETAILS = 0x188,\\n\\n\\tCMSG_QUESTGIVER_ACCEPT_QUEST = 0x189,\\n\\n\\tCMSG_QUESTGIVER_COMPLETE_QUEST = 0x18A,\\n\\n\\tSMSG_QUESTGIVER_REQUEST_ITEMS = 0x18B,\\n\\n\\tCMSG_QUESTGIVER_REQUEST_REWARD = 0x18C,\\n\\n\\tSMSG_QUESTGIVER_OFFER_REWARD = 0x18D,\\n\\n\\tCMSG_QUESTGIVER_CHOOSE_REWARD = 0x18E,\\n\\n\\tSMSG_QUESTGIVER_QUEST_INVALID = 0x18F,\\n\\n\\tCMSG_QUESTGIVER_CANCEL = 0x190,\\n\\n\\tSMSG_QUESTGIVER_QUEST_COMPLETE = 0x191,\\n\\n\\tSMSG_QUESTGIVER_QUEST_FAILED = 0x192,\\n\\n\\tCMSG_QUESTLOG_SWAP_QUEST = 0x193,\\n\\n\\tCMSG_QUESTLOG_REMOVE_QUEST = 0x194,\\n\\n\\tSMSG_QUESTLOG_FULL = 0x195,\\n\\n\\tSMSG_QUESTUPDATE_FAILED = 0x196,\\n\\n\\tSMSG_QUESTUPDATE_FAILEDTIMER = 0x197,\\n\\n\\tSMSG_QUESTUPDATE_COMPLETE = 0x198,\\n\\n\\tSMSG_QUESTUPDATE_ADD_KILL = 0x199,\\n\\n\\tSMSG_QUESTUPDATE_ADD_ITEM = 0x19A,\\n\\n\\tCMSG_QUEST_CONFIRM_ACCEPT = 0x19B,\\n\\n\\tSMSG_QUEST_CONFIRM_ACCEPT = 0x19C,\\n\\n\\tCMSG_PUSHQUESTTOPARTY = 0x19D,\\n\\n\\tCMSG_LIST_INVENTORY = 0x19E,\\n\\n\\tSMSG_LIST_INVENTORY = 0x19F,\\n\\n\\tCMSG_SELL_ITEM = 0x1A0,\\n\\n\\tSMSG_SELL_ITEM = 0x1A1,\\n\\n\\tCMSG_BUY_ITEM = 0x1A2,\\n\\n\\tCMSG_BUY_ITEM_IN_SLOT = 0x1A3,\\n\\n\\tSMSG_BUY_ITEM = 0x1A4,\\n\\n\\tSMSG_BUY_FAILED = 0x1A5,\\n\\n\\tCMSG_TAXICLEARALLNODES = 0x1A6,\\n\\n\\tCMSG_TAXIENABLEALLNODES = 0x1A7,\\n\\n\\tCMSG_TAXISHOWNODES = 0x1A8,\\n\\n\\tSMSG_SHOWTAXINODES = 0x1A9,\\n\\n\\tCMSG_TAXINODE_STATUS_QUERY = 0x1AA,\\n\\n\\tSMSG_TAXINODE_STATUS = 0x1AB,\\n\\n\\tCMSG_TAXIQUERYAVAILABLENODES = 0x1AC,\\n\\n\\tCMSG_ACTIVATETAXI = 0x1AD,\\n\\n\\tSMSG_ACTIVATETAXIREPLY = 0x1AE,\\n\\n\\tSMSG_NEW_TAXI_PATH = 0x1AF,\\n\\n\\tCMSG_TRAINER_LIST = 0x1B0,\\n\\n\\tSMSG_TRAINER_LIST = 0x1B1,\\n\\n\\tCMSG_TRAINER_BUY_SPELL = 0x1B2,\\n\\n\\tSMSG_TRAINER_BUY_SUCCEEDED = 0x1B3,\\n\\n\\tSMSG_TRAINER_BUY_FAILED = 0x1B4,\\n\\n\\tCMSG_BINDER_ACTIVATE = 0x1B5,\\n\\n\\tSMSG_PLAYERBINDERROR = 0x1B6,\\n\\n\\tCMSG_BANKER_ACTIVATE = 0x1B7,\\n\\n\\tSMSG_SHOW_BANK = 0x1B8,\\n\\n\\tCMSG_BUY_BANK_SLOT = 0x1B9,\\n\\n\\tSMSG_BUY_BANK_SLOT_RESULT = 0x1BA,\\n\\n\\tCMSG_PETITION_SHOWLIST = 0x1BB,\\n\\n\\tSMSG_PETITION_SHOWLIST = 0x1BC,\\n\\n\\tCMSG_PETITION_BUY = 0x1BD,\\n\\n\\tCMSG_PETITION_SHOW_SIGNATURES = 0x1BE,\\n\\n\\tSMSG_PETITION_SHOW_SIGNATURES = 0x1BF,\\n\\n\\tCMSG_PETITION_SIGN = 0x1C0,\\n\\n\\tSMSG_PETITION_SIGN_RESULTS = 0x1C1,\\n\\n\\tMSG_PETITION_DECLINE = 0x1C2,\\n\\n\\tCMSG_OFFER_PETITION = 0x1C3,\\n\\n\\tCMSG_TURN_IN_PETITION = 0x1C4,\\n\\n\\tSMSG_TURN_IN_PETITION_RESULTS = 0x1C5,\\n\\n\\tCMSG_PETITION_QUERY = 0x1C6,\\n\\n\\tSMSG_PETITION_QUERY_RESPONSE = 0x1C7,\\n\\n\\tSMSG_FISH_NOT_HOOKED = 0x1C8,\\n\\n\\tSMSG_FISH_ESCAPED = 0x1C9,\\n\\n\\tCMSG_BUG = 0x1CA,\\n\\n\\tSMSG_NOTIFICATION = 0x1CB,\\n\\n\\tCMSG_PLAYED_TIME = 0x1CC,\\n\\n\\tSMSG_PLAYED_TIME = 0x1CD,\\n\\n\\tCMSG_QUERY_TIME = 0x1CE,\\n\\n\\tSMSG_QUERY_TIME_RESPONSE = 0x1CF,\\n\\n\\tSMSG_LOG_XPGAIN = 0x1D0,\\n\\n\\tSMSG_AURACASTLOG = 0x1D1,\\n\\n\\tCMSG_RECLAIM_CORPSE = 0x1D2,\\n\\n\\tCMSG_WRAP_ITEM = 0x1D3,\\n\\n\\tSMSG_LEVELUP_INFO = 0x1D4,\\n\\n\\tMSG_MINIMAP_PING = 0x1D5,\\n\\n\\tSMSG_RESISTLOG = 0x1D6,\\n\\n\\tSMSG_ENCHANTMENTLOG = 0x1D7,\\n\\n\\tCMSG_SET_SKILL_CHEAT = 0x1D8,\\n\\n\\tSMSG_START_MIRROR_TIMER = 0x1D9,\\n\\n\\tSMSG_PAUSE_MIRROR_TIMER = 0x1DA,\\n\\n\\tSMSG_STOP_MIRROR_TIMER = 0x1DB,\\n\\n\\tCMSG_PING = 0x1DC,\\n\\n\\tSMSG_PONG = 0x1DD,\\n\\n\\tSMSG_CLEAR_COOLDOWN = 0x1DE,\\n\\n\\tSMSG_GAMEOBJECT_PAGETEXT = 0x1DF,\\n\\n\\tCMSG_SETSHEATHED = 0x1E0,\\n\\n\\tSMSG_COOLDOWN_CHEAT = 0x1E1,\\n\\n\\tSMSG_SPELL_DELAYED = 0x1E2,\\n\\n\\tCMSG_QUEST_POI_QUERY = 0x1E3,\\n\\n\\tSMSG_QUEST_POI_QUERY_RESPONSE = 0x1E4,\\n\\n\\tCMSG_GHOST = 0x1E5,\\n\\n\\tCMSG_GM_INVIS = 0x1E6,\\n\\n\\tSMSG_INVALID_PROMOTION_CODE = 0x1E7,\\n\\n\\tMSG_GM_BIND_OTHER = 0x1E8,\\n\\n\\tMSG_GM_SUMMON = 0x1E9,\\n\\n\\tSMSG_ITEM_TIME_UPDATE = 0x1EA,\\n\\n\\tSMSG_ITEM_ENCHANT_TIME_UPDATE = 0x1EB,\\n\\n\\tSMSG_AUTH_CHALLENGE = 0x1EC,\\n\\n\\tCMSG_AUTH_SESSION = 0x1ED,\\n\\n\\tSMSG_AUTH_RESPONSE = 0x1EE,\\n\\n\\tMSG_GM_SHOWLABEL = 0x1EF,\\n\\n\\tCMSG_PET_CAST_SPELL = 0x1F0,\\n\\n\\tMSG_SAVE_GUILD_EMBLEM = 0x1F1,\\n\\n\\tMSG_TABARDVENDOR_ACTIVATE = 0x1F2,\\n\\n\\tSMSG_PLAY_SPELL_VISUAL = 0x1F3,\\n\\n\\tCMSG_ZONEUPDATE = 0x1F4,\\n\\n\\tSMSG_PARTYKILLLOG = 0x1F5,\\n\\n\\tSMSG_COMPRESSED_UPDATE_OBJECT = 0x1F6,\\n\\n\\tSMSG_PLAY_SPELL_IMPACT = 0x1F7,\\n\\n\\tSMSG_EXPLORATION_EXPERIENCE = 0x1F8,\\n\\n\\tCMSG_GM_SET_SECURITY_GROUP = 0x1F9,\\n\\n\\tCMSG_GM_NUKE = 0x1FA,\\n\\n\\tMSG_RANDOM_ROLL = 0x1FB,\\n\\n\\tSMSG_ENVIRONMENTALDAMAGELOG = 0x1FC,\\n\\n\\tCMSG_CHANGEPLAYER_DIFFICULTY = 0x1FD,\\n\\n\\tSMSG_RWHOIS = 0x1FE,\\n\\n\\tSMSG_LFG_PLAYER_REWARD = 0x1FF, // uint32, uint8, uint32, uint32, uint32, uint32, uint32, uint8, for (uint8) {uint32, uint32, uint32}\\n\\n\\tSMSG_LFG_TELEPORT_DENIED = 0x200, // uint32 (1, 2, 4, 6;0, 5, 7)\\n\\n\\tCMSG_UNLEARN_SPELL = 0x201,\\n\\n\\tCMSG_UNLEARN_SKILL = 0x202,\\n\\n\\tSMSG_REMOVED_SPELL = 0x203,\\n\\n\\tCMSG_DECHARGE = 0x204,\\n\\n\\tCMSG_GMTICKET_CREATE = 0x205,\\n\\n\\tSMSG_GMTICKET_CREATE = 0x206,\\n\\n\\tCMSG_GMTICKET_UPDATETEXT = 0x207,\\n\\n\\tSMSG_GMTICKET_UPDATETEXT = 0x208,\\n\\n\\tSMSG_ACCOUNT_DATA_TIMES = 0x209,\\n\\n\\tCMSG_REQUEST_ACCOUNT_DATA = 0x20A,\\n\\n\\tCMSG_UPDATE_ACCOUNT_DATA = 0x20B,\\n\\n\\tSMSG_UPDATE_ACCOUNT_DATA = 0x20C,\\n\\n\\tSMSG_CLEAR_FAR_SIGHT_IMMEDIATE = 0x20D,\\n\\n\\tSMSG_CHANGEPLAYER_DIFFICULTY_RESULT = 0x20E,\\n\\n\\tCMSG_GM_TEACH = 0x20F,\\n\\n\\tCMSG_GM_CREATE_ITEM_TARGET = 0x210,\\n\\n\\tCMSG_GMTICKET_GETTICKET = 0x211,\\n\\n\\tSMSG_GMTICKET_GETTICKET = 0x212,\\n\\n\\tCMSG_UNLEARN_TALENTS = 0x213,\\n\\n\\tSMSG_UPDATE_INSTANCE_ENCOUNTER_UNIT = 0x214,\\n\\n\\tSMSG_GAMEOBJECT_DESPAWN_ANIM = 0x215,\\n\\n\\tMSG_CORPSE_QUERY = 0x216,\\n\\n\\tCMSG_GMTICKET_DELETETICKET = 0x217,\\n\\n\\tSMSG_GMTICKET_DELETETICKET = 0x218,\\n\\n\\tSMSG_CHAT_WRONG_FACTION = 0x219,\\n\\n\\tCMSG_GMTICKET_SYSTEMSTATUS = 0x21A,\\n\\n\\tSMSG_GMTICKET_SYSTEMSTATUS = 0x21B,\\n\\n\\tCMSG_SPIRIT_HEALER_ACTIVATE = 0x21C,\\n\\n\\tCMSG_SET_STAT_CHEAT = 0x21D,\\n\\n\\tSMSG_QUEST_FORCE_REMOVE = 0x21E, // uint32 questid\\n\\n\\tCMSG_SKILL_BUY_STEP = 0x21F,\\n\\n\\tCMSG_SKILL_BUY_RANK = 0x220,\\n\\n\\tCMSG_XP_CHEAT = 0x221,\\n\\n\\tSMSG_SPIRIT_HEALER_CONFIRM = 0x222,\\n\\n\\tCMSG_CHARACTER_POINT_CHEAT = 0x223,\\n\\n\\tSMSG_GOSSIP_POI = 0x224,\\n\\n\\tCMSG_CHAT_IGNORED = 0x225,\\n\\n\\tCMSG_GM_VISION = 0x226,\\n\\n\\tCMSG_SERVER_COMMAND = 0x227,\\n\\n\\tCMSG_GM_SILENCE = 0x228,\\n\\n\\tCMSG_GM_REVEALTO = 0x229,\\n\\n\\tCMSG_GM_RESURRECT = 0x22A,\\n\\n\\tCMSG_GM_SUMMONMOB = 0x22B,\\n\\n\\tCMSG_GM_MOVECORPSE = 0x22C,\\n\\n\\tCMSG_GM_FREEZE = 0x22D,\\n\\n\\tCMSG_GM_UBERINVIS = 0x22E,\\n\\n\\tCMSG_GM_REQUEST_PLAYER_INFO = 0x22F,\\n\\n\\tSMSG_GM_PLAYER_INFO = 0x230,\\n\\n\\tCMSG_GUILD_RANK = 0x231,\\n\\n\\tCMSG_GUILD_ADD_RANK = 0x232,\\n\\n\\tCMSG_GUILD_DEL_RANK = 0x233,\\n\\n\\tCMSG_GUILD_SET_PUBLIC_NOTE = 0x234,\\n\\n\\tCMSG_GUILD_SET_OFFICER_NOTE = 0x235,\\n\\n\\tSMSG_LOGIN_VERIFY_WORLD = 0x236,\\n\\n\\tCMSG_CLEAR_EXPLORATION = 0x237,\\n\\n\\tCMSG_SEND_MAIL = 0x238,\\n\\n\\tSMSG_SEND_MAIL_RESULT = 0x239,\\n\\n\\tCMSG_GET_MAIL_LIST = 0x23A,\\n\\n\\tSMSG_MAIL_LIST_RESULT = 0x23B,\\n\\n\\tCMSG_BATTLEFIELD_LIST = 0x23C,\\n\\n\\tSMSG_BATTLEFIELD_LIST = 0x23D,\\n\\n\\tCMSG_BATTLEFIELD_JOIN = 0x23E,\\n\\n\\tSMSG_FORCE_SET_VEHICLE_REC_ID = 0x23F,\\n\\n\\tCMSG_SET_VEHICLE_REC_ID_ACK = 0x240,\\n\\n\\tCMSG_TAXICLEARNODE = 0x241,\\n\\n\\tCMSG_TAXIENABLENODE = 0x242,\\n\\n\\tCMSG_ITEM_TEXT_QUERY = 0x243,\\n\\n\\tSMSG_ITEM_TEXT_QUERY_RESPONSE = 0x244,\\n\\n\\tCMSG_MAIL_TAKE_MONEY = 0x245,\\n\\n\\tCMSG_MAIL_TAKE_ITEM = 0x246,\\n\\n\\tCMSG_MAIL_MARK_AS_READ = 0x247,\\n\\n\\tCMSG_MAIL_RETURN_TO_SENDER = 0x248,\\n\\n\\tCMSG_MAIL_DELETE = 0x249,\\n\\n\\tCMSG_MAIL_CREATE_TEXT_ITEM = 0x24A,\\n\\n\\tSMSG_SPELLLOGMISS = 0x24B,\\n\\n\\tSMSG_SPELLLOGEXECUTE = 0x24C,\\n\\n\\tSMSG_DEBUGAURAPROC = 0x24D,\\n\\n\\tSMSG_PERIODICAURALOG = 0x24E,\\n\\n\\tSMSG_SPELLDAMAGESHIELD = 0x24F,\\n\\n\\tSMSG_SPELLNONMELEEDAMAGELOG = 0x250,\\n\\n\\tCMSG_LEARN_TALENT = 0x251,\\n\\n\\tSMSG_RESURRECT_FAILED = 0x252,\\n\\n\\tCMSG_TOGGLE_PVP = 0x253,\\n\\n\\tSMSG_ZONE_UNDER_ATTACK = 0x254,\\n\\n\\tMSG_AUCTION_HELLO = 0x255,\\n\\n\\tCMSG_AUCTION_SELL_ITEM = 0x256,\\n\\n\\tCMSG_AUCTION_REMOVE_ITEM = 0x257,\\n\\n\\tCMSG_AUCTION_LIST_ITEMS = 0x258,\\n\\n\\tCMSG_AUCTION_LIST_OWNER_ITEMS = 0x259,\\n\\n\\tCMSG_AUCTION_PLACE_BID = 0x25A,\\n\\n\\tSMSG_AUCTION_COMMAND_RESULT = 0x25B,\\n\\n\\tSMSG_AUCTION_LIST_RESULT = 0x25C,\\n\\n\\tSMSG_AUCTION_OWNER_LIST_RESULT = 0x25D,\\n\\n\\tSMSG_AUCTION_BIDDER_NOTIFICATION = 0x25E,\\n\\n\\tSMSG_AUCTION_OWNER_NOTIFICATION = 0x25F,\\n\\n\\tSMSG_PROCRESIST = 0x260,\\n\\n\\tSMSG_COMBAT_EVENT_FAILED = 0x261,\\n\\n\\tSMSG_DISPEL_FAILED = 0x262,\\n\\n\\tSMSG_SPELLORDAMAGE_IMMUNE = 0x263,\\n\\n\\tCMSG_AUCTION_LIST_BIDDER_ITEMS = 0x264,\\n\\n\\tSMSG_AUCTION_BIDDER_LIST_RESULT = 0x265,\\n\\n\\tSMSG_SET_FLAT_SPELL_MODIFIER = 0x266,\\n\\n\\tSMSG_SET_PCT_SPELL_MODIFIER = 0x267,\\n\\n\\tCMSG_SET_AMMO = 0x268,\\n\\n\\tSMSG_CORPSE_RECLAIM_DELAY = 0x269,\\n\\n\\tCMSG_SET_ACTIVE_MOVER = 0x26A,\\n\\n\\tCMSG_PET_CANCEL_AURA = 0x26B,\\n\\n\\tCMSG_PLAYER_AI_CHEAT = 0x26C,\\n\\n\\tCMSG_CANCEL_AUTO_REPEAT_SPELL = 0x26D,\\n\\n\\tMSG_GM_ACCOUNT_ONLINE = 0x26E,\\n\\n\\tMSG_LIST_STABLED_PETS = 0x26F,\\n\\n\\tCMSG_STABLE_PET = 0x270,\\n\\n\\tCMSG_UNSTABLE_PET = 0x271,\\n\\n\\tCMSG_BUY_STABLE_SLOT = 0x272,\\n\\n\\tSMSG_STABLE_RESULT = 0x273,\\n\\n\\tCMSG_STABLE_REVIVE_PET = 0x274,\\n\\n\\tCMSG_STABLE_SWAP_PET = 0x275,\\n\\n\\tMSG_QUEST_PUSH_RESULT = 0x276,\\n\\n\\tSMSG_PLAY_MUSIC = 0x277,\\n\\n\\tSMSG_PLAY_OBJECT_SOUND = 0x278,\\n\\n\\tCMSG_REQUEST_PET_INFO = 0x279,\\n\\n\\tCMSG_FAR_SIGHT = 0x27A,\\n\\n\\tSMSG_SPELLDISPELLOG = 0x27B,\\n\\n\\tSMSG_DAMAGE_CALC_LOG = 0x27C,\\n\\n\\tCMSG_ENABLE_DAMAGE_LOG = 0x27D,\\n\\n\\tCMSG_GROUP_CHANGE_SUB_GROUP = 0x27E,\\n\\n\\tCMSG_REQUEST_PARTY_MEMBER_STATS = 0x27F,\\n\\n\\tCMSG_GROUP_SWAP_SUB_GROUP = 0x280,\\n\\n\\tCMSG_RESET_FACTION_CHEAT = 0x281,\\n\\n\\tCMSG_AUTOSTORE_BANK_ITEM = 0x282,\\n\\n\\tCMSG_AUTOBANK_ITEM = 0x283,\\n\\n\\tMSG_QUERY_NEXT_MAIL_TIME = 0x284,\\n\\n\\tSMSG_RECEIVED_MAIL = 0x285,\\n\\n\\tSMSG_RAID_GROUP_ONLY = 0x286,\\n\\n\\tCMSG_SET_DURABILITY_CHEAT = 0x287,\\n\\n\\tCMSG_SET_PVP_RANK_CHEAT = 0x288,\\n\\n\\tCMSG_ADD_PVP_MEDAL_CHEAT = 0x289,\\n\\n\\tCMSG_DEL_PVP_MEDAL_CHEAT = 0x28A,\\n\\n\\tCMSG_SET_PVP_TITLE = 0x28B,\\n\\n\\tSMSG_PVP_CREDIT = 0x28C,\\n\\n\\tSMSG_AUCTION_REMOVED_NOTIFICATION = 0x28D,\\n\\n\\tCMSG_GROUP_RAID_CONVERT = 0x28E,\\n\\n\\tCMSG_GROUP_ASSISTANT_LEADER = 0x28F,\\n\\n\\tCMSG_BUYBACK_ITEM = 0x290,\\n\\n\\tSMSG_SERVER_MESSAGE = 0x291,\\n\\n\\tCMSG_SET_SAVED_INSTANCE_EXTEND = 0x292,\\n\\n\\tSMSG_LFG_OFFER_CONTINUE = 0x293,\\n\\n\\tCMSG_TEST_DROP_RATE = 0x294,\\n\\n\\tSMSG_TEST_DROP_RATE_RESULT = 0x295,\\n\\n\\tCMSG_LFG_GET_STATUS = 0x296,\\n\\n\\tSMSG_SHOW_MAILBOX = 0x297,\\n\\n\\tSMSG_RESET_RANGED_COMBAT_TIMER = 0x298,\\n\\n\\tSMSG_CHAT_NOT_IN_PARTY = 0x299, // uint32, errors: ERR_NOT_IN_GROUP (2, 51) and ERR_NOT_IN_RAID (3, 39, 40)\\n\\n\\tCMSG_GMTICKETSYSTEM_TOGGLE = 0x29A,\\n\\n\\tCMSG_CANCEL_GROWTH_AURA = 0x29B,\\n\\n\\tSMSG_CANCEL_AUTO_REPEAT = 0x29C,\\n\\n\\tSMSG_STANDSTATE_UPDATE = 0x29D,\\n\\n\\tSMSG_LOOT_ALL_PASSED = 0x29E,\\n\\n\\tSMSG_LOOT_ROLL_WON = 0x29F,\\n\\n\\tCMSG_LOOT_ROLL = 0x2A0,\\n\\n\\tSMSG_LOOT_START_ROLL = 0x2A1,\\n\\n\\tSMSG_LOOT_ROLL = 0x2A2,\\n\\n\\tCMSG_LOOT_MASTER_GIVE = 0x2A3,\\n\\n\\tSMSG_LOOT_MASTER_LIST = 0x2A4,\\n\\n\\tSMSG_SET_FORCED_REACTIONS = 0x2A5,\\n\\n\\tSMSG_SPELL_FAILED_OTHER = 0x2A6,\\n\\n\\tSMSG_GAMEOBJECT_RESET_STATE = 0x2A7,\\n\\n\\tCMSG_REPAIR_ITEM = 0x2A8,\\n\\n\\tSMSG_CHAT_PLAYER_NOT_FOUND = 0x2A9,\\n\\n\\tMSG_TALENT_WIPE_CONFIRM = 0x2AA,\\n\\n\\tSMSG_SUMMON_REQUEST = 0x2AB,\\n\\n\\tCMSG_SUMMON_RESPONSE = 0x2AC,\\n\\n\\tMSG_DEV_SHOWLABEL = 0x2AD,\\n\\n\\tSMSG_MONSTER_MOVE_TRANSPORT = 0x2AE,\\n\\n\\tSMSG_PET_BROKEN = 0x2AF,\\n\\n\\tMSG_MOVE_FEATHER_FALL = 0x2B0,\\n\\n\\tMSG_MOVE_WATER_WALK = 0x2B1,\\n\\n\\tCMSG_SERVER_BROADCAST = 0x2B2,\\n\\n\\tCMSG_SELF_RES = 0x2B3,\\n\\n\\tSMSG_FEIGN_DEATH_RESISTED = 0x2B4,\\n\\n\\tCMSG_RUN_SCRIPT = 0x2B5,\\n\\n\\tSMSG_SCRIPT_MESSAGE = 0x2B6,\\n\\n\\tSMSG_DUEL_COUNTDOWN = 0x2B7,\\n\\n\\tSMSG_AREA_TRIGGER_MESSAGE = 0x2B8,\\n\\n\\tCMSG_SHOWING_HELM = 0x2B9,\\n\\n\\tCMSG_SHOWING_CLOAK = 0x2BA,\\n\\n\\tSMSG_LFG_ROLE_CHOSEN = 0x2BB,\\n\\n\\tSMSG_PLAYER_SKINNED = 0x2BC,\\n\\n\\tSMSG_DURABILITY_DAMAGE_DEATH = 0x2BD,\\n\\n\\tCMSG_SET_EXPLORATION = 0x2BE,\\n\\n\\tCMSG_SET_ACTIONBAR_TOGGLES = 0x2BF,\\n\\n\\tUMSG_DELETE_GUILD_CHARTER = 0x2C0,\\n\\n\\tMSG_PETITION_RENAME = 0x2C1,\\n\\n\\tSMSG_INIT_WORLD_STATES = 0x2C2,\\n\\n\\tSMSG_UPDATE_WORLD_STATE = 0x2C3,\\n\\n\\tCMSG_ITEM_NAME_QUERY = 0x2C4,\\n\\n\\tSMSG_ITEM_NAME_QUERY_RESPONSE = 0x2C5,\\n\\n\\tSMSG_PET_ACTION_FEEDBACK = 0x2C6,\\n\\n\\tCMSG_CHAR_RENAME = 0x2C7,\\n\\n\\tSMSG_CHAR_RENAME = 0x2C8,\\n\\n\\tCMSG_MOVE_SPLINE_DONE = 0x2C9,\\n\\n\\tCMSG_MOVE_FALL_RESET = 0x2CA,\\n\\n\\tSMSG_INSTANCE_SAVE_CREATED = 0x2CB,\\n\\n\\tSMSG_RAID_INSTANCE_INFO = 0x2CC,\\n\\n\\tCMSG_REQUEST_RAID_INFO = 0x2CD,\\n\\n\\tCMSG_MOVE_TIME_SKIPPED = 0x2CE,\\n\\n\\tCMSG_MOVE_FEATHER_FALL_ACK = 0x2CF,\\n\\n\\tCMSG_MOVE_WATER_WALK_ACK = 0x2D0,\\n\\n\\tCMSG_MOVE_NOT_ACTIVE_MOVER = 0x2D1,\\n\\n\\tSMSG_PLAY_SOUND = 0x2D2,\\n\\n\\tCMSG_BATTLEFIELD_STATUS = 0x2D3,\\n\\n\\tSMSG_BATTLEFIELD_STATUS = 0x2D4,\\n\\n\\tCMSG_BATTLEFIELD_PORT = 0x2D5,\\n\\n\\tMSG_INSPECT_HONOR_STATS = 0x2D6,\\n\\n\\tCMSG_BATTLEMASTER_HELLO = 0x2D7,\\n\\n\\tCMSG_MOVE_START_SWIM_CHEAT = 0x2D8,\\n\\n\\tCMSG_MOVE_STOP_SWIM_CHEAT = 0x2D9,\\n\\n\\tSMSG_FORCE_WALK_SPEED_CHANGE = 0x2DA,\\n\\n\\tCMSG_FORCE_WALK_SPEED_CHANGE_ACK = 0x2DB,\\n\\n\\tSMSG_FORCE_SWIM_BACK_SPEED_CHANGE = 0x2DC,\\n\\n\\tCMSG_FORCE_SWIM_BACK_SPEED_CHANGE_ACK = 0x2DD,\\n\\n\\tSMSG_FORCE_TURN_RATE_CHANGE = 0x2DE,\\n\\n\\tCMSG_FORCE_TURN_RATE_CHANGE_ACK = 0x2DF,\\n\\n\\tMSG_PVP_LOG_DATA = 0x2E0,\\n\\n\\tCMSG_LEAVE_BATTLEFIELD = 0x2E1,\\n\\n\\tCMSG_AREA_SPIRIT_HEALER_QUERY = 0x2E2,\\n\\n\\tCMSG_AREA_SPIRIT_HEALER_QUEUE = 0x2E3,\\n\\n\\tSMSG_AREA_SPIRIT_HEALER_TIME = 0x2E4,\\n\\n\\tCMSG_GM_UNTEACH = 0x2E5,\\n\\n\\tSMSG_WARDEN_DATA = 0x2E6,\\n\\n\\tCMSG_WARDEN_DATA = 0x2E7,\\n\\n\\tSMSG_GROUP_JOINED_BATTLEGROUND = 0x2E8,\\n\\n\\tMSG_BATTLEGROUND_PLAYER_POSITIONS = 0x2E9,\\n\\n\\tCMSG_PET_STOP_ATTACK = 0x2EA,\\n\\n\\tSMSG_BINDER_CONFIRM = 0x2EB,\\n\\n\\tSMSG_BATTLEGROUND_PLAYER_JOINED = 0x2EC,\\n\\n\\tSMSG_BATTLEGROUND_PLAYER_LEFT = 0x2ED,\\n\\n\\tCMSG_BATTLEMASTER_JOIN = 0x2EE,\\n\\n\\tSMSG_ADDON_INFO = 0x2EF,\\n\\n\\tCMSG_PET_UNLEARN = 0x2F0, // Deprecated 3.x\\n\\n\\tSMSG_PET_UNLEARN_CONFIRM = 0x2F1, // Deprecated 3.x\\n\\n\\tSMSG_PARTY_MEMBER_STATS_FULL = 0x2F2,\\n\\n\\tCMSG_PET_SPELL_AUTOCAST = 0x2F3,\\n\\n\\tSMSG_WEATHER = 0x2F4,\\n\\n\\tSMSG_PLAY_TIME_WARNING = 0x2F5,\\n\\n\\tSMSG_MINIGAME_SETUP = 0x2F6,\\n\\n\\tSMSG_MINIGAME_STATE = 0x2F7,\\n\\n\\tCMSG_MINIGAME_MOVE = 0x2F8,\\n\\n\\tSMSG_MINIGAME_MOVE_FAILED = 0x2F9,\\n\\n\\tSMSG_RAID_INSTANCE_MESSAGE = 0x2FA,\\n\\n\\tSMSG_COMPRESSED_MOVES = 0x2FB,\\n\\n\\tCMSG_GUILD_INFO_TEXT = 0x2FC,\\n\\n\\tSMSG_CHAT_RESTRICTED = 0x2FD,\\n\\n\\tSMSG_SPLINE_SET_RUN_SPEED = 0x2FE,\\n\\n\\tSMSG_SPLINE_SET_RUN_BACK_SPEED = 0x2FF,\\n\\n\\tSMSG_SPLINE_SET_SWIM_SPEED = 0x300,\\n\\n\\tSMSG_SPLINE_SET_WALK_SPEED = 0x301,\\n\\n\\tSMSG_SPLINE_SET_SWIM_BACK_SPEED = 0x302,\\n\\n\\tSMSG_SPLINE_SET_TURN_RATE = 0x303,\\n\\n\\tSMSG_SPLINE_MOVE_UNROOT = 0x304,\\n\\n\\tSMSG_SPLINE_MOVE_FEATHER_FALL = 0x305,\\n\\n\\tSMSG_SPLINE_MOVE_NORMAL_FALL = 0x306,\\n\\n\\tSMSG_SPLINE_MOVE_SET_HOVER = 0x307,\\n\\n\\tSMSG_SPLINE_MOVE_UNSET_HOVER = 0x308,\\n\\n\\tSMSG_SPLINE_MOVE_WATER_WALK = 0x309,\\n\\n\\tSMSG_SPLINE_MOVE_LAND_WALK = 0x30A,\\n\\n\\tSMSG_SPLINE_MOVE_START_SWIM = 0x30B,\\n\\n\\tSMSG_SPLINE_MOVE_STOP_SWIM = 0x30C,\\n\\n\\tSMSG_SPLINE_MOVE_SET_RUN_MODE = 0x30D,\\n\\n\\tSMSG_SPLINE_MOVE_SET_WALK_MODE = 0x30E,\\n\\n\\tCMSG_GM_NUKE_ACCOUNT = 0x30F,\\n\\n\\tMSG_GM_DESTROY_CORPSE = 0x310,\\n\\n\\tCMSG_GM_DESTROY_ONLINE_CORPSE = 0x311,\\n\\n\\tCMSG_ACTIVATETAXIEXPRESS = 0x312,\\n\\n\\tSMSG_SET_FACTION_ATWAR = 0x313,\\n\\n\\tSMSG_GAMETIMEBIAS_SET = 0x314,\\n\\n\\tCMSG_DEBUG_ACTIONS_START = 0x315,\\n\\n\\tCMSG_DEBUG_ACTIONS_STOP = 0x316,\\n\\n\\tCMSG_SET_FACTION_INACTIVE = 0x317,\\n\\n\\tCMSG_SET_WATCHED_FACTION = 0x318,\\n\\n\\tMSG_MOVE_TIME_SKIPPED = 0x319,\\n\\n\\tSMSG_SPLINE_MOVE_ROOT = 0x31A,\\n\\n\\tCMSG_SET_EXPLORATION_ALL = 0x31B,\\n\\n\\tSMSG_INVALIDATE_PLAYER = 0x31C,\\n\\n\\tCMSG_RESET_INSTANCES = 0x31D,\\n\\n\\tSMSG_INSTANCE_RESET = 0x31E,\\n\\n\\tSMSG_INSTANCE_RESET_FAILED = 0x31F,\\n\\n\\tSMSG_UPDATE_LAST_INSTANCE = 0x320,\\n\\n\\tMSG_RAID_TARGET_UPDATE = 0x321,\\n\\n\\tMSG_RAID_READY_CHECK = 0x322,\\n\\n\\tCMSG_LUA_USAGE = 0x323,\\n\\n\\tSMSG_PET_ACTION_SOUND = 0x324,\\n\\n\\tSMSG_PET_DISMISS_SOUND = 0x325,\\n\\n\\tSMSG_GHOSTEE_GONE = 0x326,\\n\\n\\tCMSG_GM_UPDATE_TICKET_STATUS = 0x327,\\n\\n\\tSMSG_GM_TICKET_STATUS_UPDATE = 0x328,\\n\\n\\tMSG_SET_DUNGEON_DIFFICULTY = 0x329,\\n\\n\\tCMSG_GMSURVEY_SUBMIT = 0x32A,\\n\\n\\tSMSG_UPDATE_INSTANCE_OWNERSHIP = 0x32B,\\n\\n\\tCMSG_IGNORE_KNOCKBACK_CHEAT = 0x32C,\\n\\n\\tSMSG_CHAT_PLAYER_AMBIGUOUS = 0x32D,\\n\\n\\tMSG_DELAY_GHOST_TELEPORT = 0x32E,\\n\\n\\tSMSG_SPELLINSTAKILLLOG = 0x32F,\\n\\n\\tSMSG_SPELL_UPDATE_CHAIN_TARGETS = 0x330,\\n\\n\\tCMSG_CHAT_FILTERED = 0x331,\\n\\n\\tSMSG_EXPECTED_SPAM_RECORDS = 0x332,\\n\\n\\tSMSG_SPELLSTEALLOG = 0x333,\\n\\n\\tCMSG_LOTTERY_QUERY_OBSOLETE = 0x334,\\n\\n\\tSMSG_LOTTERY_QUERY_RESULT_OBSOLETE = 0x335,\\n\\n\\tCMSG_BUY_LOTTERY_TICKET_OBSOLETE = 0x336,\\n\\n\\tSMSG_LOTTERY_RESULT_OBSOLETE = 0x337,\\n\\n\\tSMSG_CHARACTER_PROFILE = 0x338,\\n\\n\\tSMSG_CHARACTER_PROFILE_REALM_CONNECTED = 0x339,\\n\\n\\tSMSG_DEFENSE_MESSAGE = 0x33A,\\n\\n\\tSMSG_INSTANCE_DIFFICULTY = 0x33B,\\n\\n\\tMSG_GM_RESETINSTANCELIMIT = 0x33C,\\n\\n\\tSMSG_MOTD = 0x33D,\\n\\n\\tSMSG_MOVE_SET_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY = 0x33E,\\n\\n\\tSMSG_MOVE_UNSET_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY = 0x33F,\\n\\n\\tCMSG_MOVE_SET_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY_ACK = 0x340,\\n\\n\\tMSG_MOVE_START_SWIM_CHEAT = 0x341,\\n\\n\\tMSG_MOVE_STOP_SWIM_CHEAT = 0x342,\\n\\n\\tSMSG_MOVE_SET_CAN_FLY = 0x343,\\n\\n\\tSMSG_MOVE_UNSET_CAN_FLY = 0x344,\\n\\n\\tCMSG_MOVE_SET_CAN_FLY_ACK = 0x345,\\n\\n\\tCMSG_MOVE_SET_FLY = 0x346,\\n\\n\\tCMSG_SOCKET_GEMS = 0x347,\\n\\n\\tCMSG_ARENA_TEAM_CREATE = 0x348,\\n\\n\\tSMSG_ARENA_TEAM_COMMAND_RESULT = 0x349,\\n\\n\\tMSG_MOVE_UPDATE_CAN_TRANSITION_BETWEEN_SWIM_AND_FLY = 0x34A,\\n\\n\\tCMSG_ARENA_TEAM_QUERY = 0x34B,\\n\\n\\tSMSG_ARENA_TEAM_QUERY_RESPONSE = 0x34C,\\n\\n\\tCMSG_ARENA_TEAM_ROSTER = 0x34D,\\n\\n\\tSMSG_ARENA_TEAM_ROSTER = 0x34E,\\n\\n\\tCMSG_ARENA_TEAM_INVITE = 0x34F,\\n\\n\\tSMSG_ARENA_TEAM_INVITE = 0x350,\\n\\n\\tCMSG_ARENA_TEAM_ACCEPT = 0x351,\\n\\n\\tCMSG_ARENA_TEAM_DECLINE = 0x352,\\n\\n\\tCMSG_ARENA_TEAM_LEAVE = 0x353,\\n\\n\\tCMSG_ARENA_TEAM_REMOVE = 0x354,\\n\\n\\tCMSG_ARENA_TEAM_DISBAND = 0x355,\\n\\n\\tCMSG_ARENA_TEAM_LEADER = 0x356,\\n\\n\\tSMSG_ARENA_TEAM_EVENT = 0x357,\\n\\n\\tCMSG_BATTLEMASTER_JOIN_ARENA = 0x358,\\n\\n\\tMSG_MOVE_START_ASCEND = 0x359,\\n\\n\\tMSG_MOVE_STOP_ASCEND = 0x35A,\\n\\n\\tSMSG_ARENA_TEAM_STATS = 0x35B,\\n\\n\\tCMSG_LFG_JOIN = 0x35C,\\n\\n\\tCMSG_LFG_LEAVE = 0x35D,\\n\\n\\tCMSG_SEARCH_LFG_JOIN = 0x35E,\\n\\n\\tCMSG_SEARCH_LFG_LEAVE = 0x35F,\\n\\n\\tSMSG_UPDATE_LFG_LIST = 0x360, // uint32, uint32, if (uint8) { uint32 count, for (count) { uint64} }, uint32 count2, uint32, for (count2) { uint64, uint32 flags, if (flags & 0x2) {string}, if (flags & 0x10) {for (3) uint8}, if (flags & 0x80) {uint64, uint32}}, uint32 count3, uint32, for (count3) {uint64, uint32 flags, if (flags & 0x1) {uint8, uint8, uint8, for (3) uint8, uint32, uint32, uint32, uint32, uint32, uint32, float, float, uint32, uint32, uint32, uint32, uint32, float, uint32, uint32, uint32, uint32, uint32, uint32}, if (flags&0x2) string, if (flags&0x4) uint8, if (flags&0x8) uint64, if (flags&0x10) uint8, if (flags&0x20) uint32, if (flags&0x40) uint8, if (flags& 0x80) {uint64, uint32}}\\n\\n\\tSMSG_LFG_PROPOSAL_UPDATE = 0x361, // uint32, uint8, uint32, uint32, uint8, for (uint8) {uint32, uint8, uint8, uint8, uint8}\\n\\n\\tCMSG_LFG_PROPOSAL_RESULT = 0x362,\\n\\n\\tSMSG_LFG_ROLE_CHECK_UPDATE = 0x363, // uint32, uint8, for (uint8) uint32, uint8, for (uint8) { uint64, uint8, uint32, uint8, }\\n\\n\\tSMSG_LFG_JOIN_RESULT = 0x364, // uint32 unk, uint32, if (unk == 6) { uint8 count, for (count) uint64 }\\n\\n\\tSMSG_LFG_QUEUE_STATUS = 0x365, // uint32 dungeon, uint32 lfgtype, uint32, uint32, uint32, uint32, uint8, uint8, uint8, uint8\\n\\n\\tCMSG_SET_LFG_COMMENT = 0x366,\\n\\n\\tSMSG_LFG_UPDATE_PLAYER = 0x367, // uint8, if (uint8) { uint8, uint8, uint8, uint8, if (uint8) for (uint8) uint32, string}\\n\\n\\tSMSG_LFG_UPDATE_PARTY = 0x368, // uint8, if (uint8) { uint8, uint8, uint8, for (3) uint8, uint8, if (uint8) for (uint8) uint32, string}\\n\\n\\tSMSG_LFG_UPDATE_SEARCH = 0x369, // uint8\\n\\n\\tCMSG_LFG_SET_ROLES = 0x36A,\\n\\n\\tCMSG_LFG_SET_NEEDS = 0x36B,\\n\\n\\tCMSG_LFG_SET_BOOT_VOTE = 0x36C,\\n\\n\\tSMSG_LFG_BOOT_PROPOSAL_UPDATE = 0x36D, // uint8, uint8, uint8, uint64, uint32, uint32, uint32, uint32\\n\\n\\tCMSG_LFD_PLAYER_LOCK_INFO_REQUEST = 0x36E,\\n\\n\\tSMSG_LFG_PLAYER_INFO = 0x36F, // uint8, for (uint8) { uint32, uint8, uint32, uint32, uint32, uint32, uint8, for (uint8) {uint32, uint32, uint32}}, uint32, for (uint32) {uint32, uint32}\\n\\n\\tCMSG_LFG_TELEPORT = 0x370,\\n\\n\\tCMSG_LFD_PARTY_LOCK_INFO_REQUEST = 0x371,\\n\\n\\tSMSG_LFG_PARTY_INFO = 0x372, // uint8, for (uint8) uint64\\n\\n\\tSMSG_TITLE_EARNED = 0x373,\\n\\n\\tCMSG_SET_TITLE = 0x374,\\n\\n\\tCMSG_CANCEL_MOUNT_AURA = 0x375,\\n\\n\\tSMSG_ARENA_ERROR = 0x376,\\n\\n\\tMSG_INSPECT_ARENA_TEAMS = 0x377,\\n\\n\\tSMSG_DEATH_RELEASE_LOC = 0x378,\\n\\n\\tCMSG_CANCEL_TEMP_ENCHANTMENT = 0x379,\\n\\n\\tSMSG_FORCED_DEATH_UPDATE = 0x37A,\\n\\n\\tCMSG_CHEAT_SET_HONOR_CURRENCY = 0x37B,\\n\\n\\tCMSG_CHEAT_SET_ARENA_CURRENCY = 0x37C,\\n\\n\\tMSG_MOVE_SET_FLIGHT_SPEED_CHEAT = 0x37D,\\n\\n\\tMSG_MOVE_SET_FLIGHT_SPEED = 0x37E,\\n\\n\\tMSG_MOVE_SET_FLIGHT_BACK_SPEED_CHEAT = 0x37F,\\n\\n\\tMSG_MOVE_SET_FLIGHT_BACK_SPEED = 0x380,\\n\\n\\tSMSG_FORCE_FLIGHT_SPEED_CHANGE = 0x381,\\n\\n\\tCMSG_FORCE_FLIGHT_SPEED_CHANGE_ACK = 0x382,\\n\\n\\tSMSG_FORCE_FLIGHT_BACK_SPEED_CHANGE = 0x383,\\n\\n\\tCMSG_FORCE_FLIGHT_BACK_SPEED_CHANGE_ACK = 0x384,\\n\\n\\tSMSG_SPLINE_SET_FLIGHT_SPEED = 0x385,\\n\\n\\tSMSG_SPLINE_SET_FLIGHT_BACK_SPEED = 0x386,\\n\\n\\tCMSG_MAELSTROM_INVALIDATE_CACHE = 0x387,\\n\\n\\tSMSG_FLIGHT_SPLINE_SYNC = 0x388,\\n\\n\\tCMSG_SET_TAXI_BENCHMARK_MODE = 0x389,\\n\\n\\tSMSG_JOINED_BATTLEGROUND_QUEUE = 0x38A,\\n\\n\\tSMSG_REALM_SPLIT = 0x38B,\\n\\n\\tCMSG_REALM_SPLIT = 0x38C,\\n\\n\\tCMSG_MOVE_CHNG_TRANSPORT = 0x38D,\\n\\n\\tMSG_PARTY_ASSIGNMENT = 0x38E,\\n\\n\\tSMSG_OFFER_PETITION_ERROR = 0x38F,\\n\\n\\tSMSG_TIME_SYNC_REQ = 0x390,\\n\\n\\tCMSG_TIME_SYNC_RESP = 0x391,\\n\\n\\tCMSG_SEND_LOCAL_EVENT = 0x392,\\n\\n\\tCMSG_SEND_GENERAL_TRIGGER = 0x393,\\n\\n\\tCMSG_SEND_COMBAT_TRIGGER = 0x394,\\n\\n\\tCMSG_MAELSTROM_GM_SENT_MAIL = 0x395,\\n\\n\\tSMSG_RESET_FAILED_NOTIFY = 0x396,\\n\\n\\tSMSG_REAL_GROUP_UPDATE = 0x397,\\n\\n\\tSMSG_LFG_DISABLED = 0x398,\\n\\n\\tCMSG_ACTIVE_PVP_CHEAT = 0x399,\\n\\n\\tCMSG_CHEAT_DUMP_ITEMS_DEBUG_ONLY = 0x39A,\\n\\n\\tSMSG_CHEAT_DUMP_ITEMS_DEBUG_ONLY_RESPONSE = 0x39B,\\n\\n\\tSMSG_CHEAT_DUMP_ITEMS_DEBUG_ONLY_RESPONSE_WRITE_FILE = 0x39C,\\n\\n\\tSMSG_UPDATE_COMBO_POINTS = 0x39D,\\n\\n\\tSMSG_VOICE_SESSION_ROSTER_UPDATE = 0x39E,\\n\\n\\tSMSG_VOICE_SESSION_LEAVE = 0x39F,\\n\\n\\tSMSG_VOICE_SESSION_ADJUST_PRIORITY = 0x3A0,\\n\\n\\tCMSG_VOICE_SET_TALKER_MUTED_REQUEST = 0x3A1,\\n\\n\\tSMSG_VOICE_SET_TALKER_MUTED = 0x3A2,\\n\\n\\tSMSG_INIT_EXTRA_AURA_INFO_OBSOLETE = 0x3A3,\\n\\n\\tSMSG_SET_EXTRA_AURA_INFO_OBSOLETE = 0x3A4,\\n\\n\\tSMSG_SET_EXTRA_AURA_INFO_NEED_UPDATE_OBSOLETE = 0x3A5,\\n\\n\\tSMSG_CLEAR_EXTRA_AURA_INFO_OBSOLETE = 0x3A6,\\n\\n\\tMSG_MOVE_START_DESCEND = 0x3A7,\\n\\n\\tCMSG_IGNORE_REQUIREMENTS_CHEAT = 0x3A8,\\n\\n\\tSMSG_IGNORE_REQUIREMENTS_CHEAT = 0x3A9,\\n\\n\\tSMSG_SPELL_CHANCE_PROC_LOG = 0x3AA,\\n\\n\\tCMSG_MOVE_SET_RUN_SPEED = 0x3AB,\\n\\n\\tSMSG_DISMOUNT = 0x3AC,\\n\\n\\tMSG_MOVE_UPDATE_CAN_FLY = 0x3AD,\\n\\n\\tMSG_RAID_READY_CHECK_CONFIRM = 0x3AE,\\n\\n\\tCMSG_VOICE_SESSION_ENABLE = 0x3AF,\\n\\n\\tSMSG_VOICE_SESSION_ENABLE = 0x3B0,\\n\\n\\tSMSG_VOICE_PARENTAL_CONTROLS = 0x3B1,\\n\\n\\tCMSG_GM_WHISPER = 0x3B2,\\n\\n\\tSMSG_GM_MESSAGECHAT = 0x3B3,\\n\\n\\tMSG_GM_GEARRATING = 0x3B4,\\n\\n\\tCMSG_COMMENTATOR_ENABLE = 0x3B5,\\n\\n\\tSMSG_COMMENTATOR_STATE_CHANGED = 0x3B6,\\n\\n\\tCMSG_COMMENTATOR_GET_MAP_INFO = 0x3B7,\\n\\n\\tSMSG_COMMENTATOR_MAP_INFO = 0x3B8,\\n\\n\\tCMSG_COMMENTATOR_GET_PLAYER_INFO = 0x3B9,\\n\\n\\tSMSG_COMMENTATOR_GET_PLAYER_INFO = 0x3BA,\\n\\n\\tSMSG_COMMENTATOR_PLAYER_INFO = 0x3BB,\\n\\n\\tCMSG_COMMENTATOR_ENTER_INSTANCE = 0x3BC,\\n\\n\\tCMSG_COMMENTATOR_EXIT_INSTANCE = 0x3BD,\\n\\n\\tCMSG_COMMENTATOR_INSTANCE_COMMAND = 0x3BE,\\n\\n\\tSMSG_CLEAR_TARGET = 0x3BF,\\n\\n\\tCMSG_BOT_DETECTED = 0x3C0,\\n\\n\\tSMSG_CROSSED_INEBRIATION_THRESHOLD = 0x3C1,\\n\\n\\tCMSG_CHEAT_PLAYER_LOGIN = 0x3C2,\\n\\n\\tCMSG_CHEAT_PLAYER_LOOKUP = 0x3C3,\\n\\n\\tSMSG_CHEAT_PLAYER_LOOKUP = 0x3C4,\\n\\n\\tSMSG_KICK_REASON = 0x3C5,\\n\\n\\tMSG_RAID_READY_CHECK_FINISHED = 0x3C6,\\n\\n\\tCMSG_COMPLAIN = 0x3C7,\\n\\n\\tSMSG_COMPLAIN_RESULT = 0x3C8,\\n\\n\\tSMSG_FEATURE_SYSTEM_STATUS = 0x3C9,\\n\\n\\tCMSG_GM_SHOW_COMPLAINTS = 0x3CA,\\n\\n\\tCMSG_GM_UNSQUELCH = 0x3CB,\\n\\n\\tCMSG_CHANNEL_SILENCE_VOICE = 0x3CC,\\n\\n\\tCMSG_CHANNEL_SILENCE_ALL = 0x3CD,\\n\\n\\tCMSG_CHANNEL_UNSILENCE_VOICE = 0x3CE,\\n\\n\\tCMSG_CHANNEL_UNSILENCE_ALL = 0x3CF,\\n\\n\\tCMSG_TARGET_CAST = 0x3D0,\\n\\n\\tCMSG_TARGET_SCRIPT_CAST = 0x3D1,\\n\\n\\tCMSG_CHANNEL_DISPLAY_LIST = 0x3D2,\\n\\n\\tCMSG_SET_ACTIVE_VOICE_CHANNEL = 0x3D3,\\n\\n\\tCMSG_GET_CHANNEL_MEMBER_COUNT = 0x3D4,\\n\\n\\tSMSG_CHANNEL_MEMBER_COUNT = 0x3D5,\\n\\n\\tCMSG_CHANNEL_VOICE_ON = 0x3D6,\\n\\n\\tCMSG_CHANNEL_VOICE_OFF = 0x3D7,\\n\\n\\tCMSG_DEBUG_LIST_TARGETS = 0x3D8,\\n\\n\\tSMSG_DEBUG_LIST_TARGETS = 0x3D9,\\n\\n\\tSMSG_AVAILABLE_VOICE_CHANNEL = 0x3DA,\\n\\n\\tCMSG_ADD_VOICE_IGNORE = 0x3DB,\\n\\n\\tCMSG_DEL_VOICE_IGNORE = 0x3DC,\\n\\n\\tCMSG_PARTY_SILENCE = 0x3DD,\\n\\n\\tCMSG_PARTY_UNSILENCE = 0x3DE,\\n\\n\\tMSG_NOTIFY_PARTY_SQUELCH = 0x3DF,\\n\\n\\tSMSG_COMSAT_RECONNECT_TRY = 0x3E0,\\n\\n\\tSMSG_COMSAT_DISCONNECT = 0x3E1,\\n\\n\\tSMSG_COMSAT_CONNECT_FAIL = 0x3E2,\\n\\n\\tSMSG_VOICE_CHAT_STATUS = 0x3E3,\\n\\n\\tCMSG_REPORT_PVP_AFK = 0x3E4,\\n\\n\\tSMSG_REPORT_PVP_AFK_RESULT = 0x3E5,\\n\\n\\tCMSG_GUILD_BANKER_ACTIVATE = 0x3E6,\\n\\n\\tCMSG_GUILD_BANK_QUERY_TAB = 0x3E7,\\n\\n\\tSMSG_GUILD_BANK_LIST = 0x3E8,\\n\\n\\tCMSG_GUILD_BANK_SWAP_ITEMS = 0x3E9,\\n\\n\\tCMSG_GUILD_BANK_BUY_TAB = 0x3EA,\\n\\n\\tCMSG_GUILD_BANK_UPDATE_TAB = 0x3EB,\\n\\n\\tCMSG_GUILD_BANK_DEPOSIT_MONEY = 0x3EC,\\n\\n\\tCMSG_GUILD_BANK_WITHDRAW_MONEY = 0x3ED,\\n\\n\\tMSG_GUILD_BANK_LOG_QUERY = 0x3EE,\\n\\n\\tCMSG_SET_CHANNEL_WATCH = 0x3EF,\\n\\n\\tSMSG_USERLIST_ADD = 0x3F0,\\n\\n\\tSMSG_USERLIST_REMOVE = 0x3F1,\\n\\n\\tSMSG_USERLIST_UPDATE = 0x3F2,\\n\\n\\tCMSG_CLEAR_CHANNEL_WATCH = 0x3F3,\\n\\n\\tSMSG_INSPECT_TALENT = 0x3F4,\\n\\n\\tSMSG_GOGOGO_OBSOLETE = 0x3F5,\\n\\n\\tSMSG_ECHO_PARTY_SQUELCH = 0x3F6,\\n\\n\\tCMSG_SET_TITLE_SUFFIX = 0x3F7,\\n\\n\\tCMSG_SPELLCLICK = 0x3F8,\\n\\n\\tSMSG_LOOT_LIST = 0x3F9,\\n\\n\\tCMSG_GM_CHARACTER_RESTORE = 0x3FA,\\n\\n\\tCMSG_GM_CHARACTER_SAVE = 0x3FB,\\n\\n\\tSMSG_VOICESESSION_FULL = 0x3FC,\\n\\n\\tMSG_GUILD_PERMISSIONS = 0x3FD,\\n\\n\\tMSG_GUILD_BANK_MONEY_WITHDRAWN = 0x3FE,\\n\\n\\tMSG_GUILD_EVENT_LOG_QUERY = 0x3FF,\\n\\n\\tCMSG_MAELSTROM_RENAME_GUILD = 0x400,\\n\\n\\tCMSG_GET_MIRRORIMAGE_DATA = 0x401,\\n\\n\\tSMSG_MIRRORIMAGE_DATA = 0x402,\\n\\n\\tSMSG_FORCE_DISPLAY_UPDATE = 0x403,\\n\\n\\tSMSG_SPELL_CHANCE_RESIST_PUSHBACK = 0x404,\\n\\n\\tCMSG_IGNORE_DIMINISHING_RETURNS_CHEAT = 0x405,\\n\\n\\tSMSG_IGNORE_DIMINISHING_RETURNS_CHEAT = 0x406,\\n\\n\\tCMSG_KEEP_ALIVE = 0x407,\\n\\n\\tSMSG_RAID_READY_CHECK_ERROR = 0x408,\\n\\n\\tCMSG_OPT_OUT_OF_LOOT = 0x409,\\n\\n\\tMSG_QUERY_GUILD_BANK_TEXT = 0x40A,\\n\\n\\tCMSG_SET_GUILD_BANK_TEXT = 0x40B,\\n\\n\\tCMSG_SET_GRANTABLE_LEVELS = 0x40C,\\n\\n\\tCMSG_GRANT_LEVEL = 0x40D,\\n\\n\\tCMSG_REFER_A_FRIEND = 0x40E,\\n\\n\\tMSG_GM_CHANGE_ARENA_RATING = 0x40F,\\n\\n\\tCMSG_DECLINE_CHANNEL_INVITE = 0x410,\\n\\n\\tSMSG_GROUPACTION_THROTTLED = 0x411,\\n\\n\\tSMSG_OVERRIDE_LIGHT = 0x412, // uint32 defaultMapLight, uint32 overrideLight, uint32 transitionTimeMs\\n\\n\\tSMSG_TOTEM_CREATED = 0x413,\\n\\n\\tCMSG_TOTEM_DESTROYED = 0x414,\\n\\n\\tCMSG_EXPIRE_RAID_INSTANCE = 0x415,\\n\\n\\tCMSG_NO_SPELL_VARIANCE = 0x416,\\n\\n\\tCMSG_QUESTGIVER_STATUS_MULTIPLE_QUERY = 0x417,\\n\\n\\tSMSG_QUESTGIVER_STATUS_MULTIPLE = 0x418,\\n\\n\\tCMSG_SET_PLAYER_DECLINED_NAMES = 0x419,\\n\\n\\tSMSG_SET_PLAYER_DECLINED_NAMES_RESULT = 0x41A,\\n\\n\\tCMSG_QUERY_SERVER_BUCK_DATA = 0x41B,\\n\\n\\tCMSG_CLEAR_SERVER_BUCK_DATA = 0x41C,\\n\\n\\tSMSG_SERVER_BUCK_DATA = 0x41D,\\n\\n\\tSMSG_SEND_UNLEARN_SPELLS = 0x41E,\\n\\n\\tSMSG_PROPOSE_LEVEL_GRANT = 0x41F,\\n\\n\\tCMSG_ACCEPT_LEVEL_GRANT = 0x420,\\n\\n\\tSMSG_REFER_A_FRIEND_FAILURE = 0x421,\\n\\n\\tSMSG_SPLINE_MOVE_SET_FLYING = 0x422,\\n\\n\\tSMSG_SPLINE_MOVE_UNSET_FLYING = 0x423,\\n\\n\\tSMSG_SUMMON_CANCEL = 0x424,\\n\\n\\tCMSG_CHANGE_PERSONAL_ARENA_RATING = 0x425,\\n\\n\\tCMSG_ALTER_APPEARANCE = 0x426,\\n\\n\\tSMSG_ENABLE_BARBER_SHOP = 0x427,\\n\\n\\tSMSG_BARBER_SHOP_RESULT = 0x428,\\n\\n\\tCMSG_CALENDAR_GET_CALENDAR = 0x429,\\n\\n\\tCMSG_CALENDAR_GET_EVENT = 0x42A,\\n\\n\\tCMSG_CALENDAR_GUILD_FILTER = 0x42B,\\n\\n\\tCMSG_CALENDAR_ARENA_TEAM = 0x42C,\\n\\n\\tCMSG_CALENDAR_ADD_EVENT = 0x42D,\\n\\n\\tCMSG_CALENDAR_UPDATE_EVENT = 0x42E,\\n\\n\\tCMSG_CALENDAR_REMOVE_EVENT = 0x42F,\\n\\n\\tCMSG_CALENDAR_COPY_EVENT = 0x430,\\n\\n\\tCMSG_CALENDAR_EVENT_INVITE = 0x431,\\n\\n\\tCMSG_CALENDAR_EVENT_RSVP = 0x432,\\n\\n\\tCMSG_CALENDAR_EVENT_REMOVE_INVITE = 0x433,\\n\\n\\tCMSG_CALENDAR_EVENT_STATUS = 0x434,\\n\\n\\tCMSG_CALENDAR_EVENT_MODERATOR_STATUS = 0x435,\\n\\n\\tSMSG_CALENDAR_SEND_CALENDAR = 0x436,\\n\\n\\tSMSG_CALENDAR_SEND_EVENT = 0x437,\\n\\n\\tSMSG_CALENDAR_FILTER_GUILD = 0x438,\\n\\n\\tSMSG_CALENDAR_ARENA_TEAM = 0x439,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE = 0x43A,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE_REMOVED = 0x43B,\\n\\n\\tSMSG_CALENDAR_EVENT_STATUS = 0x43C,\\n\\n\\tSMSG_CALENDAR_COMMAND_RESULT = 0x43D,\\n\\n\\tSMSG_CALENDAR_RAID_LOCKOUT_ADDED = 0x43E,\\n\\n\\tSMSG_CALENDAR_RAID_LOCKOUT_REMOVED = 0x43F,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE_ALERT = 0x440,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE_REMOVED_ALERT = 0x441,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE_STATUS_ALERT = 0x442,\\n\\n\\tSMSG_CALENDAR_EVENT_REMOVED_ALERT = 0x443,\\n\\n\\tSMSG_CALENDAR_EVENT_UPDATED_ALERT = 0x444,\\n\\n\\tSMSG_CALENDAR_EVENT_MODERATOR_STATUS_ALERT = 0x445,\\n\\n\\tCMSG_CALENDAR_COMPLAIN = 0x446,\\n\\n\\tCMSG_CALENDAR_GET_NUM_PENDING = 0x447,\\n\\n\\tSMSG_CALENDAR_SEND_NUM_PENDING = 0x448,\\n\\n\\tCMSG_SAVE_DANCE = 0x449,\\n\\n\\tSMSG_NOTIFY_DANCE = 0x44A,\\n\\n\\tCMSG_PLAY_DANCE = 0x44B,\\n\\n\\tSMSG_PLAY_DANCE = 0x44C,\\n\\n\\tCMSG_LOAD_DANCES = 0x44D,\\n\\n\\tCMSG_STOP_DANCE = 0x44E,\\n\\n\\tSMSG_STOP_DANCE = 0x44F,\\n\\n\\tCMSG_SYNC_DANCE = 0x450,\\n\\n\\tCMSG_DANCE_QUERY = 0x451,\\n\\n\\tSMSG_DANCE_QUERY_RESPONSE = 0x452,\\n\\n\\tSMSG_INVALIDATE_DANCE = 0x453,\\n\\n\\tCMSG_DELETE_DANCE = 0x454,\\n\\n\\tSMSG_LEARNED_DANCE_MOVES = 0x455,\\n\\n\\tCMSG_LEARN_DANCE_MOVE = 0x456,\\n\\n\\tCMSG_UNLEARN_DANCE_MOVE = 0x457,\\n\\n\\tCMSG_SET_RUNE_COUNT = 0x458,\\n\\n\\tCMSG_SET_RUNE_COOLDOWN = 0x459,\\n\\n\\tMSG_MOVE_SET_PITCH_RATE_CHEAT = 0x45A,\\n\\n\\tMSG_MOVE_SET_PITCH_RATE = 0x45B,\\n\\n\\tSMSG_FORCE_PITCH_RATE_CHANGE = 0x45C,\\n\\n\\tCMSG_FORCE_PITCH_RATE_CHANGE_ACK = 0x45D,\\n\\n\\tSMSG_SPLINE_SET_PITCH_RATE = 0x45E,\\n\\n\\tCMSG_CALENDAR_EVENT_INVITE_NOTES = 0x45F,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE_NOTES = 0x460,\\n\\n\\tSMSG_CALENDAR_EVENT_INVITE_NOTES_ALERT = 0x461,\\n\\n\\tCMSG_UPDATE_MISSILE_TRAJECTORY = 0x462,\\n\\n\\tSMSG_UPDATE_ACCOUNT_DATA_COMPLETE = 0x463,\\n\\n\\tSMSG_TRIGGER_MOVIE = 0x464,\\n\\n\\tCMSG_COMPLETE_MOVIE = 0x465,\\n\\n\\tCMSG_SET_GLYPH_SLOT = 0x466,\\n\\n\\tCMSG_SET_GLYPH = 0x467,\\n\\n\\tSMSG_ACHIEVEMENT_EARNED = 0x468,\\n\\n\\tSMSG_DYNAMIC_DROP_ROLL_RESULT = 0x469,\\n\\n\\tSMSG_CRITERIA_UPDATE = 0x46A,\\n\\n\\tCMSG_QUERY_INSPECT_ACHIEVEMENTS = 0x46B,\\n\\n\\tSMSG_RESPOND_INSPECT_ACHIEVEMENTS = 0x46C,\\n\\n\\tCMSG_DISMISS_CONTROLLED_VEHICLE = 0x46D,\\n\\n\\tCMSG_COMPLETE_ACHIEVEMENT_CHEAT = 0x46E,\\n\\n\\tSMSG_QUESTUPDATE_ADD_PVP_KILL = 0x46F,\\n\\n\\tCMSG_SET_CRITERIA_CHEAT = 0x470,\\n\\n\\tSMSG_CALENDAR_RAID_LOCKOUT_UPDATED = 0x471,\\n\\n\\tCMSG_UNITANIMTIER_CHEAT = 0x472,\\n\\n\\tCMSG_CHAR_CUSTOMIZE = 0x473,\\n\\n\\tSMSG_CHAR_CUSTOMIZE = 0x474,\\n\\n\\tSMSG_PET_RENAMEABLE = 0x475,\\n\\n\\tCMSG_REQUEST_VEHICLE_EXIT = 0x476,\\n\\n\\tCMSG_REQUEST_VEHICLE_PREV_SEAT = 0x477,\\n\\n\\tCMSG_REQUEST_VEHICLE_NEXT_SEAT = 0x478,\\n\\n\\tCMSG_REQUEST_VEHICLE_SWITCH_SEAT = 0x479,\\n\\n\\tCMSG_PET_LEARN_TALENT = 0x47A,\\n\\n\\tCMSG_PET_UNLEARN_TALENTS = 0x47B,\\n\\n\\tSMSG_SET_PHASE_SHIFT = 0x47C,\\n\\n\\tSMSG_ALL_ACHIEVEMENT_DATA = 0x47D,\\n\\n\\tCMSG_FORCE_SAY_CHEAT = 0x47E,\\n\\n\\tSMSG_HEALTH_UPDATE = 0x47F,\\n\\n\\tSMSG_POWER_UPDATE = 0x480,\\n\\n\\tCMSG_GAMEOBJ_REPORT_USE = 0x481,\\n\\n\\tSMSG_HIGHEST_THREAT_UPDATE = 0x482,\\n\\n\\tSMSG_THREAT_UPDATE = 0x483,\\n\\n\\tSMSG_THREAT_REMOVE = 0x484,\\n\\n\\tSMSG_THREAT_CLEAR = 0x485,\\n\\n\\tSMSG_CONVERT_RUNE = 0x486,\\n\\n\\tSMSG_RESYNC_RUNES = 0x487,\\n\\n\\tSMSG_ADD_RUNE_POWER = 0x488,\\n\\n\\tCMSG_START_QUEST = 0x489,\\n\\n\\tCMSG_REMOVE_GLYPH = 0x48A,\\n\\n\\tCMSG_DUMP_OBJECTS = 0x48B,\\n\\n\\tSMSG_DUMP_OBJECTS_DATA = 0x48C,\\n\\n\\tCMSG_DISMISS_CRITTER = 0x48D,\\n\\n\\tSMSG_NOTIFY_DEST_LOC_SPELL_CAST = 0x48E,\\n\\n\\tCMSG_AUCTION_LIST_PENDING_SALES = 0x48F,\\n\\n\\tSMSG_AUCTION_LIST_PENDING_SALES = 0x490,\\n\\n\\tSMSG_MODIFY_COOLDOWN = 0x491,\\n\\n\\tSMSG_PET_UPDATE_COMBO_POINTS = 0x492,\\n\\n\\tCMSG_ENABLETAXI = 0x493,\\n\\n\\tSMSG_PRE_RESURRECT = 0x494,\\n\\n\\tSMSG_AURA_UPDATE_ALL = 0x495,\\n\\n\\tSMSG_AURA_UPDATE = 0x496,\\n\\n\\tCMSG_FLOOD_GRACE_CHEAT = 0x497,\\n\\n\\tSMSG_SERVER_FIRST_ACHIEVEMENT = 0x498,\\n\\n\\tSMSG_PET_LEARNED_SPELL = 0x499,\\n\\n\\tSMSG_PET_REMOVED_SPELL = 0x49A,\\n\\n\\tCMSG_CHANGE_SEATS_ON_CONTROLLED_VEHICLE = 0x49B,\\n\\n\\tCMSG_HEARTH_AND_RESURRECT = 0x49C,\\n\\n\\tSMSG_ON_CANCEL_EXPECTED_RIDE_VEHICLE_AURA = 0x49D,\\n\\n\\tSMSG_CRITERIA_DELETED = 0x49E,\\n\\n\\tSMSG_ACHIEVEMENT_DELETED = 0x49F,\\n\\n\\tCMSG_SERVER_INFO_QUERY = 0x4A0,\\n\\n\\tSMSG_SERVER_INFO_RESPONSE = 0x4A1,\\n\\n\\tCMSG_CHECK_LOGIN_CRITERIA = 0x4A2,\\n\\n\\tSMSG_SERVER_BUCK_DATA_START = 0x4A3,\\n\\n\\tCMSG_SET_BREATH = 0x4A4,\\n\\n\\tCMSG_QUERY_VEHICLE_STATUS = 0x4A5,\\n\\n\\tSMSG_BATTLEGROUND_INFO_THROTTLED = 0x4A6, // empty, \\\"You can't do that yet\\\"\\n\\n\\tSMSG_PLAYER_VEHICLE_DATA = 0x4A7, // guid+uint32 (vehicle)\\n\\n\\tCMSG_PLAYER_VEHICLE_ENTER = 0x4A8, // uint64\\n\\n\\tCMSG_CONTROLLER_EJECT_PASSENGER = 0x4A9, // uint64\\n\\n\\tSMSG_PET_GUIDS = 0x4AA,\\n\\n\\tSMSG_CLIENTCACHE_VERSION = 0x4AB,\\n\\n\\tCMSG_CHANGE_GDF_ARENA_RATING = 0x4AC,\\n\\n\\tCMSG_SET_ARENA_TEAM_RATING_BY_INDEX = 0x4AD,\\n\\n\\tCMSG_SET_ARENA_TEAM_WEEKLY_GAMES = 0x4AE,\\n\\n\\tCMSG_SET_ARENA_TEAM_SEASON_GAMES = 0x4AF,\\n\\n\\tCMSG_SET_ARENA_MEMBER_WEEKLY_GAMES = 0x4B0,\\n\\n\\tCMSG_SET_ARENA_MEMBER_SEASON_GAMES = 0x4B1,\\n\\n\\tSMSG_ITEM_REFUND_INFO_RESPONSE = 0x4B2,\\n\\n\\tCMSG_ITEM_REFUND_INFO = 0x4B3,\\n\\n\\tCMSG_ITEM_REFUND = 0x4B4, // lua: ContainerRefundItemPurchase\\n\\n\\tSMSG_ITEM_REFUND_RESULT = 0x4B5,\\n\\n\\tCMSG_CORPSE_MAP_POSITION_QUERY = 0x4B6, // uint32\\n\\n\\tSMSG_CORPSE_MAP_POSITION_QUERY_RESPONSE = 0x4B7, // 3*float+float\\n\\n\\tCMSG_UNUSED5 = 0x4B8,\\n\\n\\tCMSG_UNUSED6 = 0x4B9,\\n\\n\\tCMSG_CALENDAR_EVENT_SIGNUP = 0x4BA, // uint64\\n\\n\\tSMSG_CALENDAR_CLEAR_PENDING_ACTION = 0x4BB,\\n\\n\\tSMSG_EQUIPMENT_SET_LIST = 0x4BC, // equipment manager list?\\n\\n\\tCMSG_EQUIPMENT_SET_SAVE = 0x4BD,\\n\\n\\tCMSG_UPDATE_PROJECTILE_POSITION = 0x4BE,\\n\\n\\tSMSG_SET_PROJECTILE_POSITION = 0x4BF,\\n\\n\\tSMSG_TALENTS_INFO = 0x4C0,\\n\\n\\tCMSG_LEARN_PREVIEW_TALENTS = 0x4C1,\\n\\n\\tCMSG_LEARN_PREVIEW_TALENTS_PET = 0x4C2,\\n\\n\\tCMSG_SET_ACTIVE_TALENT_GROUP_OBSOLETE = 0x4C3,\\n\\n\\tCMSG_GM_GRANT_ACHIEVEMENT = 0x4C4,\\n\\n\\tCMSG_GM_REMOVE_ACHIEVEMENT = 0x4C5,\\n\\n\\tCMSG_GM_SET_CRITERIA_FOR_PLAYER = 0x4C6,\\n\\n\\tSMSG_ARENA_UNIT_DESTROYED = 0x4C7,\\n\\n\\tSMSG_ARENA_TEAM_CHANGE_FAILED_QUEUED = 0x4C8, // uint32 \\\"Can't modify arena team while queued or in a match.\\\"\\n\\n\\tCMSG_PROFILEDATA_REQUEST = 0x4C9,\\n\\n\\tSMSG_PROFILEDATA_RESPONSE = 0x4CA,\\n\\n\\tCMSG_START_BATTLEFIELD_CHEAT = 0x4CB,\\n\\n\\tCMSG_END_BATTLEFIELD_CHEAT = 0x4CC,\\n\\n\\tSMSG_MULTIPLE_PACKETS = 0x4CD,\\n\\n\\tSMSG_MOVE_GRAVITY_DISABLE = 0x4CE,\\n\\n\\tCMSG_MOVE_GRAVITY_DISABLE_ACK = 0x4CF,\\n\\n\\tSMSG_MOVE_GRAVITY_ENABLE = 0x4D0,\\n\\n\\tCMSG_MOVE_GRAVITY_ENABLE_ACK = 0x4D1,\\n\\n\\tMSG_MOVE_GRAVITY_CHNG = 0x4D2,\\n\\n\\tSMSG_SPLINE_MOVE_GRAVITY_DISABLE = 0x4D3,\\n\\n\\tSMSG_SPLINE_MOVE_GRAVITY_ENABLE = 0x4D4,\\n\\n\\tCMSG_EQUIPMENT_SET_USE = 0x4D5,\\n\\n\\tSMSG_EQUIPMENT_SET_USE_RESULT = 0x4D6,\\n\\n\\tCMSG_FORCE_ANIM = 0x4D7,\\n\\n\\tSMSG_FORCE_ANIM = 0x4D8,\\n\\n\\tCMSG_CHAR_FACTION_CHANGE = 0x4D9,\\n\\n\\tSMSG_CHAR_FACTION_CHANGE = 0x4DA,\\n\\n\\tCMSG_PVP_QUEUE_STATS_REQUEST = 0x4DB,\\n\\n\\tSMSG_PVP_QUEUE_STATS = 0x4DC,\\n\\n\\tCMSG_SET_PAID_SERVICE_CHEAT = 0x4DD,\\n\\n\\tSMSG_BATTLEFIELD_MGR_ENTRY_INVITE = 0x4DE, // uint32\\n\\n\\tCMSG_BATTLEFIELD_MGR_ENTRY_INVITE_RESPONSE = 0x4DF,\\n\\n\\tSMSG_BATTLEFIELD_MGR_ENTERED = 0x4E0, // uint32, uint8, uint8\\n\\n\\tSMSG_BATTLEFIELD_MGR_QUEUE_INVITE = 0x4E1, // uint32\\n\\n\\tCMSG_BATTLEFIELD_MGR_QUEUE_INVITE_RESPONSE = 0x4E2,\\n\\n\\tCMSG_BATTLEFIELD_MGR_QUEUE_REQUEST = 0x4E3,\\n\\n\\tSMSG_BATTLEFIELD_MGR_QUEUE_REQUEST_RESPONSE = 0x4E4, // uint32, uint8\\n\\n\\tSMSG_BATTLEFIELD_MGR_EJECT_PENDING = 0x4E5, // uint32\\n\\n\\tSMSG_BATTLEFIELD_MGR_EJECTED = 0x4E6, // uint32, uint32, uint8\\n\\n\\tCMSG_BATTLEFIELD_MGR_EXIT_REQUEST = 0x4E7,\\n\\n\\tSMSG_BATTLEFIELD_MGR_STATE_CHANGE = 0x4E8, // uint32, uint32\\n\\n\\tCMSG_BATTLEFIELD_MANAGER_ADVANCE_STATE = 0x4E9,\\n\\n\\tCMSG_BATTLEFIELD_MANAGER_SET_NEXT_TRANSITION_TIME = 0x4EA,\\n\\n\\tMSG_SET_RAID_DIFFICULTY = 0x4EB,\\n\\n\\tCMSG_TOGGLE_XP_GAIN = 0x4EC,\\n\\n\\tSMSG_TOGGLE_XP_GAIN = 0x4ED, // enable/disable XP gain console message\\n\\n\\tSMSG_GMRESPONSE_DB_ERROR = 0x4EE, // empty\\n\\n\\tSMSG_GMRESPONSE_RECEIVED = 0x4EF, // uint32, uint32, string[2000], string[4000][4]\\n\\n\\tCMSG_GMRESPONSE_RESOLVE = 0x4F0,\\n\\n\\tSMSG_GMRESPONSE_STATUS_UPDATE = 0x4F1, // uint8 (1 - EVENT_GMSURVEY_DISPLAY, 0 - EVENT_UPDATE_TICKET)\\n\\n\\tSMSG_GMRESPONSE_CREATE_TICKET = 0x4F2,\\n\\n\\tCMSG_GMRESPONSE_CREATE_TICKET = 0x4F3,\\n\\n\\tCMSG_SERVERINFO = 0x4F4,\\n\\n\\tSMSG_SERVERINFO = 0x4F5,\\n\\n\\tCMSG_WORLD_STATE_UI_TIMER_UPDATE = 0x4F6,\\n\\n\\tSMSG_WORLD_STATE_UI_TIMER_UPDATE = 0x4F7,\\n\\n\\tCMSG_CHAR_RACE_CHANGE = 0x4F8,\\n\\n\\tMSG_VIEW_PHASE_SHIFT = 0x4F9,\\n\\n\\tSMSG_TALENTS_INVOLUNTARILY_RESET = 0x4FA, // uint8\\n\\n\\tCMSG_DEBUG_SERVER_GEO = 0x4FB,\\n\\n\\tSMSG_DEBUG_SERVER_GEO = 0x4FC,\\n\\n\\tSMSG_LOOT_SLOT_CHANGED = 0x4FD,\\n\\n\\tUMSG_UPDATE_GROUP_INFO = 0x4FE,\\n\\n\\tCMSG_READY_FOR_ACCOUNT_DATA_TIMES = 0x4FF,\\n\\n\\tCMSG_QUERY_QUESTS_COMPLETED = 0x500,\\n\\n\\tSMSG_QUERY_QUESTS_COMPLETED_RESPONSE = 0x501,\\n\\n\\tCMSG_GM_REPORT_LAG = 0x502,\\n\\n\\tCMSG_AFK_MONITOR_INFO_REQUEST = 0x503,\\n\\n\\tSMSG_AFK_MONITOR_INFO_RESPONSE = 0x504,\\n\\n\\tCMSG_AFK_MONITOR_INFO_CLEAR = 0x505,\\n\\n\\tSMSG_CORPSE_NOT_IN_INSTANCE = 0x506,\\n\\n\\tCMSG_GM_NUKE_CHARACTER = 0x507,\\n\\n\\tCMSG_SET_ALLOW_LOW_LEVEL_RAID1 = 0x508,\\n\\n\\tCMSG_SET_ALLOW_LOW_LEVEL_RAID2 = 0x509,\\n\\n\\tSMSG_CAMERA_SHAKE = 0x50A, // uint32 SpellEffectCameraShakes.dbc index, uint32\\n\\n\\tSMSG_SOCKET_GEMS_RESULT = 0x50B,\\n\\n\\tCMSG_SET_CHARACTER_MODEL = 0x50C,\\n\\n\\tSMSG_REDIRECT_CLIENT = 0x50D, // uint32 ip, uint16 port, uint32 unk, uint8[20] hash (ip + port, seed=sessionkey)\\n\\n\\tCMSG_REDIRECTION_FAILED = 0x50E, // something with networking\\n\\n\\tSMSG_SUSPEND_COMMS = 0x50F,\\n\\n\\tCMSG_SUSPEND_COMMS_ACK = 0x510,\\n\\n\\tSMSG_FORCE_SEND_QUEUED_PACKETS = 0x511,\\n\\n\\tCMSG_REDIRECTION_AUTH_PROOF = 0x512,\\n\\n\\tCMSG_DROP_NEW_CONNECTION = 0x513,\\n\\n\\tSMSG_SEND_ALL_COMBAT_LOG = 0x514,\\n\\n\\tSMSG_OPEN_LFG_DUNGEON_FINDER = 0x515,\\n\\n\\tSMSG_MOVE_SET_COLLISION_HGT = 0x516,\\n\\n\\tCMSG_MOVE_SET_COLLISION_HGT_ACK = 0x517,\\n\\n\\tMSG_MOVE_SET_COLLISION_HGT = 0x518,\\n\\n\\tCMSG_CLEAR_RANDOM_BG_WIN_TIME = 0x519,\\n\\n\\tCMSG_CLEAR_HOLIDAY_BG_WIN_TIME = 0x51A,\\n\\n\\tCMSG_COMMENTATOR_SKIRMISH_QUEUE_COMMAND = 0x51B,\\n\\n\\tSMSG_COMMENTATOR_SKIRMISH_QUEUE_RESULT1 = 0x51C,\\n\\n\\tSMSG_COMMENTATOR_SKIRMISH_QUEUE_RESULT2 = 0x51D,\\n\\n\\tSMSG_MULTIPLE_MOVES = 0x51E, // uncompressed version of SMSG_COMPRESSED_MOVES\\n\\n\\tNUM_MSG_TYPES = 0x51F\\n\",\n \"file_path\": \"owClient/WorldSocket/Opcodes.h\",\n \"rank\": 0,\n \"score\": 88797.40201669149\n },\n {\n \"content\": \"#define SN_netscape_cert_sequence \\\"nsCertSequence\\\"\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 1,\n \"score\": 75441.28331141104\n },\n {\n \"content\": \"#define NID_netscape_cert_sequence 79\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 2,\n \"score\": 75441.28331141104\n },\n {\n \"content\": \"#define OBJ_netscape_cert_sequence OBJ_netscape_data_type,5L\\n\\n\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 3,\n \"score\": 75441.28331141104\n },\n {\n \"content\": \"#define LN_netscape_cert_sequence \\\"Netscape Certificate Sequence\\\"\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 4,\n \"score\": 75441.28331141104\n },\n {\n \"content\": \"#define NID_id_cmc_dataReturn 330\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 5,\n \"score\": 73547.06373468976\n },\n {\n \"content\": \"#define OBJ_id_cmc_dataReturn OBJ_id_cmc,4L\\n\\n\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 6,\n \"score\": 73547.06373468976\n },\n {\n \"content\": \"#define SN_id_cmc_dataReturn \\\"id-cmc-dataReturn\\\"\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/obj_mac.h\",\n \"rank\": 7,\n \"score\": 73547.06373468976\n },\n {\n \"content\": \"#define __DBC_TVALUE(type, _name, _field) \\\\\\n\\ntype CONCAT_GET(_name)() const \\\\\\n\\n{ \\\\\\n\\n\\treturn getValue<type>(static_cast<uint32>(_field - 1)); \\\\\\n\\n}\\n\\n\\n\\n#define __DBC_TARRAY(_type, _name, _field, _size) \\\\\\n\\n_type CONCAT_GET(_name)(uint8 _index) const \\\\\\n\\n{ \\\\\\n\\n _ASSERT(_index < _size); \\\\\\n\\n\\treturn getValue<_type>(static_cast<uint32>(_field - 1 + _index)); \\\\\\n\\n}\\n\\n\\n\\n#define __DBC_STRING(_name, _field) \\\\\\n\\nstd::string CONCAT_GET(_name)() const \\\\\\n\\n{ \\\\\\n\\n\\treturn getString(static_cast<uint32>(_field - 1)); \\\\\\n\\n}\\n\\n\\n\\n#define __DBC_STRARR(_name, _field, _size) \\\\\\n\\nstd::string CONCAT_GET(_name)(uint8 _index) const \\\\\\n\",\n \"file_path\": \"owGame/DBC/DBC__Macros.h\",\n \"rank\": 8,\n \"score\": 68140.65998280243\n },\n {\n \"content\": \"enum class EWoWObjectHighGuid : uint16\\n\\n{\\n\\n Item = 0x4000, // blizz 4000\\n\\n Container = 0x4000, // blizz 4000\\n\\n Player = 0x0000, // blizz 0000\\n\\n GameObject = 0xF110, // blizz F110\\n\\n Transport = 0xF120, // blizz F120 (for GAMEOBJECT_TYPE_TRANSPORT)\\n\\n Unit = 0xF130, // blizz F130\\n\\n Pet = 0xF140, // blizz F140\\n\\n Vehicle = 0xF150, // blizz F550\\n\\n DynamicObject = 0xF100, // blizz F100\\n\\n Corpse = 0xF101, // blizz F100\\n\\n Mo_Transport = 0x1FC0, // blizz 1FC0 (for GAMEOBJECT_TYPE_MO_TRANSPORT)\\n\\n Instance = 0x1F40, // blizz 1F40\\n\\n Group = 0x1F50,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"owClient/World/WoWGUID.h\",\n \"rank\": 9,\n \"score\": 63004.6695290205\n },\n {\n \"content\": \"struct SM2_Loop\\n\\n{\\n\\n\\tuint32 timestamp;\\n\",\n \"file_path\": \"owGame/M2/M2_Types.h\",\n \"rank\": 10,\n \"score\": 44571.486098594636\n },\n {\n \"content\": \"struct SM2_Sequence\\n\\n{\\n\\n\\tFOREIGN_KEY_ID(uint16, DBC_AnimationData, animID); // Animation id in AnimationData.dbc\\t\\n\\n\\tuint16 variationIndex;\\t\\t\\t// Sub-animation id: Which number in a row of animations this one is.\\n\\n\\n\\n#if WOW_CLIENT_VERSION <= WOW_BC_2_4_3\\n\\n\\tuint32_t start_timestamp;\\n\\n\\tuint32_t end_timestamp;\\n\\n#else\\n\\n\\tuint32_t duration;\\n\\n#endif\\n\\n\\n\\n\\tfloat movespeed;\\t\\t\\t\\t// This is the speed the character moves with in this animation.\\n\\n\\n\\n\\tstruct Flags\\n\\n\\t{\\n\\n\\t\\tuint32 unk0x01 : 1;\\n\\n\\t\\tuint32 unk0x02 : 1;\\n\\n\\t\\tuint32 unk0x04 : 1;\\n\\n\\t\\tuint32 unk0x08 : 1;\\n\\n\\t\\tuint32 LowPrioritySeq : 1;\\n\\n\\t\\tuint32 DataInM2 : 1; // If set, the animation data is in the .m2 file. If not set, the animation data is in an .anim file.\\n\\n\\t\\tuint32 HasNext : 1; // (To find the animation data, the client skips these by following aliasNext until an animation without 0x40 is found.)\\n\\n\\t\\tuint32 IsBlended : 1; // (if either side of a transition has 0x80, lerp between end->start states, unless end==start by comparing bone values)\\n\\n\\t\\tuint32 : 24;\\n\\n\\t} flags;\\n\\n\\tint16\\t\\tfrequency;\\t\\t\\t\\t// This is used to determine how often the animation is played. For all animations of the same type, this adds up to 0x7FFF (32767).\\n\\n\\tuint16\\t\\tunk0;\\n\\n\\tM2Range\\t\\treplay;\\t\\t\\t\\t\\t// May both be 0 to not repeat. Client will pick a random number of repetitions within bounds if given.\\n\\n\\tuint32\\t\\tblendTime;\\n\\n\\n\\n\\tM2Bounds\\tbounds;\\n\\n\\tint16\\t\\tvariationNext;\\t\\t\\t// id of the following animation of this AnimationID, points to an Index or is -1 if none.\\n\\n\\tuint16\\t\\taliasNext;\\t\\t\\t\\t// id in the list of animations. Used to find actual animation if this sequence is an alias (flags & 0x40)\\n\",\n \"file_path\": \"owGame/M2/M2_Types.h\",\n \"rank\": 11,\n \"score\": 44566.94643720141\n },\n {\n \"content\": \" int16\\t\\t\\t\\t\\t\\t\\t\\tglobal_sequence;\\n\",\n \"file_path\": \"owGame/M2/M2_CommonTypes.h\",\n \"rank\": 12,\n \"score\": 43321.11626601458\n },\n {\n \"content\": \"const float C_ChunkSize = C_TileSize / 16.0f;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 13,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const float C_UnitSize = C_ChunkSize / 8.0f;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 14,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const uint32 C_RenderedTiles = 1u;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 15,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const uint32 C_TilesInMap = 64u;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 16,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const float C_ZeroPoint = 32.0f * C_TileSize; // 17066.66656\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 17,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const int32 C_ChunksInTile = 16;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 18,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const float C_DetailSize = 8.0f;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 19,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const float C_TileSize = 533.3333333333f;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 20,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"const float C_AlphaSize = 1.0f;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 21,\n \"score\": 43316.86666275927\n },\n {\n \"content\": \"DBC_DEF_BEGIN(DBC_CinematicSequences)\\n\\n\\n\",\n \"file_path\": \"owGame/DBC/Tables/DBC_CinematicSequences.h\",\n \"rank\": 22,\n \"score\": 42143.04417151918\n },\n {\n \"content\": \"const int32 C_ChunksInTileGlobal = C_ChunksInTile * C_ChunksInTile;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 23,\n \"score\": 42138.91013174513\n },\n {\n \"content\": \"const uint32 C_TilesCacheSize = ((C_RenderedTiles + 1u) * (C_RenderedTiles + 1u));\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 24,\n \"score\": 42138.91013174513\n },\n {\n \"content\": \"const int32 C_MapBufferSize = 9 * 9 + 8 * 8;\\n\",\n \"file_path\": \"owGame/Utils/WowConsts.h\",\n \"rank\": 25,\n \"score\": 42138.91013174513\n },\n {\n \"content\": \" DES_cblock h, hh;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/mdc2.h\",\n \"rank\": 26,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" ASN1_TIME *notBefore;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509.h\",\n \"rank\": 27,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" union {\\n\\n SHA_LONG64 d[SHA_LBLOCK];\\n\\n unsigned char p[SHA512_CBLOCK];\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/sha.h\",\n \"rank\": 28,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" MD4_LONG A, B, C, D;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/md4.h\",\n \"rank\": 29,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" ASN1_ITEM_EXP *it;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509v3.h\",\n \"rank\": 30,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" int (*check_purpose) (const struct x509_purpose_st *, const X509 *, int);\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509v3.h\",\n \"rank\": 31,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" unsigned char *out;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/evp.h\",\n \"rank\": 32,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" int (*adb_cb)(long *psel); /* Application callback */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 33,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" RIPEMD160_LONG A, B, C, D, E;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/ripemd.h\",\n \"rank\": 34,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" union {\\n\\n double d; /* ensures 64-bit align */\\n\\n KEY_TABLE_TYPE rd_key;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/camellia.h\",\n \"rank\": 35,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" union {\\n\\n ASN1_NULL *inherit;\\n\\n IPAddressOrRanges *addressesOrRanges;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509v3.h\",\n \"rank\": 36,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" const BIGNUM *g;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/srp.h\",\n \"rank\": 37,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" BIGNUM *s;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/srp.h\",\n \"rank\": 38,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" MD5_LONG A, B, C, D;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/md5.h\",\n \"rank\": 39,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" SHA_LONG64 h[8];\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/sha.h\",\n \"rank\": 40,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" RC4_INT x, y;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/rc4.h\",\n \"rank\": 41,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" ASN1_GENERALIZEDTIME *notAfter;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509v3.h\",\n \"rank\": 42,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" BIGNUM *v;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/srp.h\",\n \"rank\": 43,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" int (*load) (CONF *conf, const char *name, long *eline);\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/conf.h\",\n \"rank\": 44,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" ASN1_GENERALIZEDTIME *notBefore;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509v3.h\",\n \"rank\": 45,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" union {\\n\\n ASN1_IA5STRING *cpsuri;\\n\\n USERNOTICE *usernotice;\\n\\n ASN1_TYPE *other;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509v3.h\",\n \"rank\": 46,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" int (*check_trust) (struct x509_trust_st *, X509 *, int);\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509.h\",\n \"rank\": 47,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" BIO *out;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 48,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" ASN1_TIME *notAfter;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/x509.h\",\n \"rank\": 49,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" union {\\n\\n char *ptr;\\n\\n /* NID_pkcs7_data */\\n\\n ASN1_OCTET_STRING *data;\\n\\n /* NID_pkcs7_signed */\\n\\n PKCS7_SIGNED *sign;\\n\\n /* NID_pkcs7_enveloped */\\n\\n PKCS7_ENVELOPE *enveloped;\\n\\n /* NID_pkcs7_signedAndEnveloped */\\n\\n PKCS7_SIGN_ENVELOPE *signed_and_enveloped;\\n\\n /* NID_pkcs7_digest */\\n\\n PKCS7_DIGEST *digest;\\n\\n /* NID_pkcs7_encrypted */\\n\\n PKCS7_ENCRYPT *encrypted;\\n\\n /* Anything else */\\n\\n ASN1_TYPE *other;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/pkcs7.h\",\n \"rank\": 50,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" int (*status) (void);\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/rand.h\",\n \"rank\": 51,\n \"score\": 40723.64097802318\n },\n {\n \"content\": \" long plen; /* length */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 52,\n \"score\": 39558.11710804085\n },\n {\n \"content\": \" const void *funcs; /* functions that handle this type */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 53,\n \"score\": 39557.91970742002\n },\n {\n \"content\": \" long tcount; /* Number of templates if SEQUENCE or CHOICE */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 54,\n \"score\": 39557.91970742002\n },\n {\n \"content\": \" long utype; /* underlying type */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 55,\n \"score\": 39557.74866401569\n },\n {\n \"content\": \" int bitnum;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 56,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" unsigned char *enc; /* DER encoding */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 57,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" int modified; /* set to 1 if 'enc' is invalid */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 58,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" int type;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 59,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" const char *lname;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 60,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" unsigned long flags; /* Various flags */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 61,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" union {\\n\\n char *ptr;\\n\\n ASN1_BOOLEAN boolean;\\n\\n ASN1_STRING *asn1_string;\\n\\n ASN1_OBJECT *object;\\n\\n ASN1_INTEGER *integer;\\n\\n ASN1_ENUMERATED *enumerated;\\n\\n ASN1_BIT_STRING *bit_string;\\n\\n ASN1_OCTET_STRING *octet_string;\\n\\n ASN1_PRINTABLESTRING *printablestring;\\n\\n ASN1_T61STRING *t61string;\\n\\n ASN1_IA5STRING *ia5string;\\n\\n ASN1_GENERALSTRING *generalstring;\\n\\n ASN1_BMPSTRING *bmpstring;\\n\\n ASN1_UNIVERSALSTRING *universalstring;\\n\\n ASN1_UTCTIME *utctime;\\n\\n ASN1_GENERALIZEDTIME *generalizedtime;\\n\\n ASN1_VISIBLESTRING *visiblestring;\\n\\n ASN1_UTF8STRING *utf8string;\\n\\n /*\\n\\n * set and sequence are left complete and still contain the set or\\n\\n * sequence bytes\\n\\n */\\n\\n ASN1_STRING *set;\\n\\n ASN1_STRING *sequence;\\n\\n ASN1_VALUE *asn1_value;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 62,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" unsigned long offset; /* Offset of this field in structure */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 63,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" unsigned long flags;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 64,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" const char *sname;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 65,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" long maxsize;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 66,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" long tag; /* tag, not used if no tagging */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1t.h\",\n \"rank\": 67,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" int nid;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 68,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" long minsize;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 69,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" unsigned char *data;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 70,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" long len; /* Length of encoding */\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 71,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" int length;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 72,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \" unsigned long mask;\\n\",\n \"file_path\": \"Externals/OpenSSL/include/openssl/asn1.h\",\n \"rank\": 73,\n \"score\": 39552.50909168249\n },\n {\n \"content\": \"\\t\\tif (SequenceIndex < GetCount())\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (m_Values[SequenceIndex].empty())\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n\\n\\n\\tinline T GetValue(uint16 SequenceIndex, uint32 time, const std::vector<SM2_Loop>& GlobalLoop, const uint32 GlobalTime, bool ForceLinear = false) const\\n\\n\\t{\\n\\n\\t\\tif (IsStaticValue())\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn m_Values.at(0).at(0);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// obtain a time value and a values range\\n\\n\\t\\tif (m_GlobalSecIndex != -1)\\n\",\n \"file_path\": \"owGame/M2/M2_Animated.h\",\n \"rank\": 75,\n \"score\": 19.57350032290633\n },\n {\n \"content\": \"void CM2_Comp_Skeleton::Load(const SM2_Header& M2Header, const std::shared_ptr<IByteBuffer>& File)\\n\\n{\\n\\n\\tif (M2Header.global_loops.size > 0)\\n\\n\\t{\\n\\n\\t\\tconst SM2_Loop* GlobalLoops = (const SM2_Loop*)(File->getData() + M2Header.global_loops.offset);\\n\\n\\t\\tfor (uint32 i = 0; i < M2Header.global_loops.size; i++)\\n\\n\\t\\t\\tm_GlobalLoops.push_back(GlobalLoops[i]);\\n\\n\\t}\\n\\n\\n\\n\\t// Sequences\\n\\n\\tif (M2Header.sequences.size > 0)\\n\\n\\t{\\n\\n\\t\\tconst SM2_Sequence* Sequences = (const SM2_Sequence*)(File->getData() + M2Header.sequences.offset);\\n\\n\\t\\tfor (uint32 i = 0; i < M2Header.sequences.size; i++)\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_Sequences.push_back(Sequences[i]);\\n\\n\\n\\n\\t\\t\\tif (Sequences[i].flags.DataInM2)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tanimFiles.push_back(nullptr);\\n\",\n \"file_path\": \"owGame/M2/M2_Comp_Skeleton.cpp\",\n \"rank\": 77,\n \"score\": 16.850029349490654\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\tm_ValuesHermiteIn[j].push_back(fixfunc(Conv::conv(values[i * 3 + 1])));\\n\\n\\t\\t\\t\\t\\t\\tm_ValuesHermiteOut[j].push_back(fixfunc(Conv::conv(values[i * 3 + 2])));\\n\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t//default:\\n\\n\\t\\t\\t\\t\\t\\t//\\t_ASSERT_EXPR(false, \\\"M2_Animated: Unknown interpolation type.\\\");\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tinline bool IsUsesBySequence(uint16 SequenceIndex) const\\n\\n\\t{\\n\\n\\t\\tif (IsStaticValue())\\n\\n\\t\\t\\treturn true;\\n\\n\\n\\n\\t\\t// Global sec always use\\n\\n\\t\\tif (m_GlobalSecIndex != -1)\\n\\n\\t\\t\\treturn true;\\n\\n\\n\",\n \"file_path\": \"owGame/M2/M2_Animated.h\",\n \"rank\": 78,\n \"score\": 15.727656540650248\n },\n {\n \"content\": \"\\t_ASSERT(M2Instance != nullptr);\\n\\n\\n\\n\\tif (const auto& animator = M2Instance->GetAnimatorComponent())\\n\\n\\t\\tif (m_ColorAnimated.IsUsesBySequence(animator->getSequenceIndex()))\\n\\n\\t\\t\\treturn m_ColorAnimated.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), GlobalTime);\\n\\n\\treturn glm::vec3(1.0f, 0.0f, 0.0f);\\n\\n}\\n\\n\\n\\nfloat CM2_Part_Color::GetAlpha(const CM2_Base_Instance* M2Instance, uint32 GlobalTime) const\\n\\n{\\n\\n\\t_ASSERT(M2Instance != nullptr);\\n\\n\\n\\n\\tif (const auto& animator = M2Instance->GetAnimatorComponent())\\n\\n\\t\\tif (m_AlphaAnimated.IsUsesBySequence(animator->getSequenceIndex()))\\n\\n\\t\\t\\treturn m_AlphaAnimated.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), GlobalTime);\\n\\n\\treturn 0.5f;\\n\\n}\\n\",\n \"file_path\": \"owGame/M2/M2_Part_Color.cpp\",\n \"rank\": 79,\n \"score\": 15.295830860716789\n },\n {\n \"content\": \"\\t\\tfloat horizontalRangeValue = horizontalRange.GetValue(sequence, sequenceTime, m_M2Object.getSkeleton().getGlobalLoops(), globalTime);\\n\\n\\n\\n\\t\\tbool enabledValue = true;\\n\\n\\t\\tif (enabled.IsUsesBySequence(sequence))\\n\\n\\t\\t\\tenabledValue = enabled.GetValue(sequence, sequenceTime, m_M2Object.getSkeleton().getGlobalLoops(), globalTime) != 0;\\n\\n\\n\\n\\t\\tif (false == enabledValue)\\n\\n\\t\\t\\treturn;\\n\\n\\n\\n\\t\\tfor (int i = 0; i < tospawn; i++)\\n\\n\\t\\t{\\n\\n\\t\\t\\tsize_t freeIndex = -1;\\n\\n\\t\\t\\tfor (size_t ind = 0; ind < MAX_PARTICLES; ind++)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (false == Particles[ind].Active)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tfreeIndex = ind;\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\",\n \"file_path\": \"owGame/M2/M2_Part_ParticleSystem.cpp\",\n \"rank\": 80,\n \"score\": 15.009433618092208\n },\n {\n \"content\": \"\\n\\n\\t\\tif (m_GlobalSecIndex == -1 && m_Ranges.size() <= SequenceIndex)\\n\\n\\t\\t\\treturn false;\\n\\n\\n\\n\\t\\tif (m_Values.empty())\\n\\n\\t\\t\\treturn false; // ????\\n\\n\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\tinline T GetValue(uint16 SequenceIndex, uint32 time, const std::vector<SM2_Loop>& GlobalLoop, const uint32 GlobalTime) const\\n\\n\\t{\\n\\n\\t\\t_ASSERT(m_Values.empty() == false);\\n\\n\\t\\tif (m_Values.size() == 1)\\n\\n\\t\\t\\treturn m_Values[0];\\n\\n\\n\\n std::pair<uint32, uint32> range = std::make_pair(0, m_Values.size() - 1);\\n\\n\\n\\n\\t\\t// obtain a time value and a values range\\n\\n\\t\\tif (m_GlobalSecIndex != -1)\\n\",\n \"file_path\": \"owGame/M2/M2_Animated.h\",\n \"rank\": 81,\n \"score\": 14.46424231463656\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nvoid CWorldSocket::AddHandler(Opcodes Opcode, std::function<void(CServerPacket&)> Handler)\\n\\n{\\n\\n\\t_ASSERT(Handler != nullptr);\\n\\n\\tm_Handlers.insert(std::make_pair(Opcode, Handler));\\n\\n}\\n\\n\\n\\nbool CWorldSocket::ProcessPacket(CServerPacket& ServerPacket)\\n\\n{\\n\\n\\tServerPacket.seek(0);\\n\\n\\n\\n\\tconst auto& handler = m_Handlers.find(ServerPacket.GetPacketOpcode());\\n\\n\\tif (handler != m_Handlers.end())\\n\\n\\t{\\n\\n\\t\\t_ASSERT(handler->second != nullptr);\\n\",\n \"file_path\": \"owClient/WorldSocket/WorldSocket.cpp\",\n \"rank\": 82,\n \"score\": 14.363836726913515\n },\n {\n \"content\": \"#include \\\"stdafx.h\\\"\\n\\n\\n\\n// Include\\n\\n#include \\\"M2.h\\\"\\n\\n\\n\\n// General\\n\\n#include \\\"M2_Animation.h\\\"\\n\\n\\n\\nCM2_Animation::CM2_Animation(const CM2& M2Model, const SM2_Sequence& Sequence, std::string AnimationName, uint16 IndexIntoSeq)\\n\\n\\t: m_AnimID((EAnimationID)Sequence.__animID)\\n\\n\\t, m_AnimationName(AnimationName + \\\"_\\\" + std::to_string(IndexIntoSeq))\\n\\n\\t, m_SequenceIndex(IndexIntoSeq)\\n\\n#if WOW_CLIENT_VERSION <= WOW_BC_2_4_3\\n\\n\\t, m_StartTimeStamp(Sequence.start_timestamp)\\n\\n , m_EndTimeStamp(Sequence.end_timestamp)\\n\\n#else\\n\\n\\t, m_Duration(Sequence.duration)\\n\\n#endif\\n\\n{\\n\\n\\tif (Sequence.variationNext != -1)\\n\",\n \"file_path\": \"owGame/M2/M2_Animation.cpp\",\n \"rank\": 83,\n \"score\": 13.811921717620134\n },\n {\n \"content\": \"}\\n\\n\\n\\nbool CWMO_Base_Instance::IsDoodadInSet(uint16 doodadIndex) const\\n\\n{\\n\\n\\tif (GetWMO().IsDoodadInSet(0, doodadIndex))\\n\\n\\t\\treturn true;\\n\\n\\n\\n\\tif (GetDoodadSetIndex() != 0)\\n\\n\\t\\treturn GetWMO().IsDoodadInSet(GetDoodadSetIndex(), doodadIndex);\\n\\n\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\n//\\n\\n// ISceneNode\\n\\n//\\n\\nvoid CWMO_Base_Instance::Initialize()\\n\\n{\\n\",\n \"file_path\": \"owGame/WMO/WMO_Base_Instance.cpp\",\n \"rank\": 84,\n \"score\": 13.767590745128237\n },\n {\n \"content\": \"void CWorldServer::AddHandler(Opcodes Opcode, std::function<void(CServerPacket&)> Handler)\\n\\n{\\n\\n\\t_ASSERT(Handler != nullptr);\\n\\n\\tm_Handlers.insert(std::make_pair(Opcode, Handler));\\n\\n}\\n\\n\\n\\nbool CWorldServer::ProcessPacket(CServerPacket& ServerPacket)\\n\\n{\\n\\n\\tconst auto& handler = m_Handlers.find(ServerPacket.GetPacketOpcode());\\n\\n\\tif (handler != m_Handlers.end())\\n\\n\\t{\\n\\n\\t\\t_ASSERT(handler->second != nullptr);\\n\\n\\t\\t(handler->second).operator()(ServerPacket);\\n\\n\\n\\n\\t\\tif (ServerPacket.getPos() != ServerPacket.getSize())\\n\\n\\t\\t\\tthrow CException(\\\"CWorldServer::ProcessPacket: Packet '%d' is not fully readed. %d of %d.\\\", ServerPacket.GetPacketOpcode(), ServerPacket.getPos(), ServerPacket.getSize());\\n\\n\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"owClient/World/WorldServer.cpp\",\n \"rank\": 85,\n \"score\": 13.725974297212709\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nMinimapDir* CMinimapProvider::getMinimap(std::string _name)\\n\\n{\\n\\n\\tfor (auto& it : m_Minimaps)\\n\\n\\t{\\n\\n\\t\\tif (it->name == _name)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn it;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\t\\n\\n\\treturn nullptr;\\n\\n}\\n\\n\\n\\nvoid MinimapDir::Load()\\n\\n{\\n\\n\\t/*for (auto& it : data)\\n\",\n \"file_path\": \"owGame/Map/MinimapProvider.cpp\",\n \"rank\": 86,\n \"score\": 13.623692228570713\n },\n {\n \"content\": \"\\tvoid Update(const UpdateEventArgs& e) override;\\n\\n\\n\\nprotected:\\n\\n\\tconst CM2_Base_Instance& GetM2OwnerNode() const;\\n\\n\\n\\nprivate:\\n\\n\\tstd::unordered_map<uint16, std::shared_ptr<CM2_Animation>>\\tm_Animations;\\n\\n\\n\\n\\tEAnimationID m_CurrentAnimationID;\\n\\n\\tconst CM2_Animation*\\t\\tm_CurrentAnimation;\\n\\n\\n\\n\\tbool\\t\\t\\t\\t\\t\\tm_IsLoop;\\n\\n\\tbool\\t\\t\\t\\t\\t\\tm_IsStopped;\\n\\n\\n\\n\\tstd::weak_ptr<IM2AnimationEventsListener> m_M2AnimationEventListener;\\n\\n\\n\\n\\tdouble\\t\\t\\t\\t\\t\\tm_AnimTime;\\n\\n\\tuint32\\t\\t\\t\\t\\t\\tm_CurrentTime;\\n\\n};\\n\",\n \"file_path\": \"owGame/M2/M2_AnimatorComponent.h\",\n \"rank\": 87,\n \"score\": 13.088700064197528\n },\n {\n \"content\": \"#include \\\"stdafx.h\\\"\\n\\n\\n\\n // General\\n\\n#include \\\"AuthCrypt.h\\\"\\n\\n\\n\\n // Additional\\n\\n#include \\\"HMACSHA1.h\\\"\\n\\n\\n\\n#if WOW_CLIENT_VERSION < WOW_WOTLK_3_3_5\\n\\n\\n\\nAuthCrypt::AuthCrypt()\\n\\n{\\n\\n _initialized = false;\\n\\n}\\n\\n\\n\\nvoid AuthCrypt::Init()\\n\\n{\\n\\n _send_i = _send_j = _recv_i = _recv_j = 0;\\n\\n _initialized = true;\\n\\n}\\n\",\n \"file_path\": \"owClient/AuthSocket/Cryptography/AuthCrypt.cpp\",\n \"rank\": 88,\n \"score\": 13.05176087623277\n },\n {\n \"content\": \"#include \\\"stdafx.h\\\"\\n\\n\\n\\n// General\\n\\n#include \\\"WDBCreatureCache.h\\\"\\n\\n\\n\\nCowWDBCreatureCache::CowWDBCreatureCache(IFilesManager * FilesManager)\\n\\n\\t: CowWDBFile(FilesManager, \\\"creaturecache.wdb\\\")\\n\\n{\\n\\n\\tauto file = LoadFile();\\n\\n\\tif (file == nullptr)\\n\\n\\t{\\n\\n\\t\\tLog::Warn(\\\"CowWDBCreatureCache:: File '%s' not found.\\\", m_FileName.c_str());\\n\\n\\t}\\n\\n\\n\\n\\twhile (false == file->isEof())\\n\\n\\t{\\n\\n\\t\\tuint32 entry;\\n\\n\\t\\tfile->read(&entry);\\n\\n\\n\\n\\t\\tuint32 entrySize;\\n\",\n \"file_path\": \"owClient/Client/WDB/WDBCreatureCache.cpp\",\n \"rank\": 89,\n \"score\": 13.037761915916448\n },\n {\n \"content\": \"#include \\\"stdafx.h\\\"\\n\\n\\n\\n// General\\n\\n#include \\\"WDBItemCache.h\\\"\\n\\n\\n\\nCowWDBItemCache::CowWDBItemCache(IFilesManager * FilesManager)\\n\\n\\t: CowWDBFile(FilesManager, \\\"itemcache.wdb\\\")\\n\\n{\\n\\n\\tauto file = LoadFile();\\n\\n\\tif (file == nullptr)\\n\\n\\t{\\n\\n\\t\\tLog::Warn(\\\"CowWDBItemCache:: File '%s' not found.\\\", m_FileName.c_str());\\n\\n\\t}\\n\\n\\n\\n\\twhile (false == file->isEof())\\n\\n\\t{\\n\\n\\t\\tuint32 entry;\\n\\n\\t\\tfile->read(&entry);\\n\\n\\n\\n\\t\\tuint32 entrySize;\\n\",\n \"file_path\": \"owClient/Client/WDB/WDBItemCache.cpp\",\n \"rank\": 90,\n \"score\": 13.037761915916448\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\t// kill stuff from the end\\n\\n\\tfloat l = 0;\\n\\n\\tbool erasemode = false;\\n\\n\\tfor (auto it = m_Segments.begin(); it != m_Segments.end(); )\\n\\n\\t{\\n\\n\\t\\tif (!erasemode)\\n\\n\\t\\t{\\n\\n\\t\\t\\tl += it->len;\\n\\n\\t\\t\\tif (l > length)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tit->len = l - length;\\n\\n\\t\\t\\t\\terasemode = true;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t++it;\\n\\n\\t\\t}\\n\\n\\t\\telse\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_Segments.erase(it++);\\n\",\n \"file_path\": \"owGame/M2/M2_RibbonEmitters.cpp\",\n \"rank\": 91,\n \"score\": 12.880766528519281\n },\n {\n \"content\": \"\",\n \"file_path\": \"owClient/AuthSocket/AuthSocket.cpp\",\n \"rank\": 92,\n \"score\": 12.772791024735021\n },\n {\n \"content\": \"\\tm_Targets.Initialize(M2Camera.target_position, ByteBuffer, M2Object.getSkeleton().GetAnimFiles(), Fix_From_XZmY_To_XYZ);\\n\\n\\tm_Rolls.Initialize(M2Camera.roll, ByteBuffer, M2Object.getSkeleton().GetAnimFiles());\\n\\n}\\n\\n\\n\\nCM2_Part_Camera::~CM2_Part_Camera()\\n\\n{\\n\\n}\\n\\n\\n\\nbool CM2_Part_Camera::Calculate(const CM2_Base_Instance& M2Instance, uint32 globalTime, float AspectRatio, const glm::mat4& OriginMatrix, glm::vec3 * Position, glm::vec3 * Direction, glm::mat4 * Projection, glm::mat4 * View) const\\n\\n{\\n\\n\\tconst auto& animator = M2Instance.GetAnimatorComponent();\\n\\n\\tif (animator == nullptr)\\n\\n\\t\\treturn false;\\n\\n\\n\\n\\tglm::vec3 position = m_PositionBase;\\n\\n\\tif (m_Positions.IsUsesBySequence(animator->getSequenceIndex()))\\n\\n\\t\\tposition += m_Positions.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), globalTime, true);\\n\\n\\tposition = OriginMatrix * glm::vec4(position, 1.0f);\\n\\n\\t*Position = position;\\n\\n\\n\",\n \"file_path\": \"owGame/M2/M2_Part_Camera.cpp\",\n \"rank\": 93,\n \"score\": 12.749172517017621\n },\n {\n \"content\": \"#include \\\"stdafx.h\\\"\\n\\n\\n\\n// General\\n\\n#include \\\"WDBGameObjectCache.h\\\"\\n\\n\\n\\nCowWDBGameObjectCache::CowWDBGameObjectCache(IFilesManager * FilesManager)\\n\\n\\t: CowWDBFile(FilesManager, \\\"gameobjectcache.wdb\\\")\\n\\n{\\n\\n\\tauto file = LoadFile();\\n\\n\\tif (file == nullptr)\\n\\n\\t{\\n\\n\\t\\tLog::Warn(\\\"CowWDBGameObjectCache:: File '%s' not found.\\\", m_FileName.c_str());\\n\\n\\t}\\n\\n\\n\\n\\twhile (false == file->isEof())\\n\\n\\t{\\n\\n\\t\\tuint32 entry;\\n\\n\\t\\tfile->read(&entry);\\n\\n\\n\\n\\t\\tuint32 entrySize;\\n\",\n \"file_path\": \"owClient/Client/WDB/WDBGameObjectCache.cpp\",\n \"rank\": 94,\n \"score\": 12.625567202353478\n },\n {\n \"content\": \"CWorldSocket::~CWorldSocket()\\n\\n{\\n\\n\\tDisconnect();\\n\\n\\n\\n\\tm_UpdateThreadExiter.set_value();\\n\\n\\t//while (false == m_UpdateThread.joinable());\\n\\n\\t//m_UpdateThread.join();\\n\\n}\\n\\n\\n\\nvoid CWorldSocket::Open(std::string Host, uint16 Port)\\n\\n{\\n\\n\\tif (false == Connect(Host, Port))\\n\\n\\t\\tthrow CException(\\\"CWorldSocket: Unable to connect to '%s:%d'\\\", Host.c_str(), Port);\\n\\n\\n\\n\\tSetBlocking(true);\\n\\n}\\n\\n\\n\\nvoid CWorldSocket::Update()\\n\\n{\\n\\n\\twhile (const auto& packet = m_PacketsQueue.GetNextItem())\\n\",\n \"file_path\": \"owClient/WorldSocket/WorldSocket.cpp\",\n \"rank\": 95,\n \"score\": 12.593837785289615\n },\n {\n \"content\": \"}\\n\\n\\n\\n\\n\\n\\n\\n//\\n\\n// CM2_Base_Instance\\n\\n//\\n\\nbool CMapM2Instance::IsInstansingEnabled() const\\n\\n{\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\n//\\n\\n// ISceneNode\\n\\n//\\n\\nvoid CMapM2Instance::Initialize()\\n\\n{\\n\\n\\t__super::Initialize();\\n\",\n \"file_path\": \"owGame/Map/Instances/MapM2Instance.cpp\",\n \"rank\": 96,\n \"score\": 12.541153021974955\n },\n {\n \"content\": \"\\t\\tcollisonIndexBuffer = m_RenderDevice.GetObjectsFactory().CreateIndexBuffer(collisionTrianglesArray);\\n\\n\\t}\\n\\n\\n\\n\\tif (collisonVertexBuffer != nullptr && collisonIndexBuffer != nullptr)\\n\\n\\t{\\n\\n\\t\\tauto collisionGeometry = GetRenderDevice().GetObjectsFactory().CreateGeometry();\\n\\n\\t\\tcollisionGeometry->SetVertexBuffer(collisonVertexBuffer);\\n\\n\\t\\tcollisionGeometry->SetIndexBuffer(collisonIndexBuffer);\\n\\n\\t\\tm_CollisionGeom = collisionGeometry;\\n\\n\\t}\\n\\n\\telse\\n\\n\\t{\\n\\n\\t\\tm_CollisionGeom = nullptr;\\n\\n\\t}\\n\\n#endif\\n\\n\\n\\n\\tm_IsAnimated = getSkeleton().isAnimBones() || getSkeleton().isBillboard() || getMaterials().IsAnimTextures() || getMiscellaneous().IsAnimated() || true;\\n\\n\\t_ASSERT(m_Bytes.use_count() == 1);\\n\\n\\tm_Bytes.reset();\\n\\n\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\nbool CM2::Delete()\\n\\n{\\n\\n\\treturn false;\\n\\n}\\n\",\n \"file_path\": \"owGame/M2/M2.cpp\",\n \"rank\": 97,\n \"score\": 12.534620813200263\n },\n {\n \"content\": \"\\n\\nvoid CWorldSocket::OnDisconnected()\\n\\n{\\n\\n\\tLog::Warn(\\\"CWorldSocket::OnDisconnected.\\\");\\n\\n}\\n\\n\\n\\nvoid CWorldSocket::SendPacket(CClientPacket& Packet)\\n\\n{\\n\\n Packet.Complete();\\n\\n\\n\\n m_WoWCryptoUtils.EncryptSend(Packet.getDataEx(), sizeof(uint16) /*Size*/ + sizeof(uint32) /*Opcode*/);\\n\\n\\n\\n Send(Packet.getDataEx(), Packet.getSize());\\n\\n}\\n\\n\\n\\nvoid CWorldSocket::SetExternalHandler(std::function<bool(CServerPacket&)> Handler)\\n\\n{\\n\\n\\t_ASSERT(Handler != nullptr);\\n\\n\\tm_ExternalHandler = Handler;\\n\\n}\\n\",\n \"file_path\": \"owClient/WorldSocket/WorldSocket.cpp\",\n \"rank\": 98,\n \"score\": 12.50950048003238\n },\n {\n \"content\": \"#include \\\"stdafx.h\\\"\\n\\n\\n\\n// Include\\n\\n#include \\\"M2.h\\\"\\n\\n#include \\\"M2_Base_Instance.h\\\"\\n\\n\\n\\n// General\\n\\n#include \\\"M2_Part_TextureWeight.h\\\"\\n\\n\\n\\nCM2_Part_TextureWeight::CM2_Part_TextureWeight(const CM2& M2Object, const std::shared_ptr<IByteBuffer>& File, const SM2_TextureWeight& M2TextureWeight)\\n\\n\\t: m_M2Object(M2Object)\\n\\n{\\n\\n\\tm_WeightAnimated.Initialize(M2TextureWeight.weight, File, M2Object.getSkeleton().GetAnimFiles());\\n\\n}\\n\\n\\n\\nCM2_Part_TextureWeight::~CM2_Part_TextureWeight()\\n\\n{\\n\\n}\\n\\n\\n\\nfloat CM2_Part_TextureWeight::GetWeight(const CM2_Base_Instance* M2Instance, uint32 GlobalTime) const\\n\\n{\\n\\n\\tif (const auto& animator = M2Instance->GetAnimatorComponent())\\n\\n\\t\\tif (m_WeightAnimated.IsUsesBySequence(animator->getSequenceIndex()))\\n\\n\\t\\t\\treturn m_WeightAnimated.GetValue(animator->getSequenceIndex(), animator->getCurrentTime(), m_M2Object.getSkeleton().getGlobalLoops(), GlobalTime);\\n\\n\\treturn 1.0f;\\n\\n}\\n\",\n \"file_path\": \"owGame/M2/M2_Part_TextureWeight.cpp\",\n \"rank\": 99,\n \"score\": 12.25106216636241\n }\n]","isConversational":false}}},{"rowIdx":90,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/mame/audio/dsbz80.cpp"},"repo_name":{"kind":"string","value":"Robbbert/messui"},"commit":{"kind":"string","value":"49b756e2140d8831bc81335298ee8c5471045e79"},"file_code":{"kind":"string","value":"\n\n#include \"emu.h\"\n#include \"audio/dsbz80.h\"\n#include \"machine/clock.h\"\n\n#define Z80_TAG \"mpegcpu\"\n\nvoid dsbz80_device::dsbz80_map(address_map &map)\n{\n\tmap(0x0000, 0x7fff).rom().region(\":mpegcpu\", 0);\n\tmap(0x8000, 0xffff).ram();\n}\n\nvoid dsbz80_device::dsbz80io_map(address_map &map)\n{\n\tmap.global_mask(0xff);\n\tmap(0xe0, 0xe0).w(FUNC(dsbz80_device::mpeg_trigger_w));\n\tmap(0xe2, 0xe4).rw(FUNC(dsbz80_device::mpeg_pos_r), FUNC(dsbz80_device::mpeg_start_w));\n\tmap(0xe5, 0xe7).w(FUNC(dsbz80_device::mpeg_end_w));\n\tmap(0xe8, 0xe8).w(FUNC(dsbz80_device::mpeg_volume_w));\n\tmap(0xe9, 0xe9).w(FUNC(dsbz80_device::mpeg_stereo_w));\n\tmap(0xf0, 0xf1).rw(\"uart\", FUNC(i8251_device::read), FUNC(i8251_device::write));\n}\n\nDEFINE_DEVICE_TYPE(DSBZ80, dsbz80_device, \"dsbz80_device\", \"Sega Z80-based Digital Sound Board\")\n\nvoid dsbz80_device::device_add_mconfig(machine_config &config)\n{\n\tZ80(config, m_ourcpu, 4000000); \n\tm_ourcpu->set_addrmap(AS_PROGRAM, &dsbz80_device::dsbz80_map);\n\tm_ourcpu->set_addrmap(AS_IO, &dsbz80_device::dsbz80io_map);\n\n\tI8251(config, m_uart, 4000000);\n\tm_uart->rxrdy_handler().set_inputline(m_ourcpu, INPUT_LINE_IRQ0);\n\tm_uart->txd_handler().set(FUNC(dsbz80_device::output_txd));\n\n\tclock_device &uart_clock(CLOCK(config, \"uart_clock\", 500000)); \n\tuart_clock.signal_handler().set(\"uart\", FUNC(i8251_device::write_rxc));\n\tuart_clock.signal_handler().append(\"uart\", FUNC(i8251_device::write_txc));\n}\n\ndsbz80_device::dsbz80_device(const machine_config &mconfig, const char *tag, device_t *owner, uint32_t clock) :\n\tdevice_t(mconfig, DSBZ80, tag, owner, clock),\n\tdevice_sound_interface(mconfig, *this),\n\tm_ourcpu(*this, Z80_TAG),\n\tm_uart(*this, \"uart\"),\n\tm_rxd_handler(*this)\n{\n}\n\nvoid dsbz80_device::device_start()\n{\n\tm_rxd_handler.resolve_safe();\n\tuint8_t *rom_base = machine().root_device().memregion(\"mpeg\")->base();\n\tdecoder = new mpeg_audio(rom_base, mpeg_audio::L2, false, 0);\n\tstream_alloc(0, 2, 32000);\n}\n\nvoid dsbz80_device::device_reset()\n{\n\tstart = end = 0;\n\taudio_pos = audio_avail = 0;\n\tmemset(audio_buf, 0, sizeof(audio_buf));\n\tmp_state = 0;\n\n\tm_uart->write_cts(0);\n}\n\nWRITE_LINE_MEMBER(dsbz80_device::write_txd)\n{\n\tm_uart->write_rxd(state);\n}\n\nWRITE_LINE_MEMBER(dsbz80_device::output_txd)\n{\n\t\n\tm_rxd_handler(state);\n}\n\nvoid dsbz80_device::mpeg_trigger_w(uint8_t data)\n{\n\tmp_state = data;\n\n\tif (data == 0) \n\t{\n\t\tmp_state = 0;\n\t\taudio_pos = audio_avail = 0;\n\t}\n\telse if (data == 1) \n\t{\n\t\tmp_pos = mp_start*8;\n\t}\n\telse if (data == 2) \n\t{\n\t\tmp_pos = mp_start*8;\n\t}\n}\n\nuint8_t dsbz80_device::mpeg_pos_r(offs_t offset)\n{\n\tint mp_prg = mp_pos >> 3;\n\n\tswitch (offset)\n\t{\n\t\tcase 0:\n\t\t\treturn (mp_prg>>16)&0xff;\n\t\tcase 1:\n\t\t\treturn (mp_prg>>8)&0xff;\n\t\tcase 2:\n\t\t\treturn mp_prg&0xff;\n\t}\n\n\treturn 0;\n}\n\nvoid dsbz80_device::mpeg_start_w(offs_t offset, uint8_t data)\n{\n\tswitch (offset)\n\t{\n\t\tcase 0:\n\t\t\tstart &= 0x00ffff;\n\t\t\tstart |= (int)data<<16;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tstart &= 0xff00ff;\n\t\t\tstart |= (int)data<<8;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tstart &= 0xffff00;\n\t\t\tstart |= data;\n\n\t\t\tif (mp_state == 0)\n\t\t\t{\n\t\t\t\tmp_start = start;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlp_start = start;\n\t\t\t\t\n\t\t\t\tif (lp_end == 0)\n\t\t\t\t{\n\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t}\n}\n\nvoid dsbz80_device::mpeg_end_w(offs_t offset, uint8_t data)\n{\n\tswitch (offset)\n\t{\n\t\tcase 0:\n\t\t\tend &= 0x00ffff;\n\t\t\tend |= (int)data<<16;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tend &= 0xff00ff;\n\t\t\tend |= (int)data<<8;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tend &= 0xffff00;\n\t\t\tend |= data;\n\n\t\t\tif (mp_state == 0)\n\t\t\t{\n\t\t\t\tmp_end = end;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlp_end = end;\n\n\t\t\t}\n\t\t\tbreak;\n\t}\n}\n\nvoid dsbz80_device::mpeg_volume_w(uint8_t data)\n{\n\tmp_vol = 0x7f - data;\n}\n\nvoid dsbz80_device::mpeg_stereo_w(uint8_t data)\n{\n\tmp_pan = data & 3; \n}\n\nvoid dsbz80_device::sound_stream_update(sound_stream &stream, std::vector<read_stream_view> const &inputs, std::vector<write_stream_view> &outputs)\n{\n\tauto &out_l = outputs[0];\n\tauto &out_r = outputs[1];\n\n\tint samples = out_l.samples();\n\tint sampindex = 0;\n\tfor(;;)\n\t{\n\t\twhile(samples && audio_pos < audio_avail)\n\t\t{\n\t\t\tswitch (mp_pan)\n\t\t\t{\n\t\t\t\tcase 0: \n\t\t\t\t\tout_l.put_int(sampindex, audio_buf[audio_pos*2], 32768);\n\t\t\t\t\tout_r.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);\n\t\t\t\t\tsampindex++;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 1: \n\t\t\t\t\tout_l.put_int(sampindex, audio_buf[audio_pos*2], 32768);\n\t\t\t\t\tout_r.put_int(sampindex, audio_buf[audio_pos*2], 32768);\n\t\t\t\t\tsampindex++;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 2: \n\t\t\t\t\tout_l.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);\n\t\t\t\t\tout_r.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);\n\t\t\t\t\tsampindex++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\taudio_pos++;\n\t\t\tsamples--;\n\t\t}\n\n\t\tif(!samples)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tif(mp_state == 0)\n\t\t{\n\t\t\tout_l.fill(0, sampindex);\n\t\t\tout_r.fill(0, sampindex);\n\t\t\tbreak;\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint sample_rate, channel_count;\n\t\t\tbool ok = decoder->decode_buffer(mp_pos, mp_end*8, audio_buf, audio_avail, sample_rate, channel_count);\n\n\t\t\tif (ok)\n\t\t\t{\n\t\t\t\taudio_pos = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(mp_state == 2)\n\t\t\t\t{\n\t\t\t\t\tif (mp_pos == lp_start*8)\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tmp_state = 0;\n\t\t\t\t\t}\n\t\t\t\t\tmp_pos = lp_start*8;\n\n\t\t\t\t\tif (lp_end)\n\t\t\t\t\t{\n\t\t\t\t\t\tmp_end = lp_end;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmp_state = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"emu.h\"\n#include \"audio/dsbz80.h\"\n#include \"machine/clock.h\"\n\n#define Z80_TAG \"mpegcpu\"\n\nvoid dsbz80_device::dsbz80_map(address_map &map)\n{\n\tmap(0x0000, 0x7fff).rom().region(\":mpegcpu\", 0);\n\tmap(0x8000, 0xffff).ram();\n}\n\nvoid dsbz80_device::dsbz80io_map(address_map &map)\n{\n\tmap.global_mask(0xff);\n\tmap(0xe0, 0xe0).w(FUNC(dsbz80_device::mpeg_trigger_w));\n\tmap(0xe2, 0xe4).rw(FUNC(dsbz80_device::mpeg_pos_r), FUNC(dsbz80_device::mpeg_start_w));\n\tmap(0xe5, 0xe7).w(FUNC(dsbz80_device::mpeg_end_w));\n\tmap(0xe8, 0xe8).w(FUNC(dsbz80_device::mpeg_volume_w));\n\tmap(0xe9, 0xe9).w(FUNC(dsbz80_device::mpeg_stereo_w));\n\tmap(0xf0, 0xf1).rw(\"uart\", FUNC(i8251_device::read), FUNC(i8251_device::write));\n}\n\nDEFINE_DEVICE_TYPE(DSBZ80, dsbz80_device, \"dsbz80_device\", \"Sega Z80-based Digital Sound Board\")\n\nvoid dsbz80_device::device_add_mconfig(machine_config &config)\n{\n\tZ80(config, m_ourcpu, 4000000); \n\tm_ourcpu->set_addrmap(AS_PROGRAM, &dsbz80_device::dsbz80_map);\n\tm_ourcpu->set_addrmap(AS_IO, &dsbz80_device::dsbz80io_map);\n\n\tI8251(config, m_uart, 4000000);\n\tm_uart->rxrdy_handler().set_inputline(m_ourcpu, INPUT_LINE_IRQ0);\n\tm_uart->txd_handler().set(FUNC(dsbz80_device::output_txd));\n\n\tclock_device &uart_clock(CLOCK(config, \"uart_clock\", 500000)); \n\tuart_clock.signal_handler().set(\"uart\", FUNC(i8251_device::write_rxc));\n\tuart_clock.signal_handler().append(\"uart\", FUNC(i8251_device::write_txc));\n}\n\ndsbz80_device::dsbz80_device(const machine_config &mconfig, const char *tag, device_t *owner, uint32_t clock) :\n\tdevice_t(mconfig, DSBZ80, tag, owner, clock),\n\tdevice_sound_interface(mconfig, *this),\n\tm_ourcpu(*this, Z80_TAG),\n\tm_uart(*this, \"uart\"),\n\tm_rxd_handler(*this)\n{\n}\n\nvoid dsbz80_device::device_start()\n{\n\tm_rxd_handler.resolve_safe();\n\tuint8_t *rom_base = machine().root_device().memregion(\"mpeg\")->base();\n\tdecoder = new mpeg_audio(rom_base, mpeg_audio::L2, false, 0);\n\tstream_alloc(0, 2, 32000);\n}\n\nvoid dsbz80_device::device_reset()\n{\n\tstart = end = 0;\n\taudio_pos = audio_avail = 0;\n\tmemset(audio_buf, 0, sizeof(audio_buf));\n\tmp_state = 0;\n\n\tm_uart->write_cts(0);\n}\n\nWRITE_LINE_MEMBER(dsbz80_device::write_txd)\n{\n\tm_uart->write_rxd(state);\n}\n\nWRITE_LINE_MEMBER(dsbz80_device::output_txd)\n{\n\t\n\tm_rxd_handler(state);\n}\n\nvoid dsbz80_device::mpeg_trigger_w(uint8_t data)\n{\n\tmp_state = data;\n\n\tif (data == 0) \n\t{\n\t\tmp_state = 0;\n\t\taudio_pos = audio_avail = 0;\n\t}\n\telse if (data == 1) \n\t{\n\t\tmp_pos = mp_start*8;\n\t}\n\telse if (data == 2) \n\t{\n\t\tmp_pos = mp_start*8;\n\t}\n}\n\nuint8_t dsbz80_device::mpeg_pos_r(offs_t offset)\n{\n\tint mp_prg = mp_pos >> 3;\n\n\tswitch (offset)\n\t{\n\t\tcase 0:\n\t\t\treturn (mp_prg>>16)&0xff;\n\t\tcase 1:\n\t\t\treturn (mp_prg>>8)&0xff;\n\t\tcase 2:\n\t\t\treturn mp_prg&0xff;\n\t}\n\n\treturn 0;\n}\n\nvoid dsbz80_device::mpeg_start_w(offs_t offset, uint8_t data)\n{\n\tswitch (offset)\n\t{\n\t\tcase 0:\n\t\t\tstart &= 0x00ffff;\n\t\t\tstart |= (int)data<<16;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tstart &= 0xff00ff;\n\t\t\tstart |= (int)data<<8;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tstart &= 0xffff00;\n\t\t\tstart |= data;\n\n\t\t\tif (mp_state == 0)\n\t\t\t{\n\t\t\t\tmp_start = start;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlp_start = start;\n\t\t\t\t\n\t\t\t\tif (lp_end == 0)\n\t\t\t\t{\n\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t}\n}\n\nvoid dsbz80_device::mpeg_end_w(offs_t offset, uint8_t data)\n{\n\tswitch (offset)\n\t{\n\t\tcase 0:\n\t\t\tend &= 0x00ffff;\n\t\t\tend |= (int)data<<16;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tend &= 0xff00ff;\n\t\t\tend |= (int)data<<8;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tend &= 0xffff00;\n\t\t\tend |= data;\n\n\t\t\tif (mp_state == 0)\n\t\t\t{\n\t\t\t\tmp_end = end;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlp_end = end;\n\n\t\t\t}\n\t\t\tbreak;\n\t}\n}\n\nvoid dsbz80_device::mpeg_volume_w(uint8_t data)\n{\n\tmp_vol = 0x7f - data;\n}\n\nvoid dsbz80_device::mpeg_stereo_w(uint8_t data)\n{\n\tmp_pan = data & 3; \n}\n\nvoid dsbz80_device::sound_stream_update(sound_stream &stream, std::vector<read_stream_view> const &inputs, std::vector<write_stream_view> &outputs)\n{\n\tauto &out_l = outputs[0];\n\tauto &out_r = outputs[1];\n\n\tint samples = out_l.samples();\n\tint sampindex = 0;\n\tfor(;;)\n\t{\n\t\twhile(samples && audio_pos < audio_avail)\n\t\t{\n\t\t\tswitch (mp_pan)\n\t\t\t{\n\t\t\t\tcase 0: \n\t\t\t\t\tout_l.put_int(sampindex, audio_buf[audio_pos*2], 32768);\n\t\t\t\t\tout_r.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);\n\t\t\t\t\tsampindex++;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 1: \n\t\t\t\t\tout_l.put_int(sampindex, audio_buf[audio_pos*2], 32768);\n\t\t\t\t\tout_r.put_int(sampindex, audio_buf[audio_pos*2], 32768);\n\t\t\t\t\tsampindex++;\n\t\t\t\t\t"},"suffix":{"kind":"string","value":"ampindex++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\taudio_pos++;\n\t\t\tsamples--;\n\t\t}\n\n\t\tif(!samples)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tif(mp_state == 0)\n\t\t{\n\t\t\tout_l.fill(0, sampindex);\n\t\t\tout_r.fill(0, sampindex);\n\t\t\tbreak;\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint sample_rate, channel_count;\n\t\t\tbool ok = decoder->decode_buffer(mp_pos, mp_end*8, audio_buf, audio_avail, sample_rate, channel_count);\n\n\t\t\tif (ok)\n\t\t\t{\n\t\t\t\taudio_pos = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(mp_state == 2)\n\t\t\t\t{\n\t\t\t\t\tif (mp_pos == lp_start*8)\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tmp_state = 0;\n\t\t\t\t\t}\n\t\t\t\t\tmp_pos = lp_start*8;\n\n\t\t\t\t\tif (lp_end)\n\t\t\t\t\t{\n\t\t\t\t\t\tmp_end = lp_end;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmp_state = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n"},"middle":{"kind":"string","value":"break;\n\n\t\t\t\tcase 2: \n\t\t\t\t\tout_l.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);\n\t\t\t\t\tout_r.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);\n\t\t\t\t\ts"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":91,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Charts/Core/Testing/Cxx/TestPlotBarRangeHandlesItem.cxx"},"repo_name":{"kind":"string","value":"cclauss/VTK"},"commit":{"kind":"string","value":"f62a52cce9044159efb4adb7cc0cfd7ec0bc8b6d"},"file_code":{"kind":"string","value":"#include <vtkAxis.h>\n#include <vtkChartXY.h>\n#include <vtkContextInteractorStyle.h>\n#include <vtkContextScene.h>\n#include <vtkIntArray.h>\n#include <vtkInteractorEventRecorder.h>\n#include <vtkNew.h>\n#include <vtkPlotBar.h>\n#include <vtkPlotBarRangeHandlesItem.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkTable.h>\n\n#include <iostream>\n#include <map>\n\nclass vtkRangeHandlesCallBack : public vtkCommand\n{\npublic:\n static vtkRangeHandlesCallBack* New() { return new vtkRangeHandlesCallBack; }\n\n void Execute(vtkObject* caller, unsigned long event, void* vtkNotUsed(callData)) override\n {\n vtkPlotRangeHandlesItem* self = vtkPlotRangeHandlesItem::SafeDownCast(caller);\n if (!self)\n {\n return;\n }\n if (event == vtkCommand::EndInteractionEvent)\n {\n self->GetHandlesRange(this->Range);\n }\n if (this->EventSpy.count(event) == 0)\n {\n this->EventSpy[event] = 0;\n }\n ++this->EventSpy[event];\n std::cout << \"InvokedEvent: \" << event << this->EventSpy[event] << std::endl;\n }\n std::map<unsigned long, int> EventSpy;\n double Range[2];\n};\n\nint TestPlotBarRangeHandlesItem(int, char*[])\n{\n vtkNew<vtkTable> table;\n\n vtkNew<vtkIntArray> arrMonth;\n arrMonth->SetName(\"Months\");\n arrMonth->SetNumberOfComponents(1);\n arrMonth->SetNumberOfTuples(12);\n for (int i = 0; i < arrMonth->GetNumberOfTuples(); ++i)\n {\n arrMonth->SetValue(i, i);\n }\n table->AddColumn(arrMonth);\n\n constexpr int books[12] = { 5675, 5902, 6388, 5990, 5575, 7393, 9878, 8082, 6417, 5946, 5526,\n 5166 };\n vtkNew<vtkIntArray> arrBooks;\n arrBooks->SetName(\"Books\");\n arrBooks->SetNumberOfComponents(1);\n arrBooks->SetNumberOfTuples(12);\n for (int i = 0; i < arrBooks->GetNumberOfTuples(); ++i)\n {\n arrBooks->SetValue(i, books[i]);\n }\n table->AddColumn(arrBooks);\n\n \n vtkNew<vtkChartXY> chart;\n chart->GetAxis(vtkAxis::BOTTOM)->SetRange(-5, 15);\n chart->GetAxis(vtkAxis::LEFT)->SetRange(-5, 15);\n\n vtkNew<vtkContextScene> scene;\n scene->AddItem(chart);\n\n vtkNew<vtkContextInteractorStyle> interactorStyle;\n interactorStyle->SetScene(scene);\n\n vtkNew<vtkRenderWindowInteractor> iren;\n iren->SetInteractorStyle(interactorStyle);\n\n vtkNew<vtkInteractorEventRecorder> recorder;\n recorder->SetInteractor(iren);\n recorder->ReadFromInputStringOn();\n\n \n vtkPlotBar* barPlot = vtkPlotBar::SafeDownCast(chart->AddPlot(vtkChart::BAR));\n barPlot->SetInputData(table, \"Months\", \"Books\");\n chart->SetBarWidthFraction(1.0);\n\n vtkNew<vtkPlotBarRangeHandlesItem> rangeItem;\n rangeItem->SetPlotBar(barPlot);\n rangeItem->SetExtent(0, 12, 0, 1);\n\n chart->AddPlot(rangeItem);\n rangeItem->ComputeHandlesDrawRange();\n chart->RaisePlot(rangeItem);\n chart->Update(); \n\n vtkNew<vtkRangeHandlesCallBack> cbk;\n rangeItem->AddObserver(vtkCommand::StartInteractionEvent, cbk);\n rangeItem->AddObserver(vtkCommand::InteractionEvent, cbk);\n rangeItem->AddObserver(vtkCommand::EndInteractionEvent, cbk);\n\n \n \n \n double range[2];\n rangeItem->GetHandlesRange(range);\n\n if (range[0] != 0 || range[1] != 12)\n {\n std::cerr << \"Initialization: Unexpected range for vertical handle: [\" << range[0] << \", \"\n << range[1] << \"]. Expecting: [0, 12].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \n \n \n const char leftEvents[] = \"# StreamVersion 1\\n\"\n \"LeftButtonPressEvent 0 10 0 0 0 0 0\\n\"\n \"MouseMoveEvent 3 10 0 0 0 0 0\\n\"\n \"LeftButtonReleaseEvent 3 10 0 0 0 0 0\\n\";\n recorder->SetInputString(leftEvents);\n recorder->Play();\n\n if (cbk->EventSpy[vtkCommand::StartInteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::InteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::EndInteractionEvent] != 1)\n {\n std::cerr << \"Move left handle: Wrong number of fired events : \"\n << cbk->EventSpy[vtkCommand::StartInteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::InteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::EndInteractionEvent] << std::endl;\n return EXIT_FAILURE;\n }\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (fabs(range[0] - 2.5) > 1e-3 || range[1] != 12)\n {\n std::cerr << \"Unexpected range for vertical handle: [\" << range[0] << \", \" << range[1]\n << \"]. Expecting: [2.5, 12].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \n \n \n cbk->EventSpy.clear();\n const char rightEvents[] = \"# StreamVersion 1\\n\"\n \"LeftButtonPressEvent 12 10 0 0 0 0 0\\n\"\n \"MouseMoveEvent 10 10 0 0 0 0 0\\n\"\n \"LeftButtonReleaseEvent 10 10 0 0 0 0 0\\n\";\n recorder->SetInputString(rightEvents);\n recorder->Play();\n\n if (cbk->EventSpy[vtkCommand::StartInteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::InteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::EndInteractionEvent] != 1)\n {\n std::cerr << \"Move right handle: Wrong number of fired events : \"\n << cbk->EventSpy[vtkCommand::StartInteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::InteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::EndInteractionEvent] << std::endl;\n return EXIT_FAILURE;\n }\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (fabs(range[0] - 2.5) > 1e-3 || fabs(range[1] - 10.5) > 1e-3)\n {\n std::cerr << \"Unexpected range for vertical handle: [\" << range[0] << \", \" << range[1]\n << \"]. Expecting: [2.5, 10.5].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \n \n \n barPlot->SetOrientation(vtkPlotBar::HORIZONTAL);\n rangeItem->SetHandleOrientationToHorizontal();\n rangeItem->SetExtent(0, 12, 0, 1);\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (range[0] != 0 || range[1] != 12)\n {\n std::cerr << \"Unexpected range in horizontal range handle: [\" << range[0] << \", \" << range[1]\n << \"]. Expecting: [0, 12].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n cbk->EventSpy.clear();\n const char hRightEvents[] = \"# StreamVersion 1\\n\"\n \"LeftButtonPressEvent 1 12 0 0 0 0 0\\n\"\n \"MouseMoveEvent 1 5 0 0 0 0 0\\n\"\n \"LeftButtonReleaseEvent 1 5 0 0 0 0 0\\n\";\n recorder->SetInputString(hRightEvents);\n recorder->Play();\n\n if (cbk->EventSpy[vtkCommand::StartInteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::InteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::EndInteractionEvent] != 1)\n {\n std::cerr << \"Move horizontal handle: Wrong number of fired events : \"\n << cbk->EventSpy[vtkCommand::StartInteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::InteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::EndInteractionEvent] << std::endl;\n return EXIT_FAILURE;\n }\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (range[0] != 0 || fabs(range[1] - 5.5) > 1e-3)\n {\n std::cerr << \"Unexpected range for horizontal handle : [\" << range[0] << \", \" << range[1]\n << \"]. Expecting : [0, 5.5].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n"},"prefix":{"kind":"string","value":"#include <vtkAxis.h>\n#include <vtkChartXY.h>\n#include <vtkContextInteractorStyle.h>\n#include <vtkContextScene.h>\n#include <vtkIntArray.h>\n#include <vtkInteractorEventRecorder.h>\n#include <vtkNew.h>\n#include <vtkPlotBar.h>\n#include <vtkPlotBarRangeHandlesItem.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkTable.h>\n\n#include <iostream>\n#include <map>\n\nclass vtkRangeHandlesCallBack : public vtkCommand\n{\npublic:\n static vtkRangeHandlesCallBack* New() { return new vtkRangeHandlesCallBack; }\n\n void Execute(vtkObject* caller, unsigned long event, void* vtkNotUsed(callData)) override\n {\n vtkPlotRangeHandlesItem* self = vtkPlotRangeH"},"suffix":{"kind":"string","value":"ventSpy[event] = 0;\n }\n ++this->EventSpy[event];\n std::cout << \"InvokedEvent: \" << event << this->EventSpy[event] << std::endl;\n }\n std::map<unsigned long, int> EventSpy;\n double Range[2];\n};\n\nint TestPlotBarRangeHandlesItem(int, char*[])\n{\n vtkNew<vtkTable> table;\n\n vtkNew<vtkIntArray> arrMonth;\n arrMonth->SetName(\"Months\");\n arrMonth->SetNumberOfComponents(1);\n arrMonth->SetNumberOfTuples(12);\n for (int i = 0; i < arrMonth->GetNumberOfTuples(); ++i)\n {\n arrMonth->SetValue(i, i);\n }\n table->AddColumn(arrMonth);\n\n constexpr int books[12] = { 5675, 5902, 6388, 5990, 5575, 7393, 9878, 8082, 6417, 5946, 5526,\n 5166 };\n vtkNew<vtkIntArray> arrBooks;\n arrBooks->SetName(\"Books\");\n arrBooks->SetNumberOfComponents(1);\n arrBooks->SetNumberOfTuples(12);\n for (int i = 0; i < arrBooks->GetNumberOfTuples(); ++i)\n {\n arrBooks->SetValue(i, books[i]);\n }\n table->AddColumn(arrBooks);\n\n \n vtkNew<vtkChartXY> chart;\n chart->GetAxis(vtkAxis::BOTTOM)->SetRange(-5, 15);\n chart->GetAxis(vtkAxis::LEFT)->SetRange(-5, 15);\n\n vtkNew<vtkContextScene> scene;\n scene->AddItem(chart);\n\n vtkNew<vtkContextInteractorStyle> interactorStyle;\n interactorStyle->SetScene(scene);\n\n vtkNew<vtkRenderWindowInteractor> iren;\n iren->SetInteractorStyle(interactorStyle);\n\n vtkNew<vtkInteractorEventRecorder> recorder;\n recorder->SetInteractor(iren);\n recorder->ReadFromInputStringOn();\n\n \n vtkPlotBar* barPlot = vtkPlotBar::SafeDownCast(chart->AddPlot(vtkChart::BAR));\n barPlot->SetInputData(table, \"Months\", \"Books\");\n chart->SetBarWidthFraction(1.0);\n\n vtkNew<vtkPlotBarRangeHandlesItem> rangeItem;\n rangeItem->SetPlotBar(barPlot);\n rangeItem->SetExtent(0, 12, 0, 1);\n\n chart->AddPlot(rangeItem);\n rangeItem->ComputeHandlesDrawRange();\n chart->RaisePlot(rangeItem);\n chart->Update(); \n\n vtkNew<vtkRangeHandlesCallBack> cbk;\n rangeItem->AddObserver(vtkCommand::StartInteractionEvent, cbk);\n rangeItem->AddObserver(vtkCommand::InteractionEvent, cbk);\n rangeItem->AddObserver(vtkCommand::EndInteractionEvent, cbk);\n\n \n \n \n double range[2];\n rangeItem->GetHandlesRange(range);\n\n if (range[0] != 0 || range[1] != 12)\n {\n std::cerr << \"Initialization: Unexpected range for vertical handle: [\" << range[0] << \", \"\n << range[1] << \"]. Expecting: [0, 12].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \n \n \n const char leftEvents[] = \"# StreamVersion 1\\n\"\n \"LeftButtonPressEvent 0 10 0 0 0 0 0\\n\"\n \"MouseMoveEvent 3 10 0 0 0 0 0\\n\"\n \"LeftButtonReleaseEvent 3 10 0 0 0 0 0\\n\";\n recorder->SetInputString(leftEvents);\n recorder->Play();\n\n if (cbk->EventSpy[vtkCommand::StartInteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::InteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::EndInteractionEvent] != 1)\n {\n std::cerr << \"Move left handle: Wrong number of fired events : \"\n << cbk->EventSpy[vtkCommand::StartInteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::InteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::EndInteractionEvent] << std::endl;\n return EXIT_FAILURE;\n }\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (fabs(range[0] - 2.5) > 1e-3 || range[1] != 12)\n {\n std::cerr << \"Unexpected range for vertical handle: [\" << range[0] << \", \" << range[1]\n << \"]. Expecting: [2.5, 12].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \n \n \n cbk->EventSpy.clear();\n const char rightEvents[] = \"# StreamVersion 1\\n\"\n \"LeftButtonPressEvent 12 10 0 0 0 0 0\\n\"\n \"MouseMoveEvent 10 10 0 0 0 0 0\\n\"\n \"LeftButtonReleaseEvent 10 10 0 0 0 0 0\\n\";\n recorder->SetInputString(rightEvents);\n recorder->Play();\n\n if (cbk->EventSpy[vtkCommand::StartInteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::InteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::EndInteractionEvent] != 1)\n {\n std::cerr << \"Move right handle: Wrong number of fired events : \"\n << cbk->EventSpy[vtkCommand::StartInteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::InteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::EndInteractionEvent] << std::endl;\n return EXIT_FAILURE;\n }\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (fabs(range[0] - 2.5) > 1e-3 || fabs(range[1] - 10.5) > 1e-3)\n {\n std::cerr << \"Unexpected range for vertical handle: [\" << range[0] << \", \" << range[1]\n << \"]. Expecting: [2.5, 10.5].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \n \n \n barPlot->SetOrientation(vtkPlotBar::HORIZONTAL);\n rangeItem->SetHandleOrientationToHorizontal();\n rangeItem->SetExtent(0, 12, 0, 1);\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (range[0] != 0 || range[1] != 12)\n {\n std::cerr << \"Unexpected range in horizontal range handle: [\" << range[0] << \", \" << range[1]\n << \"]. Expecting: [0, 12].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n cbk->EventSpy.clear();\n const char hRightEvents[] = \"# StreamVersion 1\\n\"\n \"LeftButtonPressEvent 1 12 0 0 0 0 0\\n\"\n \"MouseMoveEvent 1 5 0 0 0 0 0\\n\"\n \"LeftButtonReleaseEvent 1 5 0 0 0 0 0\\n\";\n recorder->SetInputString(hRightEvents);\n recorder->Play();\n\n if (cbk->EventSpy[vtkCommand::StartInteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::InteractionEvent] != 1 ||\n cbk->EventSpy[vtkCommand::EndInteractionEvent] != 1)\n {\n std::cerr << \"Move horizontal handle: Wrong number of fired events : \"\n << cbk->EventSpy[vtkCommand::StartInteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::InteractionEvent] << \" \"\n << cbk->EventSpy[vtkCommand::EndInteractionEvent] << std::endl;\n return EXIT_FAILURE;\n }\n\n rangeItem->ComputeHandlesDrawRange();\n rangeItem->GetHandlesRange(range);\n\n \n if (range[0] != 0 || fabs(range[1] - 5.5) > 1e-3)\n {\n std::cerr << \"Unexpected range for horizontal handle : [\" << range[0] << \", \" << range[1]\n << \"]. Expecting : [0, 5.5].\" << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n"},"middle":{"kind":"string","value":"andlesItem::SafeDownCast(caller);\n if (!self)\n {\n return;\n }\n if (event == vtkCommand::EndInteractionEvent)\n {\n self->GetHandlesRange(this->Range);\n }\n if (this->EventSpy.count(event) == 0)\n {\n this->E"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":92,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/src/ThrusterROSPlugin.cpp"},"repo_name":{"kind":"string","value":"MoMagDii/VAUV-simulator"},"commit":{"kind":"string","value":"56f55f9349e38e0a327a40feb5a437fcad511b00"},"file_code":{"kind":"string","value":"\n\n#include <uuv_gazebo_ros_plugins/ThrusterROSPlugin.h>\n\n#include <string>\n\n#include <gazebo/physics/Base.hh>\n#include <gazebo/physics/Link.hh>\n#include <gazebo/physics/Model.hh>\n#include <gazebo/physics/World.hh>\n\n#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>\n\nnamespace uuv_simulator_ros\n{\n\nThrusterROSPlugin::ThrusterROSPlugin()\n{\n this->rosPublishPeriod = gazebo::common::Time(0.05);\n this->lastRosPublishTime = gazebo::common::Time(0.0);\n}\n\nThrusterROSPlugin::~ThrusterROSPlugin()\n{\n#if GAZEBO_MAJOR_VERSION >= 8\n this->rosPublishConnection.reset();\n#else\n gazebo::event::Events::DisconnectWorldUpdateBegin(\n this->rosPublishConnection);\n#endif\n}\n\nvoid ThrusterROSPlugin::SetThrustReference(\n const uuv_gazebo_ros_plugins_msgs::msg::FloatStamped::SharedPtr _msg)\n{\n if (std::isnan(_msg->data))\n {\n RCLCPP_WARN(myRosNode->get_logger(), \"ThrusterROSPlugin: Ignoring nan command\");\n return;\n }\n\n this->inputCommand = _msg->data;\n}\n\ngazebo::common::Time ThrusterROSPlugin::GetRosPublishPeriod()\n{\n return this->rosPublishPeriod;\n}\n\nvoid ThrusterROSPlugin::SetRosPublishRate(double _hz)\n{\n if (_hz > 0.0)\n this->rosPublishPeriod = 1.0 / _hz;\n else\n this->rosPublishPeriod = 0.;\n}\n\nvoid ThrusterROSPlugin::Init()\n{\n ThrusterPlugin::Init();\n}\n\nvoid ThrusterROSPlugin::Reset()\n{\n this->lastRosPublishTime.Set(0, 0);\n}\n\nvoid ThrusterROSPlugin::Load(gazebo::physics::ModelPtr _parent,\n sdf::ElementPtr _sdf)\n{\n using std::placeholders::_1;\n using std::placeholders::_2;\n\n try {\n ThrusterPlugin::Load(_parent, _sdf);\n\n } catch(gazebo::common::Exception &_e)\n {\n gzerr << \"Error loading plugin.\"\n << \"Please ensure that your model is correct.\"\n << '\\n';\n return;\n }\n\n if (!rclcpp::is_initialized())\n {\n gzerr << \"Not loading plugin since ROS has not been \"\n << \"properly initialized. Try starting gazebo with ros plugin:\\n\"\n << \" gazebo -s libgazebo_ros_api_plugin.so\\n\";\n return;\n }\n\n \n \n\n \n \n \n try {\n myRosNode = gazebo_ros::Node::CreateWithArgs(_sdf->Get<std::string>(\"name\"));\n\n gzmsg << \"[ThrusterROSPlugin] Node created with name: \" << myRosNode->get_name() \n << \", with ns: \" << myRosNode->get_namespace() << \"\\n\";\n \n \n \n mySet_thrust_force_efficiencySrv = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>(\n myTopicPrefix + \"set_thrust_force_efficiency\",\n std::bind(&ThrusterROSPlugin::SetThrustForceEfficiency, this, _1, _2));\n\n \n myGet_thrust_force_efficiencySrv = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>(\n myTopicPrefix + \"get_thrust_force_efficiency\",\n std::bind(&ThrusterROSPlugin::GetThrustForceEfficiency, this, _1, _2));\n\n \n mySet_dynamic_state_efficiencySrv = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>(\n myTopicPrefix + \"set_dynamic_state_efficiency\",\n std::bind(&ThrusterROSPlugin::SetDynamicStateEfficiency, this, _1, _2));\n\n \n myGet_dynamic_state_efficiency =\n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>(\n myTopicPrefix + \"get_dynamic_state_efficiency\",\n std::bind(&ThrusterROSPlugin::GetDynamicStateEfficiency, this, _1, _2));\n\n \n mySet_thruster_state =\n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState>(\n myTopicPrefix + \"set_thruster_state\",\n std::bind(&ThrusterROSPlugin::SetThrusterState, this, _1, _2));\n\n \n myGet_thruster_state = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState>(\n myTopicPrefix + \"get_thruster_state\",\n std::bind(&ThrusterROSPlugin::GetThrusterState, this, _1, _2));\n\n \n myGet_thruster_conversion_fcn = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn>(\n myTopicPrefix + \"get_thruster_conversion_fcn\",\n std::bind(&ThrusterROSPlugin::GetThrusterConversionFcn, this, _1, _2));\n \n mySubThrustReference = myRosNode->create_subscription<\n uuv_gazebo_ros_plugins_msgs::msg::FloatStamped\n >(this->commandSubscriber->GetTopic(), 10,\n std::bind(&ThrusterROSPlugin::SetThrustReference, this, _1));\n\n \n myPubThrust = myRosNode->create_publisher<\n uuv_gazebo_ros_plugins_msgs::msg::FloatStamped\n >(this->thrustTopicPublisher->GetTopic(), 10);\n\n myPubThrustWrench =\n myRosNode->create_publisher<geometry_msgs::msg::WrenchStamped>(\n this->thrustTopicPublisher->GetTopic() + \"_wrench\", 10);\n \n\n myPubThrusterState = myRosNode->create_publisher<std_msgs::msg::Bool>(\n myTopicPrefix + \"is_on\", 1);\n\n myPubThrustForceEff = myRosNode->create_publisher<std_msgs::msg::Float64>(\n myTopicPrefix + \"thrust_efficiency\", 1);\n\n myPubDynamicStateEff = myRosNode->create_publisher<std_msgs::msg::Float64>(\n myTopicPrefix + \"dynamic_state_efficiency\", 1);\n\n gzmsg << \"Thruster #\" << this->thrusterID << \" initialized\" << std::endl\n << \"\\t- Link: \" << this->thrusterLink->GetName() << std::endl\n << \"\\t- Robot model: \" << _parent->GetName() << std::endl\n << \"\\t- Input command topic: \" <<\n this->commandSubscriber->GetTopic() << std::endl\n << \"\\t- Thrust output topic: \" <<\n this->thrustTopicPublisher->GetTopic() << std::endl;\n\n this->rosPublishConnection = gazebo::event::Events::ConnectWorldUpdateBegin(\n std::bind(&ThrusterROSPlugin::RosPublishStates, this));\n } \n catch(std::exception& e) \n {\n gzerr << \"Exception when loading plugin: \" << e.what() << \"\\n\";\n }\n}\n\nvoid ThrusterROSPlugin::RosPublishStates()\n{\n \n if (this->thrustForceStamp - this->lastRosPublishTime >=\n this->rosPublishPeriod)\n {\n this->lastRosPublishTime = this->thrustForceStamp;\n\n \n uuv_gazebo_ros_plugins_msgs::msg::FloatStamped thrustMsg;\n thrustMsg.header.stamp = myRosNode->now();\n thrustMsg.header.frame_id = this->thrusterLink->GetName();\n thrustMsg.data = this->thrustForce;\n myPubThrust->publish(thrustMsg);\n\n \n geometry_msgs::msg::WrenchStamped thrustWrenchMsg;\n thrustWrenchMsg.header.stamp = myRosNode->now();\n thrustWrenchMsg.header.frame_id = this->thrusterLink->GetName();\n ignition::math::Vector3d thrustVector = this->thrustForce * this->thrusterAxis;\n thrustWrenchMsg.wrench.force.x = thrustVector.X();\n thrustWrenchMsg.wrench.force.y = thrustVector.Y();\n thrustWrenchMsg.wrench.force.z = thrustVector.Z();\n myPubThrustWrench->publish(thrustWrenchMsg);\n\n \n std_msgs::msg::Bool isOnMsg;\n isOnMsg.data = this->isOn;\n myPubThrusterState->publish(isOnMsg);\n\n \n std_msgs::msg::Float64 thrustEffMsg;\n thrustEffMsg.data = this->thrustEfficiency;\n myPubThrustForceEff->publish(thrustEffMsg);\n\n \n std_msgs::msg::Float64 dynStateEffMsg;\n dynStateEffMsg.data = this->propellerEfficiency;\n myPubDynamicStateEff->publish(dynStateEffMsg);\n }\n}\n\nvoid ThrusterROSPlugin::SetThrustForceEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res)\n{\n if (_req->efficiency < 0.0 || _req->efficiency > 1.0)\n {\n _res->success = false;\n }\n else\n {\n this->thrustEfficiency = _req->efficiency;\n _res->success = true;\n gzmsg << \"Setting thrust efficiency at thruster \" <<\n this->thrusterLink->GetName() << \"=\" << _req->efficiency * 100\n << \"%\" << std::endl;\n }\n}\n\nvoid ThrusterROSPlugin::GetThrustForceEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res)\n{\n _res->efficiency = this->thrustEfficiency;\n}\n\nvoid ThrusterROSPlugin::SetDynamicStateEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res)\n{\n if (_req->efficiency < 0.0 || _req->efficiency > 1.0)\n {\n _res->success = false;\n }\n else\n {\n this->propellerEfficiency = _req->efficiency;\n _res->success = true;\n gzmsg << \"Setting propeller efficiency at thruster \" <<\n this->thrusterLink->GetName() << \"=\" << _req->efficiency * 100\n << \"%\" << std::endl;\n }\n}\n\nvoid ThrusterROSPlugin::GetDynamicStateEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res)\n{\n _res->efficiency = this->propellerEfficiency;\n}\n\nvoid ThrusterROSPlugin::SetThrusterState(\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Request::SharedPtr _req,\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Response::SharedPtr _res)\n{\n this->isOn = _req->on;\n gzmsg << \"Turning thruster \" << this->thrusterLink->GetName() << \" \" <<\n (this->isOn ? \"ON\" : \"OFF\") << std::endl;\n _res->success = true;\n}\n\nvoid ThrusterROSPlugin::GetThrusterState(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Response::SharedPtr _res)\n{\n _res->is_on = this->isOn;\n}\n\nvoid ThrusterROSPlugin::GetThrusterConversionFcn(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Response::SharedPtr _res)\n{\n _res->fcn.function_name = this->conversionFunction->GetType();\n\n double param;\n\n if (!_res->fcn.function_name.compare(\"Basic\"))\n {\n gzmsg << \"ThrusterROSPlugin::GetThrusterConversionFcn::Basic\" << std::endl;\n _res->fcn.tags.push_back(\"rotor_constant\");\n this->conversionFunction->GetParam(\"rotor_constant\", param);\n _res->fcn.data.push_back(param);\n }\n else if (!_res->fcn.function_name.compare(\"Bessa\"))\n {\n gzmsg << \"ThrusterROSPlugin::GetThrusterConversionFcn::Bessa\" << std::endl;\n _res->fcn.tags.push_back(\"rotor_constant_l\");\n this->conversionFunction->GetParam(\"rotor_constant_l\", param);\n _res->fcn.data.push_back(param);\n\n _res->fcn.tags.push_back(\"rotor_constant_r\");\n this->conversionFunction->GetParam(\"rotor_constant_r\", param);\n _res->fcn.data.push_back(param);\n\n _res->fcn.tags.push_back(\"delta_l\");\n this->conversionFunction->GetParam(\"delta_l\", param);\n _res->fcn.data.push_back(param);\n\n _res->fcn.tags.push_back(\"delta_r\");\n this->conversionFunction->GetParam(\"delta_r\", param);\n _res->fcn.data.push_back(param);\n }\n else if (!_res->fcn.function_name.compare(\"LinearInterp\"))\n {\n gzmsg << \"ThrusterROSPlugin::GetThrusterConversionFcn::LinearInterp\" << std::endl;\n std::map<double, double> table = this->conversionFunction->GetTable();\n\n for (auto& item : table)\n {\n gzmsg << item.first << \" \" << item.second << std::endl;\n _res->fcn.lookup_table_input.push_back(item.first);\n _res->fcn.lookup_table_output.push_back(item.second);\n }\n }\n}\n\nGZ_REGISTER_MODEL_PLUGIN(ThrusterROSPlugin)\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <uuv_gazebo_ros_plugins/ThrusterROSPlugin.h>\n\n#include <string>\n\n#include <gazebo/physics/Base.hh>\n#include <gazebo/physics/Link.hh>\n#include <gazebo/physics/Model.hh>\n#include <gazebo/physics/World.hh>\n\n#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>\n\nnamespace uuv_simulator_ros\n{\n\nThrusterROSPlugin::ThrusterROSPlugin()\n{\n this->rosPublishPeriod = gazebo::common::Time(0.05);\n this->lastRosPublishTime = gazebo::common::Time(0.0);\n}\n\nThrusterROSPlugin::~ThrusterROSPlugin()\n{\n#if GAZEBO_MAJOR_VERSION >= 8\n this->rosPublishConnection.reset();\n#else\n gazebo::event::Events::DisconnectWorldUpdateBegin(\n this->rosPublishConnection);\n#endif\n}\n\nvoid ThrusterROSPlugin::SetThrustReference(\n const uuv_gazebo_ros_plugins_msgs::msg::FloatStamped::SharedPtr _msg)\n{\n if (std::isnan(_msg->data))\n {\n RCLCPP_WARN(myRosNode->get_logger(), \"ThrusterROSPlugin: Ignoring nan command\");\n return;\n }\n\n this->inputCommand = _msg->data;\n}\n\ngazebo::common::Time ThrusterROSPlugin::GetRosPublishPeriod()\n{\n return this->rosPublishPeriod;\n}\n\nvoid ThrusterROSPlugin::SetRosPublishRate(double _hz)\n{\n if (_hz > 0.0)\n this->rosPublishPeriod = 1.0 / _hz;\n else\n this->rosPublishPeriod = 0.;\n}\n\nvoid ThrusterROSPlugin::Init()\n{\n ThrusterPlugin::Init();\n}\n\nvoid ThrusterROSPlugin::Reset()\n{\n this->lastRosPublishTime.Set(0, 0);\n}\n\nvoid ThrusterROSPlugin::Load(gazebo::physics::ModelPtr _parent,\n sdf::ElementPtr _sdf)\n{\n using std::placeholders::_1;\n using std::placeholders::_2;\n\n try {\n ThrusterPlugin::Load(_parent, _sdf);\n\n } catch(gazebo::common::Exception &_e)\n {\n gzerr << \"Error loading plugin.\"\n << \"Please ensure that your model is correct.\"\n << '\\n';\n return;\n }\n\n if (!rclcpp::is_initialized())\n {\n gzerr << \"Not loading plugin since ROS has not been \"\n << \"properly initialized. Try starting gazebo with ros plugin:\\n\"\n << \" gazebo -s libgazebo_ros_api_plugin.so\\n\";\n return;\n }\n\n \n \n\n \n \n \n try {\n myRosNode = gazebo_ros::Node::CreateWithArgs(_sdf->Get<std::string>(\"name\"));\n\n gzmsg << \"[ThrusterROSPlugin] Node created with name: \" << myRosNode->get_name() \n << \", with ns: \" << myRosNode->get_namespace() << \"\\n\";\n \n \n \n mySet_thrust_force_efficiencySrv = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>(\n myTopicPrefix + \"set_thrust_force_efficiency\",\n std::bind(&ThrusterROSPlugin::SetThrustForceEfficiency, this, _1, _2));\n\n \n myGet_thrust_force_efficiencySrv = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>(\n myTopicPrefix + \"get_thrust_force_efficiency\",\n std::bind(&ThrusterROSPlugin::GetThrustForceEfficiency, this, _1, _2));\n\n \n mySet_dynamic_state_efficiencySrv = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>(\n myTopicPrefix + \"set_dynamic_state_efficiency\",\n std::bind(&ThrusterROSPlugin::SetDynamicStateEfficiency, this, _1, _2));\n\n \n myGet_dynamic_state_efficiency =\n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>(\n myTopicPrefix + \"get_dynamic_state_efficiency\",\n std::bind(&ThrusterROSPlugin::GetDynamicStateEfficiency, this, _1, _2));\n\n \n mySet_thruster_state =\n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState>(\n myTopicPrefix + \"set_thruster_state\",\n std::bind(&ThrusterROSPlugin::SetThrusterState, this, _1, _2));\n\n \n myGet_thruster_state = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState>(\n myTopicPrefix + \"get_thruster_state\",\n std::bind(&ThrusterROSPlugin::GetThrusterState, this, _1, _2));\n\n \n myGet_thruster_conversion_fcn = \n myRosNode->create_service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn>(\n myTopicPrefix + \"get_thruster_conversion_fcn\",\n std::bind(&ThrusterROSPlugin::GetThrusterConversionFcn, this, _1, _2));\n \n mySubThrustReference = "},"suffix":{"kind":"string","value":";\n\n \n myPubThrust = myRosNode->create_publisher<\n uuv_gazebo_ros_plugins_msgs::msg::FloatStamped\n >(this->thrustTopicPublisher->GetTopic(), 10);\n\n myPubThrustWrench =\n myRosNode->create_publisher<geometry_msgs::msg::WrenchStamped>(\n this->thrustTopicPublisher->GetTopic() + \"_wrench\", 10);\n \n\n myPubThrusterState = myRosNode->create_publisher<std_msgs::msg::Bool>(\n myTopicPrefix + \"is_on\", 1);\n\n myPubThrustForceEff = myRosNode->create_publisher<std_msgs::msg::Float64>(\n myTopicPrefix + \"thrust_efficiency\", 1);\n\n myPubDynamicStateEff = myRosNode->create_publisher<std_msgs::msg::Float64>(\n myTopicPrefix + \"dynamic_state_efficiency\", 1);\n\n gzmsg << \"Thruster #\" << this->thrusterID << \" initialized\" << std::endl\n << \"\\t- Link: \" << this->thrusterLink->GetName() << std::endl\n << \"\\t- Robot model: \" << _parent->GetName() << std::endl\n << \"\\t- Input command topic: \" <<\n this->commandSubscriber->GetTopic() << std::endl\n << \"\\t- Thrust output topic: \" <<\n this->thrustTopicPublisher->GetTopic() << std::endl;\n\n this->rosPublishConnection = gazebo::event::Events::ConnectWorldUpdateBegin(\n std::bind(&ThrusterROSPlugin::RosPublishStates, this));\n } \n catch(std::exception& e) \n {\n gzerr << \"Exception when loading plugin: \" << e.what() << \"\\n\";\n }\n}\n\nvoid ThrusterROSPlugin::RosPublishStates()\n{\n \n if (this->thrustForceStamp - this->lastRosPublishTime >=\n this->rosPublishPeriod)\n {\n this->lastRosPublishTime = this->thrustForceStamp;\n\n \n uuv_gazebo_ros_plugins_msgs::msg::FloatStamped thrustMsg;\n thrustMsg.header.stamp = myRosNode->now();\n thrustMsg.header.frame_id = this->thrusterLink->GetName();\n thrustMsg.data = this->thrustForce;\n myPubThrust->publish(thrustMsg);\n\n \n geometry_msgs::msg::WrenchStamped thrustWrenchMsg;\n thrustWrenchMsg.header.stamp = myRosNode->now();\n thrustWrenchMsg.header.frame_id = this->thrusterLink->GetName();\n ignition::math::Vector3d thrustVector = this->thrustForce * this->thrusterAxis;\n thrustWrenchMsg.wrench.force.x = thrustVector.X();\n thrustWrenchMsg.wrench.force.y = thrustVector.Y();\n thrustWrenchMsg.wrench.force.z = thrustVector.Z();\n myPubThrustWrench->publish(thrustWrenchMsg);\n\n \n std_msgs::msg::Bool isOnMsg;\n isOnMsg.data = this->isOn;\n myPubThrusterState->publish(isOnMsg);\n\n \n std_msgs::msg::Float64 thrustEffMsg;\n thrustEffMsg.data = this->thrustEfficiency;\n myPubThrustForceEff->publish(thrustEffMsg);\n\n \n std_msgs::msg::Float64 dynStateEffMsg;\n dynStateEffMsg.data = this->propellerEfficiency;\n myPubDynamicStateEff->publish(dynStateEffMsg);\n }\n}\n\nvoid ThrusterROSPlugin::SetThrustForceEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res)\n{\n if (_req->efficiency < 0.0 || _req->efficiency > 1.0)\n {\n _res->success = false;\n }\n else\n {\n this->thrustEfficiency = _req->efficiency;\n _res->success = true;\n gzmsg << \"Setting thrust efficiency at thruster \" <<\n this->thrusterLink->GetName() << \"=\" << _req->efficiency * 100\n << \"%\" << std::endl;\n }\n}\n\nvoid ThrusterROSPlugin::GetThrustForceEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res)\n{\n _res->efficiency = this->thrustEfficiency;\n}\n\nvoid ThrusterROSPlugin::SetDynamicStateEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res)\n{\n if (_req->efficiency < 0.0 || _req->efficiency > 1.0)\n {\n _res->success = false;\n }\n else\n {\n this->propellerEfficiency = _req->efficiency;\n _res->success = true;\n gzmsg << \"Setting propeller efficiency at thruster \" <<\n this->thrusterLink->GetName() << \"=\" << _req->efficiency * 100\n << \"%\" << std::endl;\n }\n}\n\nvoid ThrusterROSPlugin::GetDynamicStateEfficiency(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res)\n{\n _res->efficiency = this->propellerEfficiency;\n}\n\nvoid ThrusterROSPlugin::SetThrusterState(\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Request::SharedPtr _req,\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Response::SharedPtr _res)\n{\n this->isOn = _req->on;\n gzmsg << \"Turning thruster \" << this->thrusterLink->GetName() << \" \" <<\n (this->isOn ? \"ON\" : \"OFF\") << std::endl;\n _res->success = true;\n}\n\nvoid ThrusterROSPlugin::GetThrusterState(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Response::SharedPtr _res)\n{\n _res->is_on = this->isOn;\n}\n\nvoid ThrusterROSPlugin::GetThrusterConversionFcn(\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Request::SharedPtr ,\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Response::SharedPtr _res)\n{\n _res->fcn.function_name = this->conversionFunction->GetType();\n\n double param;\n\n if (!_res->fcn.function_name.compare(\"Basic\"))\n {\n gzmsg << \"ThrusterROSPlugin::GetThrusterConversionFcn::Basic\" << std::endl;\n _res->fcn.tags.push_back(\"rotor_constant\");\n this->conversionFunction->GetParam(\"rotor_constant\", param);\n _res->fcn.data.push_back(param);\n }\n else if (!_res->fcn.function_name.compare(\"Bessa\"))\n {\n gzmsg << \"ThrusterROSPlugin::GetThrusterConversionFcn::Bessa\" << std::endl;\n _res->fcn.tags.push_back(\"rotor_constant_l\");\n this->conversionFunction->GetParam(\"rotor_constant_l\", param);\n _res->fcn.data.push_back(param);\n\n _res->fcn.tags.push_back(\"rotor_constant_r\");\n this->conversionFunction->GetParam(\"rotor_constant_r\", param);\n _res->fcn.data.push_back(param);\n\n _res->fcn.tags.push_back(\"delta_l\");\n this->conversionFunction->GetParam(\"delta_l\", param);\n _res->fcn.data.push_back(param);\n\n _res->fcn.tags.push_back(\"delta_r\");\n this->conversionFunction->GetParam(\"delta_r\", param);\n _res->fcn.data.push_back(param);\n }\n else if (!_res->fcn.function_name.compare(\"LinearInterp\"))\n {\n gzmsg << \"ThrusterROSPlugin::GetThrusterConversionFcn::LinearInterp\" << std::endl;\n std::map<double, double> table = this->conversionFunction->GetTable();\n\n for (auto& item : table)\n {\n gzmsg << item.first << \" \" << item.second << std::endl;\n _res->fcn.lookup_table_input.push_back(item.first);\n _res->fcn.lookup_table_output.push_back(item.second);\n }\n }\n}\n\nGZ_REGISTER_MODEL_PLUGIN(ThrusterROSPlugin)\n}\n"},"middle":{"kind":"string","value":"myRosNode->create_subscription<\n uuv_gazebo_ros_plugins_msgs::msg::FloatStamped\n >(this->commandSubscriber->GetTopic(), 10,\n std::bind(&ThrusterROSPlugin::SetThrustReference, this, _1))"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"/// \\brief Gazebo model plugin class for underwater objects\n\nclass UnderwaterObjectPlugin : public gazebo::ModelPlugin\n\n{\n\n /// \\brief Constructor\n\n public: UnderwaterObjectPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~UnderwaterObjectPlugin();\n\n\n\n // Documentation inherited.\n\n public: virtual void Load(gazebo::physics::ModelPtr _model,\n\n sdf::ElementPtr _sdf);\n\n\n\n // Documentation inherited.\n\n public: virtual void Init();\n\n\n\n /// \\brief Update the simulation state.\n\n /// \\param[in] _info Information used in the update event.\n\n public: virtual void Update(const gazebo::common::UpdateInfo &_info);\n\n\n\n /// \\brief Connects the update event callback\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":0,"score":229703.75870389285},{"content":"/// \\brief Gazebo model plugin class for underwater objects\n\nclass AccelerationsTestPlugin : public gazebo::ModelPlugin\n\n{\n\n /// \\brief Constructor\n\n public: AccelerationsTestPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~AccelerationsTestPlugin();\n\n\n\n // Documentation inherited.\n\n public: virtual void Load(gazebo::physics::ModelPtr _model,\n\n sdf::ElementPtr _sdf);\n\n\n\n // Documentation inherited.\n\n public: virtual void Init();\n\n\n\n /// \\brief Update the simulation state.\n\n /// \\param[in] _info Information used in the update event.\n\n public: void Update(const gazebo::common::UpdateInfo &_info);\n\n\n\n /// \\brief Connects the update event callback\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h","rank":1,"score":226678.4903163004},{"content":"class JointStatePublisher : public gazebo::ModelPlugin\n\n{\n\n public: JointStatePublisher();\n\n\n\n public: ~JointStatePublisher();\n\n\n\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\n\n\n\n public: void OnUpdate(const gazebo::common::UpdateInfo &_info);\n\n\n\n public: void PublishJointStates();\n\n\n\n private: bool IsIgnoredJoint(std::string _jointName);\n\n\n\n private: gazebo::physics::WorldPtr world;\n\n\n\n private: gazebo::physics::ModelPtr myModel;\n\n\n\n private: gazebo::event::ConnectionPtr updateConnection;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/JointStatePublisher.h","rank":2,"score":223237.38392002412},{"content":"class UmbilicalModel\n\n{\n\n /// \\brief Protected constructor: Use the factory instead\n\n protected: UmbilicalModel() {}\n\n\n\n /// \\brief Destructor.\n\n public: virtual ~UmbilicalModel() {}\n\n\n\n /// \\brief Initialize model.\n\n public: virtual void Init();\n\n\n\n /// \\brief Update Umbilical (and apply forces)\n\n public: virtual void OnUpdate(const common::UpdateInfo &_info,\n\n const ignition::math::Vector3d& _flow) = 0;\n\n\n\n /// \\brief Gazebo model to which this umbilical belongs.\n\n protected: physics::ModelPtr model;\n\n\n\n /// \\brief Moving connector link of this umbilical.\n\n protected: physics::LinkPtr connector;\n\n};\n\n\n\n/// \\brief Function pointer to create a certain conversion function.\n\ntypedef UmbilicalModel* (*UmbilicalModelCreator)(sdf::ElementPtr,\n\n physics::ModelPtr);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h","rank":3,"score":215031.93064528142},{"content":" class ThrusterROSPlugin : public gazebo::ThrusterPlugin\n\n {\n\n /// \\brief Constrcutor.\n\n public: ThrusterROSPlugin();\n\n\n\n /// \\brief Destructor.\n\n public: ~ThrusterROSPlugin();\n\n\n\n /// \\brief Load module and read parameters from SDF.\n\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Publish thruster state via ROS.\n\n public: void RosPublishStates();\n\n\n\n /// \\brief Set new set point (desired thrust [N]) for thruster.\n\n public: void SetThrustReference(\n\n const uuv_gazebo_ros_plugins_msgs::msg::FloatStamped::SharedPtr _msg);\n\n\n\n /// \\brief Return the ROS publish period.\n\n public: gazebo::common::Time GetRosPublishPeriod();\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":4,"score":213665.06149332743},{"content":"class UmbilicalModelBerg : public UmbilicalModel\n\n{\n\n /// \\brief Protected constructor: Use the factory instead\n\n protected: UmbilicalModelBerg(sdf::ElementPtr _sdf,\n\n physics::ModelPtr _model);\n\n\n\n /// \\brief Create UmbilicalModel according to its description.\n\n public: static UmbilicalModel* create(sdf::ElementPtr _sdf,\n\n physics::ModelPtr _model);\n\n\n\n /// \\brief Update Umbilical (and apply forces)\n\n public: virtual void OnUpdate(const common::UpdateInfo &_info,\n\n const ignition::math::Vector3d& _flow);\n\n\n\n /// \\brief Register this UmbilicalModel function with the factory.\n\n private: REGISTER_UMBILICALMODEL(UmbilicalModelBerg);\n\n\n\n /// \\brief The unique identifier of this UmbilicalModel.\n\n private: static const std::string IDENTIFIER;\n\n\n\n /// \\brief Umbilical diameter.\n\n private: double diameter;\n\n\n\n /// \\brief Water density.\n\n private: double rho;\n\n};\n\n}\n\n\n\n#endif // __UUV_GAZEBO_PLUGINS_UMBILICAL_MODEL_HH__\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h","rank":5,"score":213306.7062644014},{"content":"/// \\brief Factory singleton class that creates a HydrodynamicModel from sdf.\n\nclass HydrodynamicModelFactory\n\n{\n\n /// \\brief Create HydrodynamicModel object according to its sdf Description.\n\n public: HydrodynamicModel* CreateHydrodynamicModel(sdf::ElementPtr _sdf,\n\n physics::LinkPtr _link);\n\n\n\n /// \\brief Returns the singleton instance of this factory.\n\n public: static HydrodynamicModelFactory& GetInstance();\n\n\n\n /// \\brief Register a class with its creator.\n\n public: bool RegisterCreator(const std::string& _identifier,\n\n HydrodynamicModelCreator _creator);\n\n\n\n /// \\brief Constructor is private since this is a singleton.\n\n private: HydrodynamicModelFactory() {}\n\n\n\n /// \\brief Map of each registered identifier to its corresponding creator.\n\n private: std::map<std::string, HydrodynamicModelCreator> creators_;\n\n};\n\n\n\n/// Use the following macro within a HydrodynamicModel declaration:\n\n#define REGISTER_HYDRODYNAMICMODEL(type) static const bool registeredWithFactory\n\n\n\n/// Use the following macro before a HydrodynamicModel's definition:\n\n#define REGISTER_HYDRODYNAMICMODEL_CREATOR(type, creator) \\\n\n const bool type::registeredWithFactory = \\\n\n HydrodynamicModelFactory::GetInstance().RegisterCreator( \\\n\n type::IDENTIFIER, creator);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":6,"score":213242.29465609614},{"content":"/// \\brief Factory singleton class that creates an UmbilicalModel from sdf.\n\nclass UmbilicalModelFactory\n\n{\n\n /// \\brief Create a ConversionFunction object according to its sdf Description\n\n public: UmbilicalModel* CreateUmbilicalModel(sdf::ElementPtr _sdf,\n\n physics::ModelPtr _model);\n\n\n\n /// \\brief Return the singleton instance of this factory.\n\n public: static UmbilicalModelFactory& GetInstance();\n\n\n\n /// \\brief Register an UmbilicalModel class with its creator.\n\n public: bool RegisterCreator(const std::string& _identifier,\n\n UmbilicalModelCreator _creator);\n\n\n\n /// \\brief Constructor is private since this is a singleton.\n\n private: UmbilicalModelFactory() {}\n\n\n\n /// \\brief Map of each registered identifiers to its corresponding creator\n\n private: std::map<std::string, UmbilicalModelCreator> creators_;\n\n};\n\n\n\n/// Use the following macro within a ThrusterDynamics declaration:\n\n#define REGISTER_UMBILICALMODEL(type) \\\n\n static const bool registeredWithFactory\n\n\n\n/// Use the following macro before a ThrusterDynamics's definition:\n\n#define REGISTER_UMBILICALMODEL_CREATOR(type, creator) \\\n\n const bool type::registeredWithFactory = \\\n\n UmbilicalModelFactory::GetInstance().RegisterCreator( \\\n\n type::IDENTIFIER, creator);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h","rank":7,"score":213242.29465609614},{"content":"//////////////////////////////////////////////////////////////////////////////\n\n/// \\brief Class containting the methods and attributes\n\n/// for a Fossen robot-like hydrodynamic model. The restoring\n\n/// forces are applied by the BuoyantObject class methods. Using the\n\n/// plugin for UUV models will use both this and the buoyant object\n\n/// class definitions, therefore the restoring forces were not\n\n/// inherited here.\n\n/// References:\n\n/// - Fossen, Thor, \"Handbook of Marine Craft and Hydrodynamics and Motion\n\n/// Control\", 2011\n\nclass HMFossen : public HydrodynamicModel\n\n{\n\n /// \\brief Create model of this type with parameter values from sdf.\n\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\n\n physics::LinkPtr _link);\n\n\n\n /// \\brief Return (derived) type of hydrodynamic model\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Prints parameters\n\n public: virtual void Print(std::string _paramName,\n\n std::string _message = std::string());\n\n\n\n /// \\brief Return paramater in vector form for the given tag\n\n public: virtual bool GetParam(std::string _tag,\n\n std::vector<double>& _output);\n\n\n\n /// \\brief Return paramater in scalar form for the given tag\n\n public: virtual bool GetParam(std::string _tag, double& _output);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":8,"score":209745.98553800624},{"content":"class HydrodynamicModel : public BuoyantObject\n\n{\n\n /// \\brief Protected constructor: Use the factory for object creation.\n\n protected: HydrodynamicModel(sdf::ElementPtr _sdf, physics::LinkPtr _link);\n\n\n\n /// \\brief Returns type of model\n\n public: virtual std::string GetType() = 0;\n\n\n\n /// \\brief Computation of the hydrodynamic forces\n\n public: virtual void ApplyHydrodynamicForces(\n\n double time, const ignition::math::Vector3d &_flowVelWorld) = 0;\n\n\n\n /// \\brief Prints parameters\n\n public: virtual void Print(std::string _paramName,\n\n std::string _message = std::string()) = 0;\n\n\n\n /// \\brief Return paramater in vector form for the given tag\n\n public: virtual bool GetParam(std::string _tag,\n\n std::vector<double>& _output) = 0;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":9,"score":209732.51851454776},{"content":"\n\n/// \\file UmbilicalModel.hh\n\n/// \\brief Various umbilical models.\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_UMBILICAL_MODEL_HH__\n\n#define __UUV_GAZEBO_PLUGINS_UMBILICAL_MODEL_HH__\n\n\n\n#include <string>\n\n#include <map>\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/common/UpdateInfo.hh>\n\n#include <gazebo/physics/Link.hh>\n\n#include <gazebo/physics/Model.hh>\n\n#include <sdf/sdf.hh>\n\n\n\nnamespace gazebo\n\n{\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h","rank":10,"score":208197.62172536948},{"content":"\n\n/// \\file HydrodynamicModel.hh\n\n/// \\brief This file contains the definition for different classes of\n\n/// hydrodynamic models for submerged objects\n\n\n\n#ifndef __UUV_GAZEBO_HYDRO_MODEL_HH__\n\n#define __UUV_GAZEBO_HYDRO_MODEL_HH__\n\n\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/physics/Link.hh>\n\n#include <gazebo/physics/Model.hh>\n\n#include <gazebo/physics/Collision.hh>\n\n#include <gazebo/physics/Shape.hh>\n\n\n\n#include <eigen3/Eigen/Core>\n\n#include <eigen3/Eigen/Geometry>\n\n\n\n#include <string>\n\n#include <vector>\n\n#include <map>\n\n\n\n#include <uuv_gazebo_plugins/Def.h>\n\n#include <uuv_gazebo_plugins/BuoyantObject.h>\n\n\n\n\n\nnamespace gazebo\n\n{\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":11,"score":208196.14206107333},{"content":"\n\n /// \\brief Filtered linear & angular acceleration vector in link frame.\n\n /// This is used to prevent the model to become unstable given that Gazebo\n\n /// only calls the update function at the beginning or at the end of a\n\n /// iteration of the physics engine\n\n protected: Eigen::Vector6d filteredAcc;\n\n\n\n /// \\brief Last timestamp (in seconds) at which ApplyHydrodynamicForces was\n\n /// called\n\n protected: double lastTime;\n\n\n\n /// \\brief Last body-fixed relative velocity (nu_R in Fossen's equations)\n\n protected: Eigen::Vector6d lastVelRel;\n\n\n\n /// \\brief List of parameters needed from the SDF element\n\n protected: std::vector<std::string> params;\n\n\n\n /// \\brief Reynolds number (not used by all models)\n\n protected: double Re;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":12,"score":208182.86126923567},{"content":" /// \\brief Temperature (not used by all models)\n\n protected: double temperature;\n\n};\n\n\n\n/// \\brief Pointer to model\n\ntypedef boost::shared_ptr<HydrodynamicModel> HydrodynamicModelPtr;\n\n\n\n/// \\brief Function pointer to create a certain a model\n\ntypedef HydrodynamicModel* (*HydrodynamicModelCreator)(sdf::ElementPtr, \\\n\n physics::LinkPtr);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":13,"score":208182.15593407315},{"content":" /// \\brief Return paramater in vector form for the given tag\n\n public: virtual bool GetParam(std::string _tag,\n\n double& _output) = 0;\n\n\n\n /// \\brief Set a scalar parameters\n\n public: virtual bool SetParam(std::string _tag, double _input) = 0;\n\n\n\n /// \\brief Filter acceleration (fix due to the update structure of Gazebo)\n\n protected: void ComputeAcc(Eigen::Vector6d _velRel,\n\n double _time,\n\n double _alpha = 0.3);\n\n\n\n /// \\brief Returns true if all parameters are available from the SDF element\n\n protected: bool CheckParams(sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Convert vector to comply with the NED reference frame\n\n protected: ignition::math::Vector3d ToNED(ignition::math::Vector3d _vec);\n\n\n\n /// \\brief Convert vector to comply with the NED reference frame\n\n protected: ignition::math::Vector3d FromNED(ignition::math::Vector3d _vec);\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":14,"score":208181.59790110108},{"content":" /// \\brief Set scalar parameter\n\n public: virtual bool SetParam(std::string _tag, double _input);\n\n\n\n /// \\brief Register this model with the factory.\n\n protected: REGISTER_HYDRODYNAMICMODEL(HMFossen);\n\n\n\n /// \\brief Unique identifier for this geometry\n\n protected: static const std::string IDENTIFIER;\n\n\n\n protected: HMFossen(sdf::ElementPtr _sdf, physics::LinkPtr _link);\n\n\n\n /// \\brief Computation of the hydrodynamic forces\n\n public: virtual void ApplyHydrodynamicForces(double time,\n\n const ignition::math::Vector3d &_flowVelWorld);\n\n\n\n /// \\brief Computes the added-mass Coriolis matrix Ca.\n\n protected: void ComputeAddedCoriolisMatrix(const Eigen::Vector6d& _vel,\n\n const Eigen::Matrix6d& _Ma,\n\n Eigen::Matrix6d &_Ca) const;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":15,"score":208179.4563187558},{"content":" protected: HMBox(sdf::ElementPtr _sdf, physics::LinkPtr _link);\n\n\n\n /// \\brief Drag coefficient\n\n protected: double Cd;\n\n\n\n /// \\brief Length of the box\n\n protected: double length;\n\n\n\n /// \\brief Width of the box\n\n protected: double width;\n\n\n\n /// \\brief Height of the box\n\n protected: double height;\n\n};\n\n}\n\n\n\n#endif // __UUV_GAZEBO_HYDRO_MODEL_HH__\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":16,"score":208175.88941683003},{"content":"\n\n /// \\brief Length of the cylinder\n\n protected: double length;\n\n\n\n /// \\brief Sphere radius\n\n protected: double radius;\n\n\n\n /// \\brief Name of the unit rotation axis (just a tag for x, y or z)\n\n protected: std::string axis;\n\n\n\n /// \\brief Ratio between length and diameter\n\n protected: double dimRatio;\n\n\n\n /// \\brief Approximated drag coefficient for the circular area\n\n protected: double cdCirc;\n\n\n\n /// \\brief Approximated drag coefficient for the rectangular section\n\n protected: double cdLength;\n\n};\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":17,"score":208175.46453211282},{"content":" /// \\brief Updates the damping matrix for the current velocity\n\n protected: void ComputeDampingMatrix(const Eigen::Vector6d& _vel,\n\n Eigen::Matrix6d &_D) const;\n\n\n\n /// \\brief Returns the added-mass matrix with the scaling and offset\n\n protected: Eigen::Matrix6d GetAddedMass() const;\n\n\n\n /// \\brief Added-mass matrix\n\n protected: Eigen::Matrix6d Ma;\n\n\n\n /// \\brief Scaling of the added-mass matrix\n\n protected: double scalingAddedMass;\n\n\n\n /// \\brief Offset for the added-mass matrix\n\n protected: double offsetAddedMass;\n\n\n\n /// \\brief Added-mass associated Coriolis matrix\n\n protected: Eigen::Matrix6d Ca;\n\n\n\n /// \\brief Damping matrix\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":18,"score":208174.56356041788},{"content":" protected: Eigen::Matrix6d D;\n\n\n\n /// \\brief Scaling of the damping matrix\n\n protected: double scalingDamping;\n\n\n\n /// \\brief Offset for the linear damping matrix\n\n protected: double offsetLinearDamping;\n\n\n\n /// \\brief Offset for the linear damping matrix\n\n protected: double offsetLinForwardSpeedDamping;\n\n\n\n /// \\brief Offset for the linear damping matrix\n\n protected: double offsetNonLinDamping;\n\n\n\n /// \\brief Linear damping matrix\n\n protected: Eigen::Matrix6d DLin;\n\n\n\n /// \\brief Linear damping matrix proportional only to the forward speed\n\n /// (useful for modeling AUVs). From [1], according to Newman (1977), there\n\n /// is a damping force component that linearly increases with the presence\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":19,"score":208174.45599156266},{"content":" /// of forward speed, particularly so for slender bodies.\n\n ///\n\n /// References:\n\n /// [1] Refsnes - 2007 - Nonlinear model-based control of slender body AUVs\n\n protected: Eigen::Matrix6d DLinForwardSpeed;\n\n\n\n /// \\brief Nonlinear damping coefficients\n\n protected: Eigen::Matrix6d DNonLin;\n\n\n\n /// \\brief Linear damping coefficients\n\n protected: std::vector<double> linearDampCoef;\n\n\n\n /// \\brief Quadratic damping coefficients\n\n protected: std::vector<double> quadDampCoef;\n\n};\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":20,"score":208171.6415204728},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":21,"score":208171.06960784958},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h","rank":22,"score":208171.06960784958},{"content":"\n\n /// \\brief Sphere radius\n\n protected: double radius;\n\n\n\n /// \\brief Drag coefficient\n\n protected: double Cd;\n\n\n\n /// \\brief Area of the cross section\n\n protected: double areaSection;\n\n};\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":23,"score":208168.14362957745},{"content":"\n\n/// \\file LiftDragModel.hh\n\n/// \\brief Various Lift&Drag models for Fins.\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_LIFT_DRAG_MODEL_HH__\n\n#define __UUV_GAZEBO_PLUGINS_LIFT_DRAG_MODEL_HH__\n\n\n\n#include <map>\n\n#include <string>\n\n\n\n#include <gazebo/gazebo.hh>\n\n\n\n#include <sdf/sdf.hh>\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Abstract base class for Lift&Drag models.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":24,"score":206172.46506608912},{"content":" public: virtual bool GetParam(std::string _tag,\n\n double& _output) = 0;\n\n\n\n /// \\brief Return list of all parameters\n\n public: virtual std::map<std::string, double> GetListParams() = 0;\n\n\n\n /// \\brief Time of last state update.\n\n protected: double prevTime;\n\n\n\n /// \\brief Latest state.\n\n protected: double state;\n\n};\n\n\n\n/// \\brief Function pointer to create a certain LiftDrag object.\n\ntypedef LiftDrag* (*LiftDragCreator)(sdf::ElementPtr);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":25,"score":206155.04095646768},{"content":" /// \\brief Unique identifier for this dynamical model\n\n private: static const std::string IDENTIFIER;\n\n\n\n /// \\brief Lift constant\n\n protected: double liftConstant;\n\n\n\n /// \\brief Drag constant\n\n protected: double dragConstant;\n\n\n\n /// \\brief Constructor.\n\n private: LiftDragQuadratic(double _liftConstant, double _dragConstant)\n\n : LiftDrag(), liftConstant(_liftConstant), dragConstant(_dragConstant) {}\n\n};\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":26,"score":206150.76012799895},{"content":" /// \\brief Return list of all parameters\n\n public: virtual std::map<std::string, double> GetListParams();\n\n\n\n /// \\brief Airfoil area.\n\n protected: double area;\n\n\n\n /// \\brief Fluid density.\n\n protected: double fluidDensity;\n\n\n\n /// \\brief Original zero angle of attack location.\n\n protected: double a0;\n\n\n\n /// \\brief Stall angle.\n\n protected: double alphaStall;\n\n\n\n /// \\brief Lift coefficient without stall.\n\n protected: double cla;\n\n\n\n /// \\brief Lift coefficient with stall.\n\n protected: double claStall;\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":27,"score":206150.29875892683},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":28,"score":206146.2602845685},{"content":"\n\n /// \\brief Drag coefficient without stall.\n\n protected: double cda;\n\n\n\n /// \\brief Drag coefficient with stall.\n\n protected: double cdaStall;\n\n\n\n /// \\brief Constructor.\n\n private: LiftDragTwoLines(double _area, double _fluidDensity, double _a0,\n\n double _alphaStall, double _cla, double _claStall,\n\n double _cda, double _cdaStall)\n\n : LiftDrag(), area(_area), fluidDensity(_fluidDensity),\n\n a0(_a0), alphaStall(_alphaStall),\n\n cla(_cla), claStall(_claStall),\n\n cda(_cda), cdaStall(_cdaStall) {}\n\n};\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":29,"score":206143.33430629637},{"content":"/// \\brief Class for the thruster plugin\n\nclass ThrusterPlugin : public ModelPlugin\n\n{\n\n /// \\brief Constructor\n\n public: ThrusterPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~ThrusterPlugin();\n\n\n\n // Documentation inherited.\n\n public: virtual void Load(physics::ModelPtr _model,\n\n sdf::ElementPtr _sdf);\n\n\n\n // Documentation inherited.\n\n public: virtual void Init();\n\n\n\n /// \\brief Custom plugin reset behavior.\n\n public: virtual void Reset();\n\n\n\n /// \\brief Update the simulation state.\n\n /// \\param[in] _info Information used in the update event.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":30,"score":204340.16545998768},{"content":"class UmbilicalPlugin : public ModelPlugin\n\n{\n\n /// \\brief Destructor.\n\n public: UmbilicalPlugin();\n\n\n\n /// \\brief Constructor.\n\n public: ~UmbilicalPlugin();\n\n\n\n /// \\brief Load plugin and its configuration from sdf\n\n protected: virtual void Load(physics::ModelPtr _model, sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Update callback from simulation.\n\n protected: virtual void OnUpdate(const common::UpdateInfo&);\n\n\n\n /// \\brief Reads flow velocity topic\n\n protected: void UpdateFlowVelocity(ConstVector3dPtr &_msg);\n\n\n\n /// \\brief Pointer to the update event connection.\n\n protected: event::ConnectionPtr updateConnection;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h","rank":31,"score":204335.1378728117},{"content":"class FinPlugin : public ModelPlugin\n\n{\n\n /// \\brief Constructor\n\n public: FinPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~FinPlugin();\n\n\n\n // Documentation inherited.\n\n public: virtual void Load(physics::ModelPtr _model,\n\n sdf::ElementPtr _sdf);\n\n\n\n // Documentation inherited.\n\n public: virtual void Init();\n\n\n\n /// \\brief Update the simulation state.\n\n /// \\param[in] _info Information used in the update event.\n\n public: void OnUpdate(const common::UpdateInfo &_info);\n\n\n\n /// \\brief Callback for the input topic subscriber\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h","rank":32,"score":204335.13787281167},{"content":"/// \\brief Abstract base class for Lift&Drag models.\n\nclass LiftDrag\n\n{\n\n /// \\brief Protected constructor: Use the factory for object creation.\n\n protected: LiftDrag() : prevTime(-10.), state(0.) {}\n\n\n\n /// \\brief Check for element. Complain and return 0 if it is missing.\n\n public: static bool CheckForElement(sdf::ElementPtr _sdf,\n\n const std::string& element);\n\n\n\n /// \\brief Destructor.\n\n public: virtual ~LiftDrag() {}\n\n\n\n /// \\brief Return (derived) type of lift&drag model.\n\n public: virtual std::string GetType() = 0;\n\n\n\n /// \\brief Compute the lift and drag force.\n\n public: virtual ignition::math::Vector3d compute(\n\n const ignition::math::Vector3d &_velL) = 0;\n\n\n\n /// \\brief Return paramater in vector form for the given tag\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":33,"score":202232.0940684559},{"content":"namespace gazebo\n\n{\n\n// Pi\n\n#define PI 3.14159265359\n\n\n\n/// \\brief Conversion of a string to a double vector\n\ninline std::vector<double> Str2Vector(std::string _input)\n\n{\n\n std::vector<double> output;\n\n std::string buf;\n\n std::stringstream ss(_input);\n\n while (ss >> buf)\n\n output.push_back(std::stod(buf));\n\n return output;\n\n}\n\n\n\n/// \\brief Returns the cross product operator matrix\n\n/// for Eigen vectors\n\ninline Eigen::Matrix3d CrossProductOperator(Eigen::Vector3d _x)\n\n{\n\n Eigen::Matrix3d output;\n\n output << 0.0, -_x[2], _x[1], _x[2], 0.0, -_x[0], -_x[1], _x[0], 0.0;\n\n return output;\n\n}\n\n\n\n/// \\brief Returns the cross product operator matrix\n\n/// for Gazebo vectors\n\ninline Eigen::Matrix3d CrossProductOperator(ignition::math::Vector3d _x)\n\n{\n\n Eigen::Matrix3d output;\n\n output << 0.0, -_x[2], _x[1], _x[2], 0.0, -_x[0], -_x[1], _x[0], 0.0;\n\n return output;\n\n}\n\n\n\ninline Eigen::Vector3d ToEigen(const ignition::math::Vector3d &_x)\n\n{\n\n return Eigen::Vector3d(_x[0], _x[1], _x[2]);\n\n}\n\n\n\ninline Eigen::Matrix3d ToEigen(const ignition::math::Matrix3d &_x)\n\n{\n\n Eigen::Matrix3d m;\n\n m << _x(0, 0), _x(0, 1), _x(0, 2),\n\n _x(1, 0), _x(1, 1), _x(1, 2),\n\n _x(2, 0), _x(2, 1), _x(2, 2);\n\n return m;\n\n}\n\n\n\ninline Eigen::Vector6d EigenStack(const ignition::math::Vector3d &_x,\n\n const ignition::math::Vector3d &_y)\n\n{\n\n Eigen::Vector3d xe = ToEigen(_x);\n\n Eigen::Vector3d ye = ToEigen(_y);\n\n Eigen::Vector6d out;\n\n out << xe, ye;\n\n return out;\n\n}\n\n\n\ninline ignition::math::Vector3d Vec3dToGazebo(const Eigen::Vector3d &_x)\n\n{\n\n return ignition::math::Vector3d(_x[0], _x[1], _x[2]);\n\n}\n\n\n\ninline ignition::math::Matrix3d Mat3dToGazebo(const Eigen::Matrix3d &_x)\n\n{\n\n return ignition::math::Matrix3d(_x(0, 0), _x(0, 1), _x(0, 2),\n\n _x(1, 0), _x(1, 1), _x(1, 2),\n\n _x(2, 0), _x(2, 1), _x(2, 2));\n\n}\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Def.h","rank":34,"score":201943.9174409903},{"content":"/// \\brief Factory singleton class that creates a LiftDrag from sdf.\n\nclass LiftDragFactory\n\n{\n\n /// \\brief Create LiftDrag object according to its sdf Description.\n\n public: LiftDrag* CreateLiftDrag(sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Returns the singleton instance of this factory.\n\n public: static LiftDragFactory& GetInstance();\n\n\n\n /// \\brief Register a LiftDrag class with its creator.\n\n public: bool RegisterCreator(const std::string& _identifier,\n\n LiftDragCreator _creator);\n\n\n\n /// \\brief Constructor is private since this is a singleton.\n\n private: LiftDragFactory() {}\n\n\n\n /// \\brief Map of each registered identifier to its corresponding creator.\n\n private: std::map<std::string, LiftDragCreator> creators_;\n\n};\n\n\n\n/// Use the following macro within a LiftDrag declaration:\n\n#define REGISTER_LIFTDRAG(type) static const bool registeredWithFactory\n\n\n\n/// Use the following macro before a LiftDrag's definition:\n\n#define REGISTER_LIFTDRAG_CREATOR(type, creator) \\\n\n const bool type::registeredWithFactory = \\\n\n LiftDragFactory::GetInstance().RegisterCreator( \\\n\n type::IDENTIFIER, creator);\n\n\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":35,"score":200337.60200787074},{"content":"//////////////////////////////////////////////////////////////////////////////\n\n/// \\brief Class containing the methods and attributes for a hydrodynamic model\n\n/// for a cylinder in the fluid\n\nclass HMCylinder : public HMFossen\n\n{\n\n /// \\brief Create model of this type with parameter values from sdf.\n\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\n\n physics::LinkPtr _link);\n\n\n\n /// \\brief Return (derived) type of hydrodynamic model\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Prints parameters\n\n public: virtual void Print(std::string _paramName,\n\n std::string _message = std::string());\n\n\n\n /// \\brief Register this model with the factory.\n\n private: REGISTER_HYDRODYNAMICMODEL(HMCylinder);\n\n\n\n /// \\brief Unique identifier for this geometry\n\n protected: static const std::string IDENTIFIER;\n\n\n\n protected: HMCylinder(sdf::ElementPtr _sdf, physics::LinkPtr _link);\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":36,"score":198483.24670590056},{"content":"//////////////////////////////////////////////////////////////////////////////\n\n/// \\brief Class containing the methods and attributes for a hydrodynamic model\n\n/// for a sphere in the fluid\n\nclass HMSphere : public HMFossen\n\n{\n\n /// \\brief Create model of this type with parameter values from sdf.\n\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\n\n physics::LinkPtr _link);\n\n\n\n /// \\brief Return (derived) type of hydrodynamic model\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Prints parameters\n\n public: virtual void Print(std::string _paramName,\n\n std::string _message = std::string());\n\n\n\n /// \\brief Register this model with the factory.\n\n protected: REGISTER_HYDRODYNAMICMODEL(HMSphere);\n\n\n\n /// \\brief Unique identifier for this geometry\n\n protected: static const std::string IDENTIFIER;\n\n\n\n protected: HMSphere(sdf::ElementPtr _sdf, physics::LinkPtr _link);\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":37,"score":198483.24670590056},{"content":"//////////////////////////////////////////////////////////////////////////////\n\n/// \\brief Class containing the methods and attributes for a hydrodynamic model\n\n/// for a box in the fluid\n\nclass HMBox : public HMFossen\n\n{\n\n /// \\brief Create model of this type with parameter values from sdf.\n\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\n\n physics::LinkPtr _link);\n\n\n\n /// \\brief Return (derived) type of hydrodynamic model\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Prints parameters\n\n public: virtual void Print(std::string _paramName,\n\n std::string _message = std::string());\n\n\n\n /// \\brief Register this model with the factory.\n\n private: REGISTER_HYDRODYNAMICMODEL(HMBox);\n\n\n\n /// \\brief Unique identifier for this geometry\n\n protected: static const std::string IDENTIFIER;\n\n\n\n /// \\brief Constructor\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":38,"score":198483.24670590056},{"content":"//////////////////////////////////////////////////////////////////////////////\n\n/// \\brief Class containing the methods and attributes for a hydrodynamic model\n\n/// for a spheroid in the fluid\n\n/// Reference: Antonelli - Underwater Robots\n\nclass HMSpheroid : public HMFossen\n\n{\n\n /// \\brief Create model of this type with parameter values from sdf.\n\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\n\n physics::LinkPtr _link);\n\n\n\n /// \\brief Return (derived) type of hydrodynamic model\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Prints parameters\n\n public: virtual void Print(std::string _paramName,\n\n std::string _message = std::string());\n\n\n\n /// \\brief Register this model with the factory.\n\n private: REGISTER_HYDRODYNAMICMODEL(HMSpheroid);\n\n\n\n /// \\brief Unique identifier for this geometry\n\n protected: static const std::string IDENTIFIER;\n\n\n\n protected: HMSpheroid(sdf::ElementPtr _sdf, physics::LinkPtr _link);\n\n\n\n /// \\brief Length of the sphroid\n\n protected: double length;\n\n\n\n /// \\brief Prolate spheroid's smaller radius\n\n protected: double radius;\n\n};\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h","rank":39,"score":198483.07418312918},{"content":"/// \\brief Basic quadratic (Hugin) lift&drag model, page 18 from [1].\n\n/// [1] Engelhardtsen, Øystein. \"3D AUV Collision Avoidance.\" (2007).\n\nclass LiftDragQuadratic : public LiftDrag\n\n{\n\n /// \\brief Create thruster model of this type with parameter values from sdf.\n\n public: static LiftDrag* create(sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Return (derived) type of dynamic system.\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Compute the lift and drag force.\n\n public: virtual ignition::math::Vector3d compute(const ignition::math::Vector3d &velL);\n\n\n\n /// \\brief Register this model with the factory.\n\n private: REGISTER_LIFTDRAG(LiftDragQuadratic);\n\n\n\n /// \\brief Return paramater in scalar form for the given tag\n\n public: virtual bool GetParam(std::string _tag, double& _output);\n\n\n\n /// \\brief Return list of all parameters\n\n public: virtual std::map<std::string, double> GetListParams();\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":40,"score":194890.10908560507},{"content":"/// \\brief Lift&drag model that models lift/drag coeffs using two lines.\n\n/// This is based on Gazebo's LiftDragPlugin but implemented as a derived\n\n/// LiftDrag model to allow using it in combination with the dynamics of a\n\n/// Fin.\n\nclass LiftDragTwoLines: public LiftDrag\n\n{\n\n /// \\brief Create thruster model of this type with parameter values from sdf.\n\n public: static LiftDrag* create(sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Return (derived) type of dynamic system.\n\n public: virtual std::string GetType() { return IDENTIFIER; }\n\n\n\n /// \\brief Compute the lift and drag force.\n\n public: virtual ignition::math::Vector3d compute(const ignition::math::Vector3d &_velL);\n\n\n\n /// \\brief Register this model with the factory.\n\n private: REGISTER_LIFTDRAG(LiftDragTwoLines);\n\n\n\n /// \\brief Unique identifier for this dynamical model.\n\n private: static const std::string IDENTIFIER;\n\n\n\n /// \\brief Return paramater in scalar form for the given tag\n\n public: virtual bool GetParam(std::string _tag, double& _output);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h","rank":41,"score":193163.31436877613},{"content":"class CustomBatteryConsumerROSPlugin : public ModelPlugin\n\n{\n\n /// \\brief Constructor\n\n public: CustomBatteryConsumerROSPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~CustomBatteryConsumerROSPlugin();\n\n\n\n /// \\brief Load module and read parameters from SDF.\n\n public: void Load(physics::ModelPtr _parent, sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Callback for the device state topic subscriber\n\n protected: void UpdateDeviceState(const std_msgs::msg::Bool::SharedPtr _msg);\n\n\n\n /// \\brief Update power load\n\n protected: void UpdatePowerLoad(double _powerLoad = 0.0);\n\n\n\n /// \\brief Pointer to this ROS node's handle.\n\n protected: gazebo_ros::Node::SharedPtr myRosNode;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/CustomBatteryConsumerROSPlugin.h","rank":42,"score":191771.59720822316},{"content":" class FinROSPlugin : public gazebo::FinPlugin\n\n {\n\n using GetListParam = uuv_gazebo_ros_plugins_msgs::srv::GetListParam;\n\n using FloatStamped = uuv_gazebo_ros_plugins_msgs::msg::FloatStamped;\n\n\n\n /// \\brief Constrcutor.\n\n public: FinROSPlugin();\n\n\n\n /// \\brief Destructor.\n\n public: ~FinROSPlugin();\n\n\n\n /// \\brief Load module and read parameters from SDF.\n\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Publish state via ROS.\n\n public: void RosPublishStates();\n\n\n\n /// \\brief Set new set point.\n\n public: void SetReference(\n\n const uuv_gazebo_ros_plugins_msgs::msg::FloatStamped::SharedPtr _msg);\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h","rank":43,"score":186391.3221754486},{"content":" class UnderwaterObjectROSPlugin : public gazebo::UnderwaterObjectPlugin\n\n {\n\n /// \\brief Constructor\n\n public: UnderwaterObjectROSPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~UnderwaterObjectROSPlugin();\n\n\n\n /// \\brief Load module and read parameters from SDF.\n\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Initialize Module.\n\n public: virtual void Init();\n\n\n\n /// \\brief Reset Module.\n\n public: virtual void Reset();\n\n\n\n /// \\brief Update the simulation state.\n\n /// \\param[in] _info Information used in the update event.\n\n public: virtual void Update(const gazebo::common::UpdateInfo &_info);\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/UnderwaterObjectROSPlugin.h","rank":44,"score":183523.4143394485},{"content":" protected: void UpdateInput(ConstDoublePtr &_msg);\n\n\n\n /// \\brief Reads current velocity topic\n\n protected: void UpdateCurrentVelocity(ConstVector3dPtr &_msg);\n\n\n\n /// \\brief Helper function that builds and return the plugin's topic prefix\n\n protected: std::string BuildTopicPrefix(const std::string& rosNamespace, int id);\n\n\n\n /// \\brief Fin dynamic model\n\n protected: std::shared_ptr<Dynamics> dynamics;\n\n\n\n /// \\brief Lift&Drag model\n\n protected: std::shared_ptr<LiftDrag> liftdrag;\n\n\n\n /// \\brief Update event\n\n protected: event::ConnectionPtr updateConnection;\n\n\n\n /// \\brief Gazebo node\n\n protected: transport::NodePtr node;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h","rank":45,"score":164648.13158803846},{"content":"\n\n/// \\file UmbilicalPlugin.hh\n\n/// \\brief Model plugin for the umbilical (tether) of an ROV.\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_UMBILICAL_PLUGIN_HH__\n\n#define __UUV_GAZEBO_PLUGINS_UMBILICAL_PLUGIN_HH__\n\n\n\n#include <memory>\n\n#include <string>\n\n\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/common/UpdateInfo.hh>\n\n#include <gazebo/common/Plugin.hh>\n\n#include <gazebo/physics/World.hh>\n\n#include <gazebo/transport/TransportTypes.hh>\n\n\n\n#include <uuv_gazebo_plugins/UmbilicalModel.h>\n\n\n\nnamespace gazebo\n\n{\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h","rank":46,"score":164646.12501589928},{"content":"\n\n/// \\file FinPlugin.hh\n\n/// \\brief Model plugin for description of a submarine's fin.\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_FIN_PLUGIN_HH__\n\n#define __UUV_GAZEBO_PLUGINS_FIN_PLUGIN_HH__\n\n\n\n#include <boost/shared_ptr.hpp>\n\n#include <gazebo/gazebo.hh>\n\n#include <sdf/sdf.hh>\n\n\n\n#include <gazebo/msgs/msgs.hh>\n\n#include <uuv_gazebo_plugins/Dynamics.h>\n\n#include <uuv_gazebo_plugins/LiftDragModel.h>\n\n\n\n#include \"Double.pb.h\"\n\n\n\nnamespace gazebo {\n\n\n\n/// \\brief Definition of a pointer to the floating point message\n\ntypedef const boost::shared_ptr<const uuv_gazebo_plugins_msgs::msgs::Double>\n\nConstDoublePtr;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h","rank":47,"score":164644.9124000323},{"content":"\n\n/// \\file ThrusterPlugin.hh\n\n/// \\brief Model plugin for description of the thruster dynamics\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_THRUSTER_PLUGIN_HH__\n\n#define __UUV_GAZEBO_PLUGINS_THRUSTER_PLUGIN_HH__\n\n\n\n#include <boost/shared_ptr.hpp>\n\n\n\n#include <map>\n\n#include <string>\n\n#include <memory>\n\n\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/transport/TransportTypes.hh>\n\n\n\n#include <sdf/sdf.hh>\n\n\n\n#include <uuv_gazebo_plugins/ThrusterConversionFcn.h>\n\n#include <uuv_gazebo_plugins/Dynamics.h>\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":48,"score":164641.5549979386},{"content":" /// \\brief Pointer to the model structure\n\n protected: gazebo::physics::ModelPtr model;\n\n\n\n /// \\brief Pointer to the world plugin\n\n protected: gazebo::physics::WorldPtr world;\n\n\n\n /// \\brief Gazebo node\n\n protected: gazebo::transport::NodePtr node;\n\n\n\n /// \\brief Subcriber to flow message\n\n protected: gazebo::transport::SubscriberPtr flowSubscriber;\n\n\n\n /// \\brief Flow velocity vector read from topic\n\n protected: ignition::math::Vector3d flowVelocity;\n\n\n\n /// \\brief Pointer to UmbilicalModel used in this plugin.\n\n protected: std::shared_ptr<UmbilicalModel> umbilical;\n\n};\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h","rank":49,"score":164641.04727561132},{"content":" public: void Update(const common::UpdateInfo &_info);\n\n\n\n /// \\brief Callback for the input topic subscriber\n\n protected: void UpdateInput(ConstDoublePtr &_msg);\n\n\n\n /// \\brief Builds the topic prefix name\n\n protected: std::string BuildTopicPrefix(const std::string& pluginNamespace, int id);\n\n\n\n /// \\brief Thruster dynamic model\n\n protected: std::shared_ptr<Dynamics> thrusterDynamics;\n\n\n\n /// \\brief Thruster conversion function\n\n protected: std::shared_ptr<ConversionFunction> conversionFunction;\n\n\n\n /// \\brief Update event\n\n protected: event::ConnectionPtr updateConnection;\n\n\n\n /// \\brief Pointer to the thruster link\n\n protected: physics::LinkPtr thrusterLink;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":50,"score":164640.88450023532},{"content":"\n\n#include \"Double.pb.h\"\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Definition of a pointer to the floating point message\n\ntypedef const boost::shared_ptr<const uuv_gazebo_plugins_msgs::msgs::Double>\n\nConstDoublePtr;\n\n\n\n/// \\brief Class for the thruster plugin\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":51,"score":164639.7574392675},{"content":" /// \\brief Gazebo node\n\n protected: transport::NodePtr node;\n\n\n\n /// \\brief Subscriber to the reference signal topic.\n\n protected: transport::SubscriberPtr commandSubscriber;\n\n\n\n /// \\brief Publisher to the output thrust topic\n\n protected: transport::PublisherPtr thrustTopicPublisher;\n\n\n\n /// \\brief Input command, typically desired angular velocity of the\n\n /// rotor.\n\n protected: double inputCommand;\n\n\n\n /// \\brief Latest thrust force in [N]\n\n protected: double thrustForce;\n\n\n\n /// \\brief Time stamp of latest thrust force\n\n protected: common::Time thrustForceStamp;\n\n\n\n /// \\brief Optional: The rotor joint, used for visualization\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":52,"score":164636.8162397408},{"content":" protected: physics::JointPtr joint;\n\n\n\n /// \\brief: Optional: Commands less than this value will be clamped.\n\n protected: double clampMin;\n\n\n\n /// \\brief: Optional: Commands greater than this value will be clamped.\n\n protected: double clampMax;\n\n\n\n /// \\brief: Optional: Minimum thrust force output\n\n protected: double thrustMin;\n\n\n\n /// \\brief: Optional: Maximum thrust force output\n\n protected: double thrustMax;\n\n\n\n /// \\brief Thruster ID, used to generated topic names automatically\n\n protected: int thrusterID;\n\n\n\n /// \\brief Thruster topics prefix\n\n protected: std::string myTopicPrefix;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":53,"score":164631.3632123606},{"content":" /// \\brief: Optional: Gain factor: Desired angular velocity = command * gain\n\n protected: double gain;\n\n\n\n /// \\brief Optional: Flag to indicate if the thruster is turned on or off\n\n protected: bool isOn;\n\n\n\n /// \\brief Optional: Output thrust efficiency factor of the thruster\n\n protected: double thrustEfficiency;\n\n\n\n /// \\brief Optional: Propeller angular velocity efficiency term\n\n protected: double propellerEfficiency;\n\n\n\n /// \\brief The axis about which the thruster rotates\n\n protected: ignition::math::Vector3d thrusterAxis;\n\n};\n\n}\n\n#endif // __UUV_GAZEBO_PLUGINS_THRUSTER_PLUGIN_HH__\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":54,"score":164628.4042333008},{"content":" /// \\brief The fin joint\n\n protected: physics::JointPtr joint;\n\n\n\n /// \\brief The fin link\n\n protected: physics::LinkPtr link;\n\n\n\n /// \\brief Subscriber to the reference signal topic.\n\n protected: transport::SubscriberPtr commandSubscriber;\n\n\n\n /// \\brief Publisher to the output thrust topic\n\n protected: transport::PublisherPtr anglePublisher;\n\n\n\n /// \\brief Force component calculated from the lift and drag module\n\n protected: ignition::math::Vector3d finForce;\n\n\n\n /// \\brief Latest input command.\n\n protected: double inputCommand;\n\n\n\n /// \\brief Fin ID\n\n protected: int finID;\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h","rank":55,"score":164622.2128653757},{"content":"\n\n /// \\brief Topic prefix\n\n protected: std::string myTopicPrefix;\n\n\n\n /// \\brief Latest fin angle in [rad].\n\n protected: double angle;\n\n\n\n /// \\brief Time stamp of latest thrust force\n\n protected: common::Time angleStamp;\n\n\n\n /// \\brief Subcriber to current message\n\n protected: transport::SubscriberPtr currentSubscriber;\n\n\n\n /// \\brief Current velocity vector read from topic\n\n protected: ignition::math::Vector3d currentVelocity;\n\n};\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h","rank":56,"score":164620.6327574573},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h","rank":57,"score":164619.85566904393},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h","rank":58,"score":164619.85566904393},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h","rank":59,"score":164619.85566904393},{"content":"\n\n/// \\file Dynamics.hh\n\n/// \\brief 1D dynamic models\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_THRUSTER_DYNAMICS_HH__\n\n#define __UUV_GAZEBO_PLUGINS_THRUSTER_DYNAMICS_HH__\n\n\n\n#include <map>\n\n#include <string>\n\n\n\n#include <sdf/sdf.hh>\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Abstract base class for thruster dynamics.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h","rank":60,"score":163581.07510939677},{"content":"\n\n /// \\brief Motor-shaft-propeller inertia.\n\n private: double Jmsp;\n\n\n\n /// \\brief Empirically-determined model parameter.\n\n private: double Kv1;\n\n\n\n /// \\brief Empirically-determined model parameter.\n\n private: double Kv2;\n\n\n\n /// \\brief Motor torque constant.\n\n private: double Kt;\n\n\n\n /// \\brief Winding resistance.\n\n private: double Rm;\n\n};\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h","rank":61,"score":163558.5322860184},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h","rank":62,"score":163556.42558817993},{"content":"\n\n/// \\file UnderwaterObjectPlugin.hh\n\n/// \\brief Class declaration for the underwater objects subject to buoyancy,\n\n/// lift and drag forces.\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_UNDERWATER_OBJECT_HH__\n\n#define __UUV_GAZEBO_PLUGINS_UNDERWATER_OBJECT_HH__\n\n\n\n#include <map>\n\n#include <string>\n\n\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/msgs/msgs.hh>\n\n\n\n#include <uuv_gazebo_plugins/HydrodynamicModel.h>\n\n#include <uuv_gazebo_plugins/Def.h>\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Gazebo model plugin class for underwater objects\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":63,"score":163334.21256632352},{"content":" HydrodynamicModelPtr> models;\n\n\n\n /// \\brief Flow velocity vector read from topic\n\n protected: ignition::math::Vector3d flowVelocity;\n\n\n\n /// \\brief Update event\n\n protected: gazebo::event::ConnectionPtr updateConnection;\n\n\n\n /// \\brief Pointer to the world plugin\n\n protected: gazebo::physics::WorldPtr world;\n\n\n\n /// \\brief Pointer to the model structure\n\n protected: gazebo::physics::ModelPtr model;\n\n\n\n /// \\brief Gazebo node\n\n protected: gazebo::transport::NodePtr node;\n\n\n\n /// \\brief Name of vehicle's base_link\n\n protected: std::string baseLinkName;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":64,"score":163332.66728183758},{"content":" protected: virtual void PublishHydrodynamicWrenches(\n\n gazebo::physics::LinkPtr _link);\n\n\n\n /// \\brief Returns the wrench message for debugging topics\n\n /// \\param[in] _force Force vector\n\n /// \\param[in] _torque Torque vector\n\n /// \\param[in] _output Stamped wrench message to be updated\n\n protected: virtual void GenWrenchMsg(\n\n ignition::math::Vector3d _force, ignition::math::Vector3d _torque,\n\n gazebo::msgs::WrenchStamped &_output);\n\n\n\n /// \\brief Sets the topics used for publishing the intermediate data during\n\n /// the simulation\n\n /// \\param[in] _link Pointer to the link\n\n /// \\param[in] _hydro Pointer to the hydrodynamic model\n\n protected: virtual void InitDebug(gazebo::physics::LinkPtr _link,\n\n gazebo::HydrodynamicModelPtr _hydro);\n\n\n\n /// \\brief Pairs of links & corresponding hydrodynamic models\n\n protected: std::map<gazebo::physics::LinkPtr,\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":65,"score":163325.24000489627},{"content":" /// \\brief Subcriber to flow message\n\n protected: gazebo::transport::SubscriberPtr flowSubscriber;\n\n\n\n /// \\brief Flag to use the global current velocity or the individually\n\n /// assigned current velocity\n\n protected: bool useGlobalCurrent;\n\n\n\n /// \\brief Publishers of hydrodynamic and hydrostatic forces and torques in\n\n /// the case the debug flag is on\n\n protected: std::map<std::string, gazebo::transport::PublisherPtr> hydroPub;\n\n};\n\n}\n\n\n\n#endif // __UUV_GAZEBO_PLUGINS_UNDERWATER_OBJECT_HH__\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":66,"score":163322.20276152485},{"content":" protected: virtual void Connect();\n\n\n\n /// \\brief Reads flow velocity topic\n\n protected: void UpdateFlowVelocity(ConstVector3dPtr &_msg);\n\n\n\n /// \\brief Publish current velocity marker\n\n protected: virtual void PublishCurrentVelocityMarker();\n\n\n\n /// \\brief Publishes the state of the vehicle (is submerged)\n\n protected: virtual void PublishIsSubmerged();\n\n\n\n /// \\brief Publish restoring force\n\n /// \\param[in] _link Pointer to the link where the force information will\n\n /// be extracted from\n\n protected: virtual void PublishRestoringForce(\n\n gazebo::physics::LinkPtr _link);\n\n\n\n /// \\brief Publish hydrodynamic wrenches\n\n /// \\param[in] _link Pointer to the link where the force information will\n\n /// be extracted from\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":67,"score":163317.10127482205},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h","rank":68,"score":163308.21535441114},{"content":" class UnderwaterCurrentROSPlugin : public gazebo::UnderwaterCurrentPlugin\n\n {\n\n /// \\brief Class constructor\n\n public: UnderwaterCurrentROSPlugin();\n\n\n\n /// \\brief Class destructor\n\n public: virtual ~UnderwaterCurrentROSPlugin();\n\n\n\n /// \\brief Load module and read parameters from SDF.\n\n public: void Load(gazebo::physics::WorldPtr _world,\n\n sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Service call to update the parameters for the velocity\n\n /// Gauss-Markov process model\n\n public: void UpdateCurrentVelocityModel(\n\n const uuv_world_ros_plugins_msgs::srv::SetCurrentModel::Request::SharedPtr _req,\n\n uuv_world_ros_plugins_msgs::srv::SetCurrentModel::Response::SharedPtr _res);\n\n\n\n /// \\brief Service call to update the parameters for the horizontal angle\n\n /// Gauss-Markov process model\n","file_path":"uuv_world_plugins/uuv_world_ros_plugins/include/uuv_world_ros_plugins/UnderwaterCurrentROSPlugin.h","rank":69,"score":163010.5229603382},{"content":"\n\n/// \\file BuoyantObject.hh\n\n/// \\brief Description of a buoyant object\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_BUOYANT_OBJECT_HH__\n\n#define __UUV_GAZEBO_PLUGINS_BUOYANT_OBJECT_HH__\n\n\n\n#include <string>\n\n#include <map>\n\n\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/physics/Link.hh>\n\n#include <gazebo/physics/Collision.hh>\n\n#include <gazebo/physics/Shape.hh>\n\n\n\n#define RESTORING_FORCE \"restoring_force\"\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Class describing the dynamics of a buoyant object, useful for simple\n\n/// representations of underwater structures\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":70,"score":162174.37894061618},{"content":" /// \\brief Sets bounding box\n\n public: void SetBoundingBox(const ignition::math::Box &_bBox);\n\n\n\n /// \\brief Adds a field in the hydroWrench map\n\n public: void SetStoreVector(std::string _tag);\n\n\n\n /// \\brief Get vector from the hydroWrench map\n\n public: ignition::math::Vector3d GetStoredVector(std::string _tag);\n\n\n\n /// \\brief Set debug flag to store intermediate forces and torques\n\n public: void SetDebugFlag(bool _debugOn = true);\n\n\n\n /// \\brief Returns true if the robot is completely submerged\n\n public: bool IsSubmerged();\n\n\n\n /// \\brief Returns true if the link was set to be neutrally buoyant\n\n public: bool IsNeutrallyBuoyant();\n\n\n\n /// \\brief Returns the debug flag\n\n public: bool GetDebugFlag();\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":71,"score":162161.81243149246},{"content":"\n\n /// \\brief Sets this link as neutrally buoyant\n\n public: void SetNeutrallyBuoyant();\n\n\n\n /// \\brief Store vector in the hydroWrench map if the field has been created\n\n protected: void StoreVector(std::string _tag, ignition::math::Vector3d _vec);\n\n\n\n /// \\brief Volume of fluid displaced by the submerged object\n\n protected: double volume;\n\n\n\n /// \\brief Scaling factor for the volume\n\n protected: double scalingVolume;\n\n\n\n /// \\brief Offset for the volume\n\n protected: double offsetVolume;\n\n\n\n /// \\brief Fluid density\n\n protected: double fluidDensity;\n\n\n\n /// \\brief Acceleration of gravity\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":72,"score":162159.58987276116},{"content":" public: double GetVolume();\n\n\n\n /// \\brief Sets the fluid density in kg/m^3\n\n public: void SetFluidDensity(double _fluidDensity);\n\n\n\n /// \\brief Returns the stored fluid density\n\n public: double GetFluidDensity();\n\n\n\n /// \\brief Sets the position of the center of buoyancy on the body frame\n\n public: void SetCoB(const ignition::math::Vector3d &_centerOfBuoyancy);\n\n\n\n /// \\brief Returns the stored center of buoyancy\n\n public: ignition::math::Vector3d GetCoB();\n\n\n\n /// \\brief Set acceleration of gravity\n\n public: void SetGravity(double _g);\n\n\n\n /// \\brief Get stored acceleration of gravity\n\n public: double GetGravity();\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":73,"score":162157.51202924954},{"content":" protected: physics::LinkPtr link;\n\n\n\n /// \\brief If true, the restoring force will be equal to the gravitational\n\n // force\n\n protected: bool neutrallyBuoyant;\n\n\n\n // \\brief Metacentric width of the robot, used only for surface vessels and\n\n // floating objects\n\n protected: double metacentricWidth;\n\n\n\n /// \\brief Metacentric length of the robot, used only for surface vessels and\n\n /// floating objects\n\n protected: double metacentricLength;\n\n\n\n /// \\brief If the cross section area around water level of the surface vessel\n\n /// is not given, it will be computed from the object's bounding box\n\n protected: double waterLevelPlaneArea;\n\n\n\n /// \\brief Height of the robot that is submerged (only for surface vessels)\n\n protected: double submergedHeight;\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":74,"score":162152.58736305241},{"content":" protected: double g;\n\n\n\n /// \\brief Center of buoyancy in the body frame\n\n protected: ignition::math::Vector3d centerOfBuoyancy;\n\n\n\n /// \\brief TEMP for calculation of the buoyancy\n\n /// force close to the surface\n\n protected: ignition::math::Box boundingBox;\n\n\n\n /// \\brief Storage for hydrodynamic and hydrostatic forces and torques\n\n /// for debugging purposes\n\n protected: std::map<std::string, ignition::math::Vector3d> hydroWrench;\n\n\n\n /// \\brief Debug flag, storing all intermediate forces and torques\n\n protected: bool debugFlag;\n\n\n\n /// \\brief Is submerged flag\n\n protected: bool isSubmerged;\n\n\n\n /// \\brief Pointer to the correspondent robot link\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":75,"score":162151.5074362226},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":76,"score":162151.12649086784},{"content":"\n\n /// \\brief Flag set to true if the information about the metacentric width and\n\n /// height is available\n\n protected: bool isSurfaceVessel;\n\n\n\n /// \\brief Flag set to true if the vessel has reached its submerged height\n\n protected: bool isSurfaceVesselFloating;\n\n};\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h","rank":77,"score":162148.2005125957},{"content":"/// \\brief Abstract base class for thruster dynamics.\n\nclass Dynamics\n\n{\n\n /// \\brief Protected constructor: Use the factory for object creation.\n\n protected: Dynamics() { Reset(); }\n\n\n\n /// \\brief Destructor.\n\n public: virtual ~Dynamics() {}\n\n\n\n /// \\brief Return (derived) type of thruster dynamics.\n\n public: virtual std::string GetType() = 0;\n\n\n\n /// \\brief Update the dynamic model.\n\n /// \\param[in] _cmd The commanded value.\n\n /// \\param[in] _t Time stamp of command.\n\n public: virtual double update(double _cmd, double _t) = 0;\n\n\n\n // \\brief Reset state.\n\n public: virtual void Reset();\n\n\n\n /// \\brief Time of last state update.\n\n protected: double prevTime;\n\n\n\n /// \\brief Latest state.\n\n protected: double state;\n\n};\n\n\n\n/// \\brief Function pointer to create a certain thruster dynamics object.\n\ntypedef Dynamics* (*DynamicsCreator)(sdf::ElementPtr);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h","rank":78,"score":162148.2005125957},{"content":"class UmbilicalSegment\n\n{\n\n public:\n\n UmbilicalSegment() { initSdfSegment(); }\n\n\n\n UmbilicalSegment(const std::string& _name,\n\n const std::string& _fromLink,\n\n const ignition::math::Pose3d& _fromPose,\n\n const ignition::math::Pose3d& _toPose,\n\n physics::ModelPtr _model);\n\n\n\n void initSdfSegment();\n\n\n\n physics::LinkPtr link;\n\n physics::LinkPtr linkA;\n\n physics::JointPtr jointA;\n\n physics::JointPtr jointB;\n\n\n\n std::shared_ptr<UmbilicalSegment> prev, next;\n\n\n\n static sdf::SDFPtr sdfSegment;\n\n};\n\n\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h","rank":79,"score":162019.10142476164},{"content":"\n\n/// \\file ThrusterConversionFcn.hh\n\n/// \\brief Description of the conversion function fo a thruster.\n\n\n\n#ifndef __UUV_GAZEBO_PLUGINS_CONVERSION_FUNCTION_HH__\n\n#define __UUV_GAZEBO_PLUGINS_CONVERSION_FUNCTION_HH__\n\n\n\n#include <map>\n\n#include <string>\n\n#include <vector>\n\n\n\n#include <sdf/sdf.hh>\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Abstact base class for a thruster conversion function.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h","rank":80,"score":160794.151169951},{"content":"\n\n#ifndef __UUV_GAZEBO_PLUGINS_ACCELERATIONS_TEST_PLUGIN_H__\n\n#define __UUV_GAZEBO_PLUGINS_ACCELERATIONS_TEST_PLUGIN_H__\n\n\n\n#include <map>\n\n#include <string>\n\n\n\n#include <gazebo/gazebo.hh>\n\n#include <gazebo/msgs/msgs.hh>\n\n\n\n#include <gazebo_ros/node.hpp>\n\n\n\n#include <uuv_gazebo_plugins/HydrodynamicModel.h>\n\n#include <uuv_gazebo_plugins/Def.h>\n\n\n\n#include <rclcpp/rclcpp.hpp>\n\n#include <geometry_msgs/msg/accel.hpp>\n\n\n\n#include <memory>\n\n\n\nnamespace gazebo\n\n{\n\n/// \\brief Gazebo model plugin class for underwater objects\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h","rank":81,"score":160789.84524700046},{"content":"\n\n#ifndef __THRUSTER_ROS_PLUGIN_HH__\n\n#define __THRUSTER_ROS_PLUGIN_HH__\n\n\n\n#include <map>\n\n#include <string>\n\n#include <vector>\n\n\n\n#include <rclcpp/rclcpp.hpp>\n\n#include <geometry_msgs/msg/wrench_stamped.hpp>\n\n#include <std_msgs/msg/bool.hpp>\n\n#include <std_msgs/msg/float64.hpp>\n\n\n\n#include <gazebo/common/Plugin.hh>\n\n\n\n#include <gazebo_ros/node.hpp>\n\n\n\n#include <uuv_gazebo_plugins/ThrusterPlugin.h>\n\n\n\n#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>\n\n#include <uuv_gazebo_ros_plugins_msgs/srv/set_thruster_state.hpp>\n\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_thruster_state.hpp>\n\n#include <uuv_gazebo_ros_plugins_msgs/srv/set_thruster_efficiency.hpp>\n\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_thruster_efficiency.hpp>\n\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_thruster_conversion_fcn.hpp>\n\n\n\nnamespace uuv_simulator_ros\n\n{\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":82,"score":160782.20935490236},{"content":"\n\n /// \\brief Return the list of paramaters of the lift and drag model\n\n public: void GetLiftDragParams(\n\n const GetListParam::Request::SharedPtr _req,\n\n GetListParam::Response::SharedPtr _res); \n\n\n\n /// \\brief Return the ROS publish period.\n\n public: gazebo::common::Time GetRosPublishPeriod();\n\n\n\n /// \\brief Set the ROS publish frequency (Hz).\n\n public: void SetRosPublishRate(double _hz);\n\n\n\n /// \\brief Initialize Module.\n\n public: virtual void Init();\n\n\n\n /// \\brief Reset Module.\n\n public: virtual void Reset();\n\n\n\n /// \\brief Pointer to this ROS node's handle.\n\n protected: gazebo_ros::Node::SharedPtr myRosNode;\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h","rank":83,"score":160782.03553159724},{"content":"\n\n#ifndef __FIN_ROS_PLUGIN_HH__\n\n#define __FIN_ROS_PLUGIN_HH__\n\n\n\n#include <uuv_gazebo_plugins/FinPlugin.h>\n\n#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>\n\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_list_param.hpp>\n\n\n\n#include <gazebo/common/Plugin.hh>\n\n\n\n#include <gazebo_ros/node.hpp>\n\n\n\n#include <rclcpp/rclcpp.hpp>\n\n#include <geometry_msgs/msg/wrench_stamped.hpp>\n\n\n\n#include <map>\n\n#include <memory>\n\n\n\nnamespace uuv_simulator_ros\n\n{\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h","rank":84,"score":160781.48628431265},{"content":" protected: virtual void Connect();\n\n\n\n /// \\brief Update event\n\n protected: gazebo::event::ConnectionPtr updateConnection;\n\n\n\n /// \\brief Pointer to the world plugin\n\n protected: gazebo::physics::WorldPtr world;\n\n\n\n /// \\brief Pointer to the model structure\n\n protected: gazebo::physics::ModelPtr model;\n\n\n\n /// \\brief Gazebo node\n\n protected: gazebo::transport::NodePtr node;\n\n\n\n /// \\brief Link of test object\n\n protected: physics::LinkPtr link;\n\n\n\n // ROS things\n\n private: gazebo_ros::Node::SharedPtr myRosNode;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h","rank":85,"score":160781.07319393876},{"content":" /// \\brief Get thruster conversion function parameters\n\n public: void GetThrusterConversionFcn(\n\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Response::SharedPtr _res);\n\n\n\n /// \\brief Map of thruster services\n\n //TODO Replace with map<string, ServiceBase::SharedPtr>\n\n //private: std::map<std::string, rclcpp::Service:: ::ServiceServer> services;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>::SharedPtr mySet_thrust_force_efficiencySrv;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>::SharedPtr myGet_thrust_force_efficiencySrv;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>::SharedPtr mySet_dynamic_state_efficiencySrv;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>::SharedPtr myGet_dynamic_state_efficiency;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState>::SharedPtr mySet_thruster_state;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState>::SharedPtr myGet_thruster_state;\n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn>::SharedPtr myGet_thruster_conversion_fcn;\n\n\n\n /// \\brief Pointer to this ROS node's handle.\n\n protected: gazebo_ros::Node::SharedPtr myRosNode;\n\n\n\n /// \\brief Subscriber reacting to new reference thrust set points.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":86,"score":160775.9493560737},{"content":"/// \\brief Factory singleton class that creates a ThrusterDynamics from sdf.\n\nclass DynamicsFactory\n\n{\n\n /// \\brief Create ThrusterDynamics object according to its sdf Description.\n\n public: Dynamics* CreateDynamics(sdf::ElementPtr _sdf);\n\n\n\n /// \\brief Returns the singleton instance of this factory.\n\n public: static DynamicsFactory& GetInstance();\n\n\n\n /// \\brief Register a ThrusterDynamic class with its creator.\n\n public: bool RegisterCreator(const std::string& _identifier,\n\n DynamicsCreator _creator);\n\n\n\n /// \\brief Constructor is private since this is a singleton.\n\n private: DynamicsFactory() {}\n\n\n\n /// \\brief Map of each registered identifier to its corresponding creator.\n\n private: std::map<std::string, DynamicsCreator> creators_;\n\n};\n\n\n\n/// Use the following macro within a ThrusterDynamics declaration:\n\n#define REGISTER_DYNAMICS(type) static const bool registeredWithFactory\n\n\n\n/// Use the following macro before a ThrusterDynamics's definition:\n\n#define REGISTER_DYNAMICS_CREATOR(type, creator) \\\n\n const bool type::registeredWithFactory = \\\n\n DynamicsFactory::GetInstance().RegisterCreator( \\\n\n type::IDENTIFIER, creator);\n\n\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h","rank":87,"score":160775.89838966803},{"content":"\n\n /// \\brief Set the ROS publish frequency (Hz).\n\n public: void SetRosPublishRate(double _hz);\n\n\n\n /// \\brief Initialize Module.\n\n public: virtual void Init();\n\n\n\n /// \\brief Reset Module.\n\n public: virtual void Reset();\n\n\n\n /// \\brief Set the thrust efficiency factor\n\n public: void SetThrustForceEfficiency(\n\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res);\n\n\n\n /// \\brief Get the thrust efficiency factor\n\n public: void GetThrustForceEfficiency(\n\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":88,"score":160775.24453336725},{"content":" /// \\brief The unique identifier of this conversion function.\n\n private: static const std::string IDENTIFIER;\n\n\n\n /// \\brief Constructor.\n\n private: ConversionFunctionLinearInterp(const std::vector<double> &_input,\n\n const std::vector<double> &_output);\n\n\n\n /// \\brief Lookup table maps input values -> output values.\n\n private: std::map<double, double> lookupTable;\n\n};\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h","rank":89,"score":160774.7862438726},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h","rank":90,"score":160773.84567984412},{"content":" /// \\brief Set the dynamic state efficiency factor\n\n public: void SetDynamicStateEfficiency(\n\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res);\n\n\n\n /// \\brief Get the dynamic state efficiency factor\n\n public: void GetDynamicStateEfficiency(\n\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res);\n\n\n\n /// \\brief Turn thruster on/off\n\n public: void SetThrusterState(\n\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Response::SharedPtr _res);\n\n\n\n /// \\brief Get thruster state\n\n public: void GetThrusterState(\n\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Request::SharedPtr _req,\n\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Response::SharedPtr _res);\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":91,"score":160772.70784540157},{"content":" /// \\brief Constructor.\n\n private: ConversionFunctionBessa(double _rotorConstantL,\n\n double _rotorConstantR,\n\n double _deltaL, double _deltaR);\n\n\n\n /// \\brief Rotor constant for omega < 0.\n\n private: double rotorConstantL;\n\n\n\n /// \\brief Rotor constant for omega > 0.\n\n private: double rotorConstantR;\n\n\n\n /// \\brief Dead-zone for omega < 0.\n\n private: double deltaL;\n\n\n\n /// \\brief Dead-zone for omega > 0.\n\n private: double deltaR;\n\n};\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h","rank":92,"score":160770.91970157198},{"content":"\n\n /// \\brief Subscriber reacting to new reference set points.\n\n private: rclcpp::Subscription<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr mySubReference;\n\n\n\n /// \\brief Publisher for current state.\n\n private: rclcpp::Publisher<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr myPubState;\n\n\n\n /// \\brief Publisher for current actual thrust.\n\n private: rclcpp::Publisher<geometry_msgs::msg::WrenchStamped>::SharedPtr myPubFinForce;\n\n\n\n /// \\brief Connection for callbacks on update world.\n\n private: gazebo::event::ConnectionPtr rosPublishConnection;\n\n\n\n /// \\brief Period after which we should publish a message via ROS.\n\n private: gazebo::common::Time rosPublishPeriod;\n\n\n\n /// \\brief Map of services\n\n private: std::map<std::string, \n\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetListParam>::SharedPtr> myServicesById;\n\n\n\n /// \\brief Last time we published a message via ROS.\n\n private: gazebo::common::Time lastRosPublishTime;\n\n };\n\n}\n\n\n\n#endif\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h","rank":93,"score":160769.37926608554},{"content":" /// \\brief Period after which we should publish a message via ROS.\n\n private: gazebo::common::Time rosPublishPeriod;\n\n\n\n /// \\brief Last time we published a message via ROS.\n\n private: gazebo::common::Time lastRosPublishTime;\n\n };\n\n}\n\n\n\n#endif // __THRUSTER_ROS_PLUGIN_HH__\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":94,"score":160766.55286658258},{"content":" protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_b_gazebo;\n\n protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_b_numeric;\n\n\n\n protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_w_gazebo;\n\n protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_w_numeric;\n\n\n\n /// \\brief Velocity of link with respect to world frame in previous time step.\n\n Eigen::Vector6d last_w_v_w_b;\n\n\n\n /// \\brief Time stamp of previous time step.\n\n common::Time lastTime;\n\n};\n\n}\n\n\n\n#endif // __UUV_GAZEBO_PLUGINS_ACCELERATIONS_TEST_PLUGIN_H__\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h","rank":95,"score":160766.45404709195},{"content":" private: rclcpp::Subscription<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr mySubThrustReference;\n\n\n\n /// \\brief Publisher for current actual thrust.\n\n private: rclcpp::Publisher<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr myPubThrust;\n\n\n\n /// \\brief Publisher for current actual thrust as wrench.\n\n private: rclcpp::Publisher<geometry_msgs::msg::WrenchStamped>::SharedPtr myPubThrustWrench;\n\n\n\n /// \\brief Publisher for the thruster state\n\n private: rclcpp::Publisher<std_msgs::msg::Bool>::SharedPtr myPubThrusterState;\n\n\n\n /// \\brief Publisher for the thrust force efficiency\n\n private: rclcpp::Publisher<std_msgs::msg::Float64>::SharedPtr myPubThrustForceEff;\n\n\n\n /// \\brief Publisher for the dynamic state efficiency\n\n private: rclcpp::Publisher<std_msgs::msg::Float64>::SharedPtr myPubDynamicStateEff;\n\n\n\n /// \\brief Connection for callbacks on update world.\n\n private: gazebo::event::ConnectionPtr rosPublishConnection;\n\n\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":96,"score":160765.34936376638},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h","rank":97,"score":160760.42739854258},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h","rank":98,"score":160760.42739854258},{"content":"// Copyright (c) 2020 The Plankton Authors.\n\n// All rights reserved.\n\n//\n\n// This source code is derived from UUV Simulator\n\n// (https://github.com/uuvsimulator/uuv_simulator)\n\n// Copyright (c) 2016-2019 The UUV Simulator Authors\n\n// licensed under the Apache license, Version 2.0\n\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n","file_path":"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h","rank":99,"score":160760.42739854258}],"string":"[\n {\n \"content\": \"/// \\\\brief Gazebo model plugin class for underwater objects\\n\\nclass UnderwaterObjectPlugin : public gazebo::ModelPlugin\\n\\n{\\n\\n /// \\\\brief Constructor\\n\\n public: UnderwaterObjectPlugin();\\n\\n\\n\\n /// \\\\brief Destructor\\n\\n public: virtual ~UnderwaterObjectPlugin();\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Load(gazebo::physics::ModelPtr _model,\\n\\n sdf::ElementPtr _sdf);\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Update the simulation state.\\n\\n /// \\\\param[in] _info Information used in the update event.\\n\\n public: virtual void Update(const gazebo::common::UpdateInfo &_info);\\n\\n\\n\\n /// \\\\brief Connects the update event callback\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 0,\n \"score\": 229703.75870389285\n },\n {\n \"content\": \"/// \\\\brief Gazebo model plugin class for underwater objects\\n\\nclass AccelerationsTestPlugin : public gazebo::ModelPlugin\\n\\n{\\n\\n /// \\\\brief Constructor\\n\\n public: AccelerationsTestPlugin();\\n\\n\\n\\n /// \\\\brief Destructor\\n\\n public: virtual ~AccelerationsTestPlugin();\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Load(gazebo::physics::ModelPtr _model,\\n\\n sdf::ElementPtr _sdf);\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Update the simulation state.\\n\\n /// \\\\param[in] _info Information used in the update event.\\n\\n public: void Update(const gazebo::common::UpdateInfo &_info);\\n\\n\\n\\n /// \\\\brief Connects the update event callback\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h\",\n \"rank\": 1,\n \"score\": 226678.4903163004\n },\n {\n \"content\": \"class JointStatePublisher : public gazebo::ModelPlugin\\n\\n{\\n\\n public: JointStatePublisher();\\n\\n\\n\\n public: ~JointStatePublisher();\\n\\n\\n\\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\\n\\n\\n\\n public: void OnUpdate(const gazebo::common::UpdateInfo &_info);\\n\\n\\n\\n public: void PublishJointStates();\\n\\n\\n\\n private: bool IsIgnoredJoint(std::string _jointName);\\n\\n\\n\\n private: gazebo::physics::WorldPtr world;\\n\\n\\n\\n private: gazebo::physics::ModelPtr myModel;\\n\\n\\n\\n private: gazebo::event::ConnectionPtr updateConnection;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/JointStatePublisher.h\",\n \"rank\": 2,\n \"score\": 223237.38392002412\n },\n {\n \"content\": \"class UmbilicalModel\\n\\n{\\n\\n /// \\\\brief Protected constructor: Use the factory instead\\n\\n protected: UmbilicalModel() {}\\n\\n\\n\\n /// \\\\brief Destructor.\\n\\n public: virtual ~UmbilicalModel() {}\\n\\n\\n\\n /// \\\\brief Initialize model.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Update Umbilical (and apply forces)\\n\\n public: virtual void OnUpdate(const common::UpdateInfo &_info,\\n\\n const ignition::math::Vector3d& _flow) = 0;\\n\\n\\n\\n /// \\\\brief Gazebo model to which this umbilical belongs.\\n\\n protected: physics::ModelPtr model;\\n\\n\\n\\n /// \\\\brief Moving connector link of this umbilical.\\n\\n protected: physics::LinkPtr connector;\\n\\n};\\n\\n\\n\\n/// \\\\brief Function pointer to create a certain conversion function.\\n\\ntypedef UmbilicalModel* (*UmbilicalModelCreator)(sdf::ElementPtr,\\n\\n physics::ModelPtr);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h\",\n \"rank\": 3,\n \"score\": 215031.93064528142\n },\n {\n \"content\": \" class ThrusterROSPlugin : public gazebo::ThrusterPlugin\\n\\n {\\n\\n /// \\\\brief Constrcutor.\\n\\n public: ThrusterROSPlugin();\\n\\n\\n\\n /// \\\\brief Destructor.\\n\\n public: ~ThrusterROSPlugin();\\n\\n\\n\\n /// \\\\brief Load module and read parameters from SDF.\\n\\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Publish thruster state via ROS.\\n\\n public: void RosPublishStates();\\n\\n\\n\\n /// \\\\brief Set new set point (desired thrust [N]) for thruster.\\n\\n public: void SetThrustReference(\\n\\n const uuv_gazebo_ros_plugins_msgs::msg::FloatStamped::SharedPtr _msg);\\n\\n\\n\\n /// \\\\brief Return the ROS publish period.\\n\\n public: gazebo::common::Time GetRosPublishPeriod();\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 4,\n \"score\": 213665.06149332743\n },\n {\n \"content\": \"class UmbilicalModelBerg : public UmbilicalModel\\n\\n{\\n\\n /// \\\\brief Protected constructor: Use the factory instead\\n\\n protected: UmbilicalModelBerg(sdf::ElementPtr _sdf,\\n\\n physics::ModelPtr _model);\\n\\n\\n\\n /// \\\\brief Create UmbilicalModel according to its description.\\n\\n public: static UmbilicalModel* create(sdf::ElementPtr _sdf,\\n\\n physics::ModelPtr _model);\\n\\n\\n\\n /// \\\\brief Update Umbilical (and apply forces)\\n\\n public: virtual void OnUpdate(const common::UpdateInfo &_info,\\n\\n const ignition::math::Vector3d& _flow);\\n\\n\\n\\n /// \\\\brief Register this UmbilicalModel function with the factory.\\n\\n private: REGISTER_UMBILICALMODEL(UmbilicalModelBerg);\\n\\n\\n\\n /// \\\\brief The unique identifier of this UmbilicalModel.\\n\\n private: static const std::string IDENTIFIER;\\n\\n\\n\\n /// \\\\brief Umbilical diameter.\\n\\n private: double diameter;\\n\\n\\n\\n /// \\\\brief Water density.\\n\\n private: double rho;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif // __UUV_GAZEBO_PLUGINS_UMBILICAL_MODEL_HH__\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h\",\n \"rank\": 5,\n \"score\": 213306.7062644014\n },\n {\n \"content\": \"/// \\\\brief Factory singleton class that creates a HydrodynamicModel from sdf.\\n\\nclass HydrodynamicModelFactory\\n\\n{\\n\\n /// \\\\brief Create HydrodynamicModel object according to its sdf Description.\\n\\n public: HydrodynamicModel* CreateHydrodynamicModel(sdf::ElementPtr _sdf,\\n\\n physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Returns the singleton instance of this factory.\\n\\n public: static HydrodynamicModelFactory& GetInstance();\\n\\n\\n\\n /// \\\\brief Register a class with its creator.\\n\\n public: bool RegisterCreator(const std::string& _identifier,\\n\\n HydrodynamicModelCreator _creator);\\n\\n\\n\\n /// \\\\brief Constructor is private since this is a singleton.\\n\\n private: HydrodynamicModelFactory() {}\\n\\n\\n\\n /// \\\\brief Map of each registered identifier to its corresponding creator.\\n\\n private: std::map<std::string, HydrodynamicModelCreator> creators_;\\n\\n};\\n\\n\\n\\n/// Use the following macro within a HydrodynamicModel declaration:\\n\\n#define REGISTER_HYDRODYNAMICMODEL(type) static const bool registeredWithFactory\\n\\n\\n\\n/// Use the following macro before a HydrodynamicModel's definition:\\n\\n#define REGISTER_HYDRODYNAMICMODEL_CREATOR(type, creator) \\\\\\n\\n const bool type::registeredWithFactory = \\\\\\n\\n HydrodynamicModelFactory::GetInstance().RegisterCreator( \\\\\\n\\n type::IDENTIFIER, creator);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 6,\n \"score\": 213242.29465609614\n },\n {\n \"content\": \"/// \\\\brief Factory singleton class that creates an UmbilicalModel from sdf.\\n\\nclass UmbilicalModelFactory\\n\\n{\\n\\n /// \\\\brief Create a ConversionFunction object according to its sdf Description\\n\\n public: UmbilicalModel* CreateUmbilicalModel(sdf::ElementPtr _sdf,\\n\\n physics::ModelPtr _model);\\n\\n\\n\\n /// \\\\brief Return the singleton instance of this factory.\\n\\n public: static UmbilicalModelFactory& GetInstance();\\n\\n\\n\\n /// \\\\brief Register an UmbilicalModel class with its creator.\\n\\n public: bool RegisterCreator(const std::string& _identifier,\\n\\n UmbilicalModelCreator _creator);\\n\\n\\n\\n /// \\\\brief Constructor is private since this is a singleton.\\n\\n private: UmbilicalModelFactory() {}\\n\\n\\n\\n /// \\\\brief Map of each registered identifiers to its corresponding creator\\n\\n private: std::map<std::string, UmbilicalModelCreator> creators_;\\n\\n};\\n\\n\\n\\n/// Use the following macro within a ThrusterDynamics declaration:\\n\\n#define REGISTER_UMBILICALMODEL(type) \\\\\\n\\n static const bool registeredWithFactory\\n\\n\\n\\n/// Use the following macro before a ThrusterDynamics's definition:\\n\\n#define REGISTER_UMBILICALMODEL_CREATOR(type, creator) \\\\\\n\\n const bool type::registeredWithFactory = \\\\\\n\\n UmbilicalModelFactory::GetInstance().RegisterCreator( \\\\\\n\\n type::IDENTIFIER, creator);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h\",\n \"rank\": 7,\n \"score\": 213242.29465609614\n },\n {\n \"content\": \"//////////////////////////////////////////////////////////////////////////////\\n\\n/// \\\\brief Class containting the methods and attributes\\n\\n/// for a Fossen robot-like hydrodynamic model. The restoring\\n\\n/// forces are applied by the BuoyantObject class methods. Using the\\n\\n/// plugin for UUV models will use both this and the buoyant object\\n\\n/// class definitions, therefore the restoring forces were not\\n\\n/// inherited here.\\n\\n/// References:\\n\\n/// - Fossen, Thor, \\\"Handbook of Marine Craft and Hydrodynamics and Motion\\n\\n/// Control\\\", 2011\\n\\nclass HMFossen : public HydrodynamicModel\\n\\n{\\n\\n /// \\\\brief Create model of this type with parameter values from sdf.\\n\\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\\n\\n physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Return (derived) type of hydrodynamic model\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Prints parameters\\n\\n public: virtual void Print(std::string _paramName,\\n\\n std::string _message = std::string());\\n\\n\\n\\n /// \\\\brief Return paramater in vector form for the given tag\\n\\n public: virtual bool GetParam(std::string _tag,\\n\\n std::vector<double>& _output);\\n\\n\\n\\n /// \\\\brief Return paramater in scalar form for the given tag\\n\\n public: virtual bool GetParam(std::string _tag, double& _output);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 8,\n \"score\": 209745.98553800624\n },\n {\n \"content\": \"class HydrodynamicModel : public BuoyantObject\\n\\n{\\n\\n /// \\\\brief Protected constructor: Use the factory for object creation.\\n\\n protected: HydrodynamicModel(sdf::ElementPtr _sdf, physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Returns type of model\\n\\n public: virtual std::string GetType() = 0;\\n\\n\\n\\n /// \\\\brief Computation of the hydrodynamic forces\\n\\n public: virtual void ApplyHydrodynamicForces(\\n\\n double time, const ignition::math::Vector3d &_flowVelWorld) = 0;\\n\\n\\n\\n /// \\\\brief Prints parameters\\n\\n public: virtual void Print(std::string _paramName,\\n\\n std::string _message = std::string()) = 0;\\n\\n\\n\\n /// \\\\brief Return paramater in vector form for the given tag\\n\\n public: virtual bool GetParam(std::string _tag,\\n\\n std::vector<double>& _output) = 0;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 9,\n \"score\": 209732.51851454776\n },\n {\n \"content\": \"\\n\\n/// \\\\file UmbilicalModel.hh\\n\\n/// \\\\brief Various umbilical models.\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_UMBILICAL_MODEL_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_UMBILICAL_MODEL_HH__\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/common/UpdateInfo.hh>\\n\\n#include <gazebo/physics/Link.hh>\\n\\n#include <gazebo/physics/Model.hh>\\n\\n#include <sdf/sdf.hh>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h\",\n \"rank\": 10,\n \"score\": 208197.62172536948\n },\n {\n \"content\": \"\\n\\n/// \\\\file HydrodynamicModel.hh\\n\\n/// \\\\brief This file contains the definition for different classes of\\n\\n/// hydrodynamic models for submerged objects\\n\\n\\n\\n#ifndef __UUV_GAZEBO_HYDRO_MODEL_HH__\\n\\n#define __UUV_GAZEBO_HYDRO_MODEL_HH__\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/physics/Link.hh>\\n\\n#include <gazebo/physics/Model.hh>\\n\\n#include <gazebo/physics/Collision.hh>\\n\\n#include <gazebo/physics/Shape.hh>\\n\\n\\n\\n#include <eigen3/Eigen/Core>\\n\\n#include <eigen3/Eigen/Geometry>\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <map>\\n\\n\\n\\n#include <uuv_gazebo_plugins/Def.h>\\n\\n#include <uuv_gazebo_plugins/BuoyantObject.h>\\n\\n\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 11,\n \"score\": 208196.14206107333\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Filtered linear & angular acceleration vector in link frame.\\n\\n /// This is used to prevent the model to become unstable given that Gazebo\\n\\n /// only calls the update function at the beginning or at the end of a\\n\\n /// iteration of the physics engine\\n\\n protected: Eigen::Vector6d filteredAcc;\\n\\n\\n\\n /// \\\\brief Last timestamp (in seconds) at which ApplyHydrodynamicForces was\\n\\n /// called\\n\\n protected: double lastTime;\\n\\n\\n\\n /// \\\\brief Last body-fixed relative velocity (nu_R in Fossen's equations)\\n\\n protected: Eigen::Vector6d lastVelRel;\\n\\n\\n\\n /// \\\\brief List of parameters needed from the SDF element\\n\\n protected: std::vector<std::string> params;\\n\\n\\n\\n /// \\\\brief Reynolds number (not used by all models)\\n\\n protected: double Re;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 12,\n \"score\": 208182.86126923567\n },\n {\n \"content\": \" /// \\\\brief Temperature (not used by all models)\\n\\n protected: double temperature;\\n\\n};\\n\\n\\n\\n/// \\\\brief Pointer to model\\n\\ntypedef boost::shared_ptr<HydrodynamicModel> HydrodynamicModelPtr;\\n\\n\\n\\n/// \\\\brief Function pointer to create a certain a model\\n\\ntypedef HydrodynamicModel* (*HydrodynamicModelCreator)(sdf::ElementPtr, \\\\\\n\\n physics::LinkPtr);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 13,\n \"score\": 208182.15593407315\n },\n {\n \"content\": \" /// \\\\brief Return paramater in vector form for the given tag\\n\\n public: virtual bool GetParam(std::string _tag,\\n\\n double& _output) = 0;\\n\\n\\n\\n /// \\\\brief Set a scalar parameters\\n\\n public: virtual bool SetParam(std::string _tag, double _input) = 0;\\n\\n\\n\\n /// \\\\brief Filter acceleration (fix due to the update structure of Gazebo)\\n\\n protected: void ComputeAcc(Eigen::Vector6d _velRel,\\n\\n double _time,\\n\\n double _alpha = 0.3);\\n\\n\\n\\n /// \\\\brief Returns true if all parameters are available from the SDF element\\n\\n protected: bool CheckParams(sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Convert vector to comply with the NED reference frame\\n\\n protected: ignition::math::Vector3d ToNED(ignition::math::Vector3d _vec);\\n\\n\\n\\n /// \\\\brief Convert vector to comply with the NED reference frame\\n\\n protected: ignition::math::Vector3d FromNED(ignition::math::Vector3d _vec);\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 14,\n \"score\": 208181.59790110108\n },\n {\n \"content\": \" /// \\\\brief Set scalar parameter\\n\\n public: virtual bool SetParam(std::string _tag, double _input);\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n protected: REGISTER_HYDRODYNAMICMODEL(HMFossen);\\n\\n\\n\\n /// \\\\brief Unique identifier for this geometry\\n\\n protected: static const std::string IDENTIFIER;\\n\\n\\n\\n protected: HMFossen(sdf::ElementPtr _sdf, physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Computation of the hydrodynamic forces\\n\\n public: virtual void ApplyHydrodynamicForces(double time,\\n\\n const ignition::math::Vector3d &_flowVelWorld);\\n\\n\\n\\n /// \\\\brief Computes the added-mass Coriolis matrix Ca.\\n\\n protected: void ComputeAddedCoriolisMatrix(const Eigen::Vector6d& _vel,\\n\\n const Eigen::Matrix6d& _Ma,\\n\\n Eigen::Matrix6d &_Ca) const;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 15,\n \"score\": 208179.4563187558\n },\n {\n \"content\": \" protected: HMBox(sdf::ElementPtr _sdf, physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Drag coefficient\\n\\n protected: double Cd;\\n\\n\\n\\n /// \\\\brief Length of the box\\n\\n protected: double length;\\n\\n\\n\\n /// \\\\brief Width of the box\\n\\n protected: double width;\\n\\n\\n\\n /// \\\\brief Height of the box\\n\\n protected: double height;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif // __UUV_GAZEBO_HYDRO_MODEL_HH__\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 16,\n \"score\": 208175.88941683003\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Length of the cylinder\\n\\n protected: double length;\\n\\n\\n\\n /// \\\\brief Sphere radius\\n\\n protected: double radius;\\n\\n\\n\\n /// \\\\brief Name of the unit rotation axis (just a tag for x, y or z)\\n\\n protected: std::string axis;\\n\\n\\n\\n /// \\\\brief Ratio between length and diameter\\n\\n protected: double dimRatio;\\n\\n\\n\\n /// \\\\brief Approximated drag coefficient for the circular area\\n\\n protected: double cdCirc;\\n\\n\\n\\n /// \\\\brief Approximated drag coefficient for the rectangular section\\n\\n protected: double cdLength;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 17,\n \"score\": 208175.46453211282\n },\n {\n \"content\": \" /// \\\\brief Updates the damping matrix for the current velocity\\n\\n protected: void ComputeDampingMatrix(const Eigen::Vector6d& _vel,\\n\\n Eigen::Matrix6d &_D) const;\\n\\n\\n\\n /// \\\\brief Returns the added-mass matrix with the scaling and offset\\n\\n protected: Eigen::Matrix6d GetAddedMass() const;\\n\\n\\n\\n /// \\\\brief Added-mass matrix\\n\\n protected: Eigen::Matrix6d Ma;\\n\\n\\n\\n /// \\\\brief Scaling of the added-mass matrix\\n\\n protected: double scalingAddedMass;\\n\\n\\n\\n /// \\\\brief Offset for the added-mass matrix\\n\\n protected: double offsetAddedMass;\\n\\n\\n\\n /// \\\\brief Added-mass associated Coriolis matrix\\n\\n protected: Eigen::Matrix6d Ca;\\n\\n\\n\\n /// \\\\brief Damping matrix\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 18,\n \"score\": 208174.56356041788\n },\n {\n \"content\": \" protected: Eigen::Matrix6d D;\\n\\n\\n\\n /// \\\\brief Scaling of the damping matrix\\n\\n protected: double scalingDamping;\\n\\n\\n\\n /// \\\\brief Offset for the linear damping matrix\\n\\n protected: double offsetLinearDamping;\\n\\n\\n\\n /// \\\\brief Offset for the linear damping matrix\\n\\n protected: double offsetLinForwardSpeedDamping;\\n\\n\\n\\n /// \\\\brief Offset for the linear damping matrix\\n\\n protected: double offsetNonLinDamping;\\n\\n\\n\\n /// \\\\brief Linear damping matrix\\n\\n protected: Eigen::Matrix6d DLin;\\n\\n\\n\\n /// \\\\brief Linear damping matrix proportional only to the forward speed\\n\\n /// (useful for modeling AUVs). From [1], according to Newman (1977), there\\n\\n /// is a damping force component that linearly increases with the presence\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 19,\n \"score\": 208174.45599156266\n },\n {\n \"content\": \" /// of forward speed, particularly so for slender bodies.\\n\\n ///\\n\\n /// References:\\n\\n /// [1] Refsnes - 2007 - Nonlinear model-based control of slender body AUVs\\n\\n protected: Eigen::Matrix6d DLinForwardSpeed;\\n\\n\\n\\n /// \\\\brief Nonlinear damping coefficients\\n\\n protected: Eigen::Matrix6d DNonLin;\\n\\n\\n\\n /// \\\\brief Linear damping coefficients\\n\\n protected: std::vector<double> linearDampCoef;\\n\\n\\n\\n /// \\\\brief Quadratic damping coefficients\\n\\n protected: std::vector<double> quadDampCoef;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 20,\n \"score\": 208171.6415204728\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 21,\n \"score\": 208171.06960784958\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalModel.h\",\n \"rank\": 22,\n \"score\": 208171.06960784958\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Sphere radius\\n\\n protected: double radius;\\n\\n\\n\\n /// \\\\brief Drag coefficient\\n\\n protected: double Cd;\\n\\n\\n\\n /// \\\\brief Area of the cross section\\n\\n protected: double areaSection;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 23,\n \"score\": 208168.14362957745\n },\n {\n \"content\": \"\\n\\n/// \\\\file LiftDragModel.hh\\n\\n/// \\\\brief Various Lift&Drag models for Fins.\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_LIFT_DRAG_MODEL_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_LIFT_DRAG_MODEL_HH__\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n\\n\\n#include <sdf/sdf.hh>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Abstract base class for Lift&Drag models.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 24,\n \"score\": 206172.46506608912\n },\n {\n \"content\": \" public: virtual bool GetParam(std::string _tag,\\n\\n double& _output) = 0;\\n\\n\\n\\n /// \\\\brief Return list of all parameters\\n\\n public: virtual std::map<std::string, double> GetListParams() = 0;\\n\\n\\n\\n /// \\\\brief Time of last state update.\\n\\n protected: double prevTime;\\n\\n\\n\\n /// \\\\brief Latest state.\\n\\n protected: double state;\\n\\n};\\n\\n\\n\\n/// \\\\brief Function pointer to create a certain LiftDrag object.\\n\\ntypedef LiftDrag* (*LiftDragCreator)(sdf::ElementPtr);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 25,\n \"score\": 206155.04095646768\n },\n {\n \"content\": \" /// \\\\brief Unique identifier for this dynamical model\\n\\n private: static const std::string IDENTIFIER;\\n\\n\\n\\n /// \\\\brief Lift constant\\n\\n protected: double liftConstant;\\n\\n\\n\\n /// \\\\brief Drag constant\\n\\n protected: double dragConstant;\\n\\n\\n\\n /// \\\\brief Constructor.\\n\\n private: LiftDragQuadratic(double _liftConstant, double _dragConstant)\\n\\n : LiftDrag(), liftConstant(_liftConstant), dragConstant(_dragConstant) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 26,\n \"score\": 206150.76012799895\n },\n {\n \"content\": \" /// \\\\brief Return list of all parameters\\n\\n public: virtual std::map<std::string, double> GetListParams();\\n\\n\\n\\n /// \\\\brief Airfoil area.\\n\\n protected: double area;\\n\\n\\n\\n /// \\\\brief Fluid density.\\n\\n protected: double fluidDensity;\\n\\n\\n\\n /// \\\\brief Original zero angle of attack location.\\n\\n protected: double a0;\\n\\n\\n\\n /// \\\\brief Stall angle.\\n\\n protected: double alphaStall;\\n\\n\\n\\n /// \\\\brief Lift coefficient without stall.\\n\\n protected: double cla;\\n\\n\\n\\n /// \\\\brief Lift coefficient with stall.\\n\\n protected: double claStall;\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 27,\n \"score\": 206150.29875892683\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 28,\n \"score\": 206146.2602845685\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Drag coefficient without stall.\\n\\n protected: double cda;\\n\\n\\n\\n /// \\\\brief Drag coefficient with stall.\\n\\n protected: double cdaStall;\\n\\n\\n\\n /// \\\\brief Constructor.\\n\\n private: LiftDragTwoLines(double _area, double _fluidDensity, double _a0,\\n\\n double _alphaStall, double _cla, double _claStall,\\n\\n double _cda, double _cdaStall)\\n\\n : LiftDrag(), area(_area), fluidDensity(_fluidDensity),\\n\\n a0(_a0), alphaStall(_alphaStall),\\n\\n cla(_cla), claStall(_claStall),\\n\\n cda(_cda), cdaStall(_cdaStall) {}\\n\\n};\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 29,\n \"score\": 206143.33430629637\n },\n {\n \"content\": \"/// \\\\brief Class for the thruster plugin\\n\\nclass ThrusterPlugin : public ModelPlugin\\n\\n{\\n\\n /// \\\\brief Constructor\\n\\n public: ThrusterPlugin();\\n\\n\\n\\n /// \\\\brief Destructor\\n\\n public: virtual ~ThrusterPlugin();\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Load(physics::ModelPtr _model,\\n\\n sdf::ElementPtr _sdf);\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Custom plugin reset behavior.\\n\\n public: virtual void Reset();\\n\\n\\n\\n /// \\\\brief Update the simulation state.\\n\\n /// \\\\param[in] _info Information used in the update event.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 30,\n \"score\": 204340.16545998768\n },\n {\n \"content\": \"class UmbilicalPlugin : public ModelPlugin\\n\\n{\\n\\n /// \\\\brief Destructor.\\n\\n public: UmbilicalPlugin();\\n\\n\\n\\n /// \\\\brief Constructor.\\n\\n public: ~UmbilicalPlugin();\\n\\n\\n\\n /// \\\\brief Load plugin and its configuration from sdf\\n\\n protected: virtual void Load(physics::ModelPtr _model, sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Update callback from simulation.\\n\\n protected: virtual void OnUpdate(const common::UpdateInfo&);\\n\\n\\n\\n /// \\\\brief Reads flow velocity topic\\n\\n protected: void UpdateFlowVelocity(ConstVector3dPtr &_msg);\\n\\n\\n\\n /// \\\\brief Pointer to the update event connection.\\n\\n protected: event::ConnectionPtr updateConnection;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h\",\n \"rank\": 31,\n \"score\": 204335.1378728117\n },\n {\n \"content\": \"class FinPlugin : public ModelPlugin\\n\\n{\\n\\n /// \\\\brief Constructor\\n\\n public: FinPlugin();\\n\\n\\n\\n /// \\\\brief Destructor\\n\\n public: virtual ~FinPlugin();\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Load(physics::ModelPtr _model,\\n\\n sdf::ElementPtr _sdf);\\n\\n\\n\\n // Documentation inherited.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Update the simulation state.\\n\\n /// \\\\param[in] _info Information used in the update event.\\n\\n public: void OnUpdate(const common::UpdateInfo &_info);\\n\\n\\n\\n /// \\\\brief Callback for the input topic subscriber\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h\",\n \"rank\": 32,\n \"score\": 204335.13787281167\n },\n {\n \"content\": \"/// \\\\brief Abstract base class for Lift&Drag models.\\n\\nclass LiftDrag\\n\\n{\\n\\n /// \\\\brief Protected constructor: Use the factory for object creation.\\n\\n protected: LiftDrag() : prevTime(-10.), state(0.) {}\\n\\n\\n\\n /// \\\\brief Check for element. Complain and return 0 if it is missing.\\n\\n public: static bool CheckForElement(sdf::ElementPtr _sdf,\\n\\n const std::string& element);\\n\\n\\n\\n /// \\\\brief Destructor.\\n\\n public: virtual ~LiftDrag() {}\\n\\n\\n\\n /// \\\\brief Return (derived) type of lift&drag model.\\n\\n public: virtual std::string GetType() = 0;\\n\\n\\n\\n /// \\\\brief Compute the lift and drag force.\\n\\n public: virtual ignition::math::Vector3d compute(\\n\\n const ignition::math::Vector3d &_velL) = 0;\\n\\n\\n\\n /// \\\\brief Return paramater in vector form for the given tag\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 33,\n \"score\": 202232.0940684559\n },\n {\n \"content\": \"namespace gazebo\\n\\n{\\n\\n// Pi\\n\\n#define PI 3.14159265359\\n\\n\\n\\n/// \\\\brief Conversion of a string to a double vector\\n\\ninline std::vector<double> Str2Vector(std::string _input)\\n\\n{\\n\\n std::vector<double> output;\\n\\n std::string buf;\\n\\n std::stringstream ss(_input);\\n\\n while (ss >> buf)\\n\\n output.push_back(std::stod(buf));\\n\\n return output;\\n\\n}\\n\\n\\n\\n/// \\\\brief Returns the cross product operator matrix\\n\\n/// for Eigen vectors\\n\\ninline Eigen::Matrix3d CrossProductOperator(Eigen::Vector3d _x)\\n\\n{\\n\\n Eigen::Matrix3d output;\\n\\n output << 0.0, -_x[2], _x[1], _x[2], 0.0, -_x[0], -_x[1], _x[0], 0.0;\\n\\n return output;\\n\\n}\\n\\n\\n\\n/// \\\\brief Returns the cross product operator matrix\\n\\n/// for Gazebo vectors\\n\\ninline Eigen::Matrix3d CrossProductOperator(ignition::math::Vector3d _x)\\n\\n{\\n\\n Eigen::Matrix3d output;\\n\\n output << 0.0, -_x[2], _x[1], _x[2], 0.0, -_x[0], -_x[1], _x[0], 0.0;\\n\\n return output;\\n\\n}\\n\\n\\n\\ninline Eigen::Vector3d ToEigen(const ignition::math::Vector3d &_x)\\n\\n{\\n\\n return Eigen::Vector3d(_x[0], _x[1], _x[2]);\\n\\n}\\n\\n\\n\\ninline Eigen::Matrix3d ToEigen(const ignition::math::Matrix3d &_x)\\n\\n{\\n\\n Eigen::Matrix3d m;\\n\\n m << _x(0, 0), _x(0, 1), _x(0, 2),\\n\\n _x(1, 0), _x(1, 1), _x(1, 2),\\n\\n _x(2, 0), _x(2, 1), _x(2, 2);\\n\\n return m;\\n\\n}\\n\\n\\n\\ninline Eigen::Vector6d EigenStack(const ignition::math::Vector3d &_x,\\n\\n const ignition::math::Vector3d &_y)\\n\\n{\\n\\n Eigen::Vector3d xe = ToEigen(_x);\\n\\n Eigen::Vector3d ye = ToEigen(_y);\\n\\n Eigen::Vector6d out;\\n\\n out << xe, ye;\\n\\n return out;\\n\\n}\\n\\n\\n\\ninline ignition::math::Vector3d Vec3dToGazebo(const Eigen::Vector3d &_x)\\n\\n{\\n\\n return ignition::math::Vector3d(_x[0], _x[1], _x[2]);\\n\\n}\\n\\n\\n\\ninline ignition::math::Matrix3d Mat3dToGazebo(const Eigen::Matrix3d &_x)\\n\\n{\\n\\n return ignition::math::Matrix3d(_x(0, 0), _x(0, 1), _x(0, 2),\\n\\n _x(1, 0), _x(1, 1), _x(1, 2),\\n\\n _x(2, 0), _x(2, 1), _x(2, 2));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Def.h\",\n \"rank\": 34,\n \"score\": 201943.9174409903\n },\n {\n \"content\": \"/// \\\\brief Factory singleton class that creates a LiftDrag from sdf.\\n\\nclass LiftDragFactory\\n\\n{\\n\\n /// \\\\brief Create LiftDrag object according to its sdf Description.\\n\\n public: LiftDrag* CreateLiftDrag(sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Returns the singleton instance of this factory.\\n\\n public: static LiftDragFactory& GetInstance();\\n\\n\\n\\n /// \\\\brief Register a LiftDrag class with its creator.\\n\\n public: bool RegisterCreator(const std::string& _identifier,\\n\\n LiftDragCreator _creator);\\n\\n\\n\\n /// \\\\brief Constructor is private since this is a singleton.\\n\\n private: LiftDragFactory() {}\\n\\n\\n\\n /// \\\\brief Map of each registered identifier to its corresponding creator.\\n\\n private: std::map<std::string, LiftDragCreator> creators_;\\n\\n};\\n\\n\\n\\n/// Use the following macro within a LiftDrag declaration:\\n\\n#define REGISTER_LIFTDRAG(type) static const bool registeredWithFactory\\n\\n\\n\\n/// Use the following macro before a LiftDrag's definition:\\n\\n#define REGISTER_LIFTDRAG_CREATOR(type, creator) \\\\\\n\\n const bool type::registeredWithFactory = \\\\\\n\\n LiftDragFactory::GetInstance().RegisterCreator( \\\\\\n\\n type::IDENTIFIER, creator);\\n\\n\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 35,\n \"score\": 200337.60200787074\n },\n {\n \"content\": \"//////////////////////////////////////////////////////////////////////////////\\n\\n/// \\\\brief Class containing the methods and attributes for a hydrodynamic model\\n\\n/// for a cylinder in the fluid\\n\\nclass HMCylinder : public HMFossen\\n\\n{\\n\\n /// \\\\brief Create model of this type with parameter values from sdf.\\n\\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\\n\\n physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Return (derived) type of hydrodynamic model\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Prints parameters\\n\\n public: virtual void Print(std::string _paramName,\\n\\n std::string _message = std::string());\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n private: REGISTER_HYDRODYNAMICMODEL(HMCylinder);\\n\\n\\n\\n /// \\\\brief Unique identifier for this geometry\\n\\n protected: static const std::string IDENTIFIER;\\n\\n\\n\\n protected: HMCylinder(sdf::ElementPtr _sdf, physics::LinkPtr _link);\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 36,\n \"score\": 198483.24670590056\n },\n {\n \"content\": \"//////////////////////////////////////////////////////////////////////////////\\n\\n/// \\\\brief Class containing the methods and attributes for a hydrodynamic model\\n\\n/// for a sphere in the fluid\\n\\nclass HMSphere : public HMFossen\\n\\n{\\n\\n /// \\\\brief Create model of this type with parameter values from sdf.\\n\\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\\n\\n physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Return (derived) type of hydrodynamic model\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Prints parameters\\n\\n public: virtual void Print(std::string _paramName,\\n\\n std::string _message = std::string());\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n protected: REGISTER_HYDRODYNAMICMODEL(HMSphere);\\n\\n\\n\\n /// \\\\brief Unique identifier for this geometry\\n\\n protected: static const std::string IDENTIFIER;\\n\\n\\n\\n protected: HMSphere(sdf::ElementPtr _sdf, physics::LinkPtr _link);\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 37,\n \"score\": 198483.24670590056\n },\n {\n \"content\": \"//////////////////////////////////////////////////////////////////////////////\\n\\n/// \\\\brief Class containing the methods and attributes for a hydrodynamic model\\n\\n/// for a box in the fluid\\n\\nclass HMBox : public HMFossen\\n\\n{\\n\\n /// \\\\brief Create model of this type with parameter values from sdf.\\n\\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\\n\\n physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Return (derived) type of hydrodynamic model\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Prints parameters\\n\\n public: virtual void Print(std::string _paramName,\\n\\n std::string _message = std::string());\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n private: REGISTER_HYDRODYNAMICMODEL(HMBox);\\n\\n\\n\\n /// \\\\brief Unique identifier for this geometry\\n\\n protected: static const std::string IDENTIFIER;\\n\\n\\n\\n /// \\\\brief Constructor\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 38,\n \"score\": 198483.24670590056\n },\n {\n \"content\": \"//////////////////////////////////////////////////////////////////////////////\\n\\n/// \\\\brief Class containing the methods and attributes for a hydrodynamic model\\n\\n/// for a spheroid in the fluid\\n\\n/// Reference: Antonelli - Underwater Robots\\n\\nclass HMSpheroid : public HMFossen\\n\\n{\\n\\n /// \\\\brief Create model of this type with parameter values from sdf.\\n\\n public: static HydrodynamicModel* create(sdf::ElementPtr _sdf,\\n\\n physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Return (derived) type of hydrodynamic model\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Prints parameters\\n\\n public: virtual void Print(std::string _paramName,\\n\\n std::string _message = std::string());\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n private: REGISTER_HYDRODYNAMICMODEL(HMSpheroid);\\n\\n\\n\\n /// \\\\brief Unique identifier for this geometry\\n\\n protected: static const std::string IDENTIFIER;\\n\\n\\n\\n protected: HMSpheroid(sdf::ElementPtr _sdf, physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Length of the sphroid\\n\\n protected: double length;\\n\\n\\n\\n /// \\\\brief Prolate spheroid's smaller radius\\n\\n protected: double radius;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/HydrodynamicModel.h\",\n \"rank\": 39,\n \"score\": 198483.07418312918\n },\n {\n \"content\": \"/// \\\\brief Basic quadratic (Hugin) lift&drag model, page 18 from [1].\\n\\n/// [1] Engelhardtsen, Øystein. \\\"3D AUV Collision Avoidance.\\\" (2007).\\n\\nclass LiftDragQuadratic : public LiftDrag\\n\\n{\\n\\n /// \\\\brief Create thruster model of this type with parameter values from sdf.\\n\\n public: static LiftDrag* create(sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Return (derived) type of dynamic system.\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Compute the lift and drag force.\\n\\n public: virtual ignition::math::Vector3d compute(const ignition::math::Vector3d &velL);\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n private: REGISTER_LIFTDRAG(LiftDragQuadratic);\\n\\n\\n\\n /// \\\\brief Return paramater in scalar form for the given tag\\n\\n public: virtual bool GetParam(std::string _tag, double& _output);\\n\\n\\n\\n /// \\\\brief Return list of all parameters\\n\\n public: virtual std::map<std::string, double> GetListParams();\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 40,\n \"score\": 194890.10908560507\n },\n {\n \"content\": \"/// \\\\brief Lift&drag model that models lift/drag coeffs using two lines.\\n\\n/// This is based on Gazebo's LiftDragPlugin but implemented as a derived\\n\\n/// LiftDrag model to allow using it in combination with the dynamics of a\\n\\n/// Fin.\\n\\nclass LiftDragTwoLines: public LiftDrag\\n\\n{\\n\\n /// \\\\brief Create thruster model of this type with parameter values from sdf.\\n\\n public: static LiftDrag* create(sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Return (derived) type of dynamic system.\\n\\n public: virtual std::string GetType() { return IDENTIFIER; }\\n\\n\\n\\n /// \\\\brief Compute the lift and drag force.\\n\\n public: virtual ignition::math::Vector3d compute(const ignition::math::Vector3d &_velL);\\n\\n\\n\\n /// \\\\brief Register this model with the factory.\\n\\n private: REGISTER_LIFTDRAG(LiftDragTwoLines);\\n\\n\\n\\n /// \\\\brief Unique identifier for this dynamical model.\\n\\n private: static const std::string IDENTIFIER;\\n\\n\\n\\n /// \\\\brief Return paramater in scalar form for the given tag\\n\\n public: virtual bool GetParam(std::string _tag, double& _output);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/LiftDragModel.h\",\n \"rank\": 41,\n \"score\": 193163.31436877613\n },\n {\n \"content\": \"class CustomBatteryConsumerROSPlugin : public ModelPlugin\\n\\n{\\n\\n /// \\\\brief Constructor\\n\\n public: CustomBatteryConsumerROSPlugin();\\n\\n\\n\\n /// \\\\brief Destructor\\n\\n public: virtual ~CustomBatteryConsumerROSPlugin();\\n\\n\\n\\n /// \\\\brief Load module and read parameters from SDF.\\n\\n public: void Load(physics::ModelPtr _parent, sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Callback for the device state topic subscriber\\n\\n protected: void UpdateDeviceState(const std_msgs::msg::Bool::SharedPtr _msg);\\n\\n\\n\\n /// \\\\brief Update power load\\n\\n protected: void UpdatePowerLoad(double _powerLoad = 0.0);\\n\\n\\n\\n /// \\\\brief Pointer to this ROS node's handle.\\n\\n protected: gazebo_ros::Node::SharedPtr myRosNode;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/CustomBatteryConsumerROSPlugin.h\",\n \"rank\": 42,\n \"score\": 191771.59720822316\n },\n {\n \"content\": \" class FinROSPlugin : public gazebo::FinPlugin\\n\\n {\\n\\n using GetListParam = uuv_gazebo_ros_plugins_msgs::srv::GetListParam;\\n\\n using FloatStamped = uuv_gazebo_ros_plugins_msgs::msg::FloatStamped;\\n\\n\\n\\n /// \\\\brief Constrcutor.\\n\\n public: FinROSPlugin();\\n\\n\\n\\n /// \\\\brief Destructor.\\n\\n public: ~FinROSPlugin();\\n\\n\\n\\n /// \\\\brief Load module and read parameters from SDF.\\n\\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Publish state via ROS.\\n\\n public: void RosPublishStates();\\n\\n\\n\\n /// \\\\brief Set new set point.\\n\\n public: void SetReference(\\n\\n const uuv_gazebo_ros_plugins_msgs::msg::FloatStamped::SharedPtr _msg);\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h\",\n \"rank\": 43,\n \"score\": 186391.3221754486\n },\n {\n \"content\": \" class UnderwaterObjectROSPlugin : public gazebo::UnderwaterObjectPlugin\\n\\n {\\n\\n /// \\\\brief Constructor\\n\\n public: UnderwaterObjectROSPlugin();\\n\\n\\n\\n /// \\\\brief Destructor\\n\\n public: virtual ~UnderwaterObjectROSPlugin();\\n\\n\\n\\n /// \\\\brief Load module and read parameters from SDF.\\n\\n public: void Load(gazebo::physics::ModelPtr _parent, sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Initialize Module.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Reset Module.\\n\\n public: virtual void Reset();\\n\\n\\n\\n /// \\\\brief Update the simulation state.\\n\\n /// \\\\param[in] _info Information used in the update event.\\n\\n public: virtual void Update(const gazebo::common::UpdateInfo &_info);\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/UnderwaterObjectROSPlugin.h\",\n \"rank\": 44,\n \"score\": 183523.4143394485\n },\n {\n \"content\": \" protected: void UpdateInput(ConstDoublePtr &_msg);\\n\\n\\n\\n /// \\\\brief Reads current velocity topic\\n\\n protected: void UpdateCurrentVelocity(ConstVector3dPtr &_msg);\\n\\n\\n\\n /// \\\\brief Helper function that builds and return the plugin's topic prefix\\n\\n protected: std::string BuildTopicPrefix(const std::string& rosNamespace, int id);\\n\\n\\n\\n /// \\\\brief Fin dynamic model\\n\\n protected: std::shared_ptr<Dynamics> dynamics;\\n\\n\\n\\n /// \\\\brief Lift&Drag model\\n\\n protected: std::shared_ptr<LiftDrag> liftdrag;\\n\\n\\n\\n /// \\\\brief Update event\\n\\n protected: event::ConnectionPtr updateConnection;\\n\\n\\n\\n /// \\\\brief Gazebo node\\n\\n protected: transport::NodePtr node;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h\",\n \"rank\": 45,\n \"score\": 164648.13158803846\n },\n {\n \"content\": \"\\n\\n/// \\\\file UmbilicalPlugin.hh\\n\\n/// \\\\brief Model plugin for the umbilical (tether) of an ROV.\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_UMBILICAL_PLUGIN_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_UMBILICAL_PLUGIN_HH__\\n\\n\\n\\n#include <memory>\\n\\n#include <string>\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/common/UpdateInfo.hh>\\n\\n#include <gazebo/common/Plugin.hh>\\n\\n#include <gazebo/physics/World.hh>\\n\\n#include <gazebo/transport/TransportTypes.hh>\\n\\n\\n\\n#include <uuv_gazebo_plugins/UmbilicalModel.h>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h\",\n \"rank\": 46,\n \"score\": 164646.12501589928\n },\n {\n \"content\": \"\\n\\n/// \\\\file FinPlugin.hh\\n\\n/// \\\\brief Model plugin for description of a submarine's fin.\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_FIN_PLUGIN_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_FIN_PLUGIN_HH__\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <sdf/sdf.hh>\\n\\n\\n\\n#include <gazebo/msgs/msgs.hh>\\n\\n#include <uuv_gazebo_plugins/Dynamics.h>\\n\\n#include <uuv_gazebo_plugins/LiftDragModel.h>\\n\\n\\n\\n#include \\\"Double.pb.h\\\"\\n\\n\\n\\nnamespace gazebo {\\n\\n\\n\\n/// \\\\brief Definition of a pointer to the floating point message\\n\\ntypedef const boost::shared_ptr<const uuv_gazebo_plugins_msgs::msgs::Double>\\n\\nConstDoublePtr;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h\",\n \"rank\": 47,\n \"score\": 164644.9124000323\n },\n {\n \"content\": \"\\n\\n/// \\\\file ThrusterPlugin.hh\\n\\n/// \\\\brief Model plugin for description of the thruster dynamics\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_THRUSTER_PLUGIN_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_THRUSTER_PLUGIN_HH__\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n#include <memory>\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/transport/TransportTypes.hh>\\n\\n\\n\\n#include <sdf/sdf.hh>\\n\\n\\n\\n#include <uuv_gazebo_plugins/ThrusterConversionFcn.h>\\n\\n#include <uuv_gazebo_plugins/Dynamics.h>\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 48,\n \"score\": 164641.5549979386\n },\n {\n \"content\": \" /// \\\\brief Pointer to the model structure\\n\\n protected: gazebo::physics::ModelPtr model;\\n\\n\\n\\n /// \\\\brief Pointer to the world plugin\\n\\n protected: gazebo::physics::WorldPtr world;\\n\\n\\n\\n /// \\\\brief Gazebo node\\n\\n protected: gazebo::transport::NodePtr node;\\n\\n\\n\\n /// \\\\brief Subcriber to flow message\\n\\n protected: gazebo::transport::SubscriberPtr flowSubscriber;\\n\\n\\n\\n /// \\\\brief Flow velocity vector read from topic\\n\\n protected: ignition::math::Vector3d flowVelocity;\\n\\n\\n\\n /// \\\\brief Pointer to UmbilicalModel used in this plugin.\\n\\n protected: std::shared_ptr<UmbilicalModel> umbilical;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h\",\n \"rank\": 49,\n \"score\": 164641.04727561132\n },\n {\n \"content\": \" public: void Update(const common::UpdateInfo &_info);\\n\\n\\n\\n /// \\\\brief Callback for the input topic subscriber\\n\\n protected: void UpdateInput(ConstDoublePtr &_msg);\\n\\n\\n\\n /// \\\\brief Builds the topic prefix name\\n\\n protected: std::string BuildTopicPrefix(const std::string& pluginNamespace, int id);\\n\\n\\n\\n /// \\\\brief Thruster dynamic model\\n\\n protected: std::shared_ptr<Dynamics> thrusterDynamics;\\n\\n\\n\\n /// \\\\brief Thruster conversion function\\n\\n protected: std::shared_ptr<ConversionFunction> conversionFunction;\\n\\n\\n\\n /// \\\\brief Update event\\n\\n protected: event::ConnectionPtr updateConnection;\\n\\n\\n\\n /// \\\\brief Pointer to the thruster link\\n\\n protected: physics::LinkPtr thrusterLink;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 50,\n \"score\": 164640.88450023532\n },\n {\n \"content\": \"\\n\\n#include \\\"Double.pb.h\\\"\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Definition of a pointer to the floating point message\\n\\ntypedef const boost::shared_ptr<const uuv_gazebo_plugins_msgs::msgs::Double>\\n\\nConstDoublePtr;\\n\\n\\n\\n/// \\\\brief Class for the thruster plugin\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 51,\n \"score\": 164639.7574392675\n },\n {\n \"content\": \" /// \\\\brief Gazebo node\\n\\n protected: transport::NodePtr node;\\n\\n\\n\\n /// \\\\brief Subscriber to the reference signal topic.\\n\\n protected: transport::SubscriberPtr commandSubscriber;\\n\\n\\n\\n /// \\\\brief Publisher to the output thrust topic\\n\\n protected: transport::PublisherPtr thrustTopicPublisher;\\n\\n\\n\\n /// \\\\brief Input command, typically desired angular velocity of the\\n\\n /// rotor.\\n\\n protected: double inputCommand;\\n\\n\\n\\n /// \\\\brief Latest thrust force in [N]\\n\\n protected: double thrustForce;\\n\\n\\n\\n /// \\\\brief Time stamp of latest thrust force\\n\\n protected: common::Time thrustForceStamp;\\n\\n\\n\\n /// \\\\brief Optional: The rotor joint, used for visualization\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 52,\n \"score\": 164636.8162397408\n },\n {\n \"content\": \" protected: physics::JointPtr joint;\\n\\n\\n\\n /// \\\\brief: Optional: Commands less than this value will be clamped.\\n\\n protected: double clampMin;\\n\\n\\n\\n /// \\\\brief: Optional: Commands greater than this value will be clamped.\\n\\n protected: double clampMax;\\n\\n\\n\\n /// \\\\brief: Optional: Minimum thrust force output\\n\\n protected: double thrustMin;\\n\\n\\n\\n /// \\\\brief: Optional: Maximum thrust force output\\n\\n protected: double thrustMax;\\n\\n\\n\\n /// \\\\brief Thruster ID, used to generated topic names automatically\\n\\n protected: int thrusterID;\\n\\n\\n\\n /// \\\\brief Thruster topics prefix\\n\\n protected: std::string myTopicPrefix;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 53,\n \"score\": 164631.3632123606\n },\n {\n \"content\": \" /// \\\\brief: Optional: Gain factor: Desired angular velocity = command * gain\\n\\n protected: double gain;\\n\\n\\n\\n /// \\\\brief Optional: Flag to indicate if the thruster is turned on or off\\n\\n protected: bool isOn;\\n\\n\\n\\n /// \\\\brief Optional: Output thrust efficiency factor of the thruster\\n\\n protected: double thrustEfficiency;\\n\\n\\n\\n /// \\\\brief Optional: Propeller angular velocity efficiency term\\n\\n protected: double propellerEfficiency;\\n\\n\\n\\n /// \\\\brief The axis about which the thruster rotates\\n\\n protected: ignition::math::Vector3d thrusterAxis;\\n\\n};\\n\\n}\\n\\n#endif // __UUV_GAZEBO_PLUGINS_THRUSTER_PLUGIN_HH__\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 54,\n \"score\": 164628.4042333008\n },\n {\n \"content\": \" /// \\\\brief The fin joint\\n\\n protected: physics::JointPtr joint;\\n\\n\\n\\n /// \\\\brief The fin link\\n\\n protected: physics::LinkPtr link;\\n\\n\\n\\n /// \\\\brief Subscriber to the reference signal topic.\\n\\n protected: transport::SubscriberPtr commandSubscriber;\\n\\n\\n\\n /// \\\\brief Publisher to the output thrust topic\\n\\n protected: transport::PublisherPtr anglePublisher;\\n\\n\\n\\n /// \\\\brief Force component calculated from the lift and drag module\\n\\n protected: ignition::math::Vector3d finForce;\\n\\n\\n\\n /// \\\\brief Latest input command.\\n\\n protected: double inputCommand;\\n\\n\\n\\n /// \\\\brief Fin ID\\n\\n protected: int finID;\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h\",\n \"rank\": 55,\n \"score\": 164622.2128653757\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Topic prefix\\n\\n protected: std::string myTopicPrefix;\\n\\n\\n\\n /// \\\\brief Latest fin angle in [rad].\\n\\n protected: double angle;\\n\\n\\n\\n /// \\\\brief Time stamp of latest thrust force\\n\\n protected: common::Time angleStamp;\\n\\n\\n\\n /// \\\\brief Subcriber to current message\\n\\n protected: transport::SubscriberPtr currentSubscriber;\\n\\n\\n\\n /// \\\\brief Current velocity vector read from topic\\n\\n protected: ignition::math::Vector3d currentVelocity;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h\",\n \"rank\": 56,\n \"score\": 164620.6327574573\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/FinPlugin.h\",\n \"rank\": 57,\n \"score\": 164619.85566904393\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h\",\n \"rank\": 58,\n \"score\": 164619.85566904393\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterPlugin.h\",\n \"rank\": 59,\n \"score\": 164619.85566904393\n },\n {\n \"content\": \"\\n\\n/// \\\\file Dynamics.hh\\n\\n/// \\\\brief 1D dynamic models\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_THRUSTER_DYNAMICS_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_THRUSTER_DYNAMICS_HH__\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n\\n\\n#include <sdf/sdf.hh>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Abstract base class for thruster dynamics.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h\",\n \"rank\": 60,\n \"score\": 163581.07510939677\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Motor-shaft-propeller inertia.\\n\\n private: double Jmsp;\\n\\n\\n\\n /// \\\\brief Empirically-determined model parameter.\\n\\n private: double Kv1;\\n\\n\\n\\n /// \\\\brief Empirically-determined model parameter.\\n\\n private: double Kv2;\\n\\n\\n\\n /// \\\\brief Motor torque constant.\\n\\n private: double Kt;\\n\\n\\n\\n /// \\\\brief Winding resistance.\\n\\n private: double Rm;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h\",\n \"rank\": 61,\n \"score\": 163558.5322860184\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h\",\n \"rank\": 62,\n \"score\": 163556.42558817993\n },\n {\n \"content\": \"\\n\\n/// \\\\file UnderwaterObjectPlugin.hh\\n\\n/// \\\\brief Class declaration for the underwater objects subject to buoyancy,\\n\\n/// lift and drag forces.\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_UNDERWATER_OBJECT_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_UNDERWATER_OBJECT_HH__\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/msgs/msgs.hh>\\n\\n\\n\\n#include <uuv_gazebo_plugins/HydrodynamicModel.h>\\n\\n#include <uuv_gazebo_plugins/Def.h>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Gazebo model plugin class for underwater objects\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 63,\n \"score\": 163334.21256632352\n },\n {\n \"content\": \" HydrodynamicModelPtr> models;\\n\\n\\n\\n /// \\\\brief Flow velocity vector read from topic\\n\\n protected: ignition::math::Vector3d flowVelocity;\\n\\n\\n\\n /// \\\\brief Update event\\n\\n protected: gazebo::event::ConnectionPtr updateConnection;\\n\\n\\n\\n /// \\\\brief Pointer to the world plugin\\n\\n protected: gazebo::physics::WorldPtr world;\\n\\n\\n\\n /// \\\\brief Pointer to the model structure\\n\\n protected: gazebo::physics::ModelPtr model;\\n\\n\\n\\n /// \\\\brief Gazebo node\\n\\n protected: gazebo::transport::NodePtr node;\\n\\n\\n\\n /// \\\\brief Name of vehicle's base_link\\n\\n protected: std::string baseLinkName;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 64,\n \"score\": 163332.66728183758\n },\n {\n \"content\": \" protected: virtual void PublishHydrodynamicWrenches(\\n\\n gazebo::physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Returns the wrench message for debugging topics\\n\\n /// \\\\param[in] _force Force vector\\n\\n /// \\\\param[in] _torque Torque vector\\n\\n /// \\\\param[in] _output Stamped wrench message to be updated\\n\\n protected: virtual void GenWrenchMsg(\\n\\n ignition::math::Vector3d _force, ignition::math::Vector3d _torque,\\n\\n gazebo::msgs::WrenchStamped &_output);\\n\\n\\n\\n /// \\\\brief Sets the topics used for publishing the intermediate data during\\n\\n /// the simulation\\n\\n /// \\\\param[in] _link Pointer to the link\\n\\n /// \\\\param[in] _hydro Pointer to the hydrodynamic model\\n\\n protected: virtual void InitDebug(gazebo::physics::LinkPtr _link,\\n\\n gazebo::HydrodynamicModelPtr _hydro);\\n\\n\\n\\n /// \\\\brief Pairs of links & corresponding hydrodynamic models\\n\\n protected: std::map<gazebo::physics::LinkPtr,\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 65,\n \"score\": 163325.24000489627\n },\n {\n \"content\": \" /// \\\\brief Subcriber to flow message\\n\\n protected: gazebo::transport::SubscriberPtr flowSubscriber;\\n\\n\\n\\n /// \\\\brief Flag to use the global current velocity or the individually\\n\\n /// assigned current velocity\\n\\n protected: bool useGlobalCurrent;\\n\\n\\n\\n /// \\\\brief Publishers of hydrodynamic and hydrostatic forces and torques in\\n\\n /// the case the debug flag is on\\n\\n protected: std::map<std::string, gazebo::transport::PublisherPtr> hydroPub;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif // __UUV_GAZEBO_PLUGINS_UNDERWATER_OBJECT_HH__\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 66,\n \"score\": 163322.20276152485\n },\n {\n \"content\": \" protected: virtual void Connect();\\n\\n\\n\\n /// \\\\brief Reads flow velocity topic\\n\\n protected: void UpdateFlowVelocity(ConstVector3dPtr &_msg);\\n\\n\\n\\n /// \\\\brief Publish current velocity marker\\n\\n protected: virtual void PublishCurrentVelocityMarker();\\n\\n\\n\\n /// \\\\brief Publishes the state of the vehicle (is submerged)\\n\\n protected: virtual void PublishIsSubmerged();\\n\\n\\n\\n /// \\\\brief Publish restoring force\\n\\n /// \\\\param[in] _link Pointer to the link where the force information will\\n\\n /// be extracted from\\n\\n protected: virtual void PublishRestoringForce(\\n\\n gazebo::physics::LinkPtr _link);\\n\\n\\n\\n /// \\\\brief Publish hydrodynamic wrenches\\n\\n /// \\\\param[in] _link Pointer to the link where the force information will\\n\\n /// be extracted from\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 67,\n \"score\": 163317.10127482205\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UnderwaterObjectPlugin.h\",\n \"rank\": 68,\n \"score\": 163308.21535441114\n },\n {\n \"content\": \" class UnderwaterCurrentROSPlugin : public gazebo::UnderwaterCurrentPlugin\\n\\n {\\n\\n /// \\\\brief Class constructor\\n\\n public: UnderwaterCurrentROSPlugin();\\n\\n\\n\\n /// \\\\brief Class destructor\\n\\n public: virtual ~UnderwaterCurrentROSPlugin();\\n\\n\\n\\n /// \\\\brief Load module and read parameters from SDF.\\n\\n public: void Load(gazebo::physics::WorldPtr _world,\\n\\n sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Service call to update the parameters for the velocity\\n\\n /// Gauss-Markov process model\\n\\n public: void UpdateCurrentVelocityModel(\\n\\n const uuv_world_ros_plugins_msgs::srv::SetCurrentModel::Request::SharedPtr _req,\\n\\n uuv_world_ros_plugins_msgs::srv::SetCurrentModel::Response::SharedPtr _res);\\n\\n\\n\\n /// \\\\brief Service call to update the parameters for the horizontal angle\\n\\n /// Gauss-Markov process model\\n\",\n \"file_path\": \"uuv_world_plugins/uuv_world_ros_plugins/include/uuv_world_ros_plugins/UnderwaterCurrentROSPlugin.h\",\n \"rank\": 69,\n \"score\": 163010.5229603382\n },\n {\n \"content\": \"\\n\\n/// \\\\file BuoyantObject.hh\\n\\n/// \\\\brief Description of a buoyant object\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_BUOYANT_OBJECT_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_BUOYANT_OBJECT_HH__\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/physics/Link.hh>\\n\\n#include <gazebo/physics/Collision.hh>\\n\\n#include <gazebo/physics/Shape.hh>\\n\\n\\n\\n#define RESTORING_FORCE \\\"restoring_force\\\"\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Class describing the dynamics of a buoyant object, useful for simple\\n\\n/// representations of underwater structures\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 70,\n \"score\": 162174.37894061618\n },\n {\n \"content\": \" /// \\\\brief Sets bounding box\\n\\n public: void SetBoundingBox(const ignition::math::Box &_bBox);\\n\\n\\n\\n /// \\\\brief Adds a field in the hydroWrench map\\n\\n public: void SetStoreVector(std::string _tag);\\n\\n\\n\\n /// \\\\brief Get vector from the hydroWrench map\\n\\n public: ignition::math::Vector3d GetStoredVector(std::string _tag);\\n\\n\\n\\n /// \\\\brief Set debug flag to store intermediate forces and torques\\n\\n public: void SetDebugFlag(bool _debugOn = true);\\n\\n\\n\\n /// \\\\brief Returns true if the robot is completely submerged\\n\\n public: bool IsSubmerged();\\n\\n\\n\\n /// \\\\brief Returns true if the link was set to be neutrally buoyant\\n\\n public: bool IsNeutrallyBuoyant();\\n\\n\\n\\n /// \\\\brief Returns the debug flag\\n\\n public: bool GetDebugFlag();\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 71,\n \"score\": 162161.81243149246\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Sets this link as neutrally buoyant\\n\\n public: void SetNeutrallyBuoyant();\\n\\n\\n\\n /// \\\\brief Store vector in the hydroWrench map if the field has been created\\n\\n protected: void StoreVector(std::string _tag, ignition::math::Vector3d _vec);\\n\\n\\n\\n /// \\\\brief Volume of fluid displaced by the submerged object\\n\\n protected: double volume;\\n\\n\\n\\n /// \\\\brief Scaling factor for the volume\\n\\n protected: double scalingVolume;\\n\\n\\n\\n /// \\\\brief Offset for the volume\\n\\n protected: double offsetVolume;\\n\\n\\n\\n /// \\\\brief Fluid density\\n\\n protected: double fluidDensity;\\n\\n\\n\\n /// \\\\brief Acceleration of gravity\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 72,\n \"score\": 162159.58987276116\n },\n {\n \"content\": \" public: double GetVolume();\\n\\n\\n\\n /// \\\\brief Sets the fluid density in kg/m^3\\n\\n public: void SetFluidDensity(double _fluidDensity);\\n\\n\\n\\n /// \\\\brief Returns the stored fluid density\\n\\n public: double GetFluidDensity();\\n\\n\\n\\n /// \\\\brief Sets the position of the center of buoyancy on the body frame\\n\\n public: void SetCoB(const ignition::math::Vector3d &_centerOfBuoyancy);\\n\\n\\n\\n /// \\\\brief Returns the stored center of buoyancy\\n\\n public: ignition::math::Vector3d GetCoB();\\n\\n\\n\\n /// \\\\brief Set acceleration of gravity\\n\\n public: void SetGravity(double _g);\\n\\n\\n\\n /// \\\\brief Get stored acceleration of gravity\\n\\n public: double GetGravity();\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 73,\n \"score\": 162157.51202924954\n },\n {\n \"content\": \" protected: physics::LinkPtr link;\\n\\n\\n\\n /// \\\\brief If true, the restoring force will be equal to the gravitational\\n\\n // force\\n\\n protected: bool neutrallyBuoyant;\\n\\n\\n\\n // \\\\brief Metacentric width of the robot, used only for surface vessels and\\n\\n // floating objects\\n\\n protected: double metacentricWidth;\\n\\n\\n\\n /// \\\\brief Metacentric length of the robot, used only for surface vessels and\\n\\n /// floating objects\\n\\n protected: double metacentricLength;\\n\\n\\n\\n /// \\\\brief If the cross section area around water level of the surface vessel\\n\\n /// is not given, it will be computed from the object's bounding box\\n\\n protected: double waterLevelPlaneArea;\\n\\n\\n\\n /// \\\\brief Height of the robot that is submerged (only for surface vessels)\\n\\n protected: double submergedHeight;\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 74,\n \"score\": 162152.58736305241\n },\n {\n \"content\": \" protected: double g;\\n\\n\\n\\n /// \\\\brief Center of buoyancy in the body frame\\n\\n protected: ignition::math::Vector3d centerOfBuoyancy;\\n\\n\\n\\n /// \\\\brief TEMP for calculation of the buoyancy\\n\\n /// force close to the surface\\n\\n protected: ignition::math::Box boundingBox;\\n\\n\\n\\n /// \\\\brief Storage for hydrodynamic and hydrostatic forces and torques\\n\\n /// for debugging purposes\\n\\n protected: std::map<std::string, ignition::math::Vector3d> hydroWrench;\\n\\n\\n\\n /// \\\\brief Debug flag, storing all intermediate forces and torques\\n\\n protected: bool debugFlag;\\n\\n\\n\\n /// \\\\brief Is submerged flag\\n\\n protected: bool isSubmerged;\\n\\n\\n\\n /// \\\\brief Pointer to the correspondent robot link\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 75,\n \"score\": 162151.5074362226\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 76,\n \"score\": 162151.12649086784\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Flag set to true if the information about the metacentric width and\\n\\n /// height is available\\n\\n protected: bool isSurfaceVessel;\\n\\n\\n\\n /// \\\\brief Flag set to true if the vessel has reached its submerged height\\n\\n protected: bool isSurfaceVesselFloating;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/BuoyantObject.h\",\n \"rank\": 77,\n \"score\": 162148.2005125957\n },\n {\n \"content\": \"/// \\\\brief Abstract base class for thruster dynamics.\\n\\nclass Dynamics\\n\\n{\\n\\n /// \\\\brief Protected constructor: Use the factory for object creation.\\n\\n protected: Dynamics() { Reset(); }\\n\\n\\n\\n /// \\\\brief Destructor.\\n\\n public: virtual ~Dynamics() {}\\n\\n\\n\\n /// \\\\brief Return (derived) type of thruster dynamics.\\n\\n public: virtual std::string GetType() = 0;\\n\\n\\n\\n /// \\\\brief Update the dynamic model.\\n\\n /// \\\\param[in] _cmd The commanded value.\\n\\n /// \\\\param[in] _t Time stamp of command.\\n\\n public: virtual double update(double _cmd, double _t) = 0;\\n\\n\\n\\n // \\\\brief Reset state.\\n\\n public: virtual void Reset();\\n\\n\\n\\n /// \\\\brief Time of last state update.\\n\\n protected: double prevTime;\\n\\n\\n\\n /// \\\\brief Latest state.\\n\\n protected: double state;\\n\\n};\\n\\n\\n\\n/// \\\\brief Function pointer to create a certain thruster dynamics object.\\n\\ntypedef Dynamics* (*DynamicsCreator)(sdf::ElementPtr);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h\",\n \"rank\": 78,\n \"score\": 162148.2005125957\n },\n {\n \"content\": \"class UmbilicalSegment\\n\\n{\\n\\n public:\\n\\n UmbilicalSegment() { initSdfSegment(); }\\n\\n\\n\\n UmbilicalSegment(const std::string& _name,\\n\\n const std::string& _fromLink,\\n\\n const ignition::math::Pose3d& _fromPose,\\n\\n const ignition::math::Pose3d& _toPose,\\n\\n physics::ModelPtr _model);\\n\\n\\n\\n void initSdfSegment();\\n\\n\\n\\n physics::LinkPtr link;\\n\\n physics::LinkPtr linkA;\\n\\n physics::JointPtr jointA;\\n\\n physics::JointPtr jointB;\\n\\n\\n\\n std::shared_ptr<UmbilicalSegment> prev, next;\\n\\n\\n\\n static sdf::SDFPtr sdfSegment;\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/UmbilicalPlugin.h\",\n \"rank\": 79,\n \"score\": 162019.10142476164\n },\n {\n \"content\": \"\\n\\n/// \\\\file ThrusterConversionFcn.hh\\n\\n/// \\\\brief Description of the conversion function fo a thruster.\\n\\n\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_CONVERSION_FUNCTION_HH__\\n\\n#define __UUV_GAZEBO_PLUGINS_CONVERSION_FUNCTION_HH__\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#include <sdf/sdf.hh>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Abstact base class for a thruster conversion function.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h\",\n \"rank\": 80,\n \"score\": 160794.151169951\n },\n {\n \"content\": \"\\n\\n#ifndef __UUV_GAZEBO_PLUGINS_ACCELERATIONS_TEST_PLUGIN_H__\\n\\n#define __UUV_GAZEBO_PLUGINS_ACCELERATIONS_TEST_PLUGIN_H__\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n\\n\\n#include <gazebo/gazebo.hh>\\n\\n#include <gazebo/msgs/msgs.hh>\\n\\n\\n\\n#include <gazebo_ros/node.hpp>\\n\\n\\n\\n#include <uuv_gazebo_plugins/HydrodynamicModel.h>\\n\\n#include <uuv_gazebo_plugins/Def.h>\\n\\n\\n\\n#include <rclcpp/rclcpp.hpp>\\n\\n#include <geometry_msgs/msg/accel.hpp>\\n\\n\\n\\n#include <memory>\\n\\n\\n\\nnamespace gazebo\\n\\n{\\n\\n/// \\\\brief Gazebo model plugin class for underwater objects\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h\",\n \"rank\": 81,\n \"score\": 160789.84524700046\n },\n {\n \"content\": \"\\n\\n#ifndef __THRUSTER_ROS_PLUGIN_HH__\\n\\n#define __THRUSTER_ROS_PLUGIN_HH__\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#include <rclcpp/rclcpp.hpp>\\n\\n#include <geometry_msgs/msg/wrench_stamped.hpp>\\n\\n#include <std_msgs/msg/bool.hpp>\\n\\n#include <std_msgs/msg/float64.hpp>\\n\\n\\n\\n#include <gazebo/common/Plugin.hh>\\n\\n\\n\\n#include <gazebo_ros/node.hpp>\\n\\n\\n\\n#include <uuv_gazebo_plugins/ThrusterPlugin.h>\\n\\n\\n\\n#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/srv/set_thruster_state.hpp>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_thruster_state.hpp>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/srv/set_thruster_efficiency.hpp>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_thruster_efficiency.hpp>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_thruster_conversion_fcn.hpp>\\n\\n\\n\\nnamespace uuv_simulator_ros\\n\\n{\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 82,\n \"score\": 160782.20935490236\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Return the list of paramaters of the lift and drag model\\n\\n public: void GetLiftDragParams(\\n\\n const GetListParam::Request::SharedPtr _req,\\n\\n GetListParam::Response::SharedPtr _res); \\n\\n\\n\\n /// \\\\brief Return the ROS publish period.\\n\\n public: gazebo::common::Time GetRosPublishPeriod();\\n\\n\\n\\n /// \\\\brief Set the ROS publish frequency (Hz).\\n\\n public: void SetRosPublishRate(double _hz);\\n\\n\\n\\n /// \\\\brief Initialize Module.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Reset Module.\\n\\n public: virtual void Reset();\\n\\n\\n\\n /// \\\\brief Pointer to this ROS node's handle.\\n\\n protected: gazebo_ros::Node::SharedPtr myRosNode;\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h\",\n \"rank\": 83,\n \"score\": 160782.03553159724\n },\n {\n \"content\": \"\\n\\n#ifndef __FIN_ROS_PLUGIN_HH__\\n\\n#define __FIN_ROS_PLUGIN_HH__\\n\\n\\n\\n#include <uuv_gazebo_plugins/FinPlugin.h>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>\\n\\n#include <uuv_gazebo_ros_plugins_msgs/srv/get_list_param.hpp>\\n\\n\\n\\n#include <gazebo/common/Plugin.hh>\\n\\n\\n\\n#include <gazebo_ros/node.hpp>\\n\\n\\n\\n#include <rclcpp/rclcpp.hpp>\\n\\n#include <geometry_msgs/msg/wrench_stamped.hpp>\\n\\n\\n\\n#include <map>\\n\\n#include <memory>\\n\\n\\n\\nnamespace uuv_simulator_ros\\n\\n{\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h\",\n \"rank\": 84,\n \"score\": 160781.48628431265\n },\n {\n \"content\": \" protected: virtual void Connect();\\n\\n\\n\\n /// \\\\brief Update event\\n\\n protected: gazebo::event::ConnectionPtr updateConnection;\\n\\n\\n\\n /// \\\\brief Pointer to the world plugin\\n\\n protected: gazebo::physics::WorldPtr world;\\n\\n\\n\\n /// \\\\brief Pointer to the model structure\\n\\n protected: gazebo::physics::ModelPtr model;\\n\\n\\n\\n /// \\\\brief Gazebo node\\n\\n protected: gazebo::transport::NodePtr node;\\n\\n\\n\\n /// \\\\brief Link of test object\\n\\n protected: physics::LinkPtr link;\\n\\n\\n\\n // ROS things\\n\\n private: gazebo_ros::Node::SharedPtr myRosNode;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h\",\n \"rank\": 85,\n \"score\": 160781.07319393876\n },\n {\n \"content\": \" /// \\\\brief Get thruster conversion function parameters\\n\\n public: void GetThrusterConversionFcn(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn::Response::SharedPtr _res);\\n\\n\\n\\n /// \\\\brief Map of thruster services\\n\\n //TODO Replace with map<string, ServiceBase::SharedPtr>\\n\\n //private: std::map<std::string, rclcpp::Service:: ::ServiceServer> services;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>::SharedPtr mySet_thrust_force_efficiencySrv;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>::SharedPtr myGet_thrust_force_efficiencySrv;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency>::SharedPtr mySet_dynamic_state_efficiencySrv;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency>::SharedPtr myGet_dynamic_state_efficiency;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState>::SharedPtr mySet_thruster_state;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState>::SharedPtr myGet_thruster_state;\\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetThrusterConversionFcn>::SharedPtr myGet_thruster_conversion_fcn;\\n\\n\\n\\n /// \\\\brief Pointer to this ROS node's handle.\\n\\n protected: gazebo_ros::Node::SharedPtr myRosNode;\\n\\n\\n\\n /// \\\\brief Subscriber reacting to new reference thrust set points.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 86,\n \"score\": 160775.9493560737\n },\n {\n \"content\": \"/// \\\\brief Factory singleton class that creates a ThrusterDynamics from sdf.\\n\\nclass DynamicsFactory\\n\\n{\\n\\n /// \\\\brief Create ThrusterDynamics object according to its sdf Description.\\n\\n public: Dynamics* CreateDynamics(sdf::ElementPtr _sdf);\\n\\n\\n\\n /// \\\\brief Returns the singleton instance of this factory.\\n\\n public: static DynamicsFactory& GetInstance();\\n\\n\\n\\n /// \\\\brief Register a ThrusterDynamic class with its creator.\\n\\n public: bool RegisterCreator(const std::string& _identifier,\\n\\n DynamicsCreator _creator);\\n\\n\\n\\n /// \\\\brief Constructor is private since this is a singleton.\\n\\n private: DynamicsFactory() {}\\n\\n\\n\\n /// \\\\brief Map of each registered identifier to its corresponding creator.\\n\\n private: std::map<std::string, DynamicsCreator> creators_;\\n\\n};\\n\\n\\n\\n/// Use the following macro within a ThrusterDynamics declaration:\\n\\n#define REGISTER_DYNAMICS(type) static const bool registeredWithFactory\\n\\n\\n\\n/// Use the following macro before a ThrusterDynamics's definition:\\n\\n#define REGISTER_DYNAMICS_CREATOR(type, creator) \\\\\\n\\n const bool type::registeredWithFactory = \\\\\\n\\n DynamicsFactory::GetInstance().RegisterCreator( \\\\\\n\\n type::IDENTIFIER, creator);\\n\\n\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/Dynamics.h\",\n \"rank\": 87,\n \"score\": 160775.89838966803\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Set the ROS publish frequency (Hz).\\n\\n public: void SetRosPublishRate(double _hz);\\n\\n\\n\\n /// \\\\brief Initialize Module.\\n\\n public: virtual void Init();\\n\\n\\n\\n /// \\\\brief Reset Module.\\n\\n public: virtual void Reset();\\n\\n\\n\\n /// \\\\brief Set the thrust efficiency factor\\n\\n public: void SetThrustForceEfficiency(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res);\\n\\n\\n\\n /// \\\\brief Get the thrust efficiency factor\\n\\n public: void GetThrustForceEfficiency(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 88,\n \"score\": 160775.24453336725\n },\n {\n \"content\": \" /// \\\\brief The unique identifier of this conversion function.\\n\\n private: static const std::string IDENTIFIER;\\n\\n\\n\\n /// \\\\brief Constructor.\\n\\n private: ConversionFunctionLinearInterp(const std::vector<double> &_input,\\n\\n const std::vector<double> &_output);\\n\\n\\n\\n /// \\\\brief Lookup table maps input values -> output values.\\n\\n private: std::map<double, double> lookupTable;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h\",\n \"rank\": 89,\n \"score\": 160774.7862438726\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h\",\n \"rank\": 90,\n \"score\": 160773.84567984412\n },\n {\n \"content\": \" /// \\\\brief Set the dynamic state efficiency factor\\n\\n public: void SetDynamicStateEfficiency(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterEfficiency::Response::SharedPtr _res);\\n\\n\\n\\n /// \\\\brief Get the dynamic state efficiency factor\\n\\n public: void GetDynamicStateEfficiency(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterEfficiency::Response::SharedPtr _res);\\n\\n\\n\\n /// \\\\brief Turn thruster on/off\\n\\n public: void SetThrusterState(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::SetThrusterState::Response::SharedPtr _res);\\n\\n\\n\\n /// \\\\brief Get thruster state\\n\\n public: void GetThrusterState(\\n\\n const uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Request::SharedPtr _req,\\n\\n uuv_gazebo_ros_plugins_msgs::srv::GetThrusterState::Response::SharedPtr _res);\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 91,\n \"score\": 160772.70784540157\n },\n {\n \"content\": \" /// \\\\brief Constructor.\\n\\n private: ConversionFunctionBessa(double _rotorConstantL,\\n\\n double _rotorConstantR,\\n\\n double _deltaL, double _deltaR);\\n\\n\\n\\n /// \\\\brief Rotor constant for omega < 0.\\n\\n private: double rotorConstantL;\\n\\n\\n\\n /// \\\\brief Rotor constant for omega > 0.\\n\\n private: double rotorConstantR;\\n\\n\\n\\n /// \\\\brief Dead-zone for omega < 0.\\n\\n private: double deltaL;\\n\\n\\n\\n /// \\\\brief Dead-zone for omega > 0.\\n\\n private: double deltaR;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_plugins/include/uuv_gazebo_plugins/ThrusterConversionFcn.h\",\n \"rank\": 92,\n \"score\": 160770.91970157198\n },\n {\n \"content\": \"\\n\\n /// \\\\brief Subscriber reacting to new reference set points.\\n\\n private: rclcpp::Subscription<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr mySubReference;\\n\\n\\n\\n /// \\\\brief Publisher for current state.\\n\\n private: rclcpp::Publisher<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr myPubState;\\n\\n\\n\\n /// \\\\brief Publisher for current actual thrust.\\n\\n private: rclcpp::Publisher<geometry_msgs::msg::WrenchStamped>::SharedPtr myPubFinForce;\\n\\n\\n\\n /// \\\\brief Connection for callbacks on update world.\\n\\n private: gazebo::event::ConnectionPtr rosPublishConnection;\\n\\n\\n\\n /// \\\\brief Period after which we should publish a message via ROS.\\n\\n private: gazebo::common::Time rosPublishPeriod;\\n\\n\\n\\n /// \\\\brief Map of services\\n\\n private: std::map<std::string, \\n\\n rclcpp::Service<uuv_gazebo_ros_plugins_msgs::srv::GetListParam>::SharedPtr> myServicesById;\\n\\n\\n\\n /// \\\\brief Last time we published a message via ROS.\\n\\n private: gazebo::common::Time lastRosPublishTime;\\n\\n };\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h\",\n \"rank\": 93,\n \"score\": 160769.37926608554\n },\n {\n \"content\": \" /// \\\\brief Period after which we should publish a message via ROS.\\n\\n private: gazebo::common::Time rosPublishPeriod;\\n\\n\\n\\n /// \\\\brief Last time we published a message via ROS.\\n\\n private: gazebo::common::Time lastRosPublishTime;\\n\\n };\\n\\n}\\n\\n\\n\\n#endif // __THRUSTER_ROS_PLUGIN_HH__\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 94,\n \"score\": 160766.55286658258\n },\n {\n \"content\": \" protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_b_gazebo;\\n\\n protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_b_numeric;\\n\\n\\n\\n protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_w_gazebo;\\n\\n protected: rclcpp::Publisher<geometry_msgs::msg::Accel>::SharedPtr myPub_accel_w_numeric;\\n\\n\\n\\n /// \\\\brief Velocity of link with respect to world frame in previous time step.\\n\\n Eigen::Vector6d last_w_v_w_b;\\n\\n\\n\\n /// \\\\brief Time stamp of previous time step.\\n\\n common::Time lastTime;\\n\\n};\\n\\n}\\n\\n\\n\\n#endif // __UUV_GAZEBO_PLUGINS_ACCELERATIONS_TEST_PLUGIN_H__\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h\",\n \"rank\": 95,\n \"score\": 160766.45404709195\n },\n {\n \"content\": \" private: rclcpp::Subscription<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr mySubThrustReference;\\n\\n\\n\\n /// \\\\brief Publisher for current actual thrust.\\n\\n private: rclcpp::Publisher<uuv_gazebo_ros_plugins_msgs::msg::FloatStamped>::SharedPtr myPubThrust;\\n\\n\\n\\n /// \\\\brief Publisher for current actual thrust as wrench.\\n\\n private: rclcpp::Publisher<geometry_msgs::msg::WrenchStamped>::SharedPtr myPubThrustWrench;\\n\\n\\n\\n /// \\\\brief Publisher for the thruster state\\n\\n private: rclcpp::Publisher<std_msgs::msg::Bool>::SharedPtr myPubThrusterState;\\n\\n\\n\\n /// \\\\brief Publisher for the thrust force efficiency\\n\\n private: rclcpp::Publisher<std_msgs::msg::Float64>::SharedPtr myPubThrustForceEff;\\n\\n\\n\\n /// \\\\brief Publisher for the dynamic state efficiency\\n\\n private: rclcpp::Publisher<std_msgs::msg::Float64>::SharedPtr myPubDynamicStateEff;\\n\\n\\n\\n /// \\\\brief Connection for callbacks on update world.\\n\\n private: gazebo::event::ConnectionPtr rosPublishConnection;\\n\\n\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 96,\n \"score\": 160765.34936376638\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/ThrusterROSPlugin.h\",\n \"rank\": 97,\n \"score\": 160760.42739854258\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/AccelerationsTestPlugin.h\",\n \"rank\": 98,\n \"score\": 160760.42739854258\n },\n {\n \"content\": \"// Copyright (c) 2020 The Plankton Authors.\\n\\n// All rights reserved.\\n\\n//\\n\\n// This source code is derived from UUV Simulator\\n\\n// (https://github.com/uuvsimulator/uuv_simulator)\\n\\n// Copyright (c) 2016-2019 The UUV Simulator Authors\\n\\n// licensed under the Apache license, Version 2.0\\n\\n// cf. 3rd-party-licenses.txt file in the root directory of this source tree.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\",\n \"file_path\": \"uuv_gazebo_plugins/uuv_gazebo_ros_plugins/include/uuv_gazebo_ros_plugins/FinROSPlugin.h\",\n \"rank\": 99,\n \"score\": 160760.42739854258\n }\n]","isConversational":false}}},{"rowIdx":93,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/publishers/EnviroDIYPublisher.cpp"},"repo_name":{"kind":"string","value":"ssuttles-usgs/ModularSensors"},"commit":{"kind":"string","value":"8bc62eb7705729e47e4a47a6b2f02dab955b63f8"},"file_code":{"kind":"string","value":"\n\n#include \"EnviroDIYPublisher.h\"\n\nconst char *EnviroDIYPublisher::postEndpoint = \"/api/data-stream/\";\nconst char *EnviroDIYPublisher::enviroDIYHost = \"data.envirodiy.org\";\nconst int EnviroDIYPublisher::enviroDIYPort = 80;\nconst char *EnviroDIYPublisher::tokenHeader = \"\\r\\nTOKEN: \";\n\nconst char *EnviroDIYPublisher::contentLengthHeader = \"\\r\\nContent-Length: \";\nconst char *EnviroDIYPublisher::contentTypeHeader = \"\\r\\nContent-Type: application/json\\r\\n\\r\\n\";\n\nconst char *EnviroDIYPublisher::samplingFeatureTag = \"{\\\"sampling_feature\\\":\\\"\";\nconst char *EnviroDIYPublisher::timestampTag = \"\\\",\\\"timestamp\\\":\\\"\";\n\nEnviroDIYPublisher::EnviroDIYPublisher()\n : dataPublisher()\n{\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, sendEveryX, sendOffset)\n{\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger, Client *inClient,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\n{\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger,\n const char *registrationToken,\n const char *samplingFeatureUUID,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, sendEveryX, sendOffset)\n{\n setToken(registrationToken);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger, Client *inClient,\n const char *registrationToken,\n const char *samplingFeatureUUID,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\n{\n setToken(registrationToken);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n \n}\n\nEnviroDIYPublisher::~EnviroDIYPublisher(){}\n\nvoid EnviroDIYPublisher::setToken(const char *registrationToken)\n{\n _registrationToken = registrationToken;\n \n}\n\nuint16_t EnviroDIYPublisher::calculateJsonSize()\n{\n uint16_t jsonLength = 21; \n jsonLength += 36; \n jsonLength += 15; \n jsonLength += 25; \n jsonLength += 2; \n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n {\n jsonLength += 1; \n jsonLength += 36; \n jsonLength += 2; \n jsonLength += _baseLogger->getValueStringAtI(i).length();\n if (i + 1 != _baseLogger->getArrayVarCount())\n {\n jsonLength += 1; \n }\n }\n jsonLength += 1; \n\n return jsonLength;\n}\n\nvoid EnviroDIYPublisher::printSensorDataJSON(Stream *stream)\n{\n stream->print(samplingFeatureTag);\n stream->print(_baseLogger->getSamplingFeatureUUID());\n stream->print(timestampTag);\n stream->print(_baseLogger->formatDateTime_ISO8601(Logger::markedEpochTime));\n stream->print(F(\"\\\",\"));\n\n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n {\n stream->print('\"');\n stream->print(_baseLogger->getVarUUIDAtI(i));\n stream->print(F(\"\\\":\"));\n stream->print(_baseLogger->getValueStringAtI(i));\n if (i + 1 != _baseLogger->getArrayVarCount())\n {\n stream->print(',');\n }\n }\n\n stream->print('}');\n}\n\nvoid EnviroDIYPublisher::printEnviroDIYRequest(Stream *stream)\n{\n \n stream->print(postHeader);\n stream->print(postEndpoint);\n stream->print(HTTPtag);\n stream->print(hostHeader);\n stream->print(enviroDIYHost);\n stream->print(tokenHeader);\n stream->print(_registrationToken);\n \n \n stream->print(contentLengthHeader);\n stream->print(calculateJsonSize());\n stream->print(contentTypeHeader);\n\n \n printSensorDataJSON(stream);\n}\n\nvoid EnviroDIYPublisher::begin(Logger& baseLogger, Client *inClient,\n const char *registrationToken,\n const char *samplingFeatureUUID)\n{\n setToken(registrationToken);\n dataPublisher::begin(baseLogger, inClient);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n}\nvoid EnviroDIYPublisher::begin(Logger& baseLogger,\n const char *registrationToken,\n const char *samplingFeatureUUID)\n{\n setToken(registrationToken);\n dataPublisher::begin(baseLogger);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n}\n\nint16_t EnviroDIYPublisher::publishData(Client *_outClient)\n{\n \n char tempBuffer[37] = \"\";\n uint16_t did_respond = 0;\n\n MS_DBG(F(\"Outgoing JSON size:\"), calculateJsonSize());\n\n \n MS_DBG(F(\"Connecting client\"));\n MS_START_DEBUG_TIMER;\n if (_outClient->connect(enviroDIYHost, enviroDIYPort))\n {\n MS_DBG(F(\"Client connected after\"), MS_PRINT_DEBUG_TIMER, F(\"ms\\n\"));\n\n \n strcpy(txBuffer, postHeader);\n strcat(txBuffer, postEndpoint);\n strcat(txBuffer, HTTPtag);\n\n \n \n \n if (bufferFree() < 28) printTxBuffer(_outClient);\n strcat(txBuffer, hostHeader);\n strcat(txBuffer, enviroDIYHost);\n\n if (bufferFree() < 47) printTxBuffer(_outClient);\n strcat(txBuffer, tokenHeader);\n strcat(txBuffer, _registrationToken);\n\n \n \n\n \n \n\n if (bufferFree() < 26) printTxBuffer(_outClient);\n strcat(txBuffer, contentLengthHeader);\n itoa(calculateJsonSize(), tempBuffer, 10); \n strcat(txBuffer, tempBuffer);\n\n if (bufferFree() < 42) printTxBuffer(_outClient);\n strcat(txBuffer, contentTypeHeader);\n\n \n if (bufferFree() < 21) printTxBuffer(_outClient);\n strcat(txBuffer, samplingFeatureTag);\n\n if (bufferFree() < 36) printTxBuffer(_outClient);\n strcat(txBuffer, _baseLogger->getSamplingFeatureUUID());\n\n if (bufferFree() < 42) printTxBuffer(_outClient);\n strcat(txBuffer, timestampTag);\n _baseLogger->formatDateTime_ISO8601(Logger::markedEpochTime).toCharArray(tempBuffer, 37);\n strcat(txBuffer, tempBuffer);\n txBuffer[strlen(txBuffer)] = '\"';\n txBuffer[strlen(txBuffer)] = ',';\n\n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n {\n \n if (bufferFree() < 47) printTxBuffer(_outClient);\n\n txBuffer[strlen(txBuffer)] = '\"';\n _baseLogger->getVarUUIDAtI(i).toCharArray(tempBuffer, 37);\n strcat(txBuffer, tempBuffer);\n txBuffer[strlen(txBuffer)] = '\"';\n txBuffer[strlen(txBuffer)] = ':';\n _baseLogger->getValueStringAtI(i).toCharArray(tempBuffer, 37);\n strcat(txBuffer, tempBuffer);\n if (i + 1 != _baseLogger->getArrayVarCount())\n {\n txBuffer[strlen(txBuffer)] = ',';\n }\n else\n {\n txBuffer[strlen(txBuffer)] = '}';\n }\n }\n\n \n printTxBuffer(_outClient, true);\n\n \n uint32_t start = millis();\n while ((millis() - start) < 10000L && _outClient->available() < 12)\n {delay(10);}\n\n \n \n \n did_respond = _outClient->readBytes(tempBuffer, 12);\n\n \n MS_DBG(F(\"Stopping client\"));\n MS_RESET_DEBUG_TIMER;\n _outClient->stop();\n MS_DBG(F(\"Client stopped after\"), MS_PRINT_DEBUG_TIMER, F(\"ms\"));\n }\n else\n {\n PRINTOUT(F(\"\\n -- Unable to Establish Connection to EnviroDIY Data Portal --\"));\n }\n\n \n int16_t responseCode = 0;\n if (did_respond > 0)\n {\n char responseCode_char[4];\n for (uint8_t i = 0; i < 3; i++)\n {\n responseCode_char[i] = tempBuffer[i+9];\n }\n responseCode = atoi(responseCode_char);\n }\n else\n {\n responseCode=504;\n }\n\n PRINTOUT(F(\"-- Response Code --\"));\n PRINTOUT(responseCode);\n\n return responseCode;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"EnviroDIYPublisher.h\"\n\nconst char *EnviroDIYPublisher::postEndpoint = \"/api/data-stream/\";\nconst char *EnviroDIYPublisher::enviroDIYHost = \"data.envirodiy.org\";\nconst int EnviroDIYPublisher::enviroDIYPort = 80;\nconst char *EnviroDIYPublisher::tokenHeader = \"\\r\\nTOKEN: \";\n\nconst char *EnviroDIYPublisher::contentLengthHeader = \"\\r\\nContent-Length: \";\nconst char *EnviroDIYPublisher::contentTypeHeader = \"\\r\\nContent-Type: application/json\\r\\n\\r\\n\";\n\nconst char *EnviroDIYPublisher::samplingFeatureTag = \"{\\\"sampling_feature\\\":\\\"\";\nconst char *EnviroDIYPublisher::timestampTag = \"\\\",\\\"timestamp\\\":\\\"\";\n\nEnviroDIYPublisher::EnviroDIYPublisher()\n : dataPublisher()\n{\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, sendEveryX, sendOffset)\n{\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger, Client *inClient,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\n{\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger,\n const char *registrationToken,\n const char *samplingFeatureUUID,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, sendEveryX, sendOffset)\n{\n setToken(registrationToken);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n \n}\nEnviroDIYPublisher::EnviroDIYPublisher(Logger& baseLogger, Client *inClient,\n const char *registrationToken,\n const char *samplingFeatureUUID,\n uint8_t sendEveryX, uint8_t sendOffset)\n : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\n{\n setToken(registrationToken);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n \n}\n\nEnviroDIYPublisher::~EnviroDIYPublisher(){}\n\nvoid EnviroDIYPublisher::setToken(const char *registrationToken)\n{\n _registrationToken = registrationToken;\n \n}\n\nuint16_t EnviroDIYPublisher::calculateJsonSize()\n{\n uint16_t jsonLength = 21; \n jsonLength += 36; \n jsonLength += 15; \n jsonLength += 25; \n jsonLength += 2; \n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n {\n jsonLength += 1; \n jsonLength += 36; \n jsonLength += 2; \n jsonLength += _baseLogger->getValueStringAtI(i).length();\n if (i + 1 != _baseLogger->getArrayVarCount())\n {\n jsonLength += 1; \n }\n }\n jsonLength += 1; \n\n return jsonLength;\n}\n\nvoid EnviroDIYPublisher::printSensorDataJSON(Stream *stream)\n{\n stream->print(samplingFeatureTag);\n stream->print(_baseLogger->getSamplingFeatureUUID());\n stream->print(timestampTag);\n stream->print(_baseLogger->formatDateTime_ISO8601(Logger::markedEpochTime));\n stream->print(F(\"\\\",\"));\n\n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n {\n stream->print('\"');\n stream->print(_baseLogger->getVarUUIDAtI(i));\n stream->print(F(\"\\\":\"));\n stream->print(_baseLogger->getValueStringAtI(i));\n if (i + 1 != _baseLogger->getArrayVarCount())\n {\n stream->print(',');\n }\n }\n\n stream->print('}');\n}\n\nvoid EnviroDIYPublisher::printEnviroDIYRequest(Stream *stream)\n{\n \n stream->print(postHeader);\n stream->print(postEndpoint);\n stream->print(HTTPtag);\n stream->print(hostHeader);\n stream->print(enviroDIYHost);\n stream->print(tokenHeader);\n stream->print(_registrationToken);\n \n \n stream->print(contentLengthHeader);\n stream->print(calculateJsonSize());\n stream->print(contentTypeHeader);\n\n \n printSensorDataJSON(stream);\n}\n\nvoid EnviroDIYPublisher::begin(Logger& baseLogger, Client *inClient,\n const char *registrationToken,\n const char *samplingFeatureUUID)\n{\n setToken(registrationToken);\n dataPublisher::begin(baseLogger, inClient);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n}\nvoid EnviroDIYPublisher::begin(Logger& baseLogger,\n const char *registrationToken,\n const char *samplingFeatureUUID)\n{\n setToken(registrationToken);\n dataPublisher::begin(baseLogger);\n _baseLogger->setSamplingFeatureUUID(samplingFeatureUUID);\n}\n\nint16_t EnviroDIYPublisher::publishData(Client *_outClient)\n{\n \n char tempBuffer[37] = \"\";\n uint16_t did_respond = 0;\n\n MS_DBG(F(\"Outgoing JSON size:\"), calculateJsonSize());\n\n \n MS_DBG(F(\"Connecting client\"));\n MS_START_DEBUG_TIMER;\n if (_outClient->connect(enviroDIYHost, enviroDIYPort))\n {\n MS_DBG(F(\"Client connected after\"), MS_PRINT_DEBUG_TIMER, F(\"ms\\n\"));\n\n \n strcpy(txBuffer, postHeader);\n strcat(txBuffer, postEndpoint);\n strcat(txBuffer, HTTPtag);\n\n \n \n \n if (bufferFree() < 28) printTxBuffer(_outClient);\n strcat(txBuffer, hostHeader);\n strcat(txBuffer, enviroDIYHost);\n\n if (bufferFree() < 47) printTxBuffer(_outClient);\n strcat(txBuffer, tokenHeader);\n strcat(txBuffer, _registrationToken);\n\n \n \n\n \n \n\n if (bufferFree() < 26) printTxBuffer(_outClient);\n strcat(txBuffer, contentLengthHeader);\n itoa(calculateJsonSize(), tempBuffer, 10); \n strcat(txBuffer, tempBuffer);\n\n if (bufferFree() < 42) printTxBuffer(_outClient);\n strcat(txBuffer, contentTypeHeader);\n\n \n if (bufferFree() < 21) printTxBuffer(_outClient);\n strcat(txBuffer, samplingFeatureTag);\n\n if (bufferFree() < 36) printTxBuffer(_outClient);\n strcat(txBuffer, _baseLogger->getSamplingFeatureUUID());\n\n if (bufferFree() < 42) printTxBuffer(_outClient);\n strcat(txBuffer, timestampTag);\n _baseLogger->formatDateTime_ISO8601(Logger::markedEpochTime).toCharArray(tempBuffer, 37);\n strcat(txBuffer, tempBuffer);\n txBuffer[strlen(txBuffer)] = '\"';\n txBuffer[strlen(txBuffer)] = ',';\n\n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n {\n \n if (bufferFree() < 47) printTxBuffer(_outClient);\n\n txBuffer[strlen(txBuffer)] = '\"';\n _baseLogger->getVarUUIDAtI(i).toCharArray(tempBuffer, 37);\n strcat(txBuffer, tempBuffer);\n "},"suffix":{"kind":"string","value":"- Response Code --\"));\n PRINTOUT(responseCode);\n\n return responseCode;\n}\n"},"middle":{"kind":"string","value":" txBuffer[strlen(txBuffer)] = '\"';\n txBuffer[strlen(txBuffer)] = ':';\n _baseLogger->getValueStringAtI(i).toCharArray(tempBuffer, 37);\n strcat(txBuffer, tempBuffer);\n if (i + 1 != _baseLogger->getArrayVarCount())\n {\n txBuffer[strlen(txBuffer)] = ',';\n }\n else\n {\n txBuffer[strlen(txBuffer)] = '}';\n }\n }\n\n \n printTxBuffer(_outClient, true);\n\n \n uint32_t start = millis();\n while ((millis() - start) < 10000L && _outClient->available() < 12)\n {delay(10);}\n\n \n \n \n did_respond = _outClient->readBytes(tempBuffer, 12);\n\n \n MS_DBG(F(\"Stopping client\"));\n MS_RESET_DEBUG_TIMER;\n _outClient->stop();\n MS_DBG(F(\"Client stopped after\"), MS_PRINT_DEBUG_TIMER, F(\"ms\"));\n }\n else\n {\n PRINTOUT(F(\"\\n -- Unable to Establish Connection to EnviroDIY Data Portal --\"));\n }\n\n \n int16_t responseCode = 0;\n if (did_respond > 0)\n {\n char responseCode_char[4];\n for (uint8_t i = 0; i < 3; i++)\n {\n responseCode_char[i] = tempBuffer[i+9];\n }\n responseCode = atoi(responseCode_char);\n }\n else\n {\n responseCode=504;\n }\n\n PRINTOUT(F(\"-"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":" // Returns the data destination\n\n virtual String getEndpoint(void){return String(enviroDIYHost);}\n\n\n\n // Adds the site registration token\n\n void setToken(const char *registrationToken);\n\n\n\n // Calculates how long the JSON will be\n\n uint16_t calculateJsonSize();\n\n // Calculates how long the full post request will be, including headers\n\n // uint16_t calculatePostSize();\n\n\n\n // This generates a properly formatted JSON for EnviroDIY\n\n void printSensorDataJSON(Stream *stream);\n\n\n\n // This prints a fully structured post request for WikiWatershed/EnviroDIY\n\n // to the specified stream.\n\n void printEnviroDIYRequest(Stream *stream);\n\n\n\n // A way to begin with everything already set\n\n void begin(Logger& baseLogger, Client *inClient,\n","file_path":"src/publishers/EnviroDIYPublisher.h","rank":0,"score":32.17999685936584},{"content":" const char *registrationToken,\n\n const char *samplingFeatureUUID);\n\n void begin(Logger& baseLogger,\n\n const char *registrationToken,\n\n const char *samplingFeatureUUID);\n\n\n\n // This utilizes an attached modem to make a TCP connection to the\n\n // EnviroDIY/ODM2DataSharingPortal and then streams out a post request\n\n // over that connection.\n\n // The return is the http status code of the response.\n\n // int16_t postDataEnviroDIY(void);\n\n virtual int16_t publishData(Client *_outClient);\n\n\n\nprotected:\n\n\n\n // portions of the POST request\n\n static const char *postEndpoint;\n\n static const char *enviroDIYHost;\n\n static const int enviroDIYPort;\n\n static const char *tokenHeader;\n","file_path":"src/publishers/EnviroDIYPublisher.h","rank":2,"score":24.53143885601537},{"content":" // over that connection.\n\n // The return is the http status code of the response.\n\n // int16_t postDataDreamHost(void);\n\n int16_t publishData(Client *_outClient);\n\n\n\nprotected:\n\n // portions of the GET request\n\n static const char *dreamhostHost;\n\n static const int dreamhostPort;\n\n static const char *loggerTag;\n\n static const char *timestampTagDH;\n\n\n\n\n\nprivate:\n\n const char *_DreamHostPortalRX;\n\n bool _dualPost = true;\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/publishers/DreamHostPublisher.h","rank":3,"score":24.460661049608365},{"content":" virtual String getEndpoint(void){return String(dreamhostHost);}\n\n\n\n // Functions for private SWRC server\n\n void setDreamHostPortalRX(const char *dhUrl);\n\n\n\n // This creates all of the URL parameters\n\n void printSensorDataDreamHost(Stream *stream);\n\n\n\n // This prints a fully structured GET request for DreamHost to the\n\n // specified stream.\n\n void printDreamHostRequest(Stream *stream);\n\n\n\n // A way to begin with everything already set\n\n void begin(Logger& baseLogger, Client *inClient,\n\n const char *dhUrl);\n\n void begin(Logger& baseLogger,\n\n const char *dhUrl);\n\n\n\n // This utilizes an attached modem to make a TCP connection to the\n\n // DreamHost URL and then streams out a get request\n","file_path":"src/publishers/DreamHostPublisher.h","rank":4,"score":22.599926395645127},{"content":" virtual int16_t publishData(Client *_outClient) = 0;\n\n virtual int16_t publishData();\n\n // These are duplicates of the above functions for backwards compatibility\n\n virtual int16_t sendData(Client *_outClient);\n\n virtual int16_t sendData();\n\n\n\n // This spits out a string description of the PubSubClient codes\n\n String parseMQTTState(int state);\n\n\n\n\n\nprotected:\n\n // The internal logger instance\n\n Logger *_baseLogger;\n\n // The internal client\n\n Client *_inClient;\n\n\n\n static char txBuffer[MS_SEND_BUFFER_SIZE];\n\n // This returns the number of empty spots in the buffer\n\n static int bufferFree(void);\n\n // This fills the TX buffer with nulls ('\\0')\n","file_path":"src/dataPublisherBase.h","rank":7,"score":19.57542693015288},{"content":"\n\n\n\n// Empties the outgoing buffer\n\nvoid dataPublisher::emptyTxBuffer(void)\n\n{\n\n MS_DBG(F(\"Dumping the TX Buffer\"));\n\n for (int i = 0; i < MS_SEND_BUFFER_SIZE; i++)\n\n {\n\n txBuffer[i] = '\\0';\n\n }\n\n}\n\n\n\n\n\n// Returns how much space is left in the buffer\n\nint dataPublisher::bufferFree(void)\n\n{\n\n MS_DBG(F(\"Current TX Buffer Size:\"), strlen(txBuffer));\n\n return MS_SEND_BUFFER_SIZE - strlen(txBuffer);\n\n}\n\n\n","file_path":"src/dataPublisherBase.cpp","rank":9,"score":18.39006492527985},{"content":" stream->print(dreamhostHost);\n\n stream->print(F(\"\\r\\n\\r\\n\"));\n\n}\n\n\n\n\n\n// A way to begin with everything already set\n\nvoid DreamHostPublisher::begin(Logger& baseLogger, Client *inClient,\n\n const char *dhUrl)\n\n{\n\n setDreamHostPortalRX(dhUrl);\n\n dataPublisher::begin(baseLogger, inClient);\n\n}\n\nvoid DreamHostPublisher::begin(Logger& baseLogger,\n\n const char *dhUrl)\n\n{\n\n setDreamHostPortalRX(dhUrl);\n\n dataPublisher::begin(baseLogger);\n\n}\n\n\n\n\n","file_path":"src/publishers/DreamHostPublisher.cpp","rank":10,"score":18.062825779343115},{"content":" const char *thingSpeakMQTTKey,\n\n const char *thingSpeakChannelID,\n\n const char *thingSpeakChannelKey);\n\n void begin(Logger& baseLogger,\n\n const char *thingSpeakMQTTKey,\n\n const char *thingSpeakChannelID,\n\n const char *thingSpeakChannelKey);\n\n\n\n // This sends the data to ThingSpeak\n\n // bool mqttThingSpeak(void);\n\n virtual int16_t publishData(Client *_outClient);\n\n\n\nprotected:\n\n static const char *mqttServer;\n\n static const int mqttPort;\n\n static const char *mqttClient;\n\n static const char *mqttUser;\n\n\n\nprivate:\n\n // Keys for ThingSpeak\n\n const char *_thingSpeakMQTTKey;\n\n const char *_thingSpeakChannelID;\n\n const char *_thingSpeakChannelKey;\n\n PubSubClient _mqttClient;\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/publishers/ThingSpeakPublisher.h","rank":12,"score":17.868425081164503},{"content":" virtual ~ThingSpeakPublisher();\n\n\n\n // Returns the data destination\n\n virtual String getEndpoint(void){return String(mqttServer);}\n\n\n\n // Adds the MQTT API Key from Account > MyProfile\n\n void setMQTTKey(const char *thingSpeakMQTTKey);\n\n\n\n // Adds the channel ID\n\n void setChannelID(const char *thingSpeakChannelID);\n\n\n\n // Adds the channel Write API Key.\n\n void setChannelKey(const char *thingSpeakChannelKey);\n\n\n\n // Sets all 3 ThingSpeak parameters\n\n void setThingSpeakParams(const char *MQTTKey, const char *channelID,\n\n const char *channelKey);\n\n\n\n // A way to begin with everything already set\n\n void begin(Logger& baseLogger, Client *inClient,\n","file_path":"src/publishers/ThingSpeakPublisher.h","rank":13,"score":17.67449302038462},{"content":" // static const char *cacheHeader;\n\n // static const char *connectionHeader;\n\n static const char *contentLengthHeader;\n\n static const char *contentTypeHeader;\n\n\n\n // portions of the JSON\n\n static const char *samplingFeatureTag;\n\n static const char *timestampTag;\n\n\n\nprivate:\n\n // Tokens and UUID's for EnviroDIY\n\n const char *_registrationToken;\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/publishers/EnviroDIYPublisher.h","rank":14,"score":17.592894556741083},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_DIGIXBEE3GBYPASS_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool extraModemSetup(void) override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/DigiXBee3GBypass.h","rank":15,"score":16.854918042446645},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_DIGIXBEELTEBYPASS_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool extraModemSetup(void) override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/DigiXBeeLTEBypass.h","rank":16,"score":16.85491804244665},{"content":" {\n\n MS_DBG(F(\"Response Byte\"), i, ':', (char)nistBytes[i],\n\n '=', nistBytes[i], '=', String(nistBytes[i], BIN));\n\n secFrom1900 += 0x000000FF & nistBytes[i];\n\n /* MS_DBG(F(\"\\nseconds from 1900 after byte:\"),String(secFrom1900, BIN)); */\n\n if (i + 1 < 4)\n\n {\n\n secFrom1900 = secFrom1900 << 8;\n\n }\n\n }\n\n MS_DBG(F(\"Seconds from Jan 1, 1900 returned by NIST (UTC):\"),\n\n secFrom1900, '=', String(secFrom1900, BIN));\n\n\n\n /* Close the TCP connection, just in case */\n\n /* Don't close connection! It takes too long and then the time stamp is out of date! */\n\n /*gsmClient.stop(15000L);*/\n\n\n\n /* Return the timestamp */\n\n uint32_t unixTimeStamp = secFrom1900 - 2208988800;\n\n MS_DBG(F(\"Unix Timestamp returned by NIST (UTC):\"), unixTimeStamp);\n","file_path":"src/LoggerModem.cpp","rank":17,"score":16.764558089948963},{"content":" bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\n\n float getModemTemperature(void) override;\n\n\n\n uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_DIGIXBEEWIFI_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool extraModemSetup(void) override;\n\n\n\nprivate:\n\n const char *_ssid;\n\n const char *_pwd;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/DigiXBeeWifi.h","rank":18,"score":16.698117003001045},{"content":"// Send Buffer\n\n// This determines how many characters to set out at once over the TCP/UDP\n\n// connection. Increasing this may decrease data use by a loger, while\n\n// decreasing it will save memory. Do not make it smaller than 47 (to keep all\n\n// variable values with their UUID's) or bigger than 1500 (a typical TCP/UDP\n\n// Maximum Transmission Unit).\n\n#ifndef MS_SEND_BUFFER_SIZE\n\n#define MS_SEND_BUFFER_SIZE 750\n\n#endif\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerBase.h\"\n\n#include \"Client.h\"\n\n\n","file_path":"src/dataPublisherBase.h","rank":19,"score":16.69035446327213},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_SEQUANSMONARCH_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/SequansMonarch.h","rank":20,"score":16.362239264802074},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_SODAQUBEEU201_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/SodaqUBeeU201.h","rank":21,"score":16.362239264802074},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n void modemPowerUp(void) override;\n\n\n\n #ifdef MS_SIMCOMSIM7000_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/SIMComSIM7000.h","rank":22,"score":16.268988767805173},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_SIMCOMSIM800_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\n void modemPowerUp(void) override;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/SIMComSIM800.h","rank":23,"score":16.268988767805173},{"content":" uint32_t getNISTTime(void) override;\n\n\n\n void modemPowerUp(void) override;\n\n\n\n #ifdef MS_QUECTELBG96_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/QuectelBG96.h","rank":24,"score":16.268988767805173},{"content":" virtual void disconnectInternet(void) = 0;\n\n\n\n // Get values by other names\n\n virtual bool getModemSignalQuality(int16_t &rssi, int16_t &percent) = 0;\n\n virtual bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) = 0;\n\n virtual float getModemTemperature(void) = 0;\n\n\n\n // This has the same functionality as Client->connect with debugging text\n\n // int16_t openTCP(const char *host, uint16_t port);\n\n // This has the same functionality as Client->connect with debugging text\n\n // int16_t openTCP(IPAddress ip, uint16_t port);\n\n // This has the same functionality as Client->close with debugging text\n\n // void closeTCP(void);\n\n\n\n // Special sleep and power function for the modem\n\n // Note: modemPowerDown() simply kills power, while modemSleepPowerDown()\n\n // allows for graceful shut down. You should use modemSleepPowerDown()\n\n // whenever possible.\n\n virtual void modemPowerUp(void);\n\n virtual void modemPowerDown(void);\n","file_path":"src/LoggerModem.h","rank":25,"score":16.20371852762566},{"content":"// Post the data to dream host.\n\n// int16_t DreamHostPublisher::postDataDreamHost(void)\n\nint16_t DreamHostPublisher::publishData(Client *_outClient)\n\n{\n\n // Create a buffer for the portions of the request and response\n\n char tempBuffer[37] = \"\";\n\n uint16_t did_respond = 0;\n\n\n\n // Open a TCP/IP connection to DreamHost\n\n MS_DBG(F(\"Connecting client\"));\n\n MS_START_DEBUG_TIMER ;\n\n if (_outClient->connect(dreamhostHost, dreamhostPort))\n\n {\n\n MS_DBG(F(\"Client connected after\"), MS_PRINT_DEBUG_TIMER, F(\"ms\\n\"));\n\n\n\n // copy the initial post header into the tx buffer\n\n strcpy(txBuffer, getHeader);\n\n\n\n // add in the dreamhost receiver URL\n\n strcat(txBuffer, _DreamHostPortalRX);\n","file_path":"src/publishers/DreamHostPublisher.cpp","rank":27,"score":15.959095946784327},{"content":" static void emptyTxBuffer(void);\n\n // This writes the TX buffer to a stream and also to the debugging port\n\n static void printTxBuffer(Stream *stream, bool addNewLine = false);\n\n\n\n uint8_t _sendEveryX;\n\n uint8_t _sendOffset;\n\n\n\n // Basic chunks of HTTP\n\n static const char *getHeader;\n\n static const char *postHeader;\n\n static const char *HTTPtag;\n\n static const char *hostHeader;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/dataPublisherBase.h","rank":28,"score":15.524654278413461},{"content":"// Functions for private SWRC server\n\nvoid DreamHostPublisher::setDreamHostPortalRX(const char *dhUrl)\n\n{\n\n _DreamHostPortalRX = dhUrl;\n\n // MS_DBG(F(\"Dreamhost portal URL set!\"));\n\n}\n\n\n\n\n\n// This prints the URL out to an Arduino stream\n\nvoid DreamHostPublisher::printSensorDataDreamHost(Stream *stream)\n\n{\n\n stream->print(_DreamHostPortalRX);\n\n stream->print(loggerTag);\n\n stream->print(_baseLogger->getLoggerID());\n\n stream->print(timestampTagDH);\n\n stream->print(String(Logger::markedEpochTime - 946684800)); // Correct time from epoch to y2k\n\n\n\n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\n\n {\n\n stream->print('&');\n","file_path":"src/publishers/DreamHostPublisher.cpp","rank":29,"score":15.468793489145343},{"content":" // Sets the parameters for frequency of sending and any offset, if needed\n\n // NOTE: These parameters are not currently used!!\n\n void setSendFrequency(uint8_t sendEveryX, uint8_t sendOffset);\n\n\n\n // \"Begins\" the publisher - attaches client and logger\n\n // Not doing this in the constructor because we expect the publishers to be\n\n // created in the \"global scope\" and we cannot control the order in which\n\n // objects in that global scope will be created. That is, we cannot\n\n // guarantee that the logger will actually be created before the publisher\n\n // that wants to attach to it unless we wait to attach the publisher until\n\n // in the setup or loop function of the main program.\n\n void begin(Logger& baseLogger, Client *inClient);\n\n void begin(Logger& baseLogger);\n\n\n\n // Returns the data destination\n\n virtual String getEndpoint(void) = 0;\n\n\n\n // This opens a socket to the correct receiver and sends out the formatted data\n\n // This depends on an internet connection already being made and a client\n\n // being available\n","file_path":"src/dataPublisherBase.h","rank":30,"score":15.38245267880804},{"content":" arrayOfVars[i]->parentSensor->averageMeasurements();\n\n MS_DBG(F(\"--- Notifying variables from\"),\n\n arrayOfVars[i]->getParentSensorNameAndLocation(), F(\"---\"));\n\n arrayOfVars[i]->parentSensor->notifyVariables();\n\n }\n\n }\n\n MS_DBG(F(\"... Complete. <<-----\"));\n\n\n\n return success;\n\n}\n\n\n\n\n\n// This function prints out the results for any connected sensors to a stream\n\n// Calculated variable results will be included\n\nvoid VariableArray::printSensorData(Stream *stream)\n\n{\n\n for (uint8_t i = 0; i < _variableCount; i++)\n\n {\n\n if (arrayOfVars[i]->isCalculated)\n\n {\n","file_path":"src/VariableArray.cpp","rank":31,"score":15.136111407615282},{"content":" bool getModemSignalQuality(int16_t &rssi, int16_t &percent) override;\n\n bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\n\n float getModemTemperature(void) override;\n\n\n\n uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_DIGIXBEECELLULARTRANSPARENT_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool extraModemSetup(void) override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/DigiXBeeCellularTransparent.h","rank":32,"score":15.06032583927012},{"content":" // very long string objects which can crash the logger\n\n virtual void printFileHeader(Stream *stream);\n\n\n\n // This prints a comma separated list of volues of sensor data - including the\n\n // time - out over an Arduino stream\n\n void printSensorDataCSV(Stream *stream);\n\n\n\n // These functions create a file on an SD card and set the created/modified/\n\n // accessed timestamps in that file.\n\n // The filename may either be the one automatically generated by the logger\n\n // id and the date, the one set by setFileName(String), or can be specified\n\n // in the function.\n\n // If asked to, these functions will also write a header to the file based\n\n // on the variable information from the variable array.\n\n // This can be used to force a logger to create a file with a secondary file name.\n\n bool createLogFile(String& filename, bool writeDefaultHeader = false);\n\n bool createLogFile(bool writeDefaultHeader = false);\n\n\n\n // These functions create a file on an SD card and set the modified/accessed\n\n // timestamps in that file.\n","file_path":"src/LoggerBase.h","rank":33,"score":14.79451162481104},{"content":" bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\n\n float getModemTemperature(void) override;\n\n\n\n uint32_t getNISTTime(void) override;\n\n\n\n #ifdef MS_ESPRESSIFESP8266_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n\n TinyGsmClient gsmClient;\n\n\n\n // Need the stream for tossing junk on boot\n\n Stream *_modemStream;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n","file_path":"src/modems/EspressifESP8266.h","rank":34,"score":14.583016654028008},{"content":"{\n\n return publishData(_outClient);\n\n}\n\nint16_t dataPublisher::sendData()\n\n{\n\n return publishData();\n\n}\n\n\n\n\n\n// This spits out a string description of the PubSubClient codes\n\nString dataPublisher::parseMQTTState(int state)\n\n{\n\n // // Possible values for client.state()\n\n // #define MQTT_CONNECTION_TIMEOUT -4\n\n // #define MQTT_CONNECTION_LOST -3\n\n // #define MQTT_CONNECT_FAILED -2\n\n // #define MQTT_DISCONNECTED -1\n\n // #define MQTT_CONNECTED 0\n\n // #define MQTT_CONNECT_BAD_PROTOCOL 1\n\n // #define MQTT_CONNECT_BAD_CLIENT_ID 2\n","file_path":"src/dataPublisherBase.cpp","rank":35,"score":14.551130339155081},{"content":"\n\n### Example for the CUAHSI Workshop\n\n\n\n### To Do:\n\n\n\n1. Give your logger a name in line 49 by replacing the x's with your own logger id:\n\n\n\n```cpp\n\nconst char *LoggerID = \"XXXXX\";\n\n```\n\n\n\n2. Fill in the correct WiFi Id and Password in lines 119 and 120:\n\n\n\n```cpp\n\nconst char *wifiId = \"xxxxx\"; // The WiFi access point, unnecessary for gprs\n\nconst char *wifiPwd = \"xxxxx\"; // The password for connecting to WiFi, unnecessary for gprs\n\n```\n\n\n\n\n\n3. Verify your sensor attachment pins:\n\n - CTD is connected to the D6-7 plug (line 159, SDI-12 data on pin 7)\n\n - Maxim DS18 is connected to the D4-5 plug (line 212, OneWire bus on pin 4)\n\n - Ultrasonic is connected to the D10-11 plug (line 79, software data Rx on pin 11)\n\n\n\n4. If using ultrasonic, and interested in water depth instead of distance to the water, create a calculated variable for water depth by uncommenting lines 211, 236-259 and 281-282 and commenting out line 275.\n\n\n\n5. Fill out all of the variable UUID's\n\n - lines 269 - 280, 211, and 253 as applicable\n\n\n\n6. Fill out your registration token and sampling feature UUID in lines 305-306:\n\n\n\n```cpp\n\nconst char *registrationToken = \"12345678-abcd-1234-ef00-1234567890ab\"; // Device registration token\n\nconst char *samplingFeature = \"12345678-abcd-1234-ef00-1234567890ab\"; // Sampling feature UUID\n\n```\n\n\n\n7. Compile and upload!\n","file_path":"examples/cuahsi_workshop/ReadMe.md","rank":36,"score":14.403650727707806},{"content":"#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_SIMCOMSIM7000_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n\n\n","file_path":"src/modems/SIMComSIM7000.h","rank":37,"score":14.392747915698276},{"content":"// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_SEQUANSMONARCH_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n\n\n","file_path":"src/modems/SequansMonarch.h","rank":38,"score":14.386751697516274},{"content":"// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_QUECTELBG96_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n\n\n","file_path":"src/modems/QuectelBG96.h","rank":39,"score":14.386751697516274},{"content":" // TempI\n\n\n\n // NOTE ALSO: Depending on what type of serial stream you are using, there\n\n // may also be a bunch of junk in the buffer that this will clear out.\n\n MS_DBG(F(\"Dumping Header Lines from MaxBotix on\"), getSensorLocation());\n\n for(int i = 0; i < 6; i++)\n\n {\n\n String headerLine = _stream->readStringUntil('\\r');\n\n MS_DBG(i, '-', headerLine);\n\n }\n\n // Clear anything else out of the stream buffer\n\n uint8_t junkChars = _stream->available();\n\n if (junkChars)\n\n {\n\n MS_DBG(F(\"Dumping\"), junkChars, F(\"characters from MaxBotix stream buffer\"));\n\n for (uint8_t i = 0; i < junkChars; i++)\n\n {\n\n #ifdef MS_MAXBOTIXSONAR_DEBUG\n\n DEBUGGING_SERIAL_OUTPUT.print(_stream->read());\n\n #else\n","file_path":"src/sensors/MaxBotixSonar.cpp","rank":41,"score":13.91668680881705},{"content":"#define S2GBR6_SIGNALQUALITY_TIME_MS 15000L\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_SODAQ2GBEER6_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n","file_path":"src/modems/Sodaq2GBeeR6.h","rank":42,"score":13.85234204236172},{"content":"#define R410M_SIGNALQUALITY_TIME_MS 15000L\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_SODAQUBEER410M_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n","file_path":"src/modems/SodaqUBeeR410M.h","rank":43,"score":13.85234204236172},{"content":" TinyGsmClient gsmClient;\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n int8_t _vRefPin;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/Sodaq2GBeeR6.h","rank":44,"score":13.816562906266036},{"content":" itoa(i+1, tempBuffer, 10); // BASE 10\n\n strcat(txBuffer, tempBuffer);\n\n txBuffer[strlen(txBuffer)] = '=';\n\n _baseLogger->getValueStringAtI(i).toCharArray(tempBuffer, 26);\n\n strcat(txBuffer, tempBuffer);\n\n if (i + 1 != numChannels)\n\n {\n\n txBuffer[strlen(txBuffer)] = '&';\n\n }\n\n }\n\n MS_DBG(F(\"Message [\"), strlen(txBuffer), F(\"]:\"), String(txBuffer));\n\n\n\n // Set the client connection parameters\n\n _mqttClient.setClient(*_outClient);\n\n _mqttClient.setServer(mqttServer, mqttPort);\n\n\n\n // Make sure any previous TCP connections are closed\n\n // NOTE: The PubSubClient library used for MQTT connect assumes that as\n\n // long as the client is connected, it must be connected to the right place.\n\n // Closing any stray client sockets here ensures that a new client socket\n","file_path":"src/publishers/ThingSpeakPublisher.cpp","rank":45,"score":13.788915598814771},{"content":"\n\n\n\n// A way to begin with everything already set\n\nvoid ThingSpeakPublisher::begin(Logger& baseLogger, Client *inClient,\n\n const char *thingSpeakMQTTKey,\n\n const char *thingSpeakChannelID,\n\n const char *thingSpeakChannelKey)\n\n{\n\n setMQTTKey(thingSpeakMQTTKey);\n\n setChannelID(thingSpeakChannelID);\n\n setChannelKey(thingSpeakChannelKey);\n\n dataPublisher::begin(baseLogger, inClient);\n\n}\n\nvoid ThingSpeakPublisher::begin(Logger& baseLogger,\n\n const char *thingSpeakMQTTKey,\n\n const char *thingSpeakChannelID,\n\n const char *thingSpeakChannelKey)\n\n{\n\n setMQTTKey(thingSpeakMQTTKey);\n\n setChannelID(thingSpeakChannelID);\n","file_path":"src/publishers/ThingSpeakPublisher.cpp","rank":46,"score":13.692568082525069},{"content":" TinyGsmClient gsmClient;\n\n\n\n #if F_CPU == 8000000L\n\n HardwareSerial *_modemSerial;\n\n #endif\n\n\n\nprotected:\n\n bool didATRespond(void) override;\n\n bool isInternetAvailable(void) override;\n\n bool verifyMeasurementComplete(bool debug=false) override;\n\n bool modemSleepFxn(void) override;\n\n bool modemWakeFxn(void) override;\n\n bool extraModemSetup(void)override;\n\n\n\nprivate:\n\n const char *_apn;\n\n\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/modems/SodaqUBeeR410M.h","rank":47,"score":13.593736049755433},{"content":" // This also un-sets the _millisPowerOn timestamp.\n\n virtual void powerDown(void);\n\n\n\n // This wakes the sensor up, if necessary - that is, does whatever it takes to\n\n // get a sensor in the proper state to begin a measurement after the power is on.\n\n // This *may* require a waitForWarmUp() before wake commands can be sent.\n\n // The wait is NOT included in this function!\n\n // This also sets the _millisSensorActivated timestamp.\n\n // By default, verifies the power is on and returns true\n\n virtual bool wake(void);\n\n // This puts the sensor to sleep, if necessary.\n\n // This also un-sets the _millisSensorActivated timestamp.\n\n // Does NOT power down the sensor!\n\n virtual bool sleep(void);\n\n\n\n // This tells the sensor to start a single measurement, if needed\n\n // This also sets the _millisMeasurementRequested timestamp.\n\n // This *may* require a waitForWarmUp() before measurement commands can be sent.\n\n // This *may* also require a waitForStability() before returned measurements will be any good.\n\n // The waits are NOT included in this function!\n","file_path":"src/SensorBase.h","rank":48,"score":13.473881064018546},{"content":" // The \"isMeasurementComplete()\" function checks whether or not enough time\n\n // has passed between when the sensor was asked to take a single measurement\n\n // and when that measurement should be complete. The\n\n // \"waitForMeasurementCompletion()\" function delays until the time passes.\n\n virtual bool isMeasurementComplete(bool debug=false);\n\n void waitForMeasurementCompletion(void);\n\n\n\n\n\nprotected:\n\n\n\n int8_t _dataPin; // SIGNED int, to allow negative numbers for unused pins\n\n int8_t _powerPin; // SIGNED int, to allow negative numbers for unused pins\n\n const char *_sensorName;\n\n const uint8_t _numReturnedVars;\n\n uint8_t _measurementsToAverage;\n\n uint8_t numberGoodMeasurementsMade[MAX_NUMBER_VARS];\n\n\n\n // This is the time needed from the when a sensor has power until it's ready to talk\n\n // The _millisPowerOn value is set in the powerUp() function. It is\n\n // un-set in the powerDown() function.\n","file_path":"src/SensorBase.h","rank":49,"score":13.464426389653275},{"content":"\n\n// How long we're willing to wait to get signal quality\n\n#define SIM800_SIGNALQUALITY_TIME_MS 15000L\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_SIMCOMSIM800_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n\n\n","file_path":"src/modems/SIMComSIM800.h","rank":50,"score":13.431795686753512},{"content":"\n\n// How long we're willing to wait to get signal quality\n\n#define U201_SIGNALQUALITY_TIME_MS 15000L\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_SODAQUBEEU201_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n\n\n","file_path":"src/modems/SodaqUBeeU201.h","rank":51,"score":13.431795686753512},{"content":"\n\n // This gives power to each sensor\n\n void sensorsPowerUp(void);\n\n\n\n // This verifies sensors have power and sends a wake command, if necesary\n\n bool sensorsWake(void);\n\n\n\n // This sends sensors a sleep command, but does not power them down\n\n bool sensorsSleep(void);\n\n\n\n // This cuts sensor power\n\n void sensorsPowerDown(void);\n\n\n\n // This function updates the values for any connected sensors.\n\n bool updateAllSensors(void);\n\n\n\n // This function powers, wakes, updates values, sleeps and powers down.\n\n bool completeUpdate(void);\n\n\n\n // This function prints out the results for any connected sensors to a stream\n","file_path":"src/VariableArray.h","rank":52,"score":13.392599630738523},{"content":"void DigiXBeeWifi::disconnectInternet(void)\n\n{\n\n // Wifi XBee doesn't like to disconnect AT ALL, so we're doing nothing\n\n // If you do disconnect, you must power cycle before you can reconnect\n\n // to the same access point.\n\n}\n\n\n\n\n\n// Get the time from NIST via TIME protocol (rfc868)\n\nuint32_t DigiXBeeWifi::getNISTTime(void)\n\n{\n\n /* bail if not connected to the internet */\n\n if (!isInternetAvailable())\n\n {\n\n MS_DBG(F(\"No internet connection, cannot connect to NIST.\"));\n\n return 0;\n\n }\n\n\n\n gsmClient.stop();\n\n\n","file_path":"src/modems/DigiXBeeWifi.cpp","rank":53,"score":13.37017059341785},{"content":"\n\n#define TINY_GSM_MODEM_XBEE\n\n#ifndef TINY_GSM_RX_BUFFER\n\n#define TINY_GSM_RX_BUFFER 64\n\n#endif\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"DigiXBee.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_DIGIXBEEWIFI_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n","file_path":"src/modems/DigiXBeeWifi.h","rank":54,"score":13.23311215094699},{"content":"\n\n#define TINY_GSM_MODEM_SARAR4\n\n#ifndef TINY_GSM_RX_BUFFER\n\n#define TINY_GSM_RX_BUFFER 64\n\n#endif\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"DigiXBee.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_DIGIXBEELTEBYPASS_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n","file_path":"src/modems/DigiXBeeLTEBypass.h","rank":55,"score":13.23311215094699},{"content":"\n\n#define TINY_GSM_MODEM_UBLOX\n\n#ifndef TINY_GSM_RX_BUFFER\n\n#define TINY_GSM_RX_BUFFER 64\n\n#endif\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"DigiXBee.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_DIGIXBEE3GBYPASS_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n","file_path":"src/modems/DigiXBee3GBypass.h","rank":56,"score":13.23311215094699},{"content":"\n\n#define TINY_GSM_MODEM_XBEE\n\n#ifndef TINY_GSM_RX_BUFFER\n\n#define TINY_GSM_RX_BUFFER 64\n\n#endif\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"DigiXBee.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_DIGIXBEECELLULARTRANSPARENT_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n","file_path":"src/modems/DigiXBeeCellularTransparent.h","rank":57,"score":13.23311215094699},{"content":"ProcessorStats::~ProcessorStats(){}\n\n\n\n\n\nString ProcessorStats::getSensorLocation(void) {return BOARD;}\n\n\n\n\n\n#if defined(ARDUINO_ARCH_SAMD)\n\n extern \"C\" char *sbrk(int i);\n\n\n\n int16_t FreeRam () {\n\n char stack_dummy = 0;\n\n return &stack_dummy - sbrk(0);\n\n }\n\n#endif\n\n\n\n\n\nbool ProcessorStats::addSingleMeasurementResult(void)\n\n{\n\n // Get the battery voltage\n\n MS_DBG(F(\"Getting battery voltage\"));\n","file_path":"src/sensors/ProcessorStats.cpp","rank":61,"score":12.815884773002898},{"content":"// Time until system and digital pins are operational\n\n#define ESP8266_ATRESPONSE_TIME_MS 350\n\n\n\n// How long we're willing to wait to get signal quality\n\n#define ESP8266_SIGNALQUALITY_TIME_MS 15000L\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"LoggerModem.h\"\n\n#include \"TinyGsmClient.h\"\n\n\n\n#ifdef MS_ESPRESSIFESP8266_DEBUG_DEEP\n\n#include <StreamDebugger.h>\n\n#endif\n\n\n\n\n","file_path":"src/modems/EspressifESP8266.h","rank":62,"score":12.796491210741507},{"content":"/*\n\n *DigiXBeeWifi.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for Digi S6B Wifi XBee's\n\n*/\n\n\n\n// Included DependenciesV\n\n#include \"DigiXBeeWifi.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n\n\n// Constructor/Destructor\n\nDigiXBeeWifi::DigiXBeeWifi(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *ssid, const char *pwd,\n\n uint8_t measurementsToAverage)\n","file_path":"src/modems/DigiXBeeWifi.cpp","rank":63,"score":12.793859947930567},{"content":" void printSensorData(Stream *stream = &Serial);\n\n\n\nprotected:\n\n uint8_t _variableCount;\n\n uint8_t _sensorCount;\n\n uint8_t _maxSamplestoAverage;\n\n\n\nprivate:\n\n bool isLastVarFromSensor(int arrayIndex);\n\n uint8_t countMaxToAverage(void);\n\n bool checkVariableUUIDs(void);\n\n\n\n#ifdef MS_VARIABLEARRAY_DEBUG_DEEP\n\n template<typename T>\n\n void prettyPrintArray(T arrayToPrint[])\n\n {\n\n DEEP_DEBUGGING_SERIAL_OUTPUT.print(\"[,\\t\");\n\n for (uint8_t i = 0; i < _variableCount; i++)\n\n {\n\n DEEP_DEBUGGING_SERIAL_OUTPUT.print(arrayToPrint[i]);\n","file_path":"src/VariableArray.h","rank":64,"score":12.685448423120109},{"content":" ~SodaqUBeeR410M();\n\n\n\n bool connectInternet(uint32_t maxConnectionTime = 50000L) override;\n\n void disconnectInternet(void) override;\n\n\n\n // Get values by other names\n\n bool getModemSignalQuality(int16_t &rssi, int16_t &percent) override;\n\n bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\n\n float getModemTemperature(void) override;\n\n\n\n uint32_t getNISTTime(void) override;\n\n\n\n void modemHardReset(void) override;\n\n void modemPowerUp(void) override;\n\n\n\n #ifdef MS_SODAQUBEER410M_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n","file_path":"src/modems/SodaqUBeeR410M.h","rank":65,"score":12.5889922793545},{"content":"/*\n\n *SequansMonarch.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for the Botletics and other modules based on the SIMCOM BG96.\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"SequansMonarch.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n\n\n// Constructor\n\nSequansMonarch::SequansMonarch(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n","file_path":"src/modems/SequansMonarch.cpp","rank":66,"score":12.51433383088842},{"content":"/*\n\n *QuectelBG96.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for the Botletics and other modules based on the SIMCOM BG96.\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"QuectelBG96.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n\n\n// Constructor\n\nQuectelBG96::QuectelBG96(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n","file_path":"src/modems/QuectelBG96.cpp","rank":67,"score":12.51433383088842},{"content":"/*\n\n *Sodaq2GBeeR6.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is the Sodaq 2GBee revisions 6 and higher - these are based on\n\n *the SIMCOM SIM800h.\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"Sodaq2GBeeR6.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n\n\n// Constructor\n\nSodaq2GBeeR6::Sodaq2GBeeR6(Stream *modemStream,\n\n int8_t powerPin, int8_t statusPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n","file_path":"src/modems/Sodaq2GBeeR6.cpp","rank":68,"score":12.357497634309837},{"content":"/*\n\n *SIMComSIM7000.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for the Botletics and other modules based on the SIMCOM SIM7000.\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"SIMComSIM7000.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n\n\n// Constructor\n\nSIMComSIM7000::SIMComSIM7000(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n","file_path":"src/modems/SIMComSIM7000.cpp","rank":69,"score":12.306152924293865},{"content":" uint8_t measurementsToAverage = 1);\n\n ~Sodaq2GBeeR6();\n\n\n\n bool connectInternet(uint32_t maxConnectionTime = 50000L) override;\n\n void disconnectInternet(void) override;\n\n\n\n // Get values by other names\n\n bool getModemSignalQuality(int16_t &rssi, int16_t &percent) override;\n\n bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\n\n float getModemTemperature(void) override;\n\n\n\n uint32_t getNISTTime(void) override;\n\n\n\n void setVRefPin(int8_t vRefPin);\n\n\n\n #ifdef MS_SODAQ2GBEER6_DEBUG_DEEP\n\n StreamDebugger _modemATDebugger;\n\n #endif\n\n\n\n TinyGsm gsmModem;\n","file_path":"src/modems/Sodaq2GBeeR6.h","rank":71,"score":12.181131531809609},{"content":" {\n\n dtRowHeader += _loggerTimeZone;\n\n }\n\n STREAM_CSV_ROW(dtRowHeader, getVarCodeAtI(i));\n\n}\n\n\n\n\n\n// This prints a comma separated list of volues of sensor data - including the\n\n// time - out over an Arduino stream\n\nvoid Logger::printSensorDataCSV(Stream *stream)\n\n{\n\n String csvString = \"\";\n\n dtFromEpoch(Logger::markedEpochTime).addToString(csvString);\n\n csvString += ',';\n\n stream->print(csvString);\n\n for (uint8_t i = 0; i < getArrayVarCount(); i++)\n\n {\n\n stream->print(getValueStringAtI(i));\n\n if (i + 1 != getArrayVarCount())\n\n {\n","file_path":"src/LoggerBase.cpp","rank":72,"score":11.868140886923143},{"content":"/*\n\n *SodaqUBeeU201.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is the Sodaq UBee based on the u-blox SARA U201 3G Cellular Module\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"SodaqUBeeU201.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n\n\n// Constructor\n\nSodaqUBeeU201::SodaqUBeeU201(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n","file_path":"src/modems/SodaqUBeeU201.cpp","rank":73,"score":11.816754448477917},{"content":" return true;\n\n }\n\n}\n\n\n\n\n\nbool SodaqUBeeR410M::extraModemSetup(void)\n\n{\n\n gsmModem.init();\n\n gsmClient.init(&gsmModem);\n\n _modemName = gsmModem.getModemName();\n\n // Set to only use LTE-M, which should cause connection more quickly\n\n gsmModem.sendAT(GF(\"+URAT=7\"));\n\n gsmModem.waitResponse();\n\n return true;\n\n}\n\n\n\n\n\nvoid SodaqUBeeR410M::modemHardReset(void)\n\n{\n\n if (_modemResetPin >= 0)\n","file_path":"src/modems/SodaqUBeeR410M.cpp","rank":74,"score":11.658268959404687},{"content":" gsmModem.commandMode();\n\n if (!gsmModem.isNetworkConnected())\n\n {\n\n MS_DBG(F(\"No internet connection, cannot connect to NIST.\"));\n\n gsmModem.exitCommand();\n\n return 0;\n\n }\n\n\n\n // We can get the NIST timestamp directly from the XBee\n\n gsmModem.sendAT(GF(\"DT0\"));\n\n String res = gsmModem.readResponseString();\n\n gsmModem.exitCommand();\n\n MS_DBG(F(\"Raw hex response from XBee:\"), res);\n\n char buf[9] = {0,};\n\n res.toCharArray(buf, 9);\n\n uint32_t secFrom2000 = strtol(buf, 0, 16);\n\n MS_DBG(F(\"Seconds from Jan 1, 2000 from XBee (UTC):\"), secFrom2000);\n\n\n\n // Convert from seconds since Jan 1, 2000 to 1970\n\n uint32_t unixTimeStamp = secFrom2000 + 946684800 ;\n","file_path":"src/modems/DigiXBeeCellularTransparent.cpp","rank":75,"score":11.655615167045275},{"content":"/*\n\n *dataPublisherBase.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is a skeleton for sending out remote data.\n\n*/\n\n#include \"dataPublisherBase.h\"\n\n\n\nchar dataPublisher::txBuffer[MS_SEND_BUFFER_SIZE] = {'\\0'};\n\n\n\n// Basic chunks of HTTP\n\nconst char *dataPublisher::getHeader = \"GET \";\n\nconst char *dataPublisher::postHeader = \"POST \";\n\nconst char *dataPublisher::HTTPtag = \" HTTP/1.1\";\n\nconst char *dataPublisher::hostHeader = \"\\r\\nHost: \";\n\n\n\n// Constructors\n\ndataPublisher::dataPublisher()\n","file_path":"src/dataPublisherBase.cpp","rank":76,"score":11.62540503940601},{"content":" /* Try up to 12 times to get a timestamp from NIST */\n\n for (uint8_t i = 0; i < 12; i++)\n\n {\n\n\n\n /* Must ensure that we do not ping the daylight more than once every 4 seconds */\n\n /* NIST clearly specifies here that this is a requirement for all software */\n\n /* that accesses its servers: https://tf.nist.gov/tf-cgi/servers.cgi */\n\n while (millis() < _lastNISTrequest + 4000)\n\n {\n\n }\n\n\n\n /* Make TCP connection */\n\n MS_DBG(F(\"\\nConnecting to NIST daytime Server\"));\n\n bool connectionMade = false;\n\n\n\n /* This is the IP address of time-e-wwv.nist.gov */\n\n /* XBee's address lookup falters on time.nist.gov */\n\n IPAddress ip(132, 163, 97, 6);\n\n connectionMade = gsmClient.connect(ip, 37);\n\n /* Wait again so NIST doesn't refuse us! */\n","file_path":"src/modems/DigiXBeeWifi.cpp","rank":77,"score":11.565867710203573},{"content":"const int ThingSpeakPublisher::mqttPort = 1883;\n\nconst char *ThingSpeakPublisher::mqttClient = THING_SPEAK_CLIENT_NAME;\n\nconst char *ThingSpeakPublisher::mqttUser = THING_SPEAK_USER_NAME;\n\n\n\n\n\n// Constructors\n\nThingSpeakPublisher::ThingSpeakPublisher()\n\n : dataPublisher()\n\n{\n\n // MS_DBG(F(\"ThingSpeakPublisher object created\"));\n\n}\n\nThingSpeakPublisher::ThingSpeakPublisher(Logger& baseLogger,\n\n uint8_t sendEveryX, uint8_t sendOffset)\n\n : dataPublisher(baseLogger, sendEveryX, sendOffset)\n\n{\n\n // MS_DBG(F(\"ThingSpeakPublisher object created\"));\n\n}\n\nThingSpeakPublisher::ThingSpeakPublisher(Logger& baseLogger, Client *inClient,\n\n uint8_t sendEveryX, uint8_t sendOffset)\n\n : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\n","file_path":"src/publishers/ThingSpeakPublisher.cpp","rank":78,"score":11.524530397554717},{"content":" // Do NOT unset any status bits or timestamps if we didn't really power down!\n\n }\n\n}\n\n\n\n\n\n// The function to set up connection to a sensor.\n\n// By default, sets pin modes and returns true\n\nbool Sensor::setup(void)\n\n{\n\n MS_DBG(F(\"Setting up\"), getSensorName(), F(\"attached at\"),\n\n getSensorLocation(), F(\"which can return up to\"), _numReturnedVars,\n\n F(\"variable[s].\"));\n\n\n\n MS_DBG(F(\"It warms up in\"), _warmUpTime_ms, F(\"ms, is stable after\"),\n\n _stabilizationTime_ms, F(\"ms, and takes a single measurement in\"),\n\n _measurementTime_ms, F(\"ms.\"));\n\n\n\n MS_DBG(_measurementsToAverage, F(\"individual measurements will be averaged for each reading.\"));\n\n\n\n if (_powerPin >= 0) pinMode(_powerPin, OUTPUT); // NOTE: Not setting value\n","file_path":"src/SensorBase.cpp","rank":79,"score":11.469748428919587},{"content":" // is opened to the right place.\n\n // client is connected when a different socket is open\n\n if (_outClient->connected())\n\n {\n\n _outClient->stop();\n\n }\n\n\n\n // Make the MQTT connection\n\n // Note: the client id and the user name do not mean anything for ThingSpeak\n\n MS_DBG(F(\"Opening MQTT Connection\"));\n\n MS_START_DEBUG_TIMER;\n\n if (_mqttClient.connect(mqttClient, mqttUser, _thingSpeakMQTTKey))\n\n {\n\n MS_DBG(F(\"MQTT connected after\"), MS_PRINT_DEBUG_TIMER, F(\"ms\"));\n\n\n\n if (_mqttClient.publish(topicBuffer, txBuffer))\n\n {\n\n PRINTOUT(F(\"ThingSpeak topic published! Current state:\"),\n\n parseMQTTState(_mqttClient.state()));\n\n retVal = true;\n","file_path":"src/publishers/ThingSpeakPublisher.cpp","rank":80,"score":11.405952825927713},{"content":" MS_DBG(F(\"Unix Timestamp returned by NIST (UTC):\"), unixTimeStamp);\n\n\n\n // If before Jan 1, 2019 or after Jan 1, 2030, most likely an error\n\n if (unixTimeStamp < 1546300800)\n\n {\n\n return 0;\n\n }\n\n else if (unixTimeStamp > 1893456000)\n\n {\n\n return 0;\n\n }\n\n else\n\n {\n\n return unixTimeStamp;\n\n }\n\n}*/\n\nuint32_t DigiXBeeCellularTransparent::getNISTTime(void)\n\n{\n\n /* bail if not connected to the internet */\n\n if (!isInternetAvailable())\n","file_path":"src/modems/DigiXBeeCellularTransparent.cpp","rank":81,"score":11.253429386052051},{"content":"/*\n\n *DigiXBeeCellularTransparent.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for Digi Cellular XBee's\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"DigiXBeeCellularTransparent.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n// Constructor/Destructor\n\nDigiXBeeCellularTransparent::DigiXBeeCellularTransparent(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n\n : DigiXBee(powerPin, statusPin, useCTSStatus,\n","file_path":"src/modems/DigiXBeeCellularTransparent.cpp","rank":82,"score":11.23920674240296},{"content":" : Sensor(sensorName, numReturnedVars,\n\n warmUpTime_ms, stabilizationTime_ms, measurementTime_ms,\n\n powerPin, dataPin, measurementsToAverage),\n\n _SDI12Internal(dataPin)\n\n{\n\n _SDI12address = SDI12address;\n\n}\n\nSDI12Sensors::SDI12Sensors(char *SDI12address, int8_t powerPin, int8_t dataPin, uint8_t measurementsToAverage,\n\n const char *sensorName, const uint8_t numReturnedVars,\n\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms)\n\n : Sensor(sensorName, numReturnedVars,\n\n warmUpTime_ms, stabilizationTime_ms, measurementTime_ms,\n\n powerPin, dataPin, measurementsToAverage),\n\n _SDI12Internal(dataPin)\n\n{\n\n _SDI12address = *SDI12address;\n\n}\n\nSDI12Sensors::SDI12Sensors(int SDI12address, int8_t powerPin, int8_t dataPin, uint8_t measurementsToAverage,\n\n const char *sensorName, const uint8_t numReturnedVars,\n\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms)\n","file_path":"src/sensors/SDI12Sensors.cpp","rank":83,"score":11.068128517546015},{"content":"/*\n\n *DigiXBee3GBypass.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for Digi Cellular XBee's BASED ON UBLOX CHIPS in bypass mode\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"DigiXBee3GBypass.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n// Constructor/Destructor\n\nDigiXBee3GBypass::DigiXBee3GBypass(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n\n : DigiXBee(powerPin, statusPin, useCTSStatus,\n","file_path":"src/modems/DigiXBee3GBypass.cpp","rank":84,"score":11.032679949672184},{"content":"/*\n\n *DigiXBeeLTEBypass.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for Digi Cellular XBee's BASED ON UBLOX CHIPS in bypass mode\n\n*/\n\n\n\n// Included Dependencies\n\n#include \"DigiXBeeLTEBypass.h\"\n\n#include \"modems/LoggerModemMacros.h\"\n\n\n\n// Constructor/Destructor\n\nDigiXBeeLTEBypass::DigiXBeeLTEBypass(Stream* modemStream,\n\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\n\n int8_t modemResetPin, int8_t modemSleepRqPin,\n\n const char *apn,\n\n uint8_t measurementsToAverage)\n\n : DigiXBee(powerPin, statusPin, useCTSStatus,\n","file_path":"src/modems/DigiXBeeLTEBypass.cpp","rank":85,"score":11.032679949672184},{"content":" const char *ssid, const char *pwd,\n\n uint8_t measurementsToAverage,\n\n int8_t espSleepRqPin, int8_t espStatusPin)\n\n : loggerModem(powerPin, statusPin, HIGH,\n\n modemResetPin, modemSleepRqPin, true,\n\n ESP8266_STATUS_TIME_MS, ESP8266_DISCONNECT_TIME_MS,\n\n ESP8266_WARM_UP_TIME_MS, ESP8266_ATRESPONSE_TIME_MS,\n\n ESP8266_SIGNALQUALITY_TIME_MS,\n\n measurementsToAverage),\n\n #ifdef MS_ESPRESSIFESP8266_DEBUG_DEEP\n\n _modemATDebugger(*modemStream, DEEP_DEBUGGING_SERIAL_OUTPUT),\n\n gsmModem(_modemATDebugger),\n\n #else\n\n gsmModem(*modemStream),\n\n #endif\n\n gsmClient(gsmModem)\n\n{\n\n _ssid = ssid;\n\n _pwd = pwd;\n\n\n","file_path":"src/modems/EspressifESP8266.cpp","rank":86,"score":10.979233903032014},{"content":"- Find this information for your ThingSpeak account and channel and put it into logging_to_ThingSpeak.ino:\n\n\n\n```cpp\n\nconst char *thingSpeakMQTTKey = \"XXXXXXXXXXXXXXXX\"; // Your MQTT API Key from Account > MyProfile.\n\nconst char *thingSpeakChannelID = \"######\"; // The numeric channel id for your channel\n\nconst char *thingSpeakChannelKey = \"XXXXXXXXXXXXXXXX\"; // The Write API Key for your channel\n\n```\n\n\n","file_path":"examples/logging_to_ThingSpeak/ReadMe.md","rank":87,"score":10.973758547643714},{"content":" // - Use the isMeasurementComplete() to check if enough time has passed\n\n // for a measurement to have been completed.\n\n // Bit 7 - 0=No known errors, 1=Some sort of error has occurred\n\n uint8_t getStatus(void);\n\n\n\n // This does any one-time preparations needed before the sensor will be able\n\n // to take readings. May not require any action.\n\n // Generally, the sensor must be powered on for setup.\n\n virtual bool setup(void);\n\n\n\n // This updates the sensor's values\n\n // This clears the values array, starts and averages as many measurement\n\n // readings as requested, and then notifies the registered variables\n\n // of the new results. All possible waits are included in this function!\n\n virtual bool update(void);\n\n\n\n // This turns on the sensor power, if applicable\n\n // This also sets the _millisPowerOn timestamp.\n\n virtual void powerUp(void);\n\n // This turns off the sensor power, if applicable\n","file_path":"src/SensorBase.h","rank":88,"score":10.930131579724844},{"content":" #if defined(ARDUINO_ARCH_SAMD)\n\n extendedWatchDogSAMD watchDogTimer;\n\n #else\n\n extendedWatchDogAVR watchDogTimer;\n\n #endif\n\n\n\n // ===================================================================== //\n\n // Public functions for logging data to an SD card\n\n // ===================================================================== //\n\n\n\npublic:\n\n // This sets a file name, if you want to decide on it in advance\n\n void setFileName(const char *fileName);\n\n // Same as above, with a string (overload function)\n\n void setFileName(String& fileName);\n\n\n\n // This returns the current filename. Must be run after setFileName.\n\n String getFileName(void){return _fileName;}\n\n\n\n // This prints a header onto a stream - this removes need to pass around\n","file_path":"src/LoggerBase.h","rank":89,"score":10.928850761474958},{"content":" // MS_DBG(F(\"Using a Google IP to test connection...\"));\n\n // gsmClient.stop();\n\n // IPAddress ip(8, 8, 8, 8); // This is one of Google's IP's\n\n // success &= gsmClient.connect(ip, 80);\n\n // }\n\n // else\n\n // {\n\n // MS_DBG(F(\"Using last connected IP to test connection:\"));\n\n // }\n\n // gsmClient.print('!'); // Need to send something before connection is made\n\n\n\n MS_DBG(F(\"Opening connection to NIST to check connection strength...\"));\n\n // This is the IP address of time-e-wwv.nist.gov\n\n // XBee's address lookup falters on time.nist.gov\n\n IPAddress ip(132, 163, 97, 6);\n\n gsmClient.connect(ip, 37);\n\n\n\n // Unfortunately, using a ping doesn't work\n\n // gsmModem.commandMode();\n\n // gsmModem.sendAT(GF(\"PG8.8.8.8\"));\n","file_path":"src/modems/DigiXBeeWifi.cpp","rank":90,"score":10.88488831121483},{"content":" /* This is the IP address of time-e-wwv.nist.gov */\n\n /* XBee's address lookup falters on time.nist.gov */\n\n IPAddress ip(132, 163, 97, 6);\n\n connectionMade = gsmClient.connect(ip, 37, 15);\n\n /* Wait again so NIST doesn't refuse us! */\n\n delay(4000L);\n\n /* Try sending something to ensure connection */\n\n gsmClient.println('!');\n\n\n\n /* Wait up to 5 seconds for a response */\n\n if (connectionMade)\n\n {\n\n uint32_t start = millis();\n\n while (gsmClient && gsmClient.available() < 4 && millis() - start < 5000L)\n\n {\n\n }\n\n\n\n if (gsmClient.available() >= 4)\n\n {\n\n MS_DBG(F(\"NIST responded after\"), millis() - start, F(\"ms\"));\n","file_path":"src/modems/DigiXBeeCellularTransparent.cpp","rank":91,"score":10.820129393242055},{"content":"/*\n\n *SensorBase.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for the sensor base class.\n\n*/\n\n\n\n#include \"SensorBase.h\"\n\n#include \"VariableBase.h\"\n\n\n\n// ============================================================================\n\n// The class and functions for interfacing with a sensor\n\n// ============================================================================\n\n\n\n// The constructor\n\nSensor::Sensor(const char *sensorName, const uint8_t numReturnedVars,\n\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms,\n\n int8_t powerPin, int8_t dataPin, uint8_t measurementsToAverage)\n","file_path":"src/SensorBase.cpp","rank":92,"score":10.815179032717628},{"content":" : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\n\n{\n\n setMQTTKey(thingSpeakMQTTKey);\n\n setChannelID(thingSpeakChannelID);\n\n setChannelKey(thingSpeakChannelKey);\n\n // MS_DBG(F(\"ThingSpeakPublisher object created\"));\n\n}\n\n// Destructor\n\nThingSpeakPublisher::~ThingSpeakPublisher(){}\n\n\n\n\n\nvoid ThingSpeakPublisher::setMQTTKey(const char *thingSpeakMQTTKey)\n\n{\n\n _thingSpeakMQTTKey = thingSpeakMQTTKey;\n\n // MS_DBG(F(\"MQTT Key set!\"));\n\n}\n\n\n\n\n\nvoid ThingSpeakPublisher::setChannelID(const char *thingSpeakChannelID)\n\n{\n","file_path":"src/publishers/ThingSpeakPublisher.cpp","rank":93,"score":10.812328014474778},{"content":" uint8_t junkChars = _stream->available();\n\n if (junkChars)\n\n {\n\n MS_DBG(F(\"Dumping\"), junkChars, F(\"characters from MaxBotix stream buffer:\"));\n\n for (uint8_t i = 0; i < junkChars; i++)\n\n {\n\n #ifdef MS_MAXBOTIXSONAR_DEBUG\n\n DEBUGGING_SERIAL_OUTPUT.print(_stream->read());\n\n #else\n\n _stream->read();\n\n #endif\n\n }\n\n #ifdef MS_MAXBOTIXSONAR_DEBUG\n\n DEBUGGING_SERIAL_OUTPUT.println();\n\n #endif\n\n }\n\n\n\n // Check a measurement was *successfully* started (status bit 6 set)\n\n // Only go on to get a result if it was\n\n if (bitRead(_sensorStatus, 6))\n","file_path":"src/sensors/MaxBotixSonar.cpp","rank":94,"score":10.81138687077984},{"content":"// MQTT User Name\n\n// The user name doesn't actually mean anything for ThingSpeak\n\n#define THING_SPEAK_USER_NAME \"MS\"\n\n\n\n// MQTT Client Name\n\n// The client name doesn't actually mean anything for ThingSpeak\n\n#define THING_SPEAK_CLIENT_NAME \"MS\"\n\n\n\n// Included Dependencies\n\n#include \"ModSensorDebugger.h\"\n\n#undef MS_DEBUGGING_STD\n\n#include \"dataPublisherBase.h\"\n\n#include <PubSubClient.h>\n\n\n\n\n\n// ============================================================================\n\n// Functions for the EnviroDIY data portal receivers.\n\n// ============================================================================\n","file_path":"src/publishers/ThingSpeakPublisher.h","rank":95,"score":10.739933531600148},{"content":"AtlasParent::AtlasParent(int8_t powerPin, uint8_t i2cAddressHex, uint8_t measurementsToAverage,\n\n const char *sensorName, const uint8_t numReturnedVars,\n\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms)\n\n : Sensor(sensorName, numReturnedVars,\n\n warmUpTime_ms, stabilizationTime_ms, measurementTime_ms,\n\n powerPin, -1, measurementsToAverage),\n\n _i2cAddressHex(i2cAddressHex)\n\n{}\n\nAtlasParent::~AtlasParent(){}\n\n\n\n\n\nString AtlasParent::getSensorLocation(void)\n\n{\n\n String address = F(\"I2C_0x\");\n\n address += String(_i2cAddressHex, HEX);\n\n return address;\n\n}\n\n\n\n\n\nbool AtlasParent::setup(void)\n","file_path":"src/sensors/AtlasParent.cpp","rank":96,"score":10.723655853466227},{"content":" virtual void powerUp(void) override;\n\n virtual void powerDown(void) override;\n\n\n\n virtual bool addSingleMeasurementResult(void);\n\n\n\nprivate:\n\n yosemitech sensor;\n\n yosemitechModel _model;\n\n byte _modbusAddress;\n\n Stream* _stream;\n\n int8_t _RS485EnablePin;\n\n int8_t _powerPin2;\n\n};\n\n\n\n#endif // Header Guard\n","file_path":"src/sensors/YosemitechParent.h","rank":97,"score":10.633412473811397},{"content":" int16_t signalQual = -9999;\n\n percent = -9999;\n\n rssi = -9999;\n\n\n\n // The WiFi XBee needs to make an actual TCP connection and get some sort\n\n // of response on that connection before it knows the signal quality.\n\n // Connecting to the Google DNS servers - this doesn't really work\n\n // MS_DBG(F(\"Opening connection to check connection strength...\"));\n\n // bool usedGoogle = false;\n\n // if (!gsmModem.gotIPforSavedHost())\n\n // {\n\n // usedGoogle = true;\n\n // IPAddress ip(8, 8, 8, 8); // This is one of Google's IP's\n\n // gsmClient.stop();\n\n // success &= gsmClient.connect(ip, 80);\n\n // }\n\n // gsmClient.print('!'); // Need to send something before connection is made\n\n // delay(100); // Need this delay! Can get away with 50, but 100 is safer.\n\n\n\n MS_DBG(F(\"Opening connection to NIST to check connection strength...\"));\n","file_path":"src/modems/DigiXBeeWifi.cpp","rank":98,"score":10.522345503499363},{"content":"/*\n\n *DreamHostPublisher.cpp\n\n *This file is part of the EnviroDIY modular sensors library for Arduino\n\n *\n\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\n\n *\n\n *This file is for the EnviroDIY logging functions - ie, sending get requests to DreamHost\n\n*/\n\n\n\n#include \"DreamHostPublisher.h\"\n\n\n\n\n\n// ============================================================================\n\n// Functions for the SWRC Sensors DreamHost data receivers.\n\n// ============================================================================\n\n\n\n// Constant portions of the requests\n\nconst char *DreamHostPublisher::dreamhostHost = \"swrcsensors.dreamhosters.com\";\n\nconst int DreamHostPublisher::dreamhostPort = 80;\n\nconst char *DreamHostPublisher::loggerTag = \"?LoggerID=\";\n","file_path":"src/publishers/DreamHostPublisher.cpp","rank":99,"score":10.488442831837137}],"string":"[\n {\n \"content\": \" // Returns the data destination\\n\\n virtual String getEndpoint(void){return String(enviroDIYHost);}\\n\\n\\n\\n // Adds the site registration token\\n\\n void setToken(const char *registrationToken);\\n\\n\\n\\n // Calculates how long the JSON will be\\n\\n uint16_t calculateJsonSize();\\n\\n // Calculates how long the full post request will be, including headers\\n\\n // uint16_t calculatePostSize();\\n\\n\\n\\n // This generates a properly formatted JSON for EnviroDIY\\n\\n void printSensorDataJSON(Stream *stream);\\n\\n\\n\\n // This prints a fully structured post request for WikiWatershed/EnviroDIY\\n\\n // to the specified stream.\\n\\n void printEnviroDIYRequest(Stream *stream);\\n\\n\\n\\n // A way to begin with everything already set\\n\\n void begin(Logger& baseLogger, Client *inClient,\\n\",\n \"file_path\": \"src/publishers/EnviroDIYPublisher.h\",\n \"rank\": 0,\n \"score\": 32.17999685936584\n },\n {\n \"content\": \" const char *registrationToken,\\n\\n const char *samplingFeatureUUID);\\n\\n void begin(Logger& baseLogger,\\n\\n const char *registrationToken,\\n\\n const char *samplingFeatureUUID);\\n\\n\\n\\n // This utilizes an attached modem to make a TCP connection to the\\n\\n // EnviroDIY/ODM2DataSharingPortal and then streams out a post request\\n\\n // over that connection.\\n\\n // The return is the http status code of the response.\\n\\n // int16_t postDataEnviroDIY(void);\\n\\n virtual int16_t publishData(Client *_outClient);\\n\\n\\n\\nprotected:\\n\\n\\n\\n // portions of the POST request\\n\\n static const char *postEndpoint;\\n\\n static const char *enviroDIYHost;\\n\\n static const int enviroDIYPort;\\n\\n static const char *tokenHeader;\\n\",\n \"file_path\": \"src/publishers/EnviroDIYPublisher.h\",\n \"rank\": 2,\n \"score\": 24.53143885601537\n },\n {\n \"content\": \" // over that connection.\\n\\n // The return is the http status code of the response.\\n\\n // int16_t postDataDreamHost(void);\\n\\n int16_t publishData(Client *_outClient);\\n\\n\\n\\nprotected:\\n\\n // portions of the GET request\\n\\n static const char *dreamhostHost;\\n\\n static const int dreamhostPort;\\n\\n static const char *loggerTag;\\n\\n static const char *timestampTagDH;\\n\\n\\n\\n\\n\\nprivate:\\n\\n const char *_DreamHostPortalRX;\\n\\n bool _dualPost = true;\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/publishers/DreamHostPublisher.h\",\n \"rank\": 3,\n \"score\": 24.460661049608365\n },\n {\n \"content\": \" virtual String getEndpoint(void){return String(dreamhostHost);}\\n\\n\\n\\n // Functions for private SWRC server\\n\\n void setDreamHostPortalRX(const char *dhUrl);\\n\\n\\n\\n // This creates all of the URL parameters\\n\\n void printSensorDataDreamHost(Stream *stream);\\n\\n\\n\\n // This prints a fully structured GET request for DreamHost to the\\n\\n // specified stream.\\n\\n void printDreamHostRequest(Stream *stream);\\n\\n\\n\\n // A way to begin with everything already set\\n\\n void begin(Logger& baseLogger, Client *inClient,\\n\\n const char *dhUrl);\\n\\n void begin(Logger& baseLogger,\\n\\n const char *dhUrl);\\n\\n\\n\\n // This utilizes an attached modem to make a TCP connection to the\\n\\n // DreamHost URL and then streams out a get request\\n\",\n \"file_path\": \"src/publishers/DreamHostPublisher.h\",\n \"rank\": 4,\n \"score\": 22.599926395645127\n },\n {\n \"content\": \" virtual int16_t publishData(Client *_outClient) = 0;\\n\\n virtual int16_t publishData();\\n\\n // These are duplicates of the above functions for backwards compatibility\\n\\n virtual int16_t sendData(Client *_outClient);\\n\\n virtual int16_t sendData();\\n\\n\\n\\n // This spits out a string description of the PubSubClient codes\\n\\n String parseMQTTState(int state);\\n\\n\\n\\n\\n\\nprotected:\\n\\n // The internal logger instance\\n\\n Logger *_baseLogger;\\n\\n // The internal client\\n\\n Client *_inClient;\\n\\n\\n\\n static char txBuffer[MS_SEND_BUFFER_SIZE];\\n\\n // This returns the number of empty spots in the buffer\\n\\n static int bufferFree(void);\\n\\n // This fills the TX buffer with nulls ('\\\\0')\\n\",\n \"file_path\": \"src/dataPublisherBase.h\",\n \"rank\": 7,\n \"score\": 19.57542693015288\n },\n {\n \"content\": \"\\n\\n\\n\\n// Empties the outgoing buffer\\n\\nvoid dataPublisher::emptyTxBuffer(void)\\n\\n{\\n\\n MS_DBG(F(\\\"Dumping the TX Buffer\\\"));\\n\\n for (int i = 0; i < MS_SEND_BUFFER_SIZE; i++)\\n\\n {\\n\\n txBuffer[i] = '\\\\0';\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n// Returns how much space is left in the buffer\\n\\nint dataPublisher::bufferFree(void)\\n\\n{\\n\\n MS_DBG(F(\\\"Current TX Buffer Size:\\\"), strlen(txBuffer));\\n\\n return MS_SEND_BUFFER_SIZE - strlen(txBuffer);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dataPublisherBase.cpp\",\n \"rank\": 9,\n \"score\": 18.39006492527985\n },\n {\n \"content\": \" stream->print(dreamhostHost);\\n\\n stream->print(F(\\\"\\\\r\\\\n\\\\r\\\\n\\\"));\\n\\n}\\n\\n\\n\\n\\n\\n// A way to begin with everything already set\\n\\nvoid DreamHostPublisher::begin(Logger& baseLogger, Client *inClient,\\n\\n const char *dhUrl)\\n\\n{\\n\\n setDreamHostPortalRX(dhUrl);\\n\\n dataPublisher::begin(baseLogger, inClient);\\n\\n}\\n\\nvoid DreamHostPublisher::begin(Logger& baseLogger,\\n\\n const char *dhUrl)\\n\\n{\\n\\n setDreamHostPortalRX(dhUrl);\\n\\n dataPublisher::begin(baseLogger);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/publishers/DreamHostPublisher.cpp\",\n \"rank\": 10,\n \"score\": 18.062825779343115\n },\n {\n \"content\": \" const char *thingSpeakMQTTKey,\\n\\n const char *thingSpeakChannelID,\\n\\n const char *thingSpeakChannelKey);\\n\\n void begin(Logger& baseLogger,\\n\\n const char *thingSpeakMQTTKey,\\n\\n const char *thingSpeakChannelID,\\n\\n const char *thingSpeakChannelKey);\\n\\n\\n\\n // This sends the data to ThingSpeak\\n\\n // bool mqttThingSpeak(void);\\n\\n virtual int16_t publishData(Client *_outClient);\\n\\n\\n\\nprotected:\\n\\n static const char *mqttServer;\\n\\n static const int mqttPort;\\n\\n static const char *mqttClient;\\n\\n static const char *mqttUser;\\n\\n\\n\\nprivate:\\n\\n // Keys for ThingSpeak\\n\\n const char *_thingSpeakMQTTKey;\\n\\n const char *_thingSpeakChannelID;\\n\\n const char *_thingSpeakChannelKey;\\n\\n PubSubClient _mqttClient;\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.h\",\n \"rank\": 12,\n \"score\": 17.868425081164503\n },\n {\n \"content\": \" virtual ~ThingSpeakPublisher();\\n\\n\\n\\n // Returns the data destination\\n\\n virtual String getEndpoint(void){return String(mqttServer);}\\n\\n\\n\\n // Adds the MQTT API Key from Account > MyProfile\\n\\n void setMQTTKey(const char *thingSpeakMQTTKey);\\n\\n\\n\\n // Adds the channel ID\\n\\n void setChannelID(const char *thingSpeakChannelID);\\n\\n\\n\\n // Adds the channel Write API Key.\\n\\n void setChannelKey(const char *thingSpeakChannelKey);\\n\\n\\n\\n // Sets all 3 ThingSpeak parameters\\n\\n void setThingSpeakParams(const char *MQTTKey, const char *channelID,\\n\\n const char *channelKey);\\n\\n\\n\\n // A way to begin with everything already set\\n\\n void begin(Logger& baseLogger, Client *inClient,\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.h\",\n \"rank\": 13,\n \"score\": 17.67449302038462\n },\n {\n \"content\": \" // static const char *cacheHeader;\\n\\n // static const char *connectionHeader;\\n\\n static const char *contentLengthHeader;\\n\\n static const char *contentTypeHeader;\\n\\n\\n\\n // portions of the JSON\\n\\n static const char *samplingFeatureTag;\\n\\n static const char *timestampTag;\\n\\n\\n\\nprivate:\\n\\n // Tokens and UUID's for EnviroDIY\\n\\n const char *_registrationToken;\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/publishers/EnviroDIYPublisher.h\",\n \"rank\": 14,\n \"score\": 17.592894556741083\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_DIGIXBEE3GBYPASS_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool extraModemSetup(void) override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/DigiXBee3GBypass.h\",\n \"rank\": 15,\n \"score\": 16.854918042446645\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_DIGIXBEELTEBYPASS_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool extraModemSetup(void) override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/DigiXBeeLTEBypass.h\",\n \"rank\": 16,\n \"score\": 16.85491804244665\n },\n {\n \"content\": \" {\\n\\n MS_DBG(F(\\\"Response Byte\\\"), i, ':', (char)nistBytes[i],\\n\\n '=', nistBytes[i], '=', String(nistBytes[i], BIN));\\n\\n secFrom1900 += 0x000000FF & nistBytes[i];\\n\\n /* MS_DBG(F(\\\"\\\\nseconds from 1900 after byte:\\\"),String(secFrom1900, BIN)); */\\n\\n if (i + 1 < 4)\\n\\n {\\n\\n secFrom1900 = secFrom1900 << 8;\\n\\n }\\n\\n }\\n\\n MS_DBG(F(\\\"Seconds from Jan 1, 1900 returned by NIST (UTC):\\\"),\\n\\n secFrom1900, '=', String(secFrom1900, BIN));\\n\\n\\n\\n /* Close the TCP connection, just in case */\\n\\n /* Don't close connection! It takes too long and then the time stamp is out of date! */\\n\\n /*gsmClient.stop(15000L);*/\\n\\n\\n\\n /* Return the timestamp */\\n\\n uint32_t unixTimeStamp = secFrom1900 - 2208988800;\\n\\n MS_DBG(F(\\\"Unix Timestamp returned by NIST (UTC):\\\"), unixTimeStamp);\\n\",\n \"file_path\": \"src/LoggerModem.cpp\",\n \"rank\": 17,\n \"score\": 16.764558089948963\n },\n {\n \"content\": \" bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\\n\\n float getModemTemperature(void) override;\\n\\n\\n\\n uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_DIGIXBEEWIFI_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool extraModemSetup(void) override;\\n\\n\\n\\nprivate:\\n\\n const char *_ssid;\\n\\n const char *_pwd;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.h\",\n \"rank\": 18,\n \"score\": 16.698117003001045\n },\n {\n \"content\": \"// Send Buffer\\n\\n// This determines how many characters to set out at once over the TCP/UDP\\n\\n// connection. Increasing this may decrease data use by a loger, while\\n\\n// decreasing it will save memory. Do not make it smaller than 47 (to keep all\\n\\n// variable values with their UUID's) or bigger than 1500 (a typical TCP/UDP\\n\\n// Maximum Transmission Unit).\\n\\n#ifndef MS_SEND_BUFFER_SIZE\\n\\n#define MS_SEND_BUFFER_SIZE 750\\n\\n#endif\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerBase.h\\\"\\n\\n#include \\\"Client.h\\\"\\n\\n\\n\",\n \"file_path\": \"src/dataPublisherBase.h\",\n \"rank\": 19,\n \"score\": 16.69035446327213\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_SEQUANSMONARCH_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/SequansMonarch.h\",\n \"rank\": 20,\n \"score\": 16.362239264802074\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_SODAQUBEEU201_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/SodaqUBeeU201.h\",\n \"rank\": 21,\n \"score\": 16.362239264802074\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n void modemPowerUp(void) override;\\n\\n\\n\\n #ifdef MS_SIMCOMSIM7000_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/SIMComSIM7000.h\",\n \"rank\": 22,\n \"score\": 16.268988767805173\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_SIMCOMSIM800_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\n void modemPowerUp(void) override;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/SIMComSIM800.h\",\n \"rank\": 23,\n \"score\": 16.268988767805173\n },\n {\n \"content\": \" uint32_t getNISTTime(void) override;\\n\\n\\n\\n void modemPowerUp(void) override;\\n\\n\\n\\n #ifdef MS_QUECTELBG96_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/QuectelBG96.h\",\n \"rank\": 24,\n \"score\": 16.268988767805173\n },\n {\n \"content\": \" virtual void disconnectInternet(void) = 0;\\n\\n\\n\\n // Get values by other names\\n\\n virtual bool getModemSignalQuality(int16_t &rssi, int16_t &percent) = 0;\\n\\n virtual bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) = 0;\\n\\n virtual float getModemTemperature(void) = 0;\\n\\n\\n\\n // This has the same functionality as Client->connect with debugging text\\n\\n // int16_t openTCP(const char *host, uint16_t port);\\n\\n // This has the same functionality as Client->connect with debugging text\\n\\n // int16_t openTCP(IPAddress ip, uint16_t port);\\n\\n // This has the same functionality as Client->close with debugging text\\n\\n // void closeTCP(void);\\n\\n\\n\\n // Special sleep and power function for the modem\\n\\n // Note: modemPowerDown() simply kills power, while modemSleepPowerDown()\\n\\n // allows for graceful shut down. You should use modemSleepPowerDown()\\n\\n // whenever possible.\\n\\n virtual void modemPowerUp(void);\\n\\n virtual void modemPowerDown(void);\\n\",\n \"file_path\": \"src/LoggerModem.h\",\n \"rank\": 25,\n \"score\": 16.20371852762566\n },\n {\n \"content\": \"// Post the data to dream host.\\n\\n// int16_t DreamHostPublisher::postDataDreamHost(void)\\n\\nint16_t DreamHostPublisher::publishData(Client *_outClient)\\n\\n{\\n\\n // Create a buffer for the portions of the request and response\\n\\n char tempBuffer[37] = \\\"\\\";\\n\\n uint16_t did_respond = 0;\\n\\n\\n\\n // Open a TCP/IP connection to DreamHost\\n\\n MS_DBG(F(\\\"Connecting client\\\"));\\n\\n MS_START_DEBUG_TIMER ;\\n\\n if (_outClient->connect(dreamhostHost, dreamhostPort))\\n\\n {\\n\\n MS_DBG(F(\\\"Client connected after\\\"), MS_PRINT_DEBUG_TIMER, F(\\\"ms\\\\n\\\"));\\n\\n\\n\\n // copy the initial post header into the tx buffer\\n\\n strcpy(txBuffer, getHeader);\\n\\n\\n\\n // add in the dreamhost receiver URL\\n\\n strcat(txBuffer, _DreamHostPortalRX);\\n\",\n \"file_path\": \"src/publishers/DreamHostPublisher.cpp\",\n \"rank\": 27,\n \"score\": 15.959095946784327\n },\n {\n \"content\": \" static void emptyTxBuffer(void);\\n\\n // This writes the TX buffer to a stream and also to the debugging port\\n\\n static void printTxBuffer(Stream *stream, bool addNewLine = false);\\n\\n\\n\\n uint8_t _sendEveryX;\\n\\n uint8_t _sendOffset;\\n\\n\\n\\n // Basic chunks of HTTP\\n\\n static const char *getHeader;\\n\\n static const char *postHeader;\\n\\n static const char *HTTPtag;\\n\\n static const char *hostHeader;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/dataPublisherBase.h\",\n \"rank\": 28,\n \"score\": 15.524654278413461\n },\n {\n \"content\": \"// Functions for private SWRC server\\n\\nvoid DreamHostPublisher::setDreamHostPortalRX(const char *dhUrl)\\n\\n{\\n\\n _DreamHostPortalRX = dhUrl;\\n\\n // MS_DBG(F(\\\"Dreamhost portal URL set!\\\"));\\n\\n}\\n\\n\\n\\n\\n\\n// This prints the URL out to an Arduino stream\\n\\nvoid DreamHostPublisher::printSensorDataDreamHost(Stream *stream)\\n\\n{\\n\\n stream->print(_DreamHostPortalRX);\\n\\n stream->print(loggerTag);\\n\\n stream->print(_baseLogger->getLoggerID());\\n\\n stream->print(timestampTagDH);\\n\\n stream->print(String(Logger::markedEpochTime - 946684800)); // Correct time from epoch to y2k\\n\\n\\n\\n for (uint8_t i = 0; i < _baseLogger->getArrayVarCount(); i++)\\n\\n {\\n\\n stream->print('&');\\n\",\n \"file_path\": \"src/publishers/DreamHostPublisher.cpp\",\n \"rank\": 29,\n \"score\": 15.468793489145343\n },\n {\n \"content\": \" // Sets the parameters for frequency of sending and any offset, if needed\\n\\n // NOTE: These parameters are not currently used!!\\n\\n void setSendFrequency(uint8_t sendEveryX, uint8_t sendOffset);\\n\\n\\n\\n // \\\"Begins\\\" the publisher - attaches client and logger\\n\\n // Not doing this in the constructor because we expect the publishers to be\\n\\n // created in the \\\"global scope\\\" and we cannot control the order in which\\n\\n // objects in that global scope will be created. That is, we cannot\\n\\n // guarantee that the logger will actually be created before the publisher\\n\\n // that wants to attach to it unless we wait to attach the publisher until\\n\\n // in the setup or loop function of the main program.\\n\\n void begin(Logger& baseLogger, Client *inClient);\\n\\n void begin(Logger& baseLogger);\\n\\n\\n\\n // Returns the data destination\\n\\n virtual String getEndpoint(void) = 0;\\n\\n\\n\\n // This opens a socket to the correct receiver and sends out the formatted data\\n\\n // This depends on an internet connection already being made and a client\\n\\n // being available\\n\",\n \"file_path\": \"src/dataPublisherBase.h\",\n \"rank\": 30,\n \"score\": 15.38245267880804\n },\n {\n \"content\": \" arrayOfVars[i]->parentSensor->averageMeasurements();\\n\\n MS_DBG(F(\\\"--- Notifying variables from\\\"),\\n\\n arrayOfVars[i]->getParentSensorNameAndLocation(), F(\\\"---\\\"));\\n\\n arrayOfVars[i]->parentSensor->notifyVariables();\\n\\n }\\n\\n }\\n\\n MS_DBG(F(\\\"... Complete. <<-----\\\"));\\n\\n\\n\\n return success;\\n\\n}\\n\\n\\n\\n\\n\\n// This function prints out the results for any connected sensors to a stream\\n\\n// Calculated variable results will be included\\n\\nvoid VariableArray::printSensorData(Stream *stream)\\n\\n{\\n\\n for (uint8_t i = 0; i < _variableCount; i++)\\n\\n {\\n\\n if (arrayOfVars[i]->isCalculated)\\n\\n {\\n\",\n \"file_path\": \"src/VariableArray.cpp\",\n \"rank\": 31,\n \"score\": 15.136111407615282\n },\n {\n \"content\": \" bool getModemSignalQuality(int16_t &rssi, int16_t &percent) override;\\n\\n bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\\n\\n float getModemTemperature(void) override;\\n\\n\\n\\n uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_DIGIXBEECELLULARTRANSPARENT_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool extraModemSetup(void) override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/DigiXBeeCellularTransparent.h\",\n \"rank\": 32,\n \"score\": 15.06032583927012\n },\n {\n \"content\": \" // very long string objects which can crash the logger\\n\\n virtual void printFileHeader(Stream *stream);\\n\\n\\n\\n // This prints a comma separated list of volues of sensor data - including the\\n\\n // time - out over an Arduino stream\\n\\n void printSensorDataCSV(Stream *stream);\\n\\n\\n\\n // These functions create a file on an SD card and set the created/modified/\\n\\n // accessed timestamps in that file.\\n\\n // The filename may either be the one automatically generated by the logger\\n\\n // id and the date, the one set by setFileName(String), or can be specified\\n\\n // in the function.\\n\\n // If asked to, these functions will also write a header to the file based\\n\\n // on the variable information from the variable array.\\n\\n // This can be used to force a logger to create a file with a secondary file name.\\n\\n bool createLogFile(String& filename, bool writeDefaultHeader = false);\\n\\n bool createLogFile(bool writeDefaultHeader = false);\\n\\n\\n\\n // These functions create a file on an SD card and set the modified/accessed\\n\\n // timestamps in that file.\\n\",\n \"file_path\": \"src/LoggerBase.h\",\n \"rank\": 33,\n \"score\": 14.79451162481104\n },\n {\n \"content\": \" bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\\n\\n float getModemTemperature(void) override;\\n\\n\\n\\n uint32_t getNISTTime(void) override;\\n\\n\\n\\n #ifdef MS_ESPRESSIFESP8266_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\\n TinyGsmClient gsmClient;\\n\\n\\n\\n // Need the stream for tossing junk on boot\\n\\n Stream *_modemStream;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\",\n \"file_path\": \"src/modems/EspressifESP8266.h\",\n \"rank\": 34,\n \"score\": 14.583016654028008\n },\n {\n \"content\": \"{\\n\\n return publishData(_outClient);\\n\\n}\\n\\nint16_t dataPublisher::sendData()\\n\\n{\\n\\n return publishData();\\n\\n}\\n\\n\\n\\n\\n\\n// This spits out a string description of the PubSubClient codes\\n\\nString dataPublisher::parseMQTTState(int state)\\n\\n{\\n\\n // // Possible values for client.state()\\n\\n // #define MQTT_CONNECTION_TIMEOUT -4\\n\\n // #define MQTT_CONNECTION_LOST -3\\n\\n // #define MQTT_CONNECT_FAILED -2\\n\\n // #define MQTT_DISCONNECTED -1\\n\\n // #define MQTT_CONNECTED 0\\n\\n // #define MQTT_CONNECT_BAD_PROTOCOL 1\\n\\n // #define MQTT_CONNECT_BAD_CLIENT_ID 2\\n\",\n \"file_path\": \"src/dataPublisherBase.cpp\",\n \"rank\": 35,\n \"score\": 14.551130339155081\n },\n {\n \"content\": \"\\n\\n### Example for the CUAHSI Workshop\\n\\n\\n\\n### To Do:\\n\\n\\n\\n1. Give your logger a name in line 49 by replacing the x's with your own logger id:\\n\\n\\n\\n```cpp\\n\\nconst char *LoggerID = \\\"XXXXX\\\";\\n\\n```\\n\\n\\n\\n2. Fill in the correct WiFi Id and Password in lines 119 and 120:\\n\\n\\n\\n```cpp\\n\\nconst char *wifiId = \\\"xxxxx\\\"; // The WiFi access point, unnecessary for gprs\\n\\nconst char *wifiPwd = \\\"xxxxx\\\"; // The password for connecting to WiFi, unnecessary for gprs\\n\\n```\\n\\n\\n\\n\\n\\n3. Verify your sensor attachment pins:\\n\\n - CTD is connected to the D6-7 plug (line 159, SDI-12 data on pin 7)\\n\\n - Maxim DS18 is connected to the D4-5 plug (line 212, OneWire bus on pin 4)\\n\\n - Ultrasonic is connected to the D10-11 plug (line 79, software data Rx on pin 11)\\n\\n\\n\\n4. If using ultrasonic, and interested in water depth instead of distance to the water, create a calculated variable for water depth by uncommenting lines 211, 236-259 and 281-282 and commenting out line 275.\\n\\n\\n\\n5. Fill out all of the variable UUID's\\n\\n - lines 269 - 280, 211, and 253 as applicable\\n\\n\\n\\n6. Fill out your registration token and sampling feature UUID in lines 305-306:\\n\\n\\n\\n```cpp\\n\\nconst char *registrationToken = \\\"12345678-abcd-1234-ef00-1234567890ab\\\"; // Device registration token\\n\\nconst char *samplingFeature = \\\"12345678-abcd-1234-ef00-1234567890ab\\\"; // Sampling feature UUID\\n\\n```\\n\\n\\n\\n7. Compile and upload!\\n\",\n \"file_path\": \"examples/cuahsi_workshop/ReadMe.md\",\n \"rank\": 36,\n \"score\": 14.403650727707806\n },\n {\n \"content\": \"#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_SIMCOMSIM7000_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/modems/SIMComSIM7000.h\",\n \"rank\": 37,\n \"score\": 14.392747915698276\n },\n {\n \"content\": \"// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_SEQUANSMONARCH_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/modems/SequansMonarch.h\",\n \"rank\": 38,\n \"score\": 14.386751697516274\n },\n {\n \"content\": \"// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_QUECTELBG96_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/modems/QuectelBG96.h\",\n \"rank\": 39,\n \"score\": 14.386751697516274\n },\n {\n \"content\": \" // TempI\\n\\n\\n\\n // NOTE ALSO: Depending on what type of serial stream you are using, there\\n\\n // may also be a bunch of junk in the buffer that this will clear out.\\n\\n MS_DBG(F(\\\"Dumping Header Lines from MaxBotix on\\\"), getSensorLocation());\\n\\n for(int i = 0; i < 6; i++)\\n\\n {\\n\\n String headerLine = _stream->readStringUntil('\\\\r');\\n\\n MS_DBG(i, '-', headerLine);\\n\\n }\\n\\n // Clear anything else out of the stream buffer\\n\\n uint8_t junkChars = _stream->available();\\n\\n if (junkChars)\\n\\n {\\n\\n MS_DBG(F(\\\"Dumping\\\"), junkChars, F(\\\"characters from MaxBotix stream buffer\\\"));\\n\\n for (uint8_t i = 0; i < junkChars; i++)\\n\\n {\\n\\n #ifdef MS_MAXBOTIXSONAR_DEBUG\\n\\n DEBUGGING_SERIAL_OUTPUT.print(_stream->read());\\n\\n #else\\n\",\n \"file_path\": \"src/sensors/MaxBotixSonar.cpp\",\n \"rank\": 41,\n \"score\": 13.91668680881705\n },\n {\n \"content\": \"#define S2GBR6_SIGNALQUALITY_TIME_MS 15000L\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_SODAQ2GBEER6_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/modems/Sodaq2GBeeR6.h\",\n \"rank\": 42,\n \"score\": 13.85234204236172\n },\n {\n \"content\": \"#define R410M_SIGNALQUALITY_TIME_MS 15000L\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_SODAQUBEER410M_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/modems/SodaqUBeeR410M.h\",\n \"rank\": 43,\n \"score\": 13.85234204236172\n },\n {\n \"content\": \" TinyGsmClient gsmClient;\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n int8_t _vRefPin;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/Sodaq2GBeeR6.h\",\n \"rank\": 44,\n \"score\": 13.816562906266036\n },\n {\n \"content\": \" itoa(i+1, tempBuffer, 10); // BASE 10\\n\\n strcat(txBuffer, tempBuffer);\\n\\n txBuffer[strlen(txBuffer)] = '=';\\n\\n _baseLogger->getValueStringAtI(i).toCharArray(tempBuffer, 26);\\n\\n strcat(txBuffer, tempBuffer);\\n\\n if (i + 1 != numChannels)\\n\\n {\\n\\n txBuffer[strlen(txBuffer)] = '&';\\n\\n }\\n\\n }\\n\\n MS_DBG(F(\\\"Message [\\\"), strlen(txBuffer), F(\\\"]:\\\"), String(txBuffer));\\n\\n\\n\\n // Set the client connection parameters\\n\\n _mqttClient.setClient(*_outClient);\\n\\n _mqttClient.setServer(mqttServer, mqttPort);\\n\\n\\n\\n // Make sure any previous TCP connections are closed\\n\\n // NOTE: The PubSubClient library used for MQTT connect assumes that as\\n\\n // long as the client is connected, it must be connected to the right place.\\n\\n // Closing any stray client sockets here ensures that a new client socket\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.cpp\",\n \"rank\": 45,\n \"score\": 13.788915598814771\n },\n {\n \"content\": \"\\n\\n\\n\\n// A way to begin with everything already set\\n\\nvoid ThingSpeakPublisher::begin(Logger& baseLogger, Client *inClient,\\n\\n const char *thingSpeakMQTTKey,\\n\\n const char *thingSpeakChannelID,\\n\\n const char *thingSpeakChannelKey)\\n\\n{\\n\\n setMQTTKey(thingSpeakMQTTKey);\\n\\n setChannelID(thingSpeakChannelID);\\n\\n setChannelKey(thingSpeakChannelKey);\\n\\n dataPublisher::begin(baseLogger, inClient);\\n\\n}\\n\\nvoid ThingSpeakPublisher::begin(Logger& baseLogger,\\n\\n const char *thingSpeakMQTTKey,\\n\\n const char *thingSpeakChannelID,\\n\\n const char *thingSpeakChannelKey)\\n\\n{\\n\\n setMQTTKey(thingSpeakMQTTKey);\\n\\n setChannelID(thingSpeakChannelID);\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.cpp\",\n \"rank\": 46,\n \"score\": 13.692568082525069\n },\n {\n \"content\": \" TinyGsmClient gsmClient;\\n\\n\\n\\n #if F_CPU == 8000000L\\n\\n HardwareSerial *_modemSerial;\\n\\n #endif\\n\\n\\n\\nprotected:\\n\\n bool didATRespond(void) override;\\n\\n bool isInternetAvailable(void) override;\\n\\n bool verifyMeasurementComplete(bool debug=false) override;\\n\\n bool modemSleepFxn(void) override;\\n\\n bool modemWakeFxn(void) override;\\n\\n bool extraModemSetup(void)override;\\n\\n\\n\\nprivate:\\n\\n const char *_apn;\\n\\n\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/modems/SodaqUBeeR410M.h\",\n \"rank\": 47,\n \"score\": 13.593736049755433\n },\n {\n \"content\": \" // This also un-sets the _millisPowerOn timestamp.\\n\\n virtual void powerDown(void);\\n\\n\\n\\n // This wakes the sensor up, if necessary - that is, does whatever it takes to\\n\\n // get a sensor in the proper state to begin a measurement after the power is on.\\n\\n // This *may* require a waitForWarmUp() before wake commands can be sent.\\n\\n // The wait is NOT included in this function!\\n\\n // This also sets the _millisSensorActivated timestamp.\\n\\n // By default, verifies the power is on and returns true\\n\\n virtual bool wake(void);\\n\\n // This puts the sensor to sleep, if necessary.\\n\\n // This also un-sets the _millisSensorActivated timestamp.\\n\\n // Does NOT power down the sensor!\\n\\n virtual bool sleep(void);\\n\\n\\n\\n // This tells the sensor to start a single measurement, if needed\\n\\n // This also sets the _millisMeasurementRequested timestamp.\\n\\n // This *may* require a waitForWarmUp() before measurement commands can be sent.\\n\\n // This *may* also require a waitForStability() before returned measurements will be any good.\\n\\n // The waits are NOT included in this function!\\n\",\n \"file_path\": \"src/SensorBase.h\",\n \"rank\": 48,\n \"score\": 13.473881064018546\n },\n {\n \"content\": \" // The \\\"isMeasurementComplete()\\\" function checks whether or not enough time\\n\\n // has passed between when the sensor was asked to take a single measurement\\n\\n // and when that measurement should be complete. The\\n\\n // \\\"waitForMeasurementCompletion()\\\" function delays until the time passes.\\n\\n virtual bool isMeasurementComplete(bool debug=false);\\n\\n void waitForMeasurementCompletion(void);\\n\\n\\n\\n\\n\\nprotected:\\n\\n\\n\\n int8_t _dataPin; // SIGNED int, to allow negative numbers for unused pins\\n\\n int8_t _powerPin; // SIGNED int, to allow negative numbers for unused pins\\n\\n const char *_sensorName;\\n\\n const uint8_t _numReturnedVars;\\n\\n uint8_t _measurementsToAverage;\\n\\n uint8_t numberGoodMeasurementsMade[MAX_NUMBER_VARS];\\n\\n\\n\\n // This is the time needed from the when a sensor has power until it's ready to talk\\n\\n // The _millisPowerOn value is set in the powerUp() function. It is\\n\\n // un-set in the powerDown() function.\\n\",\n \"file_path\": \"src/SensorBase.h\",\n \"rank\": 49,\n \"score\": 13.464426389653275\n },\n {\n \"content\": \"\\n\\n// How long we're willing to wait to get signal quality\\n\\n#define SIM800_SIGNALQUALITY_TIME_MS 15000L\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_SIMCOMSIM800_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/modems/SIMComSIM800.h\",\n \"rank\": 50,\n \"score\": 13.431795686753512\n },\n {\n \"content\": \"\\n\\n// How long we're willing to wait to get signal quality\\n\\n#define U201_SIGNALQUALITY_TIME_MS 15000L\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_SODAQUBEEU201_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/modems/SodaqUBeeU201.h\",\n \"rank\": 51,\n \"score\": 13.431795686753512\n },\n {\n \"content\": \"\\n\\n // This gives power to each sensor\\n\\n void sensorsPowerUp(void);\\n\\n\\n\\n // This verifies sensors have power and sends a wake command, if necesary\\n\\n bool sensorsWake(void);\\n\\n\\n\\n // This sends sensors a sleep command, but does not power them down\\n\\n bool sensorsSleep(void);\\n\\n\\n\\n // This cuts sensor power\\n\\n void sensorsPowerDown(void);\\n\\n\\n\\n // This function updates the values for any connected sensors.\\n\\n bool updateAllSensors(void);\\n\\n\\n\\n // This function powers, wakes, updates values, sleeps and powers down.\\n\\n bool completeUpdate(void);\\n\\n\\n\\n // This function prints out the results for any connected sensors to a stream\\n\",\n \"file_path\": \"src/VariableArray.h\",\n \"rank\": 52,\n \"score\": 13.392599630738523\n },\n {\n \"content\": \"void DigiXBeeWifi::disconnectInternet(void)\\n\\n{\\n\\n // Wifi XBee doesn't like to disconnect AT ALL, so we're doing nothing\\n\\n // If you do disconnect, you must power cycle before you can reconnect\\n\\n // to the same access point.\\n\\n}\\n\\n\\n\\n\\n\\n// Get the time from NIST via TIME protocol (rfc868)\\n\\nuint32_t DigiXBeeWifi::getNISTTime(void)\\n\\n{\\n\\n /* bail if not connected to the internet */\\n\\n if (!isInternetAvailable())\\n\\n {\\n\\n MS_DBG(F(\\\"No internet connection, cannot connect to NIST.\\\"));\\n\\n return 0;\\n\\n }\\n\\n\\n\\n gsmClient.stop();\\n\\n\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.cpp\",\n \"rank\": 53,\n \"score\": 13.37017059341785\n },\n {\n \"content\": \"\\n\\n#define TINY_GSM_MODEM_XBEE\\n\\n#ifndef TINY_GSM_RX_BUFFER\\n\\n#define TINY_GSM_RX_BUFFER 64\\n\\n#endif\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"DigiXBee.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_DIGIXBEEWIFI_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.h\",\n \"rank\": 54,\n \"score\": 13.23311215094699\n },\n {\n \"content\": \"\\n\\n#define TINY_GSM_MODEM_SARAR4\\n\\n#ifndef TINY_GSM_RX_BUFFER\\n\\n#define TINY_GSM_RX_BUFFER 64\\n\\n#endif\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"DigiXBee.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_DIGIXBEELTEBYPASS_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/modems/DigiXBeeLTEBypass.h\",\n \"rank\": 55,\n \"score\": 13.23311215094699\n },\n {\n \"content\": \"\\n\\n#define TINY_GSM_MODEM_UBLOX\\n\\n#ifndef TINY_GSM_RX_BUFFER\\n\\n#define TINY_GSM_RX_BUFFER 64\\n\\n#endif\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"DigiXBee.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_DIGIXBEE3GBYPASS_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/modems/DigiXBee3GBypass.h\",\n \"rank\": 56,\n \"score\": 13.23311215094699\n },\n {\n \"content\": \"\\n\\n#define TINY_GSM_MODEM_XBEE\\n\\n#ifndef TINY_GSM_RX_BUFFER\\n\\n#define TINY_GSM_RX_BUFFER 64\\n\\n#endif\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"DigiXBee.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_DIGIXBEECELLULARTRANSPARENT_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/modems/DigiXBeeCellularTransparent.h\",\n \"rank\": 57,\n \"score\": 13.23311215094699\n },\n {\n \"content\": \"ProcessorStats::~ProcessorStats(){}\\n\\n\\n\\n\\n\\nString ProcessorStats::getSensorLocation(void) {return BOARD;}\\n\\n\\n\\n\\n\\n#if defined(ARDUINO_ARCH_SAMD)\\n\\n extern \\\"C\\\" char *sbrk(int i);\\n\\n\\n\\n int16_t FreeRam () {\\n\\n char stack_dummy = 0;\\n\\n return &stack_dummy - sbrk(0);\\n\\n }\\n\\n#endif\\n\\n\\n\\n\\n\\nbool ProcessorStats::addSingleMeasurementResult(void)\\n\\n{\\n\\n // Get the battery voltage\\n\\n MS_DBG(F(\\\"Getting battery voltage\\\"));\\n\",\n \"file_path\": \"src/sensors/ProcessorStats.cpp\",\n \"rank\": 61,\n \"score\": 12.815884773002898\n },\n {\n \"content\": \"// Time until system and digital pins are operational\\n\\n#define ESP8266_ATRESPONSE_TIME_MS 350\\n\\n\\n\\n// How long we're willing to wait to get signal quality\\n\\n#define ESP8266_SIGNALQUALITY_TIME_MS 15000L\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"LoggerModem.h\\\"\\n\\n#include \\\"TinyGsmClient.h\\\"\\n\\n\\n\\n#ifdef MS_ESPRESSIFESP8266_DEBUG_DEEP\\n\\n#include <StreamDebugger.h>\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/modems/EspressifESP8266.h\",\n \"rank\": 62,\n \"score\": 12.796491210741507\n },\n {\n \"content\": \"/*\\n\\n *DigiXBeeWifi.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for Digi S6B Wifi XBee's\\n\\n*/\\n\\n\\n\\n// Included DependenciesV\\n\\n#include \\\"DigiXBeeWifi.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n\\n\\n// Constructor/Destructor\\n\\nDigiXBeeWifi::DigiXBeeWifi(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *ssid, const char *pwd,\\n\\n uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.cpp\",\n \"rank\": 63,\n \"score\": 12.793859947930567\n },\n {\n \"content\": \" void printSensorData(Stream *stream = &Serial);\\n\\n\\n\\nprotected:\\n\\n uint8_t _variableCount;\\n\\n uint8_t _sensorCount;\\n\\n uint8_t _maxSamplestoAverage;\\n\\n\\n\\nprivate:\\n\\n bool isLastVarFromSensor(int arrayIndex);\\n\\n uint8_t countMaxToAverage(void);\\n\\n bool checkVariableUUIDs(void);\\n\\n\\n\\n#ifdef MS_VARIABLEARRAY_DEBUG_DEEP\\n\\n template<typename T>\\n\\n void prettyPrintArray(T arrayToPrint[])\\n\\n {\\n\\n DEEP_DEBUGGING_SERIAL_OUTPUT.print(\\\"[,\\\\t\\\");\\n\\n for (uint8_t i = 0; i < _variableCount; i++)\\n\\n {\\n\\n DEEP_DEBUGGING_SERIAL_OUTPUT.print(arrayToPrint[i]);\\n\",\n \"file_path\": \"src/VariableArray.h\",\n \"rank\": 64,\n \"score\": 12.685448423120109\n },\n {\n \"content\": \" ~SodaqUBeeR410M();\\n\\n\\n\\n bool connectInternet(uint32_t maxConnectionTime = 50000L) override;\\n\\n void disconnectInternet(void) override;\\n\\n\\n\\n // Get values by other names\\n\\n bool getModemSignalQuality(int16_t &rssi, int16_t &percent) override;\\n\\n bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\\n\\n float getModemTemperature(void) override;\\n\\n\\n\\n uint32_t getNISTTime(void) override;\\n\\n\\n\\n void modemHardReset(void) override;\\n\\n void modemPowerUp(void) override;\\n\\n\\n\\n #ifdef MS_SODAQUBEER410M_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\",\n \"file_path\": \"src/modems/SodaqUBeeR410M.h\",\n \"rank\": 65,\n \"score\": 12.5889922793545\n },\n {\n \"content\": \"/*\\n\\n *SequansMonarch.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for the Botletics and other modules based on the SIMCOM BG96.\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"SequansMonarch.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n\\n\\n// Constructor\\n\\nSequansMonarch::SequansMonarch(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/modems/SequansMonarch.cpp\",\n \"rank\": 66,\n \"score\": 12.51433383088842\n },\n {\n \"content\": \"/*\\n\\n *QuectelBG96.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for the Botletics and other modules based on the SIMCOM BG96.\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"QuectelBG96.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n\\n\\n// Constructor\\n\\nQuectelBG96::QuectelBG96(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/modems/QuectelBG96.cpp\",\n \"rank\": 67,\n \"score\": 12.51433383088842\n },\n {\n \"content\": \"/*\\n\\n *Sodaq2GBeeR6.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is the Sodaq 2GBee revisions 6 and higher - these are based on\\n\\n *the SIMCOM SIM800h.\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"Sodaq2GBeeR6.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n\\n\\n// Constructor\\n\\nSodaq2GBeeR6::Sodaq2GBeeR6(Stream *modemStream,\\n\\n int8_t powerPin, int8_t statusPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/modems/Sodaq2GBeeR6.cpp\",\n \"rank\": 68,\n \"score\": 12.357497634309837\n },\n {\n \"content\": \"/*\\n\\n *SIMComSIM7000.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for the Botletics and other modules based on the SIMCOM SIM7000.\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"SIMComSIM7000.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n\\n\\n// Constructor\\n\\nSIMComSIM7000::SIMComSIM7000(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/modems/SIMComSIM7000.cpp\",\n \"rank\": 69,\n \"score\": 12.306152924293865\n },\n {\n \"content\": \" uint8_t measurementsToAverage = 1);\\n\\n ~Sodaq2GBeeR6();\\n\\n\\n\\n bool connectInternet(uint32_t maxConnectionTime = 50000L) override;\\n\\n void disconnectInternet(void) override;\\n\\n\\n\\n // Get values by other names\\n\\n bool getModemSignalQuality(int16_t &rssi, int16_t &percent) override;\\n\\n bool getModemBatteryStats(uint8_t &chargeState, int8_t &percent, uint16_t &milliVolts) override;\\n\\n float getModemTemperature(void) override;\\n\\n\\n\\n uint32_t getNISTTime(void) override;\\n\\n\\n\\n void setVRefPin(int8_t vRefPin);\\n\\n\\n\\n #ifdef MS_SODAQ2GBEER6_DEBUG_DEEP\\n\\n StreamDebugger _modemATDebugger;\\n\\n #endif\\n\\n\\n\\n TinyGsm gsmModem;\\n\",\n \"file_path\": \"src/modems/Sodaq2GBeeR6.h\",\n \"rank\": 71,\n \"score\": 12.181131531809609\n },\n {\n \"content\": \" {\\n\\n dtRowHeader += _loggerTimeZone;\\n\\n }\\n\\n STREAM_CSV_ROW(dtRowHeader, getVarCodeAtI(i));\\n\\n}\\n\\n\\n\\n\\n\\n// This prints a comma separated list of volues of sensor data - including the\\n\\n// time - out over an Arduino stream\\n\\nvoid Logger::printSensorDataCSV(Stream *stream)\\n\\n{\\n\\n String csvString = \\\"\\\";\\n\\n dtFromEpoch(Logger::markedEpochTime).addToString(csvString);\\n\\n csvString += ',';\\n\\n stream->print(csvString);\\n\\n for (uint8_t i = 0; i < getArrayVarCount(); i++)\\n\\n {\\n\\n stream->print(getValueStringAtI(i));\\n\\n if (i + 1 != getArrayVarCount())\\n\\n {\\n\",\n \"file_path\": \"src/LoggerBase.cpp\",\n \"rank\": 72,\n \"score\": 11.868140886923143\n },\n {\n \"content\": \"/*\\n\\n *SodaqUBeeU201.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is the Sodaq UBee based on the u-blox SARA U201 3G Cellular Module\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"SodaqUBeeU201.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n\\n\\n// Constructor\\n\\nSodaqUBeeU201::SodaqUBeeU201(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/modems/SodaqUBeeU201.cpp\",\n \"rank\": 73,\n \"score\": 11.816754448477917\n },\n {\n \"content\": \" return true;\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nbool SodaqUBeeR410M::extraModemSetup(void)\\n\\n{\\n\\n gsmModem.init();\\n\\n gsmClient.init(&gsmModem);\\n\\n _modemName = gsmModem.getModemName();\\n\\n // Set to only use LTE-M, which should cause connection more quickly\\n\\n gsmModem.sendAT(GF(\\\"+URAT=7\\\"));\\n\\n gsmModem.waitResponse();\\n\\n return true;\\n\\n}\\n\\n\\n\\n\\n\\nvoid SodaqUBeeR410M::modemHardReset(void)\\n\\n{\\n\\n if (_modemResetPin >= 0)\\n\",\n \"file_path\": \"src/modems/SodaqUBeeR410M.cpp\",\n \"rank\": 74,\n \"score\": 11.658268959404687\n },\n {\n \"content\": \" gsmModem.commandMode();\\n\\n if (!gsmModem.isNetworkConnected())\\n\\n {\\n\\n MS_DBG(F(\\\"No internet connection, cannot connect to NIST.\\\"));\\n\\n gsmModem.exitCommand();\\n\\n return 0;\\n\\n }\\n\\n\\n\\n // We can get the NIST timestamp directly from the XBee\\n\\n gsmModem.sendAT(GF(\\\"DT0\\\"));\\n\\n String res = gsmModem.readResponseString();\\n\\n gsmModem.exitCommand();\\n\\n MS_DBG(F(\\\"Raw hex response from XBee:\\\"), res);\\n\\n char buf[9] = {0,};\\n\\n res.toCharArray(buf, 9);\\n\\n uint32_t secFrom2000 = strtol(buf, 0, 16);\\n\\n MS_DBG(F(\\\"Seconds from Jan 1, 2000 from XBee (UTC):\\\"), secFrom2000);\\n\\n\\n\\n // Convert from seconds since Jan 1, 2000 to 1970\\n\\n uint32_t unixTimeStamp = secFrom2000 + 946684800 ;\\n\",\n \"file_path\": \"src/modems/DigiXBeeCellularTransparent.cpp\",\n \"rank\": 75,\n \"score\": 11.655615167045275\n },\n {\n \"content\": \"/*\\n\\n *dataPublisherBase.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is a skeleton for sending out remote data.\\n\\n*/\\n\\n#include \\\"dataPublisherBase.h\\\"\\n\\n\\n\\nchar dataPublisher::txBuffer[MS_SEND_BUFFER_SIZE] = {'\\\\0'};\\n\\n\\n\\n// Basic chunks of HTTP\\n\\nconst char *dataPublisher::getHeader = \\\"GET \\\";\\n\\nconst char *dataPublisher::postHeader = \\\"POST \\\";\\n\\nconst char *dataPublisher::HTTPtag = \\\" HTTP/1.1\\\";\\n\\nconst char *dataPublisher::hostHeader = \\\"\\\\r\\\\nHost: \\\";\\n\\n\\n\\n// Constructors\\n\\ndataPublisher::dataPublisher()\\n\",\n \"file_path\": \"src/dataPublisherBase.cpp\",\n \"rank\": 76,\n \"score\": 11.62540503940601\n },\n {\n \"content\": \" /* Try up to 12 times to get a timestamp from NIST */\\n\\n for (uint8_t i = 0; i < 12; i++)\\n\\n {\\n\\n\\n\\n /* Must ensure that we do not ping the daylight more than once every 4 seconds */\\n\\n /* NIST clearly specifies here that this is a requirement for all software */\\n\\n /* that accesses its servers: https://tf.nist.gov/tf-cgi/servers.cgi */\\n\\n while (millis() < _lastNISTrequest + 4000)\\n\\n {\\n\\n }\\n\\n\\n\\n /* Make TCP connection */\\n\\n MS_DBG(F(\\\"\\\\nConnecting to NIST daytime Server\\\"));\\n\\n bool connectionMade = false;\\n\\n\\n\\n /* This is the IP address of time-e-wwv.nist.gov */\\n\\n /* XBee's address lookup falters on time.nist.gov */\\n\\n IPAddress ip(132, 163, 97, 6);\\n\\n connectionMade = gsmClient.connect(ip, 37);\\n\\n /* Wait again so NIST doesn't refuse us! */\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.cpp\",\n \"rank\": 77,\n \"score\": 11.565867710203573\n },\n {\n \"content\": \"const int ThingSpeakPublisher::mqttPort = 1883;\\n\\nconst char *ThingSpeakPublisher::mqttClient = THING_SPEAK_CLIENT_NAME;\\n\\nconst char *ThingSpeakPublisher::mqttUser = THING_SPEAK_USER_NAME;\\n\\n\\n\\n\\n\\n// Constructors\\n\\nThingSpeakPublisher::ThingSpeakPublisher()\\n\\n : dataPublisher()\\n\\n{\\n\\n // MS_DBG(F(\\\"ThingSpeakPublisher object created\\\"));\\n\\n}\\n\\nThingSpeakPublisher::ThingSpeakPublisher(Logger& baseLogger,\\n\\n uint8_t sendEveryX, uint8_t sendOffset)\\n\\n : dataPublisher(baseLogger, sendEveryX, sendOffset)\\n\\n{\\n\\n // MS_DBG(F(\\\"ThingSpeakPublisher object created\\\"));\\n\\n}\\n\\nThingSpeakPublisher::ThingSpeakPublisher(Logger& baseLogger, Client *inClient,\\n\\n uint8_t sendEveryX, uint8_t sendOffset)\\n\\n : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.cpp\",\n \"rank\": 78,\n \"score\": 11.524530397554717\n },\n {\n \"content\": \" // Do NOT unset any status bits or timestamps if we didn't really power down!\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n// The function to set up connection to a sensor.\\n\\n// By default, sets pin modes and returns true\\n\\nbool Sensor::setup(void)\\n\\n{\\n\\n MS_DBG(F(\\\"Setting up\\\"), getSensorName(), F(\\\"attached at\\\"),\\n\\n getSensorLocation(), F(\\\"which can return up to\\\"), _numReturnedVars,\\n\\n F(\\\"variable[s].\\\"));\\n\\n\\n\\n MS_DBG(F(\\\"It warms up in\\\"), _warmUpTime_ms, F(\\\"ms, is stable after\\\"),\\n\\n _stabilizationTime_ms, F(\\\"ms, and takes a single measurement in\\\"),\\n\\n _measurementTime_ms, F(\\\"ms.\\\"));\\n\\n\\n\\n MS_DBG(_measurementsToAverage, F(\\\"individual measurements will be averaged for each reading.\\\"));\\n\\n\\n\\n if (_powerPin >= 0) pinMode(_powerPin, OUTPUT); // NOTE: Not setting value\\n\",\n \"file_path\": \"src/SensorBase.cpp\",\n \"rank\": 79,\n \"score\": 11.469748428919587\n },\n {\n \"content\": \" // is opened to the right place.\\n\\n // client is connected when a different socket is open\\n\\n if (_outClient->connected())\\n\\n {\\n\\n _outClient->stop();\\n\\n }\\n\\n\\n\\n // Make the MQTT connection\\n\\n // Note: the client id and the user name do not mean anything for ThingSpeak\\n\\n MS_DBG(F(\\\"Opening MQTT Connection\\\"));\\n\\n MS_START_DEBUG_TIMER;\\n\\n if (_mqttClient.connect(mqttClient, mqttUser, _thingSpeakMQTTKey))\\n\\n {\\n\\n MS_DBG(F(\\\"MQTT connected after\\\"), MS_PRINT_DEBUG_TIMER, F(\\\"ms\\\"));\\n\\n\\n\\n if (_mqttClient.publish(topicBuffer, txBuffer))\\n\\n {\\n\\n PRINTOUT(F(\\\"ThingSpeak topic published! Current state:\\\"),\\n\\n parseMQTTState(_mqttClient.state()));\\n\\n retVal = true;\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.cpp\",\n \"rank\": 80,\n \"score\": 11.405952825927713\n },\n {\n \"content\": \" MS_DBG(F(\\\"Unix Timestamp returned by NIST (UTC):\\\"), unixTimeStamp);\\n\\n\\n\\n // If before Jan 1, 2019 or after Jan 1, 2030, most likely an error\\n\\n if (unixTimeStamp < 1546300800)\\n\\n {\\n\\n return 0;\\n\\n }\\n\\n else if (unixTimeStamp > 1893456000)\\n\\n {\\n\\n return 0;\\n\\n }\\n\\n else\\n\\n {\\n\\n return unixTimeStamp;\\n\\n }\\n\\n}*/\\n\\nuint32_t DigiXBeeCellularTransparent::getNISTTime(void)\\n\\n{\\n\\n /* bail if not connected to the internet */\\n\\n if (!isInternetAvailable())\\n\",\n \"file_path\": \"src/modems/DigiXBeeCellularTransparent.cpp\",\n \"rank\": 81,\n \"score\": 11.253429386052051\n },\n {\n \"content\": \"/*\\n\\n *DigiXBeeCellularTransparent.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for Digi Cellular XBee's\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"DigiXBeeCellularTransparent.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n// Constructor/Destructor\\n\\nDigiXBeeCellularTransparent::DigiXBeeCellularTransparent(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\\n : DigiXBee(powerPin, statusPin, useCTSStatus,\\n\",\n \"file_path\": \"src/modems/DigiXBeeCellularTransparent.cpp\",\n \"rank\": 82,\n \"score\": 11.23920674240296\n },\n {\n \"content\": \" : Sensor(sensorName, numReturnedVars,\\n\\n warmUpTime_ms, stabilizationTime_ms, measurementTime_ms,\\n\\n powerPin, dataPin, measurementsToAverage),\\n\\n _SDI12Internal(dataPin)\\n\\n{\\n\\n _SDI12address = SDI12address;\\n\\n}\\n\\nSDI12Sensors::SDI12Sensors(char *SDI12address, int8_t powerPin, int8_t dataPin, uint8_t measurementsToAverage,\\n\\n const char *sensorName, const uint8_t numReturnedVars,\\n\\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms)\\n\\n : Sensor(sensorName, numReturnedVars,\\n\\n warmUpTime_ms, stabilizationTime_ms, measurementTime_ms,\\n\\n powerPin, dataPin, measurementsToAverage),\\n\\n _SDI12Internal(dataPin)\\n\\n{\\n\\n _SDI12address = *SDI12address;\\n\\n}\\n\\nSDI12Sensors::SDI12Sensors(int SDI12address, int8_t powerPin, int8_t dataPin, uint8_t measurementsToAverage,\\n\\n const char *sensorName, const uint8_t numReturnedVars,\\n\\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms)\\n\",\n \"file_path\": \"src/sensors/SDI12Sensors.cpp\",\n \"rank\": 83,\n \"score\": 11.068128517546015\n },\n {\n \"content\": \"/*\\n\\n *DigiXBee3GBypass.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for Digi Cellular XBee's BASED ON UBLOX CHIPS in bypass mode\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"DigiXBee3GBypass.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n// Constructor/Destructor\\n\\nDigiXBee3GBypass::DigiXBee3GBypass(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\\n : DigiXBee(powerPin, statusPin, useCTSStatus,\\n\",\n \"file_path\": \"src/modems/DigiXBee3GBypass.cpp\",\n \"rank\": 84,\n \"score\": 11.032679949672184\n },\n {\n \"content\": \"/*\\n\\n *DigiXBeeLTEBypass.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for Digi Cellular XBee's BASED ON UBLOX CHIPS in bypass mode\\n\\n*/\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"DigiXBeeLTEBypass.h\\\"\\n\\n#include \\\"modems/LoggerModemMacros.h\\\"\\n\\n\\n\\n// Constructor/Destructor\\n\\nDigiXBeeLTEBypass::DigiXBeeLTEBypass(Stream* modemStream,\\n\\n int8_t powerPin, int8_t statusPin, bool useCTSStatus,\\n\\n int8_t modemResetPin, int8_t modemSleepRqPin,\\n\\n const char *apn,\\n\\n uint8_t measurementsToAverage)\\n\\n : DigiXBee(powerPin, statusPin, useCTSStatus,\\n\",\n \"file_path\": \"src/modems/DigiXBeeLTEBypass.cpp\",\n \"rank\": 85,\n \"score\": 11.032679949672184\n },\n {\n \"content\": \" const char *ssid, const char *pwd,\\n\\n uint8_t measurementsToAverage,\\n\\n int8_t espSleepRqPin, int8_t espStatusPin)\\n\\n : loggerModem(powerPin, statusPin, HIGH,\\n\\n modemResetPin, modemSleepRqPin, true,\\n\\n ESP8266_STATUS_TIME_MS, ESP8266_DISCONNECT_TIME_MS,\\n\\n ESP8266_WARM_UP_TIME_MS, ESP8266_ATRESPONSE_TIME_MS,\\n\\n ESP8266_SIGNALQUALITY_TIME_MS,\\n\\n measurementsToAverage),\\n\\n #ifdef MS_ESPRESSIFESP8266_DEBUG_DEEP\\n\\n _modemATDebugger(*modemStream, DEEP_DEBUGGING_SERIAL_OUTPUT),\\n\\n gsmModem(_modemATDebugger),\\n\\n #else\\n\\n gsmModem(*modemStream),\\n\\n #endif\\n\\n gsmClient(gsmModem)\\n\\n{\\n\\n _ssid = ssid;\\n\\n _pwd = pwd;\\n\\n\\n\",\n \"file_path\": \"src/modems/EspressifESP8266.cpp\",\n \"rank\": 86,\n \"score\": 10.979233903032014\n },\n {\n \"content\": \"- Find this information for your ThingSpeak account and channel and put it into logging_to_ThingSpeak.ino:\\n\\n\\n\\n```cpp\\n\\nconst char *thingSpeakMQTTKey = \\\"XXXXXXXXXXXXXXXX\\\"; // Your MQTT API Key from Account > MyProfile.\\n\\nconst char *thingSpeakChannelID = \\\"######\\\"; // The numeric channel id for your channel\\n\\nconst char *thingSpeakChannelKey = \\\"XXXXXXXXXXXXXXXX\\\"; // The Write API Key for your channel\\n\\n```\\n\\n\\n\",\n \"file_path\": \"examples/logging_to_ThingSpeak/ReadMe.md\",\n \"rank\": 87,\n \"score\": 10.973758547643714\n },\n {\n \"content\": \" // - Use the isMeasurementComplete() to check if enough time has passed\\n\\n // for a measurement to have been completed.\\n\\n // Bit 7 - 0=No known errors, 1=Some sort of error has occurred\\n\\n uint8_t getStatus(void);\\n\\n\\n\\n // This does any one-time preparations needed before the sensor will be able\\n\\n // to take readings. May not require any action.\\n\\n // Generally, the sensor must be powered on for setup.\\n\\n virtual bool setup(void);\\n\\n\\n\\n // This updates the sensor's values\\n\\n // This clears the values array, starts and averages as many measurement\\n\\n // readings as requested, and then notifies the registered variables\\n\\n // of the new results. All possible waits are included in this function!\\n\\n virtual bool update(void);\\n\\n\\n\\n // This turns on the sensor power, if applicable\\n\\n // This also sets the _millisPowerOn timestamp.\\n\\n virtual void powerUp(void);\\n\\n // This turns off the sensor power, if applicable\\n\",\n \"file_path\": \"src/SensorBase.h\",\n \"rank\": 88,\n \"score\": 10.930131579724844\n },\n {\n \"content\": \" #if defined(ARDUINO_ARCH_SAMD)\\n\\n extendedWatchDogSAMD watchDogTimer;\\n\\n #else\\n\\n extendedWatchDogAVR watchDogTimer;\\n\\n #endif\\n\\n\\n\\n // ===================================================================== //\\n\\n // Public functions for logging data to an SD card\\n\\n // ===================================================================== //\\n\\n\\n\\npublic:\\n\\n // This sets a file name, if you want to decide on it in advance\\n\\n void setFileName(const char *fileName);\\n\\n // Same as above, with a string (overload function)\\n\\n void setFileName(String& fileName);\\n\\n\\n\\n // This returns the current filename. Must be run after setFileName.\\n\\n String getFileName(void){return _fileName;}\\n\\n\\n\\n // This prints a header onto a stream - this removes need to pass around\\n\",\n \"file_path\": \"src/LoggerBase.h\",\n \"rank\": 89,\n \"score\": 10.928850761474958\n },\n {\n \"content\": \" // MS_DBG(F(\\\"Using a Google IP to test connection...\\\"));\\n\\n // gsmClient.stop();\\n\\n // IPAddress ip(8, 8, 8, 8); // This is one of Google's IP's\\n\\n // success &= gsmClient.connect(ip, 80);\\n\\n // }\\n\\n // else\\n\\n // {\\n\\n // MS_DBG(F(\\\"Using last connected IP to test connection:\\\"));\\n\\n // }\\n\\n // gsmClient.print('!'); // Need to send something before connection is made\\n\\n\\n\\n MS_DBG(F(\\\"Opening connection to NIST to check connection strength...\\\"));\\n\\n // This is the IP address of time-e-wwv.nist.gov\\n\\n // XBee's address lookup falters on time.nist.gov\\n\\n IPAddress ip(132, 163, 97, 6);\\n\\n gsmClient.connect(ip, 37);\\n\\n\\n\\n // Unfortunately, using a ping doesn't work\\n\\n // gsmModem.commandMode();\\n\\n // gsmModem.sendAT(GF(\\\"PG8.8.8.8\\\"));\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.cpp\",\n \"rank\": 90,\n \"score\": 10.88488831121483\n },\n {\n \"content\": \" /* This is the IP address of time-e-wwv.nist.gov */\\n\\n /* XBee's address lookup falters on time.nist.gov */\\n\\n IPAddress ip(132, 163, 97, 6);\\n\\n connectionMade = gsmClient.connect(ip, 37, 15);\\n\\n /* Wait again so NIST doesn't refuse us! */\\n\\n delay(4000L);\\n\\n /* Try sending something to ensure connection */\\n\\n gsmClient.println('!');\\n\\n\\n\\n /* Wait up to 5 seconds for a response */\\n\\n if (connectionMade)\\n\\n {\\n\\n uint32_t start = millis();\\n\\n while (gsmClient && gsmClient.available() < 4 && millis() - start < 5000L)\\n\\n {\\n\\n }\\n\\n\\n\\n if (gsmClient.available() >= 4)\\n\\n {\\n\\n MS_DBG(F(\\\"NIST responded after\\\"), millis() - start, F(\\\"ms\\\"));\\n\",\n \"file_path\": \"src/modems/DigiXBeeCellularTransparent.cpp\",\n \"rank\": 91,\n \"score\": 10.820129393242055\n },\n {\n \"content\": \"/*\\n\\n *SensorBase.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for the sensor base class.\\n\\n*/\\n\\n\\n\\n#include \\\"SensorBase.h\\\"\\n\\n#include \\\"VariableBase.h\\\"\\n\\n\\n\\n// ============================================================================\\n\\n// The class and functions for interfacing with a sensor\\n\\n// ============================================================================\\n\\n\\n\\n// The constructor\\n\\nSensor::Sensor(const char *sensorName, const uint8_t numReturnedVars,\\n\\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms,\\n\\n int8_t powerPin, int8_t dataPin, uint8_t measurementsToAverage)\\n\",\n \"file_path\": \"src/SensorBase.cpp\",\n \"rank\": 92,\n \"score\": 10.815179032717628\n },\n {\n \"content\": \" : dataPublisher(baseLogger, inClient, sendEveryX, sendOffset)\\n\\n{\\n\\n setMQTTKey(thingSpeakMQTTKey);\\n\\n setChannelID(thingSpeakChannelID);\\n\\n setChannelKey(thingSpeakChannelKey);\\n\\n // MS_DBG(F(\\\"ThingSpeakPublisher object created\\\"));\\n\\n}\\n\\n// Destructor\\n\\nThingSpeakPublisher::~ThingSpeakPublisher(){}\\n\\n\\n\\n\\n\\nvoid ThingSpeakPublisher::setMQTTKey(const char *thingSpeakMQTTKey)\\n\\n{\\n\\n _thingSpeakMQTTKey = thingSpeakMQTTKey;\\n\\n // MS_DBG(F(\\\"MQTT Key set!\\\"));\\n\\n}\\n\\n\\n\\n\\n\\nvoid ThingSpeakPublisher::setChannelID(const char *thingSpeakChannelID)\\n\\n{\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.cpp\",\n \"rank\": 93,\n \"score\": 10.812328014474778\n },\n {\n \"content\": \" uint8_t junkChars = _stream->available();\\n\\n if (junkChars)\\n\\n {\\n\\n MS_DBG(F(\\\"Dumping\\\"), junkChars, F(\\\"characters from MaxBotix stream buffer:\\\"));\\n\\n for (uint8_t i = 0; i < junkChars; i++)\\n\\n {\\n\\n #ifdef MS_MAXBOTIXSONAR_DEBUG\\n\\n DEBUGGING_SERIAL_OUTPUT.print(_stream->read());\\n\\n #else\\n\\n _stream->read();\\n\\n #endif\\n\\n }\\n\\n #ifdef MS_MAXBOTIXSONAR_DEBUG\\n\\n DEBUGGING_SERIAL_OUTPUT.println();\\n\\n #endif\\n\\n }\\n\\n\\n\\n // Check a measurement was *successfully* started (status bit 6 set)\\n\\n // Only go on to get a result if it was\\n\\n if (bitRead(_sensorStatus, 6))\\n\",\n \"file_path\": \"src/sensors/MaxBotixSonar.cpp\",\n \"rank\": 94,\n \"score\": 10.81138687077984\n },\n {\n \"content\": \"// MQTT User Name\\n\\n// The user name doesn't actually mean anything for ThingSpeak\\n\\n#define THING_SPEAK_USER_NAME \\\"MS\\\"\\n\\n\\n\\n// MQTT Client Name\\n\\n// The client name doesn't actually mean anything for ThingSpeak\\n\\n#define THING_SPEAK_CLIENT_NAME \\\"MS\\\"\\n\\n\\n\\n// Included Dependencies\\n\\n#include \\\"ModSensorDebugger.h\\\"\\n\\n#undef MS_DEBUGGING_STD\\n\\n#include \\\"dataPublisherBase.h\\\"\\n\\n#include <PubSubClient.h>\\n\\n\\n\\n\\n\\n// ============================================================================\\n\\n// Functions for the EnviroDIY data portal receivers.\\n\\n// ============================================================================\\n\",\n \"file_path\": \"src/publishers/ThingSpeakPublisher.h\",\n \"rank\": 95,\n \"score\": 10.739933531600148\n },\n {\n \"content\": \"AtlasParent::AtlasParent(int8_t powerPin, uint8_t i2cAddressHex, uint8_t measurementsToAverage,\\n\\n const char *sensorName, const uint8_t numReturnedVars,\\n\\n uint32_t warmUpTime_ms, uint32_t stabilizationTime_ms, uint32_t measurementTime_ms)\\n\\n : Sensor(sensorName, numReturnedVars,\\n\\n warmUpTime_ms, stabilizationTime_ms, measurementTime_ms,\\n\\n powerPin, -1, measurementsToAverage),\\n\\n _i2cAddressHex(i2cAddressHex)\\n\\n{}\\n\\nAtlasParent::~AtlasParent(){}\\n\\n\\n\\n\\n\\nString AtlasParent::getSensorLocation(void)\\n\\n{\\n\\n String address = F(\\\"I2C_0x\\\");\\n\\n address += String(_i2cAddressHex, HEX);\\n\\n return address;\\n\\n}\\n\\n\\n\\n\\n\\nbool AtlasParent::setup(void)\\n\",\n \"file_path\": \"src/sensors/AtlasParent.cpp\",\n \"rank\": 96,\n \"score\": 10.723655853466227\n },\n {\n \"content\": \" virtual void powerUp(void) override;\\n\\n virtual void powerDown(void) override;\\n\\n\\n\\n virtual bool addSingleMeasurementResult(void);\\n\\n\\n\\nprivate:\\n\\n yosemitech sensor;\\n\\n yosemitechModel _model;\\n\\n byte _modbusAddress;\\n\\n Stream* _stream;\\n\\n int8_t _RS485EnablePin;\\n\\n int8_t _powerPin2;\\n\\n};\\n\\n\\n\\n#endif // Header Guard\\n\",\n \"file_path\": \"src/sensors/YosemitechParent.h\",\n \"rank\": 97,\n \"score\": 10.633412473811397\n },\n {\n \"content\": \" int16_t signalQual = -9999;\\n\\n percent = -9999;\\n\\n rssi = -9999;\\n\\n\\n\\n // The WiFi XBee needs to make an actual TCP connection and get some sort\\n\\n // of response on that connection before it knows the signal quality.\\n\\n // Connecting to the Google DNS servers - this doesn't really work\\n\\n // MS_DBG(F(\\\"Opening connection to check connection strength...\\\"));\\n\\n // bool usedGoogle = false;\\n\\n // if (!gsmModem.gotIPforSavedHost())\\n\\n // {\\n\\n // usedGoogle = true;\\n\\n // IPAddress ip(8, 8, 8, 8); // This is one of Google's IP's\\n\\n // gsmClient.stop();\\n\\n // success &= gsmClient.connect(ip, 80);\\n\\n // }\\n\\n // gsmClient.print('!'); // Need to send something before connection is made\\n\\n // delay(100); // Need this delay! Can get away with 50, but 100 is safer.\\n\\n\\n\\n MS_DBG(F(\\\"Opening connection to NIST to check connection strength...\\\"));\\n\",\n \"file_path\": \"src/modems/DigiXBeeWifi.cpp\",\n \"rank\": 98,\n \"score\": 10.522345503499363\n },\n {\n \"content\": \"/*\\n\\n *DreamHostPublisher.cpp\\n\\n *This file is part of the EnviroDIY modular sensors library for Arduino\\n\\n *\\n\\n *Initial library developement done by Sara Damiano (sdamiano@stroudcenter.org).\\n\\n *\\n\\n *This file is for the EnviroDIY logging functions - ie, sending get requests to DreamHost\\n\\n*/\\n\\n\\n\\n#include \\\"DreamHostPublisher.h\\\"\\n\\n\\n\\n\\n\\n// ============================================================================\\n\\n// Functions for the SWRC Sensors DreamHost data receivers.\\n\\n// ============================================================================\\n\\n\\n\\n// Constant portions of the requests\\n\\nconst char *DreamHostPublisher::dreamhostHost = \\\"swrcsensors.dreamhosters.com\\\";\\n\\nconst int DreamHostPublisher::dreamhostPort = 80;\\n\\nconst char *DreamHostPublisher::loggerTag = \\\"?LoggerID=\\\";\\n\",\n \"file_path\": \"src/publishers/DreamHostPublisher.cpp\",\n \"rank\": 99,\n \"score\": 10.488442831837137\n }\n]","isConversational":false}}},{"rowIdx":94,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"third_party/blink/renderer/core/layout/ng/ng_relative_utils_test.cc"},"repo_name":{"kind":"string","value":"zealoussnow/chromium"},"commit":{"kind":"string","value":"fd8a8914ca0183f0add65ae55f04e287543c7d4a"},"file_code":{"kind":"string","value":"\n\n#include \"third_party/blink/renderer/core/layout/ng/ng_relative_utils.h\"\n\n#include \"testing/gtest/include/gtest/gtest.h\"\n#include \"third_party/blink/renderer/core/layout/geometry/physical_offset.h\"\n#include \"third_party/blink/renderer/core/layout/geometry/physical_size.h\"\n#include \"third_party/blink/renderer/core/style/computed_style.h\"\n\nnamespace blink {\nnamespace {\n\nconst LayoutUnit kLeft{3};\nconst LayoutUnit kRight{5};\nconst LayoutUnit kTop{7};\nconst LayoutUnit kBottom{9};\nconst LayoutUnit kAuto{-1};\nconst LayoutUnit kZero{0};\n\nclass NGRelativeUtilsTest : public testing::Test {\n protected:\n void SetUp() override {\n style_ = ComputedStyle::CreateInitialStyleSingleton();\n style_->SetPosition(EPosition::kRelative);\n }\n\n void SetTRBL(LayoutUnit top,\n LayoutUnit right,\n LayoutUnit bottom,\n LayoutUnit left) {\n style_->SetTop(top == kAuto ? Length::Auto() : Length::Fixed(top.ToInt()));\n style_->SetRight(right == kAuto ? Length::Auto()\n : Length::Fixed(right.ToInt()));\n style_->SetBottom(bottom == kAuto ? Length::Auto()\n : Length::Fixed(bottom.ToInt()));\n style_->SetLeft(left == kAuto ? Length::Auto()\n : Length::Fixed(left.ToInt()));\n }\n\n scoped_refptr<ComputedStyle> style_;\n LogicalSize container_size_;\n};\n\nTEST_F(NGRelativeUtilsTest, HorizontalTB) {\n LogicalOffset offset;\n\n \n SetTRBL(kAuto, kAuto, kAuto, kAuto);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kZero);\n EXPECT_EQ(offset.block_offset, kZero);\n\n \n SetTRBL(kTop, kRight, kBottom, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kLeft);\n EXPECT_EQ(offset.block_offset, kTop);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kRtl},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kRight);\n EXPECT_EQ(offset.block_offset, kTop);\n\n \n SetTRBL(kAuto, kRight, kBottom, kAuto);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, -kRight);\n EXPECT_EQ(offset.block_offset, -kBottom);\n}\n\nTEST_F(NGRelativeUtilsTest, VerticalRightLeft) {\n LogicalOffset offset;\n\n \n SetTRBL(kTop, kRight, kBottom, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalRl, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kTop);\n EXPECT_EQ(offset.block_offset, kRight);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalRl, TextDirection::kRtl},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kBottom);\n EXPECT_EQ(offset.block_offset, kRight);\n\n \n SetTRBL(kAuto, kAuto, kBottom, kLeft);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalRl, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, -kBottom);\n EXPECT_EQ(offset.block_offset, -kLeft);\n}\n\nTEST_F(NGRelativeUtilsTest, VerticalLeftRight) {\n LogicalOffset offset;\n\n \n SetTRBL(kTop, kRight, kBottom, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalLr, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kTop);\n EXPECT_EQ(offset.block_offset, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalLr, TextDirection::kRtl},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kBottom);\n EXPECT_EQ(offset.block_offset, kLeft);\n\n \n SetTRBL(kAuto, kRight, kBottom, kAuto);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalLr, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, -kBottom);\n EXPECT_EQ(offset.block_offset, -kRight);\n}\n\n} \n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"third_party/blink/renderer/core/layout/ng/ng_relative_utils.h\"\n\n#include \"testing/gtest/include/gtest/gtest.h\"\n#include \"third_party/blink/renderer/core/layout/geometry/physical_offset.h\"\n#include \"third_party/blink/renderer/core/layout/geometry/physical_size.h\"\n#include \"third_party/blink/renderer/core/style/computed_style.h\"\n\nnamespace blink {\nnamespace {\n\nconst LayoutUnit kLeft{3};\nconst LayoutUnit kRight{5};\nconst LayoutUnit kTop{7};\nconst LayoutUnit kBottom{9};\nconst LayoutUnit kAuto{-1};\nconst LayoutUnit kZero{0};\n\nclass NGRelativeUtilsTest : public testing::Test {\n protected:\n void SetUp() override {\n style_ = ComputedStyle::CreateInitialStyleSingleton();\n style_->SetPosition(EPosition::kRelative);\n }\n\n "},"suffix":{"kind":"string","value":"\n\n scoped_refptr<ComputedStyle> style_;\n LogicalSize container_size_;\n};\n\nTEST_F(NGRelativeUtilsTest, HorizontalTB) {\n LogicalOffset offset;\n\n \n SetTRBL(kAuto, kAuto, kAuto, kAuto);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kZero);\n EXPECT_EQ(offset.block_offset, kZero);\n\n \n SetTRBL(kTop, kRight, kBottom, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kLeft);\n EXPECT_EQ(offset.block_offset, kTop);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kRtl},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kRight);\n EXPECT_EQ(offset.block_offset, kTop);\n\n \n SetTRBL(kAuto, kRight, kBottom, kAuto);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, -kRight);\n EXPECT_EQ(offset.block_offset, -kBottom);\n}\n\nTEST_F(NGRelativeUtilsTest, VerticalRightLeft) {\n LogicalOffset offset;\n\n \n SetTRBL(kTop, kRight, kBottom, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalRl, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kTop);\n EXPECT_EQ(offset.block_offset, kRight);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalRl, TextDirection::kRtl},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kBottom);\n EXPECT_EQ(offset.block_offset, kRight);\n\n \n SetTRBL(kAuto, kAuto, kBottom, kLeft);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalRl, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, -kBottom);\n EXPECT_EQ(offset.block_offset, -kLeft);\n}\n\nTEST_F(NGRelativeUtilsTest, VerticalLeftRight) {\n LogicalOffset offset;\n\n \n SetTRBL(kTop, kRight, kBottom, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalLr, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kTop);\n EXPECT_EQ(offset.block_offset, kLeft);\n\n \n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalLr, TextDirection::kRtl},\n container_size_);\n EXPECT_EQ(offset.inline_offset, kBottom);\n EXPECT_EQ(offset.block_offset, kLeft);\n\n \n SetTRBL(kAuto, kRight, kBottom, kAuto);\n offset = ComputeRelativeOffset(\n *style_, {WritingMode::kVerticalLr, TextDirection::kLtr},\n container_size_);\n EXPECT_EQ(offset.inline_offset, -kBottom);\n EXPECT_EQ(offset.block_offset, -kRight);\n}\n\n} \n} \n"},"middle":{"kind":"string","value":"void SetTRBL(LayoutUnit top,\n LayoutUnit right,\n LayoutUnit bottom,\n LayoutUnit left) {\n style_->SetTop(top == kAuto ? Length::Auto() : Length::Fixed(top.ToInt()));\n style_->SetRight(right == kAuto ? Length::Auto()\n : Length::Fixed(right.ToInt()));\n style_->SetBottom(bottom == kAuto ? Length::Auto()\n : Length::Fixed(bottom.ToInt()));\n style_->SetLeft(left == kAuto ? Length::Auto()\n : Length::Fixed(left.ToInt()));\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":95,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"v8bridge/userland/userland_class.hpp"},"repo_name":{"kind":"string","value":"QuartzTechnologies/v8bridge"},"commit":{"kind":"string","value":"5e2f2d6b93adae25295b88c0c4e0eb4f93e22057"},"file_code":{"kind":"string","value":"\n\n#ifndef BOOST_PP_IS_ITERATING\n# ifndef v8bridge_userland_class_hpp\n# define v8bridge_userland_class_hpp\n\n# include <stdexcept>\n\n# include <v8bridge/detail/prefix.hpp>\n# include <v8bridge/conversion.hpp>\n\n# include <v8bridge/userland/userland_instance.hpp>\n\n# include <boost/preprocessor/repetition.hpp>\n# include <boost/preprocessor/iteration/iterate.hpp>\n# include <boost/shared_ptr.hpp>\n\nnamespace v8\n{\n namespace bridge\n {\n using namespace v8;\n \n \n \n class V8_DECL UserlandClass\n {\n public:\n UserlandClass(Isolate *isolationScope, Handle<Value> functionHandle) :\n m_isolationScope(isolationScope), m_function(isolationScope, Handle<Function>::Cast(functionHandle)) \n , m_instances(new TInstancesList())\n {\n };\n \n UserlandClass(Isolate *isolationScope, Handle<Function> functionHandle) :\n m_isolationScope(isolationScope), m_function(isolationScope, functionHandle)\n , m_instances(new TInstancesList())\n {\n \n };\n \n ~UserlandClass()\n {\n \n this->m_function.Reset();\n \n \n \n for (TInstancesList::iterator it = this->m_instances->begin(); it != this->m_instances->end(); ++it)\n {\n (*it).reset();\n }\n \n this->m_instances->clear();\n }\n \n inline Local<Function> getCtorFunction() { return Local<Function>::New(this->m_isolationScope, this->m_function); }\n \n \n \n \n \n \n inline Local<Value> getHandle(std::string key)\n {\n EscapableHandleScope handle_scope(this->m_isolationScope);\n \n return handle_scope.Escape(\n this->getCtorFunction()->Get(String::NewFromUtf8(this->m_isolationScope, key.c_str()))\n );\n }\n \n template <class TType>\n inline TType getValue(std::string key)\n {\n Local<Value> value = this->getCtorFunction()->Get(String::NewFromUtf8(this->m_isolationScope, key.c_str()));\n TType result;\n if (!JsToNative(this->m_isolationScope, result, value))\n {\n std::stringstream io;\n io << \"The requested variable (\" << key << \")\"\n << \" does not match the specified TType (\" << TypeId<TType>().name() << \").\";\n throw std::runtime_error(io.str());\n }\n return result;\n }\n \n \n \n \n \n \n inline UserlandInstance *newInstance()\n {\n Handle<Value> argv[] = { };\n Handle<Value> v8Instance = this->getCtorFunction()->NewInstance(0, argv);\n \n UserlandInstance *instance = new UserlandInstance(this->m_isolationScope, v8Instance);\n \n boost::shared_ptr<UserlandInstance> adapter(instance);\n \n this->m_instances->push_back(adapter);\n \n return instance;\n }\n \n \n \n \n \n \n \n template <class TResult>\n inline typename boost::disable_if<\n boost::is_same<TResult, void>, TResult >::type\n invoke()\n {\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {};\n TResult result;\n \n if (!JsToNative(this->m_isolationScope, result, callback->Call(callback, 0, argv)))\n {\n std::stringstream io;\n io << \"The function returned value does not match the specified TResult (\" << TypeId<TResult>().name() << \").\";\n throw std::runtime_error(io.str());\n }\n \n return result;\n }\n \n \n template <class TResult>\n inline typename boost::enable_if<\n boost::is_same<TResult, void>, TResult >::type\n invoke()\n {\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {};\n \n callback->Call(callback, 0, argv);\n }\n \n \n inline Handle<Value> rawInvoke()\n {\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {};\n \n return callback->Call(callback, 0, argv);\n }\n \n \n \n \n \n# define BOOST_PP_ITERATION_PARAMS_1 (3, (1, V8_MAX_ARITY, <v8bridge/userland/userland_class.hpp>))\n# include BOOST_PP_ITERATE()\n private:\n typedef std::list<boost::shared_ptr<UserlandInstance> > TInstancesList;\n \n Isolate *m_isolationScope;\n Persistent<Function> m_function;\n TInstancesList *m_instances;\n };\n }\n}\n\n# endif \n#else \n# if BOOST_PP_ITERATION_DEPTH() == 1 \n# define N BOOST_PP_ITERATION()\n# define V8_BRIDGE_CALL_CONCAT_ARG(z, n, data) BOOST_PP_CAT(TClass, n) BOOST_PP_CAT(arg, n)\n# define V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE(z, n, data) NativeToJs<BOOST_PP_CAT(TClass, n)>(this->m_isolationScope, BOOST_PP_CAT(arg, n))\n\ntemplate <BOOST_PP_ENUM_PARAMS(N, class TClass) >\nUserlandInstance *newInstance(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n Handle<Value> v8Instance = this->getCtorFunction()->NewInstance(N, argv);\n \n UserlandInstance *instance = new UserlandInstance(this->m_isolationScope, v8Instance);\n \n boost::shared_ptr<UserlandInstance> adapter(instance);\n \n this->m_instances->push_back(adapter);\n \n return instance;\n}\n\ntemplate <class TResult, BOOST_PP_ENUM_PARAMS(N, class TClass) >\ninline typename boost::disable_if<\nboost::is_same<TResult, void>, TResult >::type\ninvoke(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n \n TResult result;\n \n if (!JsToNative(this->m_isolationScope, result, callback->Call(callback, N, argv)))\n {\n std::stringstream io;\n io << \"The function returned value does not match the specified TResult (\" << TypeId<TResult>().name() << \").\";\n throw std::runtime_error(io.str());\n }\n \n return result;\n}\n\ntemplate <class TResult, BOOST_PP_ENUM_PARAMS(N, class TClass) >\ninline typename boost::enable_if<\nboost::is_same<TResult, void>, TResult >::type\ninvoke(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n \n callback->Call(callback, N, argv);\n}\n\ntemplate <BOOST_PP_ENUM_PARAMS(N, class TClass) >\ninline Handle<Value> rawInvoke(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n \n return callback->Call(callback, N, argv);\n}\n\n# endif \n#endif\n"},"prefix":{"kind":"string","value":"\n\n#ifndef BOOST_PP_IS_ITERATING\n# ifndef v8bridge_userland_class_hpp\n# define v8bridge_userland_class_hpp\n\n# include <stdexcept>\n\n# include <v8bridge/detail/prefix.hpp>\n# include <v8bridge/conversion.hpp>\n\n# include <v8bridge/userland/userland_instance.hpp>\n\n# include <boost/preprocessor/repetition.hpp>\n# include <boost/preprocessor/iteration/iterate.hpp>\n# include <boost/shared_ptr.hpp>\n\nnamespace v8\n{\n namespace bridge\n {\n using namespace v8;\n \n \n \n class V8_DECL UserlandClass\n {\n public:\n UserlandClass(Isolate *isolationScope, Handle<Value> functionHandle) :\n m_isolationScope(isolationScope), m_function(isolationScope, Handle<Function>::Cast(functionHandle)) \n , m_instances(new TInstancesList())\n {\n };\n \n UserlandClass(Isolate *isolationScope, Handle<Function> functionHandle) :\n m_isolationScope(isolationScope), m_function(isolationScope, functionHandle)\n , m_instances(new TInstancesList())\n {\n \n };\n \n ~UserlandClass()\n {\n \n this->m_function.Reset();\n \n \n \n"},"suffix":{"kind":"string","value":" function returned value does not match the specified TResult (\" << TypeId<TResult>().name() << \").\";\n throw std::runtime_error(io.str());\n }\n \n return result;\n}\n\ntemplate <class TResult, BOOST_PP_ENUM_PARAMS(N, class TClass) >\ninline typename boost::enable_if<\nboost::is_same<TResult, void>, TResult >::type\ninvoke(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n \n callback->Call(callback, N, argv);\n}\n\ntemplate <BOOST_PP_ENUM_PARAMS(N, class TClass) >\ninline Handle<Value> rawInvoke(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n \n return callback->Call(callback, N, argv);\n}\n\n# endif \n#endif\n"},"middle":{"kind":"string","value":" for (TInstancesList::iterator it = this->m_instances->begin(); it != this->m_instances->end(); ++it)\n {\n (*it).reset();\n }\n \n this->m_instances->clear();\n }\n \n inline Local<Function> getCtorFunction() { return Local<Function>::New(this->m_isolationScope, this->m_function); }\n \n \n \n \n \n \n inline Local<Value> getHandle(std::string key)\n {\n EscapableHandleScope handle_scope(this->m_isolationScope);\n \n return handle_scope.Escape(\n this->getCtorFunction()->Get(String::NewFromUtf8(this->m_isolationScope, key.c_str()))\n );\n }\n \n template <class TType>\n inline TType getValue(std::string key)\n {\n Local<Value> value = this->getCtorFunction()->Get(String::NewFromUtf8(this->m_isolationScope, key.c_str()));\n TType result;\n if (!JsToNative(this->m_isolationScope, result, value))\n {\n std::stringstream io;\n io << \"The requested variable (\" << key << \")\"\n << \" does not match the specified TType (\" << TypeId<TType>().name() << \").\";\n throw std::runtime_error(io.str());\n }\n return result;\n }\n \n \n \n \n \n \n inline UserlandInstance *newInstance()\n {\n Handle<Value> argv[] = { };\n Handle<Value> v8Instance = this->getCtorFunction()->NewInstance(0, argv);\n \n UserlandInstance *instance = new UserlandInstance(this->m_isolationScope, v8Instance);\n \n boost::shared_ptr<UserlandInstance> adapter(instance);\n \n this->m_instances->push_back(adapter);\n \n return instance;\n }\n \n \n \n \n \n \n \n template <class TResult>\n inline typename boost::disable_if<\n boost::is_same<TResult, void>, TResult >::type\n invoke()\n {\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {};\n TResult result;\n \n if (!JsToNative(this->m_isolationScope, result, callback->Call(callback, 0, argv)))\n {\n std::stringstream io;\n io << \"The function returned value does not match the specified TResult (\" << TypeId<TResult>().name() << \").\";\n throw std::runtime_error(io.str());\n }\n \n return result;\n }\n \n \n template <class TResult>\n inline typename boost::enable_if<\n boost::is_same<TResult, void>, TResult >::type\n invoke()\n {\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {};\n \n callback->Call(callback, 0, argv);\n }\n \n \n inline Handle<Value> rawInvoke()\n {\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {};\n \n return callback->Call(callback, 0, argv);\n }\n \n \n \n \n \n# define BOOST_PP_ITERATION_PARAMS_1 (3, (1, V8_MAX_ARITY, <v8bridge/userland/userland_class.hpp>))\n# include BOOST_PP_ITERATE()\n private:\n typedef std::list<boost::shared_ptr<UserlandInstance> > TInstancesList;\n \n Isolate *m_isolationScope;\n Persistent<Function> m_function;\n TInstancesList *m_instances;\n };\n }\n}\n\n# endif \n#else \n# if BOOST_PP_ITERATION_DEPTH() == 1 \n# define N BOOST_PP_ITERATION()\n# define V8_BRIDGE_CALL_CONCAT_ARG(z, n, data) BOOST_PP_CAT(TClass, n) BOOST_PP_CAT(arg, n)\n# define V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE(z, n, data) NativeToJs<BOOST_PP_CAT(TClass, n)>(this->m_isolationScope, BOOST_PP_CAT(arg, n))\n\ntemplate <BOOST_PP_ENUM_PARAMS(N, class TClass) >\nUserlandInstance *newInstance(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n Handle<Value> v8Instance = this->getCtorFunction()->NewInstance(N, argv);\n \n UserlandInstance *instance = new UserlandInstance(this->m_isolationScope, v8Instance);\n \n boost::shared_ptr<UserlandInstance> adapter(instance);\n \n this->m_instances->push_back(adapter);\n \n return instance;\n}\n\ntemplate <class TResult, BOOST_PP_ENUM_PARAMS(N, class TClass) >\ninline typename boost::disable_if<\nboost::is_same<TResult, void>, TResult >::type\ninvoke(BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONCAT_ARG, ~))\n{\n HandleScope handle_scope(this->m_isolationScope);\n \n Local<Function> callback = this->getCtorFunction();\n Handle<Value> argv[] = {\n BOOST_PP_ENUM(N, V8_BRIDGE_CALL_CONVERT_TO_V8_ARG_TYPE, ~)\n };\n \n TResult result;\n \n if (!JsToNative(this->m_isolationScope, result, callback->Call(callback, N, argv)))\n {\n std::stringstream io;\n io << \"The"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":" class V8_DECL NativeClass : public NativeEndpoint\n\n {\n\n public:\n\n NativeClass(Isolate *isolationScope) : NativeEndpoint(isolationScope),\n\n m_ctor(new NativeCtor(isolationScope)),\n\n m_methods(new TMethodsMap()),\n\n m_staticMethods(new TMethodsMap()),\n\n m_accessors(new TMethodsMap()),\n\n m_staticAccessors(new TMethodsMap()),\n\n m_gc(new GC(isolationScope)),\n\n m_customDtorHandler(NULL)\n\n {\n\n HandleScope handle_scope(isolationScope);\n\n \n\n this->m_isAbstract = false;\n\n Local<FunctionTemplate> templ = FunctionTemplate::New(\n\n /* isolate: */this->m_isolationScope,\n\n /* callback (used as constructor) */ &NativeClass<TClass>::internalConstructorInvocationCallback,\n\n /* data: */External::New(isolationScope, (void *)this));\n\n \n","file_path":"v8bridge/native/native_class.hpp","rank":0,"score":124495.73461887747},{"content":" class ctor : public ctor_base<ctor<V8_BRIDGE_OVERLOAD_ARGS> >\n\n {\n\n private:\n\n typedef ctor_base<ctor<V8_BRIDGE_OVERLOAD_ARGS> > base;\n\n public:\n\n ctor() { }\n\n \n\n \n\n typedef detail::type_list<V8_BRIDGE_OVERLOAD_ARGS> signature_;\n\n \n\n typedef detail::is_optional<\n\n typename mpl::eval_if<\n\n mpl::empty<signature_>\n\n , mpl::false_\n\n , mpl::back<signature_>\n\n >::type\n\n > back_is_optional;\n\n \n\n typedef typename mpl::eval_if<\n\n back_is_optional\n","file_path":"v8bridge/detail/ctor.hpp","rank":1,"score":115683.58796522274},{"content":" class V8_DECL NativeFunction : public NativeEndpoint\n\n {\n\n public:\n\n NativeFunction(Isolate *isolationScope) : NativeEndpoint(isolationScope), m_overloads(new TOverloadsList())\n\n {\n\n HandleScope handle_scope(isolationScope);\n\n Local<FunctionTemplate> templ = FunctionTemplate::New(\n\n this->m_isolationScope,\n\n &NativeFunction::internalFunctionInvocationCallback,\n\n External::New(this->m_isolationScope, this)\n\n );\n\n \n\n this->m_templateDecl = new Eternal<FunctionTemplate>(this->m_isolationScope, templ);\n\n \n\n }\n\n \n\n ~NativeFunction()\n\n {\n\n for (TOverloadsList::iterator it = this->m_overloads->begin(); it != this->m_overloads->end(); ++it)\n\n {\n","file_path":"v8bridge/native/native_function.hpp","rank":3,"score":108854.82887776976},{"content":" class V8_DECL NativeCtor : public NativeFunction\n\n {\n\n public:\n\n NativeCtor(Isolate *isolationScope) : NativeFunction(isolationScope)\n\n {\n\n }\n\n \n\n template <class TFunction, class TSignature>\n\n inline NativeFunction *addOverload(TFunction functionPointer, TSignature signature)\n\n {\n\n /* Instead of registering NativeFunctionConcrete, we should register NativeCtorConcrete */\n\n NativeCtorConcrete<TFunction, TSignature> *ctorDecl = new NativeCtorConcrete<TFunction, TSignature>(this->m_isolationScope, functionPointer, signature);\n\n \n\n boost::shared_ptr< NativeCtorConcrete<TFunction, TSignature> > adapter(ctorDecl);\n\n this->m_overloads->push_back(adapter);\n\n \n\n return this;\n\n }\n\n };\n\n }\n\n}\n\n\n\n#endif\n","file_path":"v8bridge/native/native_ctor.hpp","rank":4,"score":108854.82887776976},{"content":" class V8_DECL NativeFunctionConcreteBase : public NativeEndpoint\n\n {\n\n public:\n\n NativeFunctionConcreteBase(Isolate *isolationScope)\n\n : NativeEndpoint(isolationScope) { }\n\n \n\n virtual bool canInvokeCall(const FunctionCallbackInfo<Value>& info) = 0;\n\n virtual void invokeCall(const FunctionCallbackInfo<Value>& info) = 0;\n\n virtual std::string getFormattedSignature() = 0;\n\n virtual bool isDirectArgsFunction() = 0;\n\n };\n\n \n\n //-------------------------------------------------\n\n // Generic implementation\n\n //-------------------------------------------------\n\n template <class TFunction, class TSignature>\n","file_path":"v8bridge/native/native_function_concrete.hpp","rank":5,"score":101631.17078570646},{"content":" class V8_DECL NativeFunctionConcrete : public NativeFunctionConcreteBase\n\n {\n\n public:\n\n NativeFunctionConcrete(Isolate *isolationScope, TFunction function, TSignature signature)\n\n : NativeFunctionConcreteBase(isolationScope), m_function(function), m_signature(signature)\n\n {\n\n \n\n }\n\n \n\n inline bool canInvokeCall(const FunctionCallbackInfo<Value>& info)\n\n {\n\n return this->forwardCanInvokeCall<TSignature>(info);\n\n }\n\n \n\n inline void invokeCall(const FunctionCallbackInfo<Value>& info)\n\n {\n\n this->forwardInvokeCall<TSignature>(info);\n\n }\n\n \n\n inline std::string getFormattedSignature()\n","file_path":"v8bridge/native/native_function_concrete.hpp","rank":6,"score":99531.42147604769},{"content":" class V8_DECL NativeCtorConcrete : /*public NativeFunctionConcrete<TFunction, TSignature>,*/ public NativeFunctionConcreteBase\n\n {\n\n public:\n\n NativeCtorConcrete(Isolate *isolationScope, TFunction function, TSignature signature)\n\n : NativeFunctionConcreteBase(isolationScope), m_function(function), m_signature(signature)\n\n {\n\n \n\n }\n\n \n\n inline bool canInvokeCall(const FunctionCallbackInfo<Value>& info)\n\n {\n\n return this->forwardCanInvokeCall<TSignature>(info);\n\n }\n\n \n\n inline void invokeCall(const FunctionCallbackInfo<Value>& info)\n\n {\n\n this->forwardInvokeCall<TSignature>(info);\n\n }\n\n \n\n inline std::string getFormattedSignature()\n","file_path":"v8bridge/native/native_ctor_concrete.hpp","rank":7,"score":91700.30334785064},{"content":" class V8_DECL GC\n\n {\n\n public:\n\n GC(Isolate *isolate) : m_isolationScope(isolate), m_map(new TCleanupMap()) { }\n\n ~GC()\n\n {\n\n this->collect(); // collect and release any remaining instances on the cleanup list.\n\n }\n\n \n\n typedef void (*TDtor)(void *ptr);\n\n \n\n /**\n\n * Queue the given object instance in the internal GC clearup instances list.\n\n * For more details about this method, see the second overload above.\n\n *\n\n * Note that this method make use of the GCGenericInstanceDestructor<TType>::dtor destructor implementation\n\n * in order to remove the object.\n\n * This is the default and typical implementation for destructors, which only deletes the instance from the memoory.\n\n * Thus, this implementation will fire the instance class dtor.\n\n */\n","file_path":"v8bridge/detail/internal_gc.hpp","rank":8,"score":84288.15763339221},{"content":" class V8_DECL ScriptingEngine\n\n {\n\n public:\n\n ScriptingEngine(bool registerBuiltinDeclaration = true) :\n\n m_registeredContractsMap(new TNativeContractMap()),\n\n m_registeredNativeClassesMap(new TNativeClassesContractMap())\n\n {\n\n //-------------------------------------------------\n\n // Create new isolation scope\n\n //-------------------------------------------------\n\n this->m_activeIsolationScope = Isolate::GetCurrent();\n\n //this->m_activeIsolationScope->Enter();\n\n \n\n //-------------------------------------------------\n\n // Create a temp scope\n\n //-------------------------------------------------\n\n HandleScope handle_scope(this->m_activeIsolationScope);\n\n \n\n //-------------------------------------------------\n\n // Create the active context\n","file_path":"v8bridge/scripting_engine.hpp","rank":9,"score":84288.15763339221},{"content":" class V8_DECL UserlandInstance\n\n {\n\n public:\n\n UserlandInstance(Isolate *isolationScope, Handle<Value> objectHandle) :\n\n m_isolationScope(isolationScope), m_object(isolationScope, Handle<Object>::Cast(objectHandle)) // will result in an error if the handle is not a object\n\n {\n\n };\n\n \n\n UserlandInstance(Isolate *isolationScope, Handle<Object> objectHandle) :\n\n m_isolationScope(isolationScope), m_object(isolationScope, objectHandle)\n\n {\n\n \n\n };\n\n \n\n ~UserlandInstance()\n\n {\n\n this->m_object.Reset();\n\n }\n\n \n\n inline Local<Object> getObjectHandle() { return Local<Object>::New(this->m_isolationScope, this->m_object); }\n","file_path":"v8bridge/userland/userland_instance.hpp","rank":10,"score":81962.15222658451},{"content":" class V8_DECL NativeEndpoint\n\n {\n\n public:\n\n inline Isolate *getIsolationScope() { return this->m_isolationScope; }\n\n protected:\n\n NativeEndpoint(Isolate *isolationScope) : m_isolationScope(isolationScope) { }\n\n Isolate *m_isolationScope;\n\n \n\n template <class TSignature>\n\n struct resolve_directly_passed_args : boost::is_same<\n\n const v8::FunctionCallbackInfo<Value> &,\n\n typename boost::mpl::at_c<TSignature, 1>::type > {};\n\n };\n\n }\n\n}\n\n\n\n#endif /* defined(__V8Bridge__NativeEndpoint__) */\n","file_path":"v8bridge/native/native_endpoint.hpp","rank":11,"score":81962.15222658451},{"content":" class V8_DECL UserlandFunction\n\n {\n\n public:\n\n //=======================================================================\n\n // ctor & dtor\n\n //=======================================================================\n\n \n\n UserlandFunction(Isolate *isolationScope, Handle<Value> functionHandle) :\n\n m_isolationScope(isolationScope), m_function(isolationScope, Handle<Function>::Cast(functionHandle)) // will result in an error if the handle is not a function\n\n {\n\n };\n\n \n\n UserlandFunction(Isolate *isolationScope, Handle<Function> functionHandle) :\n\n m_isolationScope(isolationScope), m_function(isolationScope, Handle<Function>::Cast(functionHandle))\n\n {\n\n \n\n };\n\n \n\n ~UserlandFunction()\n\n {\n","file_path":"v8bridge/userland/userland_function.hpp","rank":12,"score":81962.15222658451},{"content":"class Car\n\n{\n\npublic:\n\n Car() : m_color(\"\"), m_km(0) { };\n\n Car(std::string color) : m_color(color), m_km(0) { };\n\n Car(int km) : m_color(\"\"), m_km(km) { };\n\n Car(std::string color, int km) : m_color(color), m_km(km) { };\n\n \n\n Car(const FunctionCallbackInfo<Value> &info)\n\n {\n\n /* This constructor requires at least one argument.\n\n Calling Signature:\n\n Car(string format [, int km [, int ... ]] )\n\n \n\n It can reminds us the add() method in the functions_v8_args.cpp example.\n\n */\n\n \n\n if (info.Length() == 0)\n\n {\n\n throw std::runtime_error(\"The add function must receive at least one argument.\");\n","file_path":"samples/cpp_classes_ctor.cpp","rank":13,"score":54103.593479696916},{"content":"class Car\n\n{\n\npublic:\n\n Car() { };\n\n \n\n void setColor(std::string color)\n\n {\n\n this->m_color = color;\n\n }\n\n \n\n std::string getColor()\n\n {\n\n return this->m_color;\n\n }\n\n \n\n void drive()\n\n {\n\n std::cout << \"** I'm driving a \" << this->getColor() << \" car! **\" << std::endl;\n\n }\n\nprivate:\n","file_path":"samples/cpp_classes_basics.cpp","rank":14,"score":54103.593479696916},{"content":"class FileUtils\n\n{\n\npublic:\n\n static bool FileExists(std::string const filePath)\n\n {\n\n std::ifstream f(filePath.c_str());\n\n if (f.good()) {\n\n f.close();\n\n return true;\n\n } else {\n\n f.close();\n\n return false;\n\n }\n\n };\n\n \n\n static std::string Read(std::string const filePath)\n\n {\n\n std::ifstream f(filePath.c_str());\n\n if (f.good()) {\n\n return \"\";\n","file_path":"samples/cpp_classes_static.cpp","rank":15,"score":52901.14552443195},{"content":"\t\tclass TypeId\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tTypeId() { }\n\n \n\n\t\t\tbool operator!=(TypeId const& other) const\n\n\t\t\t{\n\n\t\t\t\treturn this->name() != other->name();\n\n\t\t\t}\n\n \n\n\t\t\tbool operator==(TypeId const& other) const\n\n\t\t\t{\n\n\t\t\t\treturn this->name() == other->name();\n\n\t\t\t}\n\n \n\n\t\t\tinline std::string name() const\n\n\t\t\t{\n\n\t\t\t\treturn this->getClassName(__FUNCTION__);\n\n\t\t\t}\n\n \n","file_path":"v8bridge/detail/typeid.hpp","rank":16,"score":44433.99412122423},{"content":" class TypeId\n\n {\n\n public:\n\n TypeId() : id(&typeid(TClass))\n\n {}\n\n \n\n bool operator!=(TypeId const& other) const\n\n {\n\n return *id != *other.id;\n\n }\n\n \n\n bool operator==(TypeId const& other) const\n\n {\n\n return *id == *other.id;\n\n }\n\n \n\n inline char const* name() const\n\n {\n\n return id->name();\n\n }\n\n \n\n private:\n\n type_info const* id;\n\n };\n\n#endif\n\n }\n\n}\n\n\n\n#endif\n","file_path":"v8bridge/detail/typeid.hpp","rank":17,"score":44433.99412122423},{"content":" class ctor; // forward declaration\n\n \n\n \n\n template <V8_BRIDGE_OVERLOAD_TYPES_WITH_DEFAULT_VALUE>\n\n struct optional; // forward declaration\n\n \n\n namespace detail\n\n {\n\n template <class TClass>\n\n struct is_optional\n\n : mpl::false_\n\n {};\n\n \n\n template <V8_BRIDGE_OVERLOAD_TYPES>\n\n struct is_optional<optional<V8_BRIDGE_OVERLOAD_ARGS> >\n\n : mpl::true_\n\n {};\n\n \n\n template <class S>\n\n struct step_backward : mpl::iterator_range<\n","file_path":"v8bridge/detail/ctor.hpp","rank":18,"score":40151.62982851073},{"content":"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n/**\n\n * This is an sample file for v8bridge API interaction.\n\n *\n\n * This file provides a simple demonstration of defining JS \"class\" and accessing it by C++ using the Userland API.\n\n * In this demo, we're declaring a simple Car JS class. Then, by using UserlandClass we're creating a new instance,\n\n * calling it's method(s) and changing its ivar value.\n\n */\n\n\n\n#include <iostream>\n\n#include <sstream>\n\n\n\n#define V8BRIDGE_DEBUG 1\n\n#include <v8bridge/v8bridge.hpp>\n","file_path":"samples/js_classes.cpp","rank":19,"score":33442.31354356685},{"content":"\n\nusing namespace v8;\n\nusing namespace v8::bridge;\n\n\n\nint main(int argc, const char * argv[])\n\n{\n\n /* Create a scripting engine */\n\n ScriptingEngine *engine = new ScriptingEngine();\n\n HandleScope handle_scope(engine->getActiveIsolationScope());\n\n \n\n /* Create a new \"JS class\" */\n\n std::stringstream io;\n\n io << \"var Car = (function () {\" << std::endl;\n\n io << \" function Car(color) {\" << std::endl;\n\n io << \" this.color = color;\" << std::endl;\n\n io << \" };\" << std::endl;\n\n io << \" Car.prototype.getColor = function () {\" << std::endl;\n\n io << \" return this.color;\" << std::endl;\n\n io << \" };\" << std::endl;\n\n io << \" Car.prototype.setColor = function (color) {\" << std::endl;\n","file_path":"samples/js_classes.cpp","rank":20,"score":33439.50098724983},{"content":" io << \" this.color = color;\" << std::endl;\n\n io << \" };\" << std::endl;\n\n io << \" Car.prototype.drive = function () {\" << std::endl;\n\n io << \" return 'I\\\\'m driving in ' + this.color + ' car!';\" << std::endl;\n\n io << \" };\" << std::endl;\n\n io << \" return Car;\" << std::endl;\n\n io << \"})();\" << std::endl;\n\n \n\n engine->execute(io.str(), /* fileName: */ \"car.js\");\n\n \n\n /** To access the JS class, we should use the UserlandClass class which\n\n provides us basic interface for interaction with the defined class.\n\n \n\n Note that UserlandClass ctor requires an Handle<Function> (there's an overload for Handle<Value>)\n\n which represents the JS class ctor. To get it, as shown below, we can use the ScriptingEngine::getFromGlobalScope method,\n\n which retrives an handle that's been stored on the global scope. The handle we wish to request is the class representing variable - Car. **/\n\n UserlandClass *carJsClass = new UserlandClass(engine->getActiveIsolationScope(), engine->getFromGlobalScope(\"Car\"));\n\n \n\n /** Now, lets create a new instance of the JS class. The C++ type that will hold the created type\n\n is UserlandInstance. UserlandInstance provides us simple interface to execute instance-related actions.\n","file_path":"samples/js_classes.cpp","rank":21,"score":33433.5235010281},{"content":" \n\n Note that the created instance is been stored as boost::shared_ptr in UserlandClass and will be released when\n\n the UserlandClass object will be disposed. */\n\n UserlandInstance *carInstance = carJsClass->newInstance( /* color: */ \"Red\");\n\n \n\n // Print the current driving state (driving with red car, because of JS ctor)\n\n std::cout << carInstance->invoke<std::string>(\"drive\") << std::endl;\n\n \n\n // Set the car color using the defined setter\n\n carInstance->invoke<void>(\"setColor\", \"Blue\");\n\n \n\n // Print the current driving state (driving with blue car)\n\n std::cout << carInstance->invoke<std::string>(\"drive\") << std::endl;\n\n \n\n // Set the car color by (in a very hacky way!) accessing the class member directly\n\n carInstance->setValue(\"color\", \"Yellow\");\n\n \n\n // Print the current driving state (driving with yellow car)\n\n std::cout << carInstance->invoke<std::string>(\"drive\") << std::endl;\n\n \n\n /* Free */\n\n delete carJsClass;\n\n delete engine;\n\n \n\n /* Done. */\n\n return 0;\n\n}\n","file_path":"samples/js_classes.cpp","rank":22,"score":33432.36024523415},{"content":"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\n\n// Redistribution and use in source and binary forms, with or without\n\n// modification, are permitted provided that the following conditions are\n\n// met:\n\n//\n\n// * Redistributions of source code must retain the above copyright\n\n// notice, this list of conditions and the following disclaimer.\n\n// * Redistributions in binary form must reproduce the above\n\n// copyright notice, this list of conditions and the following\n\n// disclaimer in the documentation and/or other materials provided\n\n// with the distribution.\n\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\n\n// contributors may be used to endorse or promote products derived\n\n// from this software without specific prior written permission.\n\n//\n\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n","file_path":"samples/js_classes.cpp","rank":23,"score":33431.85850182063},{"content":"\n\nusing namespace v8;\n\nusing namespace v8::bridge;\n\n\n\nint add(const FunctionCallbackInfo<Value> &info)\n\n{\n\n if (info.Length() == 0)\n\n {\n\n throw std::runtime_error(\"The add function must receive at least one argument.\");\n\n }\n\n \n\n int result = 0;\n\n for (int i = 0; i < info.Length(); i++)\n\n {\n\n if (!info[i]->IsInt32())\n\n {\n\n throw std::runtime_error(\"All of the function passed arguments should be integers.\");\n\n }\n\n \n\n result += info[i]->Int32Value();\n","file_path":"samples/functions_v8_args.cpp","rank":24,"score":33017.783390380675},{"content":"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n/**\n\n * This is an sample file for v8bridge API interaction.\n\n *\n\n * This file provides a simple demonstration of accepting directly V8 args info.\n\n * In this demo, we're declaring a simple add function. However, we're not using the Conversion API\n\n * to convert the args into native types. We're accepting raw-V8 args and adding all of them.\n\n */\n\n\n\n#include <iostream>\n\n#include <sstream>\n\n\n\n#define V8BRIDGE_DEBUG 1\n\n#include <v8bridge/v8bridge.hpp>\n","file_path":"samples/functions_v8_args.cpp","rank":25,"score":33017.376043192},{"content":"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\n\n// Redistribution and use in source and binary forms, with or without\n\n// modification, are permitted provided that the following conditions are\n\n// met:\n\n//\n\n// * Redistributions of source code must retain the above copyright\n\n// notice, this list of conditions and the following disclaimer.\n\n// * Redistributions in binary form must reproduce the above\n\n// copyright notice, this list of conditions and the following\n\n// disclaimer in the documentation and/or other materials provided\n\n// with the distribution.\n\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\n\n// contributors may be used to endorse or promote products derived\n\n// from this software without specific prior written permission.\n\n//\n\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n","file_path":"samples/functions_v8_args.cpp","rank":26,"score":33008.34155101271},{"content":" }\n\n \n\n return result;\n\n}\n\n\n\nint main(int argc, const char * argv[])\n\n{\n\n /* Create a scripting engine */\n\n ScriptingEngine *engine = new ScriptingEngine();\n\n \n\n /* Create the add function */\n\n NativeFunction *addFunction = new NativeFunction(engine->getActiveIsolationScope());\n\n addFunction->addOverload(add);\n\n engine->exposeFunction(addFunction, \"add\");\n\n \n\n /* Execute! */ \n\n std::cout << \"add(1): \" << engine->eval<int>(\"add(1)\") << std::endl;\n\n std::cout << \"add(1, 1): \" << engine->eval<int>(\"add(1, 1)\") << std::endl;\n\n std::cout << \"add(1, 2): \" << engine->eval<int>(\"add(1, 2)\") << std::endl;\n\n std::cout << \"add(1, 2, 3): \" << engine->eval<int>(\"add(1, 2, 3)\") << std::endl;\n","file_path":"samples/functions_v8_args.cpp","rank":27,"score":33002.610990873545},{"content":" std::cout << \"add(1, 2, 2, 3): \" << engine->eval<int>(\"add(1, 2, 2, 3)\") << std::endl;\n\n \n\n /* Free */\n\n delete addFunction;\n\n delete engine;\n\n \n\n /* Done. */\n\n return 0;\n\n}\n","file_path":"samples/functions_v8_args.cpp","rank":28,"score":33002.610990873545},{"content":"#include <sstream>\n\n#include <fstream>\n\n\n\n#define V8BRIDGE_DEBUG 1\n\n#include <v8bridge/v8bridge.hpp>\n\n\n\nusing namespace v8;\n\nusing namespace v8::bridge;\n\n\n\n/* Declare a file-utils class */\n","file_path":"samples/cpp_classes_static.cpp","rank":29,"score":31799.012713414428},{"content":"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n/**\n\n * This is an sample file for v8bridge API interaction.\n\n *\n\n * This file provides a simple demonstration of binding a C++ class to JS.\n\n * In this demo, we're declaring a simple Car with one ivar (m_color) and three methods - getter, setter and standard method.\n\n * Then, we're expsoing the Car class using v8bridge NativeClass interface.\n\n * Finally, we're creating in JS a new instance of Car, setting its color using the \"color\" property and invoking drive().\n\n * \n\n * Note: when \"delete carClass;\" is been called, the \"car\" instance that we've defined in JS is been removed\n\n * by v8bridge internal GC. For more details on why is this happing and why we need this, see internal_gc.hpp.\n\n */\n\n\n\n#include <iostream>\n\n#include <sstream>\n\n\n\n#define V8BRIDGE_DEBUG 1\n\n#include <v8bridge/v8bridge.hpp>\n\n\n\nusing namespace v8;\n\nusing namespace v8::bridge;\n\n\n\n/* Declare a simple class */\n","file_path":"samples/cpp_classes_basics.cpp","rank":30,"score":31797.11984287624},{"content":"#include <v8bridge/native/native_function.hpp>\n\n#include <v8bridge/native/native_ctor.hpp>\n\n#include <v8bridge/detail/internal_gc.hpp>\n\n#include <v8bridge/conversion.hpp>\n\n\n\n#include <boost/shared_ptr.hpp>\n\n#include <boost/mpl/if.hpp>\n\n#include <boost/type_traits/is_same.hpp>\n\n\n\nnamespace v8\n\n{\n\n namespace bridge\n\n {\n\n /**\n\n * Specific class used to provide interface for binding C++ classes to JS function (classes).\n\n * This class also automaticly connects the C++ type with JsToNative and NativeToJs conversion API\n\n * so the class instances can be passed between C++ and JS.\n\n *\n\n * Simple usage:\n\n * C++:\n","file_path":"v8bridge/native/native_class.hpp","rank":32,"score":31792.842402340146},{"content":"/* Macro shortcut that evaluates a given script and echo its result */\n\n#define JS_PRINT_HANDLE(jsCode) do \\\n\n { \\\n\n String::Utf8Value utf8(engine->v8Eval(jsCode)); \\\n\n std::cout << *utf8 << std::endl; \\\n\n } while (false);\n\n\n\nusing namespace v8;\n\nusing namespace v8::bridge;\n\n\n\n/* Declare a simple class */\n","file_path":"samples/cpp_classes_ctor.cpp","rank":33,"score":31792.231607752416},{"content":"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n/**\n\n * This is an sample file for v8bridge API interaction.\n\n *\n\n * This file provides a simple demonstration of binding a C++ class to JS.\n\n * In this demo, we're defining 4 constructors in the Car class. Then, we're exposing them to JS and using them.\n\n */\n\n\n\n#include <iostream>\n\n#include <sstream>\n\n\n\n#define V8BRIDGE_DEBUG 1\n\n#include <v8bridge/v8bridge.hpp>\n\n\n","file_path":"samples/cpp_classes_ctor.cpp","rank":35,"score":31790.02486793672},{"content":" \n\n if (self->m_isAbstract)\n\n {\n\n std::stringstream io;\n\n io << \"Could not create an instance of the class \" << TypeId<typename TypeResolver<TClass>::type >().name() << \" since it was marked as abstract class.\" << std::endl;\n\n#if V8BRIDGE_DEBUG\n\n io << \"In order to allow the class instantiation, you should call the NativeClass<TClass>::declareAsAbstract with false argument.\";\n\n#endif\n\n self->m_isolationScope->ThrowException(\n\n v8::Exception::TypeError(String::NewFromUtf8(self->m_isolationScope, io.str().c_str()))\n\n );\n\n return;\n\n }\n\n \n\n //-------------------------------------------------\n\n // We got two cases to deal with.\n\n // - The first one is in which we're trying to instansiate plain new object (e.g. from JS)\n\n // In this case, we should allocate a new coresponding CPP object (i.e. \"var p = new Point(x, y);\" in JS will allocate new CPP Point).\n\n // - The second one is case in which we're trying to Convert Existing CPP Object to JS (i.e. by using NativeToJs interface).\n\n // in this case we still should create a new JS object, but We Shouldn't Allocate a new CPP object but using the Existing one.\n","file_path":"v8bridge/native/native_class.hpp","rank":36,"score":31788.449120047142},{"content":"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n#ifndef v8bridge_native_class_hpp\n\n#define v8bridge_native_class_hpp\n\n\n\n#include <boost/shared_ptr.hpp>\n\n#include <v8bridge/detail/prefix.hpp>\n\n\n\n#include <v8bridge/detail/typeid.hpp>\n\n#include <v8bridge/conversion/type_resolver.hpp>\n\n\n\n#include <v8bridge/detail/signature.hpp>\n\n#include <v8bridge/detail/ctor.hpp>\n\n#include <v8bridge/native/invoke_native_ctor.hpp>\n\n#include <v8bridge/native/native_endpoint.hpp>\n","file_path":"v8bridge/native/native_class.hpp","rank":39,"score":31787.83319507332},{"content":" }\n\n \n\n // Builds ctor function which inserts the given Holder type\n\n // in a wrapped C++ class instance. ArgList is an MPL type sequence\n\n // describing the C++ argument types to be passed to Holder's\n\n // constructor.\n\n //\n\n // Holder and ArgList are intended to be explicitly specified.\n\n template <class TArgList, class TArity>\n\n inline NativeClass<TClass> *exposeCtor(TArgList* = 0, TArity* = 0)\n\n {\n\n return this->_exposeCtor(\n\n ::v8::bridge::detail::invoke_native_ctor<TArity::value>::template apply<TClass, TArgList>::execute,\n\n get_signature(::v8::bridge::detail::invoke_native_ctor<TArity::value>::template apply<TClass, TArgList>::execute)\n\n );\n\n }\n\n \n\n //=======================================================================\n\n // Exposing Class Member(s)\n\n //=======================================================================\n","file_path":"v8bridge/native/native_class.hpp","rank":40,"score":31787.42360880064},{"content":"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n/**\n\n * This is an sample file for v8bridge API interaction.\n\n *\n\n * This file provides a simple demonstration of binding a C++ class to JS.\n\n * In this demo, we're declaring a simple Car with one ivar (m_color) and three methods - getter, setter and standard method.\n\n * Then, we're expsoing the Car class using v8bridge NativeClass interface.\n\n * Finally, we're creating in JS a new instance of Car, setting its color using the \"color\" property and invoking drive().\n\n *\n\n * Note: when \"delete carClass;\" is been called, the \"car\" instance that we've defined in JS is been removed\n\n * by v8bridge internal GC. For more details on why is this happing and why we need this, see internal_gc.hpp.\n\n */\n\n\n\n#include <iostream>\n","file_path":"samples/cpp_classes_static.cpp","rank":41,"score":31787.04180149356},{"content":" \n\n Local<Object> obj = this->getTemplate()\n\n ->GetFunction()\n\n ->NewInstance(1, argv);\n\n \n\n return handle_scope.Escape(obj);\n\n }\n\n \n\n inline TClass *unwrap(Handle<Object> object)\n\n {\n\n return static_cast<TClass *>(object->GetAlignedPointerFromInternalField(object->InternalFieldCount() - 2));\n\n }\n\n \n\n //=======================================================================\n\n // V8 API related\n\n //=======================================================================\n\n \n\n /**\n\n * Use this method to setup the allocated memory adjustment that should be make in\n\n * V8 when creating new instance.\n","file_path":"v8bridge/native/native_class.hpp","rank":42,"score":31786.988578273245},{"content":" bool m_isAbstract;\n\n int m_internalFieldsCount = 0;\n\n \n\n mutable Eternal<FunctionTemplate> *m_templateDecl;\n\n \n\n size_t m_allocatedMemoryAdjustment = sizeof(TClass);\n\n GC *m_gc;\n\n GC::TDtor m_customDtorHandler;\n\n \n\n inline static void internalConstructorInvocationCallback(const FunctionCallbackInfo<Value>& info)\n\n {\n\n using namespace boost;\n\n \n\n NativeClass<TClass> *self = static_cast<NativeClass<TClass> *>(External::Cast(*info.Data())->Value());\n\n \n\n EscapableHandleScope handle_scope(self->m_isolationScope);\n\n \n\n //-------------------------------------------------\n\n // Firstly, make sure that this class wasn't marked as abstract\n\n //-------------------------------------------------\n","file_path":"v8bridge/native/native_class.hpp","rank":45,"score":31786.207665752547},{"content":" //\n\n // As a result, we can't forward the constructor directly to the CPP ctor but create a constructor that discrimiate between these cases.\n\n // The solution that came up is to pass the native instance as an External value when using NativeToJs. Here, we should check whether or not we've recevived as ctor args only 1 arg of type External.\n\n // if so, this is NativeToJs. Otherwise - we're dealing with new instansiation.\n\n //\n\n // For more details, see: http://create.tpsitulsa.com/blog/2009/01/29/v8-objects/\n\n //-------------------------------------------------\n\n External *externalInstance;\n\n TClass *instance;\n\n if (!info[0]->IsExternal())\n\n {\n\n //-------------------------------------------------\n\n // Do we got at least one constructor?\n\n // If not, we shall use a default one\n\n //-------------------------------------------------\n\n \n\n if (self->m_ctor->getOverloadsCount() < 1)\n\n {\n\n /* There's no constructor, so just create the object */\n\n try\n","file_path":"v8bridge/native/native_class.hpp","rank":46,"score":31784.962192439347},{"content":" *\n\n * For more details about the memory adjustment, see Isolate::AdjustAmountOfExternalAllocatedMemory\n\n * \n\n * You should call this method only when setting-up the NativeClass with fixed value. Otherwise, it may lead to memory-leak mistakes.\n\n *\n\n * Default adjustment:\n\n * If you wouldn't call this method at all, the default implementation use sizeof(TClass), which should be just fine for most cases.\n\n * \n\n * Zero:\n\n * Passing zero will cause to no memory ajustment been made at all.\n\n */\n\n inline NativeClass<TClass> *setAllocatedMemoryAdjustment(size_t cost)\n\n {\n\n this->m_allocatedMemoryAdjustment = cost;\n\n }\n\n \n\n /**\n\n * Set the number of internal fields the native class should reserve.\n\n * For basic knowladge on internal fields,\n\n please see V8's SetInternalFieldCount, SetAlignedPointerAtInternalField, GetIntenralPointerFromInternalField, SetInternalField and GetIntenralField.\n","file_path":"v8bridge/native/native_class.hpp","rank":47,"score":31784.867089699943},{"content":" inline NativeClass<TClass> *exposeStaticConstant(std::string name, int value)\n\n {\n\n this->getTemplate()->GetFunction()->Set(String::NewFromUtf8(this->m_isolationScope, name.c_str()),\n\n Number::New(this->m_isolationScope, value),\n\n static_cast<v8::PropertyAttribute>(v8::ReadOnly | v8::DontDelete));\n\n return this;\n\n }\n\n \n\n /**\n\n * Expose a specific method or method overload to JavaScript.\n\n * Note: sending the same methodName will allow to register an overload.\n\n *\n\n * @param std::string methodName - The JS method name.\n\n * @param TMethod method - reference to the C++ method.\n\n * @return NativeClass<TClass>\n\n *\n\n * Example:\n\n * C++:\n\n * carClass->exposeMethod(\"drive\", &Car::drive);\n\n * carClass->exposeStaticMethod(\"foo\", &Car::foo);\n","file_path":"v8bridge/native/native_class.hpp","rank":48,"score":31784.45948414152},{"content":" \n\n /* Expose the car to JS global scope. */\n\n engine->exposeClass(carClass);\n\n \n\n /* Execute! */\n\n HandleScope handle_scope(engine->getActiveIsolationScope()); // JS_PRINT_HANDLE uses ScriptingEngine::v8Eval which requires an handle scope since it returns raw v8 values\n\n \n\n // Fires Car(). should print blank/zero values since color and km was not set.\n\n JS_PRINT_HANDLE(\"var car = new Car(); 'Color: ' + car.color + '; KM: ' + car.km;\");\n\n std::cout << \"=========================================\" << std::endl;\n\n \n\n // Fires Car(std::string color). Should print 0 as KM since it was not set and \"Red\" as color.\n\n JS_PRINT_HANDLE(\"var car = new Car('Red'); 'Color: ' + car.color + '; KM: ' + car.km;\");\n\n std::cout << \"=========================================\" << std::endl;\n\n \n\n // Fires Car(int km). Should print blank color since it was not set and 10 as KM.\n\n JS_PRINT_HANDLE(\"var car = new Car(10); 'Color: ' + car.color + '; KM: ' + car.km;\");\n\n std::cout << \"=========================================\" << std::endl;\n\n \n\n // Fires Car(std::string color, int km). Should print \"Red\" as color and 10 as KM.\n","file_path":"samples/cpp_classes_ctor.cpp","rank":49,"score":31783.9629476724},{"content":" std::string m_color;\n\n};\n\n\n\nint main(int argc, const char * argv[])\n\n{\n\n /* Create a scripting engine */\n\n ScriptingEngine *engine = new ScriptingEngine();\n\n \n\n /* Create a new NativeClass which will be our endpoint for a native C++ class.\n\n The TClass template arg representing the class that you wish to expose.\n\n When exposing a class, it's been automaticly added to the Conversion API. */\n\n NativeClass<Car> *carClass = new NativeClass<Car>(engine->getActiveIsolationScope());\n\n \n\n /* We want to expose the \"getColor\" and \"setColor\" getter/setter\n\n and the drive method. Since the constructor is default, we don't need\n\n to explicity expose it.\n\n \n\n Note: If you don't want to allow to use the default constructor, you got two options:\n\n 1. You can use the exposeCtor with a ctor that requires an arguments. In this case,\n\n v8bridge won't allow the non-args ctor.\n","file_path":"samples/cpp_classes_basics.cpp","rank":50,"score":31783.895339106777},{"content":" /* Create persistent object so we can make this object accessable outside the handle-scope ?*/\n\n v8::Persistent<v8::Object> handle(self->m_isolationScope, info.This());\n\n \n\n /* Setup weak connection */\n\n handle.SetWeak(instance, &NativeClass<TClass>::WeakObjectsDeletionCallback);\n\n handle.MarkIndependent();\n\n \n\n /* Expose to the class GC */\n\n if (self->m_customDtorHandler == NULL)\n\n {\n\n self->m_gc->queue(instance); // we can not send null, otherwise even the default dtor wont be run, thus, the object won't be released.\n\n }\n\n else\n\n {\n\n self->m_gc->queue(instance, self->m_customDtorHandler);\n\n }\n\n }\n\n \n\n //=======================================================================\n\n // Private methods\n","file_path":"v8bridge/native/native_class.hpp","rank":52,"score":31783.410368248005},{"content":" * Declares a custom destructor implementation.\n\n * The given dtor will be called when the object should be free'd (for instance, by the GC).\n\n *\n\n * Note that if you will not specify any custom dtor, the default implementation (GCGenericInstanceDestructor declared in internal_gc.hpp)\n\n * will attempt to dispose the instance using \"delete\" (and as a result will call the class destructor.\n\n */\n\n inline NativeClass<TClass> *declareCustomDtor(GC::TDtor dtor)\n\n {\n\n this->m_customDtorHandler = dtor;\n\n }\n\n \n\n //=======================================================================\n\n // Exposing Ctor(s)\n\n //=======================================================================\n\n \n\n template <class TCtor>\n\n inline NativeClass<TClass> *exposeCtor(TCtor const& constructor)\n\n {\n\n constructor.define(*this);\n\n return this;\n","file_path":"v8bridge/native/native_class.hpp","rank":53,"score":31783.21032496911},{"content":" 2. You can use the declareAsAbstract() method to declare the class as abstract.\n\n */\n\n \n\n // drive - expose a method:\n\n carClass->exposeMethod(\"drive\", &Car::drive);\n\n \n\n // getColor and setColor - expose as property accessor:\n\n carClass->exposePropertyAccessor(\"color\", &Car::getColor, &Car::setColor);\n\n \n\n /* Expose the car to JS global scope.\n\n NOTE: just like in NativeFunction, you MUST call this method,\n\n and you MUST do it AFTER FINISHING TO CONFIGURE YOUR ENDPOINT. */\n\n engine->exposeClass(carClass);\n\n \n\n /* Execute! */\n\n std::stringstream io;\n\n io << \"var car = new Car();\" << std::endl;\n\n io << \"car.color = 'red';\" << std::endl;\n\n io << \"car.drive();\";\n\n \n","file_path":"samples/cpp_classes_basics.cpp","rank":54,"score":31783.059054560792},{"content":" //=======================================================================\n\n \n\n /**\n\n * Expose a specific property to JavaScript.\n\n *\n\n * For details, please see: NativeClass<TClass>::exposePropertyAccessor<TGetter, TSetter>(std::string, TGetter, TSetter, std::string, std::string)\n\n *\n\n * Note: This version expose a \"read-only\" property.\n\n * For read-and-write you should use exposePropertyAccessor<TGetter, TSetter>(std::string, TGetter, TSetter)\n\n *\n\n * @param std::string propertyName - the name of the property (variable) in JS.\n\n * @param TGetter getter - a reference to the getter method.\n\n * @param std::string getterMethodName [optional] - If specified, in addition to the property accessor declaration,\n\n * we're also binding the referenced TGetter to the given method name (i.e. one can access using the C++ method by \"x\" and \"getX\").\n\n */\n\n template<typename TGetter>\n\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, TGetter getter, std::string getterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getter, getterMethodName, /* isStatic: */false);\n\n }\n","file_path":"v8bridge/native/native_class.hpp","rank":55,"score":31782.900613024518},{"content":" this->m_isolationScope->AdjustAmountOfExternalAllocatedMemory(this->m_allocatedMemoryAdjustment * -1);\n\n \n\n return this;\n\n }\n\n \n\n /**\n\n * Dispose the given object handle instance and free the underlaying C++ binded instance.\n\n */\n\n inline NativeClass<TClass> *disposeInstance(Handle<Value> handle)\n\n {\n\n if (handle.IsEmpty() || ! handle->IsObject()) { return this; }\n\n return this->disposeInstance(Handle<Object>(Object::Cast(*handle)));\n\n }\n\n \n\n \n\n /**\n\n * Static callback used with Persistent<T>.SetWeak in order to\n\n * delete references.\n\n */\n\n template <typename T, typename P>\n","file_path":"v8bridge/native/native_class.hpp","rank":56,"score":31782.825896325827},{"content":" }\n\n else\n\n {\n\n /* Get the v8::External instance */\n\n externalInstance = External::Cast(*info[0]);\n\n \n\n /* Get the TClass instance */\n\n instance = (TClass *)externalInstance->Value();\n\n }\n\n \n\n /* Save the TClass instance in the new created JS object */\n\n info.This()->SetAlignedPointerInInternalField(info.This()->InternalFieldCount() - 2, (void *)instance);\n\n \n\n /* Basic memory adjustment */\n\n self->m_isolationScope->AdjustAmountOfExternalAllocatedMemory(self->m_allocatedMemoryAdjustment);\n\n \n\n /* Save an pointer to \"this\" (self variable) since\n\n we can't access it in the SetWeak() callback. */\n\n info.This()->SetAlignedPointerInInternalField(info.This()->InternalFieldCount() - 1, (void *)self);\n\n \n","file_path":"v8bridge/native/native_class.hpp","rank":57,"score":31782.74711982896},{"content":" \n\n /**\n\n * Dispose the given object handle instance and free the underlaying C++ binded instance.\n\n */\n\n inline NativeClass<TClass> *disposeInstance(Handle<Object> handle)\n\n {\n\n v8::HandleScope handle_scope(this->m_isolationScope);\n\n Persistent<Object> p(this->m_isolationScope, handle);\n\n \n\n void* ptr = handle->GetAlignedPointerFromInternalField(handle->InternalFieldCount() - 2);\n\n \n\n this->m_gc->disposeAndDequeue(ptr);\n\n \n\n for (int i = 0; i < handle->InternalFieldCount(); i++)\n\n {\n\n handle->SetAlignedPointerInInternalField(i, NULL);\n\n }\n\n p.Reset();\n\n \n\n /* Memory adjustment */\n","file_path":"v8bridge/native/native_class.hpp","rank":58,"score":31782.496913945146},{"content":" *\n\n * You should note that the internal fields count is the number of fields that you wish to reserve in order to been used BY YOU, not by v8bridge.\n\n * v8bridge reserves 2 internal fields, so in case you're not reserving anything (0) the number of internal fields will be 2,\n\n * in case you reserve 2 fields the internal fields count will be 4 and so on.\n\n *\n\n * v8bridge internal fields description:\n\n * 1'th field (N + 0'th index): A pointer to the binded (connected) C++ class instance.\n\n * 2'th field (N + 1'th index): A pointer to the owner NativeClass instance.\n\n */\n\n inline NativeClass<TClass> *setInternalFieldsCount(int fieldsCount)\n\n {\n\n this->m_templateDecl->Get(this->m_isolationScope)->InstanceTemplate()->SetInternalFieldCount(fieldsCount + 2);\n\n this->m_templateDecl->Get(this->m_isolationScope)->PrototypeTemplate()->SetInternalFieldCount(fieldsCount + 2);\n\n \n\n return this;\n\n }\n\n \n\n //=======================================================================\n\n // Helpers\n\n //=======================================================================\n","file_path":"v8bridge/native/native_class.hpp","rank":59,"score":31782.298670884567},{"content":" \n\n // Properties (We're exposing read-only properties)\n\n carClass->exposePropertyAccessor(\"color\", &Car::getColor)\n\n ->exposePropertyAccessor(\"km\", &Car::getKm); \n\n \n\n /* Expose the class ctors. Since we can't receive from C++ the singature of a ctor (or dtor)\n\n we should use an alternative approch. Based on boost python binding approch, I've created a\n\n ctor types-list which is representing a ctor singature. You may send it to NativeClass<TClass>::exposeCtor()\n\n to declare a class.\n\n \n\n Examples:\n\n exposeCtor(ctor<>()) - empty (default) ctor. Note: you should not declare it unless you got another constructor overload.\n\n exposeCtor(ctor<int>()) - ctor that accepts an int.\n\n exposeCtor(ctor<int, int>()) - ctor that accepts two ints.\n\n */\n\n carClass->exposeCtor(ctor<>()) // Car()\n\n ->exposeCtor(ctor<std::string>()) // Car(std::string color)\n\n ->exposeCtor(ctor<int>()) // Car(int km)\n\n ->exposeCtor(ctor<std::string, int>()) // Car(std::string color, int km)\n\n ->exposeCtor(ctor<const FunctionCallbackInfo<Value> &>()); // fallback ctor - Car(const FunctionCallbackInfo<Value> &info)\n","file_path":"samples/cpp_classes_ctor.cpp","rank":60,"score":31781.905079955202},{"content":"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\n\n// Redistribution and use in source and binary forms, with or without\n\n// modification, are permitted provided that the following conditions are\n\n// met:\n\n//\n\n// * Redistributions of source code must retain the above copyright\n\n// notice, this list of conditions and the following disclaimer.\n\n// * Redistributions in binary form must reproduce the above\n\n// copyright notice, this list of conditions and the following\n\n// disclaimer in the documentation and/or other materials provided\n\n// with the distribution.\n\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\n\n// contributors may be used to endorse or promote products derived\n\n// from this software without specific prior written permission.\n\n//\n\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n","file_path":"samples/cpp_classes_static.cpp","rank":61,"score":31781.786226607946},{"content":"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\n\n// Redistribution and use in source and binary forms, with or without\n\n// modification, are permitted provided that the following conditions are\n\n// met:\n\n//\n\n// * Redistributions of source code must retain the above copyright\n\n// notice, this list of conditions and the following disclaimer.\n\n// * Redistributions in binary form must reproduce the above\n\n// copyright notice, this list of conditions and the following\n\n// disclaimer in the documentation and/or other materials provided\n\n// with the distribution.\n\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\n\n// contributors may be used to endorse or promote products derived\n\n// from this software without specific prior written permission.\n\n//\n\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n","file_path":"samples/cpp_classes_ctor.cpp","rank":62,"score":31781.786226607946},{"content":"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\n\n// Redistribution and use in source and binary forms, with or without\n\n// modification, are permitted provided that the following conditions are\n\n// met:\n\n//\n\n// * Redistributions of source code must retain the above copyright\n\n// notice, this list of conditions and the following disclaimer.\n\n// * Redistributions in binary form must reproduce the above\n\n// copyright notice, this list of conditions and the following\n\n// disclaimer in the documentation and/or other materials provided\n\n// with the distribution.\n\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\n\n// contributors may be used to endorse or promote products derived\n\n// from this software without specific prior written permission.\n\n//\n\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n","file_path":"samples/cpp_classes_basics.cpp","rank":63,"score":31781.786226607946},{"content":"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\n\n// Redistribution and use in source and binary forms, with or without\n\n// modification, are permitted provided that the following conditions are\n\n// met:\n\n//\n\n// * Redistributions of source code must retain the above copyright\n\n// notice, this list of conditions and the following disclaimer.\n\n// * Redistributions in binary form must reproduce the above\n\n// copyright notice, this list of conditions and the following\n\n// disclaimer in the documentation and/or other materials provided\n\n// with the distribution.\n\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\n\n// contributors may be used to endorse or promote products derived\n\n// from this software without specific prior written permission.\n\n//\n\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n","file_path":"v8bridge/native/native_class.hpp","rank":64,"score":31781.786226607946},{"content":" * C++ doesn't have \"properties\" (unlike C#) but we still use getters and setters.\n\n * Using this API you can attach specific getter and setter to a \"property\" (i.e. variable).\n\n *\n\n * @param std::string propertyName - the name of the property (variable) in JS.\n\n * @param TGetter getter - a reference to the getter method.\n\n * @param TSetter setter - a reference to the setter method.\n\n * @param std::string getterMethodName [optional] - If specified, in addition to the property accessor declaration,\n\n * we're also binding the referenced TGetter to the given method name (i.e. one can access using the C++ method by \"x\" and \"getX\").\n\n * @param std::string setterMethodName [optional] - If specified, in addition to the property accessor declaration,\n\n * we're also binding the referenced TSetter to the given method name.\n\n *\n\n * Example:\n\n * C++:\n\n * carClass->exposePropertyAccessor(\"color\", &Car::getColor, &Car::setColor);\n\n * JS:\n\n * var car = new Car();\n\n * car.color = \"Red\"; // Invokes C++'s Car::setColor\n\n * console.log( car.color ); // Invokes C++'s Car::getColor\n\n */\n\n template<typename TGetter, typename TSetter>\n","file_path":"v8bridge/native/native_class.hpp","rank":66,"score":31781.464980447763},{"content":" template<typename TType>\n\n inline NativeClass<TClass> *setStaticClassMember(const char *memberName, TType value)\n\n {\n\n this->setStaticClassMember(memberName, NativeToJs(value, this->m_isolationScope));\n\n return this;\n\n }\n\n \n\n \n\n inline NativeClass<TClass> *setClassMember(const char *memberName, Handle<Value> value)\n\n {\n\n this->getTemplate()\n\n ->InstanceTemplate()\n\n ->Set(String::NewFromUtf8(this->m_isolationScope, memberName), value);\n\n \n\n return this;\n\n }\n\n \n\n inline NativeClass<TClass> *setStaticClassMember(const char *memberName, Handle<Value> value)\n\n {\n\n this->getTemplate()\n","file_path":"v8bridge/native/native_class.hpp","rank":67,"score":31781.262464992302},{"content":" \n\n /**\n\n * Add a class member (ivar) to the class.\n\n *\n\n * Example:\n\n * C++:\n\n * obj->setClassMember(\"x\", 10);\n\n *\n\n * JS:\n\n * log(obj.x)\n\n * obj.x = 5;\n\n */\n\n template<typename TType>\n\n inline NativeClass<TClass> *setClassMember(const char *memberName, TType value)\n\n {\n\n this->setClassMember(memberName, NativeToJs(value, this->m_isolationScope));\n\n return this;\n\n }\n\n \n\n \n","file_path":"v8bridge/native/native_class.hpp","rank":68,"score":31781.083721457588},{"content":" * JS:\n\n * var myCar = new Car();\n\n * myCar.drive();\n\n * Car.foo();\n\n */\n\n template<typename TMethod>\n\n inline NativeClass<TClass> *exposeMethod(std::string methodName, TMethod method)\n\n {\n\n return this->_exposeMethod(methodName, method, /* isStatic: */false);\n\n }\n\n \n\n template<typename TMethod>\n\n inline NativeClass<TClass> *exposeStaticMethod(std::string methodName, TMethod method)\n\n {\n\n return this->_exposeMethod(methodName, method, /* isStatic: */true);\n\n }\n\n \n\n inline NativeClass<TClass> *exposeMethod(std::string methodName, NativeFunction *funcDecl)\n\n {\n\n assert(this->m_methods->find(methodName) == this->m_methods->end());\n","file_path":"v8bridge/native/native_class.hpp","rank":69,"score":31780.87137395059},{"content":" * NativeClass<Car> *carClass = new NativeClass<Car>();\n\n * carClass\n\n * ->setConst(\"WHEELS\", 4)\n\n * ->exposeMethod(\"drive\", &Car::drive)\n\n * ->exposeMethod(\"stop\", &Car::stop)\n\n * ->exposeStaticMethod(\"Factory\", &Car::Factory);\n\n * ->exposePropertyAccessor(\"color\", &Car::getColor, &Car::setColor);\n\n *\n\n * JS:\n\n * var car = new Car();\n\n * car.color = 'Red';\n\n * car.drive();\n\n * car.stop();\n\n * console.log(\"This is %s car which has %d wheels.\", car.color, Car.WHEELS);\n\n */\n\n template <class TClass>\n","file_path":"v8bridge/native/native_class.hpp","rank":70,"score":31780.869175288193},{"content":" printFunction->addOverload(print);\n\n engine->exposeFunction(printFunction, \"print\");\n\n \n\n /* Create a new NativeClass which will be our endpoint for a native C++ class. */\n\n NativeClass<FileUtils> *fileUtilsClass = new NativeClass<FileUtils>(engine->getActiveIsolationScope());\n\n \n\n /* Expose some static methods */\n\n fileUtilsClass->exposeStaticMethod(\"FileExists\", &FileUtils::FileExists)\n\n ->exposeStaticMethod(\"Read\", &FileUtils::Read);\n\n \n\n /* Expose the car to JS global scope. */\n\n engine->exposeClass(fileUtilsClass);\n\n \n\n /* Execute! */\n\n std::stringstream io;\n\n io << \"var filePath = './foo.txt';\" << std::endl;\n\n io << \"if (FileUtils.FileExists(filePath)) {\" << std::endl;\n\n io << \" var contents = FileUtils.Read(filePath);\" << std::endl;\n\n io << \" print('File Path: ' + filePath + '. Contents:');\" << std::endl;\n\n io << \" print(contents);\" << std::endl;\n","file_path":"samples/cpp_classes_static.cpp","rank":71,"score":31780.797188453944},{"content":" * Get the class JS function template\n\n */\n\n inline Handle<FunctionTemplate> getTemplate() { return this->m_templateDecl->Get(this->m_isolationScope); }\n\n \n\n /**\n\n * Test if a given handle is an instance of this class.\n\n */\n\n inline bool isInstanceOf(Handle<Value> value)\n\n {\n\n return this->getTemplate()->HasInstance(value);\n\n }\n\n \n\n /**\n\n * Set the function client-side class name (e.g. \"Foo\" will result in [object Foo])\n\n */\n\n inline NativeClass<TClass> *setClientClassName(std::string name)\n\n {\n\n this->getTemplate()->SetClassName(String::NewFromUtf8(this->m_isolationScope, name.c_str()));\n\n return this;\n\n }\n","file_path":"v8bridge/native/native_class.hpp","rank":72,"score":31780.66691385685},{"content":" {\n\n return this->m_color;\n\n }\n\n \n\n int getKm()\n\n {\n\n return this->m_km;\n\n }\n\nprivate:\n\n std::string m_color;\n\n int m_km;\n\n};\n\n\n\nint main(int argc, const char * argv[])\n\n{\n\n /* Create a scripting engine */\n\n ScriptingEngine *engine = new ScriptingEngine();\n\n \n\n /* Setup our endpoint */\n\n NativeClass<Car> *carClass = new NativeClass<Car>(engine->getActiveIsolationScope());\n","file_path":"samples/cpp_classes_ctor.cpp","rank":73,"score":31780.658148480732},{"content":" \n\n template<typename TGetter>\n\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, TGetter getter, std::string getterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getter, getterMethodName, /* isStatic: */true);\n\n }\n\n \n\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, std::string getterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getterMethod, getterMethodName, /* isStatic: */false);\n\n }\n\n \n\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, NativeFunction *getterMethod, std::string getterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getterMethod, getterMethodName, /* isStatic: */true);\n\n }\n\n \n\n /**\n\n * Expose a specific property to JavaScript.\n\n *\n","file_path":"v8bridge/native/native_class.hpp","rank":74,"score":31780.645872811958},{"content":" this->m_templateDecl = new Eternal<FunctionTemplate>(this->m_isolationScope, templ);\n\n this->setInternalFieldsCount(0);\n\n this->setClientClassName(TypeId< typename TypeResolver<TClass>::type >().name());\n\n }\n\n \n\n ~NativeClass()\n\n {\n\n /* Registered ctor */\n\n delete this->m_ctor;\n\n \n\n /* Registered methods */\n\n for (TMethodsMap::iterator it = this->m_methods->begin(); it != this->m_methods->end(); ++it)\n\n {\n\n (*it).second.reset();\n\n }\n\n \n\n this->m_methods->clear();\n\n delete this->m_methods;\n\n \n\n \n","file_path":"v8bridge/native/native_class.hpp","rank":75,"score":31780.5848208492},{"content":" {\n\n instance = new TClass();\n\n }\n\n catch (...)\n\n {\n\n delete instance;\n\n throw;\n\n }\n\n \n\n /* Save the binded C++ instance in the new created JS object */\n\n info.This()->SetAlignedPointerInInternalField(info.This()->InternalFieldCount() - 2, (void *)instance);\n\n }\n\n else\n\n {\n\n /* Invoke the actual class constructor */\n\n self->m_ctor->invoke(info);\n\n \n\n /* Get the TClass instance */\n\n instance = (TClass *)info.This()->GetAlignedPointerFromInternalField(info.This()->InternalFieldCount() - 2);\n\n }\n","file_path":"v8bridge/native/native_class.hpp","rank":76,"score":31780.55613988484},{"content":" //=======================================================================\n\n \n\n template <typename TCtor, typename TCtorSignature>\n\n inline NativeClass<TClass> *_exposeCtor(TCtor callback, TCtorSignature signature)\n\n {\n\n this->m_ctor->template addOverload<TCtor, TCtorSignature>(callback, signature);\n\n return this;\n\n }\n\n \n\n template<typename TMethod>\n\n inline NativeClass<TClass> *_exposeMethod(std::string methodName, TMethod method, bool isStatic = false)\n\n {\n\n HandleScope handle_scope(this->m_isolationScope);\n\n \n\n //-------------------------------------------------\n\n // Do we got a registered method with the same name\n\n //-------------------------------------------------\n\n \n\n TMethodsMap *map = isStatic ? this->m_staticMethods : this->m_methods;\n\n \n","file_path":"v8bridge/native/native_class.hpp","rank":77,"score":31780.557380593455},{"content":" \n\n /**\n\n * Declare this JS class as non-instanciatable.\n\n */\n\n inline NativeClass<TClass> declareAsAbstract(bool status = true)\n\n {\n\n this->m_isAbstract = status;\n\n return this;\n\n }\n\n \n\n \n\n /**\n\n * Check if the native class was declared as abstract class\n\n */\n\n inline bool isDeclaredAsAbstract()\n\n {\n\n return this->m_isAbstract;\n\n }\n\n \n\n /**\n","file_path":"v8bridge/native/native_class.hpp","rank":78,"score":31780.53241042587},{"content":" inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, TGetter getter, TSetter setter, std::string getterMethodName = \"\", std::string setterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getter, setter, getterMethodName, setterMethodName, /* isStatic: */false);\n\n }\n\n \n\n template<typename TGetter, typename TSetter>\n\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, TGetter getter, TSetter setter, std::string getterMethodName = \"\", std::string setterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getter, setter, getterMethodName, setterMethodName, /* isStatic: */true);\n\n }\n\n \n\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, NativeFunction *setterMethod, std::string getterMethodName = \"\", std::string setterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getterMethod, setterMethod, getterMethodName, setterMethodName, /* isStatic: */false);\n\n }\n\n \n\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, NativeFunction *getterMethod, NativeFunction *setterMethod, std::string getterMethodName = \"\", std::string setterMethodName = \"\")\n\n {\n\n return this->_exposePropertyAccessor(propertyName, getterMethod, setterMethod, getterMethodName, setterMethodName, /* isStatic: */true);\n\n }\n","file_path":"v8bridge/native/native_class.hpp","rank":79,"score":31780.449607550465},{"content":" inline static void WeakObjectsDeletionCallback(const WeakCallbackData<T, P>& data)\n\n {\n\n Local<Object> pobj = data.GetValue();\n\n NativeClass<TClass> *self = static_cast<NativeClass<TClass> *>(pobj->GetAlignedPointerFromInternalField(pobj->InternalFieldCount() - 1));\n\n \n\n self->disposeInstance(pobj);\n\n }\n\n \n\n \n\n private:\n\n typedef std::list<boost::shared_ptr<NativeFunction> > TMethodsList;\n\n typedef std::map<std::string, boost::shared_ptr<NativeFunction> > TMethodsMap;\n\n \n\n NativeCtor *m_ctor;\n\n \n\n TMethodsMap *m_methods;\n\n TMethodsMap *m_staticMethods;\n\n TMethodsMap *m_accessors;\n\n TMethodsMap *m_staticAccessors;\n\n \n","file_path":"v8bridge/native/native_class.hpp","rank":80,"score":31780.4025017671},{"content":" engine->execute(io.str());\n\n \n\n /* Free */\n\n delete carClass;\n\n delete engine;\n\n \n\n /* Done. */\n\n return 0;\n\n}\n","file_path":"samples/cpp_classes_basics.cpp","rank":81,"score":31780.12226821657},{"content":" {\n\n /* Add to the instance template */\n\n this->getTemplate()\n\n ->SetAccessorProperty(\n\n /* name: */ String::NewFromUtf8(this->m_isolationScope, propertyName.c_str()),\n\n /* getter: */ getterMethod->getTemplate(),\n\n /* setter: */ Local<FunctionTemplate>(),\n\n /* PropertyAttributes: */ReadOnly\n\n );\n\n }\n\n \n\n return this;\n\n }\n\n \n\n inline NativeClass<TClass> *_exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, std::string getterMethodName = \"\", bool isStatic = false)\n\n {\n\n HandleScope handle_scope(this->m_isolationScope);\n\n \n\n //-------------------------------------------------\n\n // Do we got a registered accesso with the same name\n","file_path":"v8bridge/native/native_class.hpp","rank":82,"score":31779.851044275176},{"content":" \n\n /* Add to the global template */\n\n this->getTemplate()\n\n ->Set(String::NewFromUtf8(this->m_isolationScope, methodName.c_str()), funcDecl->getTemplate()->GetFunction());\n\n }\n\n }\n\n \n\n return this;\n\n }\n\n \n\n template<typename TGetter>\n\n inline NativeClass<TClass> *_exposePropertyAccessor(std::string propertyName, TGetter getter, std::string getterMethodName = \"\", bool isStatic = false)\n\n {\n\n HandleScope handle_scope(this->m_isolationScope);\n\n \n\n //-------------------------------------------------\n\n // Do we got a registered accesso with the same name\n\n //-------------------------------------------------\n\n \n\n TMethodsMap *map = isStatic ? this->m_staticAccessors : this->m_accessors;\n","file_path":"v8bridge/native/native_class.hpp","rank":83,"score":31779.83590330473},{"content":" \n\n /* Create a shared pointer */\n\n boost::shared_ptr<NativeFunction> adapter(funcDecl);\n\n \n\n /* Store */\n\n this->m_methods->insert(std::make_pair(methodName, adapter));\n\n \n\n /* Add to the instance template */\n\n this->getTemplate()\n\n ->InstanceTemplate()\n\n ->Set(String::NewFromUtf8(this->m_isolationScope, methodName.c_str()), funcDecl->getTemplate()->GetFunction());\n\n \n\n return this;\n\n }\n\n \n\n inline NativeClass<TClass> *exposeStaticMethod(std::string methodName, NativeFunction *funcDecl)\n\n {\n\n assert(this->m_staticMethods->find(methodName) == this->m_staticMethods->end());\n\n \n\n /* Create a shared pointer */\n","file_path":"v8bridge/native/native_class.hpp","rank":84,"score":31779.82088265858},{"content":" /* name: */ String::NewFromUtf8(this->m_isolationScope, propertyName.c_str()),\n\n /* getter: */ getterMethod->getTemplate(),\n\n /* setter: */ setterMethod->getTemplate()\n\n );\n\n }\n\n else\n\n {\n\n this->getTemplate()\n\n ->SetAccessorProperty(\n\n /* name: */ String::NewFromUtf8(this->m_isolationScope, propertyName.c_str()),\n\n /* getter: */ getterMethod->getTemplate(),\n\n /* setter: */ setterMethod->getTemplate()\n\n );\n\n }\n\n \n\n return this;\n\n }\n\n \n\n \n\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, NativeFunction *setterMethod, std::string getterMethodName = \"\", std::string setterMethodName = \"\", bool isStatic = false)\n","file_path":"v8bridge/native/native_class.hpp","rank":86,"score":31779.663203919223},{"content":" inline NativeClass<TClass> *_exposePropertyAccessor(std::string propertyName, TGetter getter, TSetter setter, std::string getterMethodName = \"\", std::string setterMethodName = \"\", bool isStatic = false)\n\n {\n\n HandleScope handle_scope(this->m_isolationScope);\n\n \n\n //-------------------------------------------------\n\n // Do we got a registered accesso with the same name\n\n //-------------------------------------------------\n\n \n\n TMethodsMap *map = isStatic ? this->m_staticAccessors : this->m_accessors;\n\n assert(map->find(propertyName) == map->end());\n\n \n\n //-------------------------------------------------\n\n // Create a new pair\n\n //-------------------------------------------------\n\n \n\n /* New function instances */\n\n NativeFunction *getterMethod = new NativeFunction(this->m_isolationScope);\n\n NativeFunction *setterMethod = new NativeFunction(this->m_isolationScope);\n\n \n\n /* Add the initial overlaod */\n","file_path":"v8bridge/native/native_class.hpp","rank":87,"score":31779.582639383003},{"content":" io << \"} else {\" << std::endl;\n\n io << \" print('The requested file path (' + filePath + ') does not exists.');\" << std::endl;\n\n io << \"}\" << std::endl;\n\n \n\n \n\n \n\n engine->execute(io.str());\n\n \n\n /* Free */\n\n delete printFunction;\n\n delete fileUtilsClass;\n\n delete engine;\n\n \n\n /* Done. */\n\n return 0;\n\n}\n","file_path":"samples/cpp_classes_static.cpp","rank":88,"score":31779.578074530746},{"content":" JS_PRINT_HANDLE(\"var car = new Car('Red', 10); 'Color: ' + car.color + '; KM: ' + car.km;\");\n\n std::cout << \"=========================================\" << std::endl;\n\n \n\n // Fires Car(const FunctionCallbackInfo<Value> &info). Should print \"Red\" as color and 16 as KM.\n\n JS_PRINT_HANDLE(\"var car = new Car('Red', 10, 1, 2, 3); 'Color: ' + car.color + '; KM: ' + car.km;\");\n\n std::cout << \"=========================================\" << std::endl;\n\n \n\n /* Free */\n\n delete carClass;\n\n delete engine;\n\n \n\n /* Done. */\n\n return 0;\n\n}\n\n \n\n#undef JS_PRINT_HANDLE\n","file_path":"samples/cpp_classes_ctor.cpp","rank":90,"score":31779.026003360657},{"content":" inline NativeFunction *getExposedStaticSetterAccessor(std::string propertyName)\n\n {\n\n propertyName = \"__set_accessor_\" + propertyName;\n\n \n\n if (this->m_staticAccessors->find(propertyName) == this->m_accessors->end())\n\n {\n\n return NULL;\n\n }\n\n \n\n return this->m_staticAccessors->find(propertyName).second;\n\n }\n\n \n\n //=======================================================================\n\n // Wrapping & Unwrapping objects\n\n //=======================================================================\n\n inline Local<Object> wrap(TClass *connectedInstance)\n\n {\n\n EscapableHandleScope handle_scope(this->m_isolationScope);\n\n \n\n Handle<Value> argv[] = { External::New(this->m_isolationScope, (void*)connectedInstance) };\n","file_path":"v8bridge/native/native_class.hpp","rank":92,"score":31778.953338472522},{"content":" {\n\n return NULL;\n\n }\n\n \n\n return this->m_methods->find(methodName).second;\n\n }\n\n \n\n inline NativeFunction *getExposedStaticMethod(std::string methodName)\n\n {\n\n if (this->m_staticMethods->find(methodName) == this->m_staticMethods->end())\n\n {\n\n return NULL;\n\n }\n\n \n\n return this->m_staticMethods->find(methodName).second;\n\n }\n\n \n\n \n\n //=======================================================================\n\n // Exposing Accessor(s)\n","file_path":"v8bridge/native/native_class.hpp","rank":93,"score":31776.055666468783},{"content":" boost::shared_ptr<NativeFunction> adapter(funcDecl);\n\n \n\n /* Store */\n\n this->m_staticMethods->insert(std::make_pair(methodName, adapter));\n\n \n\n /* Add to the instance template */\n\n this->getTemplate()\n\n ->Set(String::NewFromUtf8(this->m_isolationScope, methodName.c_str()), funcDecl->getTemplate()->GetFunction());\n\n \n\n return this;\n\n }\n\n \n\n /**\n\n * Retrieve the registered NativeFunction instance for the given method name\n\n * @param std::string methodName - the method name.\n\n * @return NativeFunction - the native function data to expose.\n\n */\n\n inline NativeFunction *getExposedMethod(std::string methodName)\n\n {\n\n if (this->m_methods->find(methodName) == this->m_methods->end())\n","file_path":"v8bridge/native/native_class.hpp","rank":94,"score":31776.055666468783},{"content":" ->Set(String::NewFromUtf8(this->m_isolationScope, memberName), value);\n\n \n\n return this;\n\n }\n\n \n\n \n\n //=======================================================================\n\n // Exposing Method(s)\n\n //=======================================================================\n\n \n\n /**\n\n * Expose a static constant to JavaScript.\n\n *\n\n * Example:\n\n * C++:\n\n * obj->exposeStaticConstant(\"WHEELS\", 4);\n\n *\n\n * JS:\n\n * log(obj.WHEELS);\n\n */\n","file_path":"v8bridge/native/native_class.hpp","rank":95,"score":31776.055666468783},{"content":" \n\n inline NativeFunction *getExposedGetterAccessor(std::string propertyName)\n\n {\n\n propertyName = \"__get_accessor_\" + propertyName;\n\n \n\n if (this->m_accessors->find(propertyName) == this->m_accessors->end())\n\n {\n\n return NULL;\n\n }\n\n \n\n return this->m_accessors->find(propertyName).second;\n\n }\n\n \n\n \n\n inline NativeFunction *getExposedStaticGetterAccessor(std::string propertyName)\n\n {\n\n propertyName = \"__get_accessor_\" + propertyName;\n\n \n\n if (this->m_staticAccessors->find(propertyName) == this->m_accessors->end())\n\n {\n","file_path":"v8bridge/native/native_class.hpp","rank":96,"score":31776.055666468783},{"content":" /* Registered static methods */\n\n for (TMethodsMap::iterator it = this->m_staticMethods->begin(); it != this->m_staticMethods->end(); ++it)\n\n {\n\n (*it).second.reset();\n\n }\n\n \n\n this->m_staticMethods->clear();\n\n delete this->m_staticMethods;\n\n \n\n /* Registered accessors */\n\n for (TMethodsMap::iterator it = this->m_accessors->begin(); it != this->m_accessors->end(); ++it)\n\n {\n\n (*it).second.reset();\n\n }\n\n \n\n this->m_accessors->clear();\n\n delete this->m_accessors;\n\n \n\n \n\n /* Registered static accessors */\n","file_path":"v8bridge/native/native_class.hpp","rank":97,"score":31776.055666468783},{"content":" for (TMethodsMap::iterator it = this->m_staticAccessors->begin(); it != this->m_staticAccessors->end(); ++it)\n\n {\n\n (*it).second.reset();\n\n }\n\n \n\n this->m_staticAccessors->clear();\n\n delete this->m_staticAccessors;\n\n \n\n /* GC */\n\n delete this->m_gc;\n\n \n\n /* Ctor */\n\n delete this->m_templateDecl;\n\n }\n\n \n\n //=======================================================================\n\n // General\n\n //=======================================================================\n\n \n\n /**\n","file_path":"v8bridge/native/native_class.hpp","rank":98,"score":31776.055666468783},{"content":"# include <boost/preprocessor/enum_params.hpp>\n\n\n\n# define V8_BRIDGE_OVERLOAD_TYPES_WITH_DEFAULT_VALUE BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT(V8_MAX_ARITY, class TClass, mpl::void_)\n\n\n\n# define V8_BRIDGE_OVERLOAD_TYPES BOOST_PP_ENUM_PARAMS_Z(1, V8_MAX_ARITY, class TClass)\n\n\n\n# define V8_BRIDGE_OVERLOAD_ARGS BOOST_PP_ENUM_PARAMS_Z(1, V8_MAX_ARITY, TClass)\n\n\n\nnamespace v8\n\n{\n\n namespace bridge\n\n {\n\n using namespace boost;\n\n \n\n template <V8_BRIDGE_OVERLOAD_TYPES_WITH_DEFAULT_VALUE>\n","file_path":"v8bridge/detail/ctor.hpp","rank":99,"score":23.401130365096655}],"string":"[\n {\n \"content\": \" class V8_DECL NativeClass : public NativeEndpoint\\n\\n {\\n\\n public:\\n\\n NativeClass(Isolate *isolationScope) : NativeEndpoint(isolationScope),\\n\\n m_ctor(new NativeCtor(isolationScope)),\\n\\n m_methods(new TMethodsMap()),\\n\\n m_staticMethods(new TMethodsMap()),\\n\\n m_accessors(new TMethodsMap()),\\n\\n m_staticAccessors(new TMethodsMap()),\\n\\n m_gc(new GC(isolationScope)),\\n\\n m_customDtorHandler(NULL)\\n\\n {\\n\\n HandleScope handle_scope(isolationScope);\\n\\n \\n\\n this->m_isAbstract = false;\\n\\n Local<FunctionTemplate> templ = FunctionTemplate::New(\\n\\n /* isolate: */this->m_isolationScope,\\n\\n /* callback (used as constructor) */ &NativeClass<TClass>::internalConstructorInvocationCallback,\\n\\n /* data: */External::New(isolationScope, (void *)this));\\n\\n \\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 0,\n \"score\": 124495.73461887747\n },\n {\n \"content\": \" class ctor : public ctor_base<ctor<V8_BRIDGE_OVERLOAD_ARGS> >\\n\\n {\\n\\n private:\\n\\n typedef ctor_base<ctor<V8_BRIDGE_OVERLOAD_ARGS> > base;\\n\\n public:\\n\\n ctor() { }\\n\\n \\n\\n \\n\\n typedef detail::type_list<V8_BRIDGE_OVERLOAD_ARGS> signature_;\\n\\n \\n\\n typedef detail::is_optional<\\n\\n typename mpl::eval_if<\\n\\n mpl::empty<signature_>\\n\\n , mpl::false_\\n\\n , mpl::back<signature_>\\n\\n >::type\\n\\n > back_is_optional;\\n\\n \\n\\n typedef typename mpl::eval_if<\\n\\n back_is_optional\\n\",\n \"file_path\": \"v8bridge/detail/ctor.hpp\",\n \"rank\": 1,\n \"score\": 115683.58796522274\n },\n {\n \"content\": \" class V8_DECL NativeFunction : public NativeEndpoint\\n\\n {\\n\\n public:\\n\\n NativeFunction(Isolate *isolationScope) : NativeEndpoint(isolationScope), m_overloads(new TOverloadsList())\\n\\n {\\n\\n HandleScope handle_scope(isolationScope);\\n\\n Local<FunctionTemplate> templ = FunctionTemplate::New(\\n\\n this->m_isolationScope,\\n\\n &NativeFunction::internalFunctionInvocationCallback,\\n\\n External::New(this->m_isolationScope, this)\\n\\n );\\n\\n \\n\\n this->m_templateDecl = new Eternal<FunctionTemplate>(this->m_isolationScope, templ);\\n\\n \\n\\n }\\n\\n \\n\\n ~NativeFunction()\\n\\n {\\n\\n for (TOverloadsList::iterator it = this->m_overloads->begin(); it != this->m_overloads->end(); ++it)\\n\\n {\\n\",\n \"file_path\": \"v8bridge/native/native_function.hpp\",\n \"rank\": 3,\n \"score\": 108854.82887776976\n },\n {\n \"content\": \" class V8_DECL NativeCtor : public NativeFunction\\n\\n {\\n\\n public:\\n\\n NativeCtor(Isolate *isolationScope) : NativeFunction(isolationScope)\\n\\n {\\n\\n }\\n\\n \\n\\n template <class TFunction, class TSignature>\\n\\n inline NativeFunction *addOverload(TFunction functionPointer, TSignature signature)\\n\\n {\\n\\n /* Instead of registering NativeFunctionConcrete, we should register NativeCtorConcrete */\\n\\n NativeCtorConcrete<TFunction, TSignature> *ctorDecl = new NativeCtorConcrete<TFunction, TSignature>(this->m_isolationScope, functionPointer, signature);\\n\\n \\n\\n boost::shared_ptr< NativeCtorConcrete<TFunction, TSignature> > adapter(ctorDecl);\\n\\n this->m_overloads->push_back(adapter);\\n\\n \\n\\n return this;\\n\\n }\\n\\n };\\n\\n }\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"v8bridge/native/native_ctor.hpp\",\n \"rank\": 4,\n \"score\": 108854.82887776976\n },\n {\n \"content\": \" class V8_DECL NativeFunctionConcreteBase : public NativeEndpoint\\n\\n {\\n\\n public:\\n\\n NativeFunctionConcreteBase(Isolate *isolationScope)\\n\\n : NativeEndpoint(isolationScope) { }\\n\\n \\n\\n virtual bool canInvokeCall(const FunctionCallbackInfo<Value>& info) = 0;\\n\\n virtual void invokeCall(const FunctionCallbackInfo<Value>& info) = 0;\\n\\n virtual std::string getFormattedSignature() = 0;\\n\\n virtual bool isDirectArgsFunction() = 0;\\n\\n };\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Generic implementation\\n\\n //-------------------------------------------------\\n\\n template <class TFunction, class TSignature>\\n\",\n \"file_path\": \"v8bridge/native/native_function_concrete.hpp\",\n \"rank\": 5,\n \"score\": 101631.17078570646\n },\n {\n \"content\": \" class V8_DECL NativeFunctionConcrete : public NativeFunctionConcreteBase\\n\\n {\\n\\n public:\\n\\n NativeFunctionConcrete(Isolate *isolationScope, TFunction function, TSignature signature)\\n\\n : NativeFunctionConcreteBase(isolationScope), m_function(function), m_signature(signature)\\n\\n {\\n\\n \\n\\n }\\n\\n \\n\\n inline bool canInvokeCall(const FunctionCallbackInfo<Value>& info)\\n\\n {\\n\\n return this->forwardCanInvokeCall<TSignature>(info);\\n\\n }\\n\\n \\n\\n inline void invokeCall(const FunctionCallbackInfo<Value>& info)\\n\\n {\\n\\n this->forwardInvokeCall<TSignature>(info);\\n\\n }\\n\\n \\n\\n inline std::string getFormattedSignature()\\n\",\n \"file_path\": \"v8bridge/native/native_function_concrete.hpp\",\n \"rank\": 6,\n \"score\": 99531.42147604769\n },\n {\n \"content\": \" class V8_DECL NativeCtorConcrete : /*public NativeFunctionConcrete<TFunction, TSignature>,*/ public NativeFunctionConcreteBase\\n\\n {\\n\\n public:\\n\\n NativeCtorConcrete(Isolate *isolationScope, TFunction function, TSignature signature)\\n\\n : NativeFunctionConcreteBase(isolationScope), m_function(function), m_signature(signature)\\n\\n {\\n\\n \\n\\n }\\n\\n \\n\\n inline bool canInvokeCall(const FunctionCallbackInfo<Value>& info)\\n\\n {\\n\\n return this->forwardCanInvokeCall<TSignature>(info);\\n\\n }\\n\\n \\n\\n inline void invokeCall(const FunctionCallbackInfo<Value>& info)\\n\\n {\\n\\n this->forwardInvokeCall<TSignature>(info);\\n\\n }\\n\\n \\n\\n inline std::string getFormattedSignature()\\n\",\n \"file_path\": \"v8bridge/native/native_ctor_concrete.hpp\",\n \"rank\": 7,\n \"score\": 91700.30334785064\n },\n {\n \"content\": \" class V8_DECL GC\\n\\n {\\n\\n public:\\n\\n GC(Isolate *isolate) : m_isolationScope(isolate), m_map(new TCleanupMap()) { }\\n\\n ~GC()\\n\\n {\\n\\n this->collect(); // collect and release any remaining instances on the cleanup list.\\n\\n }\\n\\n \\n\\n typedef void (*TDtor)(void *ptr);\\n\\n \\n\\n /**\\n\\n * Queue the given object instance in the internal GC clearup instances list.\\n\\n * For more details about this method, see the second overload above.\\n\\n *\\n\\n * Note that this method make use of the GCGenericInstanceDestructor<TType>::dtor destructor implementation\\n\\n * in order to remove the object.\\n\\n * This is the default and typical implementation for destructors, which only deletes the instance from the memoory.\\n\\n * Thus, this implementation will fire the instance class dtor.\\n\\n */\\n\",\n \"file_path\": \"v8bridge/detail/internal_gc.hpp\",\n \"rank\": 8,\n \"score\": 84288.15763339221\n },\n {\n \"content\": \" class V8_DECL ScriptingEngine\\n\\n {\\n\\n public:\\n\\n ScriptingEngine(bool registerBuiltinDeclaration = true) :\\n\\n m_registeredContractsMap(new TNativeContractMap()),\\n\\n m_registeredNativeClassesMap(new TNativeClassesContractMap())\\n\\n {\\n\\n //-------------------------------------------------\\n\\n // Create new isolation scope\\n\\n //-------------------------------------------------\\n\\n this->m_activeIsolationScope = Isolate::GetCurrent();\\n\\n //this->m_activeIsolationScope->Enter();\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Create a temp scope\\n\\n //-------------------------------------------------\\n\\n HandleScope handle_scope(this->m_activeIsolationScope);\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Create the active context\\n\",\n \"file_path\": \"v8bridge/scripting_engine.hpp\",\n \"rank\": 9,\n \"score\": 84288.15763339221\n },\n {\n \"content\": \" class V8_DECL UserlandInstance\\n\\n {\\n\\n public:\\n\\n UserlandInstance(Isolate *isolationScope, Handle<Value> objectHandle) :\\n\\n m_isolationScope(isolationScope), m_object(isolationScope, Handle<Object>::Cast(objectHandle)) // will result in an error if the handle is not a object\\n\\n {\\n\\n };\\n\\n \\n\\n UserlandInstance(Isolate *isolationScope, Handle<Object> objectHandle) :\\n\\n m_isolationScope(isolationScope), m_object(isolationScope, objectHandle)\\n\\n {\\n\\n \\n\\n };\\n\\n \\n\\n ~UserlandInstance()\\n\\n {\\n\\n this->m_object.Reset();\\n\\n }\\n\\n \\n\\n inline Local<Object> getObjectHandle() { return Local<Object>::New(this->m_isolationScope, this->m_object); }\\n\",\n \"file_path\": \"v8bridge/userland/userland_instance.hpp\",\n \"rank\": 10,\n \"score\": 81962.15222658451\n },\n {\n \"content\": \" class V8_DECL NativeEndpoint\\n\\n {\\n\\n public:\\n\\n inline Isolate *getIsolationScope() { return this->m_isolationScope; }\\n\\n protected:\\n\\n NativeEndpoint(Isolate *isolationScope) : m_isolationScope(isolationScope) { }\\n\\n Isolate *m_isolationScope;\\n\\n \\n\\n template <class TSignature>\\n\\n struct resolve_directly_passed_args : boost::is_same<\\n\\n const v8::FunctionCallbackInfo<Value> &,\\n\\n typename boost::mpl::at_c<TSignature, 1>::type > {};\\n\\n };\\n\\n }\\n\\n}\\n\\n\\n\\n#endif /* defined(__V8Bridge__NativeEndpoint__) */\\n\",\n \"file_path\": \"v8bridge/native/native_endpoint.hpp\",\n \"rank\": 11,\n \"score\": 81962.15222658451\n },\n {\n \"content\": \" class V8_DECL UserlandFunction\\n\\n {\\n\\n public:\\n\\n //=======================================================================\\n\\n // ctor & dtor\\n\\n //=======================================================================\\n\\n \\n\\n UserlandFunction(Isolate *isolationScope, Handle<Value> functionHandle) :\\n\\n m_isolationScope(isolationScope), m_function(isolationScope, Handle<Function>::Cast(functionHandle)) // will result in an error if the handle is not a function\\n\\n {\\n\\n };\\n\\n \\n\\n UserlandFunction(Isolate *isolationScope, Handle<Function> functionHandle) :\\n\\n m_isolationScope(isolationScope), m_function(isolationScope, Handle<Function>::Cast(functionHandle))\\n\\n {\\n\\n \\n\\n };\\n\\n \\n\\n ~UserlandFunction()\\n\\n {\\n\",\n \"file_path\": \"v8bridge/userland/userland_function.hpp\",\n \"rank\": 12,\n \"score\": 81962.15222658451\n },\n {\n \"content\": \"class Car\\n\\n{\\n\\npublic:\\n\\n Car() : m_color(\\\"\\\"), m_km(0) { };\\n\\n Car(std::string color) : m_color(color), m_km(0) { };\\n\\n Car(int km) : m_color(\\\"\\\"), m_km(km) { };\\n\\n Car(std::string color, int km) : m_color(color), m_km(km) { };\\n\\n \\n\\n Car(const FunctionCallbackInfo<Value> &info)\\n\\n {\\n\\n /* This constructor requires at least one argument.\\n\\n Calling Signature:\\n\\n Car(string format [, int km [, int ... ]] )\\n\\n \\n\\n It can reminds us the add() method in the functions_v8_args.cpp example.\\n\\n */\\n\\n \\n\\n if (info.Length() == 0)\\n\\n {\\n\\n throw std::runtime_error(\\\"The add function must receive at least one argument.\\\");\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 13,\n \"score\": 54103.593479696916\n },\n {\n \"content\": \"class Car\\n\\n{\\n\\npublic:\\n\\n Car() { };\\n\\n \\n\\n void setColor(std::string color)\\n\\n {\\n\\n this->m_color = color;\\n\\n }\\n\\n \\n\\n std::string getColor()\\n\\n {\\n\\n return this->m_color;\\n\\n }\\n\\n \\n\\n void drive()\\n\\n {\\n\\n std::cout << \\\"** I'm driving a \\\" << this->getColor() << \\\" car! **\\\" << std::endl;\\n\\n }\\n\\nprivate:\\n\",\n \"file_path\": \"samples/cpp_classes_basics.cpp\",\n \"rank\": 14,\n \"score\": 54103.593479696916\n },\n {\n \"content\": \"class FileUtils\\n\\n{\\n\\npublic:\\n\\n static bool FileExists(std::string const filePath)\\n\\n {\\n\\n std::ifstream f(filePath.c_str());\\n\\n if (f.good()) {\\n\\n f.close();\\n\\n return true;\\n\\n } else {\\n\\n f.close();\\n\\n return false;\\n\\n }\\n\\n };\\n\\n \\n\\n static std::string Read(std::string const filePath)\\n\\n {\\n\\n std::ifstream f(filePath.c_str());\\n\\n if (f.good()) {\\n\\n return \\\"\\\";\\n\",\n \"file_path\": \"samples/cpp_classes_static.cpp\",\n \"rank\": 15,\n \"score\": 52901.14552443195\n },\n {\n \"content\": \"\\t\\tclass TypeId\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tTypeId() { }\\n\\n \\n\\n\\t\\t\\tbool operator!=(TypeId const& other) const\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\treturn this->name() != other->name();\\n\\n\\t\\t\\t}\\n\\n \\n\\n\\t\\t\\tbool operator==(TypeId const& other) const\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\treturn this->name() == other->name();\\n\\n\\t\\t\\t}\\n\\n \\n\\n\\t\\t\\tinline std::string name() const\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\treturn this->getClassName(__FUNCTION__);\\n\\n\\t\\t\\t}\\n\\n \\n\",\n \"file_path\": \"v8bridge/detail/typeid.hpp\",\n \"rank\": 16,\n \"score\": 44433.99412122423\n },\n {\n \"content\": \" class TypeId\\n\\n {\\n\\n public:\\n\\n TypeId() : id(&typeid(TClass))\\n\\n {}\\n\\n \\n\\n bool operator!=(TypeId const& other) const\\n\\n {\\n\\n return *id != *other.id;\\n\\n }\\n\\n \\n\\n bool operator==(TypeId const& other) const\\n\\n {\\n\\n return *id == *other.id;\\n\\n }\\n\\n \\n\\n inline char const* name() const\\n\\n {\\n\\n return id->name();\\n\\n }\\n\\n \\n\\n private:\\n\\n type_info const* id;\\n\\n };\\n\\n#endif\\n\\n }\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"v8bridge/detail/typeid.hpp\",\n \"rank\": 17,\n \"score\": 44433.99412122423\n },\n {\n \"content\": \" class ctor; // forward declaration\\n\\n \\n\\n \\n\\n template <V8_BRIDGE_OVERLOAD_TYPES_WITH_DEFAULT_VALUE>\\n\\n struct optional; // forward declaration\\n\\n \\n\\n namespace detail\\n\\n {\\n\\n template <class TClass>\\n\\n struct is_optional\\n\\n : mpl::false_\\n\\n {};\\n\\n \\n\\n template <V8_BRIDGE_OVERLOAD_TYPES>\\n\\n struct is_optional<optional<V8_BRIDGE_OVERLOAD_ARGS> >\\n\\n : mpl::true_\\n\\n {};\\n\\n \\n\\n template <class S>\\n\\n struct step_backward : mpl::iterator_range<\\n\",\n \"file_path\": \"v8bridge/detail/ctor.hpp\",\n \"rank\": 18,\n \"score\": 40151.62982851073\n },\n {\n \"content\": \"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\\n\\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\\n\\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\\n\\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n/**\\n\\n * This is an sample file for v8bridge API interaction.\\n\\n *\\n\\n * This file provides a simple demonstration of defining JS \\\"class\\\" and accessing it by C++ using the Userland API.\\n\\n * In this demo, we're declaring a simple Car JS class. Then, by using UserlandClass we're creating a new instance,\\n\\n * calling it's method(s) and changing its ivar value.\\n\\n */\\n\\n\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n\\n\\n#define V8BRIDGE_DEBUG 1\\n\\n#include <v8bridge/v8bridge.hpp>\\n\",\n \"file_path\": \"samples/js_classes.cpp\",\n \"rank\": 19,\n \"score\": 33442.31354356685\n },\n {\n \"content\": \"\\n\\nusing namespace v8;\\n\\nusing namespace v8::bridge;\\n\\n\\n\\nint main(int argc, const char * argv[])\\n\\n{\\n\\n /* Create a scripting engine */\\n\\n ScriptingEngine *engine = new ScriptingEngine();\\n\\n HandleScope handle_scope(engine->getActiveIsolationScope());\\n\\n \\n\\n /* Create a new \\\"JS class\\\" */\\n\\n std::stringstream io;\\n\\n io << \\\"var Car = (function () {\\\" << std::endl;\\n\\n io << \\\" function Car(color) {\\\" << std::endl;\\n\\n io << \\\" this.color = color;\\\" << std::endl;\\n\\n io << \\\" };\\\" << std::endl;\\n\\n io << \\\" Car.prototype.getColor = function () {\\\" << std::endl;\\n\\n io << \\\" return this.color;\\\" << std::endl;\\n\\n io << \\\" };\\\" << std::endl;\\n\\n io << \\\" Car.prototype.setColor = function (color) {\\\" << std::endl;\\n\",\n \"file_path\": \"samples/js_classes.cpp\",\n \"rank\": 20,\n \"score\": 33439.50098724983\n },\n {\n \"content\": \" io << \\\" this.color = color;\\\" << std::endl;\\n\\n io << \\\" };\\\" << std::endl;\\n\\n io << \\\" Car.prototype.drive = function () {\\\" << std::endl;\\n\\n io << \\\" return 'I\\\\\\\\'m driving in ' + this.color + ' car!';\\\" << std::endl;\\n\\n io << \\\" };\\\" << std::endl;\\n\\n io << \\\" return Car;\\\" << std::endl;\\n\\n io << \\\"})();\\\" << std::endl;\\n\\n \\n\\n engine->execute(io.str(), /* fileName: */ \\\"car.js\\\");\\n\\n \\n\\n /** To access the JS class, we should use the UserlandClass class which\\n\\n provides us basic interface for interaction with the defined class.\\n\\n \\n\\n Note that UserlandClass ctor requires an Handle<Function> (there's an overload for Handle<Value>)\\n\\n which represents the JS class ctor. To get it, as shown below, we can use the ScriptingEngine::getFromGlobalScope method,\\n\\n which retrives an handle that's been stored on the global scope. The handle we wish to request is the class representing variable - Car. **/\\n\\n UserlandClass *carJsClass = new UserlandClass(engine->getActiveIsolationScope(), engine->getFromGlobalScope(\\\"Car\\\"));\\n\\n \\n\\n /** Now, lets create a new instance of the JS class. The C++ type that will hold the created type\\n\\n is UserlandInstance. UserlandInstance provides us simple interface to execute instance-related actions.\\n\",\n \"file_path\": \"samples/js_classes.cpp\",\n \"rank\": 21,\n \"score\": 33433.5235010281\n },\n {\n \"content\": \" \\n\\n Note that the created instance is been stored as boost::shared_ptr in UserlandClass and will be released when\\n\\n the UserlandClass object will be disposed. */\\n\\n UserlandInstance *carInstance = carJsClass->newInstance( /* color: */ \\\"Red\\\");\\n\\n \\n\\n // Print the current driving state (driving with red car, because of JS ctor)\\n\\n std::cout << carInstance->invoke<std::string>(\\\"drive\\\") << std::endl;\\n\\n \\n\\n // Set the car color using the defined setter\\n\\n carInstance->invoke<void>(\\\"setColor\\\", \\\"Blue\\\");\\n\\n \\n\\n // Print the current driving state (driving with blue car)\\n\\n std::cout << carInstance->invoke<std::string>(\\\"drive\\\") << std::endl;\\n\\n \\n\\n // Set the car color by (in a very hacky way!) accessing the class member directly\\n\\n carInstance->setValue(\\\"color\\\", \\\"Yellow\\\");\\n\\n \\n\\n // Print the current driving state (driving with yellow car)\\n\\n std::cout << carInstance->invoke<std::string>(\\\"drive\\\") << std::endl;\\n\\n \\n\\n /* Free */\\n\\n delete carJsClass;\\n\\n delete engine;\\n\\n \\n\\n /* Done. */\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"samples/js_classes.cpp\",\n \"rank\": 22,\n \"score\": 33432.36024523415\n },\n {\n \"content\": \"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\\n\\n// Redistribution and use in source and binary forms, with or without\\n\\n// modification, are permitted provided that the following conditions are\\n\\n// met:\\n\\n//\\n\\n// * Redistributions of source code must retain the above copyright\\n\\n// notice, this list of conditions and the following disclaimer.\\n\\n// * Redistributions in binary form must reproduce the above\\n\\n// copyright notice, this list of conditions and the following\\n\\n// disclaimer in the documentation and/or other materials provided\\n\\n// with the distribution.\\n\\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\\n\\n// contributors may be used to endorse or promote products derived\\n\\n// from this software without specific prior written permission.\\n\\n//\\n\\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n// \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\\n\\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\\n\",\n \"file_path\": \"samples/js_classes.cpp\",\n \"rank\": 23,\n \"score\": 33431.85850182063\n },\n {\n \"content\": \"\\n\\nusing namespace v8;\\n\\nusing namespace v8::bridge;\\n\\n\\n\\nint add(const FunctionCallbackInfo<Value> &info)\\n\\n{\\n\\n if (info.Length() == 0)\\n\\n {\\n\\n throw std::runtime_error(\\\"The add function must receive at least one argument.\\\");\\n\\n }\\n\\n \\n\\n int result = 0;\\n\\n for (int i = 0; i < info.Length(); i++)\\n\\n {\\n\\n if (!info[i]->IsInt32())\\n\\n {\\n\\n throw std::runtime_error(\\\"All of the function passed arguments should be integers.\\\");\\n\\n }\\n\\n \\n\\n result += info[i]->Int32Value();\\n\",\n \"file_path\": \"samples/functions_v8_args.cpp\",\n \"rank\": 24,\n \"score\": 33017.783390380675\n },\n {\n \"content\": \"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\\n\\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\\n\\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\\n\\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n/**\\n\\n * This is an sample file for v8bridge API interaction.\\n\\n *\\n\\n * This file provides a simple demonstration of accepting directly V8 args info.\\n\\n * In this demo, we're declaring a simple add function. However, we're not using the Conversion API\\n\\n * to convert the args into native types. We're accepting raw-V8 args and adding all of them.\\n\\n */\\n\\n\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n\\n\\n#define V8BRIDGE_DEBUG 1\\n\\n#include <v8bridge/v8bridge.hpp>\\n\",\n \"file_path\": \"samples/functions_v8_args.cpp\",\n \"rank\": 25,\n \"score\": 33017.376043192\n },\n {\n \"content\": \"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\\n\\n// Redistribution and use in source and binary forms, with or without\\n\\n// modification, are permitted provided that the following conditions are\\n\\n// met:\\n\\n//\\n\\n// * Redistributions of source code must retain the above copyright\\n\\n// notice, this list of conditions and the following disclaimer.\\n\\n// * Redistributions in binary form must reproduce the above\\n\\n// copyright notice, this list of conditions and the following\\n\\n// disclaimer in the documentation and/or other materials provided\\n\\n// with the distribution.\\n\\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\\n\\n// contributors may be used to endorse or promote products derived\\n\\n// from this software without specific prior written permission.\\n\\n//\\n\\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n// \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\\n\\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\\n\",\n \"file_path\": \"samples/functions_v8_args.cpp\",\n \"rank\": 26,\n \"score\": 33008.34155101271\n },\n {\n \"content\": \" }\\n\\n \\n\\n return result;\\n\\n}\\n\\n\\n\\nint main(int argc, const char * argv[])\\n\\n{\\n\\n /* Create a scripting engine */\\n\\n ScriptingEngine *engine = new ScriptingEngine();\\n\\n \\n\\n /* Create the add function */\\n\\n NativeFunction *addFunction = new NativeFunction(engine->getActiveIsolationScope());\\n\\n addFunction->addOverload(add);\\n\\n engine->exposeFunction(addFunction, \\\"add\\\");\\n\\n \\n\\n /* Execute! */ \\n\\n std::cout << \\\"add(1): \\\" << engine->eval<int>(\\\"add(1)\\\") << std::endl;\\n\\n std::cout << \\\"add(1, 1): \\\" << engine->eval<int>(\\\"add(1, 1)\\\") << std::endl;\\n\\n std::cout << \\\"add(1, 2): \\\" << engine->eval<int>(\\\"add(1, 2)\\\") << std::endl;\\n\\n std::cout << \\\"add(1, 2, 3): \\\" << engine->eval<int>(\\\"add(1, 2, 3)\\\") << std::endl;\\n\",\n \"file_path\": \"samples/functions_v8_args.cpp\",\n \"rank\": 27,\n \"score\": 33002.610990873545\n },\n {\n \"content\": \" std::cout << \\\"add(1, 2, 2, 3): \\\" << engine->eval<int>(\\\"add(1, 2, 2, 3)\\\") << std::endl;\\n\\n \\n\\n /* Free */\\n\\n delete addFunction;\\n\\n delete engine;\\n\\n \\n\\n /* Done. */\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"samples/functions_v8_args.cpp\",\n \"rank\": 28,\n \"score\": 33002.610990873545\n },\n {\n \"content\": \"#include <sstream>\\n\\n#include <fstream>\\n\\n\\n\\n#define V8BRIDGE_DEBUG 1\\n\\n#include <v8bridge/v8bridge.hpp>\\n\\n\\n\\nusing namespace v8;\\n\\nusing namespace v8::bridge;\\n\\n\\n\\n/* Declare a file-utils class */\\n\",\n \"file_path\": \"samples/cpp_classes_static.cpp\",\n \"rank\": 29,\n \"score\": 31799.012713414428\n },\n {\n \"content\": \"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\\n\\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\\n\\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\\n\\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n/**\\n\\n * This is an sample file for v8bridge API interaction.\\n\\n *\\n\\n * This file provides a simple demonstration of binding a C++ class to JS.\\n\\n * In this demo, we're declaring a simple Car with one ivar (m_color) and three methods - getter, setter and standard method.\\n\\n * Then, we're expsoing the Car class using v8bridge NativeClass interface.\\n\\n * Finally, we're creating in JS a new instance of Car, setting its color using the \\\"color\\\" property and invoking drive().\\n\\n * \\n\\n * Note: when \\\"delete carClass;\\\" is been called, the \\\"car\\\" instance that we've defined in JS is been removed\\n\\n * by v8bridge internal GC. For more details on why is this happing and why we need this, see internal_gc.hpp.\\n\\n */\\n\\n\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n\\n\\n#define V8BRIDGE_DEBUG 1\\n\\n#include <v8bridge/v8bridge.hpp>\\n\\n\\n\\nusing namespace v8;\\n\\nusing namespace v8::bridge;\\n\\n\\n\\n/* Declare a simple class */\\n\",\n \"file_path\": \"samples/cpp_classes_basics.cpp\",\n \"rank\": 30,\n \"score\": 31797.11984287624\n },\n {\n \"content\": \"#include <v8bridge/native/native_function.hpp>\\n\\n#include <v8bridge/native/native_ctor.hpp>\\n\\n#include <v8bridge/detail/internal_gc.hpp>\\n\\n#include <v8bridge/conversion.hpp>\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n#include <boost/mpl/if.hpp>\\n\\n#include <boost/type_traits/is_same.hpp>\\n\\n\\n\\nnamespace v8\\n\\n{\\n\\n namespace bridge\\n\\n {\\n\\n /**\\n\\n * Specific class used to provide interface for binding C++ classes to JS function (classes).\\n\\n * This class also automaticly connects the C++ type with JsToNative and NativeToJs conversion API\\n\\n * so the class instances can be passed between C++ and JS.\\n\\n *\\n\\n * Simple usage:\\n\\n * C++:\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 32,\n \"score\": 31792.842402340146\n },\n {\n \"content\": \"/* Macro shortcut that evaluates a given script and echo its result */\\n\\n#define JS_PRINT_HANDLE(jsCode) do \\\\\\n\\n { \\\\\\n\\n String::Utf8Value utf8(engine->v8Eval(jsCode)); \\\\\\n\\n std::cout << *utf8 << std::endl; \\\\\\n\\n } while (false);\\n\\n\\n\\nusing namespace v8;\\n\\nusing namespace v8::bridge;\\n\\n\\n\\n/* Declare a simple class */\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 33,\n \"score\": 31792.231607752416\n },\n {\n \"content\": \"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\\n\\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\\n\\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\\n\\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n/**\\n\\n * This is an sample file for v8bridge API interaction.\\n\\n *\\n\\n * This file provides a simple demonstration of binding a C++ class to JS.\\n\\n * In this demo, we're defining 4 constructors in the Car class. Then, we're exposing them to JS and using them.\\n\\n */\\n\\n\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n\\n\\n#define V8BRIDGE_DEBUG 1\\n\\n#include <v8bridge/v8bridge.hpp>\\n\\n\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 35,\n \"score\": 31790.02486793672\n },\n {\n \"content\": \" \\n\\n if (self->m_isAbstract)\\n\\n {\\n\\n std::stringstream io;\\n\\n io << \\\"Could not create an instance of the class \\\" << TypeId<typename TypeResolver<TClass>::type >().name() << \\\" since it was marked as abstract class.\\\" << std::endl;\\n\\n#if V8BRIDGE_DEBUG\\n\\n io << \\\"In order to allow the class instantiation, you should call the NativeClass<TClass>::declareAsAbstract with false argument.\\\";\\n\\n#endif\\n\\n self->m_isolationScope->ThrowException(\\n\\n v8::Exception::TypeError(String::NewFromUtf8(self->m_isolationScope, io.str().c_str()))\\n\\n );\\n\\n return;\\n\\n }\\n\\n \\n\\n //-------------------------------------------------\\n\\n // We got two cases to deal with.\\n\\n // - The first one is in which we're trying to instansiate plain new object (e.g. from JS)\\n\\n // In this case, we should allocate a new coresponding CPP object (i.e. \\\"var p = new Point(x, y);\\\" in JS will allocate new CPP Point).\\n\\n // - The second one is case in which we're trying to Convert Existing CPP Object to JS (i.e. by using NativeToJs interface).\\n\\n // in this case we still should create a new JS object, but We Shouldn't Allocate a new CPP object but using the Existing one.\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 36,\n \"score\": 31788.449120047142\n },\n {\n \"content\": \"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\\n\\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\\n\\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\\n\\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n#ifndef v8bridge_native_class_hpp\\n\\n#define v8bridge_native_class_hpp\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n#include <v8bridge/detail/prefix.hpp>\\n\\n\\n\\n#include <v8bridge/detail/typeid.hpp>\\n\\n#include <v8bridge/conversion/type_resolver.hpp>\\n\\n\\n\\n#include <v8bridge/detail/signature.hpp>\\n\\n#include <v8bridge/detail/ctor.hpp>\\n\\n#include <v8bridge/native/invoke_native_ctor.hpp>\\n\\n#include <v8bridge/native/native_endpoint.hpp>\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 39,\n \"score\": 31787.83319507332\n },\n {\n \"content\": \" }\\n\\n \\n\\n // Builds ctor function which inserts the given Holder type\\n\\n // in a wrapped C++ class instance. ArgList is an MPL type sequence\\n\\n // describing the C++ argument types to be passed to Holder's\\n\\n // constructor.\\n\\n //\\n\\n // Holder and ArgList are intended to be explicitly specified.\\n\\n template <class TArgList, class TArity>\\n\\n inline NativeClass<TClass> *exposeCtor(TArgList* = 0, TArity* = 0)\\n\\n {\\n\\n return this->_exposeCtor(\\n\\n ::v8::bridge::detail::invoke_native_ctor<TArity::value>::template apply<TClass, TArgList>::execute,\\n\\n get_signature(::v8::bridge::detail::invoke_native_ctor<TArity::value>::template apply<TClass, TArgList>::execute)\\n\\n );\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // Exposing Class Member(s)\\n\\n //=======================================================================\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 40,\n \"score\": 31787.42360880064\n },\n {\n \"content\": \"// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\\n\\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\\n\\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\\n\\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\\n\\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n/**\\n\\n * This is an sample file for v8bridge API interaction.\\n\\n *\\n\\n * This file provides a simple demonstration of binding a C++ class to JS.\\n\\n * In this demo, we're declaring a simple Car with one ivar (m_color) and three methods - getter, setter and standard method.\\n\\n * Then, we're expsoing the Car class using v8bridge NativeClass interface.\\n\\n * Finally, we're creating in JS a new instance of Car, setting its color using the \\\"color\\\" property and invoking drive().\\n\\n *\\n\\n * Note: when \\\"delete carClass;\\\" is been called, the \\\"car\\\" instance that we've defined in JS is been removed\\n\\n * by v8bridge internal GC. For more details on why is this happing and why we need this, see internal_gc.hpp.\\n\\n */\\n\\n\\n\\n#include <iostream>\\n\",\n \"file_path\": \"samples/cpp_classes_static.cpp\",\n \"rank\": 41,\n \"score\": 31787.04180149356\n },\n {\n \"content\": \" \\n\\n Local<Object> obj = this->getTemplate()\\n\\n ->GetFunction()\\n\\n ->NewInstance(1, argv);\\n\\n \\n\\n return handle_scope.Escape(obj);\\n\\n }\\n\\n \\n\\n inline TClass *unwrap(Handle<Object> object)\\n\\n {\\n\\n return static_cast<TClass *>(object->GetAlignedPointerFromInternalField(object->InternalFieldCount() - 2));\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // V8 API related\\n\\n //=======================================================================\\n\\n \\n\\n /**\\n\\n * Use this method to setup the allocated memory adjustment that should be make in\\n\\n * V8 when creating new instance.\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 42,\n \"score\": 31786.988578273245\n },\n {\n \"content\": \" bool m_isAbstract;\\n\\n int m_internalFieldsCount = 0;\\n\\n \\n\\n mutable Eternal<FunctionTemplate> *m_templateDecl;\\n\\n \\n\\n size_t m_allocatedMemoryAdjustment = sizeof(TClass);\\n\\n GC *m_gc;\\n\\n GC::TDtor m_customDtorHandler;\\n\\n \\n\\n inline static void internalConstructorInvocationCallback(const FunctionCallbackInfo<Value>& info)\\n\\n {\\n\\n using namespace boost;\\n\\n \\n\\n NativeClass<TClass> *self = static_cast<NativeClass<TClass> *>(External::Cast(*info.Data())->Value());\\n\\n \\n\\n EscapableHandleScope handle_scope(self->m_isolationScope);\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Firstly, make sure that this class wasn't marked as abstract\\n\\n //-------------------------------------------------\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 45,\n \"score\": 31786.207665752547\n },\n {\n \"content\": \" //\\n\\n // As a result, we can't forward the constructor directly to the CPP ctor but create a constructor that discrimiate between these cases.\\n\\n // The solution that came up is to pass the native instance as an External value when using NativeToJs. Here, we should check whether or not we've recevived as ctor args only 1 arg of type External.\\n\\n // if so, this is NativeToJs. Otherwise - we're dealing with new instansiation.\\n\\n //\\n\\n // For more details, see: http://create.tpsitulsa.com/blog/2009/01/29/v8-objects/\\n\\n //-------------------------------------------------\\n\\n External *externalInstance;\\n\\n TClass *instance;\\n\\n if (!info[0]->IsExternal())\\n\\n {\\n\\n //-------------------------------------------------\\n\\n // Do we got at least one constructor?\\n\\n // If not, we shall use a default one\\n\\n //-------------------------------------------------\\n\\n \\n\\n if (self->m_ctor->getOverloadsCount() < 1)\\n\\n {\\n\\n /* There's no constructor, so just create the object */\\n\\n try\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 46,\n \"score\": 31784.962192439347\n },\n {\n \"content\": \" *\\n\\n * For more details about the memory adjustment, see Isolate::AdjustAmountOfExternalAllocatedMemory\\n\\n * \\n\\n * You should call this method only when setting-up the NativeClass with fixed value. Otherwise, it may lead to memory-leak mistakes.\\n\\n *\\n\\n * Default adjustment:\\n\\n * If you wouldn't call this method at all, the default implementation use sizeof(TClass), which should be just fine for most cases.\\n\\n * \\n\\n * Zero:\\n\\n * Passing zero will cause to no memory ajustment been made at all.\\n\\n */\\n\\n inline NativeClass<TClass> *setAllocatedMemoryAdjustment(size_t cost)\\n\\n {\\n\\n this->m_allocatedMemoryAdjustment = cost;\\n\\n }\\n\\n \\n\\n /**\\n\\n * Set the number of internal fields the native class should reserve.\\n\\n * For basic knowladge on internal fields,\\n\\n please see V8's SetInternalFieldCount, SetAlignedPointerAtInternalField, GetIntenralPointerFromInternalField, SetInternalField and GetIntenralField.\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 47,\n \"score\": 31784.867089699943\n },\n {\n \"content\": \" inline NativeClass<TClass> *exposeStaticConstant(std::string name, int value)\\n\\n {\\n\\n this->getTemplate()->GetFunction()->Set(String::NewFromUtf8(this->m_isolationScope, name.c_str()),\\n\\n Number::New(this->m_isolationScope, value),\\n\\n static_cast<v8::PropertyAttribute>(v8::ReadOnly | v8::DontDelete));\\n\\n return this;\\n\\n }\\n\\n \\n\\n /**\\n\\n * Expose a specific method or method overload to JavaScript.\\n\\n * Note: sending the same methodName will allow to register an overload.\\n\\n *\\n\\n * @param std::string methodName - The JS method name.\\n\\n * @param TMethod method - reference to the C++ method.\\n\\n * @return NativeClass<TClass>\\n\\n *\\n\\n * Example:\\n\\n * C++:\\n\\n * carClass->exposeMethod(\\\"drive\\\", &Car::drive);\\n\\n * carClass->exposeStaticMethod(\\\"foo\\\", &Car::foo);\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 48,\n \"score\": 31784.45948414152\n },\n {\n \"content\": \" \\n\\n /* Expose the car to JS global scope. */\\n\\n engine->exposeClass(carClass);\\n\\n \\n\\n /* Execute! */\\n\\n HandleScope handle_scope(engine->getActiveIsolationScope()); // JS_PRINT_HANDLE uses ScriptingEngine::v8Eval which requires an handle scope since it returns raw v8 values\\n\\n \\n\\n // Fires Car(). should print blank/zero values since color and km was not set.\\n\\n JS_PRINT_HANDLE(\\\"var car = new Car(); 'Color: ' + car.color + '; KM: ' + car.km;\\\");\\n\\n std::cout << \\\"=========================================\\\" << std::endl;\\n\\n \\n\\n // Fires Car(std::string color). Should print 0 as KM since it was not set and \\\"Red\\\" as color.\\n\\n JS_PRINT_HANDLE(\\\"var car = new Car('Red'); 'Color: ' + car.color + '; KM: ' + car.km;\\\");\\n\\n std::cout << \\\"=========================================\\\" << std::endl;\\n\\n \\n\\n // Fires Car(int km). Should print blank color since it was not set and 10 as KM.\\n\\n JS_PRINT_HANDLE(\\\"var car = new Car(10); 'Color: ' + car.color + '; KM: ' + car.km;\\\");\\n\\n std::cout << \\\"=========================================\\\" << std::endl;\\n\\n \\n\\n // Fires Car(std::string color, int km). Should print \\\"Red\\\" as color and 10 as KM.\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 49,\n \"score\": 31783.9629476724\n },\n {\n \"content\": \" std::string m_color;\\n\\n};\\n\\n\\n\\nint main(int argc, const char * argv[])\\n\\n{\\n\\n /* Create a scripting engine */\\n\\n ScriptingEngine *engine = new ScriptingEngine();\\n\\n \\n\\n /* Create a new NativeClass which will be our endpoint for a native C++ class.\\n\\n The TClass template arg representing the class that you wish to expose.\\n\\n When exposing a class, it's been automaticly added to the Conversion API. */\\n\\n NativeClass<Car> *carClass = new NativeClass<Car>(engine->getActiveIsolationScope());\\n\\n \\n\\n /* We want to expose the \\\"getColor\\\" and \\\"setColor\\\" getter/setter\\n\\n and the drive method. Since the constructor is default, we don't need\\n\\n to explicity expose it.\\n\\n \\n\\n Note: If you don't want to allow to use the default constructor, you got two options:\\n\\n 1. You can use the exposeCtor with a ctor that requires an arguments. In this case,\\n\\n v8bridge won't allow the non-args ctor.\\n\",\n \"file_path\": \"samples/cpp_classes_basics.cpp\",\n \"rank\": 50,\n \"score\": 31783.895339106777\n },\n {\n \"content\": \" /* Create persistent object so we can make this object accessable outside the handle-scope ?*/\\n\\n v8::Persistent<v8::Object> handle(self->m_isolationScope, info.This());\\n\\n \\n\\n /* Setup weak connection */\\n\\n handle.SetWeak(instance, &NativeClass<TClass>::WeakObjectsDeletionCallback);\\n\\n handle.MarkIndependent();\\n\\n \\n\\n /* Expose to the class GC */\\n\\n if (self->m_customDtorHandler == NULL)\\n\\n {\\n\\n self->m_gc->queue(instance); // we can not send null, otherwise even the default dtor wont be run, thus, the object won't be released.\\n\\n }\\n\\n else\\n\\n {\\n\\n self->m_gc->queue(instance, self->m_customDtorHandler);\\n\\n }\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // Private methods\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 52,\n \"score\": 31783.410368248005\n },\n {\n \"content\": \" * Declares a custom destructor implementation.\\n\\n * The given dtor will be called when the object should be free'd (for instance, by the GC).\\n\\n *\\n\\n * Note that if you will not specify any custom dtor, the default implementation (GCGenericInstanceDestructor declared in internal_gc.hpp)\\n\\n * will attempt to dispose the instance using \\\"delete\\\" (and as a result will call the class destructor.\\n\\n */\\n\\n inline NativeClass<TClass> *declareCustomDtor(GC::TDtor dtor)\\n\\n {\\n\\n this->m_customDtorHandler = dtor;\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // Exposing Ctor(s)\\n\\n //=======================================================================\\n\\n \\n\\n template <class TCtor>\\n\\n inline NativeClass<TClass> *exposeCtor(TCtor const& constructor)\\n\\n {\\n\\n constructor.define(*this);\\n\\n return this;\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 53,\n \"score\": 31783.21032496911\n },\n {\n \"content\": \" 2. You can use the declareAsAbstract() method to declare the class as abstract.\\n\\n */\\n\\n \\n\\n // drive - expose a method:\\n\\n carClass->exposeMethod(\\\"drive\\\", &Car::drive);\\n\\n \\n\\n // getColor and setColor - expose as property accessor:\\n\\n carClass->exposePropertyAccessor(\\\"color\\\", &Car::getColor, &Car::setColor);\\n\\n \\n\\n /* Expose the car to JS global scope.\\n\\n NOTE: just like in NativeFunction, you MUST call this method,\\n\\n and you MUST do it AFTER FINISHING TO CONFIGURE YOUR ENDPOINT. */\\n\\n engine->exposeClass(carClass);\\n\\n \\n\\n /* Execute! */\\n\\n std::stringstream io;\\n\\n io << \\\"var car = new Car();\\\" << std::endl;\\n\\n io << \\\"car.color = 'red';\\\" << std::endl;\\n\\n io << \\\"car.drive();\\\";\\n\\n \\n\",\n \"file_path\": \"samples/cpp_classes_basics.cpp\",\n \"rank\": 54,\n \"score\": 31783.059054560792\n },\n {\n \"content\": \" //=======================================================================\\n\\n \\n\\n /**\\n\\n * Expose a specific property to JavaScript.\\n\\n *\\n\\n * For details, please see: NativeClass<TClass>::exposePropertyAccessor<TGetter, TSetter>(std::string, TGetter, TSetter, std::string, std::string)\\n\\n *\\n\\n * Note: This version expose a \\\"read-only\\\" property.\\n\\n * For read-and-write you should use exposePropertyAccessor<TGetter, TSetter>(std::string, TGetter, TSetter)\\n\\n *\\n\\n * @param std::string propertyName - the name of the property (variable) in JS.\\n\\n * @param TGetter getter - a reference to the getter method.\\n\\n * @param std::string getterMethodName [optional] - If specified, in addition to the property accessor declaration,\\n\\n * we're also binding the referenced TGetter to the given method name (i.e. one can access using the C++ method by \\\"x\\\" and \\\"getX\\\").\\n\\n */\\n\\n template<typename TGetter>\\n\\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, TGetter getter, std::string getterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getter, getterMethodName, /* isStatic: */false);\\n\\n }\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 55,\n \"score\": 31782.900613024518\n },\n {\n \"content\": \" this->m_isolationScope->AdjustAmountOfExternalAllocatedMemory(this->m_allocatedMemoryAdjustment * -1);\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n /**\\n\\n * Dispose the given object handle instance and free the underlaying C++ binded instance.\\n\\n */\\n\\n inline NativeClass<TClass> *disposeInstance(Handle<Value> handle)\\n\\n {\\n\\n if (handle.IsEmpty() || ! handle->IsObject()) { return this; }\\n\\n return this->disposeInstance(Handle<Object>(Object::Cast(*handle)));\\n\\n }\\n\\n \\n\\n \\n\\n /**\\n\\n * Static callback used with Persistent<T>.SetWeak in order to\\n\\n * delete references.\\n\\n */\\n\\n template <typename T, typename P>\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 56,\n \"score\": 31782.825896325827\n },\n {\n \"content\": \" }\\n\\n else\\n\\n {\\n\\n /* Get the v8::External instance */\\n\\n externalInstance = External::Cast(*info[0]);\\n\\n \\n\\n /* Get the TClass instance */\\n\\n instance = (TClass *)externalInstance->Value();\\n\\n }\\n\\n \\n\\n /* Save the TClass instance in the new created JS object */\\n\\n info.This()->SetAlignedPointerInInternalField(info.This()->InternalFieldCount() - 2, (void *)instance);\\n\\n \\n\\n /* Basic memory adjustment */\\n\\n self->m_isolationScope->AdjustAmountOfExternalAllocatedMemory(self->m_allocatedMemoryAdjustment);\\n\\n \\n\\n /* Save an pointer to \\\"this\\\" (self variable) since\\n\\n we can't access it in the SetWeak() callback. */\\n\\n info.This()->SetAlignedPointerInInternalField(info.This()->InternalFieldCount() - 1, (void *)self);\\n\\n \\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 57,\n \"score\": 31782.74711982896\n },\n {\n \"content\": \" \\n\\n /**\\n\\n * Dispose the given object handle instance and free the underlaying C++ binded instance.\\n\\n */\\n\\n inline NativeClass<TClass> *disposeInstance(Handle<Object> handle)\\n\\n {\\n\\n v8::HandleScope handle_scope(this->m_isolationScope);\\n\\n Persistent<Object> p(this->m_isolationScope, handle);\\n\\n \\n\\n void* ptr = handle->GetAlignedPointerFromInternalField(handle->InternalFieldCount() - 2);\\n\\n \\n\\n this->m_gc->disposeAndDequeue(ptr);\\n\\n \\n\\n for (int i = 0; i < handle->InternalFieldCount(); i++)\\n\\n {\\n\\n handle->SetAlignedPointerInInternalField(i, NULL);\\n\\n }\\n\\n p.Reset();\\n\\n \\n\\n /* Memory adjustment */\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 58,\n \"score\": 31782.496913945146\n },\n {\n \"content\": \" *\\n\\n * You should note that the internal fields count is the number of fields that you wish to reserve in order to been used BY YOU, not by v8bridge.\\n\\n * v8bridge reserves 2 internal fields, so in case you're not reserving anything (0) the number of internal fields will be 2,\\n\\n * in case you reserve 2 fields the internal fields count will be 4 and so on.\\n\\n *\\n\\n * v8bridge internal fields description:\\n\\n * 1'th field (N + 0'th index): A pointer to the binded (connected) C++ class instance.\\n\\n * 2'th field (N + 1'th index): A pointer to the owner NativeClass instance.\\n\\n */\\n\\n inline NativeClass<TClass> *setInternalFieldsCount(int fieldsCount)\\n\\n {\\n\\n this->m_templateDecl->Get(this->m_isolationScope)->InstanceTemplate()->SetInternalFieldCount(fieldsCount + 2);\\n\\n this->m_templateDecl->Get(this->m_isolationScope)->PrototypeTemplate()->SetInternalFieldCount(fieldsCount + 2);\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // Helpers\\n\\n //=======================================================================\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 59,\n \"score\": 31782.298670884567\n },\n {\n \"content\": \" \\n\\n // Properties (We're exposing read-only properties)\\n\\n carClass->exposePropertyAccessor(\\\"color\\\", &Car::getColor)\\n\\n ->exposePropertyAccessor(\\\"km\\\", &Car::getKm); \\n\\n \\n\\n /* Expose the class ctors. Since we can't receive from C++ the singature of a ctor (or dtor)\\n\\n we should use an alternative approch. Based on boost python binding approch, I've created a\\n\\n ctor types-list which is representing a ctor singature. You may send it to NativeClass<TClass>::exposeCtor()\\n\\n to declare a class.\\n\\n \\n\\n Examples:\\n\\n exposeCtor(ctor<>()) - empty (default) ctor. Note: you should not declare it unless you got another constructor overload.\\n\\n exposeCtor(ctor<int>()) - ctor that accepts an int.\\n\\n exposeCtor(ctor<int, int>()) - ctor that accepts two ints.\\n\\n */\\n\\n carClass->exposeCtor(ctor<>()) // Car()\\n\\n ->exposeCtor(ctor<std::string>()) // Car(std::string color)\\n\\n ->exposeCtor(ctor<int>()) // Car(int km)\\n\\n ->exposeCtor(ctor<std::string, int>()) // Car(std::string color, int km)\\n\\n ->exposeCtor(ctor<const FunctionCallbackInfo<Value> &>()); // fallback ctor - Car(const FunctionCallbackInfo<Value> &info)\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 60,\n \"score\": 31781.905079955202\n },\n {\n \"content\": \"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\\n\\n// Redistribution and use in source and binary forms, with or without\\n\\n// modification, are permitted provided that the following conditions are\\n\\n// met:\\n\\n//\\n\\n// * Redistributions of source code must retain the above copyright\\n\\n// notice, this list of conditions and the following disclaimer.\\n\\n// * Redistributions in binary form must reproduce the above\\n\\n// copyright notice, this list of conditions and the following\\n\\n// disclaimer in the documentation and/or other materials provided\\n\\n// with the distribution.\\n\\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\\n\\n// contributors may be used to endorse or promote products derived\\n\\n// from this software without specific prior written permission.\\n\\n//\\n\\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n// \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\\n\\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\\n\",\n \"file_path\": \"samples/cpp_classes_static.cpp\",\n \"rank\": 61,\n \"score\": 31781.786226607946\n },\n {\n \"content\": \"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\\n\\n// Redistribution and use in source and binary forms, with or without\\n\\n// modification, are permitted provided that the following conditions are\\n\\n// met:\\n\\n//\\n\\n// * Redistributions of source code must retain the above copyright\\n\\n// notice, this list of conditions and the following disclaimer.\\n\\n// * Redistributions in binary form must reproduce the above\\n\\n// copyright notice, this list of conditions and the following\\n\\n// disclaimer in the documentation and/or other materials provided\\n\\n// with the distribution.\\n\\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\\n\\n// contributors may be used to endorse or promote products derived\\n\\n// from this software without specific prior written permission.\\n\\n//\\n\\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n// \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\\n\\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 62,\n \"score\": 31781.786226607946\n },\n {\n \"content\": \"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\\n\\n// Redistribution and use in source and binary forms, with or without\\n\\n// modification, are permitted provided that the following conditions are\\n\\n// met:\\n\\n//\\n\\n// * Redistributions of source code must retain the above copyright\\n\\n// notice, this list of conditions and the following disclaimer.\\n\\n// * Redistributions in binary form must reproduce the above\\n\\n// copyright notice, this list of conditions and the following\\n\\n// disclaimer in the documentation and/or other materials provided\\n\\n// with the distribution.\\n\\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\\n\\n// contributors may be used to endorse or promote products derived\\n\\n// from this software without specific prior written permission.\\n\\n//\\n\\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n// \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\\n\\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\\n\",\n \"file_path\": \"samples/cpp_classes_basics.cpp\",\n \"rank\": 63,\n \"score\": 31781.786226607946\n },\n {\n \"content\": \"// Copyright 2014 Quartz Technologies, Ltd. All rights reserved.\\n\\n// Redistribution and use in source and binary forms, with or without\\n\\n// modification, are permitted provided that the following conditions are\\n\\n// met:\\n\\n//\\n\\n// * Redistributions of source code must retain the above copyright\\n\\n// notice, this list of conditions and the following disclaimer.\\n\\n// * Redistributions in binary form must reproduce the above\\n\\n// copyright notice, this list of conditions and the following\\n\\n// disclaimer in the documentation and/or other materials provided\\n\\n// with the distribution.\\n\\n// * Neither the name of Quartz Technologies Ltd. nor the names of its\\n\\n// contributors may be used to endorse or promote products derived\\n\\n// from this software without specific prior written permission.\\n\\n//\\n\\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n// \\\"AS IS\\\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\\n\\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 64,\n \"score\": 31781.786226607946\n },\n {\n \"content\": \" * C++ doesn't have \\\"properties\\\" (unlike C#) but we still use getters and setters.\\n\\n * Using this API you can attach specific getter and setter to a \\\"property\\\" (i.e. variable).\\n\\n *\\n\\n * @param std::string propertyName - the name of the property (variable) in JS.\\n\\n * @param TGetter getter - a reference to the getter method.\\n\\n * @param TSetter setter - a reference to the setter method.\\n\\n * @param std::string getterMethodName [optional] - If specified, in addition to the property accessor declaration,\\n\\n * we're also binding the referenced TGetter to the given method name (i.e. one can access using the C++ method by \\\"x\\\" and \\\"getX\\\").\\n\\n * @param std::string setterMethodName [optional] - If specified, in addition to the property accessor declaration,\\n\\n * we're also binding the referenced TSetter to the given method name.\\n\\n *\\n\\n * Example:\\n\\n * C++:\\n\\n * carClass->exposePropertyAccessor(\\\"color\\\", &Car::getColor, &Car::setColor);\\n\\n * JS:\\n\\n * var car = new Car();\\n\\n * car.color = \\\"Red\\\"; // Invokes C++'s Car::setColor\\n\\n * console.log( car.color ); // Invokes C++'s Car::getColor\\n\\n */\\n\\n template<typename TGetter, typename TSetter>\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 66,\n \"score\": 31781.464980447763\n },\n {\n \"content\": \" template<typename TType>\\n\\n inline NativeClass<TClass> *setStaticClassMember(const char *memberName, TType value)\\n\\n {\\n\\n this->setStaticClassMember(memberName, NativeToJs(value, this->m_isolationScope));\\n\\n return this;\\n\\n }\\n\\n \\n\\n \\n\\n inline NativeClass<TClass> *setClassMember(const char *memberName, Handle<Value> value)\\n\\n {\\n\\n this->getTemplate()\\n\\n ->InstanceTemplate()\\n\\n ->Set(String::NewFromUtf8(this->m_isolationScope, memberName), value);\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *setStaticClassMember(const char *memberName, Handle<Value> value)\\n\\n {\\n\\n this->getTemplate()\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 67,\n \"score\": 31781.262464992302\n },\n {\n \"content\": \" \\n\\n /**\\n\\n * Add a class member (ivar) to the class.\\n\\n *\\n\\n * Example:\\n\\n * C++:\\n\\n * obj->setClassMember(\\\"x\\\", 10);\\n\\n *\\n\\n * JS:\\n\\n * log(obj.x)\\n\\n * obj.x = 5;\\n\\n */\\n\\n template<typename TType>\\n\\n inline NativeClass<TClass> *setClassMember(const char *memberName, TType value)\\n\\n {\\n\\n this->setClassMember(memberName, NativeToJs(value, this->m_isolationScope));\\n\\n return this;\\n\\n }\\n\\n \\n\\n \\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 68,\n \"score\": 31781.083721457588\n },\n {\n \"content\": \" * JS:\\n\\n * var myCar = new Car();\\n\\n * myCar.drive();\\n\\n * Car.foo();\\n\\n */\\n\\n template<typename TMethod>\\n\\n inline NativeClass<TClass> *exposeMethod(std::string methodName, TMethod method)\\n\\n {\\n\\n return this->_exposeMethod(methodName, method, /* isStatic: */false);\\n\\n }\\n\\n \\n\\n template<typename TMethod>\\n\\n inline NativeClass<TClass> *exposeStaticMethod(std::string methodName, TMethod method)\\n\\n {\\n\\n return this->_exposeMethod(methodName, method, /* isStatic: */true);\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *exposeMethod(std::string methodName, NativeFunction *funcDecl)\\n\\n {\\n\\n assert(this->m_methods->find(methodName) == this->m_methods->end());\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 69,\n \"score\": 31780.87137395059\n },\n {\n \"content\": \" * NativeClass<Car> *carClass = new NativeClass<Car>();\\n\\n * carClass\\n\\n * ->setConst(\\\"WHEELS\\\", 4)\\n\\n * ->exposeMethod(\\\"drive\\\", &Car::drive)\\n\\n * ->exposeMethod(\\\"stop\\\", &Car::stop)\\n\\n * ->exposeStaticMethod(\\\"Factory\\\", &Car::Factory);\\n\\n * ->exposePropertyAccessor(\\\"color\\\", &Car::getColor, &Car::setColor);\\n\\n *\\n\\n * JS:\\n\\n * var car = new Car();\\n\\n * car.color = 'Red';\\n\\n * car.drive();\\n\\n * car.stop();\\n\\n * console.log(\\\"This is %s car which has %d wheels.\\\", car.color, Car.WHEELS);\\n\\n */\\n\\n template <class TClass>\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 70,\n \"score\": 31780.869175288193\n },\n {\n \"content\": \" printFunction->addOverload(print);\\n\\n engine->exposeFunction(printFunction, \\\"print\\\");\\n\\n \\n\\n /* Create a new NativeClass which will be our endpoint for a native C++ class. */\\n\\n NativeClass<FileUtils> *fileUtilsClass = new NativeClass<FileUtils>(engine->getActiveIsolationScope());\\n\\n \\n\\n /* Expose some static methods */\\n\\n fileUtilsClass->exposeStaticMethod(\\\"FileExists\\\", &FileUtils::FileExists)\\n\\n ->exposeStaticMethod(\\\"Read\\\", &FileUtils::Read);\\n\\n \\n\\n /* Expose the car to JS global scope. */\\n\\n engine->exposeClass(fileUtilsClass);\\n\\n \\n\\n /* Execute! */\\n\\n std::stringstream io;\\n\\n io << \\\"var filePath = './foo.txt';\\\" << std::endl;\\n\\n io << \\\"if (FileUtils.FileExists(filePath)) {\\\" << std::endl;\\n\\n io << \\\" var contents = FileUtils.Read(filePath);\\\" << std::endl;\\n\\n io << \\\" print('File Path: ' + filePath + '. Contents:');\\\" << std::endl;\\n\\n io << \\\" print(contents);\\\" << std::endl;\\n\",\n \"file_path\": \"samples/cpp_classes_static.cpp\",\n \"rank\": 71,\n \"score\": 31780.797188453944\n },\n {\n \"content\": \" * Get the class JS function template\\n\\n */\\n\\n inline Handle<FunctionTemplate> getTemplate() { return this->m_templateDecl->Get(this->m_isolationScope); }\\n\\n \\n\\n /**\\n\\n * Test if a given handle is an instance of this class.\\n\\n */\\n\\n inline bool isInstanceOf(Handle<Value> value)\\n\\n {\\n\\n return this->getTemplate()->HasInstance(value);\\n\\n }\\n\\n \\n\\n /**\\n\\n * Set the function client-side class name (e.g. \\\"Foo\\\" will result in [object Foo])\\n\\n */\\n\\n inline NativeClass<TClass> *setClientClassName(std::string name)\\n\\n {\\n\\n this->getTemplate()->SetClassName(String::NewFromUtf8(this->m_isolationScope, name.c_str()));\\n\\n return this;\\n\\n }\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 72,\n \"score\": 31780.66691385685\n },\n {\n \"content\": \" {\\n\\n return this->m_color;\\n\\n }\\n\\n \\n\\n int getKm()\\n\\n {\\n\\n return this->m_km;\\n\\n }\\n\\nprivate:\\n\\n std::string m_color;\\n\\n int m_km;\\n\\n};\\n\\n\\n\\nint main(int argc, const char * argv[])\\n\\n{\\n\\n /* Create a scripting engine */\\n\\n ScriptingEngine *engine = new ScriptingEngine();\\n\\n \\n\\n /* Setup our endpoint */\\n\\n NativeClass<Car> *carClass = new NativeClass<Car>(engine->getActiveIsolationScope());\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 73,\n \"score\": 31780.658148480732\n },\n {\n \"content\": \" \\n\\n template<typename TGetter>\\n\\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, TGetter getter, std::string getterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getter, getterMethodName, /* isStatic: */true);\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, std::string getterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getterMethod, getterMethodName, /* isStatic: */false);\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, NativeFunction *getterMethod, std::string getterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getterMethod, getterMethodName, /* isStatic: */true);\\n\\n }\\n\\n \\n\\n /**\\n\\n * Expose a specific property to JavaScript.\\n\\n *\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 74,\n \"score\": 31780.645872811958\n },\n {\n \"content\": \" this->m_templateDecl = new Eternal<FunctionTemplate>(this->m_isolationScope, templ);\\n\\n this->setInternalFieldsCount(0);\\n\\n this->setClientClassName(TypeId< typename TypeResolver<TClass>::type >().name());\\n\\n }\\n\\n \\n\\n ~NativeClass()\\n\\n {\\n\\n /* Registered ctor */\\n\\n delete this->m_ctor;\\n\\n \\n\\n /* Registered methods */\\n\\n for (TMethodsMap::iterator it = this->m_methods->begin(); it != this->m_methods->end(); ++it)\\n\\n {\\n\\n (*it).second.reset();\\n\\n }\\n\\n \\n\\n this->m_methods->clear();\\n\\n delete this->m_methods;\\n\\n \\n\\n \\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 75,\n \"score\": 31780.5848208492\n },\n {\n \"content\": \" {\\n\\n instance = new TClass();\\n\\n }\\n\\n catch (...)\\n\\n {\\n\\n delete instance;\\n\\n throw;\\n\\n }\\n\\n \\n\\n /* Save the binded C++ instance in the new created JS object */\\n\\n info.This()->SetAlignedPointerInInternalField(info.This()->InternalFieldCount() - 2, (void *)instance);\\n\\n }\\n\\n else\\n\\n {\\n\\n /* Invoke the actual class constructor */\\n\\n self->m_ctor->invoke(info);\\n\\n \\n\\n /* Get the TClass instance */\\n\\n instance = (TClass *)info.This()->GetAlignedPointerFromInternalField(info.This()->InternalFieldCount() - 2);\\n\\n }\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 76,\n \"score\": 31780.55613988484\n },\n {\n \"content\": \" //=======================================================================\\n\\n \\n\\n template <typename TCtor, typename TCtorSignature>\\n\\n inline NativeClass<TClass> *_exposeCtor(TCtor callback, TCtorSignature signature)\\n\\n {\\n\\n this->m_ctor->template addOverload<TCtor, TCtorSignature>(callback, signature);\\n\\n return this;\\n\\n }\\n\\n \\n\\n template<typename TMethod>\\n\\n inline NativeClass<TClass> *_exposeMethod(std::string methodName, TMethod method, bool isStatic = false)\\n\\n {\\n\\n HandleScope handle_scope(this->m_isolationScope);\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Do we got a registered method with the same name\\n\\n //-------------------------------------------------\\n\\n \\n\\n TMethodsMap *map = isStatic ? this->m_staticMethods : this->m_methods;\\n\\n \\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 77,\n \"score\": 31780.557380593455\n },\n {\n \"content\": \" \\n\\n /**\\n\\n * Declare this JS class as non-instanciatable.\\n\\n */\\n\\n inline NativeClass<TClass> declareAsAbstract(bool status = true)\\n\\n {\\n\\n this->m_isAbstract = status;\\n\\n return this;\\n\\n }\\n\\n \\n\\n \\n\\n /**\\n\\n * Check if the native class was declared as abstract class\\n\\n */\\n\\n inline bool isDeclaredAsAbstract()\\n\\n {\\n\\n return this->m_isAbstract;\\n\\n }\\n\\n \\n\\n /**\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 78,\n \"score\": 31780.53241042587\n },\n {\n \"content\": \" inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, TGetter getter, TSetter setter, std::string getterMethodName = \\\"\\\", std::string setterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getter, setter, getterMethodName, setterMethodName, /* isStatic: */false);\\n\\n }\\n\\n \\n\\n template<typename TGetter, typename TSetter>\\n\\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, TGetter getter, TSetter setter, std::string getterMethodName = \\\"\\\", std::string setterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getter, setter, getterMethodName, setterMethodName, /* isStatic: */true);\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, NativeFunction *setterMethod, std::string getterMethodName = \\\"\\\", std::string setterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getterMethod, setterMethod, getterMethodName, setterMethodName, /* isStatic: */false);\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *exposeStaticPropertyAccessor(std::string propertyName, NativeFunction *getterMethod, NativeFunction *setterMethod, std::string getterMethodName = \\\"\\\", std::string setterMethodName = \\\"\\\")\\n\\n {\\n\\n return this->_exposePropertyAccessor(propertyName, getterMethod, setterMethod, getterMethodName, setterMethodName, /* isStatic: */true);\\n\\n }\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 79,\n \"score\": 31780.449607550465\n },\n {\n \"content\": \" inline static void WeakObjectsDeletionCallback(const WeakCallbackData<T, P>& data)\\n\\n {\\n\\n Local<Object> pobj = data.GetValue();\\n\\n NativeClass<TClass> *self = static_cast<NativeClass<TClass> *>(pobj->GetAlignedPointerFromInternalField(pobj->InternalFieldCount() - 1));\\n\\n \\n\\n self->disposeInstance(pobj);\\n\\n }\\n\\n \\n\\n \\n\\n private:\\n\\n typedef std::list<boost::shared_ptr<NativeFunction> > TMethodsList;\\n\\n typedef std::map<std::string, boost::shared_ptr<NativeFunction> > TMethodsMap;\\n\\n \\n\\n NativeCtor *m_ctor;\\n\\n \\n\\n TMethodsMap *m_methods;\\n\\n TMethodsMap *m_staticMethods;\\n\\n TMethodsMap *m_accessors;\\n\\n TMethodsMap *m_staticAccessors;\\n\\n \\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 80,\n \"score\": 31780.4025017671\n },\n {\n \"content\": \" engine->execute(io.str());\\n\\n \\n\\n /* Free */\\n\\n delete carClass;\\n\\n delete engine;\\n\\n \\n\\n /* Done. */\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"samples/cpp_classes_basics.cpp\",\n \"rank\": 81,\n \"score\": 31780.12226821657\n },\n {\n \"content\": \" {\\n\\n /* Add to the instance template */\\n\\n this->getTemplate()\\n\\n ->SetAccessorProperty(\\n\\n /* name: */ String::NewFromUtf8(this->m_isolationScope, propertyName.c_str()),\\n\\n /* getter: */ getterMethod->getTemplate(),\\n\\n /* setter: */ Local<FunctionTemplate>(),\\n\\n /* PropertyAttributes: */ReadOnly\\n\\n );\\n\\n }\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *_exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, std::string getterMethodName = \\\"\\\", bool isStatic = false)\\n\\n {\\n\\n HandleScope handle_scope(this->m_isolationScope);\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Do we got a registered accesso with the same name\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 82,\n \"score\": 31779.851044275176\n },\n {\n \"content\": \" \\n\\n /* Add to the global template */\\n\\n this->getTemplate()\\n\\n ->Set(String::NewFromUtf8(this->m_isolationScope, methodName.c_str()), funcDecl->getTemplate()->GetFunction());\\n\\n }\\n\\n }\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n template<typename TGetter>\\n\\n inline NativeClass<TClass> *_exposePropertyAccessor(std::string propertyName, TGetter getter, std::string getterMethodName = \\\"\\\", bool isStatic = false)\\n\\n {\\n\\n HandleScope handle_scope(this->m_isolationScope);\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Do we got a registered accesso with the same name\\n\\n //-------------------------------------------------\\n\\n \\n\\n TMethodsMap *map = isStatic ? this->m_staticAccessors : this->m_accessors;\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 83,\n \"score\": 31779.83590330473\n },\n {\n \"content\": \" \\n\\n /* Create a shared pointer */\\n\\n boost::shared_ptr<NativeFunction> adapter(funcDecl);\\n\\n \\n\\n /* Store */\\n\\n this->m_methods->insert(std::make_pair(methodName, adapter));\\n\\n \\n\\n /* Add to the instance template */\\n\\n this->getTemplate()\\n\\n ->InstanceTemplate()\\n\\n ->Set(String::NewFromUtf8(this->m_isolationScope, methodName.c_str()), funcDecl->getTemplate()->GetFunction());\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n inline NativeClass<TClass> *exposeStaticMethod(std::string methodName, NativeFunction *funcDecl)\\n\\n {\\n\\n assert(this->m_staticMethods->find(methodName) == this->m_staticMethods->end());\\n\\n \\n\\n /* Create a shared pointer */\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 84,\n \"score\": 31779.82088265858\n },\n {\n \"content\": \" /* name: */ String::NewFromUtf8(this->m_isolationScope, propertyName.c_str()),\\n\\n /* getter: */ getterMethod->getTemplate(),\\n\\n /* setter: */ setterMethod->getTemplate()\\n\\n );\\n\\n }\\n\\n else\\n\\n {\\n\\n this->getTemplate()\\n\\n ->SetAccessorProperty(\\n\\n /* name: */ String::NewFromUtf8(this->m_isolationScope, propertyName.c_str()),\\n\\n /* getter: */ getterMethod->getTemplate(),\\n\\n /* setter: */ setterMethod->getTemplate()\\n\\n );\\n\\n }\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n \\n\\n inline NativeClass<TClass> *exposePropertyAccessor(std::string propertyName, NativeFunction *getterMethod, NativeFunction *setterMethod, std::string getterMethodName = \\\"\\\", std::string setterMethodName = \\\"\\\", bool isStatic = false)\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 86,\n \"score\": 31779.663203919223\n },\n {\n \"content\": \" inline NativeClass<TClass> *_exposePropertyAccessor(std::string propertyName, TGetter getter, TSetter setter, std::string getterMethodName = \\\"\\\", std::string setterMethodName = \\\"\\\", bool isStatic = false)\\n\\n {\\n\\n HandleScope handle_scope(this->m_isolationScope);\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Do we got a registered accesso with the same name\\n\\n //-------------------------------------------------\\n\\n \\n\\n TMethodsMap *map = isStatic ? this->m_staticAccessors : this->m_accessors;\\n\\n assert(map->find(propertyName) == map->end());\\n\\n \\n\\n //-------------------------------------------------\\n\\n // Create a new pair\\n\\n //-------------------------------------------------\\n\\n \\n\\n /* New function instances */\\n\\n NativeFunction *getterMethod = new NativeFunction(this->m_isolationScope);\\n\\n NativeFunction *setterMethod = new NativeFunction(this->m_isolationScope);\\n\\n \\n\\n /* Add the initial overlaod */\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 87,\n \"score\": 31779.582639383003\n },\n {\n \"content\": \" io << \\\"} else {\\\" << std::endl;\\n\\n io << \\\" print('The requested file path (' + filePath + ') does not exists.');\\\" << std::endl;\\n\\n io << \\\"}\\\" << std::endl;\\n\\n \\n\\n \\n\\n \\n\\n engine->execute(io.str());\\n\\n \\n\\n /* Free */\\n\\n delete printFunction;\\n\\n delete fileUtilsClass;\\n\\n delete engine;\\n\\n \\n\\n /* Done. */\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"samples/cpp_classes_static.cpp\",\n \"rank\": 88,\n \"score\": 31779.578074530746\n },\n {\n \"content\": \" JS_PRINT_HANDLE(\\\"var car = new Car('Red', 10); 'Color: ' + car.color + '; KM: ' + car.km;\\\");\\n\\n std::cout << \\\"=========================================\\\" << std::endl;\\n\\n \\n\\n // Fires Car(const FunctionCallbackInfo<Value> &info). Should print \\\"Red\\\" as color and 16 as KM.\\n\\n JS_PRINT_HANDLE(\\\"var car = new Car('Red', 10, 1, 2, 3); 'Color: ' + car.color + '; KM: ' + car.km;\\\");\\n\\n std::cout << \\\"=========================================\\\" << std::endl;\\n\\n \\n\\n /* Free */\\n\\n delete carClass;\\n\\n delete engine;\\n\\n \\n\\n /* Done. */\\n\\n return 0;\\n\\n}\\n\\n \\n\\n#undef JS_PRINT_HANDLE\\n\",\n \"file_path\": \"samples/cpp_classes_ctor.cpp\",\n \"rank\": 90,\n \"score\": 31779.026003360657\n },\n {\n \"content\": \" inline NativeFunction *getExposedStaticSetterAccessor(std::string propertyName)\\n\\n {\\n\\n propertyName = \\\"__set_accessor_\\\" + propertyName;\\n\\n \\n\\n if (this->m_staticAccessors->find(propertyName) == this->m_accessors->end())\\n\\n {\\n\\n return NULL;\\n\\n }\\n\\n \\n\\n return this->m_staticAccessors->find(propertyName).second;\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // Wrapping & Unwrapping objects\\n\\n //=======================================================================\\n\\n inline Local<Object> wrap(TClass *connectedInstance)\\n\\n {\\n\\n EscapableHandleScope handle_scope(this->m_isolationScope);\\n\\n \\n\\n Handle<Value> argv[] = { External::New(this->m_isolationScope, (void*)connectedInstance) };\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 92,\n \"score\": 31778.953338472522\n },\n {\n \"content\": \" {\\n\\n return NULL;\\n\\n }\\n\\n \\n\\n return this->m_methods->find(methodName).second;\\n\\n }\\n\\n \\n\\n inline NativeFunction *getExposedStaticMethod(std::string methodName)\\n\\n {\\n\\n if (this->m_staticMethods->find(methodName) == this->m_staticMethods->end())\\n\\n {\\n\\n return NULL;\\n\\n }\\n\\n \\n\\n return this->m_staticMethods->find(methodName).second;\\n\\n }\\n\\n \\n\\n \\n\\n //=======================================================================\\n\\n // Exposing Accessor(s)\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 93,\n \"score\": 31776.055666468783\n },\n {\n \"content\": \" boost::shared_ptr<NativeFunction> adapter(funcDecl);\\n\\n \\n\\n /* Store */\\n\\n this->m_staticMethods->insert(std::make_pair(methodName, adapter));\\n\\n \\n\\n /* Add to the instance template */\\n\\n this->getTemplate()\\n\\n ->Set(String::NewFromUtf8(this->m_isolationScope, methodName.c_str()), funcDecl->getTemplate()->GetFunction());\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n /**\\n\\n * Retrieve the registered NativeFunction instance for the given method name\\n\\n * @param std::string methodName - the method name.\\n\\n * @return NativeFunction - the native function data to expose.\\n\\n */\\n\\n inline NativeFunction *getExposedMethod(std::string methodName)\\n\\n {\\n\\n if (this->m_methods->find(methodName) == this->m_methods->end())\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 94,\n \"score\": 31776.055666468783\n },\n {\n \"content\": \" ->Set(String::NewFromUtf8(this->m_isolationScope, memberName), value);\\n\\n \\n\\n return this;\\n\\n }\\n\\n \\n\\n \\n\\n //=======================================================================\\n\\n // Exposing Method(s)\\n\\n //=======================================================================\\n\\n \\n\\n /**\\n\\n * Expose a static constant to JavaScript.\\n\\n *\\n\\n * Example:\\n\\n * C++:\\n\\n * obj->exposeStaticConstant(\\\"WHEELS\\\", 4);\\n\\n *\\n\\n * JS:\\n\\n * log(obj.WHEELS);\\n\\n */\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 95,\n \"score\": 31776.055666468783\n },\n {\n \"content\": \" \\n\\n inline NativeFunction *getExposedGetterAccessor(std::string propertyName)\\n\\n {\\n\\n propertyName = \\\"__get_accessor_\\\" + propertyName;\\n\\n \\n\\n if (this->m_accessors->find(propertyName) == this->m_accessors->end())\\n\\n {\\n\\n return NULL;\\n\\n }\\n\\n \\n\\n return this->m_accessors->find(propertyName).second;\\n\\n }\\n\\n \\n\\n \\n\\n inline NativeFunction *getExposedStaticGetterAccessor(std::string propertyName)\\n\\n {\\n\\n propertyName = \\\"__get_accessor_\\\" + propertyName;\\n\\n \\n\\n if (this->m_staticAccessors->find(propertyName) == this->m_accessors->end())\\n\\n {\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 96,\n \"score\": 31776.055666468783\n },\n {\n \"content\": \" /* Registered static methods */\\n\\n for (TMethodsMap::iterator it = this->m_staticMethods->begin(); it != this->m_staticMethods->end(); ++it)\\n\\n {\\n\\n (*it).second.reset();\\n\\n }\\n\\n \\n\\n this->m_staticMethods->clear();\\n\\n delete this->m_staticMethods;\\n\\n \\n\\n /* Registered accessors */\\n\\n for (TMethodsMap::iterator it = this->m_accessors->begin(); it != this->m_accessors->end(); ++it)\\n\\n {\\n\\n (*it).second.reset();\\n\\n }\\n\\n \\n\\n this->m_accessors->clear();\\n\\n delete this->m_accessors;\\n\\n \\n\\n \\n\\n /* Registered static accessors */\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 97,\n \"score\": 31776.055666468783\n },\n {\n \"content\": \" for (TMethodsMap::iterator it = this->m_staticAccessors->begin(); it != this->m_staticAccessors->end(); ++it)\\n\\n {\\n\\n (*it).second.reset();\\n\\n }\\n\\n \\n\\n this->m_staticAccessors->clear();\\n\\n delete this->m_staticAccessors;\\n\\n \\n\\n /* GC */\\n\\n delete this->m_gc;\\n\\n \\n\\n /* Ctor */\\n\\n delete this->m_templateDecl;\\n\\n }\\n\\n \\n\\n //=======================================================================\\n\\n // General\\n\\n //=======================================================================\\n\\n \\n\\n /**\\n\",\n \"file_path\": \"v8bridge/native/native_class.hpp\",\n \"rank\": 98,\n \"score\": 31776.055666468783\n },\n {\n \"content\": \"# include <boost/preprocessor/enum_params.hpp>\\n\\n\\n\\n# define V8_BRIDGE_OVERLOAD_TYPES_WITH_DEFAULT_VALUE BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT(V8_MAX_ARITY, class TClass, mpl::void_)\\n\\n\\n\\n# define V8_BRIDGE_OVERLOAD_TYPES BOOST_PP_ENUM_PARAMS_Z(1, V8_MAX_ARITY, class TClass)\\n\\n\\n\\n# define V8_BRIDGE_OVERLOAD_ARGS BOOST_PP_ENUM_PARAMS_Z(1, V8_MAX_ARITY, TClass)\\n\\n\\n\\nnamespace v8\\n\\n{\\n\\n namespace bridge\\n\\n {\\n\\n using namespace boost;\\n\\n \\n\\n template <V8_BRIDGE_OVERLOAD_TYPES_WITH_DEFAULT_VALUE>\\n\",\n \"file_path\": \"v8bridge/detail/ctor.hpp\",\n \"rank\": 99,\n \"score\": 23.401130365096655\n }\n]","isConversational":false}}},{"rowIdx":96,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"ModelTakuzu.cpp"},"repo_name":{"kind":"string","value":"Ezryuk/Takuzu"},"commit":{"kind":"string","value":"6dd94470c15c0071ca210a9655eb85d8458163c3"},"file_code":{"kind":"string","value":"#include \"ModelTakuzu.h\"\n#include <cassert>\n#include <iostream>\n#include <QtAlgorithms>\n#include <QFile>\n#include <QTextStream>\n\nModelTakuzu::ModelTakuzu()\n{\n _nbMaps = -1;\n _sizeMap = -1;\n _grids = nullptr;\n}\n\nModelTakuzu::~ModelTakuzu()\n{\n delete[] _grids;\n}\n\nPawn ModelTakuzu::permuteR(Pawn p)\n{\n if (p == Black) {\n return White;\n } else if (p == White) {\n return Empty;\n } else {\n return Black;\n }\n}\n\nPawn ModelTakuzu::permuteL(Pawn p)\n{\n if (p == Black) {\n return Empty;\n } else if (p == Empty) {\n return White;\n } else {\n return Black;\n }\n}\n\nvoid ModelTakuzu::loadFile(const QString &name)\n{\n QFile file(\":/resources/\"+name);\n if (!(file.open(QIODevice::ReadOnly | QIODevice::Text))) {\n std::cerr << \"Error while opening new file: \" << name.toStdString() << \" .\\n\";\n } else {\n QString line;\n QTextStream in(&file);\n\n \n bool ok = true;\n _nbMaps = in.readLine().toInt(&ok);\n if (!ok) {\n std::cerr << \"Issue when reading new line. \\n\"\\\n << \"Make sure the file has the same path as the executable.\\n\";\n }\n \n _grids = new Grid_[_nbMaps];\n for (int i = 0; i < _nbMaps; ++i) {\n _grids[i] = Grid_(_sizeMap * _sizeMap);\n }\n\n \n int i = 0;\n while (!in.atEnd()) {\n line = in.readLine();\n int letterIndex = 0;\n QChar letter;\n foreach(letter, line) {\n if (letterIndex < _sizeMap * _sizeMap) {\n _grids[i][letterIndex++] = ModelTakuzu::toPawn(letter);\n }\n }\n i++;\n }\n }\n}\n\nvoid ModelTakuzu::chooseMapPool(ModelTakuzu::Difficulty difficulty, int size)\n{\n QString name = QString::number(size);\n if (difficulty == Easy) {\n name.append(\"_easy.txt\");\n } else {\n name.append(\"_hard.txt\");\n }\n _difficulty = difficulty;\n _sizeMap = size;\n loadFile(QString(name));\n setRandomMap();\n emit notifyNumberMap(_difficulty, _sizeMap, _chosenMap, _nbMaps);\n}\n\nint ModelTakuzu::setMap(int chosenMap)\n{\n assert((_nbMaps != -1 || _sizeMap != -1) && \\\n \"Choose a map pool before using setRandomMap().\");\n _chosenMap = chosenMap;\n _currentGrid = _grids[chosenMap];\n _countPawn = {\n std::vector<int>(_sizeMap),\n std::vector<int>(_sizeMap),\n std::vector<int>(_sizeMap),\n std::vector<int>(_sizeMap)\n };\n for(int i = 0; i < _sizeMap; ++i) {\n for (int j = 0; j < _sizeMap; ++j) {\n emit notifyInitialPawn(i, j, _grids[chosenMap][i * _sizeMap + j]); \n }\n }\n initCount();\n return _chosenMap;\n}\n\nint ModelTakuzu::setRandomMap()\n{\n int randomGridIndex = (rand() % _nbMaps);\n _chosenMap = setMap(randomGridIndex);\n return randomGridIndex;\n}\n\nvoid ModelTakuzu::playAt(int i, int j, Pawn pawn)\n{\n assert((!_currentGrid.empty()) && \\\n \"Set a map using setRandomMap() before calling playAt().\");\n Pawn oldPawn = pawnAt(i, j);\n Pawn newPawn = pawn;\n updateCount(i, j, oldPawn, newPawn);\n pawnAt(i, j) = newPawn;\n positionIsValid(i, j);\n emit notifyNewPawn(i, j, pawn);\n}\n\nbool ModelTakuzu::positionIsValid(int i, int j)\n{\n const bool isVertical = true;\n const bool isOK = true;\n\n bool repetitionInRow = isBBBorWWWpresentIn(getRow(i));\n bool repetitionInCol = isBBBorWWWpresentIn(getCol(j));\n if (repetitionInRow) {\n emit notifyOverThreeAdjacentPawns(i, !isVertical, !isOK);\n } else {\n emit notifyOverThreeAdjacentPawns(i, !isVertical, isOK);\n }\n if (repetitionInCol) {\n emit notifyOverThreeAdjacentPawns(j, isVertical, !isOK);\n } else {\n emit notifyOverThreeAdjacentPawns(j, isVertical, isOK);\n }\n\n int oneOtherIdenticalRow = findFirstIdenticalRowTo(i);\n int oneOtherIdenticalCol = findFirstIdenticalColTo(j);\n static auto oneOtherIdenticalRowColIsFound = [this](int index) -> bool {\n return (index != _sizeMap);\n };\n if (oneOtherIdenticalRowColIsFound(oneOtherIdenticalRow)) {\n emit notifyCommonPatterns(i, oneOtherIdenticalRow, !isVertical, isOK);\n } else {\n emit notifyCommonPatterns(i, oneOtherIdenticalRow, !isVertical, !isOK);\n }\n if (oneOtherIdenticalRowColIsFound(oneOtherIdenticalCol)) {\n emit notifyCommonPatterns(j, oneOtherIdenticalCol, isVertical, isOK);\n } else {\n emit notifyCommonPatterns(j, oneOtherIdenticalCol, isVertical, !isOK);\n }\n\n return (!repetitionInRow &&\n !repetitionInCol &&\n (oneOtherIdenticalRow == _sizeMap) &&\n (oneOtherIdenticalCol == _sizeMap));\n}\n\nbool ModelTakuzu::rowIsValid(int i)\n{\n static auto forAll = [](bool tab[], int length) -> bool {\n for (int i = 0; i < length; ++i) {\n if (!tab[i]) return false;\n }\n return true;\n };\n bool tab[_sizeMap];\n for (int j = 0; j < _sizeMap; ++j) {\n tab[j] = positionIsValid(i, j);\n }\n return forAll(tab, _sizeMap) &&\n (_countPawn._Brow[i] == _countPawn._Wrow[i]);\n}\n\nbool ModelTakuzu::colIsValid(int j)\n{\n static auto forAll = [](bool tab[], int length) -> bool {\n for (int i = 0; i < length; ++i) {\n if (!tab[i]) return false;\n }\n return true;\n };\n bool tab[_sizeMap];\n for (int i = 0; i < _sizeMap; ++i) {\n tab[i] = positionIsValid(i, j);\n }\n return forAll(tab, _sizeMap) &&\n (_countPawn._Bcol[j] == _countPawn._Wcol[j]);\n}\n\nvoid ModelTakuzu::initCount()\n{\n for (int i = 0; i < _sizeMap; ++i) {\n for (int j = 0; j < _sizeMap; ++j) {\n updateCount(i, j, Empty, _grids[_chosenMap][i * _sizeMap + j]);\n }\n }\n}\n\nvoid ModelTakuzu::updateCount(int i, int j, Pawn oldPawn, Pawn newPawn)\n{\n if (oldPawn != newPawn) {\n switch (oldPawn) {\n case Black:\n _countPawn._Brow[i]--;\n _countPawn._Bcol[j]--;\n break;\n case White:\n _countPawn._Wrow[i]--;\n _countPawn._Wcol[j]--;\n break;\n case Empty:\n break;\n }\n switch (newPawn) {\n case Black:\n _countPawn._Brow[i]++;\n _countPawn._Bcol[j]++;\n break;\n case White:\n _countPawn._Wrow[i]++;\n _countPawn._Wcol[j]++;\n break;\n case Empty:\n break;\n }\n }\n emit notifyCount(i, j,\n _countPawn._Brow[i],\n _countPawn._Bcol[j],\n _countPawn._Wrow[i],\n _countPawn._Wcol[j]);\n}\n\nPawn ModelTakuzu::getPawn(int i, int j) const\n{\n return _currentGrid[i * _sizeMap + j];\n}\n\nbool ModelTakuzu::doFinalCheck()\n{\n std::vector<bool> isValid;\n for(int i = 0; i < _sizeMap; ++i) {\n for(int j = 0; j < _sizeMap; ++j) {\n isValid.push_back(positionIsValid(i, j));\n }\n }\n std::vector<std::vector<Pawn>> rowsAndCols;\n for (int i = 0; i < _sizeMap; ++i) {\n rowsAndCols.push_back(getRow(i));\n rowsAndCols.push_back(getCol(i));\n }\n\n std::vector<int> counterOcc;\n std::for_each(rowsAndCols.begin(), rowsAndCols.end(), [&counterOcc](std::vector<Pawn> &vec) -> void {\n counterOcc.push_back(std::count(vec.begin(), vec.end(), Black));\n counterOcc.push_back(std::count(vec.begin(), vec.end(), White));\n });\n\n return (std::all_of(_currentGrid.begin(), _currentGrid.end(),\n [](Pawn p)->bool { return (p != Empty);}) &&\n std::all_of(isValid.begin(), isValid.end(), [](bool b)-> bool {return b;}) &&\n std::all_of(counterOcc.begin(), counterOcc.end(), [this](int v) -> bool {return (_sizeMap == 2 * v);}));\n}\n\nvoid ModelTakuzu::registerPlayAt(int i, int j)\n{\n Pawn nextPawn = permuteR(pawnAt(i, j));\n playAt(i, j, nextPawn);\n}\n\nvoid ModelTakuzu::registerChooseMapPool(ModelTakuzu::Difficulty difficulty, int size)\n{\n chooseMapPool(difficulty, size);\n}\n\nvoid ModelTakuzu::registerSizeMapPicked(ModelTakuzu::Difficulty difficulty, int size)\n{\n QString name = QString::number(size);\n if (difficulty == Easy) {\n name.append(\"_easy.txt\");\n } else {\n name.append(\"_hard.txt\");\n }\n _difficulty = difficulty;\n _sizeMap = size;\n loadFile(QString(name));\n emit notifyNbMaps(_nbMaps);\n}\n\nvoid ModelTakuzu::registerChooseMapPicked(int mapPicked)\n{\n _chosenMap = mapPicked;\n setMap(_chosenMap);\n emit notifyNumberMap(_difficulty, _sizeMap, _chosenMap, _nbMaps);\n}\n\nvoid ModelTakuzu::registerAttemptToEndGame()\n{\n bool win = doFinalCheck();\n emit notifyEndGame(win);\n}\n\nQChar ModelTakuzu::toQChar(Pawn pawn)\n{\n switch (pawn) {\n case Black: return QChar('B');\n case White: return QChar('W');\n case Empty: return QChar('.');\n default: return QChar('.');\n }\n}\n\nPawn ModelTakuzu::toPawn(QChar letter)\n{\n switch (letter.unicode()) {\n case 'B': return Black;\n case 'W': return White;\n case '.': return Empty;\n default: return Empty;\n }\n}\n\nPawn &ModelTakuzu::pawnAt(int i, int j)\n{\n assert(_chosenMap != -1 &&\n \"A map should be chosen before trying to access to _currentGrid.\");\n return _currentGrid[i * _sizeMap + j];\n}\n\nPawn ModelTakuzu::pawnAt(int i, int j) const\n{\n assert(_chosenMap != -1 &&\n \"A map should be chosen before trying to access to _currentGrid.\");\n return _currentGrid[i * _sizeMap + j];\n}\n\nstd::vector<Pawn> ModelTakuzu::getRow(int i) const\n{\n return std::vector<Pawn>(_currentGrid.begin() + i * _sizeMap,\n _currentGrid.begin() + (i + 1) * _sizeMap);\n}\n\nstd::vector<Pawn> ModelTakuzu::getCol(int j) const\n{\n std::vector<Pawn> column;\n for (int row = 0; row < _sizeMap; ++row) {\n column.push_back(pawnAt(row, j));\n }\n return column;\n}\n\nbool ModelTakuzu::isBBBorWWWpresentIn(std::vector<Pawn> vec)\n{\n static std::vector<Pawn> vecBBB = {Black, Black, Black};\n static std::vector<Pawn> vecWWW = {White, White, White};\n auto itB = std::search(vec.cbegin(), vec.cend(), vecBBB.cbegin(), vecBBB.cend());\n auto itW = std::search(vec.cbegin(), vec.cend(), vecWWW.cbegin(), vecWWW.cend());\n return (itB != vec.cend() || itW != vec.cend());\n}\n\nint ModelTakuzu::findFirstIdenticalRowTo(int i) const\n{\n std::vector<Pawn> rowToScan = getRow(i);\n for (int rowIndex = 0; rowIndex < _sizeMap;++rowIndex) {\n if (rowIndex != i) {\n if (std::equal(_currentGrid.cbegin() + rowIndex * _sizeMap,\n _currentGrid.cbegin() + (rowIndex + 1) * _sizeMap,\n rowToScan.cbegin())) {\n return rowIndex; \n }\n }\n }\n return _sizeMap; \n}\n\nint ModelTakuzu::findFirstIdenticalColTo(int j) const\n{\n std::vector<Pawn> colToScan = getCol(j);\n for (int colIndex = 0; colIndex < _sizeMap; ++colIndex) {\n if (colIndex != j) {\n std::vector<Pawn> otherCol = getCol(colIndex);\n if (std::equal(colToScan.begin(), colToScan.end(),\n otherCol.begin(), otherCol.end())) {\n return colIndex;\n }\n }\n }\n return _sizeMap;\n}\n\n"},"prefix":{"kind":"string","value":"#include \"ModelTakuzu.h\"\n#include <cassert>\n#include <iostream>\n#include <QtAlgorithms>\n#include <QFile>\n#include <QTextStream>\n\nModelTakuzu::ModelTakuzu()\n{\n _nbMaps = -1;\n _sizeMap = -1;\n _grids = nullptr;\n}\n\nModelTakuzu::~ModelTakuzu()\n{\n delete[] _grids;\n}\n\nPawn ModelTakuzu::permuteR(Pawn p)\n{\n if (p == Black) {\n return White;\n } else if (p == White) {\n return Empty;\n } else {\n return Black;\n }\n}\n\nPawn ModelTakuzu::permuteL(Pawn p)\n{\n if (p == Black) {\n return Empty;\n } else if (p == Empty) {\n return White;\n } else {\n return Black;\n }\n}\n\nvoid ModelTakuzu::loadFile(const QString &name)\n{\n QFile file(\":/resources/\"+name);\n if (!(file.open(QIODevice::ReadOnly | QIODevice::Text))) {\n std::cerr << \"Error while opening new file: \" << name.toStdString() << \" .\\n\";\n } else {\n QString line;\n QTextStream in(&file);\n\n \n bool ok = true;\n _nbMaps = in.readLine().toInt(&ok);\n if (!ok) {\n std::cerr << \"Issue when reading new line. \\n\"\\\n << \"Make sure the file has the same path as the executable.\\n\";\n }\n \n _grids = new Grid_[_nbMaps];\n for (int i = 0; i < _nbMaps; ++i) {\n _grids[i] = Grid_(_sizeMap * _sizeMap);\n }\n\n \n int i = 0;\n while (!in.atEnd()) {\n line = in.readLine();\n int letterIndex = 0;\n QChar letter;\n foreach(letter, line) {\n if (letterIndex < _sizeMap * _sizeMap) {\n _grids[i][letterIndex++] = ModelTakuzu::toPawn(letter);\n }\n }\n i++;\n }\n }\n}\n\nvoid ModelTakuzu::chooseMapPool(ModelTakuzu::Difficulty difficulty, int size)\n{\n QString name = QString::number(size);\n if (difficulty == Easy) {\n name.append(\"_easy.txt\");\n } else {\n name.append(\"_hard.txt\");\n }\n _difficulty = difficulty;\n _sizeMap = size;\n loadFile(QString(name));\n setRandomMap();\n emit notifyNumberMap(_difficulty, _sizeMap, _chosenMap, _nbMaps);\n}\n\nint ModelTakuzu::setMap(int chosenMap)\n{\n assert((_nbMaps != -1 || _sizeMap != -1) && \\\n \"Choose a map pool before using setRandomMap().\");\n _chosenMap = chosenMap;\n _currentGrid = _grids[chosenMap];\n _countPawn = {\n std::vector<int>(_sizeMap),\n std::vector<int>(_sizeMap),\n std::vector<int>(_sizeMap),\n std::vector<int>(_sizeMap)\n };\n for(int i = 0; i < _sizeMap; ++i) {\n for (int j = 0; j < _sizeMap; ++j) {\n emit notifyInitialPawn(i, j, _grids[chosenMap][i * _sizeMap + j]); \n }\n }\n initCount();\n return _chosenMap;\n}\n\nint ModelTakuzu::setRandomMap()\n{\n int randomGridIndex = (rand() % _nbMaps);\n _chosenMap = setMap(randomGridIndex);\n return randomGridIndex;\n}\n\nvoid ModelTakuzu::playAt(int i, int j, Pawn pawn)\n{\n assert((!_currentGrid.empty()) && \\\n \"Set a map using setRandomMap() before calling playAt().\");\n Pawn oldPawn = pawnAt(i, j);\n Pawn newPawn = pawn;\n updateCount(i, j, oldPawn, newPawn);\n pawnAt(i, j) = newPawn;\n positionIsValid(i, j);\n emit notifyNewPawn(i, j, pawn);\n}\n\nbool ModelTakuzu::positionIsValid(int i, int j)\n{\n const bool isVertical = true;\n const bool isOK = true;\n\n bool repetitionInRow = isBBBorWWWpresentIn(getRow(i));\n bool repetitionInCol = isBBBorWWWpresentIn(getCol(j));\n if (repetitionInRow) {\n emit notifyOverThreeAdjacentPawns(i, !isVertical, !isOK);\n } else {\n emit notifyOverThreeAdjacentPawns(i, !isVertical, isOK);\n }\n if (repetitionInCol) {\n emit notifyOverThreeAdjacentPawns(j, isVertical, !isOK);\n } else {\n emit notifyOverThreeAdjacentPawns(j, isVertical, isOK);\n }\n\n int oneOtherIdenticalRow = findFirstIdenticalRowTo(i);\n int oneOtherIdenticalCol = findFirstIdenticalColTo(j);\n static auto oneOtherIdenticalRowColIsFound = [this](int index) -> bool {\n return (index != _sizeMap);\n };\n if (oneOtherIdenticalRowColIsFound(oneOtherIdenticalRow)) {\n emit notifyCommonPatterns(i, oneOtherIdenticalRow, !isVertical, isOK);\n } else {\n emit notifyCommonPatterns(i, oneOtherIdenticalRow, !isVertical, !isOK);\n }\n if (oneOtherIdenticalRowColIsFound(oneOtherIdenticalCol)) {\n emit notifyCommonPatterns(j, oneOtherIdenticalCol, isVertical, isOK);\n } else {\n emit notifyCommonPatterns(j, oneOtherIdenticalCol, isVertical, !isOK);\n }\n\n return (!repetitionInRow &&\n !repetitionInCol &&\n (oneOtherIdenticalRow == _sizeMap) &&\n (oneOtherIdenticalCol == _sizeMap));\n}\n\nbool ModelTakuzu::rowIsValid(int i)\n{\n static auto forAll = [](bool tab[], int length) -> bool {\n for (int i = 0; i < length; ++i) {\n if (!tab[i]) return false;\n }\n return true;\n };\n bool tab[_sizeMap];\n for (int j = 0; j < _sizeMap; ++j) {\n tab[j] = positionIsValid(i, j);\n }\n return forAll(tab, _sizeMap) &&\n (_countPawn._Brow[i] == _countPawn._Wrow[i]);\n}\n\nbool ModelTakuzu::colIsValid(int j)\n{\n static auto forAll = [](bool tab[], int length) -> bool {\n for (int i = 0; i < length; ++i) {\n if (!tab[i]) return false;\n }\n return true;\n };\n bool tab[_sizeMap];\n for (int i = 0; i < _sizeMap; ++i) {\n tab[i] = positionIsValid(i, j);\n }\n return forAll(tab, _sizeMap) &&\n (_countPawn._Bcol[j] == _countPawn._Wcol[j]);\n}\n\nvoid ModelTakuzu::initCount()\n{\n for (int i = 0; i < _sizeMap; ++i) {\n for (int j = 0; j < _sizeMap; ++j) {\n updateCount(i, j, Empty, _grids[_chosenMap][i * _sizeMap + j]);\n }\n }\n}\n\nvoid ModelTakuzu::updateCount(int i, int j, Pawn oldPawn, Pawn newPawn)\n{\n if (oldPawn != newPawn) {\n switch (oldPawn) {\n case Black:\n _countPawn._Brow[i]--;\n _countPawn._Bcol[j]--;\n break;\n case White:\n _countPawn._Wrow[i]--;\n _countPawn._Wcol[j]--;\n break;\n case Empty:\n break;\n }\n switch (newPawn) {\n case Black:\n _countPawn._Brow[i]++;\n _countPawn._Bcol[j]++;\n break;\n case White:\n _countPawn._Wrow[i]++;\n _countPawn._Wcol[j]++;\n break;\n case Empty:\n break;\n }\n }\n emit notifyCount(i, j,\n _countPawn._Brow[i],\n _countPawn._Bcol[j],\n _countPawn._Wrow[i],\n _countPawn._Wcol[j]);\n}\n\nPawn ModelTakuzu::getPawn(int i, int j) const\n{\n return _currentGrid[i * _sizeMap + j];\n}\n\nbool ModelTakuzu::doFinalCheck()\n{\n std::vector<bool> isValid;\n for(int i = 0; i < _sizeMap; ++i) {\n for(int j = 0; j < _sizeMap; ++j) {\n isValid.push_back(positionIsValid(i, j));\n }\n }\n std::vector<std::vector<Pawn>> rowsAndCols;\n for (int i = 0; i < _sizeMap; ++i) {\n rowsAndCols.push_back(getRow(i));\n rowsAndCols.push_back(getCol(i));\n }\n\n std::vector<int> counterOcc;\n "},"suffix":{"kind":"string","value":";\n\n return (std::all_of(_currentGrid.begin(), _currentGrid.end(),\n [](Pawn p)->bool { return (p != Empty);}) &&\n std::all_of(isValid.begin(), isValid.end(), [](bool b)-> bool {return b;}) &&\n std::all_of(counterOcc.begin(), counterOcc.end(), [this](int v) -> bool {return (_sizeMap == 2 * v);}));\n}\n\nvoid ModelTakuzu::registerPlayAt(int i, int j)\n{\n Pawn nextPawn = permuteR(pawnAt(i, j));\n playAt(i, j, nextPawn);\n}\n\nvoid ModelTakuzu::registerChooseMapPool(ModelTakuzu::Difficulty difficulty, int size)\n{\n chooseMapPool(difficulty, size);\n}\n\nvoid ModelTakuzu::registerSizeMapPicked(ModelTakuzu::Difficulty difficulty, int size)\n{\n QString name = QString::number(size);\n if (difficulty == Easy) {\n name.append(\"_easy.txt\");\n } else {\n name.append(\"_hard.txt\");\n }\n _difficulty = difficulty;\n _sizeMap = size;\n loadFile(QString(name));\n emit notifyNbMaps(_nbMaps);\n}\n\nvoid ModelTakuzu::registerChooseMapPicked(int mapPicked)\n{\n _chosenMap = mapPicked;\n setMap(_chosenMap);\n emit notifyNumberMap(_difficulty, _sizeMap, _chosenMap, _nbMaps);\n}\n\nvoid ModelTakuzu::registerAttemptToEndGame()\n{\n bool win = doFinalCheck();\n emit notifyEndGame(win);\n}\n\nQChar ModelTakuzu::toQChar(Pawn pawn)\n{\n switch (pawn) {\n case Black: return QChar('B');\n case White: return QChar('W');\n case Empty: return QChar('.');\n default: return QChar('.');\n }\n}\n\nPawn ModelTakuzu::toPawn(QChar letter)\n{\n switch (letter.unicode()) {\n case 'B': return Black;\n case 'W': return White;\n case '.': return Empty;\n default: return Empty;\n }\n}\n\nPawn &ModelTakuzu::pawnAt(int i, int j)\n{\n assert(_chosenMap != -1 &&\n \"A map should be chosen before trying to access to _currentGrid.\");\n return _currentGrid[i * _sizeMap + j];\n}\n\nPawn ModelTakuzu::pawnAt(int i, int j) const\n{\n assert(_chosenMap != -1 &&\n \"A map should be chosen before trying to access to _currentGrid.\");\n return _currentGrid[i * _sizeMap + j];\n}\n\nstd::vector<Pawn> ModelTakuzu::getRow(int i) const\n{\n return std::vector<Pawn>(_currentGrid.begin() + i * _sizeMap,\n _currentGrid.begin() + (i + 1) * _sizeMap);\n}\n\nstd::vector<Pawn> ModelTakuzu::getCol(int j) const\n{\n std::vector<Pawn> column;\n for (int row = 0; row < _sizeMap; ++row) {\n column.push_back(pawnAt(row, j));\n }\n return column;\n}\n\nbool ModelTakuzu::isBBBorWWWpresentIn(std::vector<Pawn> vec)\n{\n static std::vector<Pawn> vecBBB = {Black, Black, Black};\n static std::vector<Pawn> vecWWW = {White, White, White};\n auto itB = std::search(vec.cbegin(), vec.cend(), vecBBB.cbegin(), vecBBB.cend());\n auto itW = std::search(vec.cbegin(), vec.cend(), vecWWW.cbegin(), vecWWW.cend());\n return (itB != vec.cend() || itW != vec.cend());\n}\n\nint ModelTakuzu::findFirstIdenticalRowTo(int i) const\n{\n std::vector<Pawn> rowToScan = getRow(i);\n for (int rowIndex = 0; rowIndex < _sizeMap;++rowIndex) {\n if (rowIndex != i) {\n if (std::equal(_currentGrid.cbegin() + rowIndex * _sizeMap,\n _currentGrid.cbegin() + (rowIndex + 1) * _sizeMap,\n rowToScan.cbegin())) {\n return rowIndex; \n }\n }\n }\n return _sizeMap; \n}\n\nint ModelTakuzu::findFirstIdenticalColTo(int j) const\n{\n std::vector<Pawn> colToScan = getCol(j);\n for (int colIndex = 0; colIndex < _sizeMap; ++colIndex) {\n if (colIndex != j) {\n std::vector<Pawn> otherCol = getCol(colIndex);\n if (std::equal(colToScan.begin(), colToScan.end(),\n otherCol.begin(), otherCol.end())) {\n return colIndex;\n }\n }\n }\n return _sizeMap;\n}\n\n"},"middle":{"kind":"string","value":"std::for_each(rowsAndCols.begin(), rowsAndCols.end(), [&counterOcc](std::vector<Pawn> &vec) -> void {\n counterOcc.push_back(std::count(vec.begin(), vec.end(), Black));\n counterOcc.push_back(std::count(vec.begin(), vec.end(), White));\n })"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"enum Pawn : unsigned char { Empty, Black, White};\n\nusing Grid_ = std::vector<Pawn>;\n\n\n","file_path":"ModelTakuzu.h","rank":0,"score":86767.76155417053},{"content":" void updateCount(int i, int j, Pawn oldPawn, Pawn newPawn);\n\n Pawn getPawn(int i, int j) const;\n\n bool doFinalCheck(); // no const because positionIsValid(int,int) no const\n\n\n\nsignals:\n\n void notifyNewPawn(int i, int j, Pawn newPawn);\n\n void notifyCount(int i, int j, int Brow, int Bcol, int Wrow, int Wcol);\n\n void notifyPositionIsValid(int i, int j, bool isValid);\n\n void notifyInitialPawn(int i, int j, Pawn readOnlyPawn);\n\n void notifyOverThreeAdjacentPawns(int index, bool isVertical, bool isOK); // \"!isVertical = isHorizontal\"\n\n void notifyCommonPatterns(int first, int second, bool isVertical, bool isOK);\n\n void notifyEndGame(bool win);\n\n void notifyNumberMap(ModelTakuzu::Difficulty difficulty, int sizeMap, int chosenMap, int nbMaps);\n\n void notifyNbMaps(int nbMaps);\n\npublic slots:\n\n void registerPlayAt(int i, int j);\n\n void registerChooseMapPool(ModelTakuzu::Difficulty difficulty, int size);\n\n void registerSizeMapPicked(ModelTakuzu::Difficulty difficulty, int size);\n\n void registerChooseMapPicked(int mapPicked);\n\n void registerAttemptToEndGame();\n","file_path":"ModelTakuzu.h","rank":6,"score":20.87064822446603},{"content":"\n\nvoid MainWindow::registerNewGamePicked()\n\n{\n\n QString size;\n\n ModelTakuzu::Difficulty difficulty;\n\n if (setGame(difficulty, size) == QMessageBox::Yes) {\n\n _ui->gridWidget->setRows(size.toInt());\n\n emit notifySizeMapPicked(difficulty, size.toInt());\n\n }\n\n}\n\n\n\nQMessageBox::StandardButton MainWindow::setGame(ModelTakuzu::Difficulty &difficulty, QString &size)\n\n{\n\n bool ok;\n\n QStringList sizes;\n\n sizes << \"6\" << \"8\" << \"10\";\n\n size = QInputDialog::getItem(this, \"Choose map size\", \"Size :\", sizes, 0, false, &ok);\n\n if (ok && !size.isEmpty()) {\n\n QStringList levels;\n\n levels << \"Easy\" << \"Hard\";\n","file_path":"MainWindow.cpp","rank":9,"score":18.952007009000894},{"content":"}\n\n\n\nvoid Grid::paintPawn(int row, int column, Pawn p) {\n\n QRect rect = _rects[row][column];\n\n int width = rect.width()/2-3;\n\n QPoint center(rect.center().x()+1.8, rect.center().y()+1.8);\n\n switch(p) {\n\n case Black:\n\n _painter->setBrush(Qt::black);\n\n _painter->drawEllipse(center, width, width);\n\n break;\n\n case White:\n\n _painter->setBrush(Qt::white);\n\n _painter->drawEllipse(center, width, width);\n\n break;\n\n case Empty:\n\n _painter->eraseRect(rect.x()+3, rect.y()+3, rect.width()-3, rect.height()-3);\n\n break;\n\n }\n\n // If initial pawns, the pawn is surrounded in blue\n","file_path":"Grid.cpp","rank":15,"score":17.291659462959835},{"content":" connect(_ui->actionShortcuts, SIGNAL(triggered()), this, SLOT(registerShortcutsPressed()));\n\n}\n\n\n\nMainWindow::~MainWindow()\n\n{\n\n delete _ui;\n\n delete _time;\n\n}\n\n\n\nvoid MainWindow::registerSetNewGame()\n\n{\n\n QString size;\n\n ModelTakuzu::Difficulty difficulty;\n\n if (setGame(difficulty, size) == QMessageBox::Yes) {\n\n _ui->gridWidget->setRows(size.toInt());\n\n emit notifyMapChosen(difficulty, size.toInt());\n\n startChrono();\n\n _ui->submitButton->setEnabled(true);\n\n }\n\n}\n","file_path":"MainWindow.cpp","rank":16,"score":17.11969036747967},{"content":"\n\nprivate: // methods\n\n void loadFile(const QString &name);\n\n static QChar toQChar(Pawn pawn);\n\n static Pawn toPawn(QChar letter);\n\n Pawn &pawnAt(int i, int j);\n\n Pawn pawnAt(int i, int j) const;\n\n std::vector<Pawn> getRow(int i) const;\n\n std::vector<Pawn> getCol(int j) const;\n\n static bool isBBBorWWWpresentIn(std::vector<Pawn> vec);\n\n int findFirstIdenticalRowTo(int i) const;\n\n int findFirstIdenticalColTo(int j) const;\n\n\n\nprivate: // attributes\n\n int _nbMaps;\n\n int _sizeMap;\n\n Difficulty _difficulty;\n\n Grid_ *_grids;\n\n int _chosenMap;\n\n Grid_ _currentGrid;\n","file_path":"ModelTakuzu.h","rank":17,"score":16.509531782716103},{"content":" QString level = QInputDialog::getItem(this, \"Choose difficulty level\", \"Level :\", levels, 0, false, &ok);\n\n difficulty = level==\"Easy\"?ModelTakuzu::Difficulty::Easy:ModelTakuzu::Difficulty::Hard;\n\n if (ok && !level.isEmpty()) {\n\n QMessageBox::StandardButton button;\n\n button = QMessageBox::question(this, \"Choices\",\n\n \"You have chosen a \"+size+\"x\"+size+\" grid with the difficulty '\"+level+\"'.\\n\"\n\n \"Are you sure ?\",\n\n QMessageBox::Yes | QMessageBox::No, QMessageBox::No);\n\n return button;\n\n }\n\n }\n\n}\n\n\n\nvoid MainWindow::registerPickMap(int nbMaps)\n\n{\n\n bool ok;\n\n QStringList maps;\n\n for (int i = 1; i <= nbMaps; i++) {\n\n maps << QString::number(i);\n\n }\n","file_path":"MainWindow.cpp","rank":18,"score":15.999713801770596},{"content":" void registerNewGamePicked();\n\n void registerPickMap(int nbMaps);\n\n void registerChronoChanged();\n\n void registerQuitPressed();\n\n void registerRulesPressed();\n\n void registerAboutPressed();\n\n void registerEndGame(bool win);\n\n void registerShortcutsPressed();\n\n void registerNumberMap(ModelTakuzu::Difficulty difficulty, int sizeMap, int chosenMap, int nbMaps);\n\n\n\nprivate:\n\n Ui::MainWindow* _ui;\n\n QTime* _time;\n\n QTimer* _chrono;\n\n\n\n QMessageBox::StandardButton setGame(ModelTakuzu::Difficulty &difficulty, QString &size);\n\n void startChrono();\n\n};\n\n\n\n#endif // MAINWINDOW_H*/\n","file_path":"MainWindow.h","rank":23,"score":14.061166003018428},{"content":" if (_initPawns[row*_rows+column]) {\n\n QPen penInit(Qt::blue);\n\n penInit.setWidth(3);\n\n _painter->setPen(penInit);\n\n _painter->drawEllipse(center, width, width);\n\n _painter->setPen(*_pen);\n\n }\n\n}\n\n\n\nvoid Grid::paintCount(bool isRow, int index, int black, int white)\n\n{\n\n QRect countAreaBlack;\n\n QRect countAreaWhite;\n\n if (isRow) {\n\n countAreaBlack = _rowCountArea[index*2];\n\n countAreaWhite = _rowCountArea[index*2+1];\n\n } else {\n\n countAreaBlack = _columnCountArea[index*2];\n\n countAreaWhite = _columnCountArea[index*2+1];\n\n }\n","file_path":"Grid.cpp","rank":24,"score":14.009984111766732},{"content":" repaint();\n\n}\n\n\n\nvoid Grid::registerOverThreeAdjacentPawns(int index, bool isVertical, bool isOk)\n\n{\n\n if (isVertical) {\n\n _invalidVertical[index] = !isOk;\n\n } else {\n\n _invalidHorizontal[index] = !isOk;\n\n }\n\n}\n\n\n\nvoid Grid::registerCommonPatterns(int first, int second, bool isVertical, bool isOK)\n\n{\n\n if (isVertical) {\n\n if (isOK) {\n\n _commonColumns[second*_rows+first] = isOK;\n\n _commonColumns[first*_rows+second] = isOK;\n\n } else {\n\n for (int i = 0; i < _rows; i++) {\n","file_path":"Grid.cpp","rank":25,"score":13.442872966134868},{"content":"#include \"PresenterTakuzu.h\"\n\n#include \"PlayCommand.h\"\n\n\n\nPresenterTakuzu::PresenterTakuzu(QObject *parent) : QObject(parent)\n\n{\n\n _model = new ModelTakuzu();\n\n _view = new MainWindow();\n\n _view->show();\n\n connect(_view, SIGNAL(notifyMapChosen(ModelTakuzu::Difficulty,int)), _model, SLOT(registerChooseMapPool(ModelTakuzu::Difficulty,int)));\n\n connect(_view, SIGNAL(notifySizeMapPicked(ModelTakuzu::Difficulty,int)), _model, SLOT(registerSizeMapPicked(ModelTakuzu::Difficulty,int)));\n\n connect(_model, SIGNAL(notifyNbMaps(int)), _view, SLOT(registerPickMap(int)));\n\n connect(_view, SIGNAL(notifMapPicked(int)), _model, SLOT(registerChooseMapPicked(int)));\n\n connect(_model, SIGNAL(notifyNumberMap(ModelTakuzu::Difficulty,int,int,int)), _view, SLOT(registerNumberMap(ModelTakuzu::Difficulty,int,int,int)));\n\n connect(_view->getGrid(), SIGNAL(notifyCoordinatesClicked(int,int)), _model, SLOT(registerPlayAt(int,int)));\n\n connect(_model, SIGNAL(notifyCount(int,int,int,int,int,int)), _view->getGrid(), SLOT(registerCount(int,int,int,int,int,int)));\n\n connect(_model, SIGNAL(notifyInitialPawn(int,int,Pawn)), _view->getGrid(), SLOT(registerInitialPawn(int,int,Pawn)));\n\n connect(_model, SIGNAL(notifyNewPawn(int,int,Pawn)), _view->getGrid(), SLOT(registerNewPawn(int,int,Pawn)));\n\n _undoStack = new QUndoStack(this);\n\n _undoStack->setUndoLimit(10);\n\n _view->getUndoButton()->setDefaultAction(_undoStack->createUndoAction(this, tr(\"&Undo\")));\n","file_path":"PresenterTakuzu.cpp","rank":26,"score":13.334162790176283},{"content":" QString mapPicked = QInputDialog::getItem(this, \"Choose one grid\", \"Grid number :\", maps, 0, false, &ok);\n\n if (ok && !mapPicked.isEmpty()) {\n\n emit notifMapPicked(mapPicked.toInt()-1);\n\n startChrono();\n\n _ui->submitButton->setEnabled(true);\n\n }\n\n}\n\n\n\nvoid MainWindow::startChrono()\n\n{\n\n _chrono = new QTimer(this);\n\n _chrono->start(1000);\n\n _time = new QTime;\n\n _time->start();\n\n connect(_chrono, SIGNAL(timeout()), this, SLOT(registerChronoChanged()));\n\n}\n\n\n\nvoid MainWindow::registerChronoChanged()\n\n{\n\n _ui->timeEdit->setTime(QTime(0,0).addMSecs(_time->elapsed()));\n","file_path":"MainWindow.cpp","rank":27,"score":13.2217442976837},{"content":" if (event->button() == Qt::LeftButton) {\n\n int x = (event->x()-_margin) / _widthRect;\n\n int y = event->y() / _widthRect;\n\n if (x < _rows && event->x()-_margin > 0) {\n\n if (y < _rows) {\n\n if (!_initPawns[x*_rows+y]) {\n\n emit notifyCoordinatesClicked(y,x);\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nvoid Grid::setRows(int rows)\n\n{\n\n _rows = rows;\n\n _rowCounts = new int[_rows*2]();\n\n _colCounts = new int[_rows*2]();\n\n _initPawns = new bool[_rows*_rows];\n\n _pawns = new Pawn[_rows*_rows];\n","file_path":"Grid.cpp","rank":29,"score":12.375313841914393},{"content":"{\n\n _rowCounts[i*2] = Brow;\n\n _rowCounts[i*2+1] = Wrow;\n\n _colCounts[j*2] = Bcol;\n\n _colCounts[j*2+1] = Wcol;\n\n repaint();\n\n}\n\n\n\nvoid Grid::registerInitialPawn(int i, int j, Pawn p)\n\n{\n\n if (p != Empty) {\n\n _initPawns[j*_rows+i] = true;\n\n }\n\n _pawns[j*_rows+i] = p;\n\n repaint();\n\n}\n\n\n\nvoid Grid::registerNewPawn(int i, int j, Pawn p)\n\n{\n\n _pawns[j*_rows+i] = p;\n","file_path":"Grid.cpp","rank":31,"score":11.966793557273151},{"content":" void registerOverThreeAdjacentPawns(int index, bool isVertical, bool isOk);\n\n void registerCommonPatterns(int first, int second, bool isVertical, bool isOK);\n\n\n\nprivate:\n\n int _rows = 0;\n\n int _widthRect;\n\n int _margin;\n\n QPen* _pen;\n\n QPainter* _painter;\n\n QRect** _rects;\n\n QRect* _rowCountArea;\n\n QRect* _columnCountArea;\n\n int* _rowCounts;\n\n int* _colCounts;\n\n bool* _initPawns;\n\n Pawn* _pawns;\n\n bool* _invalidVertical;\n\n bool* _invalidHorizontal;\n\n bool* _commonRows;\n\n bool* _commonColumns;\n\n};\n\n\n\n#endif // GRID_H\n","file_path":"Grid.h","rank":32,"score":11.931595113983484},{"content":"}\n\n\n\nvoid MainWindow::registerNumberMap(ModelTakuzu::Difficulty difficulty, int sizeMap, int chosenMap, int nbMaps)\n\n{\n\n _ui->mapLabel->setText(\"Grid : \" + QString::number(sizeMap)+ \"x\" + QString::number(sizeMap)\n\n + \" \" + QString(difficulty) + \" \"\n\n + QString::number(chosenMap+1) + \"/\" + QString::number(nbMaps));\n\n}\n\n\n\nvoid MainWindow::registerQuitPressed()\n\n{\n\n QMessageBox::StandardButton button;\n\n button = QMessageBox::question(this, \"You want to quit...\",\n\n \"Are you sure that you want to quit\"\n\n \" this application ?\",\n\n QMessageBox::Yes | QMessageBox::No, QMessageBox::No);\n\n if (button == QMessageBox::Yes) {\n\n close();\n\n }\n\n}\n","file_path":"MainWindow.cpp","rank":33,"score":11.796303724538369},{"content":" _invalidHorizontal = new bool[_rows];\n\n _invalidVertical = new bool[_rows];\n\n _commonRows = new bool[_rows*_rows];\n\n _commonColumns = new bool[_rows*_rows];\n\n\n\n for (int i = 0; i < _rows; i++) {\n\n _invalidHorizontal[i] = false;\n\n _invalidVertical[i] = false;\n\n for (int j = 0; j < _rows; j++) {\n\n _commonRows[i*_rows+j] = false;\n\n _commonColumns[i*_rows+j] = false;\n\n _initPawns[i*_rows+j] = false;\n\n _pawns[i*_rows+j] = Empty;\n\n }\n\n }\n\n\n\n repaint();\n\n}\n\n\n\nvoid Grid::registerCount(int i, int j, int Brow, int Bcol, int Wrow, int Wcol)\n","file_path":"Grid.cpp","rank":34,"score":11.437677377937561},{"content":"#include \"PlayCommand.h\"\n\n#include <assert.h>\n\n\n\nPlayCommand::PlayCommand(ModelTakuzu *m, int i, int j, Pawn p)\n\n{\n\n _model = m;\n\n assert(i >= 0 && \"Row index should be >= 0\");\n\n assert(j >= 0 && \"Col index should be >= 0\");\n\n _row = i;\n\n _col = j;\n\n _pawn = p;\n\n}\n\n\n\nPlayCommand::~PlayCommand()\n\n{\n\n\n\n}\n\n\n\nvoid PlayCommand::undo()\n\n{\n\n Pawn oldPawn = ModelTakuzu::permuteL(_pawn);\n\n _model->playAt(_row, _col, oldPawn);\n\n}\n\n\n\nvoid PlayCommand::redo()\n\n{\n\n _model->playAt(_row, _col, _pawn);\n\n}\n","file_path":"PlayCommand.cpp","rank":36,"score":10.147338298040584},{"content":" _view->getRedoButton()->setDefaultAction(_undoStack->createRedoAction(this, tr(\"&Redo\")));\n\n connect(_view->getGrid(), SIGNAL(notifyCoordinatesClicked(int, int)), this, SLOT(registerCommand(int, int)));\n\n connect(_model, SIGNAL(notifyOverThreeAdjacentPawns(int,bool,bool)), _view->getGrid(), SLOT(registerOverThreeAdjacentPawns(int,bool,bool)));\n\n connect(_model, SIGNAL(notifyCommonPatterns(int,int,bool,bool)), _view->getGrid(), SLOT(registerCommonPatterns(int,int,bool,bool)));\n\n connect(_view->getUndoButton(), SIGNAL(triggered(QAction*)), this, SLOT(registerUndoRedoTriggered()));\n\n connect(_view->getRedoButton(), SIGNAL(triggered(QAction*)), this, SLOT(registerUndoRedoTriggered()));\n\n connect(_view->getSubmitButton(), SIGNAL(clicked()), _model, SLOT(registerAttemptToEndGame()));\n\n connect(_model, SIGNAL(notifyEndGame(bool)), _view, SLOT(registerEndGame(bool)));\n\n}\n\n\n\nPresenterTakuzu::~PresenterTakuzu()\n\n{\n\n delete _model;\n\n}\n\n\n\nvoid PresenterTakuzu::registerCommand(int i, int j)\n\n{\n\n _undoStack->push(new PlayCommand(_model, i, j, _model->getPawn(i, j)));\n\n _view->getLabelNbUndo()->setText(\"Number of undo done : \"+QString::number(0));\n\n}\n\n\n\nvoid PresenterTakuzu::registerUndoRedoTriggered()\n\n{\n\n _view->getLabelNbUndo()->setText(\"Number of undo done : \"+QString::number(_undoStack->count()-_undoStack->index()));\n\n}\n\n\n","file_path":"PresenterTakuzu.cpp","rank":38,"score":9.680357061072735},{"content":"\n\nvoid MainWindow::registerRulesPressed()\n\n{\n\n QMessageBox::information(this, \"Rules of Takuzu\", \"To win the game, you must fill the grid with black and white pawns respecting three rules:\\n\\n\"\n\n \"-Same number of black and white pawns on each row and each column;\\n\"\n\n \"-No more than 2 pawns of the same color in a raw;\\n\"\n\n \"-2 rows or 2 columns must not be the same.\");\n\n}\n\n\n\nvoid MainWindow::registerAboutPressed()\n\n{\n\n QMessageBox::information(this, \"About this application\", \"Takuzu\\n\"\n\n \"(c) 2020 Christian Zheng and Quentin Derambure\");\n\n}\n\n\n\nvoid MainWindow::registerEndGame(bool winStatus)\n\n{\n\n if (winStatus) {\n\n _chrono->stop();\n\n QTime endTime = QTime(0,0).addMSecs(_time->elapsed());\n","file_path":"MainWindow.cpp","rank":39,"score":8.614771455463329},{"content":"#include \"Grid.h\"\n\n\n\nGrid::Grid(QWidget *parent) : QWidget(parent)\n\n{\n\n\n\n}\n\n\n\nvoid Grid::paintEvent(QPaintEvent *)\n\n{\n\n _painter = new QPainter(this);\n\n _pen = new QPen(Qt::black);\n\n _pen->setWidth(3);\n\n _painter->setPen(*_pen);\n\n\n\n int width = (QWidget::width()<QWidget::height())?QWidget::width():QWidget::height();\n\n _widthRect = width/(_rows+2);\n\n _margin = (QWidget::width()-width+2*_widthRect)/2;\n\n\n\n _rects = new QRect*[_rows];\n\n _rowCountArea = new QRect[_rows*2];\n","file_path":"Grid.cpp","rank":40,"score":8.499665599052825},{"content":"\n\n if (black == _rows/2 && white == _rows/2) {\n\n _painter->fillRect(countAreaBlack, Qt::green);\n\n _painter->fillRect(countAreaWhite, Qt::green);\n\n _painter->drawText(countAreaBlack, Qt::AlignCenter, \"O\");\n\n _painter->drawText(countAreaWhite, Qt::AlignCenter, \"K\");\n\n } else {\n\n _painter->fillRect(countAreaBlack, Qt::black);\n\n _painter->fillRect(countAreaWhite, Qt::white);\n\n QPen penWhite(Qt::white);\n\n penWhite.setWidth(3);\n\n _painter->setPen(penWhite);\n\n _painter->drawText(countAreaBlack, Qt::AlignCenter, QString::number(black));\n\n _painter->setPen(*_pen);\n\n _painter->drawText(countAreaWhite, Qt::AlignCenter, QString::number(white));\n\n }\n\n}\n\n\n\nvoid Grid::mousePressEvent(QMouseEvent* event)\n\n{\n","file_path":"Grid.cpp","rank":41,"score":8.236653281390847},{"content":"#include \"MainWindow.h\"\n\n#include \"ui_MainWindow.h\"\n\n#include <QGraphicsEffect>\n\n#include <QInputDialog>\n\n#include <QPropertyAnimation>\n\n#include <QTimer>\n\n\n\nMainWindow::MainWindow(QWidget *parent) :\n\n QMainWindow(parent),\n\n _ui(new Ui::MainWindow)\n\n{\n\n _ui->setupUi(this);\n\n\n\n _ui->submitButton->setEnabled(false);\n\n\n\n connect(_ui->newGame, SIGNAL(triggered()), this, SLOT(registerSetNewGame()));\n\n connect(_ui->newGamePicked, SIGNAL(triggered()), this, SLOT(registerNewGamePicked()));\n\n connect(_ui->actionQuit, SIGNAL(triggered()), this, SLOT(registerQuitPressed()));\n\n connect(_ui->actionRules, SIGNAL(triggered()), this, SLOT(registerRulesPressed()));\n\n connect(_ui->actionAbout, SIGNAL(triggered()), this, SLOT(registerAboutPressed()));\n","file_path":"MainWindow.cpp","rank":43,"score":6.402113165648233},{"content":"#include <QApplication>\n\n\n\n#include \"PresenterTakuzu.h\"\n\n\n\nint main(int argc, char *argv[])\n\n{\n\n srand((unsigned)time(0));\n\n QApplication a(argc, argv);\n\n PresenterTakuzu *presenter = new PresenterTakuzu();\n\n presenter = presenter;\n\n return a.exec();\n\n\n\n}\n","file_path":"main.cpp","rank":44,"score":6.2893227478539515},{"content":" if (_commonColumns[i*_rows+j]) {\n\n rect = _rects[i][0];\n\n _painter->drawRect(rect.x(), rect.y(), _widthRect, _rows*_widthRect);\n\n rect = _rects[j][0];\n\n _painter->drawRect(rect.x(), rect.y(), _widthRect, _rows*_widthRect);\n\n }\n\n }\n\n _painter->setPen(*_pen);\n\n }\n\n\n\n // Draws pawns and counts\n\n for (int i = 0; i < _rows; i++) {\n\n paintCount(true, i, _rowCounts[i*2], _rowCounts[i*2+1]);\n\n paintCount(false, i, _colCounts[i*2], _colCounts[i*2+1]);\n\n for (int j = 0; j < _rows; j++) {\n\n paintPawn(i, j, _pawns[i*_rows+j]);\n\n }\n\n }\n\n\n\n _painter->end();\n","file_path":"Grid.cpp","rank":45,"score":6.27242596781086},{"content":" QMessageBox::information(this, \"Victory !\", \"You won the game in \"\n\n + QString::number(endTime.minute()) + \" minutes and \"\n\n + QString::number(endTime.second()) + \" seconds !\");\n\n } else {\n\n _ui->incorrectLabel->setText(\"The grid is not correctly filled.\");\n\n QGraphicsOpacityEffect *effect = new QGraphicsOpacityEffect();\n\n _ui->incorrectLabel->setGraphicsEffect(effect);\n\n QPropertyAnimation *animation = new QPropertyAnimation(effect,\"opacity\");\n\n animation->setDuration(3000);\n\n animation->setStartValue(1.0);\n\n animation->setEndValue(0.0);\n\n animation->setEasingCurve(QEasingCurve::OutQuad);\n\n connect(animation, &QPropertyAnimation::finished, [=](){\n\n _ui->incorrectLabel->setText(\"\");\n\n });\n\n animation->start(QAbstractAnimation::DeleteWhenStopped);\n\n }\n\n}\n\n\n\nvoid MainWindow::registerShortcutsPressed()\n","file_path":"MainWindow.cpp","rank":46,"score":5.9779931217556115},{"content":"#ifndef MODELTAKUZU_H\n\n#define MODELTAKUZU_H\n\n\n\n#include <algorithm>\n\n#include <set>\n\n#include <string>\n\n#include <vector>\n\n#include <QObject>\n\n#include <QString>\n\n\n","file_path":"ModelTakuzu.h","rank":47,"score":5.418712404912995},{"content":" if (_commonColumns[i*_rows+first]) {\n\n _commonColumns[i*_rows+first] = isOK;\n\n }\n\n _commonColumns[first*_rows+i] = isOK;\n\n }\n\n }\n\n } else {\n\n if (isOK) {\n\n _commonRows[second*_rows+first] = isOK;\n\n _commonRows[first*_rows+second] = isOK;\n\n } else {\n\n for (int i = 0; i < _rows; i++) {\n\n if (_commonRows[i*_rows+first]) {\n\n _commonRows[i*_rows+first] = isOK;\n\n }\n\n _commonRows[first*_rows+i] = isOK;\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"Grid.cpp","rank":48,"score":4.432540251471329},{"content":" struct {\n\n std::vector<int> _Wrow;\n\n std::vector<int> _Brow;\n\n std::vector<int> _Wcol;\n\n std::vector<int> _Bcol;\n\n } _countPawn;\n\n};\n\n\n\n#endif // MODELTAKUZU_H\n","file_path":"ModelTakuzu.h","rank":49,"score":4.269919091211319},{"content":"{\n\n QMessageBox::information(this, \"Shortcuts\", \"New Random Game : CTRL + N\\n\"\n\n \"Pick One Grid : CTRL + P\\n\"\n\n \"Quit : CTRL + Q\\n\"\n\n \"Undo : CTRL + Z\\n\"\n\n \"Redo : CTRL + SHIFT + Z\\n\"\n\n \"Submit : Space\");\n\n}\n\n\n\nQWidget *MainWindow::getGrid() const\n\n{\n\n return _ui->gridWidget;\n\n}\n\n\n\nQToolButton *MainWindow::getRedoButton() const\n\n{\n\n return _ui->redoButton;\n\n}\n\n\n\nQToolButton *MainWindow::getUndoButton() const\n","file_path":"MainWindow.cpp","rank":50,"score":4.22835517290401},{"content":"# Takuzu board game - Qt GUI project\n\n_last edit: 10 April 2020_\n\n\n\n----\n\n__Authors__:\n\n- *Quentin DERAMBURE <quentin.derambure@ecole.ensicaen.fr>*\n\n- *Christian ZHENG <christian.zheng@ecole.ensicaen.fr>*\n\n\n\n## Description\n\n\n\nThis project is part of the practical work [Graphic interface design](http://livretpedagogique.ensicaen.fr/pages/afficherMatiere.php?s=1&m=0&u=73&mo=178&ma=253&) taught by Mr. Fourey at [ENSICAEN](https://www.ensicaen.fr/)(France).\n\n\n\nThe objective is to recreate the game of [Takuzu](https://en.wikipedia.org/wiki/Takuzu).\n\n\n\n## Implemented core features\n\n\n\n- [x] Choice of size and level of difficulty\n\n- [x] Indication of correct lines/columns\n\n- [x] Stopwatch indicating game time\n\n- [x] Highlighting of errors (more than three contiguous pawns of the same colour, identical rows/columns)\n\n- [x] Numerical indication of the number of cells of each colour on each row/column\n\n- [x] Counting the number of rewind made by the player\n\n- [ ] Customizing the display of checkbox states (other than by disks)\n\n- [ ] Different modes of assistance\n\n\n\n## Choices made regarding ergonomics\n\n\n\nSome useful keyboard shortcuts are implemented. A comprehensive list is accessible throught the interface.\n\nThe window is easily resizable, and the grid stays at the center.\n\n\n\n\n\n\n\n\n\n## Modeling choices\n\n\n\nFor the architecture of our software, we have proceeded to a three-thirds division, Model-View-Presentation, coupled with a design-pattern Command(management of undo/redo).\n\n\n\n\n\n\n\nMost of the communication between the classes of our software takes place with the system of Slots that pick up Signals, allowed by Qt.\n\n\n\n\n","file_path":"README.md","rank":51,"score":3.907435307413937},{"content":"#ifndef MAINWINDOW_H\n\n#define MAINWINDOW_H\n\n\n\n#include <QMainWindow>\n\n#include <QToolButton>\n\n#include <QLabel>\n\n#include <QPushButton>\n\n#include <ModelTakuzu.h>\n\n#include <QMessageBox>\n\n\n\nnamespace Ui {\n","file_path":"MainWindow.h","rank":52,"score":3.2937738010174327},{"content":"#ifndef GRID_H\n\n#define GRID_H\n\n\n\n#include <QWidget>\n\n#include <QPainter>\n\n#include <QMouseEvent>\n\n#include \"ModelTakuzu.h\"\n\n\n","file_path":"Grid.h","rank":53,"score":3.244338062850887},{"content":"#ifndef PRESENTERTAKUZU_H\n\n#define PRESENTERTAKUZU_H\n\n\n\n#include <QObject>\n\n#include <QUndoStack>\n\n\n\n#include \"ModelTakuzu.h\"\n\n#include \"MainWindow.h\"\n\n\n","file_path":"PresenterTakuzu.h","rank":54,"score":3.244338062850887},{"content":" _columnCountArea = new QRect[_rows*2];\n\n\n\n // Draws grid\n\n for (int i = 0; i < _rows; ++i) {\n\n _rects[i] = new QRect[_rows];\n\n for (int j = 0; j < _rows; ++j) {\n\n _rects[i][j] = QRect(i*_widthRect+_margin, j*_widthRect, _widthRect, _widthRect);\n\n _painter->drawRect(_rects[i][j]);\n\n }\n\n _rowCountArea[i*2] = QRect(_rows*_widthRect+_margin+5, i*_widthRect, _widthRect, _widthRect);\n\n _columnCountArea[i*2] = QRect(i*_widthRect+_margin, _rows*_widthRect+5, _widthRect, _widthRect);\n\n _rowCountArea[i*2+1] = QRect((_rows+1)*_widthRect+_margin+5, i*_widthRect, _widthRect, _widthRect);\n\n _columnCountArea[i*2+1] = QRect(i*_widthRect+_margin, (_rows+1)*_widthRect+5, _widthRect, _widthRect);\n\n }\n\n\n\n // Draws in red invalid rows and highlights common rows in orange\n\n QRect rect;\n\n for (int i = 0; i < _rows; i++) {\n\n if (_invalidHorizontal[i]) {\n\n for (int j = 0; j < _rows; j++) {\n","file_path":"Grid.cpp","rank":55,"score":3.0129583238315805},{"content":" rect = _rects[j][i];\n\n _painter->fillRect(rect.x()+3, rect.y()+3, rect.width()-3, rect.height()-3, QBrush(Qt::red));\n\n }\n\n }\n\n if (_invalidVertical[i]) {\n\n for (int j = 0; j < _rows; j++) {\n\n rect = _rects[i][j];\n\n _painter->fillRect(rect.x()+3, rect.y()+3, rect.width()-3, rect.height()-3, QBrush(Qt::red));\n\n }\n\n }\n\n QPen penOrange(QColor(\"#ffb000\"));\n\n penOrange.setWidth(3);\n\n _painter->setPen(penOrange);\n\n for (int j = 0; j < _rows; j++) {\n\n if (_commonRows[i*_rows+j]) {\n\n rect = _rects[0][i];\n\n _painter->drawRect(rect.x(), rect.y(), _rows*_widthRect, _widthRect);\n\n rect = _rects[0][j];\n\n _painter->drawRect(rect.x(), rect.y(), _rows*_widthRect, _widthRect);\n\n }\n","file_path":"Grid.cpp","rank":56,"score":2.9848185082476437},{"content":"#ifndef PLAYCOMMAND_H\n\n#define PLAYCOMMAND_H\n\n\n\n#include <QUndoCommand>\n\n#include \"ModelTakuzu.h\"\n\n\n","file_path":"PlayCommand.h","rank":57,"score":2.9434491058389725}],"string":"[\n {\n \"content\": \"enum Pawn : unsigned char { Empty, Black, White};\\n\\nusing Grid_ = std::vector<Pawn>;\\n\\n\\n\",\n \"file_path\": \"ModelTakuzu.h\",\n \"rank\": 0,\n \"score\": 86767.76155417053\n },\n {\n \"content\": \" void updateCount(int i, int j, Pawn oldPawn, Pawn newPawn);\\n\\n Pawn getPawn(int i, int j) const;\\n\\n bool doFinalCheck(); // no const because positionIsValid(int,int) no const\\n\\n\\n\\nsignals:\\n\\n void notifyNewPawn(int i, int j, Pawn newPawn);\\n\\n void notifyCount(int i, int j, int Brow, int Bcol, int Wrow, int Wcol);\\n\\n void notifyPositionIsValid(int i, int j, bool isValid);\\n\\n void notifyInitialPawn(int i, int j, Pawn readOnlyPawn);\\n\\n void notifyOverThreeAdjacentPawns(int index, bool isVertical, bool isOK); // \\\"!isVertical = isHorizontal\\\"\\n\\n void notifyCommonPatterns(int first, int second, bool isVertical, bool isOK);\\n\\n void notifyEndGame(bool win);\\n\\n void notifyNumberMap(ModelTakuzu::Difficulty difficulty, int sizeMap, int chosenMap, int nbMaps);\\n\\n void notifyNbMaps(int nbMaps);\\n\\npublic slots:\\n\\n void registerPlayAt(int i, int j);\\n\\n void registerChooseMapPool(ModelTakuzu::Difficulty difficulty, int size);\\n\\n void registerSizeMapPicked(ModelTakuzu::Difficulty difficulty, int size);\\n\\n void registerChooseMapPicked(int mapPicked);\\n\\n void registerAttemptToEndGame();\\n\",\n \"file_path\": \"ModelTakuzu.h\",\n \"rank\": 6,\n \"score\": 20.87064822446603\n },\n {\n \"content\": \"\\n\\nvoid MainWindow::registerNewGamePicked()\\n\\n{\\n\\n QString size;\\n\\n ModelTakuzu::Difficulty difficulty;\\n\\n if (setGame(difficulty, size) == QMessageBox::Yes) {\\n\\n _ui->gridWidget->setRows(size.toInt());\\n\\n emit notifySizeMapPicked(difficulty, size.toInt());\\n\\n }\\n\\n}\\n\\n\\n\\nQMessageBox::StandardButton MainWindow::setGame(ModelTakuzu::Difficulty &difficulty, QString &size)\\n\\n{\\n\\n bool ok;\\n\\n QStringList sizes;\\n\\n sizes << \\\"6\\\" << \\\"8\\\" << \\\"10\\\";\\n\\n size = QInputDialog::getItem(this, \\\"Choose map size\\\", \\\"Size :\\\", sizes, 0, false, &ok);\\n\\n if (ok && !size.isEmpty()) {\\n\\n QStringList levels;\\n\\n levels << \\\"Easy\\\" << \\\"Hard\\\";\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 9,\n \"score\": 18.952007009000894\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid Grid::paintPawn(int row, int column, Pawn p) {\\n\\n QRect rect = _rects[row][column];\\n\\n int width = rect.width()/2-3;\\n\\n QPoint center(rect.center().x()+1.8, rect.center().y()+1.8);\\n\\n switch(p) {\\n\\n case Black:\\n\\n _painter->setBrush(Qt::black);\\n\\n _painter->drawEllipse(center, width, width);\\n\\n break;\\n\\n case White:\\n\\n _painter->setBrush(Qt::white);\\n\\n _painter->drawEllipse(center, width, width);\\n\\n break;\\n\\n case Empty:\\n\\n _painter->eraseRect(rect.x()+3, rect.y()+3, rect.width()-3, rect.height()-3);\\n\\n break;\\n\\n }\\n\\n // If initial pawns, the pawn is surrounded in blue\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 15,\n \"score\": 17.291659462959835\n },\n {\n \"content\": \" connect(_ui->actionShortcuts, SIGNAL(triggered()), this, SLOT(registerShortcutsPressed()));\\n\\n}\\n\\n\\n\\nMainWindow::~MainWindow()\\n\\n{\\n\\n delete _ui;\\n\\n delete _time;\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerSetNewGame()\\n\\n{\\n\\n QString size;\\n\\n ModelTakuzu::Difficulty difficulty;\\n\\n if (setGame(difficulty, size) == QMessageBox::Yes) {\\n\\n _ui->gridWidget->setRows(size.toInt());\\n\\n emit notifyMapChosen(difficulty, size.toInt());\\n\\n startChrono();\\n\\n _ui->submitButton->setEnabled(true);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 16,\n \"score\": 17.11969036747967\n },\n {\n \"content\": \"\\n\\nprivate: // methods\\n\\n void loadFile(const QString &name);\\n\\n static QChar toQChar(Pawn pawn);\\n\\n static Pawn toPawn(QChar letter);\\n\\n Pawn &pawnAt(int i, int j);\\n\\n Pawn pawnAt(int i, int j) const;\\n\\n std::vector<Pawn> getRow(int i) const;\\n\\n std::vector<Pawn> getCol(int j) const;\\n\\n static bool isBBBorWWWpresentIn(std::vector<Pawn> vec);\\n\\n int findFirstIdenticalRowTo(int i) const;\\n\\n int findFirstIdenticalColTo(int j) const;\\n\\n\\n\\nprivate: // attributes\\n\\n int _nbMaps;\\n\\n int _sizeMap;\\n\\n Difficulty _difficulty;\\n\\n Grid_ *_grids;\\n\\n int _chosenMap;\\n\\n Grid_ _currentGrid;\\n\",\n \"file_path\": \"ModelTakuzu.h\",\n \"rank\": 17,\n \"score\": 16.509531782716103\n },\n {\n \"content\": \" QString level = QInputDialog::getItem(this, \\\"Choose difficulty level\\\", \\\"Level :\\\", levels, 0, false, &ok);\\n\\n difficulty = level==\\\"Easy\\\"?ModelTakuzu::Difficulty::Easy:ModelTakuzu::Difficulty::Hard;\\n\\n if (ok && !level.isEmpty()) {\\n\\n QMessageBox::StandardButton button;\\n\\n button = QMessageBox::question(this, \\\"Choices\\\",\\n\\n \\\"You have chosen a \\\"+size+\\\"x\\\"+size+\\\" grid with the difficulty '\\\"+level+\\\"'.\\\\n\\\"\\n\\n \\\"Are you sure ?\\\",\\n\\n QMessageBox::Yes | QMessageBox::No, QMessageBox::No);\\n\\n return button;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerPickMap(int nbMaps)\\n\\n{\\n\\n bool ok;\\n\\n QStringList maps;\\n\\n for (int i = 1; i <= nbMaps; i++) {\\n\\n maps << QString::number(i);\\n\\n }\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 18,\n \"score\": 15.999713801770596\n },\n {\n \"content\": \" void registerNewGamePicked();\\n\\n void registerPickMap(int nbMaps);\\n\\n void registerChronoChanged();\\n\\n void registerQuitPressed();\\n\\n void registerRulesPressed();\\n\\n void registerAboutPressed();\\n\\n void registerEndGame(bool win);\\n\\n void registerShortcutsPressed();\\n\\n void registerNumberMap(ModelTakuzu::Difficulty difficulty, int sizeMap, int chosenMap, int nbMaps);\\n\\n\\n\\nprivate:\\n\\n Ui::MainWindow* _ui;\\n\\n QTime* _time;\\n\\n QTimer* _chrono;\\n\\n\\n\\n QMessageBox::StandardButton setGame(ModelTakuzu::Difficulty &difficulty, QString &size);\\n\\n void startChrono();\\n\\n};\\n\\n\\n\\n#endif // MAINWINDOW_H*/\\n\",\n \"file_path\": \"MainWindow.h\",\n \"rank\": 23,\n \"score\": 14.061166003018428\n },\n {\n \"content\": \" if (_initPawns[row*_rows+column]) {\\n\\n QPen penInit(Qt::blue);\\n\\n penInit.setWidth(3);\\n\\n _painter->setPen(penInit);\\n\\n _painter->drawEllipse(center, width, width);\\n\\n _painter->setPen(*_pen);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Grid::paintCount(bool isRow, int index, int black, int white)\\n\\n{\\n\\n QRect countAreaBlack;\\n\\n QRect countAreaWhite;\\n\\n if (isRow) {\\n\\n countAreaBlack = _rowCountArea[index*2];\\n\\n countAreaWhite = _rowCountArea[index*2+1];\\n\\n } else {\\n\\n countAreaBlack = _columnCountArea[index*2];\\n\\n countAreaWhite = _columnCountArea[index*2+1];\\n\\n }\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 24,\n \"score\": 14.009984111766732\n },\n {\n \"content\": \" repaint();\\n\\n}\\n\\n\\n\\nvoid Grid::registerOverThreeAdjacentPawns(int index, bool isVertical, bool isOk)\\n\\n{\\n\\n if (isVertical) {\\n\\n _invalidVertical[index] = !isOk;\\n\\n } else {\\n\\n _invalidHorizontal[index] = !isOk;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Grid::registerCommonPatterns(int first, int second, bool isVertical, bool isOK)\\n\\n{\\n\\n if (isVertical) {\\n\\n if (isOK) {\\n\\n _commonColumns[second*_rows+first] = isOK;\\n\\n _commonColumns[first*_rows+second] = isOK;\\n\\n } else {\\n\\n for (int i = 0; i < _rows; i++) {\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 25,\n \"score\": 13.442872966134868\n },\n {\n \"content\": \"#include \\\"PresenterTakuzu.h\\\"\\n\\n#include \\\"PlayCommand.h\\\"\\n\\n\\n\\nPresenterTakuzu::PresenterTakuzu(QObject *parent) : QObject(parent)\\n\\n{\\n\\n _model = new ModelTakuzu();\\n\\n _view = new MainWindow();\\n\\n _view->show();\\n\\n connect(_view, SIGNAL(notifyMapChosen(ModelTakuzu::Difficulty,int)), _model, SLOT(registerChooseMapPool(ModelTakuzu::Difficulty,int)));\\n\\n connect(_view, SIGNAL(notifySizeMapPicked(ModelTakuzu::Difficulty,int)), _model, SLOT(registerSizeMapPicked(ModelTakuzu::Difficulty,int)));\\n\\n connect(_model, SIGNAL(notifyNbMaps(int)), _view, SLOT(registerPickMap(int)));\\n\\n connect(_view, SIGNAL(notifMapPicked(int)), _model, SLOT(registerChooseMapPicked(int)));\\n\\n connect(_model, SIGNAL(notifyNumberMap(ModelTakuzu::Difficulty,int,int,int)), _view, SLOT(registerNumberMap(ModelTakuzu::Difficulty,int,int,int)));\\n\\n connect(_view->getGrid(), SIGNAL(notifyCoordinatesClicked(int,int)), _model, SLOT(registerPlayAt(int,int)));\\n\\n connect(_model, SIGNAL(notifyCount(int,int,int,int,int,int)), _view->getGrid(), SLOT(registerCount(int,int,int,int,int,int)));\\n\\n connect(_model, SIGNAL(notifyInitialPawn(int,int,Pawn)), _view->getGrid(), SLOT(registerInitialPawn(int,int,Pawn)));\\n\\n connect(_model, SIGNAL(notifyNewPawn(int,int,Pawn)), _view->getGrid(), SLOT(registerNewPawn(int,int,Pawn)));\\n\\n _undoStack = new QUndoStack(this);\\n\\n _undoStack->setUndoLimit(10);\\n\\n _view->getUndoButton()->setDefaultAction(_undoStack->createUndoAction(this, tr(\\\"&Undo\\\")));\\n\",\n \"file_path\": \"PresenterTakuzu.cpp\",\n \"rank\": 26,\n \"score\": 13.334162790176283\n },\n {\n \"content\": \" QString mapPicked = QInputDialog::getItem(this, \\\"Choose one grid\\\", \\\"Grid number :\\\", maps, 0, false, &ok);\\n\\n if (ok && !mapPicked.isEmpty()) {\\n\\n emit notifMapPicked(mapPicked.toInt()-1);\\n\\n startChrono();\\n\\n _ui->submitButton->setEnabled(true);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid MainWindow::startChrono()\\n\\n{\\n\\n _chrono = new QTimer(this);\\n\\n _chrono->start(1000);\\n\\n _time = new QTime;\\n\\n _time->start();\\n\\n connect(_chrono, SIGNAL(timeout()), this, SLOT(registerChronoChanged()));\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerChronoChanged()\\n\\n{\\n\\n _ui->timeEdit->setTime(QTime(0,0).addMSecs(_time->elapsed()));\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 27,\n \"score\": 13.2217442976837\n },\n {\n \"content\": \" if (event->button() == Qt::LeftButton) {\\n\\n int x = (event->x()-_margin) / _widthRect;\\n\\n int y = event->y() / _widthRect;\\n\\n if (x < _rows && event->x()-_margin > 0) {\\n\\n if (y < _rows) {\\n\\n if (!_initPawns[x*_rows+y]) {\\n\\n emit notifyCoordinatesClicked(y,x);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Grid::setRows(int rows)\\n\\n{\\n\\n _rows = rows;\\n\\n _rowCounts = new int[_rows*2]();\\n\\n _colCounts = new int[_rows*2]();\\n\\n _initPawns = new bool[_rows*_rows];\\n\\n _pawns = new Pawn[_rows*_rows];\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 29,\n \"score\": 12.375313841914393\n },\n {\n \"content\": \"{\\n\\n _rowCounts[i*2] = Brow;\\n\\n _rowCounts[i*2+1] = Wrow;\\n\\n _colCounts[j*2] = Bcol;\\n\\n _colCounts[j*2+1] = Wcol;\\n\\n repaint();\\n\\n}\\n\\n\\n\\nvoid Grid::registerInitialPawn(int i, int j, Pawn p)\\n\\n{\\n\\n if (p != Empty) {\\n\\n _initPawns[j*_rows+i] = true;\\n\\n }\\n\\n _pawns[j*_rows+i] = p;\\n\\n repaint();\\n\\n}\\n\\n\\n\\nvoid Grid::registerNewPawn(int i, int j, Pawn p)\\n\\n{\\n\\n _pawns[j*_rows+i] = p;\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 31,\n \"score\": 11.966793557273151\n },\n {\n \"content\": \" void registerOverThreeAdjacentPawns(int index, bool isVertical, bool isOk);\\n\\n void registerCommonPatterns(int first, int second, bool isVertical, bool isOK);\\n\\n\\n\\nprivate:\\n\\n int _rows = 0;\\n\\n int _widthRect;\\n\\n int _margin;\\n\\n QPen* _pen;\\n\\n QPainter* _painter;\\n\\n QRect** _rects;\\n\\n QRect* _rowCountArea;\\n\\n QRect* _columnCountArea;\\n\\n int* _rowCounts;\\n\\n int* _colCounts;\\n\\n bool* _initPawns;\\n\\n Pawn* _pawns;\\n\\n bool* _invalidVertical;\\n\\n bool* _invalidHorizontal;\\n\\n bool* _commonRows;\\n\\n bool* _commonColumns;\\n\\n};\\n\\n\\n\\n#endif // GRID_H\\n\",\n \"file_path\": \"Grid.h\",\n \"rank\": 32,\n \"score\": 11.931595113983484\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid MainWindow::registerNumberMap(ModelTakuzu::Difficulty difficulty, int sizeMap, int chosenMap, int nbMaps)\\n\\n{\\n\\n _ui->mapLabel->setText(\\\"Grid : \\\" + QString::number(sizeMap)+ \\\"x\\\" + QString::number(sizeMap)\\n\\n + \\\" \\\" + QString(difficulty) + \\\" \\\"\\n\\n + QString::number(chosenMap+1) + \\\"/\\\" + QString::number(nbMaps));\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerQuitPressed()\\n\\n{\\n\\n QMessageBox::StandardButton button;\\n\\n button = QMessageBox::question(this, \\\"You want to quit...\\\",\\n\\n \\\"Are you sure that you want to quit\\\"\\n\\n \\\" this application ?\\\",\\n\\n QMessageBox::Yes | QMessageBox::No, QMessageBox::No);\\n\\n if (button == QMessageBox::Yes) {\\n\\n close();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 33,\n \"score\": 11.796303724538369\n },\n {\n \"content\": \" _invalidHorizontal = new bool[_rows];\\n\\n _invalidVertical = new bool[_rows];\\n\\n _commonRows = new bool[_rows*_rows];\\n\\n _commonColumns = new bool[_rows*_rows];\\n\\n\\n\\n for (int i = 0; i < _rows; i++) {\\n\\n _invalidHorizontal[i] = false;\\n\\n _invalidVertical[i] = false;\\n\\n for (int j = 0; j < _rows; j++) {\\n\\n _commonRows[i*_rows+j] = false;\\n\\n _commonColumns[i*_rows+j] = false;\\n\\n _initPawns[i*_rows+j] = false;\\n\\n _pawns[i*_rows+j] = Empty;\\n\\n }\\n\\n }\\n\\n\\n\\n repaint();\\n\\n}\\n\\n\\n\\nvoid Grid::registerCount(int i, int j, int Brow, int Bcol, int Wrow, int Wcol)\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 34,\n \"score\": 11.437677377937561\n },\n {\n \"content\": \"#include \\\"PlayCommand.h\\\"\\n\\n#include <assert.h>\\n\\n\\n\\nPlayCommand::PlayCommand(ModelTakuzu *m, int i, int j, Pawn p)\\n\\n{\\n\\n _model = m;\\n\\n assert(i >= 0 && \\\"Row index should be >= 0\\\");\\n\\n assert(j >= 0 && \\\"Col index should be >= 0\\\");\\n\\n _row = i;\\n\\n _col = j;\\n\\n _pawn = p;\\n\\n}\\n\\n\\n\\nPlayCommand::~PlayCommand()\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nvoid PlayCommand::undo()\\n\\n{\\n\\n Pawn oldPawn = ModelTakuzu::permuteL(_pawn);\\n\\n _model->playAt(_row, _col, oldPawn);\\n\\n}\\n\\n\\n\\nvoid PlayCommand::redo()\\n\\n{\\n\\n _model->playAt(_row, _col, _pawn);\\n\\n}\\n\",\n \"file_path\": \"PlayCommand.cpp\",\n \"rank\": 36,\n \"score\": 10.147338298040584\n },\n {\n \"content\": \" _view->getRedoButton()->setDefaultAction(_undoStack->createRedoAction(this, tr(\\\"&Redo\\\")));\\n\\n connect(_view->getGrid(), SIGNAL(notifyCoordinatesClicked(int, int)), this, SLOT(registerCommand(int, int)));\\n\\n connect(_model, SIGNAL(notifyOverThreeAdjacentPawns(int,bool,bool)), _view->getGrid(), SLOT(registerOverThreeAdjacentPawns(int,bool,bool)));\\n\\n connect(_model, SIGNAL(notifyCommonPatterns(int,int,bool,bool)), _view->getGrid(), SLOT(registerCommonPatterns(int,int,bool,bool)));\\n\\n connect(_view->getUndoButton(), SIGNAL(triggered(QAction*)), this, SLOT(registerUndoRedoTriggered()));\\n\\n connect(_view->getRedoButton(), SIGNAL(triggered(QAction*)), this, SLOT(registerUndoRedoTriggered()));\\n\\n connect(_view->getSubmitButton(), SIGNAL(clicked()), _model, SLOT(registerAttemptToEndGame()));\\n\\n connect(_model, SIGNAL(notifyEndGame(bool)), _view, SLOT(registerEndGame(bool)));\\n\\n}\\n\\n\\n\\nPresenterTakuzu::~PresenterTakuzu()\\n\\n{\\n\\n delete _model;\\n\\n}\\n\\n\\n\\nvoid PresenterTakuzu::registerCommand(int i, int j)\\n\\n{\\n\\n _undoStack->push(new PlayCommand(_model, i, j, _model->getPawn(i, j)));\\n\\n _view->getLabelNbUndo()->setText(\\\"Number of undo done : \\\"+QString::number(0));\\n\\n}\\n\\n\\n\\nvoid PresenterTakuzu::registerUndoRedoTriggered()\\n\\n{\\n\\n _view->getLabelNbUndo()->setText(\\\"Number of undo done : \\\"+QString::number(_undoStack->count()-_undoStack->index()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"PresenterTakuzu.cpp\",\n \"rank\": 38,\n \"score\": 9.680357061072735\n },\n {\n \"content\": \"\\n\\nvoid MainWindow::registerRulesPressed()\\n\\n{\\n\\n QMessageBox::information(this, \\\"Rules of Takuzu\\\", \\\"To win the game, you must fill the grid with black and white pawns respecting three rules:\\\\n\\\\n\\\"\\n\\n \\\"-Same number of black and white pawns on each row and each column;\\\\n\\\"\\n\\n \\\"-No more than 2 pawns of the same color in a raw;\\\\n\\\"\\n\\n \\\"-2 rows or 2 columns must not be the same.\\\");\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerAboutPressed()\\n\\n{\\n\\n QMessageBox::information(this, \\\"About this application\\\", \\\"Takuzu\\\\n\\\"\\n\\n \\\"(c) 2020 Christian Zheng and Quentin Derambure\\\");\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerEndGame(bool winStatus)\\n\\n{\\n\\n if (winStatus) {\\n\\n _chrono->stop();\\n\\n QTime endTime = QTime(0,0).addMSecs(_time->elapsed());\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 39,\n \"score\": 8.614771455463329\n },\n {\n \"content\": \"#include \\\"Grid.h\\\"\\n\\n\\n\\nGrid::Grid(QWidget *parent) : QWidget(parent)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nvoid Grid::paintEvent(QPaintEvent *)\\n\\n{\\n\\n _painter = new QPainter(this);\\n\\n _pen = new QPen(Qt::black);\\n\\n _pen->setWidth(3);\\n\\n _painter->setPen(*_pen);\\n\\n\\n\\n int width = (QWidget::width()<QWidget::height())?QWidget::width():QWidget::height();\\n\\n _widthRect = width/(_rows+2);\\n\\n _margin = (QWidget::width()-width+2*_widthRect)/2;\\n\\n\\n\\n _rects = new QRect*[_rows];\\n\\n _rowCountArea = new QRect[_rows*2];\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 40,\n \"score\": 8.499665599052825\n },\n {\n \"content\": \"\\n\\n if (black == _rows/2 && white == _rows/2) {\\n\\n _painter->fillRect(countAreaBlack, Qt::green);\\n\\n _painter->fillRect(countAreaWhite, Qt::green);\\n\\n _painter->drawText(countAreaBlack, Qt::AlignCenter, \\\"O\\\");\\n\\n _painter->drawText(countAreaWhite, Qt::AlignCenter, \\\"K\\\");\\n\\n } else {\\n\\n _painter->fillRect(countAreaBlack, Qt::black);\\n\\n _painter->fillRect(countAreaWhite, Qt::white);\\n\\n QPen penWhite(Qt::white);\\n\\n penWhite.setWidth(3);\\n\\n _painter->setPen(penWhite);\\n\\n _painter->drawText(countAreaBlack, Qt::AlignCenter, QString::number(black));\\n\\n _painter->setPen(*_pen);\\n\\n _painter->drawText(countAreaWhite, Qt::AlignCenter, QString::number(white));\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Grid::mousePressEvent(QMouseEvent* event)\\n\\n{\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 41,\n \"score\": 8.236653281390847\n },\n {\n \"content\": \"#include \\\"MainWindow.h\\\"\\n\\n#include \\\"ui_MainWindow.h\\\"\\n\\n#include <QGraphicsEffect>\\n\\n#include <QInputDialog>\\n\\n#include <QPropertyAnimation>\\n\\n#include <QTimer>\\n\\n\\n\\nMainWindow::MainWindow(QWidget *parent) :\\n\\n QMainWindow(parent),\\n\\n _ui(new Ui::MainWindow)\\n\\n{\\n\\n _ui->setupUi(this);\\n\\n\\n\\n _ui->submitButton->setEnabled(false);\\n\\n\\n\\n connect(_ui->newGame, SIGNAL(triggered()), this, SLOT(registerSetNewGame()));\\n\\n connect(_ui->newGamePicked, SIGNAL(triggered()), this, SLOT(registerNewGamePicked()));\\n\\n connect(_ui->actionQuit, SIGNAL(triggered()), this, SLOT(registerQuitPressed()));\\n\\n connect(_ui->actionRules, SIGNAL(triggered()), this, SLOT(registerRulesPressed()));\\n\\n connect(_ui->actionAbout, SIGNAL(triggered()), this, SLOT(registerAboutPressed()));\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 43,\n \"score\": 6.402113165648233\n },\n {\n \"content\": \"#include <QApplication>\\n\\n\\n\\n#include \\\"PresenterTakuzu.h\\\"\\n\\n\\n\\nint main(int argc, char *argv[])\\n\\n{\\n\\n srand((unsigned)time(0));\\n\\n QApplication a(argc, argv);\\n\\n PresenterTakuzu *presenter = new PresenterTakuzu();\\n\\n presenter = presenter;\\n\\n return a.exec();\\n\\n\\n\\n}\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 44,\n \"score\": 6.2893227478539515\n },\n {\n \"content\": \" if (_commonColumns[i*_rows+j]) {\\n\\n rect = _rects[i][0];\\n\\n _painter->drawRect(rect.x(), rect.y(), _widthRect, _rows*_widthRect);\\n\\n rect = _rects[j][0];\\n\\n _painter->drawRect(rect.x(), rect.y(), _widthRect, _rows*_widthRect);\\n\\n }\\n\\n }\\n\\n _painter->setPen(*_pen);\\n\\n }\\n\\n\\n\\n // Draws pawns and counts\\n\\n for (int i = 0; i < _rows; i++) {\\n\\n paintCount(true, i, _rowCounts[i*2], _rowCounts[i*2+1]);\\n\\n paintCount(false, i, _colCounts[i*2], _colCounts[i*2+1]);\\n\\n for (int j = 0; j < _rows; j++) {\\n\\n paintPawn(i, j, _pawns[i*_rows+j]);\\n\\n }\\n\\n }\\n\\n\\n\\n _painter->end();\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 45,\n \"score\": 6.27242596781086\n },\n {\n \"content\": \" QMessageBox::information(this, \\\"Victory !\\\", \\\"You won the game in \\\"\\n\\n + QString::number(endTime.minute()) + \\\" minutes and \\\"\\n\\n + QString::number(endTime.second()) + \\\" seconds !\\\");\\n\\n } else {\\n\\n _ui->incorrectLabel->setText(\\\"The grid is not correctly filled.\\\");\\n\\n QGraphicsOpacityEffect *effect = new QGraphicsOpacityEffect();\\n\\n _ui->incorrectLabel->setGraphicsEffect(effect);\\n\\n QPropertyAnimation *animation = new QPropertyAnimation(effect,\\\"opacity\\\");\\n\\n animation->setDuration(3000);\\n\\n animation->setStartValue(1.0);\\n\\n animation->setEndValue(0.0);\\n\\n animation->setEasingCurve(QEasingCurve::OutQuad);\\n\\n connect(animation, &QPropertyAnimation::finished, [=](){\\n\\n _ui->incorrectLabel->setText(\\\"\\\");\\n\\n });\\n\\n animation->start(QAbstractAnimation::DeleteWhenStopped);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid MainWindow::registerShortcutsPressed()\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 46,\n \"score\": 5.9779931217556115\n },\n {\n \"content\": \"#ifndef MODELTAKUZU_H\\n\\n#define MODELTAKUZU_H\\n\\n\\n\\n#include <algorithm>\\n\\n#include <set>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <QObject>\\n\\n#include <QString>\\n\\n\\n\",\n \"file_path\": \"ModelTakuzu.h\",\n \"rank\": 47,\n \"score\": 5.418712404912995\n },\n {\n \"content\": \" if (_commonColumns[i*_rows+first]) {\\n\\n _commonColumns[i*_rows+first] = isOK;\\n\\n }\\n\\n _commonColumns[first*_rows+i] = isOK;\\n\\n }\\n\\n }\\n\\n } else {\\n\\n if (isOK) {\\n\\n _commonRows[second*_rows+first] = isOK;\\n\\n _commonRows[first*_rows+second] = isOK;\\n\\n } else {\\n\\n for (int i = 0; i < _rows; i++) {\\n\\n if (_commonRows[i*_rows+first]) {\\n\\n _commonRows[i*_rows+first] = isOK;\\n\\n }\\n\\n _commonRows[first*_rows+i] = isOK;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 48,\n \"score\": 4.432540251471329\n },\n {\n \"content\": \" struct {\\n\\n std::vector<int> _Wrow;\\n\\n std::vector<int> _Brow;\\n\\n std::vector<int> _Wcol;\\n\\n std::vector<int> _Bcol;\\n\\n } _countPawn;\\n\\n};\\n\\n\\n\\n#endif // MODELTAKUZU_H\\n\",\n \"file_path\": \"ModelTakuzu.h\",\n \"rank\": 49,\n \"score\": 4.269919091211319\n },\n {\n \"content\": \"{\\n\\n QMessageBox::information(this, \\\"Shortcuts\\\", \\\"New Random Game : CTRL + N\\\\n\\\"\\n\\n \\\"Pick One Grid : CTRL + P\\\\n\\\"\\n\\n \\\"Quit : CTRL + Q\\\\n\\\"\\n\\n \\\"Undo : CTRL + Z\\\\n\\\"\\n\\n \\\"Redo : CTRL + SHIFT + Z\\\\n\\\"\\n\\n \\\"Submit : Space\\\");\\n\\n}\\n\\n\\n\\nQWidget *MainWindow::getGrid() const\\n\\n{\\n\\n return _ui->gridWidget;\\n\\n}\\n\\n\\n\\nQToolButton *MainWindow::getRedoButton() const\\n\\n{\\n\\n return _ui->redoButton;\\n\\n}\\n\\n\\n\\nQToolButton *MainWindow::getUndoButton() const\\n\",\n \"file_path\": \"MainWindow.cpp\",\n \"rank\": 50,\n \"score\": 4.22835517290401\n },\n {\n \"content\": \"# Takuzu board game - Qt GUI project\\n\\n_last edit: 10 April 2020_\\n\\n\\n\\n----\\n\\n__Authors__:\\n\\n- *Quentin DERAMBURE <quentin.derambure@ecole.ensicaen.fr>*\\n\\n- *Christian ZHENG <christian.zheng@ecole.ensicaen.fr>*\\n\\n\\n\\n## Description\\n\\n\\n\\nThis project is part of the practical work [Graphic interface design](http://livretpedagogique.ensicaen.fr/pages/afficherMatiere.php?s=1&m=0&u=73&mo=178&ma=253&) taught by Mr. Fourey at [ENSICAEN](https://www.ensicaen.fr/)(France).\\n\\n\\n\\nThe objective is to recreate the game of [Takuzu](https://en.wikipedia.org/wiki/Takuzu).\\n\\n\\n\\n## Implemented core features\\n\\n\\n\\n- [x] Choice of size and level of difficulty\\n\\n- [x] Indication of correct lines/columns\\n\\n- [x] Stopwatch indicating game time\\n\\n- [x] Highlighting of errors (more than three contiguous pawns of the same colour, identical rows/columns)\\n\\n- [x] Numerical indication of the number of cells of each colour on each row/column\\n\\n- [x] Counting the number of rewind made by the player\\n\\n- [ ] Customizing the display of checkbox states (other than by disks)\\n\\n- [ ] Different modes of assistance\\n\\n\\n\\n## Choices made regarding ergonomics\\n\\n\\n\\nSome useful keyboard shortcuts are implemented. A comprehensive list is accessible throught the interface.\\n\\nThe window is easily resizable, and the grid stays at the center.\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n## Modeling choices\\n\\n\\n\\nFor the architecture of our software, we have proceeded to a three-thirds division, Model-View-Presentation, coupled with a design-pattern Command(management of undo/redo).\\n\\n\\n\\n\\n\\n\\n\\nMost of the communication between the classes of our software takes place with the system of Slots that pick up Signals, allowed by Qt.\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 51,\n \"score\": 3.907435307413937\n },\n {\n \"content\": \"#ifndef MAINWINDOW_H\\n\\n#define MAINWINDOW_H\\n\\n\\n\\n#include <QMainWindow>\\n\\n#include <QToolButton>\\n\\n#include <QLabel>\\n\\n#include <QPushButton>\\n\\n#include <ModelTakuzu.h>\\n\\n#include <QMessageBox>\\n\\n\\n\\nnamespace Ui {\\n\",\n \"file_path\": \"MainWindow.h\",\n \"rank\": 52,\n \"score\": 3.2937738010174327\n },\n {\n \"content\": \"#ifndef GRID_H\\n\\n#define GRID_H\\n\\n\\n\\n#include <QWidget>\\n\\n#include <QPainter>\\n\\n#include <QMouseEvent>\\n\\n#include \\\"ModelTakuzu.h\\\"\\n\\n\\n\",\n \"file_path\": \"Grid.h\",\n \"rank\": 53,\n \"score\": 3.244338062850887\n },\n {\n \"content\": \"#ifndef PRESENTERTAKUZU_H\\n\\n#define PRESENTERTAKUZU_H\\n\\n\\n\\n#include <QObject>\\n\\n#include <QUndoStack>\\n\\n\\n\\n#include \\\"ModelTakuzu.h\\\"\\n\\n#include \\\"MainWindow.h\\\"\\n\\n\\n\",\n \"file_path\": \"PresenterTakuzu.h\",\n \"rank\": 54,\n \"score\": 3.244338062850887\n },\n {\n \"content\": \" _columnCountArea = new QRect[_rows*2];\\n\\n\\n\\n // Draws grid\\n\\n for (int i = 0; i < _rows; ++i) {\\n\\n _rects[i] = new QRect[_rows];\\n\\n for (int j = 0; j < _rows; ++j) {\\n\\n _rects[i][j] = QRect(i*_widthRect+_margin, j*_widthRect, _widthRect, _widthRect);\\n\\n _painter->drawRect(_rects[i][j]);\\n\\n }\\n\\n _rowCountArea[i*2] = QRect(_rows*_widthRect+_margin+5, i*_widthRect, _widthRect, _widthRect);\\n\\n _columnCountArea[i*2] = QRect(i*_widthRect+_margin, _rows*_widthRect+5, _widthRect, _widthRect);\\n\\n _rowCountArea[i*2+1] = QRect((_rows+1)*_widthRect+_margin+5, i*_widthRect, _widthRect, _widthRect);\\n\\n _columnCountArea[i*2+1] = QRect(i*_widthRect+_margin, (_rows+1)*_widthRect+5, _widthRect, _widthRect);\\n\\n }\\n\\n\\n\\n // Draws in red invalid rows and highlights common rows in orange\\n\\n QRect rect;\\n\\n for (int i = 0; i < _rows; i++) {\\n\\n if (_invalidHorizontal[i]) {\\n\\n for (int j = 0; j < _rows; j++) {\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 55,\n \"score\": 3.0129583238315805\n },\n {\n \"content\": \" rect = _rects[j][i];\\n\\n _painter->fillRect(rect.x()+3, rect.y()+3, rect.width()-3, rect.height()-3, QBrush(Qt::red));\\n\\n }\\n\\n }\\n\\n if (_invalidVertical[i]) {\\n\\n for (int j = 0; j < _rows; j++) {\\n\\n rect = _rects[i][j];\\n\\n _painter->fillRect(rect.x()+3, rect.y()+3, rect.width()-3, rect.height()-3, QBrush(Qt::red));\\n\\n }\\n\\n }\\n\\n QPen penOrange(QColor(\\\"#ffb000\\\"));\\n\\n penOrange.setWidth(3);\\n\\n _painter->setPen(penOrange);\\n\\n for (int j = 0; j < _rows; j++) {\\n\\n if (_commonRows[i*_rows+j]) {\\n\\n rect = _rects[0][i];\\n\\n _painter->drawRect(rect.x(), rect.y(), _rows*_widthRect, _widthRect);\\n\\n rect = _rects[0][j];\\n\\n _painter->drawRect(rect.x(), rect.y(), _rows*_widthRect, _widthRect);\\n\\n }\\n\",\n \"file_path\": \"Grid.cpp\",\n \"rank\": 56,\n \"score\": 2.9848185082476437\n },\n {\n \"content\": \"#ifndef PLAYCOMMAND_H\\n\\n#define PLAYCOMMAND_H\\n\\n\\n\\n#include <QUndoCommand>\\n\\n#include \\\"ModelTakuzu.h\\\"\\n\\n\\n\",\n \"file_path\": \"PlayCommand.h\",\n \"rank\": 57,\n \"score\": 2.9434491058389725\n }\n]","isConversational":false}}},{"rowIdx":97,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"hardware/interface/power/Power.cpp"},"repo_name":{"kind":"string","value":"aospwhatawurst/aosp_android_device_samsung_exynos9820-common"},"commit":{"kind":"string","value":"77fe612901d6133d2734619cd3d1e86f6e7f0200"},"file_code":{"kind":"string","value":"\n\n#define LOG_TAG \"power@1.0-exynos9820\"\n\n#include <android-base/logging.h>\n\n#include <android-base/file.h>\n#include <android-base/properties.h>\n#include <android-base/strings.h>\n\n#include \"Power.h\"\n#include <tsp.h>\n\n#include <iostream>\n\nnamespace android {\nnamespace hardware {\nnamespace power {\nnamespace V1_0 {\nnamespace implementation {\n\nusing ::android::hardware::power::V1_0::Feature;\nusing ::android::hardware::power::V1_0::PowerHint;\nusing ::android::hardware::power::V1_0::PowerStatePlatformSleepState;\nusing ::android::hardware::power::V1_0::Status;\nusing ::android::hardware::hidl_vec;\nusing ::android::hardware::Return;\nusing ::android::hardware::Void;\n\n#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))\n\nstatic std::string interactive_node_paths[] = {\n \"/sys/class/sec/tsp/input/enabled\",\n \"/sys/class/sec/tsp1/input/enabled\",\n \"/sys/class/sec/tsp2/input/enabled\",\n \"/sys/class/sec/sec_epen/input/enabled\",\n \"/sys/class/sec/sec_touchkey/input/enabled\",\n \"/sys/class/sec/sec_sidekey/input/enabled\",\n \"/sys/class/power_supply/battery/lcd\"\n};\n\ntemplate <typename T>\nstatic void writeNode(const std::string& path, const T& value)\n{\n std::ofstream node(path);\n if (!node) {\n PLOG(ERROR) << \"Failed to open: \" << path;\n return;\n }\n\n LOG(DEBUG) << \"writeNode node: \" << path << \" value: \" << value;\n\n node << value << std::endl;\n if (!node) {\n PLOG(ERROR) << \"Failed to write: \" << value;\n }\n}\n\nstatic bool doesNodeExist(const std::string& path)\n{\n std::ifstream f(path.c_str());\n if (f.good()) {\n LOG(DEBUG) << \"Found node: \" << path;\n }\n return f.good();\n}\n\nPower::Power() {\n size_t inode_size = ARRAY_SIZE(interactive_node_paths);\n\n \n\n mInteractionHandler.Init();\n mEpic.Init();\n tsp_init();\n\n LOG(DEBUG) << \"Looking for touchsceen/lcd nodes\";\n for (size_t i = 0; i < inode_size; i++) {\n std::string node_path = interactive_node_paths[i];\n\n if (doesNodeExist(node_path)) {\n mInteractiveNodes.push_back(node_path);\n }\n }\n}\n\nReturn<void> Power::setInteractive(bool interactive) {\n \n writeNode(\"/sys/devices/system/cpu/cpu0/cpufreq/scaling_max_freq\",\n interactive ? \"1950000\" : \"1053000\");\n\n \n if (mDoubleTapEnabled && !interactive) {\n tsp_enable_doubletap();\n }\n\n for (size_t i = 0; i < mInteractiveNodes.size(); i++) {\n writeNode(mInteractiveNodes[i], interactive ? \"1\" : \"0\");\n }\n\n \n if (mDoubleTapEnabled && interactive) {\n tsp_disable_doubletap();\n }\n\n return Void();\n}\n\nReturn<void> Power::powerHint(PowerHint hint, int32_t data __unused) {\n switch (hint) {\n#if 0\n \n case PowerHint::INTERACTION:\n mInteractionHandler.Acquire(data);\n break;\n#endif\n case PowerHint::VIDEO_ENCODE: {\n mEpic.videoEncode(hint);\n break;\n }\n default:\n return Void();\n }\n return Void();\n}\n\nReturn<void> Power::setFeature(Feature feature, bool activate)\n{\n switch (feature) {\n case Feature::POWER_FEATURE_DOUBLE_TAP_TO_WAKE:\n if (activate) {\n LOG(INFO) << \"Enable double tap to wake\";\n mDoubleTapEnabled = true;\n } else {\n LOG(INFO) << \"Disable double tap to wake\";\n mDoubleTapEnabled = false;\n }\n break;\n default:\n break;\n }\n\n return Void();\n}\n\nReturn<void> Power::getPlatformLowPowerStats(getPlatformLowPowerStats_cb _hidl_cb) {\n hidl_vec<PowerStatePlatformSleepState> states;\n _hidl_cb(states, Status::SUCCESS);\n return Void();\n}\n\n} \n} \n} \n} \n} \n"},"prefix":{"kind":"string","value":"\n\n#define LOG_TAG \"power@1.0-exynos9820\"\n\n#include <android-base/logging.h>\n\n#include <android-base/file.h>\n#include <android-base/properties.h>\n#include <android-base/strings.h>\n\n#include \"Power.h\"\n#include <tsp.h>\n\n#include <iostream>\n\nnamespace android {\nnamespace hardware {\nnamespace power {\nnamespace V1_0 {\nnamespace implementation {\n\nusing ::android::hardware::power::V1_0::Feature;\nusing ::android::hardware::power::V1_0::PowerHint;\nusing ::android::hardware::power::V1_0::PowerStatePlatformSleepState;\nusing ::android::hardware::power::V1_0::Status;\nusing ::android::hardware::hidl_vec;\nusing ::android::hardware::Return;\nusing ::android::hardware::Void;\n\n#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))\n\nstatic std::string interactive_node_paths[] = {\n \"/sys/class/sec/tsp/input/enabled\",\n \"/sys/class/sec/tsp1/input/enabled\",\n \"/sys/class/sec/tsp2/input/enabled\",\n \"/sys/class/sec/sec_epen/input/enabled\",\n \"/sys/class/sec/sec_touchkey/input/enabled\",\n \"/sys/class/sec/sec_sidekey/input/enabled\",\n \"/sys/class/power_supply/battery/lcd\"\n};\n\ntemplate <typename T>\nstatic void writeNode(const std::string& path, const T& value)\n{\n std::ofstream node(path);\n if (!node) {\n PLOG(ERROR) << \"Failed to open: \" << path;\n return;\n }\n\n LOG(DEBUG) << \"writeNode node: \" << path << \" value: \" << value;\n\n node << value << std::endl;\n if (!node) {\n PLOG(ERROR) << \"Failed to write: \" << value;\n }\n}\n\nstatic bool doesNodeExist(const std::string& path)\n{\n std::ifstream f(path.c_str());\n if (f.good()) {\n LOG(DEBUG) << \"Found node: \" << path;\n }\n return f.good();\n}\n\n"},"suffix":{"kind":"string","value":"\n\nReturn<void> Power::setInteractive(bool interactive) {\n \n writeNode(\"/sys/devices/system/cpu/cpu0/cpufreq/scaling_max_freq\",\n interactive ? \"1950000\" : \"1053000\");\n\n \n if (mDoubleTapEnabled && !interactive) {\n tsp_enable_doubletap();\n }\n\n for (size_t i = 0; i < mInteractiveNodes.size(); i++) {\n writeNode(mInteractiveNodes[i], interactive ? \"1\" : \"0\");\n }\n\n \n if (mDoubleTapEnabled && interactive) {\n tsp_disable_doubletap();\n }\n\n return Void();\n}\n\nReturn<void> Power::powerHint(PowerHint hint, int32_t data __unused) {\n switch (hint) {\n#if 0\n \n case PowerHint::INTERACTION:\n mInteractionHandler.Acquire(data);\n break;\n#endif\n case PowerHint::VIDEO_ENCODE: {\n mEpic.videoEncode(hint);\n break;\n }\n default:\n return Void();\n }\n return Void();\n}\n\nReturn<void> Power::setFeature(Feature feature, bool activate)\n{\n switch (feature) {\n case Feature::POWER_FEATURE_DOUBLE_TAP_TO_WAKE:\n if (activate) {\n LOG(INFO) << \"Enable double tap to wake\";\n mDoubleTapEnabled = true;\n } else {\n LOG(INFO) << \"Disable double tap to wake\";\n mDoubleTapEnabled = false;\n }\n break;\n default:\n break;\n }\n\n return Void();\n}\n\nReturn<void> Power::getPlatformLowPowerStats(getPlatformLowPowerStats_cb _hidl_cb) {\n hidl_vec<PowerStatePlatformSleepState> states;\n _hidl_cb(states, Status::SUCCESS);\n return Void();\n}\n\n} \n} \n} \n} \n} \n"},"middle":{"kind":"string","value":"Power::Power() {\n size_t inode_size = ARRAY_SIZE(interactive_node_paths);\n\n \n\n mInteractionHandler.Init();\n mEpic.Init();\n tsp_init();\n\n LOG(DEBUG) << \"Looking for touchsceen/lcd nodes\";\n for (size_t i = 0; i < inode_size; i++) {\n std::string node_path = interactive_node_paths[i];\n\n if (doesNodeExist(node_path)) {\n mInteractiveNodes.push_back(node_path);\n }\n }\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"namespace android {\n\nnamespace hardware {\n\nnamespace power {\n\nnamespace V1_0 {\n\nnamespace implementation {\n\n\n\nusing ::android::hardware::power::V1_0::Feature;\n\nusing ::android::hardware::power::V1_0::PowerHint;\n\nusing ::android::hardware::power::V1_0::IPower;\n\nusing ::android::hardware::Return;\n\nusing ::android::hardware::Void;\n\n\n\nstruct Power : public IPower {\n\n // Methods from ::android::hardware::power::V1_0::IPower follow.\n\n\n\n Power();\n\n\n\n Return<void> setInteractive(bool interactive) override;\n\n Return<void> powerHint(PowerHint hint, int32_t data) override;\n\n Return<void> setFeature(Feature feature, bool activate) override;\n\n Return<void> getPlatformLowPowerStats(getPlatformLowPowerStats_cb _hidl_cb) override;\n\n\n\n private:\n\n bool mDoubleTapEnabled;\n\n\n\n InteractionHandler mInteractionHandler;\n\n Epic mEpic;\n\n std::vector<std::string> mInteractiveNodes;\n\n};\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace power\n\n} // namespace hardware\n","file_path":"hardware/interface/power/Power.h","rank":0,"score":87571.69437301318},{"content":"namespace android {\n\nnamespace hardware {\n\nnamespace usb {\n\nnamespace V1_1 {\n\nnamespace implementation {\n\n\n\nusing ::android::hardware::usb::V1_0::PortRole;\n\nusing ::android::hardware::usb::V1_0::PortRoleType;\n\nusing ::android::hardware::usb::V1_0::PortDataRole;\n\nusing ::android::hardware::usb::V1_0::PortPowerRole;\n\nusing ::android::hardware::usb::V1_0::Status;\n\nusing ::android::hardware::usb::V1_1::IUsb;\n\nusing ::android::hardware::usb::V1_1::IUsbCallback;\n\nusing ::android::hardware::usb::V1_1::PortMode_1_1;\n\nusing ::android::hardware::usb::V1_1::PortStatus_1_1;\n\nusing ::android::hidl::base::V1_0::DebugInfo;\n\nusing ::android::hidl::base::V1_0::IBase;\n\nusing ::android::hardware::hidl_array;\n\nusing ::android::hardware::hidl_memory;\n\nusing ::android::hardware::hidl_string;\n\nusing ::android::hardware::hidl_vec;\n\nusing ::android::hardware::Return;\n\nusing ::android::hardware::Void;\n\nusing ::android::sp;\n\n\n\nstruct Usb : public IUsb {\n\n Usb();\n\n\n\n Return<void> switchRole(const hidl_string& portName, const PortRole& role) override;\n\n Return<void> setCallback(const sp<V1_0::IUsbCallback>& callback) override;\n\n Return<void> queryPortStatus() override;\n\n\n\n\n\n sp<V1_0::IUsbCallback> mCallback_1_0;\n\n // Protects mCallback variable\n\n pthread_mutex_t mLock;\n\n // Protects roleSwitch operation\n\n pthread_mutex_t mRoleSwitchLock;\n\n // Threads waiting for the partner to come back wait here\n\n pthread_cond_t mPartnerCV;\n\n // lock protecting mPartnerCV\n\n pthread_mutex_t mPartnerLock;\n\n // Variable to signal partner coming back online after type switch\n\n bool mPartnerUp;\n\n\n\n private:\n\n pthread_t mPoll;\n\n};\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace usb\n\n} // namespace hardware\n","file_path":"hardware/interface/usb/Usb.h","rank":1,"score":58523.600119122064},{"content":"namespace android {\n\nnamespace hardware {\n\nnamespace sensors {\n\nnamespace V1_0 {\n\nnamespace implementation {\n\n\n\n\n\nstruct Sensors : public ::android::hardware::sensors::V1_0::ISensors {\n\n Sensors();\n\n\n\n status_t initCheck() const;\n\n\n\n Return<void> getSensorsList(getSensorsList_cb _hidl_cb) override;\n\n\n\n Return<Result> setOperationMode(OperationMode mode) override;\n\n\n\n Return<Result> activate(\n\n int32_t sensor_handle, bool enabled) override;\n\n\n\n Return<void> poll(int32_t maxCount, poll_cb _hidl_cb) override;\n\n\n\n Return<Result> batch(\n\n int32_t sensor_handle,\n\n int64_t sampling_period_ns,\n\n int64_t max_report_latency_ns) override;\n\n\n\n Return<Result> flush(int32_t sensor_handle) override;\n\n\n\n Return<Result> injectSensorData(const Event& event) override;\n\n\n\n Return<void> registerDirectChannel(\n\n const SharedMemInfo& mem, registerDirectChannel_cb _hidl_cb) override;\n\n\n\n Return<Result> unregisterDirectChannel(int32_t channelHandle) override;\n\n\n\n Return<void> configDirectReport(\n\n int32_t sensorHandle, int32_t channelHandle, RateLevel rate,\n\n configDirectReport_cb _hidl_cb) override;\n\n\n\nprivate:\n\n static constexpr int32_t kPollMaxBufferSize = 128;\n\n status_t mInitCheck;\n\n sensors_module_t *mSensorModule;\n\n sensors_poll_device_1_t *mSensorDevice;\n\n std::mutex mPollLock;\n\n\n\n int getHalDeviceVersion() const;\n\n\n\n static void convertFromSensorEvents(\n\n size_t count, const sensors_event_t *src, hidl_vec<Event> *dst);\n\n\n\n DISALLOW_COPY_AND_ASSIGN(Sensors);\n\n};\n\n\n\nextern \"C\" ISensors *HIDL_FETCH_ISensors(const char *name);\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace sensors\n\n} // namespace hardware\n","file_path":"hardware/interface/sensors/Sensors.h","rank":2,"score":58523.600119122064},{"content":" void (*_epic_release)(void);\n","file_path":"hardware/interface/power/Epic.h","rank":3,"score":53776.525640143336},{"content":"#define TSP_PATH \"/sys/class/sec/tsp/\"\n\n\n","file_path":"hardware/libtsp/tsp.c","rank":4,"score":53629.19093586313},{"content":"static void sysfs_write(const char *path, char *s)\n\n{\n\n char errno_str[64];\n\n int len;\n\n int fd;\n\n\n\n fd = open(path, O_WRONLY);\n\n if (fd < 0) {\n\n strerror_r(errno, errno_str, sizeof(errno_str));\n\n ALOGE(\"Error opening %s: %s\", path, errno_str);\n\n return;\n\n }\n\n\n\n len = write(fd, s, strlen(s));\n\n if (len < 0) {\n\n strerror_r(errno, errno_str, sizeof(errno_str));\n\n ALOGE(\"Error writing to %s: %s\", path, errno_str);\n\n }\n\n\n\n close(fd);\n","file_path":"hardware/libtsp/tsp.c","rank":5,"score":53629.19093586313},{"content":"#ifndef EPIC_H\n\n#define EPIC_H\n\n\n\n#include <android/hardware/power/1.0/IPower.h>\n\n\n\nusing ::android::hardware::power::V1_0::PowerHint;\n\n\n\nstruct Epic {\n\n bool Init(void);\n\n void videoEncode(PowerHint hint);\n\n\n\n private:\n\n void *(*_epic_alloc_request)(uint32_t hint);\n\n void (*_epic_free_request)(void);\n\n void (*_epic_acquire)(void *request);\n\n void (*_epic_release)(void);\n\n\n\n bool mEpicAvailable;\n\n};\n\n\n","file_path":"hardware/interface/power/Epic.h","rank":6,"score":52120.11100860382},{"content":" bool Init(void);\n","file_path":"hardware/interface/power/Epic.h","rank":7,"score":52115.406786481435},{"content":" std::condition_variable mCond;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":8,"score":52115.406786481435},{"content":"#define CMD_STATE_FAIL \"FAIL\"\n\n\n","file_path":"hardware/libtsp/tsp.c","rank":9,"score":52022.260104230285},{"content":"#define LOG_TAG \"libtsp\"\n\n\n","file_path":"hardware/libtsp/tsp.c","rank":10,"score":50721.46875728568},{"content":" void Routine();\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":11,"score":50553.834580992836},{"content":" bool mHandled;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":12,"score":50553.834580992836},{"content":" void videoEncode(PowerHint hint);\n","file_path":"hardware/interface/power/Epic.h","rank":13,"score":50553.834580992836},{"content":" void Exit();\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":14,"score":50553.834580992836},{"content":" void Acquire(int32_t duration);\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":15,"score":50553.834580992836},{"content":" bool Init();\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":16,"score":50553.834580992836},{"content":" enum interaction_state mState;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":17,"score":50553.834580992836},{"content":" bool mEpicAvailable;\n","file_path":"hardware/interface/power/Epic.h","rank":18,"score":50553.834580992836},{"content":"#ifndef INTERACTIONHANDLER_H\n\n#define INTERACTIONHANDLER_H\n\n\n\n#include <condition_variable>\n\n#include <mutex>\n\n#include <thread>\n\n\n\nenum interaction_state {\n\n INTERACTION_STATE_UNINITIALIZED,\n\n INTERACTION_STATE_IDLE,\n\n INTERACTION_STATE_INTERACTION,\n\n};\n\n\n\nstruct InteractionHandler {\n\n InteractionHandler();\n\n ~InteractionHandler();\n\n bool Init();\n\n void Exit();\n\n void Acquire(int32_t duration);\n\n\n\n private:\n\n void Release();\n\n void Routine();\n\n\n\n void PerfLock();\n\n void PerfRel();\n\n\n\n long long CalcTimespecDiffMs(struct timespec start, struct timespec end);\n\n\n\n enum interaction_state mState;\n\n\n\n int32_t mMinDurationMs;\n\n int32_t mMaxDurationMs;\n\n int32_t mDurationMs;\n\n\n\n struct timespec mLastTimespec;\n\n\n\n bool mHandled;\n\n\n\n std::unique_ptr<std::thread> mThread;\n\n std::mutex mLock;\n\n std::condition_variable mCond;\n\n};\n\n\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":27,"score":49088.352302784},{"content":" void PerfRel();\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":28,"score":49083.120981884436},{"content":" struct timespec mLastTimespec;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":29,"score":49083.120981884436},{"content":" int32_t mDurationMs;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":30,"score":49083.120981884436},{"content":" void PerfLock();\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":31,"score":49083.120981884436},{"content":" int32_t mMinDurationMs;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":32,"score":47695.560377516675},{"content":" int32_t mMaxDurationMs;\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":33,"score":47695.560377516675},{"content":" long long CalcTimespecDiffMs(struct timespec start, struct timespec end);\n","file_path":"hardware/interface/power/InteractionHandler.h","rank":34,"score":46384.29453954723},{"content":"/*\n\n * Copyright (C) 2018-2020 The LineageOS Project\n\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\n\n * SPDX-License-Identifier: Apache-2.0\n\n */\n\n\n\n#define LOG_TAG \"power@1.0-exynos9820\"\n\n//#define LOG_NDEBUG 0\n\n\n\n#include <android-base/logging.h>\n\n#include <android-base/file.h>\n\n#include <cutils/properties.h>\n\n\n\n#include <dlfcn.h>\n\n\n\n#include \"Epic.h\"\n\n\n\nusing ::android::hardware::power::V1_0::PowerHint;\n\n\n\nbool Epic::Init(void)\n","file_path":"hardware/interface/power/Epic.cpp","rank":35,"score":42139.844459037755},{"content":"/*\n\n * Copyright (C) 2018-2020 The LineageOS Project\n\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\n\n * SPDX-License-Identifier: Apache-2.0\n\n */\n\n\n\n#define LOG_TAG \"power@1.0-exynos9820\"\n\n\n\n#include <android-base/logging.h>\n\n\n\n#include <hidl/HidlTransportSupport.h>\n\n#include <hardware/power.h>\n\n#include \"Power.h\"\n\n\n\nusing android::sp;\n\nusing android::status_t;\n\nusing android::OK;\n\n\n\n// libhwbinder:\n\nusing android::hardware::configureRpcThreadpool;\n","file_path":"hardware/interface/power/service.cpp","rank":36,"score":42139.003725448434},{"content":"using android::hardware::joinRpcThreadpool;\n\n\n\n// Generated HIDL files\n\nusing android::hardware::power::V1_0::IPower;\n\nusing android::hardware::power::V1_0::implementation::Power;\n\n\n\nint main() {\n\n\n\n status_t status;\n\n android::sp<IPower> service = nullptr;\n\n\n\n LOG(INFO) << \"Power HAL Service 1.0 for exynos9820 is starting.\";\n\n\n\n service = new Power();\n\n if (service == nullptr) {\n\n ALOGE(\"Can not create an instance of Power HAL Iface, exiting.\");\n\n\n\n goto shutdown;\n\n }\n\n\n","file_path":"hardware/interface/power/service.cpp","rank":37,"score":42138.12501845911},{"content":" }\n\n\n\n LOG(INFO) << \"Epic is ready\";\n\n\n\n mEpicAvailable = true;\n\n return true;\n\n}\n\n\n\nvoid Epic::videoEncode(PowerHint hint)\n\n{\n\n int preview;\n\n void *request = NULL;\n\n\n\n if (!mEpicAvailable) {\n\n return;\n\n }\n\n\n\n request = _epic_alloc_request((uint32_t)hint);\n\n\n\n preview = property_get_int32(\"persist.vendor.sys.camera.preview\", 0);\n\n if (preview != 2) {\n\n _epic_acquire(request);\n\n }\n\n}\n","file_path":"hardware/interface/power/Epic.cpp","rank":38,"score":42128.391892867294},{"content":"{\n\n void *handle = NULL;\n\n\n\n handle = dlopen(\"libepic_helper.so\", RTLD_NOW);\n\n if (handle == nullptr) {\n\n LOG(ERROR) << \"Failed to load libepic_helper.so\";\n\n return false;\n\n }\n\n\n\n _epic_alloc_request = reinterpret_cast<typeof(_epic_alloc_request)>(dlsym(handle, \"epic_alloc_request\"));\n\n _epic_free_request = reinterpret_cast<typeof(_epic_free_request)>(dlsym(handle, \"epic_free_request\"));\n\n _epic_acquire = reinterpret_cast<typeof(_epic_acquire)>(dlsym(handle, \"epic_acquire\"));\n\n _epic_release = reinterpret_cast<typeof(_epic_release)>(dlsym(handle, \"epic_release\"));\n\n\n\n if (_epic_alloc_request == nullptr ||\n\n _epic_free_request == nullptr ||\n\n _epic_acquire == nullptr ||\n\n _epic_release == nullptr) {\n\n LOG(ERROR) << \"Failed to bind symbols from libepic_helper.so\";\n\n return false;\n","file_path":"hardware/interface/power/Epic.cpp","rank":39,"score":42127.171159888894},{"content":" configureRpcThreadpool(1, true /*callerWillJoin*/);\n\n\n\n status = service->registerAsService();\n\n if (status != OK) {\n\n ALOGE(\"Could not register service for Power HAL Iface (%d).\", status);\n\n goto shutdown;\n\n }\n\n\n\n LOG(INFO) << \"Power Service is ready\";\n\n joinRpcThreadpool();\n\n //Should not pass this line\n\n\n\nshutdown:\n\n // In normal operation, we don't expect the thread pool to exit\n\n\n\n LOG(ERROR) << \"Power Service is shutting down\";\n\n return 1;\n\n}\n","file_path":"hardware/interface/power/service.cpp","rank":40,"score":42127.0194558676},{"content":"/*\n\n * Copyright (C) 2018-2020 The LineageOS Project\n\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\n\n * SPDX-License-Identifier: Apache-2.0\n\n */\n\n\n\n#define LOG_TAG \"power@1.0-exynos9820\"\n\n//#define LOG_NDEBUG 0\n\n\n\n#include <android-base/logging.h>\n\n#include <android-base/file.h>\n\n\n\n#include <fcntl.h>\n\n#include <poll.h>\n\n#include <time.h>\n\n#include <unistd.h>\n\n\n\n#include \"InteractionHandler.h\"\n\n\n\n#define MSINSEC 1000L\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":41,"score":40471.84481658367},{"content":"#define USINMS 1000000L\n\n\n\nusing android::base::WriteStringToFile;\n\n\n\nInteractionHandler::InteractionHandler()\n\n : mState(INTERACTION_STATE_UNINITIALIZED),\n\n mMinDurationMs(1400),\n\n mMaxDurationMs(5650),\n\n mDurationMs(0)\n\n{\n\n}\n\n\n\nInteractionHandler::~InteractionHandler()\n\n{\n\n Exit();\n\n}\n\n\n\nbool InteractionHandler::Init()\n\n{\n\n std::lock_guard<std::mutex> lk(mLock);\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":42,"score":40471.30197819652},{"content":" mCond.notify_all();\n\n mThread->join();\n\n}\n\n\n\nvoid InteractionHandler::PerfLock()\n\n{\n\n LOG(VERBOSE) << \"Acquiring perf lock\";\n\n WriteStringToFile(\"1378000\", \"/sys/power/cpufreq_min_limit\", false);\n\n}\n\n\n\nvoid InteractionHandler::PerfRel()\n\n{\n\n LOG(VERBOSE) << \"Releasing perf lock\";\n\n WriteStringToFile(\"520000\", \"/sys/power/cpufreq_min_limit\", false);\n\n}\n\n\n\nlong long InteractionHandler::CalcTimespecDiffMs(struct timespec start,\n\n struct timespec end)\n\n{\n\n long long diff_in_us = 0;\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":43,"score":40470.77099400912},{"content":" mState = INTERACTION_STATE_INTERACTION;\n\n }\n\n\n\n mHandled = false;\n\n mCond.notify_one();\n\n}\n\n\n\nvoid InteractionHandler::Release()\n\n{\n\n std::lock_guard<std::mutex> lk(mLock);\n\n PerfRel();\n\n mState = INTERACTION_STATE_IDLE;\n\n}\n\n\n\nvoid InteractionHandler::Routine()\n\n{\n\n std::unique_lock<std::mutex> lk(mLock, std::defer_lock);\n\n\n\n while (true) {\n\n lk.lock();\n\n mCond.wait(lk, [&] { return mState == INTERACTION_STATE_INTERACTION; });\n\n mHandled = true;\n\n lk.unlock();\n\n\n\n std::this_thread::sleep_for(std::chrono::milliseconds(mDurationMs));\n\n if (mHandled) Release();\n\n }\n\n}\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":44,"score":40466.00441121062},{"content":"\n\n if (mState != INTERACTION_STATE_UNINITIALIZED)\n\n return true;\n\n\n\n mState = INTERACTION_STATE_IDLE;\n\n mThread = std::unique_ptr<std::thread>(\n\n new std::thread(&InteractionHandler::Routine, this));\n\n\n\n return true;\n\n}\n\n\n\nvoid InteractionHandler::Exit()\n\n{\n\n std::unique_lock<std::mutex> lk(mLock);\n\n if (mState == INTERACTION_STATE_UNINITIALIZED)\n\n return;\n\n\n\n mState = INTERACTION_STATE_UNINITIALIZED;\n\n lk.unlock();\n\n\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":45,"score":40465.621255438404},{"content":" diff_in_us += (end.tv_sec - start.tv_sec) * MSINSEC;\n\n diff_in_us += (end.tv_nsec - start.tv_nsec) / USINMS;\n\n return diff_in_us;\n\n}\n\n\n\nvoid InteractionHandler::Acquire(int32_t duration)\n\n{\n\n std::lock_guard<std::mutex> lk(mLock);\n\n if (mState == INTERACTION_STATE_UNINITIALIZED) {\n\n LOG(WARNING) << \"Called while uninitialized\";\n\n return;\n\n }\n\n\n\n int inputDuration = duration + 650;\n\n int finalDuration;\n\n if (inputDuration > mMaxDurationMs)\n\n finalDuration = mMaxDurationMs;\n\n else if (inputDuration > mMinDurationMs)\n\n finalDuration = inputDuration;\n\n else\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":46,"score":40465.284698585056},{"content":" finalDuration = mMinDurationMs;\n\n\n\n struct timespec cur_timespec;\n\n clock_gettime(CLOCK_MONOTONIC, &cur_timespec);\n\n if (mState != INTERACTION_STATE_IDLE && finalDuration <= mDurationMs) {\n\n long long elapsed_time = CalcTimespecDiffMs(mLastTimespec, cur_timespec);\n\n // don't hint if previous hint's duration covers this hint's duration\n\n if (elapsed_time <= (mDurationMs - finalDuration)) {\n\n LOG(VERBOSE) << \"Previous duration (\" << mDurationMs << \") \"\n\n << \"cover this (\" << finalDuration << \") elapsed: \" << elapsed_time;\n\n return;\n\n }\n\n }\n\n mLastTimespec = cur_timespec;\n\n mDurationMs = finalDuration;\n\n\n\n LOG(VERBOSE) << \"input: \" << duration << \" final duration: \" << finalDuration;\n\n\n\n if (mState == INTERACTION_STATE_IDLE) {\n\n PerfLock();\n","file_path":"hardware/interface/power/InteractionHandler.cpp","rank":47,"score":40463.90063584359},{"content":"bool tsp_init(void)\n\n{\n\n double_tap_supported = check_tsp_has_cmd(TSP_CMD_DT2W_CTL);\n\n\n\n return true;\n","file_path":"hardware/libtsp/tsp.c","rank":48,"score":31250.496984040434},{"content":"static int sysfs_read(char *path, char *s, int num_bytes)\n\n{\n\n char errno_str[64];\n\n int len;\n\n int ret = 0;\n\n int fd;\n\n\n\n fd = open(path, O_RDONLY);\n\n if (fd < 0) {\n\n strerror_r(errno, errno_str, sizeof(errno_str));\n\n ALOGE(\"Error opening %s: %s\", path, errno_str);\n\n\n\n return -1;\n\n }\n\n\n\n len = read(fd, s, num_bytes - 1);\n\n if (len < 0) {\n\n strerror_r(errno, errno_str, sizeof(errno_str));\n\n ALOGE(\"Error reading from %s: %s\", path, errno_str);\n\n\n\n ret = -1;\n\n } else {\n\n // do not store newlines, but terminate the string instead\n\n if (s[len-1] == '\\n') {\n\n s[len-1] = '\\0';\n\n } else {\n\n s[len] = '\\0';\n\n }\n\n }\n\n\n\n close(fd);\n\n\n\n return ret;\n","file_path":"hardware/libtsp/tsp.c","rank":49,"score":31250.496984040434},{"content":"bool tsp_disable_doubletap(void)\n\n{\n\n return tsp_set_doubletap(false);\n","file_path":"hardware/libtsp/tsp.c","rank":50,"score":30314.115393507756},{"content":"#define CMD_STATE_LEN 16\n","file_path":"hardware/libtsp/tsp.c","rank":51,"score":30314.115393507756},{"content":"static bool check_tsp_has_cmd(const char *cmd)\n\n{\n\n char *line = NULL;\n\n size_t len = 0;\n\n ssize_t nread;\n\n bool found = false;\n\n FILE *fp = NULL;\n\n\n\n fp = fopen(TSP_PATH TSP_CMD_LIST_FILE, \"r\");\n\n if (fp == NULL) {\n\n ALOGE(\"Failed to open TSP command list: %s\", strerror(errno));\n\n return false;\n\n }\n\n\n\n while ((nread = getline(&line, &len, fp)) != -1) {\n\n if (strncmp(line, cmd, strlen(cmd)) == 0) {\n\n ALOGI(\"tsp has cmd: %s\", cmd);\n\n found = true;\n\n break;\n\n }\n\n }\n\n\n\n if (!found)\n\n ALOGI(\"tsp doesn't ahve cmd: %s\", cmd);\n\n\n\n free(line);\n\n fclose(fp);\n\n return found;\n","file_path":"hardware/libtsp/tsp.c","rank":52,"score":30314.115393507756},{"content":"char *tsp_get_result(void)\n\n{\n\n char inbuf[TSP_CMD_RES_LEN];\n\n char *res;\n\n char *retbuf;\n\n\n\n if (sysfs_read(TSP_PATH TSP_CMD_RES_FILE, inbuf, TSP_CMD_RES_LEN) < 0) {\n\n ALOGI(\"tsp get result failed\");\n\n return NULL;\n\n }\n\n\n\n ALOGI(\"Got result: %s\", inbuf);\n\n\n\n if ((res = strstr(inbuf, \":\")) == NULL) {\n\n ALOGI(\"no strstr\");\n\n return NULL;\n\n }\n\n\n\n retbuf = calloc(strlen(res)+1, sizeof(char));\n\n if (retbuf == NULL)\n\n return NULL;\n\n\n\n strcpy(retbuf, res+1);\n\n\n\n ALOGD(\"res: %s\", retbuf);\n\n\n\n return retbuf;\n","file_path":"hardware/libtsp/tsp.c","rank":53,"score":30314.115393507756},{"content":"#define TSP_CMD_LEN 64\n","file_path":"hardware/libtsp/tsp.c","rank":54,"score":30314.115393507756},{"content":"#define CMD_STATE_WAITING \"WAITING\"\n","file_path":"hardware/libtsp/tsp.c","rank":55,"score":30314.115393507756},{"content":"static bool tsp_set_doubletap(bool state)\n\n{\n\n char buf[TSP_CMD_LEN] = {0};\n\n bool ok;\n\n\n\n if (!double_tap_supported) {\n\n return false;\n\n }\n\n\n\n /* set DT2W en/disable */\n\n snprintf(buf, TSP_CMD_LEN, \"%s,%d\", TSP_CMD_DT2W_CTL, !!state);\n\n\n\n ALOGI(\"%s\", buf);\n\n\n\n sysfs_write(TSP_PATH TSP_CMD_EXEC_FILE, buf);\n\n ok = tsp_wait_for_cmd(TSP_CMD_DT2W_CTL);\n\n if (!ok) {\n\n return false;\n\n }\n\n\n\n ALOGV(\"dt2w %s\", state ? \"enabled\" : \"disabled\");\n\n\n\n return true;\n","file_path":"hardware/libtsp/tsp.c","rank":56,"score":30314.115393507756},{"content":"#define CMD_STATE_RUNNING \"RUNNING\"\n","file_path":"hardware/libtsp/tsp.c","rank":57,"score":30314.115393507756},{"content":"static bool tsp_wait_for_cmd(const char *cmd)\n\n{\n\n char buf[CMD_STATE_LEN];\n\n int count = 0;\n\n\n\n while (count++ < 10) {\n\n if (sysfs_read(TSP_PATH TSP_CMD_STATE_FILE, buf, CMD_STATE_LEN) < 0) {\n\n ALOGE(\"%s: sysfs read failed\", cmd);\n\n return false;\n\n }\n\n\n\n ALOGI(\"state: %s - want %s\", buf, CMD_STATE_OK);\n\n /* TSP enters \"ok\" state once command result is ready to be read */\n\n if (!strncmp(buf, CMD_STATE_OK, strlen(CMD_STATE_OK)))\n\n return true;\n\n /* some commands skip the OK state and go straight to waiting. */\n\n if (!strncmp(buf, CMD_STATE_WAITING, strlen(CMD_STATE_WAITING)))\n\n return true;\n\n\n\n usleep(100);\n\n }\n\n\n\n ALOGE(\"%s: TSP timeout expired!\", cmd);\n\n /* FIXME: if the TSP ends up in a weird state,\n\n * we should read the result file to cause it to\n\n * exit the state */\n\n return false;\n","file_path":"hardware/libtsp/tsp.c","rank":58,"score":30314.115393507756},{"content":"bool tsp_enable_doubletap(void)\n\n{\n\n return tsp_set_doubletap(true);\n","file_path":"hardware/libtsp/tsp.c","rank":59,"score":30314.115393507756},{"content":"#define CMD_STATE_OK \"OK\"\n","file_path":"hardware/libtsp/tsp.c","rank":60,"score":30314.115393507756},{"content":"#define CMD_STATE_NA \"NOT_APPLICABLE\"\n","file_path":"hardware/libtsp/tsp.c","rank":61,"score":30314.115393507756},{"content":"static bool double_tap_supported;\n","file_path":"hardware/libtsp/tsp.c","rank":62,"score":30314.115393507756},{"content":"#define TSP_CMD_RES_LEN ((TSP_CMD_LEN)+8)\n\n\n","file_path":"hardware/libtsp/tsp.c","rank":63,"score":29432.216282912184},{"content":"#define TSP_CMD_STATE_FILE \"cmd_status\"\n\n\n","file_path":"hardware/libtsp/tsp.c","rank":64,"score":29432.216282912184},{"content":"#define TSP_CMD_LIST_FILE \"cmd_list\"\n","file_path":"hardware/libtsp/tsp.c","rank":65,"score":29432.216282912184},{"content":"#define TSP_CMD_EXEC_FILE \"cmd\"\n","file_path":"hardware/libtsp/tsp.c","rank":66,"score":29432.216282912184},{"content":"#define TSP_CMD_DT2W_CTL \"aot_enable\"\n\n\n","file_path":"hardware/libtsp/tsp.c","rank":67,"score":29432.216282912184},{"content":"#define TSP_CMD_RES_FILE \"cmd_result\"\n","file_path":"hardware/libtsp/tsp.c","rank":68,"score":29432.216282912184},{"content":"#!/bin/env python3\n\n#\n\n# Copyright (C) 2009 The Android Open Source Project\n\n# Copyright (C) 2019 The Mokee Open Source Project\n\n# Copyright (C) 2019-2020 The LineageOS Open Source Project\n\n#\n\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n\n# you may not use this file except in compliance with the License.\n\n# You may obtain a copy of the License at\n\n#\n\n# http://www.apache.org/licenses/LICENSE-2.0\n\n#\n\n# Unless required by applicable law or agreed to in writing, software\n\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n# See the License for the specific language governing permissions and\n\n# limitations under the License.\n\n\n\nimport common\n\nimport re\n\n\n\ndef FullOTA_InstallEnd(info):\n\n OTA_InstallEnd(info)\n\n return\n\n\n\ndef IncrementalOTA_InstallEnd(info):\n\n OTA_InstallEnd(info)\n\n return\n\n\n\ndef AddImage(info, basename, dest):\n\n name = basename\n\n data = info.input_zip.read(\"IMAGES/\" + basename)\n\n common.ZipWriteStr(info.output_zip, name, data)\n\n info.script.AppendExtra('package_extract_file(\"%s\", \"%s\");' % (name, dest))\n\n\n\ndef OTA_InstallEnd(info):\n\n info.script.Print(\"Patching firmware images...\")\n\n AddImage(info, \"dtbo.img\", \"/dev/block/by-name/dtbo\")\n\n return\n","file_path":"releasetools/releasetools.py","rank":69,"score":21744.137156175075},{"content":"def AddImage(info, basename, dest):\n\n name = basename\n\n data = info.input_zip.read(\"IMAGES/\" + basename)\n\n common.ZipWriteStr(info.output_zip, name, data)\n","file_path":"releasetools/releasetools.py","rank":70,"score":20400.81511159248},{"content":"def OTA_InstallEnd(info):\n\n info.script.Print(\"Patching firmware images...\")\n\n AddImage(info, \"dtbo.img\", \"/dev/block/by-name/dtbo\")\n","file_path":"releasetools/releasetools.py","rank":71,"score":19789.53050667526},{"content":"def FullOTA_InstallEnd(info):\n\n OTA_InstallEnd(info)\n","file_path":"releasetools/releasetools.py","rank":72,"score":19213.812920118915},{"content":"def IncrementalOTA_InstallEnd(info):\n\n OTA_InstallEnd(info)\n","file_path":"releasetools/releasetools.py","rank":73,"score":19213.812920118915},{"content":"# LineageOS platform tree for the Samsung Exynos 9820\n","file_path":"README.md","rank":74,"score":17671.512482920247},{"content":" static uint32_t effectToMs(Effect effect, Status* status);\n\n\n\n bool mIsTimedOutVibriator;\n\n};\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace vibrator\n\n} // namespace hardware\n\n} // namespace android\n\n\n\n#endif // ANDROID_HARDWARE_VIBRATOR_V1_0_VIBRATOR_H\n","file_path":"hardware/interface/vibrator/Vibrator.h","rank":75,"score":15043.6356416965},{"content":"#include <android/hardware/vibrator/1.0/IVibrator.h>\n\n#include <hidl/Status.h>\n\n\n\n#include <fstream>\n\n\n\nnamespace android {\n\nnamespace hardware {\n\nnamespace vibrator {\n\nnamespace V1_0 {\n\nnamespace implementation {\n\n\n","file_path":"hardware/interface/vibrator/Vibrator.h","rank":76,"score":15043.536429374419},{"content":"/*\n\n * Copyright (C) 2019-2020 The LineageOS Project\n\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\n\n *\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#ifndef ANDROID_HARDWARE_VIBRATOR_V1_0_VIBRATOR_H\n\n#define ANDROID_HARDWARE_VIBRATOR_V1_0_VIBRATOR_H\n\n\n","file_path":"hardware/interface/vibrator/Vibrator.h","rank":77,"score":15034.194989078456},{"content":"#define VIBRATOR_INTENSITY_PATH \"/sys/class/timed_output/vibrator/intensity\"\n\n\n\nnamespace android {\n\nnamespace hardware {\n\nnamespace vibrator {\n\nnamespace V1_0 {\n\nnamespace implementation {\n\n\n\n/*\n\n * Write value to path and close file.\n\n */\n\ntemplate <typename T>\n\nstatic Return<Status> writeNode(const std::string& path, const T& value)\n\n{\n\n std::ofstream node(path);\n\n if (!node) {\n\n LOG(ERROR) << \"Failed to open: \" << path;\n\n return Status::UNKNOWN_ERROR;\n\n }\n\n\n","file_path":"hardware/interface/vibrator/Vibrator.cpp","rank":78,"score":14439.22288313481},{"content":" LOG(DEBUG) << \"writeNode node: \" << path << \" value: \" << value;\n\n\n\n node << value << std::endl;\n\n if (!node) {\n\n LOG(ERROR) << \"Failed to write: \" << value;\n\n return Status::UNKNOWN_ERROR;\n\n }\n\n\n\n return Status::OK;\n\n}\n\n\n\nstatic bool doesNodeExist(const std::string& path)\n\n{\n\n std::ifstream f(path.c_str());\n\n return f.good();\n\n}\n\n\n\nVibrator::Vibrator()\n\n{\n\n bool ok;\n","file_path":"hardware/interface/vibrator/Vibrator.cpp","rank":79,"score":14430.19516147314},{"content":"#include <android-base/logging.h>\n\n\n\n#include <sys/stat.h>\n\n\n\nnamespace android {\n\nnamespace hardware {\n\nnamespace sensors {\n\nnamespace V1_0 {\n\nnamespace implementation {\n\n\n\n/*\n\n * If a multi-hal configuration file exists in the proper location,\n\n * return true indicating we need to use multi-hal functionality.\n\n */\n\nstatic bool UseMultiHal() {\n\n const std::string& name = MULTI_HAL_CONFIG_FILE_PATH;\n\n struct stat buffer;\n\n return (stat (name.c_str(), &buffer) == 0);\n\n}\n\n\n","file_path":"hardware/interface/sensors/Sensors.cpp","rank":80,"score":14430.098283164496},{"content":" * function to consume USB device plugin events (on receiving a\n\n * USB device path string), and enable autosupend on the USB device if\n\n * necessary.\n\n */\n\nvoid checkUsbDeviceAutoSuspend(const std::string& devicePath) {\n\n /*\n\n * Currently we only actively enable devices that should be autosuspended, and leave others\n\n * to the defualt.\n\n */\n\n if (canUsbDeviceAutoSuspend(devicePath)) {\n\n ALOGI(\"auto suspend usb device %s\", devicePath.c_str());\n\n writeFile(devicePath + \"/power/control\", \"auto\");\n\n }\n\n}\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace usb\n\n} // namespace hardware\n\n} // namespace android\n","file_path":"hardware/interface/usb/Usb.cpp","rank":81,"score":14425.86307153398},{"content":"#include <hidl/HidlSupport.h>\n\n#include <hidl/HidlTransportSupport.h>\n\n#include <utils/Errors.h>\n\n#include <utils/StrongPointer.h>\n\n\n\n#include \"Vibrator.h\"\n\n\n\nusing android::hardware::configureRpcThreadpool;\n\nusing android::hardware::joinRpcThreadpool;\n\nusing android::hardware::vibrator::V1_0::IVibrator;\n\nusing android::hardware::vibrator::V1_0::implementation::Vibrator;\n\n\n\nusing android::OK;\n\nusing android::sp;\n\nusing android::status_t;\n\n\n\nint main() {\n\n status_t status;\n\n sp<IVibrator> vibrator;\n\n\n","file_path":"hardware/interface/vibrator/service.cpp","rank":82,"score":14425.701388923691},{"content":" }\n\n setAmplitude(amplitude);\n\n\n\n ms = effectToMs(effect, &status);\n\n if (status != Status::OK) {\n\n _hidl_cb(status, 0);\n\n return Void();\n\n }\n\n status = activate(ms);\n\n\n\n _hidl_cb(status, ms);\n\n\n\n return Void();\n\n}\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace vibrator\n\n} // namespace hardware\n\n} // namespace android\n","file_path":"hardware/interface/vibrator/Vibrator.cpp","rank":83,"score":14423.25894880706},{"content":"#include <android-base/stringprintf.h>\n\n\n\n#include <hardware/hardware.h>\n\n#include <hardware/vibrator.h>\n\n\n\n#include \"Vibrator.h\"\n\n\n\n#include <cinttypes>\n\n#include <cmath>\n\n#include <fstream>\n\n#include <iostream>\n\n\n\n#define INTENSITY_MIN 1000\n\n#define INTENSITY_MAX 10000\n\n#define INENSITY_DEFAULT INTENSITY_MAX\n\n\n\n#define CLICK_TIMING_MS 20\n\n\n\n#define VIBRATOR_TIMEOUT_PATH \"/sys/class/timed_output/vibrator/enable\"\n\n#define VIBRATOR_HAPTIC_PATH \"/sys/class/timed_output/vibrator/haptic_engine\"\n","file_path":"hardware/interface/vibrator/Vibrator.cpp","rank":84,"score":14423.069053237665},{"content":"\n\nusing android::sp;\n\n\n\n// libhwbinder:\n\nusing android::hardware::configureRpcThreadpool;\n\nusing android::hardware::joinRpcThreadpool;\n\n\n\n// Generated HIDL files\n\nusing android::hardware::usb::V1_1::IUsb;\n\nusing android::hardware::usb::V1_1::implementation::Usb;\n\n\n\nusing android::status_t;\n\nusing android::OK;\n\n\n\nint main() {\n\n android::sp<IUsb> service = new Usb();\n\n\n\n configureRpcThreadpool(1, true /*callerWillJoin*/);\n\n status_t status = service->registerAsService();\n\n\n","file_path":"hardware/interface/usb/service.cpp","rank":85,"score":14422.530083019146},{"content":"#include <chrono>\n\n#include <dirent.h>\n\n#include <pthread.h>\n\n#include <regex>\n\n#include <stdio.h>\n\n#include <sys/types.h>\n\n#include <thread>\n\n#include <unistd.h>\n\n#include <unordered_map>\n\n\n\n#include <cutils/uevent.h>\n\n#include <sys/epoll.h>\n\n#include <utils/Errors.h>\n\n#include <utils/StrongPointer.h>\n\n\n\n#include \"Usb.h\"\n\n\n\nnamespace android {\n\nnamespace hardware {\n\nnamespace usb {\n","file_path":"hardware/interface/usb/Usb.cpp","rank":86,"score":14421.80168054838},{"content":" uevent_fd = uevent_open_socket(64 * 1024, true);\n\n\n\n if (uevent_fd < 0) {\n\n ALOGE(\"uevent_init: uevent_open_socket failed\\n\");\n\n return NULL;\n\n }\n\n\n\n payload.uevent_fd = uevent_fd;\n\n payload.usb = (android::hardware::usb::V1_1::implementation::Usb *)param;\n\n\n\n fcntl(uevent_fd, F_SETFL, O_NONBLOCK);\n\n\n\n ev.events = EPOLLIN;\n\n ev.data.ptr = (void *)uevent_event;\n\n\n\n epoll_fd = epoll_create(64);\n\n if (epoll_fd == -1) {\n\n ALOGE(\"epoll_create failed; errno=%d\", errno);\n\n goto error;\n\n }\n","file_path":"hardware/interface/usb/Usb.cpp","rank":87,"score":14421.450427649981},{"content":"\n\n intensity = std::lround((amplitude - 1) * 10000.0 / 254.0);\n\n if (intensity > INTENSITY_MAX) {\n\n intensity = INTENSITY_MAX;\n\n }\n\n LOG(DEBUG) << \"setting intensity: \" << intensity;\n\n\n\n if (doesNodeExist(VIBRATOR_INTENSITY_PATH)) {\n\n return writeNode(VIBRATOR_INTENSITY_PATH, intensity);\n\n }\n\n\n\n if (doesNodeExist(VIBRATOR_HAPTIC_PATH)) {\n\n std::string haptic = android::base::StringPrintf(\"4 %u %u %u %u\",\n\n CLICK_TIMING_MS,\n\n intensity,\n\n 2000,\n\n 1);\n\n\n\n return writeNode(VIBRATOR_HAPTIC_PATH, haptic);\n\n }\n","file_path":"hardware/interface/vibrator/Vibrator.cpp","rank":88,"score":14421.360221928411},{"content":" }\n\n}\n\n\n\nISensors *HIDL_FETCH_ISensors(const char * /* hal */) {\n\n Sensors *sensors = new Sensors;\n\n if (sensors->initCheck() != OK) {\n\n delete sensors;\n\n sensors = nullptr;\n\n\n\n return nullptr;\n\n }\n\n\n\n return sensors;\n\n}\n\n\n\n} // namespace implementation\n\n} // namespace V1_0\n\n} // namespace sensors\n\n} // namespace hardware\n\n} // namespace android\n","file_path":"hardware/interface/sensors/Sensors.cpp","rank":89,"score":14420.883336120743},{"content":"namespace V1_1 {\n\nnamespace implementation {\n\n\n\nconst char GOOGLE_USB_VENDOR_ID_STR[] = \"18d1\";\n\nconst char GOOGLE_USBC_35_ADAPTER_UNPLUGGED_ID_STR[] = \"5029\";\n\n\n\n// Set by the signal handler to destroy the thread\n\nvolatile bool destroyThread;\n\n\n\nstatic void checkUsbDeviceAutoSuspend(const std::string& devicePath);\n\n\n\nstatic int32_t readFile(const std::string &filename, std::string *contents) {\n\n FILE *fp;\n\n ssize_t read = 0;\n\n char *line = NULL;\n\n size_t len = 0;\n\n\n\n fp = fopen(filename.c_str(), \"r\");\n\n if (fp != NULL) {\n\n if ((read = getline(&line, &len, fp)) != -1) {\n","file_path":"hardware/interface/usb/Usb.cpp","rank":90,"score":14420.851364743068},{"content":" if (readFile(filename, accessory)) {\n\n ALOGE(\"getAccessoryConnected: Failed to open filesystem node: %s\",\n\n filename.c_str());\n\n return Status::ERROR;\n\n }\n\n\n\n return Status::SUCCESS;\n\n}\n\n\n\nStatus getCurrentRoleHelper(const std::string &portName, bool connected,\n\n PortRoleType type, uint32_t *currentRole) {\n\n std::string filename;\n\n std::string roleName;\n\n std::string accessory;\n\n\n\n // Mode\n\n\n\n if (type == PortRoleType::POWER_ROLE) {\n\n filename = \"/sys/class/typec/\" + portName + \"/power_role\";\n\n *currentRole = static_cast<uint32_t>(PortPowerRole::NONE);\n","file_path":"hardware/interface/usb/Usb.cpp","rank":91,"score":14420.756532358211},{"content":"\n\n ok = doesNodeExist(VIBRATOR_TIMEOUT_PATH);\n\n if (ok) {\n\n mIsTimedOutVibriator = true;\n\n }\n\n}\n\n\n\nStatus Vibrator::activate(uint32_t timeoutMs)\n\n{\n\n if (!mIsTimedOutVibriator) {\n\n return Status::UNSUPPORTED_OPERATION;\n\n }\n\n\n\n return writeNode(VIBRATOR_TIMEOUT_PATH, timeoutMs);\n\n}\n\n\n\nReturn<Status> Vibrator::on(uint32_t timeoutMs)\n\n{\n\n return activate(timeoutMs);\n\n}\n","file_path":"hardware/interface/vibrator/Vibrator.cpp","rank":92,"score":9.351055497116633},{"content":" *currentRole = static_cast<uint32_t>(PortMode_1_1::DEBUG_ACCESSORY);\n\n return Status::SUCCESS;\n\n }\n\n }\n\n\n\n if (readFile(filename, &roleName)) {\n\n ALOGE(\"getCurrentRole: Failed to open filesystem node: %s\",\n\n filename.c_str());\n\n return Status::ERROR;\n\n }\n\n\n\n extractRole(&roleName);\n\n\n\n if (roleName == \"source\") {\n\n *currentRole = static_cast<uint32_t>(PortPowerRole::SOURCE);\n\n } else if (roleName == \"sink\") {\n\n *currentRole = static_cast<uint32_t>(PortPowerRole::SINK);\n\n } else if (roleName == \"host\") {\n\n if (type == PortRoleType::DATA_ROLE)\n\n *currentRole = static_cast<uint32_t>(PortDataRole::HOST);\n","file_path":"hardware/interface/usb/Usb.cpp","rank":93,"score":9.102107156091838},{"content":"/*\n\n * Copyright (C) 2016 The Android Open Source Project\n\n *\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#include \"Sensors.h\"\n\n#include <sensors/convert.h>\n\n#include \"multihal.h\"\n\n\n","file_path":"hardware/interface/sensors/Sensors.cpp","rank":94,"score":8.900452448740023},{"content":"/*\n\n * Copyright (C) 2017 The Android Open Source Project\n\n *\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#define LOG_TAG \"ExynosUSB HAL\"\n\n\n\n#include <android-base/logging.h>\n\n#include <assert.h>\n","file_path":"hardware/interface/usb/Usb.cpp","rank":95,"score":8.812354530975313},{"content":"/*\n\n * Copyright (C) 2019 The LineageOS Project\n\n *\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#define LOG_TAG \"vibrator@1.0-exynos9820\"\n\n\n\n#include <android-base/logging.h>\n\n#include <android/hardware/vibrator/1.0/IVibrator.h>\n","file_path":"hardware/interface/vibrator/service.cpp","rank":96,"score":8.71013574466843},{"content":" case PortRoleType::DATA_ROLE:\n\n return node + \"/data_role\";\n\n case PortRoleType::POWER_ROLE:\n\n return node + \"/power_role\";\n\n case PortRoleType::MODE:\n\n return node + \"/port_type\";\n\n default:\n\n return \"\";\n\n }\n\n}\n\n\n\nstd::string convertRoletoString(PortRole role) {\n\n if (role.type == PortRoleType::POWER_ROLE) {\n\n if (role.role == static_cast<uint32_t>(PortPowerRole::SOURCE))\n\n return \"source\";\n\n else if (role.role == static_cast<uint32_t>(PortPowerRole::SINK))\n\n return \"sink\";\n\n } else if (role.type == PortRoleType::DATA_ROLE) {\n\n if (role.role == static_cast<uint32_t>(PortDataRole::HOST)) return \"host\";\n\n if (role.role == static_cast<uint32_t>(PortDataRole::DEVICE))\n","file_path":"hardware/interface/usb/Usb.cpp","rank":97,"score":8.057076944390644},{"content":"/*\n\n * Copyright (C) 2016 The Android Open Source Project\n\n *\n\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n\n * you may not use this file except in compliance with the License.\n\n * You may obtain a copy of the License at\n\n *\n\n * http://www.apache.org/licenses/LICENSE-2.0\n\n *\n\n * Unless required by applicable law or agreed to in writing, software\n\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n * See the License for the specific language governing permissions and\n\n * limitations under the License.\n\n */\n\n\n\n#define LOG_TAG \"ExynosUSB HAL\"\n\n\n\n#include <hidl/HidlTransportSupport.h>\n\n#include \"Usb.h\"\n","file_path":"hardware/interface/usb/service.cpp","rank":98,"score":8.026830973698901},{"content":" if (mSensorDevice->inject_sensor_data == nullptr) {\n\n LOG(ERROR) << \"HAL specifies version 1.4, but does not implement inject_sensor_data()\";\n\n }\n\n if (mSensorModule->set_operation_mode == nullptr) {\n\n LOG(ERROR) << \"HAL specifies version 1.4, but does not implement set_operation_mode()\";\n\n }\n\n }\n\n\n\n /* Get us all sensors */\n\n setOperationMode(static_cast<hardware::sensors::V1_0::OperationMode>(5555));\n\n\n\n mInitCheck = OK;\n\n}\n\n\n\nstatus_t Sensors::initCheck() const {\n\n return mInitCheck;\n\n}\n\n\n\nReturn<void> Sensors::getSensorsList(getSensorsList_cb _hidl_cb) {\n\n sensor_t const *list;\n","file_path":"hardware/interface/sensors/Sensors.cpp","rank":99,"score":7.815839895550766}],"string":"[\n {\n \"content\": \"namespace android {\\n\\nnamespace hardware {\\n\\nnamespace power {\\n\\nnamespace V1_0 {\\n\\nnamespace implementation {\\n\\n\\n\\nusing ::android::hardware::power::V1_0::Feature;\\n\\nusing ::android::hardware::power::V1_0::PowerHint;\\n\\nusing ::android::hardware::power::V1_0::IPower;\\n\\nusing ::android::hardware::Return;\\n\\nusing ::android::hardware::Void;\\n\\n\\n\\nstruct Power : public IPower {\\n\\n // Methods from ::android::hardware::power::V1_0::IPower follow.\\n\\n\\n\\n Power();\\n\\n\\n\\n Return<void> setInteractive(bool interactive) override;\\n\\n Return<void> powerHint(PowerHint hint, int32_t data) override;\\n\\n Return<void> setFeature(Feature feature, bool activate) override;\\n\\n Return<void> getPlatformLowPowerStats(getPlatformLowPowerStats_cb _hidl_cb) override;\\n\\n\\n\\n private:\\n\\n bool mDoubleTapEnabled;\\n\\n\\n\\n InteractionHandler mInteractionHandler;\\n\\n Epic mEpic;\\n\\n std::vector<std::string> mInteractiveNodes;\\n\\n};\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace power\\n\\n} // namespace hardware\\n\",\n \"file_path\": \"hardware/interface/power/Power.h\",\n \"rank\": 0,\n \"score\": 87571.69437301318\n },\n {\n \"content\": \"namespace android {\\n\\nnamespace hardware {\\n\\nnamespace usb {\\n\\nnamespace V1_1 {\\n\\nnamespace implementation {\\n\\n\\n\\nusing ::android::hardware::usb::V1_0::PortRole;\\n\\nusing ::android::hardware::usb::V1_0::PortRoleType;\\n\\nusing ::android::hardware::usb::V1_0::PortDataRole;\\n\\nusing ::android::hardware::usb::V1_0::PortPowerRole;\\n\\nusing ::android::hardware::usb::V1_0::Status;\\n\\nusing ::android::hardware::usb::V1_1::IUsb;\\n\\nusing ::android::hardware::usb::V1_1::IUsbCallback;\\n\\nusing ::android::hardware::usb::V1_1::PortMode_1_1;\\n\\nusing ::android::hardware::usb::V1_1::PortStatus_1_1;\\n\\nusing ::android::hidl::base::V1_0::DebugInfo;\\n\\nusing ::android::hidl::base::V1_0::IBase;\\n\\nusing ::android::hardware::hidl_array;\\n\\nusing ::android::hardware::hidl_memory;\\n\\nusing ::android::hardware::hidl_string;\\n\\nusing ::android::hardware::hidl_vec;\\n\\nusing ::android::hardware::Return;\\n\\nusing ::android::hardware::Void;\\n\\nusing ::android::sp;\\n\\n\\n\\nstruct Usb : public IUsb {\\n\\n Usb();\\n\\n\\n\\n Return<void> switchRole(const hidl_string& portName, const PortRole& role) override;\\n\\n Return<void> setCallback(const sp<V1_0::IUsbCallback>& callback) override;\\n\\n Return<void> queryPortStatus() override;\\n\\n\\n\\n\\n\\n sp<V1_0::IUsbCallback> mCallback_1_0;\\n\\n // Protects mCallback variable\\n\\n pthread_mutex_t mLock;\\n\\n // Protects roleSwitch operation\\n\\n pthread_mutex_t mRoleSwitchLock;\\n\\n // Threads waiting for the partner to come back wait here\\n\\n pthread_cond_t mPartnerCV;\\n\\n // lock protecting mPartnerCV\\n\\n pthread_mutex_t mPartnerLock;\\n\\n // Variable to signal partner coming back online after type switch\\n\\n bool mPartnerUp;\\n\\n\\n\\n private:\\n\\n pthread_t mPoll;\\n\\n};\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace usb\\n\\n} // namespace hardware\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.h\",\n \"rank\": 1,\n \"score\": 58523.600119122064\n },\n {\n \"content\": \"namespace android {\\n\\nnamespace hardware {\\n\\nnamespace sensors {\\n\\nnamespace V1_0 {\\n\\nnamespace implementation {\\n\\n\\n\\n\\n\\nstruct Sensors : public ::android::hardware::sensors::V1_0::ISensors {\\n\\n Sensors();\\n\\n\\n\\n status_t initCheck() const;\\n\\n\\n\\n Return<void> getSensorsList(getSensorsList_cb _hidl_cb) override;\\n\\n\\n\\n Return<Result> setOperationMode(OperationMode mode) override;\\n\\n\\n\\n Return<Result> activate(\\n\\n int32_t sensor_handle, bool enabled) override;\\n\\n\\n\\n Return<void> poll(int32_t maxCount, poll_cb _hidl_cb) override;\\n\\n\\n\\n Return<Result> batch(\\n\\n int32_t sensor_handle,\\n\\n int64_t sampling_period_ns,\\n\\n int64_t max_report_latency_ns) override;\\n\\n\\n\\n Return<Result> flush(int32_t sensor_handle) override;\\n\\n\\n\\n Return<Result> injectSensorData(const Event& event) override;\\n\\n\\n\\n Return<void> registerDirectChannel(\\n\\n const SharedMemInfo& mem, registerDirectChannel_cb _hidl_cb) override;\\n\\n\\n\\n Return<Result> unregisterDirectChannel(int32_t channelHandle) override;\\n\\n\\n\\n Return<void> configDirectReport(\\n\\n int32_t sensorHandle, int32_t channelHandle, RateLevel rate,\\n\\n configDirectReport_cb _hidl_cb) override;\\n\\n\\n\\nprivate:\\n\\n static constexpr int32_t kPollMaxBufferSize = 128;\\n\\n status_t mInitCheck;\\n\\n sensors_module_t *mSensorModule;\\n\\n sensors_poll_device_1_t *mSensorDevice;\\n\\n std::mutex mPollLock;\\n\\n\\n\\n int getHalDeviceVersion() const;\\n\\n\\n\\n static void convertFromSensorEvents(\\n\\n size_t count, const sensors_event_t *src, hidl_vec<Event> *dst);\\n\\n\\n\\n DISALLOW_COPY_AND_ASSIGN(Sensors);\\n\\n};\\n\\n\\n\\nextern \\\"C\\\" ISensors *HIDL_FETCH_ISensors(const char *name);\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace sensors\\n\\n} // namespace hardware\\n\",\n \"file_path\": \"hardware/interface/sensors/Sensors.h\",\n \"rank\": 2,\n \"score\": 58523.600119122064\n },\n {\n \"content\": \" void (*_epic_release)(void);\\n\",\n \"file_path\": \"hardware/interface/power/Epic.h\",\n \"rank\": 3,\n \"score\": 53776.525640143336\n },\n {\n \"content\": \"#define TSP_PATH \\\"/sys/class/sec/tsp/\\\"\\n\\n\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 4,\n \"score\": 53629.19093586313\n },\n {\n \"content\": \"static void sysfs_write(const char *path, char *s)\\n\\n{\\n\\n char errno_str[64];\\n\\n int len;\\n\\n int fd;\\n\\n\\n\\n fd = open(path, O_WRONLY);\\n\\n if (fd < 0) {\\n\\n strerror_r(errno, errno_str, sizeof(errno_str));\\n\\n ALOGE(\\\"Error opening %s: %s\\\", path, errno_str);\\n\\n return;\\n\\n }\\n\\n\\n\\n len = write(fd, s, strlen(s));\\n\\n if (len < 0) {\\n\\n strerror_r(errno, errno_str, sizeof(errno_str));\\n\\n ALOGE(\\\"Error writing to %s: %s\\\", path, errno_str);\\n\\n }\\n\\n\\n\\n close(fd);\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 5,\n \"score\": 53629.19093586313\n },\n {\n \"content\": \"#ifndef EPIC_H\\n\\n#define EPIC_H\\n\\n\\n\\n#include <android/hardware/power/1.0/IPower.h>\\n\\n\\n\\nusing ::android::hardware::power::V1_0::PowerHint;\\n\\n\\n\\nstruct Epic {\\n\\n bool Init(void);\\n\\n void videoEncode(PowerHint hint);\\n\\n\\n\\n private:\\n\\n void *(*_epic_alloc_request)(uint32_t hint);\\n\\n void (*_epic_free_request)(void);\\n\\n void (*_epic_acquire)(void *request);\\n\\n void (*_epic_release)(void);\\n\\n\\n\\n bool mEpicAvailable;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"hardware/interface/power/Epic.h\",\n \"rank\": 6,\n \"score\": 52120.11100860382\n },\n {\n \"content\": \" bool Init(void);\\n\",\n \"file_path\": \"hardware/interface/power/Epic.h\",\n \"rank\": 7,\n \"score\": 52115.406786481435\n },\n {\n \"content\": \" std::condition_variable mCond;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 8,\n \"score\": 52115.406786481435\n },\n {\n \"content\": \"#define CMD_STATE_FAIL \\\"FAIL\\\"\\n\\n\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 9,\n \"score\": 52022.260104230285\n },\n {\n \"content\": \"#define LOG_TAG \\\"libtsp\\\"\\n\\n\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 10,\n \"score\": 50721.46875728568\n },\n {\n \"content\": \" void Routine();\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 11,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" bool mHandled;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 12,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" void videoEncode(PowerHint hint);\\n\",\n \"file_path\": \"hardware/interface/power/Epic.h\",\n \"rank\": 13,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" void Exit();\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 14,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" void Acquire(int32_t duration);\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 15,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" bool Init();\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 16,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" enum interaction_state mState;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 17,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \" bool mEpicAvailable;\\n\",\n \"file_path\": \"hardware/interface/power/Epic.h\",\n \"rank\": 18,\n \"score\": 50553.834580992836\n },\n {\n \"content\": \"#ifndef INTERACTIONHANDLER_H\\n\\n#define INTERACTIONHANDLER_H\\n\\n\\n\\n#include <condition_variable>\\n\\n#include <mutex>\\n\\n#include <thread>\\n\\n\\n\\nenum interaction_state {\\n\\n INTERACTION_STATE_UNINITIALIZED,\\n\\n INTERACTION_STATE_IDLE,\\n\\n INTERACTION_STATE_INTERACTION,\\n\\n};\\n\\n\\n\\nstruct InteractionHandler {\\n\\n InteractionHandler();\\n\\n ~InteractionHandler();\\n\\n bool Init();\\n\\n void Exit();\\n\\n void Acquire(int32_t duration);\\n\\n\\n\\n private:\\n\\n void Release();\\n\\n void Routine();\\n\\n\\n\\n void PerfLock();\\n\\n void PerfRel();\\n\\n\\n\\n long long CalcTimespecDiffMs(struct timespec start, struct timespec end);\\n\\n\\n\\n enum interaction_state mState;\\n\\n\\n\\n int32_t mMinDurationMs;\\n\\n int32_t mMaxDurationMs;\\n\\n int32_t mDurationMs;\\n\\n\\n\\n struct timespec mLastTimespec;\\n\\n\\n\\n bool mHandled;\\n\\n\\n\\n std::unique_ptr<std::thread> mThread;\\n\\n std::mutex mLock;\\n\\n std::condition_variable mCond;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 27,\n \"score\": 49088.352302784\n },\n {\n \"content\": \" void PerfRel();\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 28,\n \"score\": 49083.120981884436\n },\n {\n \"content\": \" struct timespec mLastTimespec;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 29,\n \"score\": 49083.120981884436\n },\n {\n \"content\": \" int32_t mDurationMs;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 30,\n \"score\": 49083.120981884436\n },\n {\n \"content\": \" void PerfLock();\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 31,\n \"score\": 49083.120981884436\n },\n {\n \"content\": \" int32_t mMinDurationMs;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 32,\n \"score\": 47695.560377516675\n },\n {\n \"content\": \" int32_t mMaxDurationMs;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 33,\n \"score\": 47695.560377516675\n },\n {\n \"content\": \" long long CalcTimespecDiffMs(struct timespec start, struct timespec end);\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.h\",\n \"rank\": 34,\n \"score\": 46384.29453954723\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2018-2020 The LineageOS Project\\n\\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\\n\\n * SPDX-License-Identifier: Apache-2.0\\n\\n */\\n\\n\\n\\n#define LOG_TAG \\\"power@1.0-exynos9820\\\"\\n\\n//#define LOG_NDEBUG 0\\n\\n\\n\\n#include <android-base/logging.h>\\n\\n#include <android-base/file.h>\\n\\n#include <cutils/properties.h>\\n\\n\\n\\n#include <dlfcn.h>\\n\\n\\n\\n#include \\\"Epic.h\\\"\\n\\n\\n\\nusing ::android::hardware::power::V1_0::PowerHint;\\n\\n\\n\\nbool Epic::Init(void)\\n\",\n \"file_path\": \"hardware/interface/power/Epic.cpp\",\n \"rank\": 35,\n \"score\": 42139.844459037755\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2018-2020 The LineageOS Project\\n\\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\\n\\n * SPDX-License-Identifier: Apache-2.0\\n\\n */\\n\\n\\n\\n#define LOG_TAG \\\"power@1.0-exynos9820\\\"\\n\\n\\n\\n#include <android-base/logging.h>\\n\\n\\n\\n#include <hidl/HidlTransportSupport.h>\\n\\n#include <hardware/power.h>\\n\\n#include \\\"Power.h\\\"\\n\\n\\n\\nusing android::sp;\\n\\nusing android::status_t;\\n\\nusing android::OK;\\n\\n\\n\\n// libhwbinder:\\n\\nusing android::hardware::configureRpcThreadpool;\\n\",\n \"file_path\": \"hardware/interface/power/service.cpp\",\n \"rank\": 36,\n \"score\": 42139.003725448434\n },\n {\n \"content\": \"using android::hardware::joinRpcThreadpool;\\n\\n\\n\\n// Generated HIDL files\\n\\nusing android::hardware::power::V1_0::IPower;\\n\\nusing android::hardware::power::V1_0::implementation::Power;\\n\\n\\n\\nint main() {\\n\\n\\n\\n status_t status;\\n\\n android::sp<IPower> service = nullptr;\\n\\n\\n\\n LOG(INFO) << \\\"Power HAL Service 1.0 for exynos9820 is starting.\\\";\\n\\n\\n\\n service = new Power();\\n\\n if (service == nullptr) {\\n\\n ALOGE(\\\"Can not create an instance of Power HAL Iface, exiting.\\\");\\n\\n\\n\\n goto shutdown;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"hardware/interface/power/service.cpp\",\n \"rank\": 37,\n \"score\": 42138.12501845911\n },\n {\n \"content\": \" }\\n\\n\\n\\n LOG(INFO) << \\\"Epic is ready\\\";\\n\\n\\n\\n mEpicAvailable = true;\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid Epic::videoEncode(PowerHint hint)\\n\\n{\\n\\n int preview;\\n\\n void *request = NULL;\\n\\n\\n\\n if (!mEpicAvailable) {\\n\\n return;\\n\\n }\\n\\n\\n\\n request = _epic_alloc_request((uint32_t)hint);\\n\\n\\n\\n preview = property_get_int32(\\\"persist.vendor.sys.camera.preview\\\", 0);\\n\\n if (preview != 2) {\\n\\n _epic_acquire(request);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"hardware/interface/power/Epic.cpp\",\n \"rank\": 38,\n \"score\": 42128.391892867294\n },\n {\n \"content\": \"{\\n\\n void *handle = NULL;\\n\\n\\n\\n handle = dlopen(\\\"libepic_helper.so\\\", RTLD_NOW);\\n\\n if (handle == nullptr) {\\n\\n LOG(ERROR) << \\\"Failed to load libepic_helper.so\\\";\\n\\n return false;\\n\\n }\\n\\n\\n\\n _epic_alloc_request = reinterpret_cast<typeof(_epic_alloc_request)>(dlsym(handle, \\\"epic_alloc_request\\\"));\\n\\n _epic_free_request = reinterpret_cast<typeof(_epic_free_request)>(dlsym(handle, \\\"epic_free_request\\\"));\\n\\n _epic_acquire = reinterpret_cast<typeof(_epic_acquire)>(dlsym(handle, \\\"epic_acquire\\\"));\\n\\n _epic_release = reinterpret_cast<typeof(_epic_release)>(dlsym(handle, \\\"epic_release\\\"));\\n\\n\\n\\n if (_epic_alloc_request == nullptr ||\\n\\n _epic_free_request == nullptr ||\\n\\n _epic_acquire == nullptr ||\\n\\n _epic_release == nullptr) {\\n\\n LOG(ERROR) << \\\"Failed to bind symbols from libepic_helper.so\\\";\\n\\n return false;\\n\",\n \"file_path\": \"hardware/interface/power/Epic.cpp\",\n \"rank\": 39,\n \"score\": 42127.171159888894\n },\n {\n \"content\": \" configureRpcThreadpool(1, true /*callerWillJoin*/);\\n\\n\\n\\n status = service->registerAsService();\\n\\n if (status != OK) {\\n\\n ALOGE(\\\"Could not register service for Power HAL Iface (%d).\\\", status);\\n\\n goto shutdown;\\n\\n }\\n\\n\\n\\n LOG(INFO) << \\\"Power Service is ready\\\";\\n\\n joinRpcThreadpool();\\n\\n //Should not pass this line\\n\\n\\n\\nshutdown:\\n\\n // In normal operation, we don't expect the thread pool to exit\\n\\n\\n\\n LOG(ERROR) << \\\"Power Service is shutting down\\\";\\n\\n return 1;\\n\\n}\\n\",\n \"file_path\": \"hardware/interface/power/service.cpp\",\n \"rank\": 40,\n \"score\": 42127.0194558676\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2018-2020 The LineageOS Project\\n\\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\\n\\n * SPDX-License-Identifier: Apache-2.0\\n\\n */\\n\\n\\n\\n#define LOG_TAG \\\"power@1.0-exynos9820\\\"\\n\\n//#define LOG_NDEBUG 0\\n\\n\\n\\n#include <android-base/logging.h>\\n\\n#include <android-base/file.h>\\n\\n\\n\\n#include <fcntl.h>\\n\\n#include <poll.h>\\n\\n#include <time.h>\\n\\n#include <unistd.h>\\n\\n\\n\\n#include \\\"InteractionHandler.h\\\"\\n\\n\\n\\n#define MSINSEC 1000L\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 41,\n \"score\": 40471.84481658367\n },\n {\n \"content\": \"#define USINMS 1000000L\\n\\n\\n\\nusing android::base::WriteStringToFile;\\n\\n\\n\\nInteractionHandler::InteractionHandler()\\n\\n : mState(INTERACTION_STATE_UNINITIALIZED),\\n\\n mMinDurationMs(1400),\\n\\n mMaxDurationMs(5650),\\n\\n mDurationMs(0)\\n\\n{\\n\\n}\\n\\n\\n\\nInteractionHandler::~InteractionHandler()\\n\\n{\\n\\n Exit();\\n\\n}\\n\\n\\n\\nbool InteractionHandler::Init()\\n\\n{\\n\\n std::lock_guard<std::mutex> lk(mLock);\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 42,\n \"score\": 40471.30197819652\n },\n {\n \"content\": \" mCond.notify_all();\\n\\n mThread->join();\\n\\n}\\n\\n\\n\\nvoid InteractionHandler::PerfLock()\\n\\n{\\n\\n LOG(VERBOSE) << \\\"Acquiring perf lock\\\";\\n\\n WriteStringToFile(\\\"1378000\\\", \\\"/sys/power/cpufreq_min_limit\\\", false);\\n\\n}\\n\\n\\n\\nvoid InteractionHandler::PerfRel()\\n\\n{\\n\\n LOG(VERBOSE) << \\\"Releasing perf lock\\\";\\n\\n WriteStringToFile(\\\"520000\\\", \\\"/sys/power/cpufreq_min_limit\\\", false);\\n\\n}\\n\\n\\n\\nlong long InteractionHandler::CalcTimespecDiffMs(struct timespec start,\\n\\n struct timespec end)\\n\\n{\\n\\n long long diff_in_us = 0;\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 43,\n \"score\": 40470.77099400912\n },\n {\n \"content\": \" mState = INTERACTION_STATE_INTERACTION;\\n\\n }\\n\\n\\n\\n mHandled = false;\\n\\n mCond.notify_one();\\n\\n}\\n\\n\\n\\nvoid InteractionHandler::Release()\\n\\n{\\n\\n std::lock_guard<std::mutex> lk(mLock);\\n\\n PerfRel();\\n\\n mState = INTERACTION_STATE_IDLE;\\n\\n}\\n\\n\\n\\nvoid InteractionHandler::Routine()\\n\\n{\\n\\n std::unique_lock<std::mutex> lk(mLock, std::defer_lock);\\n\\n\\n\\n while (true) {\\n\\n lk.lock();\\n\\n mCond.wait(lk, [&] { return mState == INTERACTION_STATE_INTERACTION; });\\n\\n mHandled = true;\\n\\n lk.unlock();\\n\\n\\n\\n std::this_thread::sleep_for(std::chrono::milliseconds(mDurationMs));\\n\\n if (mHandled) Release();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 44,\n \"score\": 40466.00441121062\n },\n {\n \"content\": \"\\n\\n if (mState != INTERACTION_STATE_UNINITIALIZED)\\n\\n return true;\\n\\n\\n\\n mState = INTERACTION_STATE_IDLE;\\n\\n mThread = std::unique_ptr<std::thread>(\\n\\n new std::thread(&InteractionHandler::Routine, this));\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid InteractionHandler::Exit()\\n\\n{\\n\\n std::unique_lock<std::mutex> lk(mLock);\\n\\n if (mState == INTERACTION_STATE_UNINITIALIZED)\\n\\n return;\\n\\n\\n\\n mState = INTERACTION_STATE_UNINITIALIZED;\\n\\n lk.unlock();\\n\\n\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 45,\n \"score\": 40465.621255438404\n },\n {\n \"content\": \" diff_in_us += (end.tv_sec - start.tv_sec) * MSINSEC;\\n\\n diff_in_us += (end.tv_nsec - start.tv_nsec) / USINMS;\\n\\n return diff_in_us;\\n\\n}\\n\\n\\n\\nvoid InteractionHandler::Acquire(int32_t duration)\\n\\n{\\n\\n std::lock_guard<std::mutex> lk(mLock);\\n\\n if (mState == INTERACTION_STATE_UNINITIALIZED) {\\n\\n LOG(WARNING) << \\\"Called while uninitialized\\\";\\n\\n return;\\n\\n }\\n\\n\\n\\n int inputDuration = duration + 650;\\n\\n int finalDuration;\\n\\n if (inputDuration > mMaxDurationMs)\\n\\n finalDuration = mMaxDurationMs;\\n\\n else if (inputDuration > mMinDurationMs)\\n\\n finalDuration = inputDuration;\\n\\n else\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 46,\n \"score\": 40465.284698585056\n },\n {\n \"content\": \" finalDuration = mMinDurationMs;\\n\\n\\n\\n struct timespec cur_timespec;\\n\\n clock_gettime(CLOCK_MONOTONIC, &cur_timespec);\\n\\n if (mState != INTERACTION_STATE_IDLE && finalDuration <= mDurationMs) {\\n\\n long long elapsed_time = CalcTimespecDiffMs(mLastTimespec, cur_timespec);\\n\\n // don't hint if previous hint's duration covers this hint's duration\\n\\n if (elapsed_time <= (mDurationMs - finalDuration)) {\\n\\n LOG(VERBOSE) << \\\"Previous duration (\\\" << mDurationMs << \\\") \\\"\\n\\n << \\\"cover this (\\\" << finalDuration << \\\") elapsed: \\\" << elapsed_time;\\n\\n return;\\n\\n }\\n\\n }\\n\\n mLastTimespec = cur_timespec;\\n\\n mDurationMs = finalDuration;\\n\\n\\n\\n LOG(VERBOSE) << \\\"input: \\\" << duration << \\\" final duration: \\\" << finalDuration;\\n\\n\\n\\n if (mState == INTERACTION_STATE_IDLE) {\\n\\n PerfLock();\\n\",\n \"file_path\": \"hardware/interface/power/InteractionHandler.cpp\",\n \"rank\": 47,\n \"score\": 40463.90063584359\n },\n {\n \"content\": \"bool tsp_init(void)\\n\\n{\\n\\n double_tap_supported = check_tsp_has_cmd(TSP_CMD_DT2W_CTL);\\n\\n\\n\\n return true;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 48,\n \"score\": 31250.496984040434\n },\n {\n \"content\": \"static int sysfs_read(char *path, char *s, int num_bytes)\\n\\n{\\n\\n char errno_str[64];\\n\\n int len;\\n\\n int ret = 0;\\n\\n int fd;\\n\\n\\n\\n fd = open(path, O_RDONLY);\\n\\n if (fd < 0) {\\n\\n strerror_r(errno, errno_str, sizeof(errno_str));\\n\\n ALOGE(\\\"Error opening %s: %s\\\", path, errno_str);\\n\\n\\n\\n return -1;\\n\\n }\\n\\n\\n\\n len = read(fd, s, num_bytes - 1);\\n\\n if (len < 0) {\\n\\n strerror_r(errno, errno_str, sizeof(errno_str));\\n\\n ALOGE(\\\"Error reading from %s: %s\\\", path, errno_str);\\n\\n\\n\\n ret = -1;\\n\\n } else {\\n\\n // do not store newlines, but terminate the string instead\\n\\n if (s[len-1] == '\\\\n') {\\n\\n s[len-1] = '\\\\0';\\n\\n } else {\\n\\n s[len] = '\\\\0';\\n\\n }\\n\\n }\\n\\n\\n\\n close(fd);\\n\\n\\n\\n return ret;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 49,\n \"score\": 31250.496984040434\n },\n {\n \"content\": \"bool tsp_disable_doubletap(void)\\n\\n{\\n\\n return tsp_set_doubletap(false);\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 50,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define CMD_STATE_LEN 16\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 51,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"static bool check_tsp_has_cmd(const char *cmd)\\n\\n{\\n\\n char *line = NULL;\\n\\n size_t len = 0;\\n\\n ssize_t nread;\\n\\n bool found = false;\\n\\n FILE *fp = NULL;\\n\\n\\n\\n fp = fopen(TSP_PATH TSP_CMD_LIST_FILE, \\\"r\\\");\\n\\n if (fp == NULL) {\\n\\n ALOGE(\\\"Failed to open TSP command list: %s\\\", strerror(errno));\\n\\n return false;\\n\\n }\\n\\n\\n\\n while ((nread = getline(&line, &len, fp)) != -1) {\\n\\n if (strncmp(line, cmd, strlen(cmd)) == 0) {\\n\\n ALOGI(\\\"tsp has cmd: %s\\\", cmd);\\n\\n found = true;\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n if (!found)\\n\\n ALOGI(\\\"tsp doesn't ahve cmd: %s\\\", cmd);\\n\\n\\n\\n free(line);\\n\\n fclose(fp);\\n\\n return found;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 52,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"char *tsp_get_result(void)\\n\\n{\\n\\n char inbuf[TSP_CMD_RES_LEN];\\n\\n char *res;\\n\\n char *retbuf;\\n\\n\\n\\n if (sysfs_read(TSP_PATH TSP_CMD_RES_FILE, inbuf, TSP_CMD_RES_LEN) < 0) {\\n\\n ALOGI(\\\"tsp get result failed\\\");\\n\\n return NULL;\\n\\n }\\n\\n\\n\\n ALOGI(\\\"Got result: %s\\\", inbuf);\\n\\n\\n\\n if ((res = strstr(inbuf, \\\":\\\")) == NULL) {\\n\\n ALOGI(\\\"no strstr\\\");\\n\\n return NULL;\\n\\n }\\n\\n\\n\\n retbuf = calloc(strlen(res)+1, sizeof(char));\\n\\n if (retbuf == NULL)\\n\\n return NULL;\\n\\n\\n\\n strcpy(retbuf, res+1);\\n\\n\\n\\n ALOGD(\\\"res: %s\\\", retbuf);\\n\\n\\n\\n return retbuf;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 53,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define TSP_CMD_LEN 64\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 54,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define CMD_STATE_WAITING \\\"WAITING\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 55,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"static bool tsp_set_doubletap(bool state)\\n\\n{\\n\\n char buf[TSP_CMD_LEN] = {0};\\n\\n bool ok;\\n\\n\\n\\n if (!double_tap_supported) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n /* set DT2W en/disable */\\n\\n snprintf(buf, TSP_CMD_LEN, \\\"%s,%d\\\", TSP_CMD_DT2W_CTL, !!state);\\n\\n\\n\\n ALOGI(\\\"%s\\\", buf);\\n\\n\\n\\n sysfs_write(TSP_PATH TSP_CMD_EXEC_FILE, buf);\\n\\n ok = tsp_wait_for_cmd(TSP_CMD_DT2W_CTL);\\n\\n if (!ok) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n ALOGV(\\\"dt2w %s\\\", state ? \\\"enabled\\\" : \\\"disabled\\\");\\n\\n\\n\\n return true;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 56,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define CMD_STATE_RUNNING \\\"RUNNING\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 57,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"static bool tsp_wait_for_cmd(const char *cmd)\\n\\n{\\n\\n char buf[CMD_STATE_LEN];\\n\\n int count = 0;\\n\\n\\n\\n while (count++ < 10) {\\n\\n if (sysfs_read(TSP_PATH TSP_CMD_STATE_FILE, buf, CMD_STATE_LEN) < 0) {\\n\\n ALOGE(\\\"%s: sysfs read failed\\\", cmd);\\n\\n return false;\\n\\n }\\n\\n\\n\\n ALOGI(\\\"state: %s - want %s\\\", buf, CMD_STATE_OK);\\n\\n /* TSP enters \\\"ok\\\" state once command result is ready to be read */\\n\\n if (!strncmp(buf, CMD_STATE_OK, strlen(CMD_STATE_OK)))\\n\\n return true;\\n\\n /* some commands skip the OK state and go straight to waiting. */\\n\\n if (!strncmp(buf, CMD_STATE_WAITING, strlen(CMD_STATE_WAITING)))\\n\\n return true;\\n\\n\\n\\n usleep(100);\\n\\n }\\n\\n\\n\\n ALOGE(\\\"%s: TSP timeout expired!\\\", cmd);\\n\\n /* FIXME: if the TSP ends up in a weird state,\\n\\n * we should read the result file to cause it to\\n\\n * exit the state */\\n\\n return false;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 58,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"bool tsp_enable_doubletap(void)\\n\\n{\\n\\n return tsp_set_doubletap(true);\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 59,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define CMD_STATE_OK \\\"OK\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 60,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define CMD_STATE_NA \\\"NOT_APPLICABLE\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 61,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"static bool double_tap_supported;\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 62,\n \"score\": 30314.115393507756\n },\n {\n \"content\": \"#define TSP_CMD_RES_LEN ((TSP_CMD_LEN)+8)\\n\\n\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 63,\n \"score\": 29432.216282912184\n },\n {\n \"content\": \"#define TSP_CMD_STATE_FILE \\\"cmd_status\\\"\\n\\n\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 64,\n \"score\": 29432.216282912184\n },\n {\n \"content\": \"#define TSP_CMD_LIST_FILE \\\"cmd_list\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 65,\n \"score\": 29432.216282912184\n },\n {\n \"content\": \"#define TSP_CMD_EXEC_FILE \\\"cmd\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 66,\n \"score\": 29432.216282912184\n },\n {\n \"content\": \"#define TSP_CMD_DT2W_CTL \\\"aot_enable\\\"\\n\\n\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 67,\n \"score\": 29432.216282912184\n },\n {\n \"content\": \"#define TSP_CMD_RES_FILE \\\"cmd_result\\\"\\n\",\n \"file_path\": \"hardware/libtsp/tsp.c\",\n \"rank\": 68,\n \"score\": 29432.216282912184\n },\n {\n \"content\": \"#!/bin/env python3\\n\\n#\\n\\n# Copyright (C) 2009 The Android Open Source Project\\n\\n# Copyright (C) 2019 The Mokee Open Source Project\\n\\n# Copyright (C) 2019-2020 The LineageOS Open Source Project\\n\\n#\\n\\n# Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n# you may not use this file except in compliance with the License.\\n\\n# You may obtain a copy of the License at\\n\\n#\\n\\n# http://www.apache.org/licenses/LICENSE-2.0\\n\\n#\\n\\n# Unless required by applicable law or agreed to in writing, software\\n\\n# distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n# See the License for the specific language governing permissions and\\n\\n# limitations under the License.\\n\\n\\n\\nimport common\\n\\nimport re\\n\\n\\n\\ndef FullOTA_InstallEnd(info):\\n\\n OTA_InstallEnd(info)\\n\\n return\\n\\n\\n\\ndef IncrementalOTA_InstallEnd(info):\\n\\n OTA_InstallEnd(info)\\n\\n return\\n\\n\\n\\ndef AddImage(info, basename, dest):\\n\\n name = basename\\n\\n data = info.input_zip.read(\\\"IMAGES/\\\" + basename)\\n\\n common.ZipWriteStr(info.output_zip, name, data)\\n\\n info.script.AppendExtra('package_extract_file(\\\"%s\\\", \\\"%s\\\");' % (name, dest))\\n\\n\\n\\ndef OTA_InstallEnd(info):\\n\\n info.script.Print(\\\"Patching firmware images...\\\")\\n\\n AddImage(info, \\\"dtbo.img\\\", \\\"/dev/block/by-name/dtbo\\\")\\n\\n return\\n\",\n \"file_path\": \"releasetools/releasetools.py\",\n \"rank\": 69,\n \"score\": 21744.137156175075\n },\n {\n \"content\": \"def AddImage(info, basename, dest):\\n\\n name = basename\\n\\n data = info.input_zip.read(\\\"IMAGES/\\\" + basename)\\n\\n common.ZipWriteStr(info.output_zip, name, data)\\n\",\n \"file_path\": \"releasetools/releasetools.py\",\n \"rank\": 70,\n \"score\": 20400.81511159248\n },\n {\n \"content\": \"def OTA_InstallEnd(info):\\n\\n info.script.Print(\\\"Patching firmware images...\\\")\\n\\n AddImage(info, \\\"dtbo.img\\\", \\\"/dev/block/by-name/dtbo\\\")\\n\",\n \"file_path\": \"releasetools/releasetools.py\",\n \"rank\": 71,\n \"score\": 19789.53050667526\n },\n {\n \"content\": \"def FullOTA_InstallEnd(info):\\n\\n OTA_InstallEnd(info)\\n\",\n \"file_path\": \"releasetools/releasetools.py\",\n \"rank\": 72,\n \"score\": 19213.812920118915\n },\n {\n \"content\": \"def IncrementalOTA_InstallEnd(info):\\n\\n OTA_InstallEnd(info)\\n\",\n \"file_path\": \"releasetools/releasetools.py\",\n \"rank\": 73,\n \"score\": 19213.812920118915\n },\n {\n \"content\": \"# LineageOS platform tree for the Samsung Exynos 9820\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 74,\n \"score\": 17671.512482920247\n },\n {\n \"content\": \" static uint32_t effectToMs(Effect effect, Status* status);\\n\\n\\n\\n bool mIsTimedOutVibriator;\\n\\n};\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace vibrator\\n\\n} // namespace hardware\\n\\n} // namespace android\\n\\n\\n\\n#endif // ANDROID_HARDWARE_VIBRATOR_V1_0_VIBRATOR_H\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.h\",\n \"rank\": 75,\n \"score\": 15043.6356416965\n },\n {\n \"content\": \"#include <android/hardware/vibrator/1.0/IVibrator.h>\\n\\n#include <hidl/Status.h>\\n\\n\\n\\n#include <fstream>\\n\\n\\n\\nnamespace android {\\n\\nnamespace hardware {\\n\\nnamespace vibrator {\\n\\nnamespace V1_0 {\\n\\nnamespace implementation {\\n\\n\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.h\",\n \"rank\": 76,\n \"score\": 15043.536429374419\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2019-2020 The LineageOS Project\\n\\n * Copyright (C) 2020 Andreas Schneider <asn@cryptomilk.org>\\n\\n *\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#ifndef ANDROID_HARDWARE_VIBRATOR_V1_0_VIBRATOR_H\\n\\n#define ANDROID_HARDWARE_VIBRATOR_V1_0_VIBRATOR_H\\n\\n\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.h\",\n \"rank\": 77,\n \"score\": 15034.194989078456\n },\n {\n \"content\": \"#define VIBRATOR_INTENSITY_PATH \\\"/sys/class/timed_output/vibrator/intensity\\\"\\n\\n\\n\\nnamespace android {\\n\\nnamespace hardware {\\n\\nnamespace vibrator {\\n\\nnamespace V1_0 {\\n\\nnamespace implementation {\\n\\n\\n\\n/*\\n\\n * Write value to path and close file.\\n\\n */\\n\\ntemplate <typename T>\\n\\nstatic Return<Status> writeNode(const std::string& path, const T& value)\\n\\n{\\n\\n std::ofstream node(path);\\n\\n if (!node) {\\n\\n LOG(ERROR) << \\\"Failed to open: \\\" << path;\\n\\n return Status::UNKNOWN_ERROR;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.cpp\",\n \"rank\": 78,\n \"score\": 14439.22288313481\n },\n {\n \"content\": \" LOG(DEBUG) << \\\"writeNode node: \\\" << path << \\\" value: \\\" << value;\\n\\n\\n\\n node << value << std::endl;\\n\\n if (!node) {\\n\\n LOG(ERROR) << \\\"Failed to write: \\\" << value;\\n\\n return Status::UNKNOWN_ERROR;\\n\\n }\\n\\n\\n\\n return Status::OK;\\n\\n}\\n\\n\\n\\nstatic bool doesNodeExist(const std::string& path)\\n\\n{\\n\\n std::ifstream f(path.c_str());\\n\\n return f.good();\\n\\n}\\n\\n\\n\\nVibrator::Vibrator()\\n\\n{\\n\\n bool ok;\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.cpp\",\n \"rank\": 79,\n \"score\": 14430.19516147314\n },\n {\n \"content\": \"#include <android-base/logging.h>\\n\\n\\n\\n#include <sys/stat.h>\\n\\n\\n\\nnamespace android {\\n\\nnamespace hardware {\\n\\nnamespace sensors {\\n\\nnamespace V1_0 {\\n\\nnamespace implementation {\\n\\n\\n\\n/*\\n\\n * If a multi-hal configuration file exists in the proper location,\\n\\n * return true indicating we need to use multi-hal functionality.\\n\\n */\\n\\nstatic bool UseMultiHal() {\\n\\n const std::string& name = MULTI_HAL_CONFIG_FILE_PATH;\\n\\n struct stat buffer;\\n\\n return (stat (name.c_str(), &buffer) == 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"hardware/interface/sensors/Sensors.cpp\",\n \"rank\": 80,\n \"score\": 14430.098283164496\n },\n {\n \"content\": \" * function to consume USB device plugin events (on receiving a\\n\\n * USB device path string), and enable autosupend on the USB device if\\n\\n * necessary.\\n\\n */\\n\\nvoid checkUsbDeviceAutoSuspend(const std::string& devicePath) {\\n\\n /*\\n\\n * Currently we only actively enable devices that should be autosuspended, and leave others\\n\\n * to the defualt.\\n\\n */\\n\\n if (canUsbDeviceAutoSuspend(devicePath)) {\\n\\n ALOGI(\\\"auto suspend usb device %s\\\", devicePath.c_str());\\n\\n writeFile(devicePath + \\\"/power/control\\\", \\\"auto\\\");\\n\\n }\\n\\n}\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace usb\\n\\n} // namespace hardware\\n\\n} // namespace android\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 81,\n \"score\": 14425.86307153398\n },\n {\n \"content\": \"#include <hidl/HidlSupport.h>\\n\\n#include <hidl/HidlTransportSupport.h>\\n\\n#include <utils/Errors.h>\\n\\n#include <utils/StrongPointer.h>\\n\\n\\n\\n#include \\\"Vibrator.h\\\"\\n\\n\\n\\nusing android::hardware::configureRpcThreadpool;\\n\\nusing android::hardware::joinRpcThreadpool;\\n\\nusing android::hardware::vibrator::V1_0::IVibrator;\\n\\nusing android::hardware::vibrator::V1_0::implementation::Vibrator;\\n\\n\\n\\nusing android::OK;\\n\\nusing android::sp;\\n\\nusing android::status_t;\\n\\n\\n\\nint main() {\\n\\n status_t status;\\n\\n sp<IVibrator> vibrator;\\n\\n\\n\",\n \"file_path\": \"hardware/interface/vibrator/service.cpp\",\n \"rank\": 82,\n \"score\": 14425.701388923691\n },\n {\n \"content\": \" }\\n\\n setAmplitude(amplitude);\\n\\n\\n\\n ms = effectToMs(effect, &status);\\n\\n if (status != Status::OK) {\\n\\n _hidl_cb(status, 0);\\n\\n return Void();\\n\\n }\\n\\n status = activate(ms);\\n\\n\\n\\n _hidl_cb(status, ms);\\n\\n\\n\\n return Void();\\n\\n}\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace vibrator\\n\\n} // namespace hardware\\n\\n} // namespace android\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.cpp\",\n \"rank\": 83,\n \"score\": 14423.25894880706\n },\n {\n \"content\": \"#include <android-base/stringprintf.h>\\n\\n\\n\\n#include <hardware/hardware.h>\\n\\n#include <hardware/vibrator.h>\\n\\n\\n\\n#include \\\"Vibrator.h\\\"\\n\\n\\n\\n#include <cinttypes>\\n\\n#include <cmath>\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n\\n\\n#define INTENSITY_MIN 1000\\n\\n#define INTENSITY_MAX 10000\\n\\n#define INENSITY_DEFAULT INTENSITY_MAX\\n\\n\\n\\n#define CLICK_TIMING_MS 20\\n\\n\\n\\n#define VIBRATOR_TIMEOUT_PATH \\\"/sys/class/timed_output/vibrator/enable\\\"\\n\\n#define VIBRATOR_HAPTIC_PATH \\\"/sys/class/timed_output/vibrator/haptic_engine\\\"\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.cpp\",\n \"rank\": 84,\n \"score\": 14423.069053237665\n },\n {\n \"content\": \"\\n\\nusing android::sp;\\n\\n\\n\\n// libhwbinder:\\n\\nusing android::hardware::configureRpcThreadpool;\\n\\nusing android::hardware::joinRpcThreadpool;\\n\\n\\n\\n// Generated HIDL files\\n\\nusing android::hardware::usb::V1_1::IUsb;\\n\\nusing android::hardware::usb::V1_1::implementation::Usb;\\n\\n\\n\\nusing android::status_t;\\n\\nusing android::OK;\\n\\n\\n\\nint main() {\\n\\n android::sp<IUsb> service = new Usb();\\n\\n\\n\\n configureRpcThreadpool(1, true /*callerWillJoin*/);\\n\\n status_t status = service->registerAsService();\\n\\n\\n\",\n \"file_path\": \"hardware/interface/usb/service.cpp\",\n \"rank\": 85,\n \"score\": 14422.530083019146\n },\n {\n \"content\": \"#include <chrono>\\n\\n#include <dirent.h>\\n\\n#include <pthread.h>\\n\\n#include <regex>\\n\\n#include <stdio.h>\\n\\n#include <sys/types.h>\\n\\n#include <thread>\\n\\n#include <unistd.h>\\n\\n#include <unordered_map>\\n\\n\\n\\n#include <cutils/uevent.h>\\n\\n#include <sys/epoll.h>\\n\\n#include <utils/Errors.h>\\n\\n#include <utils/StrongPointer.h>\\n\\n\\n\\n#include \\\"Usb.h\\\"\\n\\n\\n\\nnamespace android {\\n\\nnamespace hardware {\\n\\nnamespace usb {\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 86,\n \"score\": 14421.80168054838\n },\n {\n \"content\": \" uevent_fd = uevent_open_socket(64 * 1024, true);\\n\\n\\n\\n if (uevent_fd < 0) {\\n\\n ALOGE(\\\"uevent_init: uevent_open_socket failed\\\\n\\\");\\n\\n return NULL;\\n\\n }\\n\\n\\n\\n payload.uevent_fd = uevent_fd;\\n\\n payload.usb = (android::hardware::usb::V1_1::implementation::Usb *)param;\\n\\n\\n\\n fcntl(uevent_fd, F_SETFL, O_NONBLOCK);\\n\\n\\n\\n ev.events = EPOLLIN;\\n\\n ev.data.ptr = (void *)uevent_event;\\n\\n\\n\\n epoll_fd = epoll_create(64);\\n\\n if (epoll_fd == -1) {\\n\\n ALOGE(\\\"epoll_create failed; errno=%d\\\", errno);\\n\\n goto error;\\n\\n }\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 87,\n \"score\": 14421.450427649981\n },\n {\n \"content\": \"\\n\\n intensity = std::lround((amplitude - 1) * 10000.0 / 254.0);\\n\\n if (intensity > INTENSITY_MAX) {\\n\\n intensity = INTENSITY_MAX;\\n\\n }\\n\\n LOG(DEBUG) << \\\"setting intensity: \\\" << intensity;\\n\\n\\n\\n if (doesNodeExist(VIBRATOR_INTENSITY_PATH)) {\\n\\n return writeNode(VIBRATOR_INTENSITY_PATH, intensity);\\n\\n }\\n\\n\\n\\n if (doesNodeExist(VIBRATOR_HAPTIC_PATH)) {\\n\\n std::string haptic = android::base::StringPrintf(\\\"4 %u %u %u %u\\\",\\n\\n CLICK_TIMING_MS,\\n\\n intensity,\\n\\n 2000,\\n\\n 1);\\n\\n\\n\\n return writeNode(VIBRATOR_HAPTIC_PATH, haptic);\\n\\n }\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.cpp\",\n \"rank\": 88,\n \"score\": 14421.360221928411\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nISensors *HIDL_FETCH_ISensors(const char * /* hal */) {\\n\\n Sensors *sensors = new Sensors;\\n\\n if (sensors->initCheck() != OK) {\\n\\n delete sensors;\\n\\n sensors = nullptr;\\n\\n\\n\\n return nullptr;\\n\\n }\\n\\n\\n\\n return sensors;\\n\\n}\\n\\n\\n\\n} // namespace implementation\\n\\n} // namespace V1_0\\n\\n} // namespace sensors\\n\\n} // namespace hardware\\n\\n} // namespace android\\n\",\n \"file_path\": \"hardware/interface/sensors/Sensors.cpp\",\n \"rank\": 89,\n \"score\": 14420.883336120743\n },\n {\n \"content\": \"namespace V1_1 {\\n\\nnamespace implementation {\\n\\n\\n\\nconst char GOOGLE_USB_VENDOR_ID_STR[] = \\\"18d1\\\";\\n\\nconst char GOOGLE_USBC_35_ADAPTER_UNPLUGGED_ID_STR[] = \\\"5029\\\";\\n\\n\\n\\n// Set by the signal handler to destroy the thread\\n\\nvolatile bool destroyThread;\\n\\n\\n\\nstatic void checkUsbDeviceAutoSuspend(const std::string& devicePath);\\n\\n\\n\\nstatic int32_t readFile(const std::string &filename, std::string *contents) {\\n\\n FILE *fp;\\n\\n ssize_t read = 0;\\n\\n char *line = NULL;\\n\\n size_t len = 0;\\n\\n\\n\\n fp = fopen(filename.c_str(), \\\"r\\\");\\n\\n if (fp != NULL) {\\n\\n if ((read = getline(&line, &len, fp)) != -1) {\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 90,\n \"score\": 14420.851364743068\n },\n {\n \"content\": \" if (readFile(filename, accessory)) {\\n\\n ALOGE(\\\"getAccessoryConnected: Failed to open filesystem node: %s\\\",\\n\\n filename.c_str());\\n\\n return Status::ERROR;\\n\\n }\\n\\n\\n\\n return Status::SUCCESS;\\n\\n}\\n\\n\\n\\nStatus getCurrentRoleHelper(const std::string &portName, bool connected,\\n\\n PortRoleType type, uint32_t *currentRole) {\\n\\n std::string filename;\\n\\n std::string roleName;\\n\\n std::string accessory;\\n\\n\\n\\n // Mode\\n\\n\\n\\n if (type == PortRoleType::POWER_ROLE) {\\n\\n filename = \\\"/sys/class/typec/\\\" + portName + \\\"/power_role\\\";\\n\\n *currentRole = static_cast<uint32_t>(PortPowerRole::NONE);\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 91,\n \"score\": 14420.756532358211\n },\n {\n \"content\": \"\\n\\n ok = doesNodeExist(VIBRATOR_TIMEOUT_PATH);\\n\\n if (ok) {\\n\\n mIsTimedOutVibriator = true;\\n\\n }\\n\\n}\\n\\n\\n\\nStatus Vibrator::activate(uint32_t timeoutMs)\\n\\n{\\n\\n if (!mIsTimedOutVibriator) {\\n\\n return Status::UNSUPPORTED_OPERATION;\\n\\n }\\n\\n\\n\\n return writeNode(VIBRATOR_TIMEOUT_PATH, timeoutMs);\\n\\n}\\n\\n\\n\\nReturn<Status> Vibrator::on(uint32_t timeoutMs)\\n\\n{\\n\\n return activate(timeoutMs);\\n\\n}\\n\",\n \"file_path\": \"hardware/interface/vibrator/Vibrator.cpp\",\n \"rank\": 92,\n \"score\": 9.351055497116633\n },\n {\n \"content\": \" *currentRole = static_cast<uint32_t>(PortMode_1_1::DEBUG_ACCESSORY);\\n\\n return Status::SUCCESS;\\n\\n }\\n\\n }\\n\\n\\n\\n if (readFile(filename, &roleName)) {\\n\\n ALOGE(\\\"getCurrentRole: Failed to open filesystem node: %s\\\",\\n\\n filename.c_str());\\n\\n return Status::ERROR;\\n\\n }\\n\\n\\n\\n extractRole(&roleName);\\n\\n\\n\\n if (roleName == \\\"source\\\") {\\n\\n *currentRole = static_cast<uint32_t>(PortPowerRole::SOURCE);\\n\\n } else if (roleName == \\\"sink\\\") {\\n\\n *currentRole = static_cast<uint32_t>(PortPowerRole::SINK);\\n\\n } else if (roleName == \\\"host\\\") {\\n\\n if (type == PortRoleType::DATA_ROLE)\\n\\n *currentRole = static_cast<uint32_t>(PortDataRole::HOST);\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 93,\n \"score\": 9.102107156091838\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2016 The Android Open Source Project\\n\\n *\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#include \\\"Sensors.h\\\"\\n\\n#include <sensors/convert.h>\\n\\n#include \\\"multihal.h\\\"\\n\\n\\n\",\n \"file_path\": \"hardware/interface/sensors/Sensors.cpp\",\n \"rank\": 94,\n \"score\": 8.900452448740023\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2017 The Android Open Source Project\\n\\n *\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#define LOG_TAG \\\"ExynosUSB HAL\\\"\\n\\n\\n\\n#include <android-base/logging.h>\\n\\n#include <assert.h>\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 95,\n \"score\": 8.812354530975313\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2019 The LineageOS Project\\n\\n *\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#define LOG_TAG \\\"vibrator@1.0-exynos9820\\\"\\n\\n\\n\\n#include <android-base/logging.h>\\n\\n#include <android/hardware/vibrator/1.0/IVibrator.h>\\n\",\n \"file_path\": \"hardware/interface/vibrator/service.cpp\",\n \"rank\": 96,\n \"score\": 8.71013574466843\n },\n {\n \"content\": \" case PortRoleType::DATA_ROLE:\\n\\n return node + \\\"/data_role\\\";\\n\\n case PortRoleType::POWER_ROLE:\\n\\n return node + \\\"/power_role\\\";\\n\\n case PortRoleType::MODE:\\n\\n return node + \\\"/port_type\\\";\\n\\n default:\\n\\n return \\\"\\\";\\n\\n }\\n\\n}\\n\\n\\n\\nstd::string convertRoletoString(PortRole role) {\\n\\n if (role.type == PortRoleType::POWER_ROLE) {\\n\\n if (role.role == static_cast<uint32_t>(PortPowerRole::SOURCE))\\n\\n return \\\"source\\\";\\n\\n else if (role.role == static_cast<uint32_t>(PortPowerRole::SINK))\\n\\n return \\\"sink\\\";\\n\\n } else if (role.type == PortRoleType::DATA_ROLE) {\\n\\n if (role.role == static_cast<uint32_t>(PortDataRole::HOST)) return \\\"host\\\";\\n\\n if (role.role == static_cast<uint32_t>(PortDataRole::DEVICE))\\n\",\n \"file_path\": \"hardware/interface/usb/Usb.cpp\",\n \"rank\": 97,\n \"score\": 8.057076944390644\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2016 The Android Open Source Project\\n\\n *\\n\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n * you may not use this file except in compliance with the License.\\n\\n * You may obtain a copy of the License at\\n\\n *\\n\\n * http://www.apache.org/licenses/LICENSE-2.0\\n\\n *\\n\\n * Unless required by applicable law or agreed to in writing, software\\n\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n * See the License for the specific language governing permissions and\\n\\n * limitations under the License.\\n\\n */\\n\\n\\n\\n#define LOG_TAG \\\"ExynosUSB HAL\\\"\\n\\n\\n\\n#include <hidl/HidlTransportSupport.h>\\n\\n#include \\\"Usb.h\\\"\\n\",\n \"file_path\": \"hardware/interface/usb/service.cpp\",\n \"rank\": 98,\n \"score\": 8.026830973698901\n },\n {\n \"content\": \" if (mSensorDevice->inject_sensor_data == nullptr) {\\n\\n LOG(ERROR) << \\\"HAL specifies version 1.4, but does not implement inject_sensor_data()\\\";\\n\\n }\\n\\n if (mSensorModule->set_operation_mode == nullptr) {\\n\\n LOG(ERROR) << \\\"HAL specifies version 1.4, but does not implement set_operation_mode()\\\";\\n\\n }\\n\\n }\\n\\n\\n\\n /* Get us all sensors */\\n\\n setOperationMode(static_cast<hardware::sensors::V1_0::OperationMode>(5555));\\n\\n\\n\\n mInitCheck = OK;\\n\\n}\\n\\n\\n\\nstatus_t Sensors::initCheck() const {\\n\\n return mInitCheck;\\n\\n}\\n\\n\\n\\nReturn<void> Sensors::getSensorsList(getSensorsList_cb _hidl_cb) {\\n\\n sensor_t const *list;\\n\",\n \"file_path\": \"hardware/interface/sensors/Sensors.cpp\",\n \"rank\": 99,\n \"score\": 7.815839895550766\n }\n]","isConversational":false}}},{"rowIdx":98,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Src/Qt/qwt/src/qwt_spline.cpp"},"repo_name":{"kind":"string","value":"iclosure/smartsoft"},"commit":{"kind":"string","value":"62eaed49efd8306642b928ef4f2d96e36aca6527"},"file_code":{"kind":"string","value":"\n#include \"precomp.h\"\n#include \"qwt_spline.h\"\n#include \"qwt_math.h\"\n\nclass QwtSpline::PrivateData\n{\npublic:\n PrivateData():\n splineType( QwtSpline::Natural )\n {\n }\n\n QwtSpline::SplineType splineType;\n\n \n QVector<double> a;\n QVector<double> b;\n QVector<double> c;\n\n \n QPolygonF points;\n};\n\nstatic int lookup( double x, const QPolygonF &values )\n{\n#if 0\n\n#endif\n int i1;\n const int size = values.size();\n\n if ( x <= values[0].x() )\n i1 = 0;\n else if ( x >= values[size - 2].x() )\n i1 = size - 2;\n else\n {\n i1 = 0;\n int i2 = size - 2;\n int i3 = 0;\n\n while ( i2 - i1 > 1 )\n {\n i3 = i1 + ( ( i2 - i1 ) >> 1 );\n\n if ( values[i3].x() > x )\n i2 = i3;\n else\n i1 = i3;\n }\n }\n return i1;\n}\n\nQwtSpline::QwtSpline()\n{\n d_data = new PrivateData;\n}\n\nQwtSpline::QwtSpline( const QwtSpline& other )\n{\n d_data = new PrivateData( *other.d_data );\n}\n\nQwtSpline &QwtSpline::operator=( const QwtSpline & other )\n{\n *d_data = *other.d_data;\n return *this;\n}\n\nQwtSpline::~QwtSpline()\n{\n delete d_data;\n}\n\nvoid QwtSpline::setSplineType( SplineType splineType )\n{\n d_data->splineType = splineType;\n}\n\nQwtSpline::SplineType QwtSpline::splineType() const\n{\n return d_data->splineType;\n}\n\nbool QwtSpline::setPoints( const QPolygonF& points )\n{\n const int size = points.size();\n if ( size <= 2 )\n {\n reset();\n return false;\n }\n\n d_data->points = points;\n\n d_data->a.resize( size - 1 );\n d_data->b.resize( size - 1 );\n d_data->c.resize( size - 1 );\n\n bool ok;\n if ( d_data->splineType == Periodic )\n ok = buildPeriodicSpline( points );\n else\n ok = buildNaturalSpline( points );\n\n if ( !ok )\n reset();\n\n return ok;\n}\n\nQPolygonF QwtSpline::points() const\n{\n return d_data->points;\n}\n\nconst QVector<double> &QwtSpline::coefficientsA() const\n{\n return d_data->a;\n}\n\nconst QVector<double> &QwtSpline::coefficientsB() const\n{\n return d_data->b;\n}\n\nconst QVector<double> &QwtSpline::coefficientsC() const\n{\n return d_data->c;\n}\n\nvoid QwtSpline::reset()\n{\n d_data->a.resize( 0 );\n d_data->b.resize( 0 );\n d_data->c.resize( 0 );\n d_data->points.resize( 0 );\n}\n\nbool QwtSpline::isValid() const\n{\n return d_data->a.size() > 0;\n}\n\ndouble QwtSpline::value( double x ) const\n{\n if ( d_data->a.size() == 0 )\n return 0.0;\n\n const int i = lookup( x, d_data->points );\n\n const double delta = x - d_data->points[i].x();\n return( ( ( ( d_data->a[i] * delta ) + d_data->b[i] )\n * delta + d_data->c[i] ) * delta + d_data->points[i].y() );\n}\n\nbool QwtSpline::buildNaturalSpline( const QPolygonF &points )\n{\n int i;\n\n const QPointF *p = points.data();\n const int size = points.size();\n\n double *a = d_data->a.data();\n double *b = d_data->b.data();\n double *c = d_data->c.data();\n\n \n \n QVector<double> h( size - 1 );\n for ( i = 0; i < size - 1; i++ )\n {\n h[i] = p[i+1].x() - p[i].x();\n if ( h[i] <= 0 )\n return false;\n }\n\n QVector<double> d( size - 1 );\n double dy1 = ( p[1].y() - p[0].y() ) / h[0];\n for ( i = 1; i < size - 1; i++ )\n {\n b[i] = c[i] = h[i];\n a[i] = 2.0 * ( h[i-1] + h[i] );\n\n const double dy2 = ( p[i+1].y() - p[i].y() ) / h[i];\n d[i] = 6.0 * ( dy1 - dy2 );\n dy1 = dy2;\n }\n\n \n \n \n\n \n for ( i = 1; i < size - 2; i++ )\n {\n c[i] /= a[i];\n a[i+1] -= b[i] * c[i];\n }\n\n \n QVector<double> s( size );\n s[1] = d[1];\n for ( i = 2; i < size - 1; i++ )\n s[i] = d[i] - c[i-1] * s[i-1];\n\n \n s[size - 2] = - s[size - 2] / a[size - 2];\n for ( i = size - 3; i > 0; i-- )\n s[i] = - ( s[i] + b[i] * s[i+1] ) / a[i];\n s[size - 1] = s[0] = 0.0;\n\n \n \n \n for ( i = 0; i < size - 1; i++ )\n {\n a[i] = ( s[i+1] - s[i] ) / ( 6.0 * h[i] );\n b[i] = 0.5 * s[i];\n c[i] = ( p[i+1].y() - p[i].y() ) / h[i]\n - ( s[i+1] + 2.0 * s[i] ) * h[i] / 6.0;\n }\n\n return true;\n}\n\nbool QwtSpline::buildPeriodicSpline( const QPolygonF &points )\n{\n int i;\n\n const QPointF *p = points.data();\n const int size = points.size();\n\n double *a = d_data->a.data();\n double *b = d_data->b.data();\n double *c = d_data->c.data();\n\n QVector<double> d( size - 1 );\n QVector<double> h( size - 1 );\n QVector<double> s( size );\n\n \n \n \n \n for ( i = 0; i < size - 1; i++ )\n {\n h[i] = p[i+1].x() - p[i].x();\n if ( h[i] <= 0.0 )\n return false;\n }\n\n const int imax = size - 2;\n double htmp = h[imax];\n double dy1 = ( p[0].y() - p[imax].y() ) / htmp;\n for ( i = 0; i <= imax; i++ )\n {\n b[i] = c[i] = h[i];\n a[i] = 2.0 * ( htmp + h[i] );\n const double dy2 = ( p[i+1].y() - p[i].y() ) / h[i];\n d[i] = 6.0 * ( dy1 - dy2 );\n dy1 = dy2;\n htmp = h[i];\n }\n\n \n \n \n\n \n a[0] = qSqrt( a[0] );\n c[0] = h[imax] / a[0];\n double sum = 0;\n\n for ( i = 0; i < imax - 1; i++ )\n {\n b[i] /= a[i];\n if ( i > 0 )\n c[i] = - c[i-1] * b[i-1] / a[i];\n a[i+1] = qSqrt( a[i+1] - qwtSqr( b[i] ) );\n sum += qwtSqr( c[i] );\n }\n b[imax-1] = ( b[imax-1] - c[imax-2] * b[imax-2] ) / a[imax-1];\n a[imax] = qSqrt( a[imax] - qwtSqr( b[imax-1] ) - sum );\n\n \n s[0] = d[0] / a[0];\n sum = 0;\n for ( i = 1; i < imax; i++ )\n {\n s[i] = ( d[i] - b[i-1] * s[i-1] ) / a[i];\n sum += c[i-1] * s[i-1];\n }\n s[imax] = ( d[imax] - b[imax-1] * s[imax-1] - sum ) / a[imax];\n\n \n s[imax] = - s[imax] / a[imax];\n s[imax-1] = -( s[imax-1] + b[imax-1] * s[imax] ) / a[imax-1];\n for ( i = imax - 2; i >= 0; i-- )\n s[i] = - ( s[i] + b[i] * s[i+1] + c[i] * s[imax] ) / a[i];\n\n \n \n \n s[size-1] = s[0];\n for ( i = 0; i < size - 1; i++ )\n {\n a[i] = ( s[i+1] - s[i] ) / ( 6.0 * h[i] );\n b[i] = 0.5 * s[i];\n c[i] = ( p[i+1].y() - p[i].y() )\n / h[i] - ( s[i+1] + 2.0 * s[i] ) * h[i] / 6.0;\n }\n\n return true;\n}\n"},"prefix":{"kind":"string","value":"\n#include \"precomp.h\"\n#include \"qwt_spline.h\"\n#include \"qwt_math.h\"\n\nclass QwtSpline::PrivateData\n{\npublic:\n PrivateData():\n splineType( QwtSpline::Natural )\n {\n }\n\n QwtSpline::SplineType splineType;\n\n \n QVector<double> a;\n QVector<double> b;\n QVector<double> c;\n\n \n QPolygonF points;\n};\n\nstatic int lookup( double x, const QPolygonF &values )\n{\n#if 0\n\n#endif\n int i1;\n const int size = values.size();\n\n if ( x <= values[0].x() )\n i1 = 0;\n else if ( x >= values[size - 2].x() )\n i1 = size - 2;\n else\n {\n "},"suffix":{"kind":"string","value":"\n\nQwtSpline::QwtSpline()\n{\n d_data = new PrivateData;\n}\n\nQwtSpline::QwtSpline( const QwtSpline& other )\n{\n d_data = new PrivateData( *other.d_data );\n}\n\nQwtSpline &QwtSpline::operator=( const QwtSpline & other )\n{\n *d_data = *other.d_data;\n return *this;\n}\n\nQwtSpline::~QwtSpline()\n{\n delete d_data;\n}\n\nvoid QwtSpline::setSplineType( SplineType splineType )\n{\n d_data->splineType = splineType;\n}\n\nQwtSpline::SplineType QwtSpline::splineType() const\n{\n return d_data->splineType;\n}\n\nbool QwtSpline::setPoints( const QPolygonF& points )\n{\n const int size = points.size();\n if ( size <= 2 )\n {\n reset();\n return false;\n }\n\n d_data->points = points;\n\n d_data->a.resize( size - 1 );\n d_data->b.resize( size - 1 );\n d_data->c.resize( size - 1 );\n\n bool ok;\n if ( d_data->splineType == Periodic )\n ok = buildPeriodicSpline( points );\n else\n ok = buildNaturalSpline( points );\n\n if ( !ok )\n reset();\n\n return ok;\n}\n\nQPolygonF QwtSpline::points() const\n{\n return d_data->points;\n}\n\nconst QVector<double> &QwtSpline::coefficientsA() const\n{\n return d_data->a;\n}\n\nconst QVector<double> &QwtSpline::coefficientsB() const\n{\n return d_data->b;\n}\n\nconst QVector<double> &QwtSpline::coefficientsC() const\n{\n return d_data->c;\n}\n\nvoid QwtSpline::reset()\n{\n d_data->a.resize( 0 );\n d_data->b.resize( 0 );\n d_data->c.resize( 0 );\n d_data->points.resize( 0 );\n}\n\nbool QwtSpline::isValid() const\n{\n return d_data->a.size() > 0;\n}\n\ndouble QwtSpline::value( double x ) const\n{\n if ( d_data->a.size() == 0 )\n return 0.0;\n\n const int i = lookup( x, d_data->points );\n\n const double delta = x - d_data->points[i].x();\n return( ( ( ( d_data->a[i] * delta ) + d_data->b[i] )\n * delta + d_data->c[i] ) * delta + d_data->points[i].y() );\n}\n\nbool QwtSpline::buildNaturalSpline( const QPolygonF &points )\n{\n int i;\n\n const QPointF *p = points.data();\n const int size = points.size();\n\n double *a = d_data->a.data();\n double *b = d_data->b.data();\n double *c = d_data->c.data();\n\n \n \n QVector<double> h( size - 1 );\n for ( i = 0; i < size - 1; i++ )\n {\n h[i] = p[i+1].x() - p[i].x();\n if ( h[i] <= 0 )\n return false;\n }\n\n QVector<double> d( size - 1 );\n double dy1 = ( p[1].y() - p[0].y() ) / h[0];\n for ( i = 1; i < size - 1; i++ )\n {\n b[i] = c[i] = h[i];\n a[i] = 2.0 * ( h[i-1] + h[i] );\n\n const double dy2 = ( p[i+1].y() - p[i].y() ) / h[i];\n d[i] = 6.0 * ( dy1 - dy2 );\n dy1 = dy2;\n }\n\n \n \n \n\n \n for ( i = 1; i < size - 2; i++ )\n {\n c[i] /= a[i];\n a[i+1] -= b[i] * c[i];\n }\n\n \n QVector<double> s( size );\n s[1] = d[1];\n for ( i = 2; i < size - 1; i++ )\n s[i] = d[i] - c[i-1] * s[i-1];\n\n \n s[size - 2] = - s[size - 2] / a[size - 2];\n for ( i = size - 3; i > 0; i-- )\n s[i] = - ( s[i] + b[i] * s[i+1] ) / a[i];\n s[size - 1] = s[0] = 0.0;\n\n \n \n \n for ( i = 0; i < size - 1; i++ )\n {\n a[i] = ( s[i+1] - s[i] ) / ( 6.0 * h[i] );\n b[i] = 0.5 * s[i];\n c[i] = ( p[i+1].y() - p[i].y() ) / h[i]\n - ( s[i+1] + 2.0 * s[i] ) * h[i] / 6.0;\n }\n\n return true;\n}\n\nbool QwtSpline::buildPeriodicSpline( const QPolygonF &points )\n{\n int i;\n\n const QPointF *p = points.data();\n const int size = points.size();\n\n double *a = d_data->a.data();\n double *b = d_data->b.data();\n double *c = d_data->c.data();\n\n QVector<double> d( size - 1 );\n QVector<double> h( size - 1 );\n QVector<double> s( size );\n\n \n \n \n \n for ( i = 0; i < size - 1; i++ )\n {\n h[i] = p[i+1].x() - p[i].x();\n if ( h[i] <= 0.0 )\n return false;\n }\n\n const int imax = size - 2;\n double htmp = h[imax];\n double dy1 = ( p[0].y() - p[imax].y() ) / htmp;\n for ( i = 0; i <= imax; i++ )\n {\n b[i] = c[i] = h[i];\n a[i] = 2.0 * ( htmp + h[i] );\n const double dy2 = ( p[i+1].y() - p[i].y() ) / h[i];\n d[i] = 6.0 * ( dy1 - dy2 );\n dy1 = dy2;\n htmp = h[i];\n }\n\n \n \n \n\n \n a[0] = qSqrt( a[0] );\n c[0] = h[imax] / a[0];\n double sum = 0;\n\n for ( i = 0; i < imax - 1; i++ )\n {\n b[i] /= a[i];\n if ( i > 0 )\n c[i] = - c[i-1] * b[i-1] / a[i];\n a[i+1] = qSqrt( a[i+1] - qwtSqr( b[i] ) );\n sum += qwtSqr( c[i] );\n }\n b[imax-1] = ( b[imax-1] - c[imax-2] * b[imax-2] ) / a[imax-1];\n a[imax] = qSqrt( a[imax] - qwtSqr( b[imax-1] ) - sum );\n\n \n s[0] = d[0] / a[0];\n sum = 0;\n for ( i = 1; i < imax; i++ )\n {\n s[i] = ( d[i] - b[i-1] * s[i-1] ) / a[i];\n sum += c[i-1] * s[i-1];\n }\n s[imax] = ( d[imax] - b[imax-1] * s[imax-1] - sum ) / a[imax];\n\n \n s[imax] = - s[imax] / a[imax];\n s[imax-1] = -( s[imax-1] + b[imax-1] * s[imax] ) / a[imax-1];\n for ( i = imax - 2; i >= 0; i-- )\n s[i] = - ( s[i] + b[i] * s[i+1] + c[i] * s[imax] ) / a[i];\n\n \n \n \n s[size-1] = s[0];\n for ( i = 0; i < size - 1; i++ )\n {\n a[i] = ( s[i+1] - s[i] ) / ( 6.0 * h[i] );\n b[i] = 0.5 * s[i];\n c[i] = ( p[i+1].y() - p[i].y() )\n / h[i] - ( s[i+1] + 2.0 * s[i] ) * h[i] / 6.0;\n }\n\n return true;\n}\n"},"middle":{"kind":"string","value":"i1 = 0;\n int i2 = size - 2;\n int i3 = 0;\n\n while ( i2 - i1 > 1 )\n {\n i3 = i1 + ( ( i2 - i1 ) >> 1 );\n\n if ( values[i3].x() > x )\n i2 = i3;\n else\n i1 = i3;\n }\n }\n return i1;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"class BCGCBPRODLLEXPORT CBCGPPointsArray : public CArray<CBCGPPoint, const CBCGPPoint&>\n\n{\n\npublic:\n\n\tCBCGPPointsArray() {}\n\n\tCBCGPPointsArray(int nNewSize, int nGrowBy = -1)\n\n\t{\n\n\t\tSetSize(nNewSize, nGrowBy);\n\n\t}\n\n\n\n\t~CBCGPPointsArray() {}\n\n\n\n\tCBCGPRect GetBoundsRect() const;\n\n\tCBCGPPoint GetBoundsCenter() const\n\n\t{\n\n\t\treturn GetBoundsRect ().CenterPoint ();\n\n\t}\n\n\n\n\tvoid StoreBoundsRect(const CBCGPRect& rect) {m_rectBounds = rect;}\n\n\n\n\tvoid Multiply(double value)\n","file_path":"Src/VC/bcgcbpro/BCGPGraphicsManager.h","rank":0,"score":368564.94461664476},{"content":"// This class provides access to the information contained in an HTTP request submitted to a web server.\n\n//\n\n// CHttpRequest provides access to the query string parameters, form fields, cookies, and files\n\n// that make up an HTTP request, as well as many other important properties of the request.\n\nclass CHttpRequest : public IHttpRequestLookup\n\n{\n\nprotected:\n\n\t// Implementation: Array used to map an HTTP request method (for example, \"GET\" or \"POST\")\n\n\t// from a string to a numeric constant from the HTTP_METHOD enum (HTTP_METHOD_GET or HTTP_METHOD_HEAD).\n\n\tstatic const char* const m_szMethodStrings[];\n\n\n\n\t// Implementation: The server context.\n\n\tCComPtr<IHttpServerContext> m_spServerContext;\n\n\n\n\t// Implementation: The number of bytes read from the body of the request.\n\n\tDWORD m_dwBytesRead;\n\n\n\n\t// Implementation: TRUE if the request method was POST and the encoding was\n\n\t// multipart/form-data, FALSE otherwise.\n\n\tBOOL m_bMultiPart;\n\n\n\n\tCCookie m_EmptyCookie;\n\n\n\n\t// Implementation: Constructor function used to reinitialize all data members.\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":1,"score":368382.38445469784},{"content":"//\n\n//CPerfStatClass\n\n// Description\n\n// This class provides the implementation of a cache statistics gathering class\n\n// with PerfMon support\n\nclass CPerfStatClass : public CStdStatClass\n\n{\n\n\tCPerfStatObject * m_pPerfObject;\n\n\tCCachePerfMon m_PerfMon;\n\n\n\npublic:\n\n\n\n\tHRESULT Initialize(__in_z_opt LPWSTR szName=NULL)\n\n\t{\n\n\t\tHRESULT hr;\n\n\t\tWCHAR szPath[MAX_PATH];\n\n\n\n\t\tif (!szName)\n\n\t\t{\n\n\t\t\t// default name is the name of the module\n\n\t\t\t// we don't care about possible truncation if longer than max_path\n\n\t\t\t// we just need an identifier\n\n\t\t\tHINSTANCE hInst = _AtlBaseModule.GetModuleInstance();\n\n\t\t\tif (::GetModuleFileNameW(hInst, szPath, MAX_PATH) == 0)\n\n\t\t\t{\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":2,"score":343471.37192045397},{"content":"class BCGCBPRODLLEXPORT CBCGPStatic : public CStatic\n\n{\n\n\tDECLARE_DYNAMIC(CBCGPStatic)\n\n\n\n// Construction\n\npublic:\n\n\tCBCGPStatic();\n\n\n\n// Attributes\n\npublic:\n\n\tBOOL\t\tm_bOnGlass;\n\n\tBOOL\t\tm_bVisualManagerStyle;\n\n\tBOOL\t\tm_bBackstageMode;\n\n\tCOLORREF\tm_clrText;\n\n\tHFONT\t\tm_hFont;\n\n\n\n// Operations\n\npublic:\n\n\n\n// Overrides\n","file_path":"Src/VC/bcgcbpro/BCGPStatic.h","rank":3,"score":333519.84909499175},{"content":"class CHtmlStencil : public CStencil\n\n{\n\nprivate:\n\n\n\n\tATL_NOINLINE HTTP_CODE RenderInclude(\n\n\t\tITagReplacer *pReplacer, \n\n\t\tconst StencilToken *pToken, \n\n\t\tIWriteStream *pWriteStream, \n\n\t\tCStencilState *pState) const\n\n\t{\n\n\t\tATLASSUME(m_spServiceProvider);\n\n\t\tCComPtr<IHttpServerContext> spServerContext;\n\n\t\tCComPtr<IHttpRequestLookup> spLookup;\n\n\t\tif (FAILED(pReplacer->GetContext(__uuidof(IHttpServerContext), (VOID**) &spServerContext)))\n\n\t\t{\n\n\t\t\treturn AtlsHttpError(500, 0);\n\n\t\t}\n\n\t\tif (FAILED(pReplacer->GetContext(__uuidof(IHttpRequestLookup), (VOID**) &spLookup)))\n\n\t\t{\n\n\t\t\treturn AtlsHttpError(500, 0);\n","file_path":"Src/VC/atlserver/include/atlstencil.h","rank":4,"score":332182.75735660584},{"content":"class CSessionCookie : public CCookie\n\n{\n\npublic:\n\n\tCSessionCookie() throw(...)\n\n\t{\n\n\t\tif (!SetName(SESSION_COOKIE_NAME) ||\n\n\t\t\t!SetPath(\"/\"))\n\n\t\t\tAtlThrow(E_OUTOFMEMORY);\n\n\t}\n\n\n\n\tCSessionCookie(LPCSTR szSessionID) throw(...)\n\n\t{\n\n\t\tif (!SetName(SESSION_COOKIE_NAME) ||\n\n\t\t\t!SetPath(\"/\") ||\n\n\t\t\t!SetSessionID(szSessionID) )\n\n\t\t\tAtlThrow(E_OUTOFMEMORY);\n\n\t}\n\n\n\n\tBOOL SetSessionID(LPCSTR szSessionID) throw()\n\n\t{\n\n\t\tATLASSERT(szSessionID && szSessionID[0]);\n\n\t\treturn SetValue(szSessionID);\n\n\t}\n\n}; // class CSessionCookie\n\n\n\ntemplate<>\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":5,"score":332182.75735660584},{"content":"// This class represents the response that the web server will send back to the client.\n\n//\n\n// CHttpResponse provides friendly functions for building up the headers, cookies, and body of an HTTP response.\n\n// The class derives from IWriteStream and CWriteStreamHelper, allowing you to call those classes' methods\n\n// to build up the body of the response. By default, the class improves performance by buffering the response until it is complete before sending it back to the client.\n\nclass CHttpResponse : public IWriteStream, public CWriteStreamHelper\n\n{\n\nprivate:\n\n\n\n\t// Implementation: A map of HTTP response headers.\n\n\t// The key is the name of the response header.\n\n\t// The value is the data for the response header.\n\n\tCSimpleMap<CStringA, CStringA> m_headers;\n\n\n\n\t// Implementation: Determines whether the response is currently being buffered.\n\n\tBOOL m_bBufferOutput;\n\n\n\n\t// Implementation: Determines whether any output should be sent to the client.\n\n\t// Intended mainly for HEAD requests, where the client should get the same headers\n\n\t// (i.e. Content-Length) as for a GET request\n\n\tBOOL m_bSendOutput;\n\n\n\n\t// Implementation: The limit in bytes of the response buffer.\n\n\t// When the limit is reached, the buffer is automatically flushed\n\n\t// and data is sent to the client. You can set this to ULONG_MAX\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":6,"score":328227.9365329944},{"content":"// CMimeMessage - the MIME message class. Represents a full MIME message\n\nclass CMimeMessage : public CMimeHeader\n\n{\n\nprotected:\n\n\n\n\t// The list of the MIME body parts\n\n\tCAutoPtrList<CMimeBodyPart> m_BodyParts;\n\n\n\n\t// The display name of the message\n\n\tchar m_szDisplayName[MAX_PATH+1];\n\n\n\npublic:\n\n\tCMimeMessage(IMultiLanguage *pMultiLanguage = NULL) throw()\n\n\t{\n\n\t\tInitialize(pMultiLanguage);\n\n\t\tChecked::memcpy_s(m_szDisplayName, MAX_PATH+1, ATLMIME_EMAIL, sizeof(ATLMIME_EMAIL));\n\n\t}\n\n\n\n\tvirtual ~CMimeMessage() throw()\n\n\t{\n\n\t\tRemoveParts();\n","file_path":"Src/VC/atlserver/include/atlmime.h","rank":7,"score":327105.07518547366},{"content":"class CLifetimeCuller : public CExpireCuller\n\n{\n\npublic:\n\n\tvoid Add(CCullerCacheData * pItem)\n\n\t{\n\n\t\tATLENSURE(pItem);\n\n\t\tpItem->nLifespan = 0;\n\n\t\tCExpireCuller::Add(pItem);\n\n\t}\n\n\n\n\tvoid Commit(CCullerCacheData * pItem)\n\n\t{ \n\n\t\tATLENSURE(pItem);\n\n\t\tif (pItem->nLifespan == 0)\n\n\t\t\tpItem->cftExpireTime = 0;\n\n\t\telse\n\n\t\t\tpItem->cftExpireTime = CFileTime(CFileTime::GetCurrentTime().GetTime() + pItem->nLifespan);\n\n\t\tCExpireCuller::Commit(pItem);\n\n\t}\n\n\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":8,"score":327090.53787240916},{"content":"// CMimeAttachment is an abstract base class for MIME message attachments.\n\n// It serves as a base class for CMimeFileAttachment and CMimeRawAttachment\n\nclass CMimeAttachment : public CMimeBodyPart\n\n{\n\nprotected:\n\n\n\n\t// the encoding scheme (ATLSMTP_BASE64_ENCODE, ATLSMTP_UUENCODE, ATLSMTP_QP_ENCODE)\n\n\tint m_nEncodingScheme;\n\n\n\n\t// the content type of the attachment\n\n\tCStringA m_ContentType;\n\n\n\n\t// the character set\n\n\tchar m_szCharset[ATL_MAX_ENC_CHARSET_LENGTH];\n\n\n\n\t// the encode string (\"base64\", \"quoted-printable\", \"uuencode\")\n\n\tchar *m_pszEncodeString;\n\n\n\n\t// the display name of the attachment\n\n\tTCHAR m_szDisplayName[_MAX_FNAME];\n\n\n\npublic:\n","file_path":"Src/VC/atlserver/include/atlmime.h","rank":9,"score":322220.881920272},{"content":"// CMimeHeader describes the basic RFC 822 message header.\n\n// It also serves as the base class for the CMimeMessage object.\n\nclass CMimeHeader : public CMimeBodyPart\n\n{\n\nprotected:\n\n\n\n\t// Pointer to MLANG's IMultiLanguage interface.\n\n\t// This is used in doing conversion from code pages\n\n\t// to MIME-compatible character sets.\n\n\tCComPtr<IMultiLanguage> m_spMultiLanguage;\n\n\n\n\t//Basic Header Parts\n\n\tCStringA m_strFrom;\n\n\tCStringA m_strTo;\n\n\tCStringA m_strCc;\n\n\tCStringA m_strBcc;\n\n\tCStringA m_strSubject;\n\n\n\n\t//Extended Header Parts\n\n\tATL_MIME_PRIORITY m_nPriority;\n\n\tCStringA m_XHeader;\n\n\n","file_path":"Src/VC/atlserver/include/atlmime.h","rank":10,"score":322219.1871838087},{"content":"// class CCryptMD2Hash\n\n// RSA's MD2 hash\n\nclass CCryptMD2Hash : public CCryptHash\n\n{\n\npublic:\n\n\n\n\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptMD2Hash\n\n\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":11,"score":322218.8116072236},{"content":"// class CCryptMD4Hash\n\n// RSA's MD4 hash\n\nclass CCryptMD4Hash : public CCryptHash\n\n{\n\npublic:\n\n\n\n\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptMD4Hash\n\n\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":12,"score":322218.8116072236},{"content":"// class CCryptImportKey\n\n// Forms a key from an imported key blob\n\nclass CCryptImportKey : public CCryptKey\n\n{\n\npublic:\n\n\tHRESULT Initialize(\n\n\t\tCCryptProv &Prov,\n\n\t\tBYTE * pbData,\n\n\t\tDWORD dwDataLen,\n\n\t\tCCryptKey &PubKey,\n\n\t\tDWORD dwFlags) throw();\n\n}; // class CCryptImportKey\n\n\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":13,"score":322218.5569306549},{"content":"// class CCryptHash\n\n// A generic hash that may or may not take a key. \n\nclass CCryptKeyedHash : public CCryptHash\n\n{\n\npublic:\n\n\n\n\tHRESULT Initialize(CCryptProv &Prov, ALG_ID Algid, CCryptKey &Key, DWORD dwFlags) throw();\n\n}; // class CCryptKeyedHash\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":14,"score":322218.5569306549},{"content":"// class CCryptMD5Hash\n\n// RSA's MD5 hash (RSA's most recent hash as of 9/7/99);\n\nclass CCryptMD5Hash : public CCryptHash\n\n{\n\npublic:\n\n\n\n\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptMD5Hash\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":15,"score":322218.4328529139},{"content":"// class CCryptSSL3SHAMD5Hash\n\n// Hash algorithm used by Secure Socket Layer\n\nclass CCryptSSL3SHAMD5Hash : public CCryptHash\n\n{\n\npublic:\n\n\tHRESULT Initialize(CCryptProv &Prov, CCryptKey &Key, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptSSl3SHAMD5Hash\n\n\n\n}; // namespace ATL\n\n \n\n\n\n#include <atlcrypt.inl>\n\n#pragma pack(pop)\n\n#endif // __ATLCRYPT_H__\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":16,"score":322218.4328529139},{"content":"// class CCryptHMACHash\n\n// Hash-base Message Authentication Code keyed hash\n\nclass CCryptHMACHash : public CCryptHash\n\n{\n\npublic:\n\n\tHRESULT Initialize(CCryptProv &Prov, CCryptKey &Key, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptHMACHash\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":17,"score":322218.31087528553},{"content":"// class CCryptSHAHash\n\n// The Secure Hash Algorithm hash, from NIST and NSA. Technically, SHA-1.\n\nclass CCryptSHAHash : public CCryptHash\n\n{\n\npublic:\n\n\n\n\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptSHAHash\n\n\n\n// The Secure Hash Algorithm, from NIST and NSA. Identical to CCryptSHA\n\ntypedef CCryptSHAHash CCryptSHA1Hash;\n\n\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":18,"score":322218.1909448982},{"content":"// class CCryptMACHash\n\n// Message Authentication Code keyed hash. Believed to be less secure than HMAC\n\nclass CCryptMACHash : public CCryptHash\n\n{\n\npublic:\n\n\tHRESULT Initialize(CCryptProv &Prov, CCryptKey &Key, LPCTSTR szText = NULL) throw();\n\n}; // class CCryptMACHash\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":19,"score":322218.0730106401},{"content":"// class CCryptDerivedKey\n\n// A key that is derived from a hashed password. Two keys derived \n\n// from the same password will be identical.\n\nclass CCryptDerivedKey : public CCryptKey\n\n{\n\npublic:\n\n\tHRESULT Initialize(\n\n\t\tCCryptProv &Prov,\n\n\t\tCCryptHash &Hash,\n\n\t\tALG_ID algid = CALG_RC4,\n\n\t\tDWORD dwFlags = CRYPT_EXPORTABLE) throw();\n\n}; // class CCryptDerivedKey\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":20,"score":322217.9570230872},{"content":"// class CCryptRandomKey\n\n// A randomly generated key. Can be used internally by a program \n\n// to protect data during execution, or can be exported with Crypt.Export\n\n//\n\n// Currently it is possible to pass in AT_KEYEXCHANGE or AT_SIGNATURE \n\n// for algid, but these two will generate keys for the current key set, and \n\n// the resulting handle can only be used for exporting and importing keys or \n\n// signing hashes.\n\nclass CCryptRandomKey : public CCryptKey\n\n{\n\npublic:\n\n\tHRESULT Initialize(\n\n\t\tCCryptProv &Prov,\n\n\t\tALG_ID algid = CALG_RC4,\n\n\t\tDWORD dwFlags = CRYPT_EXPORTABLE) throw();\n\n}; // class CCryptRandomKey\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":21,"score":322215.49463316705},{"content":"// CCachePerfMon - the interface to CPerfMon, with associated definitions\n\nclass CCachePerfMon : public CPerfMon\n\n{\n\npublic:\n\n\tBEGIN_PERF_MAP(_T(\"ATL Server:Cache\"))\n\n\t\tCHAIN_PERF_CATEGORY(CPerfStatObject)\n\n\tEND_PERF_MAP()\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":22,"score":322212.37525679986},{"content":"// CMimeText - represents a text body part in MIME body\n\nclass CMimeText : public CMimeBodyPart\n\n{\n\nprotected:\n\n\n\n\t// the text\n\n\tCHeapPtr<char> m_szText;\n\n\n\n\t// the character set\n\n\tchar m_szCharset[ATL_MAX_ENC_CHARSET_LENGTH];\n\n\n\n\t// the text length\n\n\tint m_nTextLen;\n\n\n\npublic:\n\n\tCMimeText() throw()\n\n\t\t:m_nTextLen(0)\n\n\t{\n\n\t\tChecked::strcpy_s(m_szCharset, ATL_MAX_ENC_CHARSET_LENGTH, ATLSMTP_DEFAULT_CSET);\n\n\t}\n\n\n","file_path":"Src/VC/atlserver/include/atlmime.h","rank":23,"score":322211.1962703657},{"content":"// CMimeFileAttachment represents a MIME file attachment body part\n\nclass CMimeFileAttachment : public CMimeAttachment\n\n{\n\n\n\nprotected:\n\n\t// The filename\n\n\tTCHAR m_szFileName[MAX_PATH+1];\n\n\n\npublic:\n\n\tCMimeFileAttachment() throw()\n\n\t{\n\n\t\tm_szFileName[0] = 0;\n\n\t}\n\n\n\n\tvirtual ATL_NOINLINE CMimeBodyPart* Copy() throw( ... )\n\n\t{\n\n\t\tCAutoPtr<CMimeFileAttachment> pNewAttachment;\n\n\t\tATLTRY(pNewAttachment.Attach(new CMimeFileAttachment));\n\n\t\tif (pNewAttachment)\n\n\t\t\t*pNewAttachment = *this;\n\n\n","file_path":"Src/VC/atlserver/include/atlmime.h","rank":24,"score":322211.13448945084},{"content":"// CMimeRawAttachment represents a file attachment MIME body part.\n\n// The data provided is not a file, but a blob of raw data.\n\nclass CMimeRawAttachment : public CMimeAttachment\n\n{\n\nprotected:\n\n\n\n\t//the raw data\n\n\tvoid* m_pvRaw;\n\n\n\n\t//the length\n\n\tDWORD m_dwLength;\n\n\n\n\t//whether or not we own it\n\n\tbool m_bShared;\n\n\n\npublic:\n\n\tCMimeRawAttachment() throw()\n\n\t\t:m_dwLength(0), m_bShared(false), m_pvRaw(NULL)\n\n\t{\n\n\t}\n\n\n\n\t~CMimeRawAttachment() throw()\n","file_path":"Src/VC/atlserver/include/atlmime.h","rank":25,"score":322210.7850444329},{"content":"class CWriteStreamOnCString : public IWriteStream\n\n{\n\n\n\npublic:\n\n\tCStringA m_str;\n\n\n\n\tvirtual ~CWriteStreamOnCString()\n\n\t{\n\n\t}\n\n\n\n\tHRESULT WriteStream(LPCSTR szOut, int nLen, LPDWORD pdwWritten)\n\n\t{\n\n\t\tATLENSURE_RETURN( szOut != NULL );\n\n\n\n\t\tif (nLen < 0)\n\n\t\t{\n\n\t\t\tnLen = (int) strlen(szOut);\n\n\t\t}\n\n\n\n\t\t_ATLTRY\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":26,"score":322204.01961759035},{"content":"class CHtmlGenBase : public CStreamFormatter\n\n{\n\npublic:\n\n\tT* GetOuter()\n\n\t{\n\n\t\treturn static_cast<T*>(this);\n\n\t}\n\n\n\n\tenum ATL_HTML_FORM_METHOD { ATL_HTML_FORM_METHOD_NONE=0, ATL_HTML_FORM_METHOD_GET, ATL_HTML_FORM_METHOD_POST, ATL_HTML_FORM_METHOD_MULTIPART };\n\n\n\n\tCHtmlGenBase()\n\n\t{\n\n\t\tm_nWidthPercent = -1;\n\n\t\tm_nHeightPercent = -1;\n\n\t\tm_nFormMethod = ATL_HTML_FORM_METHOD_NONE;\n\n\t\tm_pScheme = NULL;\n\n\t}\n\n\n\n\tvoid SetScheme(HTML_SCHEME *pScheme)\n\n\t{\n","file_path":"Src/VC/atlserver/include/atlhtml.h","rank":27,"score":322204.01961759035},{"content":"class CRequestPerfMon : public CPerfMon\n\n{\n\npublic:\n\n\tBEGIN_PERF_MAP(_T(\"ATL Server:Request\"))\n\n\t\tCHAIN_PERF_CATEGORY(CPerfRequestStatObject)\n\n\tEND_PERF_MAP()\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":28,"score":322204.01961759035},{"content":"class CStdRequestStats : public CRequestStats\n\n{\n\n\n\npublic:\n\n\tHRESULT Initialize() throw()\n\n\t{\n\n\t\treturn S_OK;\n\n\t}\n\n\n\n\tvoid Uninitialize() throw()\n\n\t{\n\n\t}\n\n};\n\n\n\n#define PERF_REQUEST_OBJECT 100\n\n \n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":29,"score":322204.01961759035},{"content":"class CFixedLifetimeCuller : public CExpireCuller\n\n{\n\npublic:\n\n\tvoid Commit(CCullerCacheData * pItem)\n\n\t{\n\n\t\tATLASSERT(pItem);\n\n\t\t__int64 nLifeSpan = ftLifespan;\n\n\t\tif (nLifeSpan == 0)\n\n\t\t\tpItem->cftExpireTime = 0;\n\n\t\telse\n\n\t\t\tpItem->cftExpireTime = CFileTime::GetCurrentTime() + CFileTimeSpan(ftLifespan);\n\n\n\n\t\tCExpireCuller::Commit(pItem);\n\n\t}\n\n\n\n\tvoid Access(CCullerCacheData * pItem)\n\n\t{\n\n\t\tATLASSERT(pItem);\n\n\t\tCExpireCuller::Remove(pItem);\n\n\t\tCommit(pItem);\n\n\t}\n\n\n\n\tCCullerCacheData * GetExpired() \n\n\t{ \n\n\t\treturn static_cast<CCullerCacheData *>(CExpireCuller::GetExpired());\n\n\t}\n\n};\n\n\n\n\n\ntemplate <class CFirst, class CSecond>\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":30,"score":322204.01961759035},{"content":"\tclass CRpcEncodedGenerator : public CResponseGenerator\n\n\t{\n\n\tpublic:\n\n\n\n\t\tHRESULT StartBody(IWriteStream *pStream)\n\n\t\t{\n\n\t\t\tATLENSURE_RETURN( pStream != NULL );\n\n\n\n\t\t\treturn pStream->WriteStream(\n\n\t\t\t\t\"<soap:Body soap:encodingStyle=\\\"\" SOAPENC_NAMESPACEA \"\\\">\", \n\n\t\t\t\tsizeof(\"<soap:Body soap:encodingStyle=\\\"\" SOAPENC_NAMESPACEA \"\\\">\")-1, NULL);\n\n\t\t}\n\n\n\n\t\tHRESULT StartMap(IWriteStream *pStream, const _soapmap *pMap, bool bClient)\n\n\t\t{\n\n\t\t\tATLENSURE_RETURN( pStream != NULL );\n\n\t\t\tATLENSURE_RETURN( pMap != NULL );\n\n\n\n\t\t\t(bClient); // unused for rpc/encoded\n\n\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":31,"score":322204.01961759035},{"content":"\tclass CDocLiteralGenerator : public CResponseGenerator\n\n\t{\n\n\tpublic:\n\n\n\n\t\tHRESULT StartMap(IWriteStream *pStream, const _soapmap *pMap, bool bClient)\n\n\t\t{\n\n\t\t\tATLENSURE_RETURN( pStream != NULL );\n\n\t\t\tATLENSURE_RETURN( pMap != NULL );\n\n\n\n\t\t\tHRESULT hr = S_OK;\n\n\t\t\t// output type name\n\n\t\t\thr = pStream->WriteStream(\"<\", 1, NULL);\n\n\t\t\tif (SUCCEEDED(hr))\n\n\t\t\t{\n\n\t\t\t\thr = pStream->WriteStream(pMap->szName, pMap->cchName, NULL);\n\n\t\t\t\tif (SUCCEEDED(hr))\n\n\t\t\t\t{\n\n\t\t\t\t\tif ((pMap->mapType == SOAPMAP_FUNC) && \n\n\t\t\t\t\t\t(bClient == false) && \n\n\t\t\t\t\t\t(pMap->dwCallFlags & SOAPFLAG_PID))\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":32,"score":322204.01961759035},{"content":"// class CCryptUserSigKey\n\n// Obtains the user's signature key pair\n\nclass CCryptUserSigKey : public CCryptKey\n\n{\n\npublic:\n\n\tHRESULT Initialize(CCryptProv &Prov) throw();\n\n\tHRESULT Create(CCryptProv &Prov) throw();\n\n}; // class CCryptUserSigKey\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":33,"score":317525.11420211906},{"content":"// class CCryptUserExKey\n\n// Obtains the user's key exchange key pair.\n\nclass CCryptUserExKey : public CCryptKey\n\n{\n\npublic:\n\n\tHRESULT Initialize(CCryptProv &Prov) throw();\n\n\tHRESULT Create(CCryptProv &Prov) throw();\n\n}; // class CCryptUserExKey\n\n\n","file_path":"Src/VC/atlserver/include/atlcrypt.h","rank":34,"score":317524.9922244907},{"content":"// Use to update the value of a session variable\n\nclass CSessionDataUpdator : public CSessionDataBase\n\n{\n\npublic:\n\n\tBEGIN_PARAM_MAP(CSessionDataUpdator) \n\n\t\tSET_PARAM_TYPE(DBPARAMIO_INPUT)\n\n\t\tCOLUMN_ENTRY_LENGTH(1, m_VariableValue, m_VariableLen)\n\n\t\tCOLUMN_ENTRY(2, m_szSessionID)\n\n\t\tCOLUMN_ENTRY(3, m_VariableName)\n\n\tEND_PARAM_MAP()\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlsession.h","rank":35,"score":317518.4051406988},{"content":"// Use to select all session variables given the name of\n\n// of a session.\n\nclass CAllSessionDataSelector : public CSessionDataBase\n\n{\n\npublic:\n\n\tBEGIN_COLUMN_MAP(CAllSessionDataSelector) \n\n\t\tCOLUMN_ENTRY(1, m_szSessionID)\n\n\t\tCOLUMN_ENTRY(2, m_VariableName)\n\n\t\tCOLUMN_ENTRY_LENGTH(3, m_VariableValue, m_VariableLen)\n\n\tEND_COLUMN_MAP()\n\n\tBEGIN_PARAM_MAP(CAllSessionDataSelector) \n\n\t\tSET_PARAM_TYPE(DBPARAMIO_INPUT)\n\n\t\tCOLUMN_ENTRY(1, m_szSessionID)\n\n\tEND_PARAM_MAP()\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlsession.h","rank":36,"score":317510.70096679556},{"content":"// Use to select a session variable given the name\n\n// of a session and the name of a variable.\n\nclass CSessionDataSelector : public CSessionDataBase\n\n{\n\npublic:\n\n\tBEGIN_COLUMN_MAP(CSessionDataSelector) \n\n\t\tCOLUMN_ENTRY(1, m_szSessionID)\n\n\t\tCOLUMN_ENTRY(2, m_VariableName)\n\n\t\tCOLUMN_ENTRY_LENGTH(3, m_VariableValue, m_VariableLen)\n\n\tEND_COLUMN_MAP()\n\n\tBEGIN_PARAM_MAP(CSessionDataSelector) \n\n\t\tSET_PARAM_TYPE(DBPARAMIO_INPUT)\n\n\t\tCOLUMN_ENTRY(1, m_szSessionID)\n\n\t\tCOLUMN_ENTRY(2, m_VariableName)\n\n\tEND_PARAM_MAP()\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlsession.h","rank":37,"score":317510.70096679556},{"content":"class CSecBuffer : public SecBuffer\n\n{\n\npublic:\n\n\tCSecBuffer() throw()\n\n\t{\n\n\t\tcbBuffer = 0;\n\n\t\tBufferType = 0;\n\n\t\tpvBuffer = NULL;\n\n\t\tm_cbAlloc = 0;\n\n\t}\n\n\n\n\t~CSecBuffer() throw()\n\n\t{\n\n\t\tdelete [] static_cast<unsigned char*>(pvBuffer);\n\n\t}\n\n\n\n\tbool SetSize(unsigned long nSize) throw()\n\n\t{\n\n\t\tif (!nSize)\n\n\t\t\treturn false;\n","file_path":"Src/VC/atlserver/include/atlhttp.h","rank":38,"score":315266.5866452913},{"content":"class CStreamOnWriteStream : public IStream\n\n{\n\npublic:\n\n\tIWriteStream *m_pWriteStream;\n\n\n\n\tCStreamOnWriteStream()\n\n\t{\n\n\t\tm_pWriteStream = NULL;\n\n\t}\n\n\n\n\tvoid Init(IWriteStream *pWriteStream)\n\n\t{\n\n\t\tm_pWriteStream = pWriteStream;\n\n\t}\n\n\n\n\t// IUnknown methods\n\n\tSTDMETHOD(QueryInterface)(REFIID riid, void **ppv)\n\n\t{\n\n\t\tif (!ppv)\n\n\t\t\treturn E_POINTER;\n","file_path":"Src/VC/atlserver/include/atlhtml.h","rank":39,"score":315266.5866452913},{"content":"class CDllCache : public IDllCache, \n\n\tpublic IWorkerThreadClient\n\n{\n\nprotected:\n\n\tCComCriticalSection m_critSec;\n\n\tCSimpleArray<DLL_CACHE_ENTRY> m_Dlls;\n\n\tCSimpleArray<typename Peer::DllInfo> m_DllInfos;\n\n\tMonitorClass m_Monitor;\n\n\tHANDLE m_hTimer;\n\n\n\n\tvoid RemoveDllEntry(DLL_CACHE_ENTRY& entry)\n\n\t{\n\n\t\t::FreeLibrary(entry.hInstDll);\n\n\t\tentry.hInstDll = NULL;\n\n\t\tm_Dlls.RemoveAt(m_Dlls.GetSize()-1);\n\n\t}\n\n\n\npublic:\n\n\tPeer m_Peer;\n\n\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":40,"score":315266.5866452913},{"content":"// Least recently used flusher -- the item that was accessed the longest time ago is flushed\n\nclass CLRUFlusher : public COldFlusher\n\n{\n\npublic:\n\n\t// Move it to the tail of the list\n\n\tvoid Access(CFlusherCacheData * pItem)\n\n\t{\n\n\t\tATLASSERT(pItem);\n\n\n\n\t\tRemove(pItem);\n\n\t\tAdd(pItem);\n\n\t}\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":41,"score":315266.5866452913},{"content":"// Least often used flusher\n\nclass CLOUFlusher : public COldFlusher\n\n{\n\npublic:\n\n\t// Adds to the tail of the list\n\n\tvoid Add(CFlusherCacheData * pItem)\n\n\t{\n\n\t\tATLENSURE(pItem);\n\n\t\tpItem->dwAccessed = 1;\n\n\t\tCOldFlusher::Add(pItem);\n\n\t}\n\n\n\n\tvoid Access(CFlusherCacheData * pItem)\n\n\t{\n\n\t\tATLENSURE(pItem);\n\n\t\tpItem->dwAccessed++;\n\n\n\n\t\tCFlusherCacheData * pMark = static_cast<CFlusherCacheData *>(pItem->pPrev);\n\n\t\tif (!pMark) // The item is already at the head\n\n\t\t\treturn;\n\n\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":42,"score":315266.5866452913},{"content":"class CHtmlGen : public CHtmlGenBase<CHtmlGen>\n\n{\n\npublic:\n\n};\n\n\n\n} // namespace ATL\n\n#pragma pack(pop)\n\n\n\n#endif // __ATLHTML_H__\n","file_path":"Src/VC/atlserver/include/atlhtml.h","rank":43,"score":310578.643491805},{"content":"\tclass CBrowserCaps : public IBrowserCaps, public CComObjectRootEx<CComSingleThreadModel>\n\n\t{\n\n\tpublic:\n\n\n\n\t\tBEGIN_COM_MAP(CBrowserCaps)\n\n\t\t\tCOM_INTERFACE_ENTRY(IBrowserCaps)\n\n\t\tEND_COM_MAP()\n\n\n\n\t\tCBrowserCaps()\n\n\t\t{\n\n\t\t}\n\n\n\n\t\tHRESULT Initialize(__in CBrowserCapsSvc::BrowserCaps * pCaps)\n\n\t\t{\n\n\t\t\tm_pCaps = pCaps;\n\n\t\t\treturn S_OK;\n\n\t\t}\n\n\n\n\t\t__checkReturn HRESULT GetPropertyString(__in BSTR bstrProperty, __out BSTR * pbstrOut)\n\n\t\t{\n","file_path":"Src/VC/atlserver/include/atlsiface.h","rank":44,"score":310292.780393124},{"content":"// This class represents the information about a file that has been uploaded to the web server.\n\nclass CHttpRequestFile : public IHttpFile\n\n{\n\nprivate:\n\n\n\n\t// The name of the form field used to upload the file.\n\n\tCHAR m_szParamName[MAX_TOKEN_LENGTH];\n\n\n\n\t// The original file name of the uploaded file as set by the client.\n\n\tCHAR m_szFileName[MAX_PATH];\n\n\n\n\t// The original path and file name of the uploaded file as set by the client.\n\n\tCHAR m_szFullFileName[MAX_PATH];\n\n\n\n\t// The MIME type of the uploaded file.\n\n\tCHAR m_szContentType[MAX_TOKEN_LENGTH];\n\n\n\n\t// The name of the uploaded file on the server.\n\n\tCHAR m_szTempFileName[MAX_PATH];\n\n\n\n\t// The size of the file in bytes.\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":45,"score":309955.6746761324},{"content":"class CStreamOnServerContext : public IStreamImpl\n\n{\n\npublic:\n\n\n\n\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\n\n\t{\n\n\t\tif (ppv == NULL)\n\n\t\t{\n\n\t\t\treturn E_POINTER;\n\n\t\t}\n\n\n\n\t\t*ppv = NULL;\n\n\n\n\t\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_IStream) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_ISequentialStream))\n\n\t\t{\n\n\t\t\t*ppv = static_cast<IStream *>(this);\n\n\t\t\treturn S_OK;\n\n\t\t}\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":46,"score":309948.0554627043},{"content":"\tclass CPADGenerator : public CDocLiteralGenerator\n\n\t{\n\n\tpublic:\n\n\n\n\t\tvirtual HRESULT StartEntry(IWriteStream *pStream, const _soapmap *pMap, const _soapmapentry *pEntry)\n\n\t\t{\n\n\t\t\tATLENSURE_RETURN( pStream != NULL );\n\n\t\t\tATLENSURE_RETURN( pEntry != NULL );\n\n\n\n\t\t\tHRESULT hr = __super::StartEntry(pStream, pMap, pEntry);\n\n\t\t\tif (SUCCEEDED(hr) && (pMap->dwCallFlags & SOAPFLAG_PAD))\n\n\t\t\t{\n\n\t\t\t\thr = pStream->WriteStream(\" xmlns=\\\"\", sizeof(\" xmlns=\\\"\")-1, NULL);\n\n\t\t\t\tif (SUCCEEDED(hr))\n\n\t\t\t\t{\n\n\t\t\t\t\thr = pStream->WriteStream(pMap->szNamespace, pMap->cchNamespace, NULL);\n\n\t\t\t\t\tif (SUCCEEDED(hr))\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\thr = pStream->WriteStream(\"\\\"\", sizeof(\"\\\"\")-1, NULL);\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\n\t\t\treturn hr;\n\n\t\t}\n\n\t}; // class CPADGenerator\n\n\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":47,"score":309948.0554627043},{"content":"\tclass CPIDGenerator : public CDocLiteralGenerator\n\n\t{\n\n\t};\n\n\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":48,"score":309948.0554627043},{"content":"class _CComObjectHeapNoLock : public Base\n\n{\n\n\tpublic:\n\n\ttypedef Base _BaseClass;\n\n\tHANDLE m_hHeap;\n\n\n\n\t_CComObjectHeapNoLock(void* = NULL, HANDLE hHeap = NULL)\n\n\t{\n\n\t\tm_hHeap = hHeap;\n\n\t}\n\n\t// Set refcount to -(LONG_MAX/2) to protect destruction and \n\n\t// also catch mismatched Release in debug builds\n\n\t~_CComObjectHeapNoLock()\n\n\t{\n\n\t\tm_dwRef = -(LONG_MAX/2);\n\n\t\tFinalRelease();\n\n#ifdef _ATL_DEBUG_INTERFACES\n\n\t\t_AtlDebugInterfacesModule.DeleteNonAddRefThunk(_GetRawUnknown());\n\n#endif\n\n\t}\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":49,"score":309948.0554627043},{"content":"class CReadStreamOnSocket : public IStreamImpl\n\n{\n\npublic:\n\n\n\n\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\n\n\t{\n\n\t\tif (ppv == NULL)\n\n\t\t{\n\n\t\t\treturn E_POINTER;\n\n\t\t}\n\n\n\n\t\t*ppv = NULL;\n\n\n\n\t\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_IStream) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_ISequentialStream))\n\n\t\t{\n\n\t\t\t*ppv = static_cast<IStream *>(this);\n\n\t\t\treturn S_OK;\n\n\t\t}\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":50,"score":309948.0554627043},{"content":"class CReadStreamOnInet : public IStreamImpl\n\n{\n\npublic:\n\n\n\n\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\n\n\t{\n\n\t\tif (ppv == NULL)\n\n\t\t{\n\n\t\t\treturn E_POINTER;\n\n\t\t}\n\n\n\n\t\t*ppv = NULL;\n\n\n\n\t\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_IStream) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_ISequentialStream))\n\n\t\t{\n\n\t\t\t*ppv = static_cast<IStream *>(this);\n\n\t\t\treturn S_OK;\n\n\t\t}\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":51,"score":309948.0554627043},{"content":"class CBrowserCapsSvc : public IBrowserCapsSvc, \n\n\t\t\t\t\t\tpublic CComObjectRootEx<CComSingleThreadModel>\n\n{\n\npublic:\n\n\tvirtual ~CBrowserCapsSvc()\n\n\t{\n\n\t}\n\n\t\n\n\tBEGIN_COM_MAP(CBrowserCapsSvc)\n\n\t\tCOM_INTERFACE_ENTRY(IBrowserCapsSvc)\n\n\tEND_COM_MAP()\n\n\n\n\t__success(SUCCEEDED(return)) __checkReturn HRESULT GetCaps(__in IHttpServerContext * pContext, __deref_out_opt IBrowserCaps ** ppOut)\n\n\t{\n\n\t\tif (!pContext)\n\n\t\t\treturn E_POINTER;\n\n\n\n\t\tif (!ppOut)\n\n\t\t\treturn E_POINTER;\n\n\n","file_path":"Src/VC/atlserver/include/atlsiface.h","rank":52,"score":304861.95354555815},{"content":"class CSkipHandler : public ISAXContentHandlerImpl\n\n{\n\npublic:\n\n\tvirtual ~CSkipHandler()\n\n\t{\n\n\t}\n\n\t\n\n\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\n\n\t{\n\n\t\tif (ppv == NULL)\n\n\t\t{\n\n\t\t\treturn E_POINTER;\n\n\t\t}\n\n\n\n\t\t*ppv = NULL;\n\n\n\n\t\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\n\n\t\t\tInlineIsEqualGUID(riid, IID_ISAXContentHandler))\n\n\t\t{\n\n\t\t\t*ppv = static_cast<ISAXContentHandler *>(this);\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":53,"score":304861.95354555815},{"content":"class CSecBufferDesc : public SecBufferDesc\n\n{\n\npublic:\n\n\tCSecBufferDesc() throw()\n\n\t{\n\n\t\tulVersion = SECBUFFER_VERSION;\n\n\t\tcBuffers = 0;\n\n\t\tpBuffers = NULL;\n\n\t}\n\n\n\n\t~CSecBufferDesc() throw()\n\n\t{\n\n\t\tcBuffers = 0;\n\n\n\n\t\tif (pBuffers)\n\n\t\t{\n\n\t\t\tCSecBuffer *psb = (CSecBuffer*)pBuffers;\n\n\t\t\tdelete [] psb;\n\n\t\t}\n\n\t}\n","file_path":"Src/VC/atlserver/include/atlhttp.h","rank":54,"score":304861.95354555815},{"content":"class CAtlNavigateData : public ATL_NAVIGATE_DATA\n\n{\n\npublic:\n\n\tCAtlNavigateData() throw(); // public construction\n\n\tCAtlNavigateData(const CAtlNavigateData &rhs);\n\n\tCAtlNavigateData(const ATL_NAVIGATE_DATA &rhs);\n\n\tCAtlNavigateData& operator=(const CAtlNavigateData &rhs);\n\n\tCAtlNavigateData& operator=(const ATL_NAVIGATE_DATA &rhs);\n\n\tDWORD SetFlags(DWORD dwNewFlags) throw(); // set all flags\n\n\tDWORD GetFlags() throw(); // get value of flags\n\n\tDWORD AddFlags(DWORD dwFlagsToAdd) throw(); // add one or more flags to existing flags\n\n\tDWORD RemoveFlags(DWORD dwFlagsToRemove) throw(); // remove one or more flags from existing flags\n\n\tLPCTSTR SetExtraHeaders(LPCTSTR szNewHeaders) throw(); // set the extra request headers\n\n\tLPCTSTR GetExtraHeaders() throw(); // get the extra request headers\n\n\tLPCTSTR SetMethod(LPCTSTR szNewMethod) throw(); // set the HTTP request method\n\n\tLPCTSTR GetMethod() throw(); // get the HTTP request method\n\n\tshort SetPort(short newPort) throw(); // set the TCP port for this request\n\n\tshort GetPort() throw(); // get the TCP port for this request\n\n\tvoid SetPostData(BYTE *pData, DWORD dwDataLen, LPCTSTR szDataType) throw(); // Set data to be sent as the reqeust entity body\n\n\tDWORD SetSocketTimeout(DWORD dwNewTimeout) throw(); // Set the timeout for this socket\n","file_path":"Src/VC/atlserver/include/atlhttp.h","rank":55,"score":304861.95354555803},{"content":"class CBlobCache : public CMemoryCache<void*, StatClass, FlushClass, CFixedStringKey, \n\n\tCStringElementTraits<CFixedStringKey >, SyncObj, CullClass>,\n\n\tpublic IMemoryCache,\n\n\tpublic IMemoryCacheControl,\n\n\tpublic IMemoryCacheStats,\n\n\tpublic IWorkerThreadClient\n\n{\n\n\ttypedef CMemoryCache<void*, StatClass, FlushClass, CFixedStringKey, \n\n\t\tCStringElementTraits<CFixedStringKey>, SyncObj, CullClass> cacheBase;\n\n\n\n\tMonitorClass m_Monitor;\n\n\n\nprotected:\n\n\tHANDLE m_hTimer;\n\n\n\npublic:\n\n\tCBlobCache() : m_hTimer(NULL)\n\n\t{\n\n\t}\n\n\n","file_path":"Src/VC/atlserver/include/atlcache.h","rank":56,"score":304428.098232622},{"content":"class CSoapFaultParser : public ISAXContentHandlerImpl\n\n{\n\nprivate:\n\n\n\n\tCSoapFault *m_pFault;\n\n\n\n\tDWORD m_dwState;\n\n\n\n\tconst static DWORD STATE_ERROR = 0;\n\n\tconst static DWORD STATE_ENVELOPE = 1;\n\n\tconst static DWORD STATE_BODY = 2;\n\n\tconst static DWORD STATE_START = 4;\n\n\tconst static DWORD STATE_FAULTCODE = 8;\n\n\tconst static DWORD STATE_FAULTSTRING = 16;\n\n\tconst static DWORD STATE_FAULTACTOR = 32;\n\n\tconst static DWORD STATE_DETAIL = 64;\n\n\tconst static DWORD STATE_RESET = 128;\n\n\tconst static DWORD STATE_SKIP = 256;\n\n\n\n\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":57,"score":299993.37034460105},{"content":"class CSoapRootHandler : public ISAXContentHandlerImpl\n\n{\n\nprivate:\n\n\n\n\tfriend class _CSDLGenerator;\n\n\n\n\t//\n\n\t// state constants\n\n\t//\n\n\tconst static DWORD SOAP_START = 0;\n\n\tconst static DWORD SOAP_ENVELOPE = 1;\n\n\tconst static DWORD SOAP_HEADERS = 2;\n\n\tconst static DWORD SOAP_BODY = 3;\n\n\tconst static DWORD SOAP_PARAMS = 4;\n\n\tconst static DWORD SOAP_CALLED = 5;\n\n\tconst static DWORD SOAP_RESPONSE = 6;\n\n\tconst static DWORD SOAP_HEADERS_DONE = 7;\n\n\n\n\t//\n\n\t// hash values for SOAP namespaces and elements\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":58,"score":299993.370344601},{"content":"class BCGCBPRODLLEXPORT CBCGPAnimCtrl : public CStatic\n\n{\n\n\tDECLARE_DYNAMIC(CBCGPAnimCtrl)\n\n\n\n// Construction\n\npublic:\n\n\tCBCGPAnimCtrl();\n\n\n\n// Attributes\n\npublic:\n\n\tBOOL IsRunning () const\n\n\t{\n\n\t\treturn m_bIsRunning;\n\n\t}\n\n\n\nprotected:\n\n\tCSize\t\tm_sizeFrame;\n\n\tCOLORREF\tm_clrBack;\n\n\tCImageList\tm_imagesAnim;\n\n\tCImageList*\tm_pImagesAnim;\n","file_path":"Src/VC/bcgcbpro/BCGPAnimCtrl.h","rank":59,"score":298167.39847499575},{"content":"\tclass CParseErrorProvider : public ITagReplacerImpl<CParseErrorProvider>,\n\n\t\tpublic CComObjectRootEx<CComSingleThreadModel>\n\n\t{\n\n\tpublic:\n\n\t\tBEGIN_COM_MAP(CParseErrorProvider)\n\n\t\t\tCOM_INTERFACE_ENTRY(ITagReplacer)\n\n\t\tEND_COM_MAP()\n\n\t\tCSimpleArray<ParseError> *m_pErrors;\n\n\t\tint m_nCurrentError;\n\n\n\n\t\tCParseErrorProvider() throw() :\n\n\t\t\tm_pErrors(NULL),\n\n\t\t\tm_nCurrentError(-1)\n\n\t\t{\n\n\t\t}\n\n\n\n\t\tvoid Initialize(CSimpleArray<ParseError> *pErrors) throw()\n\n\t\t{\n\n\t\t\tm_pErrors = pErrors;\n\n\t\t}\n","file_path":"Src/VC/atlserver/include/atlstencil.h","rank":60,"score":297507.3195771926},{"content":"\tclass CParseStateElementTraits : public CDefaultElementTraits<ParseState>\n\n\t{\n\n\tpublic:\n\n\t\t// CBitVector relocate fixup\n\n\t\tstatic void RelocateElements( ParseState* pDest, ParseState* pSrc, size_t nElements )\n\n\t\t{\n\n\t\t\tCDefaultElementTraits<ParseState>::RelocateElements(pDest, pSrc, nElements);\n\n\n\n\t\t\t// fixup CBitVector\n\n\t\t\tfor (size_t i=0; i<nElements; i++)\n\n\t\t\t{\n\n\t\t\t\tpDest[i].RelocateFixup();\n\n\t\t\t}\n\n\t\t}\n\n\t};\n\n\n","file_path":"Src/VC/atlserver/include/atlsoap.h","rank":61,"score":297507.3195771926},{"content":"//\n\n// Security Service Provider Interface (sspi) Helper classes\n\n// These classes are used as helpers for structures used in \n\n// SSPI functions.\n\n//\n\nclass CSecAuthIdentity : public SEC_WINNT_AUTH_IDENTITY_EX\n\n{\n\npublic:\n\n\tCSecAuthIdentity() throw()\n\n\t{\n\n\t\tVersion = SEC_WINNT_AUTH_IDENTITY_VERSION;\n\n\t\tLength = sizeof(SEC_WINNT_AUTH_IDENTITY_EX);\n\n#ifdef _UNICODE\n\n\t\tFlags = SEC_WINNT_AUTH_IDENTITY_UNICODE;\n\n#else\n\n\t\tFlags = SEC_WINNT_AUTH_IDENTITY_ANSI;\n\n#endif\n\n\t}\n\n\n\n\n\n\tbool Init(IAuthInfo *pAuthInfo) throw()\n\n\t{\n\n\t\tif (!pAuthInfo)\n\n\t\t\treturn false;\n\n\n","file_path":"Src/VC/atlserver/include/atlhttp.h","rank":62,"score":295337.188063456},{"content":"class CTransferServerContext : public CComObjectRootEx<CComMultiThreadModel>,\n\n\tpublic CWrappedServerContext\n\n{\n\npublic:\n\n\tchar m_szFileName[MAX_PATH];\n\n\tchar m_szQueryString[ATL_URL_MAX_PATH_LENGTH+1];\n\n\tCStringA m_strUrl;\n\n\tIWriteStream *m_pStream;\n\n\n\n\tBEGIN_COM_MAP(CTransferServerContext)\n\n\t\tCOM_INTERFACE_ENTRY(IHttpServerContext)\n\n\tEND_COM_MAP()\n\n\n\n\tCTransferServerContext() throw()\n\n\t{\n\n\t\tm_pStream = NULL;\n\n\t}\n\n\n\n\tBOOL Initialize(__in CTransferServerContext *pOtherContext)\n\n\t{\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":63,"score":295282.3584714876},{"content":"class BCGCBPRODLLEXPORT CBCGPBaseVisualCtrl : public CStatic\n\n{\n\n\tDECLARE_DYNAMIC(CBCGPBaseVisualCtrl)\n\n\n\n// Construction\n\npublic:\n\n\tCBCGPBaseVisualCtrl();\n\n\n\n// Operations\n\npublic:\n\n\tvoid SetGraphicsManager(CBCGPGraphicsManager::BCGP_GRAPHICS_MANAGER manager, CBCGPGraphicsManagerParams* pParams = NULL);\n\n\tvoid SetGraphicsManager(CRuntimeClass* pRTI);\n\n\n\n\tvoid EnableTooltip(BOOL bEnable = TRUE, BOOL bTooltipTrackingMode = FALSE);\n\n\tBOOL IsTooltipEnabled() const {return m_bIsTooltip;}\n\n\n\n\tBOOL CreatePopup(const CRect& rect, BYTE nTransparency = 255 /* from 0 to 255 */, CWnd* pWndOwner = NULL);\n\n\tstatic BOOL HasActivePopup()\n\n\t{\n\n\t\treturn m_hwndHookedPopup != NULL;\n","file_path":"Src/VC/bcgcbpro/BCGPVisualCtrl.h","rank":64,"score":293292.8792399687},{"content":"class PerThreadWrapper : public CComObjectNoLock<T>\n\n{\n\npublic:\n\n\tvoid *operator new(size_t /*size*/, void *p) throw()\n\n\t{\n\n\t\treturn p;\n\n\t}\n\n\n\n\tvoid operator delete(void * /*p*/) throw()\n\n\t{\n\n\t}\n\n\n\n\tSTDMETHOD_(ULONG, Release)() throw()\n\n\t{\n\n\t\tULONG l = InternalRelease();\n\n\t\tif (l == 0)\n\n\t\t{\n\n\t\t\tT *pT = static_cast<T*>(this);\n\n\t\t\tATLASSERT(pT->m_spExtension != NULL);\n\n\t\t\tCIsapiWorker *pWorker = pT->m_spExtension->GetThreadWorker();\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":65,"score":293021.2182488964},{"content":"class BCGCBPRODLLEXPORT CBCGPEditListBase : public CStatic\n\n{\n\n// Construction\n\nprotected:\n\n\tCBCGPEditListBase();\n\n\n\n\tCList<CBCGPButton*, CBCGPButton*>\tm_lstButtons;\n\n\tCList<DWORD, DWORD>\t\t\t\tm_lstKeyAccell;\n\n\tCMap<int,int,UINT,UINT>\t\t\tm_mapButtonIDs;\n\n\tCSize\t\t\t\t\t\t\tm_sizeButton;\n\n\tCRect\t\t\t\t\t\t\tm_rectCaption;\n\n\tUINT\t\t\t\t\t\t\tm_uiStandardBtns;\n\n\tBOOL\t\t\t\t\t\t\tm_bNewItem;\n\n\tCFont\t\t\t\t\t\t\tm_font;\n\n\tBOOL\t\t\t\t\t\t\tm_bIsActualDelete;\t// Indicated that Items is really deletd, not moved\n\n\tBOOL\t\t\t\t\t\t\tm_bBrowseButton;\n\n\tBOOL\t\t\t\t\t\t\tm_bGrayDisabledButtons;\n\n\tCString\t\t\t\t\t\t\tm_strCaption;\n\n\tBOOL\t\t\t\t\t\t\tm_bDefaultCaption;\n\n\tBOOL\t\t\t\t\t\t\tm_bVisualManagerStyle;\n","file_path":"Src/VC/bcgcbpro/BCGPEditListBox.h","rank":66,"score":288622.46539098845},{"content":"class BCGCBPRODLLEXPORT CBCGPRibbonTreeCtrl : public CStatic\n\n{\n\n\t// Construction\n\npublic:\n\n\tCBCGPRibbonTreeCtrl(CBCGPRibbonCustomizationData* /*pCustomizationData*/, CBCGPRibbonBar* /*pRibbonBar*/)\n\n\t{\n\n\t}\n\n\n\n\tvoid RebuildItems(int /*nRibbonTabsDest*/, LPCTSTR /*lpszMainTabsCaption*/) {}\n\n\tvoid RebuildItems(const CArray<CBCGPBaseRibbonElement*, CBCGPBaseRibbonElement*>& /*arElements*/) {}\n\n\t\n\n\tBOOL MoveSelection(BOOL /*bMoveNext*/) { return FALSE; }\n\n};\n\n\n\n#endif\n\n#endif\n\n\n\n/////////////////////////////////////////////////////////////////////////////\n\n\n\n//{{AFX_INSERT_LOCATION}}\n\n// Microsoft Visual C++ will insert additional declarations immediately before the previous line.\n\n\n\n#endif // !defined(AFX_BCGPRIBBONTREECTRL_H__C48070ED_1185_47B5_9CBF_786C88E122A6__INCLUDED_)\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonTreeCtrl.h","rank":67,"score":288622.46539098845},{"content":"//\n\n// The base parser class\n\n//\n\nclass CParserBase : public ISAXContentHandler, public CDummy1, public CDummy2\n\n{\n\nprivate:\n\n\t\n\n\tCComPtr<CParserBase> m_spParent;\n\n\tCComPtr<ISAXXMLReader> m_spReader;\n\n\tCComPtr<ISAXLocator> m_spLocator;\n\n\n\n\t//\n\n\t// how many levels deep\n\n\t//\n\n\tDWORD m_dwLevel;\n\n\n\n\t//\n\n\t// reset to parent handler on endElement\n\n\t//\n\n\tDWORD m_dwReset;\n\n\n\n\t//\n\n\t// get only top-level attributes\n","file_path":"Src/VC/atlserver/source/SProxy/Parser.h","rank":68,"score":281261.6563486251},{"content":"class QWT_EXPORT QwtCPointerData: public QwtSeriesData<QPointF>\n\n{\n\npublic:\n\n QwtCPointerData( const double *x, const double *y, size_t size );\n\n\n\n virtual QRectF boundingRect() const;\n\n virtual size_t size() const;\n\n virtual QPointF sample( size_t i ) const;\n\n\n\n const double *xData() const;\n\n const double *yData() const;\n\n\n\nprivate:\n\n const double *d_x;\n\n const double *d_y;\n\n size_t d_size;\n\n};\n\n\n\n/*!\n\n \\brief Synthetic point data\n","file_path":"Src/Qt/qwt/src/qwt_point_data.h","rank":69,"score":280289.07382992667},{"content":"class CAssertValidField< PERF_SIZE_LARGE >\n\n{\n\npublic:\n\n\ttemplate< class C > static void AssertValidFieldType( ULONGLONG C::* ) throw() { }\n\n\ttemplate< class C > static void AssertValidFieldType( LONGLONG C::* ) throw() { }\n\n};\n\n\n\n#define DEFINE_COUNTER_EX(member, dwCounterId, namestring, helpstring, detail, countertype, maxcountersize, defscale) \\\n\n\t\t\tCAssertValidField< (countertype) & ATLPERF_SIZE_MASK >::AssertValidFieldType( &_PerfCounterClass::member ); \\\n\n\t\t\thr = pPerf->RegisterCounter(wLanguage, hResInstance, dwCounterId, namestring, helpstring, detail, countertype, maxcountersize, (ULONG) offsetof(_PerfCounterClass, member), defscale); \\\n\n\t\t\tif (FAILED(hr)) \\\n\n\t\t\t\treturn hr;\n\n\n\n#define END_PERF_MAP() \\\n\n\t\t\treturn S_OK; \\\n\n\t\t}\n\n\n\n#define END_COUNTER_MAP() \\\n\n\t\t\treturn S_OK; \\\n\n\t\t}\n","file_path":"Src/VC/atlserver/include/atlperf.h","rank":70,"score":274773.4125642808},{"content":"class CAssertValidField< PERF_SIZE_DWORD >\n\n{\n\npublic:\n\n\ttemplate< class C > static void AssertValidFieldType( ULONG C::* ) throw() { }\n\n\ttemplate< class C > static void AssertValidFieldType( LONG C::* ) throw() { }\n\n};\n\n\n\ntemplate<>\n","file_path":"Src/VC/atlserver/include/atlperf.h","rank":71,"score":274773.4125642808},{"content":"class CHttpPtrMap : public CHttpMap<K, V, KTraits, VTraits>\n\n{\n\npublic:\n\n\ttypedef CHttpMap<K, V, KTraits, VTraits> Base;\n\n\n\n\tvoid RemoveAll()\n\n\t{\n\n\t\tif (!IsShared())\n\n\t\t{\n\n\t\t\tPOSITION pos = GetStartPosition();\n\n\t\t\twhile (pos)\n\n\t\t\t{\n\n\t\t\t\tGetNextValue(pos)->Free();\n\n\t\t\t}\n\n\t\t}\n\n\t\tBase::RemoveAll();\n\n\t}\n\n\n\n\t~CHttpPtrMap()\n\n\t{\n\n\t\tRemoveAll();\n\n\t}\n\n};\n\n\n","file_path":"Src/VC/atlserver/include/atlisapi.h","rank":72,"score":274627.5157434441},{"content":"class CCodeTypedElement : public CCodeElement, public CCodeType\n\n{\n\nprivate:\n\n\n\n\tCXSDElement * m_pElement;\n\n\tCAtlArray<int> m_arrDims;\n\n\t\n\n\tCStringA m_strSizeIs;\n\n\t\n\n\tCStringW m_strNamespace;\n\n\t\n\npublic:\n\n\n\n\tCCodeTypedElement()\n\n\t\t:m_pElement(NULL)\n\n\t{\n\n\t}\n\n\t\n\n\tinline HRESULT SetNamespace(const CStringW& strNamespace)\n\n\t{\n","file_path":"Src/VC/atlserver/source/SProxy/CodeTypes.h","rank":73,"score":272855.5193449348},{"content":"class CButtonsList : public CButton\n\n{\n\n// Construction\n\npublic:\n\n\tCButtonsList();\n\n\n\n// Operations\n\npublic:\n\n\tvoid SetImages (CBCGPToolBarImages* pImages);\n\n\tvoid AddButton (CBCGPToolbarButton* pButton);\n\n\tvoid RemoveButtons ();\n\n\n\n\tCBCGPToolbarButton* GetSelectedButton () const\n\n\t{\n\n\t\treturn m_pSelButton;\n\n\t}\n\n\n\n\tBOOL SelectButton (int iImage);\n\n\tvoid EnableDragFromList (BOOL bEnable = TRUE)\n\n\t{\n","file_path":"Src/VC/bcgcbpro/ButtonsList.h","rank":74,"score":272726.7623854439},{"content":"\tclass XElementGroup: public XElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementGroup();\n\n\t\tvirtual ~XElementGroup();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tXImage\t\t\tm_Images;\n\n\t\tXArrayElement\tm_arButtons;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":75,"score":269043.9832029231},{"content":"\tclass XElementSeparator: public XElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementSeparator();\n\n\t\tvirtual ~XElementSeparator();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\t\tBOOL\t\t\tm_bIsHoriz;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":76,"score":269043.9832029231},{"content":"\tclass XElementButton: public XElement\n\n\t{\n\n\tprotected:\n\n\t\tXElementButton(const CString& strElementName);\n\n\n\n\tpublic:\n\n\t\tXElementButton();\n\n\t\tvirtual ~XElementButton();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tint\t\t\t\tm_nSmallImageIndex;\n\n\t\tint\t\t\t\tm_nLargeImageIndex;\n\n\t\tBOOL\t\t\tm_bIsDefaultCommand;\n\n\t\tBOOL\t\t\tm_bIsAlwaysShowDescription;\n\n\t\tCBCGPRibbonButton::RibbonButtonOnQAT\n\n\t\t\t\t\t\tm_QATType;\n\n\t\tXArrayElement\tm_arSubItems;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":77,"score":269043.9832029231},{"content":"\tclass XDiagramElement: public XElement\n\n\t{\n\n\tprotected:\n\n\t\tXDiagramElement(const CString& strElementName);\n\n\n\n\tpublic:\n\n\t\tvirtual ~XDiagramElement();\n\n\n\n\t\tstatic XDiagramElement* CreateFromName (const CString& name);\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tXDiagramID\tm_idItem;\n\n\t\tXArrayData\tm_arDataObjects;\n\n\t\tCBCGPBrush\tm_brFill;\n\n\t\tCBCGPBrush\tm_brOutline;\n\n\t\tCBCGPBrush\tm_brShadow;\n\n\n\n\t\tCString\t\tm_strCustomName;\n\n\t\tCString\t\tm_strCustomProps;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":78,"score":269043.9832029231},{"content":"\tclass XElementSlider: public XElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementSlider();\n\n\t\tvirtual ~XElementSlider();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tDWORD\t\t\tm_dwStyle;\n\n\t\tint\t\t\t\tm_nWidth;\n\n\t\tint\t\t\t\tm_nMin;\n\n\t\tint\t\t\t\tm_nMax;\n\n\t\tint\t\t\t\tm_nPos;\n\n\t\tBOOL\t\t\tm_bZoomButtons;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":79,"score":269043.9832029231},{"content":"\tclass XGaugeData : public XData\n\n\t{\n\n\tpublic:\n\n\t\tvirtual ~XGaugeData ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tXGaugeData (const CString& strName);\n\n\n\n\tpublic:\n\n\t\tint\t\t\tm_nScale;\n\n\t\tCBCGPBrush\tm_brFill;\n\n\t\tCBCGPBrush\tm_brOutline;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":80,"score":269043.9832029231},{"content":"\tclass XGaugeElement: public XElement\n\n\t{\n\n\tprotected:\n\n\t\tXGaugeElement(const CString& strElementName);\n\n\n\n\tpublic:\n\n\t\tvirtual ~XGaugeElement();\n\n\n\n\t\tstatic XGaugeElement* CreateFromName (const CString& name);\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag) = 0;\n\n\t\tvirtual void ColorsToTag (CString& strTag) const = 0;\n\n\n\n\tpublic:\n\n\t\tint\t\t\t\t\t\tm_nFrameSize;\n\n\t\tCBCGPGaugeImpl::BCGP_SUB_GAUGE_POS\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":81,"score":269043.9832029231},{"content":"\tclass XElementTagCloud: public XElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementTagCloud();\n\n\t\tvirtual ~XElementTagCloud();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPTagCloud::SortOrder\tm_SortOrder;\n\n\t\tBOOL\t\t\t\t\t\tm_bDescending;\n\n\t\tint\t\t\t\t\t\t\tm_nMaxWeight;\n\n\t\tdouble\t\t\t\t\t\tm_dblFontSizeStep;\n\n\t\tCBCGPSize\t\t\t\t\tm_szMargin;\n\n\t\tCBCGPTextFormat\t\t\t\tm_fmtBase;\n\n\t\tCBCGPBrush\t\t\t\t\tm_brFill;\n\n\t\tCBCGPColor\t\t\t\t\tm_clrText;\n\n\t\tCBCGPColor\t\t\t\t\tm_clrTextHighlighted;\n\n\n\n\t\tXArrayTagCloudData\t\t\tm_arDataObjects;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":82,"score":265426.4517287825},{"content":"\tclass XDiagramTextData : public XData\n\n\t{\n\n\tpublic:\n\n\t\tXDiagramTextData ();\n\n\t\tvirtual ~XDiagramTextData ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCString\t\t\tm_strText;\n\n\t\tCBCGPBrush\t\tm_brText;\n\n\t\tCBCGPTextFormat\tm_fmtText;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":83,"score":265426.4517287825},{"content":"\tclass XElementKnob: public XElementCircular\n\n\t{\n\n\tpublic:\n\n\t\tXElementKnob ();\n\n\t\tvirtual ~XElementKnob ();\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":84,"score":265426.4517287825},{"content":"\tclass XElementTreeMap: public XElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementTreeMap();\n\n\t\tvirtual ~XElementTreeMap();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPTreeMap::LayoutType\tm_LayoutType;\n\n\t\tXTreeMapGroup\t\t\t\tm_Root;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":85,"score":265426.4517287825},{"content":"\tclass XCircularPointer: public XGaugeData\n\n\t{\n\n\tpublic:\n\n\t\tXCircularPointer ();\n\n\t\tvirtual ~XCircularPointer ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tdouble\t\tm_dblSize;\n\n\t\tdouble\t\tm_dblWidth;\n\n\t\tBOOL\t\tm_bExtraLen;\n\n\t\tCBCGPCircularGaugePointer::BCGP_GAUGE_POINTER_STYLE\n\n\t\t\t\t\tm_Style;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":86,"score":265426.4517287825},{"content":"\tclass XElementText: public XGaugeElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementText();\n\n\t\tvirtual ~XElementText();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag);\n\n\t\tvirtual void ColorsToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPBrush\t\tm_brText;\n\n\t\tCBCGPTextFormat\tm_fmtText;\n\n\t\tCString\t\t\tm_strText;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":87,"score":265426.4517287825},{"content":"\tclass XCircularScale: public XGaugeScale\n\n\t{\n\n\tpublic:\n\n\t\tXCircularScale ();\n\n\t\tvirtual ~XCircularScale ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tdouble\t\t\tm_dblStartAngle;\n\n\t\tdouble\t\t\tm_dblFinishAngle;\n\n\t\tBOOL\t\t\tm_bRotateLabels;\n\n\t\tBOOL\t\t\tm_bIsClosed;\n\n\t\tBOOL\t\t\tm_bDrawLastTickMark;\n\n\t\tBOOL\t\t\tm_bAnimationThroughStart;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":88,"score":265426.4517287825},{"content":"\tclass XElementLinear: public XGaugeElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementLinear();\n\n\t\tvirtual ~XElementLinear();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag);\n\n\t\tvirtual void ColorsToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPLinearGaugeColors\t\tm_Colors;\n\n\t\tCBCGPTextFormat\t\t\t\tm_fmtText;\n\n\t\tBOOL\t\t\t\t\t\tm_bIsVertical;\n\n\n\n\t\tXArrayData\t\t\t\t\tm_arPointers;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":89,"score":265426.4517287825},{"content":"\tclass XLinearScale: public XGaugeScale\n\n\t{\n\n\tpublic:\n\n\t\tXLinearScale ();\n\n\t\tvirtual ~XLinearScale ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":90,"score":265426.4517287825},{"content":"\tclass XElementEdit: public XElementButton\n\n\t{\n\n\tprotected:\n\n\t\tXElementEdit(const CString& strElementName);\n\n\n\n\tpublic:\n\n\t\tXElementEdit();\n\n\t\tvirtual ~XElementEdit();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tint\t\t\t\tm_nWidth;\n\n\t\tint\t\t\t\tm_nWidthFloaty;\n\n\t\tint\t\t\t\tm_nTextAlign;\n\n\t\tBOOL m_bHasSpinButtons;\n\n\t\tint\t\t\t\tm_nMin;\n\n\t\tint\t\t\t\tm_nMax;\n\n\t\tCString\t\t\tm_strValue;\n\n\t\tBOOL\t\t\tm_bSearchMode;\n\n\t\tCString\t\t\tm_strSearchPrompt;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":91,"score":265426.4517287825},{"content":"\tclass XElementColor: public XGaugeElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementColor();\n\n\t\tvirtual ~XElementColor();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag);\n\n\t\tvirtual void ColorsToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPColorIndicatorColors\tm_Colors;\n\n\t\tCBCGPColorIndicatorImpl::BCGPColorIndicatorStyle\n\n\t\t\t\t\t\t\t\t\tm_Style;\n\n\t\tBOOL\t\t\t\t\t\tm_bStretched;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":92,"score":265426.4517287825},{"content":"\tclass XElementLabel: public XElementButton\n\n\t{\n\n\tpublic:\n\n\t\tXElementLabel();\n\n\t\tvirtual ~XElementLabel();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":93,"score":265426.4517287825},{"content":"\tclass XKnobPointer: public XGaugeData\n\n\t{\n\n\tpublic:\n\n\t\tXKnobPointer ();\n\n\t\tvirtual ~XKnobPointer ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tdouble\t\tm_dblOffsetFromCenter;\n\n\t\tdouble\t\tm_dblWidth;\n\n\t\tCBCGPKnobPointer::BCGP_KNOB_POINTER_STYLE\n\n\t\t\t\t\tm_Style;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":94,"score":265426.4517287825},{"content":"\tclass XElementNumeric: public XGaugeElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementNumeric();\n\n\t\tvirtual ~XElementNumeric();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag);\n\n\t\tvirtual void ColorsToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPNumericIndicatorColors\tm_Colors;\n\n\t\tCBCGPTextFormat\t\t\t\tm_fmtText;\n\n\t\tCBCGPNumericIndicatorImpl::BCGPNumericIndicatorStyle\n\n\t\t\t\t\t\t\t\t\tm_Style;\n\n\t\tint\t\t\t\t\t\t\tm_nCells;\n\n\t\tint\t\t\t\t\t\t\tm_nDecimals;\n\n\t\tint\t\t\t\t\t\t\tm_nSeparatorWidth;\n\n\t\tBOOL\t\t\t\t\t\tm_bDrawSign;\n\n\t\tBOOL\t\t\t\t\t\tm_bDrawDecimalPoint;\n\n\t\tBOOL\t\t\t\t\t\tm_bDrawLeadingZeros;\n\n\t\tdouble\t\t\t\t\t\tm_dblValue;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":95,"score":265426.4517287825},{"content":"\tclass XElementProgressBar: public XElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementProgressBar();\n\n\t\tvirtual ~XElementProgressBar();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tint\t\t\t\tm_nWidth;\n\n\t\tint\t\t\t\tm_nHeight;\n\n\t\tint\t\t\t\tm_nMin;\n\n\t\tint\t\t\t\tm_nMax;\n\n\t\tint\t\t\t\tm_nPos;\n\n\t\tBOOL\t\t\tm_bInfinite;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPRibbonInfo.h","rank":96,"score":265426.4517287825},{"content":"\tclass XElementCircular: public XGaugeElement\n\n\t{\n\n\tprotected:\n\n\t\tXElementCircular(const CString& strElementName);\n\n\n\n\tpublic:\n\n\t\tXElementCircular();\n\n\t\tvirtual ~XElementCircular();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag);\n\n\t\tvirtual void ColorsToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tCBCGPCircularGaugeColors\tm_Colors;\n\n\t\tCBCGPTextFormat\t\t\t\tm_fmtText;\n\n\t\tdouble\t\t\t\t\t\tm_dblCapSize;\n\n\t\tBOOL\t\t\t\t\t\tm_bShapeByTicksArea;\n\n\n\n\t\tXArrayData\t\t\t\t\tm_arPointers;\n\n\t\tXArrayGaugeElement\t\t\tm_arSubGauges;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":97,"score":265426.4517287825},{"content":"\tclass XElementImage: public XGaugeElement\n\n\t{\n\n\tpublic:\n\n\t\tXElementImage();\n\n\t\tvirtual ~XElementImage();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tprotected:\n\n\t\tvirtual BOOL ColorsFromTag (const CString& strTag);\n\n\t\tvirtual void ColorsToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tXImage\tm_Image;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":98,"score":265426.4517287825},{"content":"\tclass XLinearPointer: public XGaugeData\n\n\t{\n\n\tpublic:\n\n\t\tXLinearPointer ();\n\n\t\tvirtual ~XLinearPointer ();\n\n\n\n\t\tvirtual BOOL FromTag (const CString& strTag);\n\n\t\tvirtual void ToTag (CString& strTag) const;\n\n\n\n\tpublic:\n\n\t\tdouble\t\tm_dblSize;\n\n\t\tdouble\t\tm_dblWidth;\n\n\t\tCBCGPLinearGaugePointer::BCGP_GAUGE_POINTER_STYLE\n\n\t\t\t\t\tm_Style;\n\n\t};\n\n\n","file_path":"Src/VC/bcgcbpro/BCGPVisualInfo.h","rank":99,"score":265426.4517287825}],"string":"[\n {\n \"content\": \"class BCGCBPRODLLEXPORT CBCGPPointsArray : public CArray<CBCGPPoint, const CBCGPPoint&>\\n\\n{\\n\\npublic:\\n\\n\\tCBCGPPointsArray() {}\\n\\n\\tCBCGPPointsArray(int nNewSize, int nGrowBy = -1)\\n\\n\\t{\\n\\n\\t\\tSetSize(nNewSize, nGrowBy);\\n\\n\\t}\\n\\n\\n\\n\\t~CBCGPPointsArray() {}\\n\\n\\n\\n\\tCBCGPRect GetBoundsRect() const;\\n\\n\\tCBCGPPoint GetBoundsCenter() const\\n\\n\\t{\\n\\n\\t\\treturn GetBoundsRect ().CenterPoint ();\\n\\n\\t}\\n\\n\\n\\n\\tvoid StoreBoundsRect(const CBCGPRect& rect) {m_rectBounds = rect;}\\n\\n\\n\\n\\tvoid Multiply(double value)\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPGraphicsManager.h\",\n \"rank\": 0,\n \"score\": 368564.94461664476\n },\n {\n \"content\": \"// This class provides access to the information contained in an HTTP request submitted to a web server.\\n\\n//\\n\\n// CHttpRequest provides access to the query string parameters, form fields, cookies, and files\\n\\n// that make up an HTTP request, as well as many other important properties of the request.\\n\\nclass CHttpRequest : public IHttpRequestLookup\\n\\n{\\n\\nprotected:\\n\\n\\t// Implementation: Array used to map an HTTP request method (for example, \\\"GET\\\" or \\\"POST\\\")\\n\\n\\t// from a string to a numeric constant from the HTTP_METHOD enum (HTTP_METHOD_GET or HTTP_METHOD_HEAD).\\n\\n\\tstatic const char* const m_szMethodStrings[];\\n\\n\\n\\n\\t// Implementation: The server context.\\n\\n\\tCComPtr<IHttpServerContext> m_spServerContext;\\n\\n\\n\\n\\t// Implementation: The number of bytes read from the body of the request.\\n\\n\\tDWORD m_dwBytesRead;\\n\\n\\n\\n\\t// Implementation: TRUE if the request method was POST and the encoding was\\n\\n\\t// multipart/form-data, FALSE otherwise.\\n\\n\\tBOOL m_bMultiPart;\\n\\n\\n\\n\\tCCookie m_EmptyCookie;\\n\\n\\n\\n\\t// Implementation: Constructor function used to reinitialize all data members.\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 1,\n \"score\": 368382.38445469784\n },\n {\n \"content\": \"//\\n\\n//CPerfStatClass\\n\\n// Description\\n\\n// This class provides the implementation of a cache statistics gathering class\\n\\n// with PerfMon support\\n\\nclass CPerfStatClass : public CStdStatClass\\n\\n{\\n\\n\\tCPerfStatObject * m_pPerfObject;\\n\\n\\tCCachePerfMon m_PerfMon;\\n\\n\\n\\npublic:\\n\\n\\n\\n\\tHRESULT Initialize(__in_z_opt LPWSTR szName=NULL)\\n\\n\\t{\\n\\n\\t\\tHRESULT hr;\\n\\n\\t\\tWCHAR szPath[MAX_PATH];\\n\\n\\n\\n\\t\\tif (!szName)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// default name is the name of the module\\n\\n\\t\\t\\t// we don't care about possible truncation if longer than max_path\\n\\n\\t\\t\\t// we just need an identifier\\n\\n\\t\\t\\tHINSTANCE hInst = _AtlBaseModule.GetModuleInstance();\\n\\n\\t\\t\\tif (::GetModuleFileNameW(hInst, szPath, MAX_PATH) == 0)\\n\\n\\t\\t\\t{\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 2,\n \"score\": 343471.37192045397\n },\n {\n \"content\": \"class BCGCBPRODLLEXPORT CBCGPStatic : public CStatic\\n\\n{\\n\\n\\tDECLARE_DYNAMIC(CBCGPStatic)\\n\\n\\n\\n// Construction\\n\\npublic:\\n\\n\\tCBCGPStatic();\\n\\n\\n\\n// Attributes\\n\\npublic:\\n\\n\\tBOOL\\t\\tm_bOnGlass;\\n\\n\\tBOOL\\t\\tm_bVisualManagerStyle;\\n\\n\\tBOOL\\t\\tm_bBackstageMode;\\n\\n\\tCOLORREF\\tm_clrText;\\n\\n\\tHFONT\\t\\tm_hFont;\\n\\n\\n\\n// Operations\\n\\npublic:\\n\\n\\n\\n// Overrides\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPStatic.h\",\n \"rank\": 3,\n \"score\": 333519.84909499175\n },\n {\n \"content\": \"class CHtmlStencil : public CStencil\\n\\n{\\n\\nprivate:\\n\\n\\n\\n\\tATL_NOINLINE HTTP_CODE RenderInclude(\\n\\n\\t\\tITagReplacer *pReplacer, \\n\\n\\t\\tconst StencilToken *pToken, \\n\\n\\t\\tIWriteStream *pWriteStream, \\n\\n\\t\\tCStencilState *pState) const\\n\\n\\t{\\n\\n\\t\\tATLASSUME(m_spServiceProvider);\\n\\n\\t\\tCComPtr<IHttpServerContext> spServerContext;\\n\\n\\t\\tCComPtr<IHttpRequestLookup> spLookup;\\n\\n\\t\\tif (FAILED(pReplacer->GetContext(__uuidof(IHttpServerContext), (VOID**) &spServerContext)))\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn AtlsHttpError(500, 0);\\n\\n\\t\\t}\\n\\n\\t\\tif (FAILED(pReplacer->GetContext(__uuidof(IHttpRequestLookup), (VOID**) &spLookup)))\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn AtlsHttpError(500, 0);\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlstencil.h\",\n \"rank\": 4,\n \"score\": 332182.75735660584\n },\n {\n \"content\": \"class CSessionCookie : public CCookie\\n\\n{\\n\\npublic:\\n\\n\\tCSessionCookie() throw(...)\\n\\n\\t{\\n\\n\\t\\tif (!SetName(SESSION_COOKIE_NAME) ||\\n\\n\\t\\t\\t!SetPath(\\\"/\\\"))\\n\\n\\t\\t\\tAtlThrow(E_OUTOFMEMORY);\\n\\n\\t}\\n\\n\\n\\n\\tCSessionCookie(LPCSTR szSessionID) throw(...)\\n\\n\\t{\\n\\n\\t\\tif (!SetName(SESSION_COOKIE_NAME) ||\\n\\n\\t\\t\\t!SetPath(\\\"/\\\") ||\\n\\n\\t\\t\\t!SetSessionID(szSessionID) )\\n\\n\\t\\t\\tAtlThrow(E_OUTOFMEMORY);\\n\\n\\t}\\n\\n\\n\\n\\tBOOL SetSessionID(LPCSTR szSessionID) throw()\\n\\n\\t{\\n\\n\\t\\tATLASSERT(szSessionID && szSessionID[0]);\\n\\n\\t\\treturn SetValue(szSessionID);\\n\\n\\t}\\n\\n}; // class CSessionCookie\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 5,\n \"score\": 332182.75735660584\n },\n {\n \"content\": \"// This class represents the response that the web server will send back to the client.\\n\\n//\\n\\n// CHttpResponse provides friendly functions for building up the headers, cookies, and body of an HTTP response.\\n\\n// The class derives from IWriteStream and CWriteStreamHelper, allowing you to call those classes' methods\\n\\n// to build up the body of the response. By default, the class improves performance by buffering the response until it is complete before sending it back to the client.\\n\\nclass CHttpResponse : public IWriteStream, public CWriteStreamHelper\\n\\n{\\n\\nprivate:\\n\\n\\n\\n\\t// Implementation: A map of HTTP response headers.\\n\\n\\t// The key is the name of the response header.\\n\\n\\t// The value is the data for the response header.\\n\\n\\tCSimpleMap<CStringA, CStringA> m_headers;\\n\\n\\n\\n\\t// Implementation: Determines whether the response is currently being buffered.\\n\\n\\tBOOL m_bBufferOutput;\\n\\n\\n\\n\\t// Implementation: Determines whether any output should be sent to the client.\\n\\n\\t// Intended mainly for HEAD requests, where the client should get the same headers\\n\\n\\t// (i.e. Content-Length) as for a GET request\\n\\n\\tBOOL m_bSendOutput;\\n\\n\\n\\n\\t// Implementation: The limit in bytes of the response buffer.\\n\\n\\t// When the limit is reached, the buffer is automatically flushed\\n\\n\\t// and data is sent to the client. You can set this to ULONG_MAX\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 6,\n \"score\": 328227.9365329944\n },\n {\n \"content\": \"// CMimeMessage - the MIME message class. Represents a full MIME message\\n\\nclass CMimeMessage : public CMimeHeader\\n\\n{\\n\\nprotected:\\n\\n\\n\\n\\t// The list of the MIME body parts\\n\\n\\tCAutoPtrList<CMimeBodyPart> m_BodyParts;\\n\\n\\n\\n\\t// The display name of the message\\n\\n\\tchar m_szDisplayName[MAX_PATH+1];\\n\\n\\n\\npublic:\\n\\n\\tCMimeMessage(IMultiLanguage *pMultiLanguage = NULL) throw()\\n\\n\\t{\\n\\n\\t\\tInitialize(pMultiLanguage);\\n\\n\\t\\tChecked::memcpy_s(m_szDisplayName, MAX_PATH+1, ATLMIME_EMAIL, sizeof(ATLMIME_EMAIL));\\n\\n\\t}\\n\\n\\n\\n\\tvirtual ~CMimeMessage() throw()\\n\\n\\t{\\n\\n\\t\\tRemoveParts();\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlmime.h\",\n \"rank\": 7,\n \"score\": 327105.07518547366\n },\n {\n \"content\": \"class CLifetimeCuller : public CExpireCuller\\n\\n{\\n\\npublic:\\n\\n\\tvoid Add(CCullerCacheData * pItem)\\n\\n\\t{\\n\\n\\t\\tATLENSURE(pItem);\\n\\n\\t\\tpItem->nLifespan = 0;\\n\\n\\t\\tCExpireCuller::Add(pItem);\\n\\n\\t}\\n\\n\\n\\n\\tvoid Commit(CCullerCacheData * pItem)\\n\\n\\t{ \\n\\n\\t\\tATLENSURE(pItem);\\n\\n\\t\\tif (pItem->nLifespan == 0)\\n\\n\\t\\t\\tpItem->cftExpireTime = 0;\\n\\n\\t\\telse\\n\\n\\t\\t\\tpItem->cftExpireTime = CFileTime(CFileTime::GetCurrentTime().GetTime() + pItem->nLifespan);\\n\\n\\t\\tCExpireCuller::Commit(pItem);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 8,\n \"score\": 327090.53787240916\n },\n {\n \"content\": \"// CMimeAttachment is an abstract base class for MIME message attachments.\\n\\n// It serves as a base class for CMimeFileAttachment and CMimeRawAttachment\\n\\nclass CMimeAttachment : public CMimeBodyPart\\n\\n{\\n\\nprotected:\\n\\n\\n\\n\\t// the encoding scheme (ATLSMTP_BASE64_ENCODE, ATLSMTP_UUENCODE, ATLSMTP_QP_ENCODE)\\n\\n\\tint m_nEncodingScheme;\\n\\n\\n\\n\\t// the content type of the attachment\\n\\n\\tCStringA m_ContentType;\\n\\n\\n\\n\\t// the character set\\n\\n\\tchar m_szCharset[ATL_MAX_ENC_CHARSET_LENGTH];\\n\\n\\n\\n\\t// the encode string (\\\"base64\\\", \\\"quoted-printable\\\", \\\"uuencode\\\")\\n\\n\\tchar *m_pszEncodeString;\\n\\n\\n\\n\\t// the display name of the attachment\\n\\n\\tTCHAR m_szDisplayName[_MAX_FNAME];\\n\\n\\n\\npublic:\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlmime.h\",\n \"rank\": 9,\n \"score\": 322220.881920272\n },\n {\n \"content\": \"// CMimeHeader describes the basic RFC 822 message header.\\n\\n// It also serves as the base class for the CMimeMessage object.\\n\\nclass CMimeHeader : public CMimeBodyPart\\n\\n{\\n\\nprotected:\\n\\n\\n\\n\\t// Pointer to MLANG's IMultiLanguage interface.\\n\\n\\t// This is used in doing conversion from code pages\\n\\n\\t// to MIME-compatible character sets.\\n\\n\\tCComPtr<IMultiLanguage> m_spMultiLanguage;\\n\\n\\n\\n\\t//Basic Header Parts\\n\\n\\tCStringA m_strFrom;\\n\\n\\tCStringA m_strTo;\\n\\n\\tCStringA m_strCc;\\n\\n\\tCStringA m_strBcc;\\n\\n\\tCStringA m_strSubject;\\n\\n\\n\\n\\t//Extended Header Parts\\n\\n\\tATL_MIME_PRIORITY m_nPriority;\\n\\n\\tCStringA m_XHeader;\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlmime.h\",\n \"rank\": 10,\n \"score\": 322219.1871838087\n },\n {\n \"content\": \"// class CCryptMD2Hash\\n\\n// RSA's MD2 hash\\n\\nclass CCryptMD2Hash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptMD2Hash\\n\\n\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 11,\n \"score\": 322218.8116072236\n },\n {\n \"content\": \"// class CCryptMD4Hash\\n\\n// RSA's MD4 hash\\n\\nclass CCryptMD4Hash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptMD4Hash\\n\\n\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 12,\n \"score\": 322218.8116072236\n },\n {\n \"content\": \"// class CCryptImportKey\\n\\n// Forms a key from an imported key blob\\n\\nclass CCryptImportKey : public CCryptKey\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(\\n\\n\\t\\tCCryptProv &Prov,\\n\\n\\t\\tBYTE * pbData,\\n\\n\\t\\tDWORD dwDataLen,\\n\\n\\t\\tCCryptKey &PubKey,\\n\\n\\t\\tDWORD dwFlags) throw();\\n\\n}; // class CCryptImportKey\\n\\n\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 13,\n \"score\": 322218.5569306549\n },\n {\n \"content\": \"// class CCryptHash\\n\\n// A generic hash that may or may not take a key. \\n\\nclass CCryptKeyedHash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, ALG_ID Algid, CCryptKey &Key, DWORD dwFlags) throw();\\n\\n}; // class CCryptKeyedHash\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 14,\n \"score\": 322218.5569306549\n },\n {\n \"content\": \"// class CCryptMD5Hash\\n\\n// RSA's MD5 hash (RSA's most recent hash as of 9/7/99);\\n\\nclass CCryptMD5Hash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptMD5Hash\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 15,\n \"score\": 322218.4328529139\n },\n {\n \"content\": \"// class CCryptSSL3SHAMD5Hash\\n\\n// Hash algorithm used by Secure Socket Layer\\n\\nclass CCryptSSL3SHAMD5Hash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, CCryptKey &Key, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptSSl3SHAMD5Hash\\n\\n\\n\\n}; // namespace ATL\\n\\n \\n\\n\\n\\n#include <atlcrypt.inl>\\n\\n#pragma pack(pop)\\n\\n#endif // __ATLCRYPT_H__\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 16,\n \"score\": 322218.4328529139\n },\n {\n \"content\": \"// class CCryptHMACHash\\n\\n// Hash-base Message Authentication Code keyed hash\\n\\nclass CCryptHMACHash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, CCryptKey &Key, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptHMACHash\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 17,\n \"score\": 322218.31087528553\n },\n {\n \"content\": \"// class CCryptSHAHash\\n\\n// The Secure Hash Algorithm hash, from NIST and NSA. Technically, SHA-1.\\n\\nclass CCryptSHAHash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptSHAHash\\n\\n\\n\\n// The Secure Hash Algorithm, from NIST and NSA. Identical to CCryptSHA\\n\\ntypedef CCryptSHAHash CCryptSHA1Hash;\\n\\n\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 18,\n \"score\": 322218.1909448982\n },\n {\n \"content\": \"// class CCryptMACHash\\n\\n// Message Authentication Code keyed hash. Believed to be less secure than HMAC\\n\\nclass CCryptMACHash : public CCryptHash\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(CCryptProv &Prov, CCryptKey &Key, LPCTSTR szText = NULL) throw();\\n\\n}; // class CCryptMACHash\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 19,\n \"score\": 322218.0730106401\n },\n {\n \"content\": \"// class CCryptDerivedKey\\n\\n// A key that is derived from a hashed password. Two keys derived \\n\\n// from the same password will be identical.\\n\\nclass CCryptDerivedKey : public CCryptKey\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(\\n\\n\\t\\tCCryptProv &Prov,\\n\\n\\t\\tCCryptHash &Hash,\\n\\n\\t\\tALG_ID algid = CALG_RC4,\\n\\n\\t\\tDWORD dwFlags = CRYPT_EXPORTABLE) throw();\\n\\n}; // class CCryptDerivedKey\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 20,\n \"score\": 322217.9570230872\n },\n {\n \"content\": \"// class CCryptRandomKey\\n\\n// A randomly generated key. Can be used internally by a program \\n\\n// to protect data during execution, or can be exported with Crypt.Export\\n\\n//\\n\\n// Currently it is possible to pass in AT_KEYEXCHANGE or AT_SIGNATURE \\n\\n// for algid, but these two will generate keys for the current key set, and \\n\\n// the resulting handle can only be used for exporting and importing keys or \\n\\n// signing hashes.\\n\\nclass CCryptRandomKey : public CCryptKey\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(\\n\\n\\t\\tCCryptProv &Prov,\\n\\n\\t\\tALG_ID algid = CALG_RC4,\\n\\n\\t\\tDWORD dwFlags = CRYPT_EXPORTABLE) throw();\\n\\n}; // class CCryptRandomKey\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 21,\n \"score\": 322215.49463316705\n },\n {\n \"content\": \"// CCachePerfMon - the interface to CPerfMon, with associated definitions\\n\\nclass CCachePerfMon : public CPerfMon\\n\\n{\\n\\npublic:\\n\\n\\tBEGIN_PERF_MAP(_T(\\\"ATL Server:Cache\\\"))\\n\\n\\t\\tCHAIN_PERF_CATEGORY(CPerfStatObject)\\n\\n\\tEND_PERF_MAP()\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 22,\n \"score\": 322212.37525679986\n },\n {\n \"content\": \"// CMimeText - represents a text body part in MIME body\\n\\nclass CMimeText : public CMimeBodyPart\\n\\n{\\n\\nprotected:\\n\\n\\n\\n\\t// the text\\n\\n\\tCHeapPtr<char> m_szText;\\n\\n\\n\\n\\t// the character set\\n\\n\\tchar m_szCharset[ATL_MAX_ENC_CHARSET_LENGTH];\\n\\n\\n\\n\\t// the text length\\n\\n\\tint m_nTextLen;\\n\\n\\n\\npublic:\\n\\n\\tCMimeText() throw()\\n\\n\\t\\t:m_nTextLen(0)\\n\\n\\t{\\n\\n\\t\\tChecked::strcpy_s(m_szCharset, ATL_MAX_ENC_CHARSET_LENGTH, ATLSMTP_DEFAULT_CSET);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlmime.h\",\n \"rank\": 23,\n \"score\": 322211.1962703657\n },\n {\n \"content\": \"// CMimeFileAttachment represents a MIME file attachment body part\\n\\nclass CMimeFileAttachment : public CMimeAttachment\\n\\n{\\n\\n\\n\\nprotected:\\n\\n\\t// The filename\\n\\n\\tTCHAR m_szFileName[MAX_PATH+1];\\n\\n\\n\\npublic:\\n\\n\\tCMimeFileAttachment() throw()\\n\\n\\t{\\n\\n\\t\\tm_szFileName[0] = 0;\\n\\n\\t}\\n\\n\\n\\n\\tvirtual ATL_NOINLINE CMimeBodyPart* Copy() throw( ... )\\n\\n\\t{\\n\\n\\t\\tCAutoPtr<CMimeFileAttachment> pNewAttachment;\\n\\n\\t\\tATLTRY(pNewAttachment.Attach(new CMimeFileAttachment));\\n\\n\\t\\tif (pNewAttachment)\\n\\n\\t\\t\\t*pNewAttachment = *this;\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlmime.h\",\n \"rank\": 24,\n \"score\": 322211.13448945084\n },\n {\n \"content\": \"// CMimeRawAttachment represents a file attachment MIME body part.\\n\\n// The data provided is not a file, but a blob of raw data.\\n\\nclass CMimeRawAttachment : public CMimeAttachment\\n\\n{\\n\\nprotected:\\n\\n\\n\\n\\t//the raw data\\n\\n\\tvoid* m_pvRaw;\\n\\n\\n\\n\\t//the length\\n\\n\\tDWORD m_dwLength;\\n\\n\\n\\n\\t//whether or not we own it\\n\\n\\tbool m_bShared;\\n\\n\\n\\npublic:\\n\\n\\tCMimeRawAttachment() throw()\\n\\n\\t\\t:m_dwLength(0), m_bShared(false), m_pvRaw(NULL)\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\t~CMimeRawAttachment() throw()\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlmime.h\",\n \"rank\": 25,\n \"score\": 322210.7850444329\n },\n {\n \"content\": \"class CWriteStreamOnCString : public IWriteStream\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\tCStringA m_str;\\n\\n\\n\\n\\tvirtual ~CWriteStreamOnCString()\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\tHRESULT WriteStream(LPCSTR szOut, int nLen, LPDWORD pdwWritten)\\n\\n\\t{\\n\\n\\t\\tATLENSURE_RETURN( szOut != NULL );\\n\\n\\n\\n\\t\\tif (nLen < 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\tnLen = (int) strlen(szOut);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t_ATLTRY\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 26,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"class CHtmlGenBase : public CStreamFormatter\\n\\n{\\n\\npublic:\\n\\n\\tT* GetOuter()\\n\\n\\t{\\n\\n\\t\\treturn static_cast<T*>(this);\\n\\n\\t}\\n\\n\\n\\n\\tenum ATL_HTML_FORM_METHOD { ATL_HTML_FORM_METHOD_NONE=0, ATL_HTML_FORM_METHOD_GET, ATL_HTML_FORM_METHOD_POST, ATL_HTML_FORM_METHOD_MULTIPART };\\n\\n\\n\\n\\tCHtmlGenBase()\\n\\n\\t{\\n\\n\\t\\tm_nWidthPercent = -1;\\n\\n\\t\\tm_nHeightPercent = -1;\\n\\n\\t\\tm_nFormMethod = ATL_HTML_FORM_METHOD_NONE;\\n\\n\\t\\tm_pScheme = NULL;\\n\\n\\t}\\n\\n\\n\\n\\tvoid SetScheme(HTML_SCHEME *pScheme)\\n\\n\\t{\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhtml.h\",\n \"rank\": 27,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"class CRequestPerfMon : public CPerfMon\\n\\n{\\n\\npublic:\\n\\n\\tBEGIN_PERF_MAP(_T(\\\"ATL Server:Request\\\"))\\n\\n\\t\\tCHAIN_PERF_CATEGORY(CPerfRequestStatObject)\\n\\n\\tEND_PERF_MAP()\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 28,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"class CStdRequestStats : public CRequestStats\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\tHRESULT Initialize() throw()\\n\\n\\t{\\n\\n\\t\\treturn S_OK;\\n\\n\\t}\\n\\n\\n\\n\\tvoid Uninitialize() throw()\\n\\n\\t{\\n\\n\\t}\\n\\n};\\n\\n\\n\\n#define PERF_REQUEST_OBJECT 100\\n\\n \\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 29,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"class CFixedLifetimeCuller : public CExpireCuller\\n\\n{\\n\\npublic:\\n\\n\\tvoid Commit(CCullerCacheData * pItem)\\n\\n\\t{\\n\\n\\t\\tATLASSERT(pItem);\\n\\n\\t\\t__int64 nLifeSpan = ftLifespan;\\n\\n\\t\\tif (nLifeSpan == 0)\\n\\n\\t\\t\\tpItem->cftExpireTime = 0;\\n\\n\\t\\telse\\n\\n\\t\\t\\tpItem->cftExpireTime = CFileTime::GetCurrentTime() + CFileTimeSpan(ftLifespan);\\n\\n\\n\\n\\t\\tCExpireCuller::Commit(pItem);\\n\\n\\t}\\n\\n\\n\\n\\tvoid Access(CCullerCacheData * pItem)\\n\\n\\t{\\n\\n\\t\\tATLASSERT(pItem);\\n\\n\\t\\tCExpireCuller::Remove(pItem);\\n\\n\\t\\tCommit(pItem);\\n\\n\\t}\\n\\n\\n\\n\\tCCullerCacheData * GetExpired() \\n\\n\\t{ \\n\\n\\t\\treturn static_cast<CCullerCacheData *>(CExpireCuller::GetExpired());\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\ntemplate <class CFirst, class CSecond>\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 30,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"\\tclass CRpcEncodedGenerator : public CResponseGenerator\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\n\\n\\t\\tHRESULT StartBody(IWriteStream *pStream)\\n\\n\\t\\t{\\n\\n\\t\\t\\tATLENSURE_RETURN( pStream != NULL );\\n\\n\\n\\n\\t\\t\\treturn pStream->WriteStream(\\n\\n\\t\\t\\t\\t\\\"<soap:Body soap:encodingStyle=\\\\\\\"\\\" SOAPENC_NAMESPACEA \\\"\\\\\\\">\\\", \\n\\n\\t\\t\\t\\tsizeof(\\\"<soap:Body soap:encodingStyle=\\\\\\\"\\\" SOAPENC_NAMESPACEA \\\"\\\\\\\">\\\")-1, NULL);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tHRESULT StartMap(IWriteStream *pStream, const _soapmap *pMap, bool bClient)\\n\\n\\t\\t{\\n\\n\\t\\t\\tATLENSURE_RETURN( pStream != NULL );\\n\\n\\t\\t\\tATLENSURE_RETURN( pMap != NULL );\\n\\n\\n\\n\\t\\t\\t(bClient); // unused for rpc/encoded\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 31,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"\\tclass CDocLiteralGenerator : public CResponseGenerator\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\n\\n\\t\\tHRESULT StartMap(IWriteStream *pStream, const _soapmap *pMap, bool bClient)\\n\\n\\t\\t{\\n\\n\\t\\t\\tATLENSURE_RETURN( pStream != NULL );\\n\\n\\t\\t\\tATLENSURE_RETURN( pMap != NULL );\\n\\n\\n\\n\\t\\t\\tHRESULT hr = S_OK;\\n\\n\\t\\t\\t// output type name\\n\\n\\t\\t\\thr = pStream->WriteStream(\\\"<\\\", 1, NULL);\\n\\n\\t\\t\\tif (SUCCEEDED(hr))\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\thr = pStream->WriteStream(pMap->szName, pMap->cchName, NULL);\\n\\n\\t\\t\\t\\tif (SUCCEEDED(hr))\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif ((pMap->mapType == SOAPMAP_FUNC) && \\n\\n\\t\\t\\t\\t\\t\\t(bClient == false) && \\n\\n\\t\\t\\t\\t\\t\\t(pMap->dwCallFlags & SOAPFLAG_PID))\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 32,\n \"score\": 322204.01961759035\n },\n {\n \"content\": \"// class CCryptUserSigKey\\n\\n// Obtains the user's signature key pair\\n\\nclass CCryptUserSigKey : public CCryptKey\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(CCryptProv &Prov) throw();\\n\\n\\tHRESULT Create(CCryptProv &Prov) throw();\\n\\n}; // class CCryptUserSigKey\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 33,\n \"score\": 317525.11420211906\n },\n {\n \"content\": \"// class CCryptUserExKey\\n\\n// Obtains the user's key exchange key pair.\\n\\nclass CCryptUserExKey : public CCryptKey\\n\\n{\\n\\npublic:\\n\\n\\tHRESULT Initialize(CCryptProv &Prov) throw();\\n\\n\\tHRESULT Create(CCryptProv &Prov) throw();\\n\\n}; // class CCryptUserExKey\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcrypt.h\",\n \"rank\": 34,\n \"score\": 317524.9922244907\n },\n {\n \"content\": \"// Use to update the value of a session variable\\n\\nclass CSessionDataUpdator : public CSessionDataBase\\n\\n{\\n\\npublic:\\n\\n\\tBEGIN_PARAM_MAP(CSessionDataUpdator) \\n\\n\\t\\tSET_PARAM_TYPE(DBPARAMIO_INPUT)\\n\\n\\t\\tCOLUMN_ENTRY_LENGTH(1, m_VariableValue, m_VariableLen)\\n\\n\\t\\tCOLUMN_ENTRY(2, m_szSessionID)\\n\\n\\t\\tCOLUMN_ENTRY(3, m_VariableName)\\n\\n\\tEND_PARAM_MAP()\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsession.h\",\n \"rank\": 35,\n \"score\": 317518.4051406988\n },\n {\n \"content\": \"// Use to select all session variables given the name of\\n\\n// of a session.\\n\\nclass CAllSessionDataSelector : public CSessionDataBase\\n\\n{\\n\\npublic:\\n\\n\\tBEGIN_COLUMN_MAP(CAllSessionDataSelector) \\n\\n\\t\\tCOLUMN_ENTRY(1, m_szSessionID)\\n\\n\\t\\tCOLUMN_ENTRY(2, m_VariableName)\\n\\n\\t\\tCOLUMN_ENTRY_LENGTH(3, m_VariableValue, m_VariableLen)\\n\\n\\tEND_COLUMN_MAP()\\n\\n\\tBEGIN_PARAM_MAP(CAllSessionDataSelector) \\n\\n\\t\\tSET_PARAM_TYPE(DBPARAMIO_INPUT)\\n\\n\\t\\tCOLUMN_ENTRY(1, m_szSessionID)\\n\\n\\tEND_PARAM_MAP()\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsession.h\",\n \"rank\": 36,\n \"score\": 317510.70096679556\n },\n {\n \"content\": \"// Use to select a session variable given the name\\n\\n// of a session and the name of a variable.\\n\\nclass CSessionDataSelector : public CSessionDataBase\\n\\n{\\n\\npublic:\\n\\n\\tBEGIN_COLUMN_MAP(CSessionDataSelector) \\n\\n\\t\\tCOLUMN_ENTRY(1, m_szSessionID)\\n\\n\\t\\tCOLUMN_ENTRY(2, m_VariableName)\\n\\n\\t\\tCOLUMN_ENTRY_LENGTH(3, m_VariableValue, m_VariableLen)\\n\\n\\tEND_COLUMN_MAP()\\n\\n\\tBEGIN_PARAM_MAP(CSessionDataSelector) \\n\\n\\t\\tSET_PARAM_TYPE(DBPARAMIO_INPUT)\\n\\n\\t\\tCOLUMN_ENTRY(1, m_szSessionID)\\n\\n\\t\\tCOLUMN_ENTRY(2, m_VariableName)\\n\\n\\tEND_PARAM_MAP()\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsession.h\",\n \"rank\": 37,\n \"score\": 317510.70096679556\n },\n {\n \"content\": \"class CSecBuffer : public SecBuffer\\n\\n{\\n\\npublic:\\n\\n\\tCSecBuffer() throw()\\n\\n\\t{\\n\\n\\t\\tcbBuffer = 0;\\n\\n\\t\\tBufferType = 0;\\n\\n\\t\\tpvBuffer = NULL;\\n\\n\\t\\tm_cbAlloc = 0;\\n\\n\\t}\\n\\n\\n\\n\\t~CSecBuffer() throw()\\n\\n\\t{\\n\\n\\t\\tdelete [] static_cast<unsigned char*>(pvBuffer);\\n\\n\\t}\\n\\n\\n\\n\\tbool SetSize(unsigned long nSize) throw()\\n\\n\\t{\\n\\n\\t\\tif (!nSize)\\n\\n\\t\\t\\treturn false;\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhttp.h\",\n \"rank\": 38,\n \"score\": 315266.5866452913\n },\n {\n \"content\": \"class CStreamOnWriteStream : public IStream\\n\\n{\\n\\npublic:\\n\\n\\tIWriteStream *m_pWriteStream;\\n\\n\\n\\n\\tCStreamOnWriteStream()\\n\\n\\t{\\n\\n\\t\\tm_pWriteStream = NULL;\\n\\n\\t}\\n\\n\\n\\n\\tvoid Init(IWriteStream *pWriteStream)\\n\\n\\t{\\n\\n\\t\\tm_pWriteStream = pWriteStream;\\n\\n\\t}\\n\\n\\n\\n\\t// IUnknown methods\\n\\n\\tSTDMETHOD(QueryInterface)(REFIID riid, void **ppv)\\n\\n\\t{\\n\\n\\t\\tif (!ppv)\\n\\n\\t\\t\\treturn E_POINTER;\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhtml.h\",\n \"rank\": 39,\n \"score\": 315266.5866452913\n },\n {\n \"content\": \"class CDllCache : public IDllCache, \\n\\n\\tpublic IWorkerThreadClient\\n\\n{\\n\\nprotected:\\n\\n\\tCComCriticalSection m_critSec;\\n\\n\\tCSimpleArray<DLL_CACHE_ENTRY> m_Dlls;\\n\\n\\tCSimpleArray<typename Peer::DllInfo> m_DllInfos;\\n\\n\\tMonitorClass m_Monitor;\\n\\n\\tHANDLE m_hTimer;\\n\\n\\n\\n\\tvoid RemoveDllEntry(DLL_CACHE_ENTRY& entry)\\n\\n\\t{\\n\\n\\t\\t::FreeLibrary(entry.hInstDll);\\n\\n\\t\\tentry.hInstDll = NULL;\\n\\n\\t\\tm_Dlls.RemoveAt(m_Dlls.GetSize()-1);\\n\\n\\t}\\n\\n\\n\\npublic:\\n\\n\\tPeer m_Peer;\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 40,\n \"score\": 315266.5866452913\n },\n {\n \"content\": \"// Least recently used flusher -- the item that was accessed the longest time ago is flushed\\n\\nclass CLRUFlusher : public COldFlusher\\n\\n{\\n\\npublic:\\n\\n\\t// Move it to the tail of the list\\n\\n\\tvoid Access(CFlusherCacheData * pItem)\\n\\n\\t{\\n\\n\\t\\tATLASSERT(pItem);\\n\\n\\n\\n\\t\\tRemove(pItem);\\n\\n\\t\\tAdd(pItem);\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 41,\n \"score\": 315266.5866452913\n },\n {\n \"content\": \"// Least often used flusher\\n\\nclass CLOUFlusher : public COldFlusher\\n\\n{\\n\\npublic:\\n\\n\\t// Adds to the tail of the list\\n\\n\\tvoid Add(CFlusherCacheData * pItem)\\n\\n\\t{\\n\\n\\t\\tATLENSURE(pItem);\\n\\n\\t\\tpItem->dwAccessed = 1;\\n\\n\\t\\tCOldFlusher::Add(pItem);\\n\\n\\t}\\n\\n\\n\\n\\tvoid Access(CFlusherCacheData * pItem)\\n\\n\\t{\\n\\n\\t\\tATLENSURE(pItem);\\n\\n\\t\\tpItem->dwAccessed++;\\n\\n\\n\\n\\t\\tCFlusherCacheData * pMark = static_cast<CFlusherCacheData *>(pItem->pPrev);\\n\\n\\t\\tif (!pMark) // The item is already at the head\\n\\n\\t\\t\\treturn;\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 42,\n \"score\": 315266.5866452913\n },\n {\n \"content\": \"class CHtmlGen : public CHtmlGenBase<CHtmlGen>\\n\\n{\\n\\npublic:\\n\\n};\\n\\n\\n\\n} // namespace ATL\\n\\n#pragma pack(pop)\\n\\n\\n\\n#endif // __ATLHTML_H__\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhtml.h\",\n \"rank\": 43,\n \"score\": 310578.643491805\n },\n {\n \"content\": \"\\tclass CBrowserCaps : public IBrowserCaps, public CComObjectRootEx<CComSingleThreadModel>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\n\\n\\t\\tBEGIN_COM_MAP(CBrowserCaps)\\n\\n\\t\\t\\tCOM_INTERFACE_ENTRY(IBrowserCaps)\\n\\n\\t\\tEND_COM_MAP()\\n\\n\\n\\n\\t\\tCBrowserCaps()\\n\\n\\t\\t{\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tHRESULT Initialize(__in CBrowserCapsSvc::BrowserCaps * pCaps)\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_pCaps = pCaps;\\n\\n\\t\\t\\treturn S_OK;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t__checkReturn HRESULT GetPropertyString(__in BSTR bstrProperty, __out BSTR * pbstrOut)\\n\\n\\t\\t{\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsiface.h\",\n \"rank\": 44,\n \"score\": 310292.780393124\n },\n {\n \"content\": \"// This class represents the information about a file that has been uploaded to the web server.\\n\\nclass CHttpRequestFile : public IHttpFile\\n\\n{\\n\\nprivate:\\n\\n\\n\\n\\t// The name of the form field used to upload the file.\\n\\n\\tCHAR m_szParamName[MAX_TOKEN_LENGTH];\\n\\n\\n\\n\\t// The original file name of the uploaded file as set by the client.\\n\\n\\tCHAR m_szFileName[MAX_PATH];\\n\\n\\n\\n\\t// The original path and file name of the uploaded file as set by the client.\\n\\n\\tCHAR m_szFullFileName[MAX_PATH];\\n\\n\\n\\n\\t// The MIME type of the uploaded file.\\n\\n\\tCHAR m_szContentType[MAX_TOKEN_LENGTH];\\n\\n\\n\\n\\t// The name of the uploaded file on the server.\\n\\n\\tCHAR m_szTempFileName[MAX_PATH];\\n\\n\\n\\n\\t// The size of the file in bytes.\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 45,\n \"score\": 309955.6746761324\n },\n {\n \"content\": \"class CStreamOnServerContext : public IStreamImpl\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\\n\\n\\t{\\n\\n\\t\\tif (ppv == NULL)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn E_POINTER;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t*ppv = NULL;\\n\\n\\n\\n\\t\\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_IStream) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_ISequentialStream))\\n\\n\\t\\t{\\n\\n\\t\\t\\t*ppv = static_cast<IStream *>(this);\\n\\n\\t\\t\\treturn S_OK;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 46,\n \"score\": 309948.0554627043\n },\n {\n \"content\": \"\\tclass CPADGenerator : public CDocLiteralGenerator\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\n\\n\\t\\tvirtual HRESULT StartEntry(IWriteStream *pStream, const _soapmap *pMap, const _soapmapentry *pEntry)\\n\\n\\t\\t{\\n\\n\\t\\t\\tATLENSURE_RETURN( pStream != NULL );\\n\\n\\t\\t\\tATLENSURE_RETURN( pEntry != NULL );\\n\\n\\n\\n\\t\\t\\tHRESULT hr = __super::StartEntry(pStream, pMap, pEntry);\\n\\n\\t\\t\\tif (SUCCEEDED(hr) && (pMap->dwCallFlags & SOAPFLAG_PAD))\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\thr = pStream->WriteStream(\\\" xmlns=\\\\\\\"\\\", sizeof(\\\" xmlns=\\\\\\\"\\\")-1, NULL);\\n\\n\\t\\t\\t\\tif (SUCCEEDED(hr))\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\thr = pStream->WriteStream(pMap->szNamespace, pMap->cchNamespace, NULL);\\n\\n\\t\\t\\t\\t\\tif (SUCCEEDED(hr))\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\thr = pStream->WriteStream(\\\"\\\\\\\"\\\", sizeof(\\\"\\\\\\\"\\\")-1, NULL);\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\treturn hr;\\n\\n\\t\\t}\\n\\n\\t}; // class CPADGenerator\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 47,\n \"score\": 309948.0554627043\n },\n {\n \"content\": \"\\tclass CPIDGenerator : public CDocLiteralGenerator\\n\\n\\t{\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 48,\n \"score\": 309948.0554627043\n },\n {\n \"content\": \"class _CComObjectHeapNoLock : public Base\\n\\n{\\n\\n\\tpublic:\\n\\n\\ttypedef Base _BaseClass;\\n\\n\\tHANDLE m_hHeap;\\n\\n\\n\\n\\t_CComObjectHeapNoLock(void* = NULL, HANDLE hHeap = NULL)\\n\\n\\t{\\n\\n\\t\\tm_hHeap = hHeap;\\n\\n\\t}\\n\\n\\t// Set refcount to -(LONG_MAX/2) to protect destruction and \\n\\n\\t// also catch mismatched Release in debug builds\\n\\n\\t~_CComObjectHeapNoLock()\\n\\n\\t{\\n\\n\\t\\tm_dwRef = -(LONG_MAX/2);\\n\\n\\t\\tFinalRelease();\\n\\n#ifdef _ATL_DEBUG_INTERFACES\\n\\n\\t\\t_AtlDebugInterfacesModule.DeleteNonAddRefThunk(_GetRawUnknown());\\n\\n#endif\\n\\n\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 49,\n \"score\": 309948.0554627043\n },\n {\n \"content\": \"class CReadStreamOnSocket : public IStreamImpl\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\\n\\n\\t{\\n\\n\\t\\tif (ppv == NULL)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn E_POINTER;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t*ppv = NULL;\\n\\n\\n\\n\\t\\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_IStream) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_ISequentialStream))\\n\\n\\t\\t{\\n\\n\\t\\t\\t*ppv = static_cast<IStream *>(this);\\n\\n\\t\\t\\treturn S_OK;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 50,\n \"score\": 309948.0554627043\n },\n {\n \"content\": \"class CReadStreamOnInet : public IStreamImpl\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\\n\\n\\t{\\n\\n\\t\\tif (ppv == NULL)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn E_POINTER;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t*ppv = NULL;\\n\\n\\n\\n\\t\\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_IStream) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_ISequentialStream))\\n\\n\\t\\t{\\n\\n\\t\\t\\t*ppv = static_cast<IStream *>(this);\\n\\n\\t\\t\\treturn S_OK;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 51,\n \"score\": 309948.0554627043\n },\n {\n \"content\": \"class CBrowserCapsSvc : public IBrowserCapsSvc, \\n\\n\\t\\t\\t\\t\\t\\tpublic CComObjectRootEx<CComSingleThreadModel>\\n\\n{\\n\\npublic:\\n\\n\\tvirtual ~CBrowserCapsSvc()\\n\\n\\t{\\n\\n\\t}\\n\\n\\t\\n\\n\\tBEGIN_COM_MAP(CBrowserCapsSvc)\\n\\n\\t\\tCOM_INTERFACE_ENTRY(IBrowserCapsSvc)\\n\\n\\tEND_COM_MAP()\\n\\n\\n\\n\\t__success(SUCCEEDED(return)) __checkReturn HRESULT GetCaps(__in IHttpServerContext * pContext, __deref_out_opt IBrowserCaps ** ppOut)\\n\\n\\t{\\n\\n\\t\\tif (!pContext)\\n\\n\\t\\t\\treturn E_POINTER;\\n\\n\\n\\n\\t\\tif (!ppOut)\\n\\n\\t\\t\\treturn E_POINTER;\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsiface.h\",\n \"rank\": 52,\n \"score\": 304861.95354555815\n },\n {\n \"content\": \"class CSkipHandler : public ISAXContentHandlerImpl\\n\\n{\\n\\npublic:\\n\\n\\tvirtual ~CSkipHandler()\\n\\n\\t{\\n\\n\\t}\\n\\n\\t\\n\\n\\tHRESULT __stdcall QueryInterface(REFIID riid, void **ppv)\\n\\n\\t{\\n\\n\\t\\tif (ppv == NULL)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn E_POINTER;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t*ppv = NULL;\\n\\n\\n\\n\\t\\tif (InlineIsEqualGUID(riid, IID_IUnknown) ||\\n\\n\\t\\t\\tInlineIsEqualGUID(riid, IID_ISAXContentHandler))\\n\\n\\t\\t{\\n\\n\\t\\t\\t*ppv = static_cast<ISAXContentHandler *>(this);\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 53,\n \"score\": 304861.95354555815\n },\n {\n \"content\": \"class CSecBufferDesc : public SecBufferDesc\\n\\n{\\n\\npublic:\\n\\n\\tCSecBufferDesc() throw()\\n\\n\\t{\\n\\n\\t\\tulVersion = SECBUFFER_VERSION;\\n\\n\\t\\tcBuffers = 0;\\n\\n\\t\\tpBuffers = NULL;\\n\\n\\t}\\n\\n\\n\\n\\t~CSecBufferDesc() throw()\\n\\n\\t{\\n\\n\\t\\tcBuffers = 0;\\n\\n\\n\\n\\t\\tif (pBuffers)\\n\\n\\t\\t{\\n\\n\\t\\t\\tCSecBuffer *psb = (CSecBuffer*)pBuffers;\\n\\n\\t\\t\\tdelete [] psb;\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhttp.h\",\n \"rank\": 54,\n \"score\": 304861.95354555815\n },\n {\n \"content\": \"class CAtlNavigateData : public ATL_NAVIGATE_DATA\\n\\n{\\n\\npublic:\\n\\n\\tCAtlNavigateData() throw(); // public construction\\n\\n\\tCAtlNavigateData(const CAtlNavigateData &rhs);\\n\\n\\tCAtlNavigateData(const ATL_NAVIGATE_DATA &rhs);\\n\\n\\tCAtlNavigateData& operator=(const CAtlNavigateData &rhs);\\n\\n\\tCAtlNavigateData& operator=(const ATL_NAVIGATE_DATA &rhs);\\n\\n\\tDWORD SetFlags(DWORD dwNewFlags) throw(); // set all flags\\n\\n\\tDWORD GetFlags() throw(); // get value of flags\\n\\n\\tDWORD AddFlags(DWORD dwFlagsToAdd) throw(); // add one or more flags to existing flags\\n\\n\\tDWORD RemoveFlags(DWORD dwFlagsToRemove) throw(); // remove one or more flags from existing flags\\n\\n\\tLPCTSTR SetExtraHeaders(LPCTSTR szNewHeaders) throw(); // set the extra request headers\\n\\n\\tLPCTSTR GetExtraHeaders() throw(); // get the extra request headers\\n\\n\\tLPCTSTR SetMethod(LPCTSTR szNewMethod) throw(); // set the HTTP request method\\n\\n\\tLPCTSTR GetMethod() throw(); // get the HTTP request method\\n\\n\\tshort SetPort(short newPort) throw(); // set the TCP port for this request\\n\\n\\tshort GetPort() throw(); // get the TCP port for this request\\n\\n\\tvoid SetPostData(BYTE *pData, DWORD dwDataLen, LPCTSTR szDataType) throw(); // Set data to be sent as the reqeust entity body\\n\\n\\tDWORD SetSocketTimeout(DWORD dwNewTimeout) throw(); // Set the timeout for this socket\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhttp.h\",\n \"rank\": 55,\n \"score\": 304861.95354555803\n },\n {\n \"content\": \"class CBlobCache : public CMemoryCache<void*, StatClass, FlushClass, CFixedStringKey, \\n\\n\\tCStringElementTraits<CFixedStringKey >, SyncObj, CullClass>,\\n\\n\\tpublic IMemoryCache,\\n\\n\\tpublic IMemoryCacheControl,\\n\\n\\tpublic IMemoryCacheStats,\\n\\n\\tpublic IWorkerThreadClient\\n\\n{\\n\\n\\ttypedef CMemoryCache<void*, StatClass, FlushClass, CFixedStringKey, \\n\\n\\t\\tCStringElementTraits<CFixedStringKey>, SyncObj, CullClass> cacheBase;\\n\\n\\n\\n\\tMonitorClass m_Monitor;\\n\\n\\n\\nprotected:\\n\\n\\tHANDLE m_hTimer;\\n\\n\\n\\npublic:\\n\\n\\tCBlobCache() : m_hTimer(NULL)\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlcache.h\",\n \"rank\": 56,\n \"score\": 304428.098232622\n },\n {\n \"content\": \"class CSoapFaultParser : public ISAXContentHandlerImpl\\n\\n{\\n\\nprivate:\\n\\n\\n\\n\\tCSoapFault *m_pFault;\\n\\n\\n\\n\\tDWORD m_dwState;\\n\\n\\n\\n\\tconst static DWORD STATE_ERROR = 0;\\n\\n\\tconst static DWORD STATE_ENVELOPE = 1;\\n\\n\\tconst static DWORD STATE_BODY = 2;\\n\\n\\tconst static DWORD STATE_START = 4;\\n\\n\\tconst static DWORD STATE_FAULTCODE = 8;\\n\\n\\tconst static DWORD STATE_FAULTSTRING = 16;\\n\\n\\tconst static DWORD STATE_FAULTACTOR = 32;\\n\\n\\tconst static DWORD STATE_DETAIL = 64;\\n\\n\\tconst static DWORD STATE_RESET = 128;\\n\\n\\tconst static DWORD STATE_SKIP = 256;\\n\\n\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 57,\n \"score\": 299993.37034460105\n },\n {\n \"content\": \"class CSoapRootHandler : public ISAXContentHandlerImpl\\n\\n{\\n\\nprivate:\\n\\n\\n\\n\\tfriend class _CSDLGenerator;\\n\\n\\n\\n\\t//\\n\\n\\t// state constants\\n\\n\\t//\\n\\n\\tconst static DWORD SOAP_START = 0;\\n\\n\\tconst static DWORD SOAP_ENVELOPE = 1;\\n\\n\\tconst static DWORD SOAP_HEADERS = 2;\\n\\n\\tconst static DWORD SOAP_BODY = 3;\\n\\n\\tconst static DWORD SOAP_PARAMS = 4;\\n\\n\\tconst static DWORD SOAP_CALLED = 5;\\n\\n\\tconst static DWORD SOAP_RESPONSE = 6;\\n\\n\\tconst static DWORD SOAP_HEADERS_DONE = 7;\\n\\n\\n\\n\\t//\\n\\n\\t// hash values for SOAP namespaces and elements\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 58,\n \"score\": 299993.370344601\n },\n {\n \"content\": \"class BCGCBPRODLLEXPORT CBCGPAnimCtrl : public CStatic\\n\\n{\\n\\n\\tDECLARE_DYNAMIC(CBCGPAnimCtrl)\\n\\n\\n\\n// Construction\\n\\npublic:\\n\\n\\tCBCGPAnimCtrl();\\n\\n\\n\\n// Attributes\\n\\npublic:\\n\\n\\tBOOL IsRunning () const\\n\\n\\t{\\n\\n\\t\\treturn m_bIsRunning;\\n\\n\\t}\\n\\n\\n\\nprotected:\\n\\n\\tCSize\\t\\tm_sizeFrame;\\n\\n\\tCOLORREF\\tm_clrBack;\\n\\n\\tCImageList\\tm_imagesAnim;\\n\\n\\tCImageList*\\tm_pImagesAnim;\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPAnimCtrl.h\",\n \"rank\": 59,\n \"score\": 298167.39847499575\n },\n {\n \"content\": \"\\tclass CParseErrorProvider : public ITagReplacerImpl<CParseErrorProvider>,\\n\\n\\t\\tpublic CComObjectRootEx<CComSingleThreadModel>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tBEGIN_COM_MAP(CParseErrorProvider)\\n\\n\\t\\t\\tCOM_INTERFACE_ENTRY(ITagReplacer)\\n\\n\\t\\tEND_COM_MAP()\\n\\n\\t\\tCSimpleArray<ParseError> *m_pErrors;\\n\\n\\t\\tint m_nCurrentError;\\n\\n\\n\\n\\t\\tCParseErrorProvider() throw() :\\n\\n\\t\\t\\tm_pErrors(NULL),\\n\\n\\t\\t\\tm_nCurrentError(-1)\\n\\n\\t\\t{\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tvoid Initialize(CSimpleArray<ParseError> *pErrors) throw()\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_pErrors = pErrors;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlstencil.h\",\n \"rank\": 60,\n \"score\": 297507.3195771926\n },\n {\n \"content\": \"\\tclass CParseStateElementTraits : public CDefaultElementTraits<ParseState>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t// CBitVector relocate fixup\\n\\n\\t\\tstatic void RelocateElements( ParseState* pDest, ParseState* pSrc, size_t nElements )\\n\\n\\t\\t{\\n\\n\\t\\t\\tCDefaultElementTraits<ParseState>::RelocateElements(pDest, pSrc, nElements);\\n\\n\\n\\n\\t\\t\\t// fixup CBitVector\\n\\n\\t\\t\\tfor (size_t i=0; i<nElements; i++)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tpDest[i].RelocateFixup();\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlsoap.h\",\n \"rank\": 61,\n \"score\": 297507.3195771926\n },\n {\n \"content\": \"//\\n\\n// Security Service Provider Interface (sspi) Helper classes\\n\\n// These classes are used as helpers for structures used in \\n\\n// SSPI functions.\\n\\n//\\n\\nclass CSecAuthIdentity : public SEC_WINNT_AUTH_IDENTITY_EX\\n\\n{\\n\\npublic:\\n\\n\\tCSecAuthIdentity() throw()\\n\\n\\t{\\n\\n\\t\\tVersion = SEC_WINNT_AUTH_IDENTITY_VERSION;\\n\\n\\t\\tLength = sizeof(SEC_WINNT_AUTH_IDENTITY_EX);\\n\\n#ifdef _UNICODE\\n\\n\\t\\tFlags = SEC_WINNT_AUTH_IDENTITY_UNICODE;\\n\\n#else\\n\\n\\t\\tFlags = SEC_WINNT_AUTH_IDENTITY_ANSI;\\n\\n#endif\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\tbool Init(IAuthInfo *pAuthInfo) throw()\\n\\n\\t{\\n\\n\\t\\tif (!pAuthInfo)\\n\\n\\t\\t\\treturn false;\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlhttp.h\",\n \"rank\": 62,\n \"score\": 295337.188063456\n },\n {\n \"content\": \"class CTransferServerContext : public CComObjectRootEx<CComMultiThreadModel>,\\n\\n\\tpublic CWrappedServerContext\\n\\n{\\n\\npublic:\\n\\n\\tchar m_szFileName[MAX_PATH];\\n\\n\\tchar m_szQueryString[ATL_URL_MAX_PATH_LENGTH+1];\\n\\n\\tCStringA m_strUrl;\\n\\n\\tIWriteStream *m_pStream;\\n\\n\\n\\n\\tBEGIN_COM_MAP(CTransferServerContext)\\n\\n\\t\\tCOM_INTERFACE_ENTRY(IHttpServerContext)\\n\\n\\tEND_COM_MAP()\\n\\n\\n\\n\\tCTransferServerContext() throw()\\n\\n\\t{\\n\\n\\t\\tm_pStream = NULL;\\n\\n\\t}\\n\\n\\n\\n\\tBOOL Initialize(__in CTransferServerContext *pOtherContext)\\n\\n\\t{\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 63,\n \"score\": 295282.3584714876\n },\n {\n \"content\": \"class BCGCBPRODLLEXPORT CBCGPBaseVisualCtrl : public CStatic\\n\\n{\\n\\n\\tDECLARE_DYNAMIC(CBCGPBaseVisualCtrl)\\n\\n\\n\\n// Construction\\n\\npublic:\\n\\n\\tCBCGPBaseVisualCtrl();\\n\\n\\n\\n// Operations\\n\\npublic:\\n\\n\\tvoid SetGraphicsManager(CBCGPGraphicsManager::BCGP_GRAPHICS_MANAGER manager, CBCGPGraphicsManagerParams* pParams = NULL);\\n\\n\\tvoid SetGraphicsManager(CRuntimeClass* pRTI);\\n\\n\\n\\n\\tvoid EnableTooltip(BOOL bEnable = TRUE, BOOL bTooltipTrackingMode = FALSE);\\n\\n\\tBOOL IsTooltipEnabled() const {return m_bIsTooltip;}\\n\\n\\n\\n\\tBOOL CreatePopup(const CRect& rect, BYTE nTransparency = 255 /* from 0 to 255 */, CWnd* pWndOwner = NULL);\\n\\n\\tstatic BOOL HasActivePopup()\\n\\n\\t{\\n\\n\\t\\treturn m_hwndHookedPopup != NULL;\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualCtrl.h\",\n \"rank\": 64,\n \"score\": 293292.8792399687\n },\n {\n \"content\": \"class PerThreadWrapper : public CComObjectNoLock<T>\\n\\n{\\n\\npublic:\\n\\n\\tvoid *operator new(size_t /*size*/, void *p) throw()\\n\\n\\t{\\n\\n\\t\\treturn p;\\n\\n\\t}\\n\\n\\n\\n\\tvoid operator delete(void * /*p*/) throw()\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\tSTDMETHOD_(ULONG, Release)() throw()\\n\\n\\t{\\n\\n\\t\\tULONG l = InternalRelease();\\n\\n\\t\\tif (l == 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\tT *pT = static_cast<T*>(this);\\n\\n\\t\\t\\tATLASSERT(pT->m_spExtension != NULL);\\n\\n\\t\\t\\tCIsapiWorker *pWorker = pT->m_spExtension->GetThreadWorker();\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 65,\n \"score\": 293021.2182488964\n },\n {\n \"content\": \"class BCGCBPRODLLEXPORT CBCGPEditListBase : public CStatic\\n\\n{\\n\\n// Construction\\n\\nprotected:\\n\\n\\tCBCGPEditListBase();\\n\\n\\n\\n\\tCList<CBCGPButton*, CBCGPButton*>\\tm_lstButtons;\\n\\n\\tCList<DWORD, DWORD>\\t\\t\\t\\tm_lstKeyAccell;\\n\\n\\tCMap<int,int,UINT,UINT>\\t\\t\\tm_mapButtonIDs;\\n\\n\\tCSize\\t\\t\\t\\t\\t\\t\\tm_sizeButton;\\n\\n\\tCRect\\t\\t\\t\\t\\t\\t\\tm_rectCaption;\\n\\n\\tUINT\\t\\t\\t\\t\\t\\t\\tm_uiStandardBtns;\\n\\n\\tBOOL\\t\\t\\t\\t\\t\\t\\tm_bNewItem;\\n\\n\\tCFont\\t\\t\\t\\t\\t\\t\\tm_font;\\n\\n\\tBOOL\\t\\t\\t\\t\\t\\t\\tm_bIsActualDelete;\\t// Indicated that Items is really deletd, not moved\\n\\n\\tBOOL\\t\\t\\t\\t\\t\\t\\tm_bBrowseButton;\\n\\n\\tBOOL\\t\\t\\t\\t\\t\\t\\tm_bGrayDisabledButtons;\\n\\n\\tCString\\t\\t\\t\\t\\t\\t\\tm_strCaption;\\n\\n\\tBOOL\\t\\t\\t\\t\\t\\t\\tm_bDefaultCaption;\\n\\n\\tBOOL\\t\\t\\t\\t\\t\\t\\tm_bVisualManagerStyle;\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPEditListBox.h\",\n \"rank\": 66,\n \"score\": 288622.46539098845\n },\n {\n \"content\": \"class BCGCBPRODLLEXPORT CBCGPRibbonTreeCtrl : public CStatic\\n\\n{\\n\\n\\t// Construction\\n\\npublic:\\n\\n\\tCBCGPRibbonTreeCtrl(CBCGPRibbonCustomizationData* /*pCustomizationData*/, CBCGPRibbonBar* /*pRibbonBar*/)\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\tvoid RebuildItems(int /*nRibbonTabsDest*/, LPCTSTR /*lpszMainTabsCaption*/) {}\\n\\n\\tvoid RebuildItems(const CArray<CBCGPBaseRibbonElement*, CBCGPBaseRibbonElement*>& /*arElements*/) {}\\n\\n\\t\\n\\n\\tBOOL MoveSelection(BOOL /*bMoveNext*/) { return FALSE; }\\n\\n};\\n\\n\\n\\n#endif\\n\\n#endif\\n\\n\\n\\n/////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n//{{AFX_INSERT_LOCATION}}\\n\\n// Microsoft Visual C++ will insert additional declarations immediately before the previous line.\\n\\n\\n\\n#endif // !defined(AFX_BCGPRIBBONTREECTRL_H__C48070ED_1185_47B5_9CBF_786C88E122A6__INCLUDED_)\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonTreeCtrl.h\",\n \"rank\": 67,\n \"score\": 288622.46539098845\n },\n {\n \"content\": \"//\\n\\n// The base parser class\\n\\n//\\n\\nclass CParserBase : public ISAXContentHandler, public CDummy1, public CDummy2\\n\\n{\\n\\nprivate:\\n\\n\\t\\n\\n\\tCComPtr<CParserBase> m_spParent;\\n\\n\\tCComPtr<ISAXXMLReader> m_spReader;\\n\\n\\tCComPtr<ISAXLocator> m_spLocator;\\n\\n\\n\\n\\t//\\n\\n\\t// how many levels deep\\n\\n\\t//\\n\\n\\tDWORD m_dwLevel;\\n\\n\\n\\n\\t//\\n\\n\\t// reset to parent handler on endElement\\n\\n\\t//\\n\\n\\tDWORD m_dwReset;\\n\\n\\n\\n\\t//\\n\\n\\t// get only top-level attributes\\n\",\n \"file_path\": \"Src/VC/atlserver/source/SProxy/Parser.h\",\n \"rank\": 68,\n \"score\": 281261.6563486251\n },\n {\n \"content\": \"class QWT_EXPORT QwtCPointerData: public QwtSeriesData<QPointF>\\n\\n{\\n\\npublic:\\n\\n QwtCPointerData( const double *x, const double *y, size_t size );\\n\\n\\n\\n virtual QRectF boundingRect() const;\\n\\n virtual size_t size() const;\\n\\n virtual QPointF sample( size_t i ) const;\\n\\n\\n\\n const double *xData() const;\\n\\n const double *yData() const;\\n\\n\\n\\nprivate:\\n\\n const double *d_x;\\n\\n const double *d_y;\\n\\n size_t d_size;\\n\\n};\\n\\n\\n\\n/*!\\n\\n \\\\brief Synthetic point data\\n\",\n \"file_path\": \"Src/Qt/qwt/src/qwt_point_data.h\",\n \"rank\": 69,\n \"score\": 280289.07382992667\n },\n {\n \"content\": \"class CAssertValidField< PERF_SIZE_LARGE >\\n\\n{\\n\\npublic:\\n\\n\\ttemplate< class C > static void AssertValidFieldType( ULONGLONG C::* ) throw() { }\\n\\n\\ttemplate< class C > static void AssertValidFieldType( LONGLONG C::* ) throw() { }\\n\\n};\\n\\n\\n\\n#define DEFINE_COUNTER_EX(member, dwCounterId, namestring, helpstring, detail, countertype, maxcountersize, defscale) \\\\\\n\\n\\t\\t\\tCAssertValidField< (countertype) & ATLPERF_SIZE_MASK >::AssertValidFieldType( &_PerfCounterClass::member ); \\\\\\n\\n\\t\\t\\thr = pPerf->RegisterCounter(wLanguage, hResInstance, dwCounterId, namestring, helpstring, detail, countertype, maxcountersize, (ULONG) offsetof(_PerfCounterClass, member), defscale); \\\\\\n\\n\\t\\t\\tif (FAILED(hr)) \\\\\\n\\n\\t\\t\\t\\treturn hr;\\n\\n\\n\\n#define END_PERF_MAP() \\\\\\n\\n\\t\\t\\treturn S_OK; \\\\\\n\\n\\t\\t}\\n\\n\\n\\n#define END_COUNTER_MAP() \\\\\\n\\n\\t\\t\\treturn S_OK; \\\\\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlperf.h\",\n \"rank\": 70,\n \"score\": 274773.4125642808\n },\n {\n \"content\": \"class CAssertValidField< PERF_SIZE_DWORD >\\n\\n{\\n\\npublic:\\n\\n\\ttemplate< class C > static void AssertValidFieldType( ULONG C::* ) throw() { }\\n\\n\\ttemplate< class C > static void AssertValidFieldType( LONG C::* ) throw() { }\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlperf.h\",\n \"rank\": 71,\n \"score\": 274773.4125642808\n },\n {\n \"content\": \"class CHttpPtrMap : public CHttpMap<K, V, KTraits, VTraits>\\n\\n{\\n\\npublic:\\n\\n\\ttypedef CHttpMap<K, V, KTraits, VTraits> Base;\\n\\n\\n\\n\\tvoid RemoveAll()\\n\\n\\t{\\n\\n\\t\\tif (!IsShared())\\n\\n\\t\\t{\\n\\n\\t\\t\\tPOSITION pos = GetStartPosition();\\n\\n\\t\\t\\twhile (pos)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tGetNextValue(pos)->Free();\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tBase::RemoveAll();\\n\\n\\t}\\n\\n\\n\\n\\t~CHttpPtrMap()\\n\\n\\t{\\n\\n\\t\\tRemoveAll();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Src/VC/atlserver/include/atlisapi.h\",\n \"rank\": 72,\n \"score\": 274627.5157434441\n },\n {\n \"content\": \"class CCodeTypedElement : public CCodeElement, public CCodeType\\n\\n{\\n\\nprivate:\\n\\n\\n\\n\\tCXSDElement * m_pElement;\\n\\n\\tCAtlArray<int> m_arrDims;\\n\\n\\t\\n\\n\\tCStringA m_strSizeIs;\\n\\n\\t\\n\\n\\tCStringW m_strNamespace;\\n\\n\\t\\n\\npublic:\\n\\n\\n\\n\\tCCodeTypedElement()\\n\\n\\t\\t:m_pElement(NULL)\\n\\n\\t{\\n\\n\\t}\\n\\n\\t\\n\\n\\tinline HRESULT SetNamespace(const CStringW& strNamespace)\\n\\n\\t{\\n\",\n \"file_path\": \"Src/VC/atlserver/source/SProxy/CodeTypes.h\",\n \"rank\": 73,\n \"score\": 272855.5193449348\n },\n {\n \"content\": \"class CButtonsList : public CButton\\n\\n{\\n\\n// Construction\\n\\npublic:\\n\\n\\tCButtonsList();\\n\\n\\n\\n// Operations\\n\\npublic:\\n\\n\\tvoid SetImages (CBCGPToolBarImages* pImages);\\n\\n\\tvoid AddButton (CBCGPToolbarButton* pButton);\\n\\n\\tvoid RemoveButtons ();\\n\\n\\n\\n\\tCBCGPToolbarButton* GetSelectedButton () const\\n\\n\\t{\\n\\n\\t\\treturn m_pSelButton;\\n\\n\\t}\\n\\n\\n\\n\\tBOOL SelectButton (int iImage);\\n\\n\\tvoid EnableDragFromList (BOOL bEnable = TRUE)\\n\\n\\t{\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/ButtonsList.h\",\n \"rank\": 74,\n \"score\": 272726.7623854439\n },\n {\n \"content\": \"\\tclass XElementGroup: public XElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementGroup();\\n\\n\\t\\tvirtual ~XElementGroup();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tXImage\\t\\t\\tm_Images;\\n\\n\\t\\tXArrayElement\\tm_arButtons;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 75,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XElementSeparator: public XElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementSeparator();\\n\\n\\t\\tvirtual ~XElementSeparator();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\t\\tBOOL\\t\\t\\tm_bIsHoriz;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 76,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XElementButton: public XElement\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tXElementButton(const CString& strElementName);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tXElementButton();\\n\\n\\t\\tvirtual ~XElementButton();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tint\\t\\t\\t\\tm_nSmallImageIndex;\\n\\n\\t\\tint\\t\\t\\t\\tm_nLargeImageIndex;\\n\\n\\t\\tBOOL\\t\\t\\tm_bIsDefaultCommand;\\n\\n\\t\\tBOOL\\t\\t\\tm_bIsAlwaysShowDescription;\\n\\n\\t\\tCBCGPRibbonButton::RibbonButtonOnQAT\\n\\n\\t\\t\\t\\t\\t\\tm_QATType;\\n\\n\\t\\tXArrayElement\\tm_arSubItems;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 77,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XDiagramElement: public XElement\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tXDiagramElement(const CString& strElementName);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvirtual ~XDiagramElement();\\n\\n\\n\\n\\t\\tstatic XDiagramElement* CreateFromName (const CString& name);\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tXDiagramID\\tm_idItem;\\n\\n\\t\\tXArrayData\\tm_arDataObjects;\\n\\n\\t\\tCBCGPBrush\\tm_brFill;\\n\\n\\t\\tCBCGPBrush\\tm_brOutline;\\n\\n\\t\\tCBCGPBrush\\tm_brShadow;\\n\\n\\n\\n\\t\\tCString\\t\\tm_strCustomName;\\n\\n\\t\\tCString\\t\\tm_strCustomProps;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 78,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XElementSlider: public XElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementSlider();\\n\\n\\t\\tvirtual ~XElementSlider();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tDWORD\\t\\t\\tm_dwStyle;\\n\\n\\t\\tint\\t\\t\\t\\tm_nWidth;\\n\\n\\t\\tint\\t\\t\\t\\tm_nMin;\\n\\n\\t\\tint\\t\\t\\t\\tm_nMax;\\n\\n\\t\\tint\\t\\t\\t\\tm_nPos;\\n\\n\\t\\tBOOL\\t\\t\\tm_bZoomButtons;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 79,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XGaugeData : public XData\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tvirtual ~XGaugeData ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tXGaugeData (const CString& strName);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tint\\t\\t\\tm_nScale;\\n\\n\\t\\tCBCGPBrush\\tm_brFill;\\n\\n\\t\\tCBCGPBrush\\tm_brOutline;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 80,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XGaugeElement: public XElement\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tXGaugeElement(const CString& strElementName);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvirtual ~XGaugeElement();\\n\\n\\n\\n\\t\\tstatic XGaugeElement* CreateFromName (const CString& name);\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag) = 0;\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const = 0;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\tm_nFrameSize;\\n\\n\\t\\tCBCGPGaugeImpl::BCGP_SUB_GAUGE_POS\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 81,\n \"score\": 269043.9832029231\n },\n {\n \"content\": \"\\tclass XElementTagCloud: public XElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementTagCloud();\\n\\n\\t\\tvirtual ~XElementTagCloud();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPTagCloud::SortOrder\\tm_SortOrder;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bDescending;\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\tm_nMaxWeight;\\n\\n\\t\\tdouble\\t\\t\\t\\t\\t\\tm_dblFontSizeStep;\\n\\n\\t\\tCBCGPSize\\t\\t\\t\\t\\tm_szMargin;\\n\\n\\t\\tCBCGPTextFormat\\t\\t\\t\\tm_fmtBase;\\n\\n\\t\\tCBCGPBrush\\t\\t\\t\\t\\tm_brFill;\\n\\n\\t\\tCBCGPColor\\t\\t\\t\\t\\tm_clrText;\\n\\n\\t\\tCBCGPColor\\t\\t\\t\\t\\tm_clrTextHighlighted;\\n\\n\\n\\n\\t\\tXArrayTagCloudData\\t\\t\\tm_arDataObjects;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 82,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XDiagramTextData : public XData\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXDiagramTextData ();\\n\\n\\t\\tvirtual ~XDiagramTextData ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCString\\t\\t\\tm_strText;\\n\\n\\t\\tCBCGPBrush\\t\\tm_brText;\\n\\n\\t\\tCBCGPTextFormat\\tm_fmtText;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 83,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementKnob: public XElementCircular\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementKnob ();\\n\\n\\t\\tvirtual ~XElementKnob ();\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 84,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementTreeMap: public XElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementTreeMap();\\n\\n\\t\\tvirtual ~XElementTreeMap();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPTreeMap::LayoutType\\tm_LayoutType;\\n\\n\\t\\tXTreeMapGroup\\t\\t\\t\\tm_Root;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 85,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XCircularPointer: public XGaugeData\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXCircularPointer ();\\n\\n\\t\\tvirtual ~XCircularPointer ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tdouble\\t\\tm_dblSize;\\n\\n\\t\\tdouble\\t\\tm_dblWidth;\\n\\n\\t\\tBOOL\\t\\tm_bExtraLen;\\n\\n\\t\\tCBCGPCircularGaugePointer::BCGP_GAUGE_POINTER_STYLE\\n\\n\\t\\t\\t\\t\\tm_Style;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 86,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementText: public XGaugeElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementText();\\n\\n\\t\\tvirtual ~XElementText();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPBrush\\t\\tm_brText;\\n\\n\\t\\tCBCGPTextFormat\\tm_fmtText;\\n\\n\\t\\tCString\\t\\t\\tm_strText;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 87,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XCircularScale: public XGaugeScale\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXCircularScale ();\\n\\n\\t\\tvirtual ~XCircularScale ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tdouble\\t\\t\\tm_dblStartAngle;\\n\\n\\t\\tdouble\\t\\t\\tm_dblFinishAngle;\\n\\n\\t\\tBOOL\\t\\t\\tm_bRotateLabels;\\n\\n\\t\\tBOOL\\t\\t\\tm_bIsClosed;\\n\\n\\t\\tBOOL\\t\\t\\tm_bDrawLastTickMark;\\n\\n\\t\\tBOOL\\t\\t\\tm_bAnimationThroughStart;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 88,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementLinear: public XGaugeElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementLinear();\\n\\n\\t\\tvirtual ~XElementLinear();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPLinearGaugeColors\\t\\tm_Colors;\\n\\n\\t\\tCBCGPTextFormat\\t\\t\\t\\tm_fmtText;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bIsVertical;\\n\\n\\n\\n\\t\\tXArrayData\\t\\t\\t\\t\\tm_arPointers;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 89,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XLinearScale: public XGaugeScale\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXLinearScale ();\\n\\n\\t\\tvirtual ~XLinearScale ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 90,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementEdit: public XElementButton\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tXElementEdit(const CString& strElementName);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tXElementEdit();\\n\\n\\t\\tvirtual ~XElementEdit();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tint\\t\\t\\t\\tm_nWidth;\\n\\n\\t\\tint\\t\\t\\t\\tm_nWidthFloaty;\\n\\n\\t\\tint\\t\\t\\t\\tm_nTextAlign;\\n\\n\\t\\tBOOL m_bHasSpinButtons;\\n\\n\\t\\tint\\t\\t\\t\\tm_nMin;\\n\\n\\t\\tint\\t\\t\\t\\tm_nMax;\\n\\n\\t\\tCString\\t\\t\\tm_strValue;\\n\\n\\t\\tBOOL\\t\\t\\tm_bSearchMode;\\n\\n\\t\\tCString\\t\\t\\tm_strSearchPrompt;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 91,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementColor: public XGaugeElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementColor();\\n\\n\\t\\tvirtual ~XElementColor();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPColorIndicatorColors\\tm_Colors;\\n\\n\\t\\tCBCGPColorIndicatorImpl::BCGPColorIndicatorStyle\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tm_Style;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bStretched;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 92,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementLabel: public XElementButton\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementLabel();\\n\\n\\t\\tvirtual ~XElementLabel();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 93,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XKnobPointer: public XGaugeData\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXKnobPointer ();\\n\\n\\t\\tvirtual ~XKnobPointer ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tdouble\\t\\tm_dblOffsetFromCenter;\\n\\n\\t\\tdouble\\t\\tm_dblWidth;\\n\\n\\t\\tCBCGPKnobPointer::BCGP_KNOB_POINTER_STYLE\\n\\n\\t\\t\\t\\t\\tm_Style;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 94,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementNumeric: public XGaugeElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementNumeric();\\n\\n\\t\\tvirtual ~XElementNumeric();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPNumericIndicatorColors\\tm_Colors;\\n\\n\\t\\tCBCGPTextFormat\\t\\t\\t\\tm_fmtText;\\n\\n\\t\\tCBCGPNumericIndicatorImpl::BCGPNumericIndicatorStyle\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tm_Style;\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\tm_nCells;\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\tm_nDecimals;\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\tm_nSeparatorWidth;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bDrawSign;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bDrawDecimalPoint;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bDrawLeadingZeros;\\n\\n\\t\\tdouble\\t\\t\\t\\t\\t\\tm_dblValue;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 95,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementProgressBar: public XElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementProgressBar();\\n\\n\\t\\tvirtual ~XElementProgressBar();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tint\\t\\t\\t\\tm_nWidth;\\n\\n\\t\\tint\\t\\t\\t\\tm_nHeight;\\n\\n\\t\\tint\\t\\t\\t\\tm_nMin;\\n\\n\\t\\tint\\t\\t\\t\\tm_nMax;\\n\\n\\t\\tint\\t\\t\\t\\tm_nPos;\\n\\n\\t\\tBOOL\\t\\t\\tm_bInfinite;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPRibbonInfo.h\",\n \"rank\": 96,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementCircular: public XGaugeElement\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tXElementCircular(const CString& strElementName);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tXElementCircular();\\n\\n\\t\\tvirtual ~XElementCircular();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCBCGPCircularGaugeColors\\tm_Colors;\\n\\n\\t\\tCBCGPTextFormat\\t\\t\\t\\tm_fmtText;\\n\\n\\t\\tdouble\\t\\t\\t\\t\\t\\tm_dblCapSize;\\n\\n\\t\\tBOOL\\t\\t\\t\\t\\t\\tm_bShapeByTicksArea;\\n\\n\\n\\n\\t\\tXArrayData\\t\\t\\t\\t\\tm_arPointers;\\n\\n\\t\\tXArrayGaugeElement\\t\\t\\tm_arSubGauges;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 97,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XElementImage: public XGaugeElement\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXElementImage();\\n\\n\\t\\tvirtual ~XElementImage();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual BOOL ColorsFromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ColorsToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tXImage\\tm_Image;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 98,\n \"score\": 265426.4517287825\n },\n {\n \"content\": \"\\tclass XLinearPointer: public XGaugeData\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tXLinearPointer ();\\n\\n\\t\\tvirtual ~XLinearPointer ();\\n\\n\\n\\n\\t\\tvirtual BOOL FromTag (const CString& strTag);\\n\\n\\t\\tvirtual void ToTag (CString& strTag) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tdouble\\t\\tm_dblSize;\\n\\n\\t\\tdouble\\t\\tm_dblWidth;\\n\\n\\t\\tCBCGPLinearGaugePointer::BCGP_GAUGE_POINTER_STYLE\\n\\n\\t\\t\\t\\t\\tm_Style;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"Src/VC/bcgcbpro/BCGPVisualInfo.h\",\n \"rank\": 99,\n \"score\": 265426.4517287825\n }\n]","isConversational":false}}},{"rowIdx":99,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/client/commands/CmdBase.cpp"},"repo_name":{"kind":"string","value":"lclc/opentxs"},"commit":{"kind":"string","value":"0bc847c6601d20e3346bb2faf81feda3a14ab303"},"file_code":{"kind":"string","value":"\n\n#include \"CmdBase.hpp\"\n\n#include \"../ot_made_easy_ot.hpp\"\n#include <opentxs/client/ot_otapi_ot.hpp>\n#include \"../ot_utility_ot.hpp\"\n\n#include <opentxs/client/OpenTransactions.hpp>\n#include <opentxs/client/OTAPI.hpp>\n#include <opentxs/client/OTWallet.hpp>\n#include <opentxs/core/Account.hpp>\n#include <opentxs/core/AssetContract.hpp>\n#include <opentxs/core/OTLog.hpp>\n#include <opentxs/core/OTPseudonym.hpp>\n#include <opentxs/core/OTServerContract.hpp>\n\n#include <map>\n#include <sstream>\n\nusing namespace opentxs;\nusing namespace std;\n\nCmdBase::CmdBase()\n : category(catError)\n , command(nullptr)\n , help(nullptr)\n , usage(nullptr)\n{\n for (int i = 0; i < MAX_ARGS; i++) {\n args[i] = nullptr;\n }\n}\n\nCmdBase::~CmdBase()\n{\n}\n\nbool CmdBase::checkAccount(const char* name, string& account) const\n{\n if (!checkMandatory(name, account)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n Account* theAccount = wallet->GetAccount(account);\n if (theAccount == nullptr) {\n theAccount = wallet->GetAccountPartialMatch(account);\n if (theAccount == nullptr) {\n otOut << \"Error: \" << name << \": unknown account: \" << account\n << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n theAccount->GetPurportedAccountID().GetString(tmp);\n account = tmp.Get();\n otOut << \"Using \" << name << \": \" << account << \"\\n\";\n return true;\n}\n\nint64_t CmdBase::checkAmount(const char* name, const string& amount,\n const string& myacct) const\n{\n if (!checkMandatory(name, amount)) {\n return OT_ERROR_AMOUNT;\n }\n\n string assetType = getAccountAssetType(myacct);\n if (\"\" == assetType) {\n return OT_ERROR_AMOUNT;\n }\n\n int64_t value = OTAPI_Wrap::StringToAmount(assetType, amount);\n if (OT_ERROR_AMOUNT == value) {\n otOut << \"Error: \" << name << \": invalid amount: \" << amount << \"\\n\";\n return OT_ERROR_AMOUNT;\n }\n\n return value;\n}\n\nbool CmdBase::checkFlag(const char* name, const string& value) const\n{\n if (!checkMandatory(name, value)) {\n return false;\n }\n\n if (value != \"false\" && value != \"true\") {\n otOut << \"Error: \" << name << \": expected 'false' or 'true'.\\n\";\n return false;\n }\n\n return true;\n}\n\nint32_t CmdBase::checkIndex(const char* name, const string& index,\n int32_t items) const\n{\n if (!checkValue(name, index)) {\n return -1;\n }\n\n if (!checkIndicesRange(name, index, items)) {\n return -1;\n }\n\n return stoi(index);\n}\n\nbool CmdBase::checkIndices(const char* name, const string& indices) const\n{\n if (!checkMandatory(name, indices)) {\n return false;\n }\n\n if (\"all\" == indices) {\n return true;\n }\n\n for (string::size_type i = 0; i < indices.length(); i++) {\n if (!isdigit(indices[i])) {\n otOut << \"Error: \" << name << \": not a value: \" << indices << \"\\n\";\n return false;\n }\n for (i++; i < indices.length() && isdigit(indices[i]); i++) {\n }\n if (i < indices.length() && ',' != indices[i]) {\n otOut << \"Error: \" << name << \": not a value: \" << indices << \"\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nbool CmdBase::checkIndicesRange(const char* name, const string& indices,\n int32_t items) const\n{\n if (\"all\" == indices) {\n return true;\n }\n\n for (string::size_type i = 0; i < indices.length(); i++) {\n int32_t value = 0;\n for (; isdigit(indices[i]); i++) {\n value = value * 10 + indices[i] - '0';\n }\n if (0 > value || value >= items) {\n otOut << \"Error: \" << name << \": value (\" << value\n << \") out of range (must be < \" << items << \")\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nbool CmdBase::checkMandatory(const char* name, const string& value) const\n{\n if (\"\" == value) {\n otOut << \"Error: \" << name << \": mandatory parameter not specified.\\n\";\n return false;\n }\n\n return true;\n}\n\nbool CmdBase::checkNym(const char* name, string& nym) const\n{\n if (!checkMandatory(name, nym)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n OTPseudonym* theNym = wallet->GetNymByID(nym);\n if (theNym == nullptr) {\n theNym = wallet->GetNymByIDPartialMatch(nym);\n if (theNym == nullptr) {\n otOut << \"Error: \" << name << \": unknown nymm: \" << nym << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n theNym->GetIdentifier(tmp);\n nym = tmp.Get();\n otOut << \"Using \" << name << \": \" << nym << \"\\n\";\n return true;\n}\n\nbool CmdBase::checkPurse(const char* name, string& purse) const\n{\n if (!checkMandatory(name, purse)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n AssetContract* thePurse = wallet->GetAssetContract(purse);\n if (thePurse == nullptr) {\n thePurse = wallet->GetAssetContractPartialMatch(purse);\n if (thePurse == nullptr) {\n otOut << \"Error: \" << name << \": unknown purse: \" << purse << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n thePurse->GetIdentifier(tmp);\n purse = tmp.Get();\n otOut << \"Using \" << name << \": \" << purse << \"\\n\";\n return true;\n}\n\nbool CmdBase::checkServer(const char* name, string& server) const\n{\n if (!checkMandatory(name, server)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n OTServerContract* theServer = wallet->GetServerContract(server);\n if (theServer == nullptr) {\n theServer = wallet->GetServerContractPartialMatch(server);\n if (theServer == nullptr) {\n otOut << \"Error: \" << name << \": unknown server: \" << server\n << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n theServer->GetIdentifier(tmp);\n server = tmp.Get();\n otOut << \"Using \" << name << \": \" << server << \"\\n\";\n return true;\n}\n\nint64_t CmdBase::checkTransNum(const char* name, const string& id) const\n{\n if (!checkMandatory(name, id)) {\n return -1;\n }\n\n for (string::size_type i = 0; i < id.length(); i++) {\n if (!isdigit(id[i])) {\n otOut << \"Error: \" << name << \": not a value: \" << id << \"\\n\";\n return -1;\n }\n }\n\n int64_t value = stoll(id);\n if (0 >= value) {\n otOut << \"Error: \" << name << \": invalid value: \" << id << \"\\n\";\n return -1;\n }\n\n return value;\n}\n\nbool CmdBase::checkValue(const char* name, const string& value) const\n{\n if (!checkMandatory(name, value)) {\n return false;\n }\n\n for (string::size_type i = 0; i < value.length(); i++) {\n if (!isdigit(value[i])) {\n otOut << \"Error: \" << name << \": not a value: \" << value << \"\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nvoid CmdBase::dashLine() const\n{\n \n cout << \"--------------------------------------\"\n \"--------------------------------------\\n\";\n}\n\nconst vector<string>& CmdBase::extractArgumentNames()\n{\n \n if (0 != argNames.size()) {\n return argNames;\n }\n\n \n for (int i = 0; i < MAX_ARGS && args[i] != nullptr; i++) {\n const char* arg = args[i];\n while ('[' == *arg || '-' == *arg) {\n arg++;\n }\n string argName = \"\";\n for (; isalpha(*arg); arg++) {\n argName += *arg;\n }\n argNames.push_back(argName);\n }\n\n return argNames;\n}\n\nstring CmdBase::formatAmount(const string& assetType, int64_t amount) const\n{\n if (OT_ERROR_AMOUNT == amount) {\n \n return \"UNKNOWN_AMOUNT\";\n }\n\n if (\"\" == assetType) {\n \n return to_string(amount);\n }\n\n return OTAPI_Wrap::FormatAmount(assetType, amount);\n}\n\nCategory CmdBase::getCategory() const\n{\n return category;\n}\n\nconst char* CmdBase::getCommand() const\n{\n return command;\n}\n\nconst char* CmdBase::getHelp() const\n{\n return help;\n}\n\nstring CmdBase::getAccountAssetType(const string& myacct) const\n{\n string assetType = OTAPI_Wrap::GetAccountWallet_AssetTypeID(myacct);\n if (\"\" == assetType) {\n otOut << \"Error: cannot load asset type from myacct.\\n\";\n }\n return assetType;\n}\n\nstring CmdBase::getAccountNym(const string& myacct) const\n{\n string mynym = OTAPI_Wrap::GetAccountWallet_NymID(myacct);\n if (\"\" == mynym) {\n otOut << \"Error: cannot determine mynym from myacct.\\n\";\n }\n return mynym;\n}\n\nstring CmdBase::getAccountServer(const string& myacct) const\n{\n string server = OTAPI_Wrap::GetAccountWallet_ServerID(myacct);\n if (\"\" == server) {\n otOut << \"Error: cannot determine server from myacct.\\n\";\n }\n return server;\n}\n\nstring CmdBase::getOption(string optionName) const\n{\n auto result = options.find(optionName);\n if (result == options.end()) {\n otWarn << \"Option \" << optionName << \" not found.\\n\";\n return \"\";\n }\n\n otInfo << \"Option \" << result->first << \": \" << result->second << \"\\n\";\n return result->second;\n}\n\nstring CmdBase::getUsage() const\n{\n stringstream ss;\n\n \n ss << \"Usage: \" << command;\n for (int i = 0; i < MAX_ARGS && args[i] != nullptr; i++) {\n ss << \" \" << args[i];\n }\n ss << \"\\n\\n\" << help << \"\\n\\n\";\n if (usage != nullptr) {\n ss << usage << \"\\n\\n\";\n }\n\n return ss.str();\n}\n\nOTWallet* CmdBase::getWallet() const\n{\n OTWallet* wallet = OTAPI_Wrap::OTAPI()->GetWallet();\n OT_ASSERT_MSG(wallet != nullptr, \"Cannot load wallet->\\n\");\n return wallet;\n}\n\nint32_t CmdBase::harvestTxNumbers(const string& contract, const string& mynym)\n{\n OTAPI_Wrap::Msg_HarvestTransactionNumbers(contract, mynym, false, false,\n false, false, false);\n return -1;\n}\n\nstring CmdBase::inputLine()\n{\n return OT_CLI_ReadLine();\n}\n\nstring CmdBase::inputText(const char* what)\n{\n cout << \"Please paste \" << what << \",\\n\"\n << \"followed by an EOF or a ~ on a line by itself:\\n\";\n\n string input = OT_CLI_ReadUntilEOF();\n if (\"\" == input) {\n otOut << \"Error: you did not paste \" << what << \".\\n\";\n }\n return input;\n}\n\nint32_t CmdBase::processResponse(const string& response, const char* what) const\n{\n switch (responseStatus(response)) {\n case 1:\n break;\n\n case 0:\n otOut << \"Error: failed to \" << what << \".\\n\";\n return -1;\n\n default:\n otOut << \"Error: cannot \" << what << \".\\n\";\n return -1;\n }\n\n cout << response << \"\\n\";\n return 1;\n}\n\nint32_t CmdBase::processTxResponse(const string& server, const string& mynym,\n const string& myacct, const string& response,\n const char* what) const\n{\n if (1 != responseStatus(response)) {\n otOut << \"Error: cannot \" << what << \".\\n\";\n return -1;\n }\n\n if (1 != VerifyMsgBalanceAgrmntSuccess(server, mynym, myacct, response)) {\n otOut << \"Error: \" << what << \" balance agreement failed.\\n\";\n return -1;\n }\n\n if (1 != VerifyMsgTrnxSuccess(server, mynym, myacct, response)) {\n otOut << \"Error: \" << what << \" transaction failed.\\n\";\n return -1;\n }\n\n cout << response << \"\\n\";\n\n return 1;\n}\n\nint32_t CmdBase::responseReply(const string& response, const string& server,\n const string& mynym, const string& myacct,\n const char* function) const\n{\n return InterpretTransactionMsgReply(server, mynym, myacct, function,\n response);\n}\n\nint32_t CmdBase::responseStatus(const string& response) const\n{\n return VerifyMessageSuccess(response);\n}\n\nbool CmdBase::run(const map<string, string>& _options)\n{\n options = _options;\n int32_t returnValue = runWithOptions();\n options.empty();\n\n switch (returnValue) {\n case 0: \n return true;\n case 1: \n return true;\n case -1: \n return false;\n default:\n otOut << \"Error: undefined error code: \" << returnValue << \".\\n\";\n break;\n }\n\n return false;\n}\n\nvector<string> CmdBase::tokenize(const string& str, char delim,\n bool noEmpty) const\n{\n vector<string> tokens;\n\n const char* p = str.c_str();\n int begin = 0;\n while (true) {\n int next = begin;\n while (p[next] != delim && '\\0' != p[next]) {\n next++;\n }\n if (next != begin || !noEmpty) {\n tokens.push_back(str.substr(begin, next - begin));\n }\n if ('\\0' == p[next]) {\n break;\n }\n begin = next + 1;\n }\n\n return tokens;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"CmdBase.hpp\"\n\n#include \"../ot_made_easy_ot.hpp\"\n#include <opentxs/client/ot_otapi_ot.hpp>\n#include \"../ot_utility_ot.hpp\"\n\n#include <opentxs/client/OpenTransactions.hpp>\n#include <opentxs/client/OTAPI.hpp>\n#include <opentxs/client/OTWallet.hpp>\n#include <opentxs/core/Account.hpp>\n#include <opentxs/core/AssetContract.hpp>\n#include <opentxs/core/OTLog.hpp>\n#include <opentxs/core/OTPseudonym.hpp>\n#include <opentxs/core/OTServerContract.hpp>\n\n#include <map>\n#include <sstream>\n\nusing namespace opentxs;\nusing namespace std;\n\nCmdBase::CmdBase()\n : category(catError)\n , command(nullptr)\n , help(nullptr)\n , usage(nullptr)\n{\n for (int i = 0; i < MAX_ARGS; i++) {\n args[i] = nullptr;\n }\n}\n\nCmdBase::~CmdBase()\n{\n}\n\nbool CmdBase::checkAccount(const char* name, string& account) const\n{\n if (!checkMandatory(name, account)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n Account* theAccount = wallet->GetAccount(account);\n if (theAccount == nullptr) {\n theAccount = wallet->GetAccountPartialMatch(account);\n if (theAccount == nullptr) {\n otOut << \"Error: \" << name << \": unknown account: \" << account\n << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n theAccount->GetPurportedAccountID().GetString(tmp);\n account = tmp.Get();\n otOut << \"Using \" << name << \": \" << account << \"\\n\";\n return true;\n}\n\nint64_t CmdBase::checkAmount(const char* name, const string& amount,\n const string& myacct) const\n{\n if (!checkMandatory(name, amount)) {\n return OT_ERROR_AMOUNT;\n }\n\n string assetType = getAccountAssetType(myacct);\n if (\"\" == assetType) {\n return OT_ERROR_AMOUNT;\n }\n\n int64_t value = OTAPI_Wrap::StringToAmount(assetType, amount);\n if (OT_ERROR_AMOUNT == value) {\n otOut << \"Error: \" << name << \": invalid amount: \" << amount << \"\\n\";\n return OT_ERROR_AMOUNT;\n }\n\n return value;\n}\n\nbool CmdBase::checkFlag(const char* name, const string& value) const\n{\n if (!checkMandatory(name, value)) {\n return false;\n }\n\n if (value != \"false\" && value != \"true\") {\n otOut << \"Error: \" << name << \": expected 'false' or 'true'.\\n\";\n return false;\n }\n\n return true;\n}\n\nint32_t CmdBase::checkIndex(const char* name, const string& index,\n int32_t items) const\n{\n if (!checkValue(name, index)) {\n return -1;\n }\n\n if (!checkIndicesRange(name, index, items)) {\n return -1;\n }\n\n return stoi(index);\n}\n\nbool CmdBase::checkIndices(const char* name, const string& indices) const\n{\n if (!checkMandatory(name, indices)) {\n return false;\n }\n\n if (\"all\" == indices) {\n return true;\n }\n\n for (string::size_type i = 0; i < indices.length(); i++) {\n if (!isdigit(indices[i])) {\n otOut << \"Error: \" << name << \": not a value: \" << indices << \"\\n\";\n return false;\n }\n for (i++; i < indices.length() && isdigit(indices[i]); i++) {\n }\n if (i < indices.length() && ',' != indices[i]) {\n otOut << \"Error: \" << name << \": not a value: \" << indices << \"\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nbool CmdBase::checkIndicesRange(const char* name, const string& indices,\n int32_t items) const\n{\n if (\"all\" == indices) {\n return true;\n }\n\n for (string::size_type i = 0; i < indices.length(); i++) {\n int32_t value = 0;\n for (; isdigit(indices[i]); i++) {\n value = value * 10 + indices[i] - '0';\n }\n if (0 > value || value >= items) {\n otOut << \"Error: \" << name << \": value (\" << value\n << \") out of range (must be < \" << items << \")\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nbool CmdBase::checkMandatory(const char* name, const string& value) const\n{\n if (\"\" == value) {\n otOut << \"Error: \" << name << \": mandatory parameter not specified.\\n\";\n return false;\n }\n\n return true;\n}\n\nbool CmdBase::checkNym(const char* name, string& nym) const\n{\n if (!checkMandatory(name, nym)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n OTPseudonym* theNym = wallet->GetNymByID(nym);\n if (theNym == nullptr) {\n theNym = wallet->GetNymByIDPartialMatch(nym);\n if (theNym == nullptr) {\n otOut << \"Error: \" << name << \": unknown nymm: \" << nym << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n theNym->GetIdentifier(tmp);\n nym = tmp.Get();\n otOut << \"Using \" << name << \": \" << nym << \"\\n\";\n return true;\n}\n\nbool CmdBase::checkPurse(const char* name, string& purse) const\n{\n if (!checkMandatory(name, purse)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n AssetContract* thePurse = wallet->GetAssetContract(purse);\n if (thePurse == nullptr) {\n thePurse = wallet->GetAssetContractPartialMatch(purse);\n if (thePurse == nullptr) {\n otOut << \"Error: \" << name << \": unknown purse: \" << purse << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n thePurse->GetIdentifier(tmp);\n purse = tmp.Get();\n otOut << \"Using \" << name << \": \" << purse << \"\\n\";\n return true;\n}\n\nbool CmdBase::checkServer(const char* name, string& server) const\n{\n if (!checkMandatory(name, server)) {\n return false;\n }\n\n OTWallet* wallet = getWallet();\n OTServerContract* theServer = wallet->GetServerContract(server);\n if (theServer == nullptr) {\n theServer = wallet->GetServerContractPartialMatch(server);\n if (theServer == nullptr) {\n otOut << \"Error: \" << name << \": unknown server: \" << server\n << \"\\n\";\n return false;\n }\n }\n\n String tmp;\n theServer->GetIdentifier(tmp);\n server = tmp.Get();\n otOut << \"Using \" << name << \": \" << server << \"\\n\";\n return true;\n}\n\nint64_t CmdBase::checkTransNum(const char* name, const string& id) const\n{\n if (!checkMandatory(name, id)) {\n return -1;\n }\n\n for (string::size_type i = 0; i < id.length(); i++) {\n if (!isdigit(id[i])) {\n otOut << \"Error: \" << name << \": not a value: \" << id << \"\\n\";\n return -1;\n }\n }\n\n int64_t value = stoll(id);\n if (0 >= value) {\n otOut << \"Error: \" << name << \": invalid value: \" << id << \"\\n\";\n return -1;\n }\n\n return value;\n}\n\nbool CmdBase::checkValue(const char* name, const string& value) const\n{\n if (!checkMandatory(name, value)) {\n return false;\n }\n\n for (string::size_type i = 0; i < value.length(); i++) {\n if (!isdigit(value[i])) {\n otOut << \"Error: \" << name << \": not a value: \" << value << \"\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nvoid CmdBase::dashLine() const\n{\n \n cout << \"--------------------------------------\"\n \"--------------------------------------\\n\";\n}\n\nconst vector<string>& CmdBase::extractArgumentNames()\n{\n \n if (0 != argNames.size()) {\n return argNames;\n }\n\n \n for (int i = 0; i < MAX_ARGS && args[i] != nullptr; i++) {\n const char* arg = args[i];\n while ('[' == *arg || '-' == *arg) {\n arg++;\n }\n string argName = \"\";\n for (; isalpha(*arg); arg++) {\n argName += *arg;\n }\n argNames.push_back(argName);\n }\n\n return argNames;\n}\n\n"},"suffix":{"kind":"string","value":"\n\nCategory CmdBase::getCategory() const\n{\n return category;\n}\n\nconst char* CmdBase::getCommand() const\n{\n return command;\n}\n\nconst char* CmdBase::getHelp() const\n{\n return help;\n}\n\nstring CmdBase::getAccountAssetType(const string& myacct) const\n{\n string assetType = OTAPI_Wrap::GetAccountWallet_AssetTypeID(myacct);\n if (\"\" == assetType) {\n otOut << \"Error: cannot load asset type from myacct.\\n\";\n }\n return assetType;\n}\n\nstring CmdBase::getAccountNym(const string& myacct) const\n{\n string mynym = OTAPI_Wrap::GetAccountWallet_NymID(myacct);\n if (\"\" == mynym) {\n otOut << \"Error: cannot determine mynym from myacct.\\n\";\n }\n return mynym;\n}\n\nstring CmdBase::getAccountServer(const string& myacct) const\n{\n string server = OTAPI_Wrap::GetAccountWallet_ServerID(myacct);\n if (\"\" == server) {\n otOut << \"Error: cannot determine server from myacct.\\n\";\n }\n return server;\n}\n\nstring CmdBase::getOption(string optionName) const\n{\n auto result = options.find(optionName);\n if (result == options.end()) {\n otWarn << \"Option \" << optionName << \" not found.\\n\";\n return \"\";\n }\n\n otInfo << \"Option \" << result->first << \": \" << result->second << \"\\n\";\n return result->second;\n}\n\nstring CmdBase::getUsage() const\n{\n stringstream ss;\n\n \n ss << \"Usage: \" << command;\n for (int i = 0; i < MAX_ARGS && args[i] != nullptr; i++) {\n ss << \" \" << args[i];\n }\n ss << \"\\n\\n\" << help << \"\\n\\n\";\n if (usage != nullptr) {\n ss << usage << \"\\n\\n\";\n }\n\n return ss.str();\n}\n\nOTWallet* CmdBase::getWallet() const\n{\n OTWallet* wallet = OTAPI_Wrap::OTAPI()->GetWallet();\n OT_ASSERT_MSG(wallet != nullptr, \"Cannot load wallet->\\n\");\n return wallet;\n}\n\nint32_t CmdBase::harvestTxNumbers(const string& contract, const string& mynym)\n{\n OTAPI_Wrap::Msg_HarvestTransactionNumbers(contract, mynym, false, false,\n false, false, false);\n return -1;\n}\n\nstring CmdBase::inputLine()\n{\n return OT_CLI_ReadLine();\n}\n\nstring CmdBase::inputText(const char* what)\n{\n cout << \"Please paste \" << what << \",\\n\"\n << \"followed by an EOF or a ~ on a line by itself:\\n\";\n\n string input = OT_CLI_ReadUntilEOF();\n if (\"\" == input) {\n otOut << \"Error: you did not paste \" << what << \".\\n\";\n }\n return input;\n}\n\nint32_t CmdBase::processResponse(const string& response, const char* what) const\n{\n switch (responseStatus(response)) {\n case 1:\n break;\n\n case 0:\n otOut << \"Error: failed to \" << what << \".\\n\";\n return -1;\n\n default:\n otOut << \"Error: cannot \" << what << \".\\n\";\n return -1;\n }\n\n cout << response << \"\\n\";\n return 1;\n}\n\nint32_t CmdBase::processTxResponse(const string& server, const string& mynym,\n const string& myacct, const string& response,\n const char* what) const\n{\n if (1 != responseStatus(response)) {\n otOut << \"Error: cannot \" << what << \".\\n\";\n return -1;\n }\n\n if (1 != VerifyMsgBalanceAgrmntSuccess(server, mynym, myacct, response)) {\n otOut << \"Error: \" << what << \" balance agreement failed.\\n\";\n return -1;\n }\n\n if (1 != VerifyMsgTrnxSuccess(server, mynym, myacct, response)) {\n otOut << \"Error: \" << what << \" transaction failed.\\n\";\n return -1;\n }\n\n cout << response << \"\\n\";\n\n return 1;\n}\n\nint32_t CmdBase::responseReply(const string& response, const string& server,\n const string& mynym, const string& myacct,\n const char* function) const\n{\n return InterpretTransactionMsgReply(server, mynym, myacct, function,\n response);\n}\n\nint32_t CmdBase::responseStatus(const string& response) const\n{\n return VerifyMessageSuccess(response);\n}\n\nbool CmdBase::run(const map<string, string>& _options)\n{\n options = _options;\n int32_t returnValue = runWithOptions();\n options.empty();\n\n switch (returnValue) {\n case 0: \n return true;\n case 1: \n return true;\n case -1: \n return false;\n default:\n otOut << \"Error: undefined error code: \" << returnValue << \".\\n\";\n break;\n }\n\n return false;\n}\n\nvector<string> CmdBase::tokenize(const string& str, char delim,\n bool noEmpty) const\n{\n vector<string> tokens;\n\n const char* p = str.c_str();\n int begin = 0;\n while (true) {\n int next = begin;\n while (p[next] != delim && '\\0' != p[next]) {\n next++;\n }\n if (next != begin || !noEmpty) {\n tokens.push_back(str.substr(begin, next - begin));\n }\n if ('\\0' == p[next]) {\n break;\n }\n begin = next + 1;\n }\n\n return tokens;\n}\n"},"middle":{"kind":"string","value":"string CmdBase::formatAmount(const string& assetType, int64_t amount) const\n{\n if (OT_ERROR_AMOUNT == amount) {\n \n return \"UNKNOWN_AMOUNT\";\n }\n\n if (\"\" == assetType) {\n \n return to_string(amount);\n }\n\n return OTAPI_Wrap::FormatAmount(assetType, amount);\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"class String;\n","file_path":"include/opentxs/core/Account.hpp","rank":0,"score":273173.24958394736},{"content":"class Account;\n","file_path":"include/opentxs/server/Transactor.hpp","rank":1,"score":272706.39791854477},{"content":"class Account;\n","file_path":"include/opentxs/server/Notary.hpp","rank":2,"score":272706.39791854477},{"content":"class String;\n","file_path":"include/opentxs/client/OTWallet.hpp","rank":3,"score":266694.9121079102},{"content":"class Account;\n","file_path":"include/opentxs/client/OTWallet.hpp","rank":4,"score":266691.9714894188},{"content":"class Account;\n","file_path":"include/opentxs/core/OTItem.hpp","rank":5,"score":266631.055292542},{"content":"class String;\n","file_path":"include/opentxs/server/ClientConnection.hpp","rank":6,"score":266195.50986694166},{"content":"class String;\n","file_path":"include/opentxs/server/MainFile.hpp","rank":7,"score":266195.50986694166},{"content":"class String;\n\n\n","file_path":"include/opentxs/server/ConfigLoader.hpp","rank":8,"score":266195.50986694166},{"content":"class String;\n\n\n","file_path":"include/opentxs/server/PayDividendVisitor.hpp","rank":9,"score":260036.22396174306},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/OTServerContract.hpp","rank":10,"score":260036.22396174306},{"content":"class String;\n","file_path":"include/opentxs/server/UserCommandProcessor.hpp","rank":11,"score":260036.22396174306},{"content":"class Account;\n","file_path":"include/opentxs/server/PayDividendVisitor.hpp","rank":12,"score":260034.02987552408},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/cron/OTCronItem.hpp","rank":13,"score":254619.17468964605},{"content":"class OTWallet;\n\n\n","file_path":"include/opentxs/client/OTServerConnection.hpp","rank":14,"score":254264.5690144083},{"content":"class OTServerContract;\n","file_path":"include/opentxs/client/OTWallet.hpp","rank":15,"score":254261.9819435165},{"content":"class String;\n","file_path":"include/opentxs/core/crypto/OTNymOrSymmetricKey.hpp","rank":16,"score":249092.80678867066},{"content":"\tfunction withdraw_cash($SERVER_ID,$NYM_ID,$ACCT_ID,$AMOUNT) {\n\n\t\treturn OTMadeEasy_withdraw_cash($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_ID,$AMOUNT);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":17,"score":238161.2389114491},{"content":"\tfunction withdraw_voucher($SERVER_ID,$NYM_ID,$ACCT_ID,$RECIP_NYM_ID,$STR_MEMO,$AMOUNT) {\n\n\t\treturn OTMadeEasy_withdraw_voucher($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_ID,$RECIP_NYM_ID,$STR_MEMO,$AMOUNT);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":18,"score":236825.08549811906},{"content":"// Exception class representing an error occurred during UTF-8 conversion.\n\nclass utf8_conversion_error : public std::runtime_error\n\n{\n\npublic:\n\n //\n\n // Naming convention note:\n\n //\n\n // This exception class is derived from std::runtime_error class,\n\n // so I chose to use the same naming convention of STL classes\n\n // (e.g. do_something_intersting() instead of DoSomethingInteresting()).\n\n //\n\n\n\n // Error code type\n\n // (a DWORD, as the return value type from ::GetLastError())\n\n typedef unsigned long error_code_type;\n\n\n\n // Type of conversion\n\n enum conversion_type {\n\n conversion_utf8_from_utf16, // UTF-16 ---> UTF-8\n\n conversion_utf16_from_utf8 // UTF-8 ---> UTF-16\n\n };\n","file_path":"include/opentxs/core/util/win32_utf8conv.hpp","rank":19,"score":231473.33340646318},{"content":"class String\n\n{\n\npublic:\n\n typedef std::list<std::string> List;\n\n typedef std::map<std::string, std::string> Map;\n\n\n\npublic:\n\n EXPORT friend std::ostream& operator<<(std::ostream& os, const String& obj);\n\n\n\n EXPORT String();\n\n EXPORT String(const String& value);\n\n EXPORT String(const OTASCIIArmor& value);\n\n String(const OTSignature& value);\n\n EXPORT String(const OTContract& value);\n\n EXPORT String(const OTIdentifier& value);\n\n String(OTPseudonym& value);\n\n EXPORT String(const char* value);\n\n String(const char* value, size_t size);\n\n EXPORT String(const std::string& value);\n\n EXPORT virtual ~String();\n","file_path":"include/opentxs/core/String.hpp","rank":20,"score":228475.28850034688},{"content":"class Account;\n\n\n\ntypedef std::map<std::string, Account*> mapOfAccounts;\n\n\n","file_path":"include/opentxs/core/AccountVisitor.hpp","rank":21,"score":223954.33775651504},{"content":"\tfunction retrieve_account($SERVER_ID,$NYM_ID,$ACCOUNT_ID,$bForceDownload=null) {\n\n\t\tswitch (func_num_args()) {\n\n\t\tcase 3: $r=OTMadeEasy_retrieve_account($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCOUNT_ID); break;\n\n\t\tdefault: $r=OTMadeEasy_retrieve_account($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCOUNT_ID,$bForceDownload);\n\n\t\t}\n\n\t\treturn $r;\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":22,"score":222810.73548131844},{"content":"class OTServerContract;\n\n\n","file_path":"include/opentxs/server/OTServer.hpp","rank":23,"score":222047.85837788472},{"content":"\tfunction send_transfer($SERVER_ID,$NYM_ID,$ACCT_FROM,$ACCT_TO,$AMOUNT,$NOTE) {\n\n\t\treturn OTMadeEasy_send_transfer($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_FROM,$ACCT_TO,$AMOUNT,$NOTE);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":24,"score":221832.54192932945},{"content":"class OTWallet\n\n{\n\npublic:\n\n EXPORT OTWallet();\n\n ~OTWallet();\n\n\n\n EXPORT bool IsNymOnCachedKey(const OTIdentifier& needle) const; // needle\n\n // and\n\n // haystack.\n\n EXPORT bool ConvertNymToCachedKey(OTPseudonym& theNym);\n\n\n\n EXPORT OTPseudonym* GetOrLoadNym(const OTIdentifier& NYM_ID,\n\n bool bChecking = false,\n\n const char* szFuncName = nullptr,\n\n const OTPasswordData* pPWData = nullptr);\n\n EXPORT OTPseudonym* GetOrLoadPublicNym(const OTIdentifier& NYM_ID,\n\n const char* szFuncName = nullptr);\n\n EXPORT OTPseudonym* GetOrLoadPrivateNym(\n\n const OTIdentifier& NYM_ID, bool bChecking = false,\n\n const char* szFuncName = nullptr,\n","file_path":"include/opentxs/client/OTWallet.hpp","rank":25,"score":219740.3406255503},{"content":"class Account;\n","file_path":"include/opentxs/core/script/OTPartyAccount.hpp","rank":26,"score":215578.3034546057},{"content":"class String;\n\n\n\ntypedef std::map<int32_t, OTASCIIArmor*> mapOfPrototokens;\n\n\n\n/*\n\n Here's a rough sketch of the protocol:\n\n\n\n Client requests Mint for withdrawal of 100 ithica work hours.\n\n\n\n1) Client blinds and sends N tokens to the server, each worth 100 hours. Client\n\nretains the keys.\n\n2) Server responds with a single index, the one the server has chosen for\n\nsigning.\n\n3) Client replies with 99 keys.\n\n4) Server unblinds 99 tokens (or some randomly-chosen % of those) and verifies\n\nthem.\n\n He signs the last one and returns it.\n\n5) Client receives signed token, unblinds it, stores it for later.\n\n6) When token is redeemed, it has already been unblinded. So Server simply\n\nverifies it.\n","file_path":"include/opentxs/cash/Token.hpp","rank":27,"score":214411.09510851186},{"content":"class String;\n\n\n\nEXPORT int32_t OT_CLI_GetArgsCount(const std::string& str_Args);\n\nEXPORT std::string OT_CLI_GetValueByKey(const std::string& str_Args,\n\n const std::string& str_key);\n\nEXPORT std::string OT_CLI_GetValueByIndex(const std::string& str_Args,\n\n int32_t nIndex);\n\nEXPORT std::string OT_CLI_GetKeyByIndex(const std::string& str_Args,\n\n int32_t nIndex);\n\nEXPORT std::string OT_CLI_ReadLine();\n\nEXPORT std::string OT_CLI_ReadUntilEOF();\n\n\n","file_path":"include/opentxs/client/OT_ME.hpp","rank":28,"score":214411.09510851186},{"content":"class Account;\n","file_path":"include/opentxs/cash/Mint.hpp","rank":29,"score":214407.36488991822},{"content":"class OTServerContract;\n","file_path":"include/opentxs/client/OTServerConnection.hpp","rank":30,"score":211159.01369183935},{"content":"\tfunction process_inbox($SERVER_ID,$NYM_ID,$ACCOUNT_ID,$RESPONSE_LEDGER) {\n\n\t\treturn OTMadeEasy_process_inbox($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCOUNT_ID,$RESPONSE_LEDGER);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":31,"score":210578.26735114722},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/core/String.hpp","rank":32,"score":209536.13183260825},{"content":"class String;\n\n\n\n// transaction ID is a int64_t, assigned by the server. Each transaction has\n\n// one.\n\n// FIRST the server issues the ID. THEN we create the blank transaction object\n\n// with the\n\n// ID in it and store it in our inbox. THEN if we want to send a transaction, we\n\n// use\n\n// the blank to do so. If there is no blank available, we message the server and\n\n// request one.\n\n\n\ntypedef std::map<int64_t, OTTransaction*> mapOfTransactions;\n\n\n","file_path":"include/opentxs/core/OTLedger.hpp","rank":33,"score":209530.97975047881},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/AssetContract.hpp","rank":34,"score":209530.97975047881},{"content":"class String;\n","file_path":"include/opentxs/core/transaction/Helpers.hpp","rank":35,"score":209530.97975047881},{"content":"class String;\n","file_path":"include/opentxs/core/OTIdentifier.hpp","rank":36,"score":209530.97975047881},{"content":"class Account;\n","file_path":"include/opentxs/core/OTLedger.hpp","rank":37,"score":209528.03913198746},{"content":"class Account;\n","file_path":"include/opentxs/client/OTClient.hpp","rank":38,"score":209528.03913198746},{"content":"class Account;\n","file_path":"include/opentxs/core/AssetContract.hpp","rank":39,"score":209528.03913198746},{"content":"class Account;\n","file_path":"include/opentxs/client/OpenTransactions.hpp","rank":40,"score":209528.03913198746},{"content":"class OTPseudonym;\n\n\n","file_path":"include/opentxs/core/Account.hpp","rank":41,"score":209508.75817763002},{"content":"class AssetContract;\n","file_path":"include/opentxs/server/Transactor.hpp","rank":42,"score":209092.04269735026},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/server/Notary.hpp","rank":43,"score":209058.62105172954},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/server/Transactor.hpp","rank":44,"score":209058.62105172954},{"content":"// The most useful generic data object... a map of strings, key/value pairs.\n\n//\n\nclass StringMap : public Storable\n\n{\n\n // You never actually get an instance of this, only its subclasses.\n\n // Therefore, I don't allow you to access the constructor except through the\n\n // factory.\n\nprotected:\n\n StringMap()\n\n : Storable()\n\n {\n\n m_Type = \"StringMap\";\n\n }\n\n\n\npublic:\n\n virtual ~StringMap()\n\n {\n\n }\n\n\n\n std::map<std::string, std::string> the_map;\n\n\n\n void SetValue(const std::string& strKey, const std::string& strValue)\n","file_path":"include/opentxs/core/OTStorage.hpp","rank":45,"score":208872.58979606268},{"content":"\tfunction query_asset_types($SERVER_ID,$NYM_ID,$ENCODED_MAP) {\n\n\t\treturn OTMadeEasy_query_asset_types($this->_cPtr,$SERVER_ID,$NYM_ID,$ENCODED_MAP);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":46,"score":206772.11004126142},{"content":"class OTWallet;\n\n\n\n// This class represents the \"test client\"\n\n//\n\n// I have it separate from the wallet because I would like to be\n\n// able to use the wallet in a \"nice client\" too, so I'm forcing\n\n// the separation to keep it designed that way.\n\n//\n\n\n","file_path":"include/opentxs/client/OTClient.hpp","rank":47,"score":204978.20858836995},{"content":"class OTWallet;\n","file_path":"include/opentxs/client/OpenTransactions.hpp","rank":48,"score":204978.20858836995},{"content":"class AssetContract;\n","file_path":"include/opentxs/client/OTWallet.hpp","rank":49,"score":204976.9128405369},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/client/OTWallet.hpp","rank":50,"score":204943.4911949162},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/crypto/OTSignature.hpp","rank":51,"score":204917.04467496008},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/OTNumList.hpp","rank":52,"score":204917.04467496008},{"content":"class String;\n","file_path":"include/opentxs/core/crypto/OTEnvelope.hpp","rank":53,"score":204917.04467496008},{"content":"class String;\n","file_path":"include/opentxs/core/crypto/OTKeyring.hpp","rank":54,"score":204917.04467496008},{"content":"class String;\n\n\n\ntypedef std::map<std::string, OTStashItem*> mapOfStashItems;\n\n\n","file_path":"include/opentxs/core/script/OTStash.hpp","rank":55,"score":204917.04467496008},{"content":"class String;\n","file_path":"include/opentxs/core/crypto/OTMasterkey.hpp","rank":56,"score":204917.04467496008},{"content":"class String;\n","file_path":"include/opentxs/core/script/OTScript.hpp","rank":57,"score":204917.04467496008},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/OTTransactionType.hpp","rank":58,"score":204917.04467496008},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/crypto/OTSubcredential.hpp","rank":59,"score":204917.04467496008},{"content":"class String;\n\n\n\ntypedef std::list<OTAsymmetricKey*> listOfAsymmetricKeys;\n\n\n","file_path":"include/opentxs/core/crypto/OTKeypair.hpp","rank":60,"score":204917.04467496008},{"content":"class String;\n\n\n","file_path":"include/opentxs/client/OTMessageBuffer.hpp","rank":61,"score":204917.04467496008},{"content":"class Account;\n","file_path":"include/opentxs/core/script/OTParty.hpp","rank":62,"score":204914.85058874113},{"content":"class Account;\n","file_path":"include/opentxs/core/script/OTAgent.hpp","rank":63,"score":204914.85058874113},{"content":"class Account;\n","file_path":"include/opentxs/core/script/OTScriptable.hpp","rank":64,"score":204914.85058874113},{"content":"class OTPseudonym;\n\n\n","file_path":"include/opentxs/core/AccountList.hpp","rank":65,"score":204895.56963438372},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/core/OTItem.hpp","rank":66,"score":204884.2363000071},{"content":"class OTStringXML : public String\n\n{\n\npublic:\n\n EXPORT OTStringXML();\n\n EXPORT OTStringXML(const String& value);\n\n EXPORT OTStringXML(const OTStringXML& value);\n\n\n\n EXPORT virtual ~OTStringXML();\n\n\n\n EXPORT operator irr::io::IFileReadCallBack*();\n\n\n\n EXPORT OTStringXML& operator=(const String& rhs);\n\n EXPORT OTStringXML& operator=(const OTStringXML& rhs);\n\n\n\n int32_t read(void* buffer, uint32_t sizeToRead);\n\n int32_t getSize();\n\n\n\nprivate:\n","file_path":"include/opentxs/core/OTStringXML.hpp","rank":67,"score":201314.58545937695},{"content":"class Account : public OTTransactionType\n\n{\n\n friend OTTransactionType* OTTransactionType::TransactionFactory(\n\n String input);\n\n\n\npublic:\n\n // If you add any types to this list, update the list of strings at the\n\n // top of the .cpp file.\n\n enum AccountType {\n\n simple, // used by users\n\n issuer, // used by issuers (these can only go negative.)\n\n basket, // issuer acct used by basket currencies (these can only go\n\n // negative)\n\n basketsub, // used by the server (to store backing reserves for basket\n\n // sub-accounts)\n\n mint, // used by mints (to store backing reserves for cash)\n\n voucher, // used by the server (to store backing reserves for\n\n // vouchers)\n\n stash, // used by the server (to store backing reserves for stashes,\n\n // for smart contracts.)\n","file_path":"include/opentxs/core/Account.hpp","rank":68,"score":200915.42912221633},{"content":"class String;\n\n\n\n/*\n\n To use:\n\n\n\n OTPassword thePass;\n\n (Or...)\n\n OTPassword thePass(strPassword, strPassword.length());\n\n\n\n const char * szPassword = thePass.getPassword();\n\n const int32_t nPassLength = thePass.getPasswordSize();\n\n\n\n If the instance of OTPassword is not going to be destroyed immediately\n\n after the password is used, then make sure to call zeroMemory() after\n\n using the password. (Otherwise the destructor will handle this anyway.)\n\n\n\n (The primary purpose of this class is that it zeros its memory out when\n\n it is destructed.)\n\n\n\n This class gives me a safe way to hand-off a password, and off-load the\n","file_path":"include/opentxs/core/crypto/OTPasswordData.hpp","rank":69,"score":200548.09028935677},{"content":"class String;\n","file_path":"include/opentxs/core/crypto/OTCachedKey.hpp","rank":70,"score":200548.09028935677},{"content":"class String;\n\n\n","file_path":"include/opentxs/core/crypto/OTSymmetricKey.hpp","rank":71,"score":200548.09028935677},{"content":"class String;\n\n\n\ntypedef std::list<OTAsymmetricKey*> listOfAsymmetricKeys;\n\n\n\n// Todo:\n\n// 1. Add this value to the config file so it becomes merely a default value\n\n// here.\n\n// 2. This timer solution isn't the full solution but only a stopgap measure.\n\n// See notes in ReleaseKeyLowLevel for more -- ultimate solution will involve\n\n// the callback itself, and some kind of encrypted storage of hashed\n\n// passwords,\n\n// using session keys, as well as an option to use ssh-agent and other\n\n// standard\n\n// APIs for protected memory.\n\n//\n\n// UPDATE: Am in the process now of adding the actual Master key. Therefore\n\n// OT_MASTER_KEY_TIMEOUT\n\n// was added for the actual mechanism, while OT_KEY_TIMER (a stopgap measure)\n\n// was set to 0, which\n\n// makes it of no effect. Probably OT_KEY_TIMER will be removed entirely (we'll\n","file_path":"include/opentxs/core/crypto/OTAsymmetricKey.hpp","rank":72,"score":200548.09028935677},{"content":"class Account;\n","file_path":"include/opentxs/core/script/OTSmartContract.hpp","rank":73,"score":200546.60309766326},{"content":"class RippleServer : public Server\n\n{\n\n // You never actually get an instance of this, only its subclasses.\n\n // Therefore, I don't allow you to access the constructor except through\n\n // factory.\n\nprotected:\n\n RippleServer()\n\n : Server()\n\n {\n\n m_Type = \"RippleServer\";\n\n }\n\n\n\npublic:\n\n virtual ~RippleServer()\n\n {\n\n }\n\n\n\n using Displayable::gui_label; // The label that appears in the GUI\n\n\n\n using ServerInfo::server_id; // in base class\n","file_path":"include/opentxs/core/OTStorage.hpp","rank":74,"score":200388.28698654432},{"content":"class BitcoinServer : public Server\n\n{\n\n // You never actually get an instance of this, only its subclasses.\n\n // Therefore, I don't allow you to access the constructor except through\n\n // factory.\n\nprotected:\n\n BitcoinServer()\n\n : Server()\n\n {\n\n m_Type = \"BitcoinServer\";\n\n }\n\n\n\npublic:\n\n virtual ~BitcoinServer()\n\n {\n\n }\n\n\n\n using Displayable::gui_label; // The label that appears in the GUI\n\n\n\n using ServerInfo::server_id; // in base class\n","file_path":"include/opentxs/core/OTStorage.hpp","rank":75,"score":200388.28698654432},{"content":"class LoomServer : public Server\n\n{\n\n // You never actually get an instance of this, only its subclasses.\n\n // Therefore, I don't allow you to access the constructor except through\n\n // factory.\n\nprotected:\n\n LoomServer()\n\n : Server()\n\n {\n\n m_Type = \"LoomServer\";\n\n }\n\n\n\npublic:\n\n virtual ~LoomServer()\n\n {\n\n }\n\n\n\n using Displayable::gui_label; // The label that appears in the GUI\n\n\n\n using ServerInfo::server_id; // in base class\n","file_path":"include/opentxs/core/OTStorage.hpp","rank":76,"score":200388.28698654432},{"content":"class Server : public ServerInfo\n\n{\n\n // You never actually get an instance of this, only its subclasses.\n\n // Therefore, I don't allow you to access the constructor except through\n\n // factory.\n\nprotected:\n\n Server()\n\n : ServerInfo()\n\n {\n\n m_Type = \"Server\";\n\n }\n\n\n\npublic:\n\n virtual ~Server()\n\n {\n\n }\n\n\n\n using Displayable::gui_label; // The label that appears in the GUI\n\n\n\n using ServerInfo::server_id; // in base class\n\n using ServerInfo::server_type; // in base class\n\n\n\n std::string server_host;\n\n std::string server_port;\n\n\n\n DEFINE_OT_DYNAMIC_CAST(Server)\n\n};\n\n\n","file_path":"include/opentxs/core/OTStorage.hpp","rank":77,"score":200388.28698654432},{"content":"class OTServerContract;\n","file_path":"include/opentxs/client/OpenTransactions.hpp","rank":78,"score":200133.2157420871},{"content":"class OTServerContract;\n","file_path":"include/opentxs/client/OTClient.hpp","rank":79,"score":200133.2157420871},{"content":"class OTServerContract;\n","file_path":"include/opentxs/client/TransportCallback.hpp","rank":80,"score":200133.2157420871},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/client/OTServerConnection.hpp","rank":81,"score":200101.08541952516},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/server/UserCommandProcessor.hpp","rank":82,"score":200101.08541952516},{"content":"\tfunction activate_smart_contract($SERVER_ID,$NYM_ID,$ACCT_ID,$AGENT_NAME,$THE_SMART_CONTRACT) {\n\n\t\treturn OTMadeEasy_activate_smart_contract($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_ID,$AGENT_NAME,$THE_SMART_CONTRACT);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":83,"score":199304.50549452732},{"content":"\tfunction get_payment_instrument($SERVER_ID,$NYM_ID,$nIndex,$PRELOADED_INBOX=null) {\n\n\t\tswitch (func_num_args()) {\n\n\t\tcase 3: $r=OTMadeEasy_get_payment_instrument($this->_cPtr,$SERVER_ID,$NYM_ID,$nIndex); break;\n\n\t\tdefault: $r=OTMadeEasy_get_payment_instrument($this->_cPtr,$SERVER_ID,$NYM_ID,$nIndex,$PRELOADED_INBOX);\n\n\t\t}\n\n\t\treturn $r;\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":84,"score":198427.46170454597},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/core/script/OTPartyAccount.hpp","rank":85,"score":196385.01218720095},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/core/cron/OTCronItem.hpp","rank":86,"score":196374.26504342764},{"content":"\tfunction trigger_clause($SERVER_ID,$NYM_ID,$TRANS_NUM,$CLAUSE_NAME,$STR_PARAM) {\n\n\t\treturn OTMadeEasy_trigger_clause($this->_cPtr,$SERVER_ID,$NYM_ID,$TRANS_NUM,$CLAUSE_NAME,$STR_PARAM);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":87,"score":194520.85947666047},{"content":"// Note: from OTAssetContract.h and .cpp.\n\n// This is a subclass of AccountVisitor, which is used whenever OTAssetContract\n\n// needs to\n\n// loop through all the accounts for a given asset type (its own.) This subclass\n\n// needs to\n\n// call OTServer method to do its job, so it can't be defined in otlib, but must\n\n// be defined\n\n// here in otserver (so it can see the methods that it needs...)\n\n//\n\nclass PayDividendVisitor : public AccountVisitor\n\n{\n\n OTIdentifier* m_pUserID;\n\n OTIdentifier* m_pPayoutAssetID;\n\n OTIdentifier* m_pVoucherAcctID;\n\n String* m_pstrMemo; // contains the original payDividend item from the\n\n // payDividend transaction request. (Stored in the\n\n // memo field for each voucher.)\n\n OTServer* m_pServer; // no need to cleanup. It's here for convenience only.\n\n int64_t m_lPayoutPerShare;\n\n int64_t m_lAmountPaidOut; // as we pay each voucher out, we keep a running\n\n // count.\n\n int64_t m_lAmountReturned; // as we pay each voucher out, we keep a running\n\n // count.\n\n\n\npublic:\n\n PayDividendVisitor(const OTIdentifier& theServerID,\n\n const OTIdentifier& theUserID,\n\n const OTIdentifier& thePayoutAssetID,\n\n const OTIdentifier& theVoucherAcctID,\n","file_path":"include/opentxs/server/PayDividendVisitor.hpp","rank":88,"score":193328.38732898136},{"content":"class String;\n\n\n\n// Todo:\n\n// 1. Add this value to the config file so it becomes merely a default value\n\n// here.\n\n// 2. This timer solution isn't the full solution but only a stopgap measure.\n\n// See notes in ReleaseKeyLowLevel for more -- ultimate solution will involve\n\n// the callback itself, and some kind of encrypted storage of hashed\n\n// passwords,\n\n// using session keys, as well as an option to use ssh-agent and other\n\n// standard\n\n// APIs for protected memory.\n\n//\n\n// UPDATE: Am in the process now of adding the actual Master key. Therefore\n\n// OT_MASTER_KEY_TIMEOUT\n\n// was added for the actual mechanism, while OT_KEY_TIMER (a stopgap measure)\n\n// was set to 0, which\n\n// makes it of no effect. Probably OT_KEY_TIMER will be removed entirely (we'll\n\n// see.)\n\n//\n","file_path":"include/opentxs/core/crypto/OTAsymmetricKeyOpenSSL.hpp","rank":89,"score":192471.01379715896},{"content":"class OTPseudonym;\n","file_path":"include/opentxs/core/crypto/OTNymOrSymmetricKey.hpp","rank":90,"score":192455.66258696612},{"content":"\tfunction pay_dividend($SERVER_ID,$NYM_ID,$SOURCE_ACCT_ID,$SHARES_ASSET_ID,$STR_MEMO,$AMOUNT_PER_SHARE) {\n\n\t\treturn OTMadeEasy_pay_dividend($this->_cPtr,$SERVER_ID,$NYM_ID,$SOURCE_ACCT_ID,$SHARES_ASSET_ID,$STR_MEMO,$AMOUNT_PER_SHARE);\n\n\t}\n\n\n","file_path":"scripts/demo/php/otapi.php","rank":91,"score":191659.18024920247},{"content":"class OTLogStream : public std::ostream, std::streambuf\n\n{\n\nprivate:\n\n int logLevel;\n\n int next;\n\n char* pBuffer;\n\n\n\npublic:\n\n OTLogStream(int _logLevel);\n\n ~OTLogStream();\n\n\n\n virtual int overflow(int c);\n\n};\n\n\n","file_path":"include/opentxs/core/OTLog.hpp","rank":92,"score":191170.05434549606},{"content":"#define DeclareBasedInterface(name, base) \\\n\n class name : public base \\\n\n { \\\n\n public: \\\n\n virtual ~name() \\\n\n { \\\n\n }\n\n\n\n#define EndInterface \\\n\n } \\\n\n ;\n\n\n\n#define implements public\n\n\n\n#endif // (not) SWIG\n\n\n\nnamespace opentxs\n\n{\n\n\n\nnamespace OTDB\n\n{\n\n\n\n// ENUMS: PackType, StorageType, and StoredObjectType.\n\n\n","file_path":"include/opentxs/core/OTStorage.hpp","rank":93,"score":189909.4704551223},{"content":"class OTServerContract : public OTContract\n\n{\n\npublic:\n\n EXPORT OTServerContract();\n\n EXPORT OTServerContract(String& name, String& foldername, String& filename,\n\n String& strID);\n\n EXPORT virtual ~OTServerContract();\n\n\n\n EXPORT bool GetConnectInfo(String& strHostname, int32_t& nPort) const;\n\n EXPORT virtual void CreateContents(); // Only used when first generating an\n\n // asset or server contract. Meant for\n\n // contracts which never change after\n\n // that point. Otherwise does the\n\n // same thing as UpdateContents. (But\n\n // meant for a different purpose.)\n\n virtual bool SaveContractWallet(String& strContents) const;\n\n virtual bool DisplayStatistics(String& strContents) const;\n\n\n\nprotected:\n\n // return -1 if error, 0 if nothing, and 1 if the node was processed.\n","file_path":"include/opentxs/core/OTServerContract.hpp","rank":94,"score":189735.11957604348},{"content":"\n\n EXPORT void ActivateCron();\n\n void ProcessCron();\n\n\n\nprivate:\n\n bool SendInstrumentToNym(const OTIdentifier& serverId,\n\n const OTIdentifier& senderUserId,\n\n const OTIdentifier& recipientUserId,\n\n OTMessage* msg = nullptr,\n\n const OTPayment* payment = nullptr,\n\n const char* command = nullptr);\n\n\n\n // Note: SendInstrumentToNym and SendMessageToNym CALL THIS.\n\n // They are higher-level, this is lower-level.\n\n bool DropMessageToNymbox(const OTIdentifier& serverId,\n\n const OTIdentifier& senderUserId,\n\n const OTIdentifier& recipientUserId,\n\n OTTransaction::transactionType transactionType,\n\n OTMessage* msg = nullptr,\n\n const String* messageString = nullptr,\n","file_path":"include/opentxs/server/OTServer.hpp","rank":95,"score":187573.7789880954},{"content":" const char* command = nullptr);\n\n\n\nprivate:\n\n MainFile mainFile_;\n\n Notary notary_;\n\n Transactor transactor_;\n\n UserCommandProcessor userCommandProcessor_;\n\n\n\n String m_strWalletFilename;\n\n // Used at least for whether or not to write to the PID.\n\n bool m_bReadOnly;\n\n // If the server wants to be shut down, it can set\n\n // this flag so the caller knows to do so.\n\n bool m_bShutdownFlag;\n\n\n\n // A hash of the server contract\n\n String m_strServerID;\n\n // A hash of the public key that signed the server contract\n\n String m_strServerUserID;\n\n // This is the server's own contract, containing its public key and\n","file_path":"include/opentxs/server/OTServer.hpp","rank":96,"score":187570.4144847993},{"content":" }\n\n\n\n static int64_t __min_market_scale;\n\n\n\n static int32_t __heartbeat_no_requests;\n\n static int32_t __heartbeat_ms_between_beats;\n\n\n\n // The Nym who's allowed to do certain commands even if they are turned off.\n\n static std::string __override_nym_id;\n\n // Are usage credits REQUIRED in order to use this server?\n\n static bool __admin_usage_credits;\n\n // Is server currently locked to non-override Nyms?\n\n static bool __admin_server_locked;\n\n\n\n static bool __cmd_usage_credits;\n\n static bool __cmd_issue_asset;\n\n static bool __cmd_get_contract;\n\n static bool __cmd_check_server_id;\n\n\n\n static bool __cmd_create_user_acct;\n","file_path":"include/opentxs/server/ServerSettings.hpp","rank":97,"score":187564.28069358604},{"content":" }\n\n\n\n static int32_t GetHeartbeatMsBetweenBeats()\n\n {\n\n return __heartbeat_ms_between_beats;\n\n }\n\n\n\n static void SetHeartbeatMsBetweenBeats(int32_t value)\n\n {\n\n __heartbeat_ms_between_beats = value;\n\n }\n\n\n\n static const std::string& GetOverrideNymID()\n\n {\n\n return __override_nym_id;\n\n }\n\n\n\n static void SetOverrideNymID(const std::string& id)\n\n {\n\n __override_nym_id = id;\n","file_path":"include/opentxs/server/ServerSettings.hpp","rank":98,"score":187563.7275992242},{"content":" static bool __transact_transfer;\n\n static bool __transact_withdrawal;\n\n static bool __transact_deposit;\n\n static bool __transact_withdraw_voucher;\n\n static bool __transact_deposit_cheque;\n\n static bool __transact_pay_dividend;\n\n\n\n static bool __cmd_get_mint;\n\n static bool __transact_withdraw_cash;\n\n static bool __transact_deposit_cash;\n\n\n\n static bool __cmd_get_market_list;\n\n static bool __cmd_get_market_offers;\n\n static bool __cmd_get_market_recent_trades;\n\n static bool __cmd_get_nym_market_offers;\n\n\n\n static bool __transact_market_offer;\n\n static bool __transact_payment_plan;\n\n static bool __transact_cancel_cron_item;\n\n static bool __transact_smart_contract;\n\n static bool __cmd_trigger_clause;\n\n};\n\n\n\n} // namespace opentxs\n\n\n\n#endif // OPENTXS_SERVER_SERVERSETTINGS_HPP\n","file_path":"include/opentxs/server/ServerSettings.hpp","rank":99,"score":187553.47998610587}],"string":"[\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/Account.hpp\",\n \"rank\": 0,\n \"score\": 273173.24958394736\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/server/Transactor.hpp\",\n \"rank\": 1,\n \"score\": 272706.39791854477\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/server/Notary.hpp\",\n \"rank\": 2,\n \"score\": 272706.39791854477\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/client/OTWallet.hpp\",\n \"rank\": 3,\n \"score\": 266694.9121079102\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/client/OTWallet.hpp\",\n \"rank\": 4,\n \"score\": 266691.9714894188\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/OTItem.hpp\",\n \"rank\": 5,\n \"score\": 266631.055292542\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/server/ClientConnection.hpp\",\n \"rank\": 6,\n \"score\": 266195.50986694166\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/server/MainFile.hpp\",\n \"rank\": 7,\n \"score\": 266195.50986694166\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/server/ConfigLoader.hpp\",\n \"rank\": 8,\n \"score\": 266195.50986694166\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/server/PayDividendVisitor.hpp\",\n \"rank\": 9,\n \"score\": 260036.22396174306\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTServerContract.hpp\",\n \"rank\": 10,\n \"score\": 260036.22396174306\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/server/UserCommandProcessor.hpp\",\n \"rank\": 11,\n \"score\": 260036.22396174306\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/server/PayDividendVisitor.hpp\",\n \"rank\": 12,\n \"score\": 260034.02987552408\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/cron/OTCronItem.hpp\",\n \"rank\": 13,\n \"score\": 254619.17468964605\n },\n {\n \"content\": \"class OTWallet;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/client/OTServerConnection.hpp\",\n \"rank\": 14,\n \"score\": 254264.5690144083\n },\n {\n \"content\": \"class OTServerContract;\\n\",\n \"file_path\": \"include/opentxs/client/OTWallet.hpp\",\n \"rank\": 15,\n \"score\": 254261.9819435165\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTNymOrSymmetricKey.hpp\",\n \"rank\": 16,\n \"score\": 249092.80678867066\n },\n {\n \"content\": \"\\tfunction withdraw_cash($SERVER_ID,$NYM_ID,$ACCT_ID,$AMOUNT) {\\n\\n\\t\\treturn OTMadeEasy_withdraw_cash($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_ID,$AMOUNT);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 17,\n \"score\": 238161.2389114491\n },\n {\n \"content\": \"\\tfunction withdraw_voucher($SERVER_ID,$NYM_ID,$ACCT_ID,$RECIP_NYM_ID,$STR_MEMO,$AMOUNT) {\\n\\n\\t\\treturn OTMadeEasy_withdraw_voucher($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_ID,$RECIP_NYM_ID,$STR_MEMO,$AMOUNT);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 18,\n \"score\": 236825.08549811906\n },\n {\n \"content\": \"// Exception class representing an error occurred during UTF-8 conversion.\\n\\nclass utf8_conversion_error : public std::runtime_error\\n\\n{\\n\\npublic:\\n\\n //\\n\\n // Naming convention note:\\n\\n //\\n\\n // This exception class is derived from std::runtime_error class,\\n\\n // so I chose to use the same naming convention of STL classes\\n\\n // (e.g. do_something_intersting() instead of DoSomethingInteresting()).\\n\\n //\\n\\n\\n\\n // Error code type\\n\\n // (a DWORD, as the return value type from ::GetLastError())\\n\\n typedef unsigned long error_code_type;\\n\\n\\n\\n // Type of conversion\\n\\n enum conversion_type {\\n\\n conversion_utf8_from_utf16, // UTF-16 ---> UTF-8\\n\\n conversion_utf16_from_utf8 // UTF-8 ---> UTF-16\\n\\n };\\n\",\n \"file_path\": \"include/opentxs/core/util/win32_utf8conv.hpp\",\n \"rank\": 19,\n \"score\": 231473.33340646318\n },\n {\n \"content\": \"class String\\n\\n{\\n\\npublic:\\n\\n typedef std::list<std::string> List;\\n\\n typedef std::map<std::string, std::string> Map;\\n\\n\\n\\npublic:\\n\\n EXPORT friend std::ostream& operator<<(std::ostream& os, const String& obj);\\n\\n\\n\\n EXPORT String();\\n\\n EXPORT String(const String& value);\\n\\n EXPORT String(const OTASCIIArmor& value);\\n\\n String(const OTSignature& value);\\n\\n EXPORT String(const OTContract& value);\\n\\n EXPORT String(const OTIdentifier& value);\\n\\n String(OTPseudonym& value);\\n\\n EXPORT String(const char* value);\\n\\n String(const char* value, size_t size);\\n\\n EXPORT String(const std::string& value);\\n\\n EXPORT virtual ~String();\\n\",\n \"file_path\": \"include/opentxs/core/String.hpp\",\n \"rank\": 20,\n \"score\": 228475.28850034688\n },\n {\n \"content\": \"class Account;\\n\\n\\n\\ntypedef std::map<std::string, Account*> mapOfAccounts;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/AccountVisitor.hpp\",\n \"rank\": 21,\n \"score\": 223954.33775651504\n },\n {\n \"content\": \"\\tfunction retrieve_account($SERVER_ID,$NYM_ID,$ACCOUNT_ID,$bForceDownload=null) {\\n\\n\\t\\tswitch (func_num_args()) {\\n\\n\\t\\tcase 3: $r=OTMadeEasy_retrieve_account($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCOUNT_ID); break;\\n\\n\\t\\tdefault: $r=OTMadeEasy_retrieve_account($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCOUNT_ID,$bForceDownload);\\n\\n\\t\\t}\\n\\n\\t\\treturn $r;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 22,\n \"score\": 222810.73548131844\n },\n {\n \"content\": \"class OTServerContract;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/server/OTServer.hpp\",\n \"rank\": 23,\n \"score\": 222047.85837788472\n },\n {\n \"content\": \"\\tfunction send_transfer($SERVER_ID,$NYM_ID,$ACCT_FROM,$ACCT_TO,$AMOUNT,$NOTE) {\\n\\n\\t\\treturn OTMadeEasy_send_transfer($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_FROM,$ACCT_TO,$AMOUNT,$NOTE);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 24,\n \"score\": 221832.54192932945\n },\n {\n \"content\": \"class OTWallet\\n\\n{\\n\\npublic:\\n\\n EXPORT OTWallet();\\n\\n ~OTWallet();\\n\\n\\n\\n EXPORT bool IsNymOnCachedKey(const OTIdentifier& needle) const; // needle\\n\\n // and\\n\\n // haystack.\\n\\n EXPORT bool ConvertNymToCachedKey(OTPseudonym& theNym);\\n\\n\\n\\n EXPORT OTPseudonym* GetOrLoadNym(const OTIdentifier& NYM_ID,\\n\\n bool bChecking = false,\\n\\n const char* szFuncName = nullptr,\\n\\n const OTPasswordData* pPWData = nullptr);\\n\\n EXPORT OTPseudonym* GetOrLoadPublicNym(const OTIdentifier& NYM_ID,\\n\\n const char* szFuncName = nullptr);\\n\\n EXPORT OTPseudonym* GetOrLoadPrivateNym(\\n\\n const OTIdentifier& NYM_ID, bool bChecking = false,\\n\\n const char* szFuncName = nullptr,\\n\",\n \"file_path\": \"include/opentxs/client/OTWallet.hpp\",\n \"rank\": 25,\n \"score\": 219740.3406255503\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTPartyAccount.hpp\",\n \"rank\": 26,\n \"score\": 215578.3034546057\n },\n {\n \"content\": \"class String;\\n\\n\\n\\ntypedef std::map<int32_t, OTASCIIArmor*> mapOfPrototokens;\\n\\n\\n\\n/*\\n\\n Here's a rough sketch of the protocol:\\n\\n\\n\\n Client requests Mint for withdrawal of 100 ithica work hours.\\n\\n\\n\\n1) Client blinds and sends N tokens to the server, each worth 100 hours. Client\\n\\nretains the keys.\\n\\n2) Server responds with a single index, the one the server has chosen for\\n\\nsigning.\\n\\n3) Client replies with 99 keys.\\n\\n4) Server unblinds 99 tokens (or some randomly-chosen % of those) and verifies\\n\\nthem.\\n\\n He signs the last one and returns it.\\n\\n5) Client receives signed token, unblinds it, stores it for later.\\n\\n6) When token is redeemed, it has already been unblinded. So Server simply\\n\\nverifies it.\\n\",\n \"file_path\": \"include/opentxs/cash/Token.hpp\",\n \"rank\": 27,\n \"score\": 214411.09510851186\n },\n {\n \"content\": \"class String;\\n\\n\\n\\nEXPORT int32_t OT_CLI_GetArgsCount(const std::string& str_Args);\\n\\nEXPORT std::string OT_CLI_GetValueByKey(const std::string& str_Args,\\n\\n const std::string& str_key);\\n\\nEXPORT std::string OT_CLI_GetValueByIndex(const std::string& str_Args,\\n\\n int32_t nIndex);\\n\\nEXPORT std::string OT_CLI_GetKeyByIndex(const std::string& str_Args,\\n\\n int32_t nIndex);\\n\\nEXPORT std::string OT_CLI_ReadLine();\\n\\nEXPORT std::string OT_CLI_ReadUntilEOF();\\n\\n\\n\",\n \"file_path\": \"include/opentxs/client/OT_ME.hpp\",\n \"rank\": 28,\n \"score\": 214411.09510851186\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/cash/Mint.hpp\",\n \"rank\": 29,\n \"score\": 214407.36488991822\n },\n {\n \"content\": \"class OTServerContract;\\n\",\n \"file_path\": \"include/opentxs/client/OTServerConnection.hpp\",\n \"rank\": 30,\n \"score\": 211159.01369183935\n },\n {\n \"content\": \"\\tfunction process_inbox($SERVER_ID,$NYM_ID,$ACCOUNT_ID,$RESPONSE_LEDGER) {\\n\\n\\t\\treturn OTMadeEasy_process_inbox($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCOUNT_ID,$RESPONSE_LEDGER);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 31,\n \"score\": 210578.26735114722\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/core/String.hpp\",\n \"rank\": 32,\n \"score\": 209536.13183260825\n },\n {\n \"content\": \"class String;\\n\\n\\n\\n// transaction ID is a int64_t, assigned by the server. Each transaction has\\n\\n// one.\\n\\n// FIRST the server issues the ID. THEN we create the blank transaction object\\n\\n// with the\\n\\n// ID in it and store it in our inbox. THEN if we want to send a transaction, we\\n\\n// use\\n\\n// the blank to do so. If there is no blank available, we message the server and\\n\\n// request one.\\n\\n\\n\\ntypedef std::map<int64_t, OTTransaction*> mapOfTransactions;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTLedger.hpp\",\n \"rank\": 33,\n \"score\": 209530.97975047881\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/AssetContract.hpp\",\n \"rank\": 34,\n \"score\": 209530.97975047881\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/transaction/Helpers.hpp\",\n \"rank\": 35,\n \"score\": 209530.97975047881\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/OTIdentifier.hpp\",\n \"rank\": 36,\n \"score\": 209530.97975047881\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/OTLedger.hpp\",\n \"rank\": 37,\n \"score\": 209528.03913198746\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/client/OTClient.hpp\",\n \"rank\": 38,\n \"score\": 209528.03913198746\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/AssetContract.hpp\",\n \"rank\": 39,\n \"score\": 209528.03913198746\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/client/OpenTransactions.hpp\",\n \"rank\": 40,\n \"score\": 209528.03913198746\n },\n {\n \"content\": \"class OTPseudonym;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/Account.hpp\",\n \"rank\": 41,\n \"score\": 209508.75817763002\n },\n {\n \"content\": \"class AssetContract;\\n\",\n \"file_path\": \"include/opentxs/server/Transactor.hpp\",\n \"rank\": 42,\n \"score\": 209092.04269735026\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/server/Notary.hpp\",\n \"rank\": 43,\n \"score\": 209058.62105172954\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/server/Transactor.hpp\",\n \"rank\": 44,\n \"score\": 209058.62105172954\n },\n {\n \"content\": \"// The most useful generic data object... a map of strings, key/value pairs.\\n\\n//\\n\\nclass StringMap : public Storable\\n\\n{\\n\\n // You never actually get an instance of this, only its subclasses.\\n\\n // Therefore, I don't allow you to access the constructor except through the\\n\\n // factory.\\n\\nprotected:\\n\\n StringMap()\\n\\n : Storable()\\n\\n {\\n\\n m_Type = \\\"StringMap\\\";\\n\\n }\\n\\n\\n\\npublic:\\n\\n virtual ~StringMap()\\n\\n {\\n\\n }\\n\\n\\n\\n std::map<std::string, std::string> the_map;\\n\\n\\n\\n void SetValue(const std::string& strKey, const std::string& strValue)\\n\",\n \"file_path\": \"include/opentxs/core/OTStorage.hpp\",\n \"rank\": 45,\n \"score\": 208872.58979606268\n },\n {\n \"content\": \"\\tfunction query_asset_types($SERVER_ID,$NYM_ID,$ENCODED_MAP) {\\n\\n\\t\\treturn OTMadeEasy_query_asset_types($this->_cPtr,$SERVER_ID,$NYM_ID,$ENCODED_MAP);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 46,\n \"score\": 206772.11004126142\n },\n {\n \"content\": \"class OTWallet;\\n\\n\\n\\n// This class represents the \\\"test client\\\"\\n\\n//\\n\\n// I have it separate from the wallet because I would like to be\\n\\n// able to use the wallet in a \\\"nice client\\\" too, so I'm forcing\\n\\n// the separation to keep it designed that way.\\n\\n//\\n\\n\\n\",\n \"file_path\": \"include/opentxs/client/OTClient.hpp\",\n \"rank\": 47,\n \"score\": 204978.20858836995\n },\n {\n \"content\": \"class OTWallet;\\n\",\n \"file_path\": \"include/opentxs/client/OpenTransactions.hpp\",\n \"rank\": 48,\n \"score\": 204978.20858836995\n },\n {\n \"content\": \"class AssetContract;\\n\",\n \"file_path\": \"include/opentxs/client/OTWallet.hpp\",\n \"rank\": 49,\n \"score\": 204976.9128405369\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/client/OTWallet.hpp\",\n \"rank\": 50,\n \"score\": 204943.4911949162\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTSignature.hpp\",\n \"rank\": 51,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTNumList.hpp\",\n \"rank\": 52,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTEnvelope.hpp\",\n \"rank\": 53,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTKeyring.hpp\",\n \"rank\": 54,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\\n\\n\\ntypedef std::map<std::string, OTStashItem*> mapOfStashItems;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/script/OTStash.hpp\",\n \"rank\": 55,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTMasterkey.hpp\",\n \"rank\": 56,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTScript.hpp\",\n \"rank\": 57,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTTransactionType.hpp\",\n \"rank\": 58,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTSubcredential.hpp\",\n \"rank\": 59,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\\n\\n\\ntypedef std::list<OTAsymmetricKey*> listOfAsymmetricKeys;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTKeypair.hpp\",\n \"rank\": 60,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/client/OTMessageBuffer.hpp\",\n \"rank\": 61,\n \"score\": 204917.04467496008\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTParty.hpp\",\n \"rank\": 62,\n \"score\": 204914.85058874113\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTAgent.hpp\",\n \"rank\": 63,\n \"score\": 204914.85058874113\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTScriptable.hpp\",\n \"rank\": 64,\n \"score\": 204914.85058874113\n },\n {\n \"content\": \"class OTPseudonym;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/AccountList.hpp\",\n \"rank\": 65,\n \"score\": 204895.56963438372\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/core/OTItem.hpp\",\n \"rank\": 66,\n \"score\": 204884.2363000071\n },\n {\n \"content\": \"class OTStringXML : public String\\n\\n{\\n\\npublic:\\n\\n EXPORT OTStringXML();\\n\\n EXPORT OTStringXML(const String& value);\\n\\n EXPORT OTStringXML(const OTStringXML& value);\\n\\n\\n\\n EXPORT virtual ~OTStringXML();\\n\\n\\n\\n EXPORT operator irr::io::IFileReadCallBack*();\\n\\n\\n\\n EXPORT OTStringXML& operator=(const String& rhs);\\n\\n EXPORT OTStringXML& operator=(const OTStringXML& rhs);\\n\\n\\n\\n int32_t read(void* buffer, uint32_t sizeToRead);\\n\\n int32_t getSize();\\n\\n\\n\\nprivate:\\n\",\n \"file_path\": \"include/opentxs/core/OTStringXML.hpp\",\n \"rank\": 67,\n \"score\": 201314.58545937695\n },\n {\n \"content\": \"class Account : public OTTransactionType\\n\\n{\\n\\n friend OTTransactionType* OTTransactionType::TransactionFactory(\\n\\n String input);\\n\\n\\n\\npublic:\\n\\n // If you add any types to this list, update the list of strings at the\\n\\n // top of the .cpp file.\\n\\n enum AccountType {\\n\\n simple, // used by users\\n\\n issuer, // used by issuers (these can only go negative.)\\n\\n basket, // issuer acct used by basket currencies (these can only go\\n\\n // negative)\\n\\n basketsub, // used by the server (to store backing reserves for basket\\n\\n // sub-accounts)\\n\\n mint, // used by mints (to store backing reserves for cash)\\n\\n voucher, // used by the server (to store backing reserves for\\n\\n // vouchers)\\n\\n stash, // used by the server (to store backing reserves for stashes,\\n\\n // for smart contracts.)\\n\",\n \"file_path\": \"include/opentxs/core/Account.hpp\",\n \"rank\": 68,\n \"score\": 200915.42912221633\n },\n {\n \"content\": \"class String;\\n\\n\\n\\n/*\\n\\n To use:\\n\\n\\n\\n OTPassword thePass;\\n\\n (Or...)\\n\\n OTPassword thePass(strPassword, strPassword.length());\\n\\n\\n\\n const char * szPassword = thePass.getPassword();\\n\\n const int32_t nPassLength = thePass.getPasswordSize();\\n\\n\\n\\n If the instance of OTPassword is not going to be destroyed immediately\\n\\n after the password is used, then make sure to call zeroMemory() after\\n\\n using the password. (Otherwise the destructor will handle this anyway.)\\n\\n\\n\\n (The primary purpose of this class is that it zeros its memory out when\\n\\n it is destructed.)\\n\\n\\n\\n This class gives me a safe way to hand-off a password, and off-load the\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTPasswordData.hpp\",\n \"rank\": 69,\n \"score\": 200548.09028935677\n },\n {\n \"content\": \"class String;\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTCachedKey.hpp\",\n \"rank\": 70,\n \"score\": 200548.09028935677\n },\n {\n \"content\": \"class String;\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTSymmetricKey.hpp\",\n \"rank\": 71,\n \"score\": 200548.09028935677\n },\n {\n \"content\": \"class String;\\n\\n\\n\\ntypedef std::list<OTAsymmetricKey*> listOfAsymmetricKeys;\\n\\n\\n\\n// Todo:\\n\\n// 1. Add this value to the config file so it becomes merely a default value\\n\\n// here.\\n\\n// 2. This timer solution isn't the full solution but only a stopgap measure.\\n\\n// See notes in ReleaseKeyLowLevel for more -- ultimate solution will involve\\n\\n// the callback itself, and some kind of encrypted storage of hashed\\n\\n// passwords,\\n\\n// using session keys, as well as an option to use ssh-agent and other\\n\\n// standard\\n\\n// APIs for protected memory.\\n\\n//\\n\\n// UPDATE: Am in the process now of adding the actual Master key. Therefore\\n\\n// OT_MASTER_KEY_TIMEOUT\\n\\n// was added for the actual mechanism, while OT_KEY_TIMER (a stopgap measure)\\n\\n// was set to 0, which\\n\\n// makes it of no effect. Probably OT_KEY_TIMER will be removed entirely (we'll\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTAsymmetricKey.hpp\",\n \"rank\": 72,\n \"score\": 200548.09028935677\n },\n {\n \"content\": \"class Account;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTSmartContract.hpp\",\n \"rank\": 73,\n \"score\": 200546.60309766326\n },\n {\n \"content\": \"class RippleServer : public Server\\n\\n{\\n\\n // You never actually get an instance of this, only its subclasses.\\n\\n // Therefore, I don't allow you to access the constructor except through\\n\\n // factory.\\n\\nprotected:\\n\\n RippleServer()\\n\\n : Server()\\n\\n {\\n\\n m_Type = \\\"RippleServer\\\";\\n\\n }\\n\\n\\n\\npublic:\\n\\n virtual ~RippleServer()\\n\\n {\\n\\n }\\n\\n\\n\\n using Displayable::gui_label; // The label that appears in the GUI\\n\\n\\n\\n using ServerInfo::server_id; // in base class\\n\",\n \"file_path\": \"include/opentxs/core/OTStorage.hpp\",\n \"rank\": 74,\n \"score\": 200388.28698654432\n },\n {\n \"content\": \"class BitcoinServer : public Server\\n\\n{\\n\\n // You never actually get an instance of this, only its subclasses.\\n\\n // Therefore, I don't allow you to access the constructor except through\\n\\n // factory.\\n\\nprotected:\\n\\n BitcoinServer()\\n\\n : Server()\\n\\n {\\n\\n m_Type = \\\"BitcoinServer\\\";\\n\\n }\\n\\n\\n\\npublic:\\n\\n virtual ~BitcoinServer()\\n\\n {\\n\\n }\\n\\n\\n\\n using Displayable::gui_label; // The label that appears in the GUI\\n\\n\\n\\n using ServerInfo::server_id; // in base class\\n\",\n \"file_path\": \"include/opentxs/core/OTStorage.hpp\",\n \"rank\": 75,\n \"score\": 200388.28698654432\n },\n {\n \"content\": \"class LoomServer : public Server\\n\\n{\\n\\n // You never actually get an instance of this, only its subclasses.\\n\\n // Therefore, I don't allow you to access the constructor except through\\n\\n // factory.\\n\\nprotected:\\n\\n LoomServer()\\n\\n : Server()\\n\\n {\\n\\n m_Type = \\\"LoomServer\\\";\\n\\n }\\n\\n\\n\\npublic:\\n\\n virtual ~LoomServer()\\n\\n {\\n\\n }\\n\\n\\n\\n using Displayable::gui_label; // The label that appears in the GUI\\n\\n\\n\\n using ServerInfo::server_id; // in base class\\n\",\n \"file_path\": \"include/opentxs/core/OTStorage.hpp\",\n \"rank\": 76,\n \"score\": 200388.28698654432\n },\n {\n \"content\": \"class Server : public ServerInfo\\n\\n{\\n\\n // You never actually get an instance of this, only its subclasses.\\n\\n // Therefore, I don't allow you to access the constructor except through\\n\\n // factory.\\n\\nprotected:\\n\\n Server()\\n\\n : ServerInfo()\\n\\n {\\n\\n m_Type = \\\"Server\\\";\\n\\n }\\n\\n\\n\\npublic:\\n\\n virtual ~Server()\\n\\n {\\n\\n }\\n\\n\\n\\n using Displayable::gui_label; // The label that appears in the GUI\\n\\n\\n\\n using ServerInfo::server_id; // in base class\\n\\n using ServerInfo::server_type; // in base class\\n\\n\\n\\n std::string server_host;\\n\\n std::string server_port;\\n\\n\\n\\n DEFINE_OT_DYNAMIC_CAST(Server)\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTStorage.hpp\",\n \"rank\": 77,\n \"score\": 200388.28698654432\n },\n {\n \"content\": \"class OTServerContract;\\n\",\n \"file_path\": \"include/opentxs/client/OpenTransactions.hpp\",\n \"rank\": 78,\n \"score\": 200133.2157420871\n },\n {\n \"content\": \"class OTServerContract;\\n\",\n \"file_path\": \"include/opentxs/client/OTClient.hpp\",\n \"rank\": 79,\n \"score\": 200133.2157420871\n },\n {\n \"content\": \"class OTServerContract;\\n\",\n \"file_path\": \"include/opentxs/client/TransportCallback.hpp\",\n \"rank\": 80,\n \"score\": 200133.2157420871\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/client/OTServerConnection.hpp\",\n \"rank\": 81,\n \"score\": 200101.08541952516\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/server/UserCommandProcessor.hpp\",\n \"rank\": 82,\n \"score\": 200101.08541952516\n },\n {\n \"content\": \"\\tfunction activate_smart_contract($SERVER_ID,$NYM_ID,$ACCT_ID,$AGENT_NAME,$THE_SMART_CONTRACT) {\\n\\n\\t\\treturn OTMadeEasy_activate_smart_contract($this->_cPtr,$SERVER_ID,$NYM_ID,$ACCT_ID,$AGENT_NAME,$THE_SMART_CONTRACT);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 83,\n \"score\": 199304.50549452732\n },\n {\n \"content\": \"\\tfunction get_payment_instrument($SERVER_ID,$NYM_ID,$nIndex,$PRELOADED_INBOX=null) {\\n\\n\\t\\tswitch (func_num_args()) {\\n\\n\\t\\tcase 3: $r=OTMadeEasy_get_payment_instrument($this->_cPtr,$SERVER_ID,$NYM_ID,$nIndex); break;\\n\\n\\t\\tdefault: $r=OTMadeEasy_get_payment_instrument($this->_cPtr,$SERVER_ID,$NYM_ID,$nIndex,$PRELOADED_INBOX);\\n\\n\\t\\t}\\n\\n\\t\\treturn $r;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 84,\n \"score\": 198427.46170454597\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/core/script/OTPartyAccount.hpp\",\n \"rank\": 85,\n \"score\": 196385.01218720095\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/core/cron/OTCronItem.hpp\",\n \"rank\": 86,\n \"score\": 196374.26504342764\n },\n {\n \"content\": \"\\tfunction trigger_clause($SERVER_ID,$NYM_ID,$TRANS_NUM,$CLAUSE_NAME,$STR_PARAM) {\\n\\n\\t\\treturn OTMadeEasy_trigger_clause($this->_cPtr,$SERVER_ID,$NYM_ID,$TRANS_NUM,$CLAUSE_NAME,$STR_PARAM);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 87,\n \"score\": 194520.85947666047\n },\n {\n \"content\": \"// Note: from OTAssetContract.h and .cpp.\\n\\n// This is a subclass of AccountVisitor, which is used whenever OTAssetContract\\n\\n// needs to\\n\\n// loop through all the accounts for a given asset type (its own.) This subclass\\n\\n// needs to\\n\\n// call OTServer method to do its job, so it can't be defined in otlib, but must\\n\\n// be defined\\n\\n// here in otserver (so it can see the methods that it needs...)\\n\\n//\\n\\nclass PayDividendVisitor : public AccountVisitor\\n\\n{\\n\\n OTIdentifier* m_pUserID;\\n\\n OTIdentifier* m_pPayoutAssetID;\\n\\n OTIdentifier* m_pVoucherAcctID;\\n\\n String* m_pstrMemo; // contains the original payDividend item from the\\n\\n // payDividend transaction request. (Stored in the\\n\\n // memo field for each voucher.)\\n\\n OTServer* m_pServer; // no need to cleanup. It's here for convenience only.\\n\\n int64_t m_lPayoutPerShare;\\n\\n int64_t m_lAmountPaidOut; // as we pay each voucher out, we keep a running\\n\\n // count.\\n\\n int64_t m_lAmountReturned; // as we pay each voucher out, we keep a running\\n\\n // count.\\n\\n\\n\\npublic:\\n\\n PayDividendVisitor(const OTIdentifier& theServerID,\\n\\n const OTIdentifier& theUserID,\\n\\n const OTIdentifier& thePayoutAssetID,\\n\\n const OTIdentifier& theVoucherAcctID,\\n\",\n \"file_path\": \"include/opentxs/server/PayDividendVisitor.hpp\",\n \"rank\": 88,\n \"score\": 193328.38732898136\n },\n {\n \"content\": \"class String;\\n\\n\\n\\n// Todo:\\n\\n// 1. Add this value to the config file so it becomes merely a default value\\n\\n// here.\\n\\n// 2. This timer solution isn't the full solution but only a stopgap measure.\\n\\n// See notes in ReleaseKeyLowLevel for more -- ultimate solution will involve\\n\\n// the callback itself, and some kind of encrypted storage of hashed\\n\\n// passwords,\\n\\n// using session keys, as well as an option to use ssh-agent and other\\n\\n// standard\\n\\n// APIs for protected memory.\\n\\n//\\n\\n// UPDATE: Am in the process now of adding the actual Master key. Therefore\\n\\n// OT_MASTER_KEY_TIMEOUT\\n\\n// was added for the actual mechanism, while OT_KEY_TIMER (a stopgap measure)\\n\\n// was set to 0, which\\n\\n// makes it of no effect. Probably OT_KEY_TIMER will be removed entirely (we'll\\n\\n// see.)\\n\\n//\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTAsymmetricKeyOpenSSL.hpp\",\n \"rank\": 89,\n \"score\": 192471.01379715896\n },\n {\n \"content\": \"class OTPseudonym;\\n\",\n \"file_path\": \"include/opentxs/core/crypto/OTNymOrSymmetricKey.hpp\",\n \"rank\": 90,\n \"score\": 192455.66258696612\n },\n {\n \"content\": \"\\tfunction pay_dividend($SERVER_ID,$NYM_ID,$SOURCE_ACCT_ID,$SHARES_ASSET_ID,$STR_MEMO,$AMOUNT_PER_SHARE) {\\n\\n\\t\\treturn OTMadeEasy_pay_dividend($this->_cPtr,$SERVER_ID,$NYM_ID,$SOURCE_ACCT_ID,$SHARES_ASSET_ID,$STR_MEMO,$AMOUNT_PER_SHARE);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"scripts/demo/php/otapi.php\",\n \"rank\": 91,\n \"score\": 191659.18024920247\n },\n {\n \"content\": \"class OTLogStream : public std::ostream, std::streambuf\\n\\n{\\n\\nprivate:\\n\\n int logLevel;\\n\\n int next;\\n\\n char* pBuffer;\\n\\n\\n\\npublic:\\n\\n OTLogStream(int _logLevel);\\n\\n ~OTLogStream();\\n\\n\\n\\n virtual int overflow(int c);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTLog.hpp\",\n \"rank\": 92,\n \"score\": 191170.05434549606\n },\n {\n \"content\": \"#define DeclareBasedInterface(name, base) \\\\\\n\\n class name : public base \\\\\\n\\n { \\\\\\n\\n public: \\\\\\n\\n virtual ~name() \\\\\\n\\n { \\\\\\n\\n }\\n\\n\\n\\n#define EndInterface \\\\\\n\\n } \\\\\\n\\n ;\\n\\n\\n\\n#define implements public\\n\\n\\n\\n#endif // (not) SWIG\\n\\n\\n\\nnamespace opentxs\\n\\n{\\n\\n\\n\\nnamespace OTDB\\n\\n{\\n\\n\\n\\n// ENUMS: PackType, StorageType, and StoredObjectType.\\n\\n\\n\",\n \"file_path\": \"include/opentxs/core/OTStorage.hpp\",\n \"rank\": 93,\n \"score\": 189909.4704551223\n },\n {\n \"content\": \"class OTServerContract : public OTContract\\n\\n{\\n\\npublic:\\n\\n EXPORT OTServerContract();\\n\\n EXPORT OTServerContract(String& name, String& foldername, String& filename,\\n\\n String& strID);\\n\\n EXPORT virtual ~OTServerContract();\\n\\n\\n\\n EXPORT bool GetConnectInfo(String& strHostname, int32_t& nPort) const;\\n\\n EXPORT virtual void CreateContents(); // Only used when first generating an\\n\\n // asset or server contract. Meant for\\n\\n // contracts which never change after\\n\\n // that point. Otherwise does the\\n\\n // same thing as UpdateContents. (But\\n\\n // meant for a different purpose.)\\n\\n virtual bool SaveContractWallet(String& strContents) const;\\n\\n virtual bool DisplayStatistics(String& strContents) const;\\n\\n\\n\\nprotected:\\n\\n // return -1 if error, 0 if nothing, and 1 if the node was processed.\\n\",\n \"file_path\": \"include/opentxs/core/OTServerContract.hpp\",\n \"rank\": 94,\n \"score\": 189735.11957604348\n },\n {\n \"content\": \"\\n\\n EXPORT void ActivateCron();\\n\\n void ProcessCron();\\n\\n\\n\\nprivate:\\n\\n bool SendInstrumentToNym(const OTIdentifier& serverId,\\n\\n const OTIdentifier& senderUserId,\\n\\n const OTIdentifier& recipientUserId,\\n\\n OTMessage* msg = nullptr,\\n\\n const OTPayment* payment = nullptr,\\n\\n const char* command = nullptr);\\n\\n\\n\\n // Note: SendInstrumentToNym and SendMessageToNym CALL THIS.\\n\\n // They are higher-level, this is lower-level.\\n\\n bool DropMessageToNymbox(const OTIdentifier& serverId,\\n\\n const OTIdentifier& senderUserId,\\n\\n const OTIdentifier& recipientUserId,\\n\\n OTTransaction::transactionType transactionType,\\n\\n OTMessage* msg = nullptr,\\n\\n const String* messageString = nullptr,\\n\",\n \"file_path\": \"include/opentxs/server/OTServer.hpp\",\n \"rank\": 95,\n \"score\": 187573.7789880954\n },\n {\n \"content\": \" const char* command = nullptr);\\n\\n\\n\\nprivate:\\n\\n MainFile mainFile_;\\n\\n Notary notary_;\\n\\n Transactor transactor_;\\n\\n UserCommandProcessor userCommandProcessor_;\\n\\n\\n\\n String m_strWalletFilename;\\n\\n // Used at least for whether or not to write to the PID.\\n\\n bool m_bReadOnly;\\n\\n // If the server wants to be shut down, it can set\\n\\n // this flag so the caller knows to do so.\\n\\n bool m_bShutdownFlag;\\n\\n\\n\\n // A hash of the server contract\\n\\n String m_strServerID;\\n\\n // A hash of the public key that signed the server contract\\n\\n String m_strServerUserID;\\n\\n // This is the server's own contract, containing its public key and\\n\",\n \"file_path\": \"include/opentxs/server/OTServer.hpp\",\n \"rank\": 96,\n \"score\": 187570.4144847993\n },\n {\n \"content\": \" }\\n\\n\\n\\n static int64_t __min_market_scale;\\n\\n\\n\\n static int32_t __heartbeat_no_requests;\\n\\n static int32_t __heartbeat_ms_between_beats;\\n\\n\\n\\n // The Nym who's allowed to do certain commands even if they are turned off.\\n\\n static std::string __override_nym_id;\\n\\n // Are usage credits REQUIRED in order to use this server?\\n\\n static bool __admin_usage_credits;\\n\\n // Is server currently locked to non-override Nyms?\\n\\n static bool __admin_server_locked;\\n\\n\\n\\n static bool __cmd_usage_credits;\\n\\n static bool __cmd_issue_asset;\\n\\n static bool __cmd_get_contract;\\n\\n static bool __cmd_check_server_id;\\n\\n\\n\\n static bool __cmd_create_user_acct;\\n\",\n \"file_path\": \"include/opentxs/server/ServerSettings.hpp\",\n \"rank\": 97,\n \"score\": 187564.28069358604\n },\n {\n \"content\": \" }\\n\\n\\n\\n static int32_t GetHeartbeatMsBetweenBeats()\\n\\n {\\n\\n return __heartbeat_ms_between_beats;\\n\\n }\\n\\n\\n\\n static void SetHeartbeatMsBetweenBeats(int32_t value)\\n\\n {\\n\\n __heartbeat_ms_between_beats = value;\\n\\n }\\n\\n\\n\\n static const std::string& GetOverrideNymID()\\n\\n {\\n\\n return __override_nym_id;\\n\\n }\\n\\n\\n\\n static void SetOverrideNymID(const std::string& id)\\n\\n {\\n\\n __override_nym_id = id;\\n\",\n \"file_path\": \"include/opentxs/server/ServerSettings.hpp\",\n \"rank\": 98,\n \"score\": 187563.7275992242\n },\n {\n \"content\": \" static bool __transact_transfer;\\n\\n static bool __transact_withdrawal;\\n\\n static bool __transact_deposit;\\n\\n static bool __transact_withdraw_voucher;\\n\\n static bool __transact_deposit_cheque;\\n\\n static bool __transact_pay_dividend;\\n\\n\\n\\n static bool __cmd_get_mint;\\n\\n static bool __transact_withdraw_cash;\\n\\n static bool __transact_deposit_cash;\\n\\n\\n\\n static bool __cmd_get_market_list;\\n\\n static bool __cmd_get_market_offers;\\n\\n static bool __cmd_get_market_recent_trades;\\n\\n static bool __cmd_get_nym_market_offers;\\n\\n\\n\\n static bool __transact_market_offer;\\n\\n static bool __transact_payment_plan;\\n\\n static bool __transact_cancel_cron_item;\\n\\n static bool __transact_smart_contract;\\n\\n static bool __cmd_trigger_clause;\\n\\n};\\n\\n\\n\\n} // namespace opentxs\\n\\n\\n\\n#endif // OPENTXS_SERVER_SERVERSETTINGS_HPP\\n\",\n \"file_path\": \"include/opentxs/server/ServerSettings.hpp\",\n \"rank\": 99,\n \"score\": 187553.47998610587\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":0,"numItemsPerPage":100,"numTotalItems":13489,"offset":0,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NTYzNzU4MCwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3NzU2NDExODAsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.vlPxCcN_d5I63hUBWXYJBifKJVTYOzMs9EFqtu6JCF377KX55NbqC9-uS8TC-VAKCzEvu9CDOTySpNcmHQrbAw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":13489,"numBytesParquet":605686331}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
lang stringclasses 3
values | file_path stringlengths 5 150 | repo_name stringlengths 6 110 | commit stringlengths 40 40 | file_code stringlengths 1.52k 18.9k | prefix stringlengths 82 16.5k | suffix stringlengths 0 15.1k | middle stringlengths 121 8.18k | strategy stringclasses 8
values | context_items listlengths 0 100 |
|---|---|---|---|---|---|---|---|---|---|
C++ | src/BabylonCpp/src/maths/spherical_polynomial.cpp | samdauwe/BabylonCpp | eea9f761a49bb460ff1324c20e4674ef120e94f1 | #include <babylon/maths/spherical_polynomial.h>
#include <babylon/maths/color3.h>
#include <babylon/maths/tmp_vectors.h>
namespace BABYLON {
SphericalPolynomial::SphericalPolynomial()
: x{Vector3::Zero()}
, y{Vector3::Zero()}
, z{Vector3::Zero()}
, xx{Vector3::Zero()}
, yy{Vector3::Zero()}
, ... | #include <babylon/maths/spherical_polynomial.h>
#include <babylon/maths/color3.h>
#include <babylon/maths/tmp_vectors.h>
namespace BABYLON {
SphericalPolynomial::SphericalPolynomial()
: x{Vector3::Zero()}
, y{Vector3::Zero()}
, z{Vector3::Zero()}
, xx{Vector3::Zero()}
, yy{Vector3::Zero()}
, ... |
}
| 9) {
return sp;
}
Vector3::FromArrayToRef(data[0], 0, sp.x);
Vector3::FromArrayToRef(data[1], 0, sp.y);
Vector3::FromArrayToRef(data[2], 0, sp.z);
Vector3::FromArrayToRef(data[3], 0, sp.xx);
Vector3::FromArrayToRef(data[4], 0, sp.yy);
Vector3::FromArrayToRef(data[5], 0, sp.zz);
Vector3::FromArrayTo... | function_block-function_prefixed | [
{
"content": "class Color3;\n",
"file_path": "src/BabylonCpp/include/babylon/maths/spherical_harmonics.h",
"rank": 0,
"score": 282209.0951003985
},
{
"content": "namespace BABYLON {\n\n\n\n/**\n\n * @brief Defines One Image in the file. It requires only the position in the\n\n * file as well... |
C++ | examples/UseOptiXGeometryInstancedStandalone/UseOptiXGeometryInstancedStandalone.cc | hanswenzel/opticks | b75b5929b6cf36a5eedeffb3031af2920f75f9f0 |
#include <chrono>
#include <iomanip>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <fstream>
#include <optix_world.h>
#include <optixu/optixpp_namespace.h>
#include <glm/glm.hpp>
#include <glm/gtx/transform.hpp>
#include <glm/gtc/type_ptr.hpp>
void getEyeUVW(const glm::vec4&... |
#include <chrono>
#include <iomanip>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <fstream>
#include <optix_world.h>
#include <optixu/optixpp_namespace.h>
#include <glm/glm.hpp>
#include <glm/gtx/transform.hpp>
#include <glm/gtc/type_ptr.hpp>
void getEyeUVW(const glm::vec4&... | tion( context->createAcceleration( "Trbvh" ) );
top->addChild(assembly);
optix::Acceleration instance_accel = context->createAcceleration( "Trbvh" );
unsigned ichild(0);
for( unsigned u = 0; u < nu; ++u ) {
for( unsigned v = 0; v < nv ; ++v ) {
for( unsigned w = 0; w < nw ; ++w ) {
... | ec3(axis_angle)) ; break ;
case 't': mat = glm::translate(mat, tlat ) ; break ;
}
}
return mat ;
}
glm::mat4 make_transform(const std::string& order)
{
glm::vec3 tla(0,0,100) ;
glm::vec4 rot(0,0,1,45);
glm::vec3 sca(1,1,1) ;
return make_trans... | random | [
{
"content": "struct DescriptorDataType<unsigned int> { static const char value = 'u'; };\n\ntemplate<>\n",
"file_path": "npy/numpy.hpp",
"rank": 0,
"score": 339528.31468513457
},
{
"content": "struct DescriptorDataType<unsigned char> { static const char value = 'u'; };\n\ntemplate<>\n",
... |
C++ | CompareContacts/main.cpp | Sioniras/MD-Tools | df408c122dfb57100bdc976dba66b47ee03622fe |
#include <iostream>
#include <vector>
#include <memory>
#include <cstdlib>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include "ContactList.h"
int main(int argc,char** argv)
{
if(argc < 4)
{
std::cout << "Please specify the minimum score and at least two contacts files." << std::endl;
std::c... |
#include <iostream>
#include <vector>
#include <memory>
#include <cstdlib>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include "ContactList.h"
int main(int argc,char** argv)
{
if(argc < 4)
{
std::cout << "Please specify the minimum score and at least two contacts files." << std::endl;
std::c... | str << " " << std::setw(columnpadding) << "" << " |";
}
k2++;
}
if(m >= minscore)
s[k-1] += str.str() + "\n";
}
for(unsigned int i = 0;i < list.size(); i++)
std::cout << s[i];
std::cout << std::string(str.str().size(),'-') << std::endl;
std::cout << std::setw(2*columnpadding+2) ... | << (*i).Left << " -" << std::setw(columnpadding) << (*i).Right + " |";
k = 0;
k2 = 0;
m = 0.0;
for(auto j = list.cbegin(); j != list.cend(); j++)
{
auto it = std::find( (*j)->List().cbegin(), (*j)->List().cend(), (*i));
if(it != (*j)->List().cend() && (*it).Mean >= minscore)
{
k++;... | random | [
{
"content": "// Contact helper struct\n\nstruct Contact\n\n{\n\n\tpublic:\n\n\t\t// Data members\n\n\t\tstd::string Left;\n\n\t\tstd::string Right;\n\n\t\tstd::string Type;\n\n\t\tfloat Mean;\n\n\t\tfloat Median;\n\n\t\tfloat HBondPercentage;\n\n\t\n\n\t\t// Constructors / destructor\n\n\t\tContact() {};\n\n\t... |
C++ | Builds/JuceLibraryCode/modules/juce_core/native/juce_android_Network.cpp | eriser/CSL | 6f4646369f0c90ea90e2c113374044818ab37ded |
#define JNI_CLASS_MEMBERS(METHOD, STATICMETHOD, FIELD, STATICFIELD) \
METHOD (constructor, "<init>", "()V") \
METHOD (toString, "toString", "()Ljava/lang/String;") \
DECLARE_JNI_CLASS (StringBuffer, "java/lang/StringBuffer");
#undef JNI_CLASS_MEMBERS
#define JNI_CLASS_MEMBERS(METHOD, STATICMETHOD, FIEL... |
#define JNI_CLASS_MEMBERS(METHOD, STATICMETHOD, FIELD, STATICFIELD) \
METHOD (constructor, "<init>", "()V") \
METHOD (toString, "toString", "()Ljava/lang/String;") \
DECLARE_JNI_CLASS (StringBuffer, "java/lang/StringBuffer");
#undef JNI_CLASS_MEMBERS
#define JNI_CLASS_MEMBERS(METHOD, STATICMETHOD, FIEL... |
LocalRef<jobject> responseHeaderBuffer (env->NewObject (StringBuffer, StringBuffer.constructor));
stream = GlobalRef (env->CallStaticObjectMethod (JuceAppActivity,
JuceAppActivity.createHTTPStream,
... | if (postData.getSize() > 0)
{
postDataArray = env->NewByteArray (postData.getSize());
env->SetByteArrayRegion (postDataArray, 0, postData.getSize(), (const jbyte*) postData.getData());
} | if_condition | [
{
"content": "class KarplusString : public UnitGenerator, public Scalable, public Phased {\n\n\n\npublic:\n\n\tKarplusString();\n\n\tKarplusString(float frequency);\n\n\tvoid setFrequency(float frequency);\n\n\tvoid trigger();\t\t\t\t\t///< reset internal buffers to re-pluck the string.\n\n\tvoid dump();\t\t\t\... |
C++ | curves/include/curves/PolynomialSpline.hpp | leggedrobotics/curves | 696db3e9ecf67c143e7b48a8dd53d2c5ea1ba2fe |
#pragma once
#include <Eigen/Core>
#include "curves/polynomial_splines_traits.hpp"
#include <numeric>
namespace curves {
template <int splineOrder_>
class PolynomialSpline {
public:
static constexpr unsigned int splineOrder = splineOrder_;
static constexpr unsigned int coefficientCount = splineOrder + 1;
... |
#pragma once
#include <Eigen/Core>
#include "curves/polynomial_splines_traits.hpp"
#include <numeric>
namespace curves {
template <int splineOrder_>
class PolynomialSpline {
public:
static constexpr unsigned int splineOrder = splineOrder_;
static constexpr unsigned int coefficientCount = splineOrder + 1;
... |
static inline void getDDTimeVectorAtZero(Eigen::Ref<EigenTimeVectorType> ddtimeVec) {
ddtimeVec = Eigen::Map<const EigenTimeVectorType>((SplineImplementation::ddtauZero).data());
}
template<typename Derived>
static inline void getDDiffTimeVectorAtZero(
Eigen::MatrixBase<Derived> const & ddtime... | Derived>
static inline void getTimeVector(Eigen::MatrixBase<Derived> const & timeVec, const double tk) {
assert(timeVec.rows() == EigenTimeVectorType::RowsAtCompileTime &&
timeVec.cols() == EigenTimeVectorType::ColsAtCompileTime);
const_cast<Eigen::MatrixBase<Derived>&>(timeVec) =
Eig... | random | [
{
"content": "class LocalSupport2CoefficientManagerTest : public ::testing::Test {\n\n protected:\n\n\n\n typedef Eigen::Matrix<double,3,1> Coefficient;\n\n typedef LocalSupport2CoefficientManager<Coefficient>::CoefficientIter CoefficientIter;\n\n\n\n virtual void SetUp() {\n\n N = 50;\n\n for(size_t i... |
C++ | DigitalHaze-Libraries/cpp/DH_BitParser.cpp | Phytress/DigitalHaze-Libraries | a94a292da302da23851cc780cfec9d4736dcf9c4 |
#include "DH_BitParser.hpp"
namespace DigitalHaze {
BitParser::BitParser(void* buffer, size_t lenInBits) noexcept
: dataPtr((unsigned char*) buffer), lengthInBits(lenInBits), startBitPos(0) {
}
BitParser::BitParser(const BitParser& other) noexcept
: dataPtr(other.dataPtr), lengthInBits(other.lengthInBits), st... |
#include "DH_BitParser.hpp"
namespace DigitalHaze {
BitParser::BitParser(void* buffer, size_t lenInBits) noexcept
: dataPtr((unsigned char*) buffer), lengthInBits(lenInBits), startBitPos(0) {
}
BitParser::BitParser(const BitParser& other) noexcept
: dataPtr(other.dataPtr), lengthInBits(other.lengthInBits), st... | or::operator!=(BitBufferIterator& rhs) const {
return pos != rhs.pos;
}
SingleBitDescriptor BitBufferIterator::operator*() const {
return (*bbPtr)[pos];
}
BitBufferIterator& BitBufferIterator::operator++() {
pos++;
return *this;
}
} | s == rhs;
}
bool SingleBitDescriptor::operator!=(bool rhs) const {
return !(*this == rhs);
}
SingleBitDescriptor::operator int() const {
return !!(*bytePtr & (1 << bitPos));
}
SingleBitDescriptor::operator bool() const {
return !!(*bytePtr & (1 << bitPos));
}
BitBufferIterator BitParser::begin() const... | random | [
{
"content": "\tclass BitBufferIterator {\n\n\tpublic:\n\n\t\tBitBufferIterator(const BitParser* bptr, size_t bpos) noexcept;\n\n\n\n\t\tbool operator!=(BitBufferIterator& other) const;\n\n\t\tSingleBitDescriptor operator*() const;\n\n\t\tBitBufferIterator& operator++();\n\n\tprivate:\n\n\t\tsize_t pos;\n\n\t\t... |
C++ | qt-creator-opensource-src-4.6.1/src/plugins/qmldesigner/designercore/metainfo/itemlibraryinfo.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f |
#include "itemlibraryinfo.h"
#include "nodemetainfo.h"
#include <QSharedData>
#include <utils/fileutils.h>
namespace QmlDesigner {
namespace Internal {
class ItemLibraryEntryData : public QSharedData
{
public:
ItemLibraryEntryData() : majorVersion(-1), minorVersion(-1)
{ }
QString name;
TypeName ... |
#include "itemlibraryinfo.h"
#include "nodemetainfo.h"
#include <QSharedData>
#include <utils/fileutils.h>
namespace QmlDesigner {
namespace Internal {
class ItemLibraryEntryData : public QSharedData
{
public:
ItemLibraryEntryData() : majorVersion(-1), minorVersion(-1)
{ }
QString name;
TypeName ... |
QDataStream& operator>>(QDataStream& stream, ItemLibraryEntry &itemLibraryEntry)
{
stream >> itemLibraryEntry.m_data->name;
stream >> itemLibraryEntry.m_data->typeName;
stream >> itemLibraryEntry.m_data->majorVersion;
stream >> itemLibraryEntry.m_data->minorVersion;
stream >> itemLibraryEntry.m_da... | QDataStream& operator<<(QDataStream& stream, const ItemLibraryEntry &itemLibraryEntry)
{
stream << itemLibraryEntry.name();
stream << itemLibraryEntry.typeName();
stream << itemLibraryEntry.majorVersion();
stream << itemLibraryEntry.minorVersion();
stream << itemLibraryEntry.typeIcon();
stream <... | function_block-full_function | [] |
C++ | code_reading/oceanbase-master/src/sql/optimizer/ob_log_table_lookup.cpp | wangcy6/weekly_read | 3a8837ee9cd957787ee1785e4066dd623e02e13a |
#define USING_LOG_PREFIX SQL_OPT
#include "sql/optimizer/ob_log_table_lookup.h"
#include "sql/optimizer/ob_log_table_scan.h"
#include "sql/optimizer/ob_log_plan.h"
using namespace oceanbase::share;
namespace oceanbase {
namespace sql {
int ObLogTableLookup::copy_without_child(ObLogicalOperator*& out)
{
int ret = ... |
#define USING_LOG_PREFIX SQL_OPT
#include "sql/optimizer/ob_log_table_lookup.h"
#include "sql/optimizer/ob_log_table_scan.h"
#include "sql/optimizer/ob_log_plan.h"
using namespace oceanbase::share;
namespace oceanbase {
namespace sql {
int ObLogTableLookup::copy_without_child(ObLogicalOperator*& out)
{
int ret = ... |
bool is_basic = false;
ObLogicalOperator* child = NULL;
ObExchangeInfo exch_info;
if (OB_ISNULL(ctx) || OB_ISNULL(child = get_child(first_child))) {
ret = OB_ERR_UNEXPECTED;
LOG_WARN("get unexpected null", K(ctx), K(child), K(ret));
} else if (OB_FAIL(compute_basic_sharding_info(ctx, is_basic))) {
... | rn ret;
}
int ObLogTableLookup::transmit_op_ordering()
{
int ret = OB_SUCCESS;
reset_op_ordering();
reset_local_ordering();
return ret;
}
int ObLogTableLookup::allocate_expr_post(ObAllocExprContext& ctx)
{
int ret = OB_SUCCESS;
if (OB_ISNULL(index_back_scan_)) {
ret = OB_INVALID_ARGUMENT;
LOG_WARN... | random | [] |
C++ | Servable/DlibServable/test/TestDlibServable.cpp | bzcheeseman/BatchingRPCServer | d1130720fef6e15e129fa59cc37235537f609e36 |
#include <dlib/data_io.h>
#include <sstream>
#include "BatchingRPC.pb.h"
#include "DlibServable.hpp"
#include "gtest/gtest.h"
namespace {
using namespace dlib;
using net_type = loss_multiclass_log<fc<
10,
relu<fc<
84,
relu<fc<
120,
max_pool<2, 2, 2, 2,
... |
#include <dlib/data_io.h>
#include <sstream>
#include "BatchingRPC.pb.h"
#include "DlibServable.hpp"
#include "gtest/gtest.h"
namespace {
using namespace dlib;
using net_type = loss_multiclass_log<fc<
10,
relu<fc<
84,
relu<fc<
120,
max_pool<2, 2, 2, 2,
... |
}
| TEST_F(TestDlibServable, NextBatch) {
Serving::DlibServable<net_type, matrix<unsigned char>, unsigned long>
servable(3);
servable.Bind(raw_args);
Serving::TensorMessage msg = ToMessage({input_[0], input_[1]});
msg.set_client_id("too_big");
Serving::ReturnCodes r = servable.AddToBatch(msg);
EXPECT_EQ... | function_block-full_function | [
{
"content": "class DlibServable : public Servable {\n\npublic:\n\n DlibServable(const int &batch_size);\n\n ~DlibServable() override;\n\n\n\n ReturnCodes SetBatchSize(const int &new_size) override;\n\n\n\n ReturnCodes AddToBatch(const TensorMessage &message) override;\n\n\n\n ReturnCodes GetResult(const s... |
C++ | src/plugins/algorithms/lda.cpp | kmoham6/phylanx | 252fa5fbb84acaf6f999410e6823b9f8d6693213 |
#include <phylanx/config.hpp>
#include <phylanx/plugins/algorithms/lda.hpp>
#include <hpx/iostream.hpp>
#include <hpx/include/lcos.hpp>
#include <hpx/include/util.hpp>
#include <hpx/errors/throw_exception.hpp>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <memory>
#include <numeric>
#include <s... |
#include <phylanx/config.hpp>
#include <phylanx/plugins/algorithms/lda.hpp>
#include <hpx/iostream.hpp>
#include <hpx/include/lcos.hpp>
#include <hpx/include/util.hpp>
#include <hpx/errors/throw_exception.hpp>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <memory>
#include <numeric>
#include <s... | d_doc_mat') to represent a matrix"));
}
auto word_doc_mat = arg5.matrix();
using lda_trainer_t =
phylanx::execution_tree::primitives::lda_trainer_impl;
lda_trainer_t trainer(alpha, beta);
auto result = trainer(word_doc_mat, topics, iterations);
return prim... | st of two matrices:\n"
" [word_topic, document_topic] :\n"
"\n"
"word_topic: document-topic assignment matrix\n"
"document_topic: document-topic assignment matrix\n"
"\n"
)};
lda_trainer::lda_trainer(primitive_arguments_type && operands,
... | random | [
{
"content": " class matrix_column_iterator\n\n : public hpx::util::iterator_facade<matrix_column_iterator<T>,\n\n blaze::Column<T>, std::random_access_iterator_tag, blaze::Column<T>>\n\n {\n\n public:\n\n explicit matrix_column_iterator(T& t, const std::size_t index = 0)\n\n ... |
C++ | src/backend/gporca/libgpopt/src/search/CJobGroupOptimization.cpp | Viocalpan/gpdb | 3cf72f6cbed32cc5e5aeea645beeb4c82db9ac1a |
#include "gpopt/engine/CEngine.h"
#include "gpopt/search/CGroup.h"
#include "gpopt/search/CGroupExpression.h"
#include "gpopt/search/CGroupProxy.h"
#include "gpopt/search/CJobFactory.h"
#include "gpopt/search/CJobGroupImplementation.h"
#include "gpopt/search/CJobGroupOptimization.h"
#include "gpopt/search/CJobGroupEx... |
#include "gpopt/engine/CEngine.h"
#include "gpopt/search/CGroup.h"
#include "gpopt/search/CGroupExpression.h"
#include "gpopt/search/CGroupProxy.h"
#include "gpopt/search/CJobFactory.h"
#include "gpopt/search/CJobGroupImplementation.h"
#include "gpopt/search/CJobGroupOptimization.h"
#include "gpopt/search/CJobGroupEx... | ed;
CGroupExpression *pgexpr = PgexprFirstUnsched();
while (NULL != pgexpr)
{
if (psc->Peng()->FOptimizeChild(m_pgexprOrigin, pgexpr, m_poc,
EolCurrent()))
{
const ULONG ulOptRequests =
CPhysical::PopConvert(pgexpr->Pop())->UlOptRequests();
for (ULONG ul = 0; ul < ulOptRequests; u... | prOrigin = pgexprOrigin;
m_poc = m_pgroup->PocInsert(poc);
if (poc == m_poc)
{
m_poc->AddRef();
}
SetJobQueue(m_poc->PjqOptimization());
m_eolCurrent = EolLow;
CJob::SetInit();
}
BOOL
CJobGroupOptimization::FScheduleGroupExpressions(CSchedulerContext *psc)
{
CGroupExpression *pgexprLast = m_pgexprLast... | random | [] |
C++ | modules/remote_bitrate_estimator/mimd_rate_control.cc | yuxw75/temp | ab2fd478821e6c98ff10f2976ce43f617250cff6 |
#include "webrtc/modules/remote_bitrate_estimator/mimd_rate_control.h"
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
namespace webrtc {
const int64_t kDefaultRttMs = 200;
const int64_t kLogIntervalMs = 1000;
MimdRateControl::MimdRateControl(uint32_t min_bitrate_bps)
: min_configu... |
#include "webrtc/modules/remote_bitrate_estimator/mimd_rate_control.h"
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
namespace webrtc {
const int64_t kDefaultRttMs = 200;
const int64_t kLogIntervalMs = 1000;
MimdRateControl::MimdRateControl(uint32_t min_bitrate_bps)
: min_configu... | );
const int bitrate_difference = LatestEstimate() - incoming_bitrate_bps;
return bitrate_difference > threshold;
}
return false;
}
uint32_t MimdRateControl::LatestEstimate() const {
return current_bit_rate_;
}
uint32_t MimdRateControl::UpdateBandwidthEstimate(int64_t now_ms) {
current_bit_rate_ = Cha... | uint32_t incoming_bitrate_bps) const {
const int64_t bitrate_reduction_interval =
std::max<int64_t>(std::min<int64_t>(rtt_, 200), 10);
if (time_now - last_bit_rate_change_ >= bitrate_reduction_interval) {
return true;
}
if (ValidEstimate()) {
const int threshold = static_cast<int>(1... | function_block-random_span | [
{
"content": "namespace webrtc {\n\n\n\n// Supported video types.\n\nenum VideoType {\n\n kUnknown,\n\n kI420,\n\n kIYUV,\n\n kRGB24,\n\n kABGR,\n\n kARGB,\n\n kARGB4444,\n\n kRGB565,\n\n kARGB1555,\n\n kYUY2,\n\n kYV12,\n\n kUYVY,\n\n kMJPG,\n\n kNV21,\n\n kNV12,\n\n kBGRA,\n\n};\n\n\n\n// This... |
C++ | src/hir/path.cpp | nabijaczleweli/mrustc | c3565612a003fbc2f87aa55250fe3f5218cb99aa |
#include <hir/path.hpp>
#include <hir/type.hpp>
::HIR::SimplePath HIR::SimplePath::operator+(const RcString& s) const
{
::HIR::SimplePath ret(m_crate_name);
ret.m_components = m_components;
ret.m_components.push_back( s );
return ret;
}
namespace HIR {
::std::ostream& operator<<(::std::ostream& ... |
#include <hir/path.hpp>
#include <hir/type.hpp>
::HIR::SimplePath HIR::SimplePath::operator+(const RcString& s) const
{
::HIR::SimplePath ret(m_crate_name);
ret.m_components = m_components;
ret.m_components.push_back( s );
return ret;
}
namespace HIR {
::std::ostream& operator<<(::std::ostream& ... |
}
throw "";
}
Ordering HIR::Path::ord(const ::HIR::Path& x) const
{
ORD( (unsigned)m_data.tag(), (unsigned)x.m_data.tag() );
TU_MATCH(::HIR::Path::Data, (this->m_data, x.m_data), (tpe, xpe),
(Generic,
return ::ord(tpe, xpe);
),
(UfcsInherent,
ORD(tpe.type, xpe.type);
... | n Compare::Unequal;
::HIR::Compare rv = ::HIR::Compare::Equal;
CMP(rv, ple.type.compare_with_placeholders(sp, pre.type, resolve_placeholder));
CMP(rv, ::compare_with_placeholders(sp, ple.trait, pre.trait, resolve_placeholder));
CMP(rv, ::compare_with_placeholders(sp, ple.params, pre.pa... | function_block-function_prefixed | [] |
C++ | analysis/EnergyDepVSIntialEnergy.cpp | suerfu/TesseractSim | 406a469f864726386afc2df7133f07df625cd4b9 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <fstream>
#include <functional>
#include <map>
#include <stdlib.h>
#include "TSystem.h"
#include "TCanvas.h"
#include "TH1.h"
#include "TRint.h"
#include "TStyle.h"
#include "THStack.h"
#include "TTreeReader.h"
#include "TTreeReaderVa... |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <fstream>
#include <functional>
#include <map>
#include <stdlib.h>
#include "TSystem.h"
#include "TCanvas.h"
#include "TH1.h"
#include "TRint.h"
#include "TStyle.h"
#include "THStack.h"
#include "TTreeReader.h"
#include "TTreeReaderVa... | pt + 1 == optionNum)
return strTo<T>(*itr);
}
else
{
std::string pos = "nth";
if(iOpt == 0) pos = "1st";
else if(iOpt == 1) pos = "2nd";
else if(iOpt == 2) pos = "3rd";
else pos = std::to_string(iOpt + 1) + "th";
... | tion, int optionNum = 1)
{
if(!CmdOptionExists(argc, argv, option))
{
abort();
}
char** begin = argv;
char** end = argv + argc;
char ** itr = std::find(begin, end, option);
for(int iOpt = 0; iOpt < optionNum; ++iOpt)
{
if(itr != end && ++itr != end && ((*itr)[... | function_block-random_span | [] |
C++ | include/lsFromMesh.hpp | YourKarma42/ViennaLS | aae39a860e1fb6edc2d3568ab09110f7e81572b1 | #ifndef LS_FROM_MESH_HPP
#define LS_FROM_MESH_HPP
#include <lsPreCompileMacros.hpp>
#include <lsDomain.hpp>
#include <lsMesh.hpp>
template <class T, int D> class lsFromMesh {
typedef typename lsDomain<T, D>::DomainType hrleDomainType;
lsSmartPointer<lsDomain<T, D>> levelSet = nullptr;
lsSmartPointer<lsMesh<T>... | #ifndef LS_FROM_MESH_HPP
#define LS_FROM_MESH_HPP
#include <lsPreCompileMacros.hpp>
#include <lsDomain.hpp>
#include <lsMesh.hpp>
template <class T, int D> class lsFromMesh {
typedef typename lsDomain<T, D>::DomainType hrleDomainType;
lsSmartPointer<lsDomain<T, D>> levelSet = nullptr;
lsSmartPointer<lsMesh<T>... | for (unsigned i = 0; i < D; ++i) {
nextIndex[i] = std::round(pointDataIt->at(i) / gridDelta);
}
}
for (int q = 0; q < D; q++) {
hrleVectorType<hrleIndexType, D> tmp = currentIndex;
tmp[q]++;
if (tmp[q] > grid.getMaxGridPoint(q))
... | if (changeSign) {
signs[i] = *valueIt <= -std::numeric_limits<T>::epsilon();
lastIndex[i] = currentIndex[i];
}
}
}
}
hrleVectorType<hrleIndexType, D> nextIndex;
++pointDataIt;
++valueIt;
if (pointDataIt == pointD... | random | [
{
"content": "// implement own velocity field\n\nclass velocityField : public lsVelocityField<double> {\n\npublic:\n\n double getScalarVelocity(const std::array<double, 3> & /*coordinate*/,\n\n int /*material*/,\n\n const std::array<double, 3> & /*normalVecto... |
C++ | qt/QtXdagWallet/pwddialog.cpp | sgaragagghu/QtXdagWallet | 850fac4c6714edde4d91e58a8ca5a2d4602b9937 | #include "PwdDialog.h"
#include "ui_pwddialog.h"
#include <QKeyEvent>
PwdDialog::PwdDialog(QWidget *parent, PWD_DLG_TYPE type) :
QDialog(parent),
mDlgType(type),
ui(new Ui::PwdDialog)
{
ui->setupUi(this);
m_pLable = new QLabel;
m_pLEPwd = new PwdLineEdit;
m_pPBOK = new QPushButton(tr("OK"... | #include "PwdDialog.h"
#include "ui_pwddialog.h"
#include <QKeyEvent>
PwdDialog::PwdDialog(QWidget *parent, PWD_DLG_TYPE type) :
QDialog(parent),
mDlgType(type),
ui(new Ui::PwdDialog)
{
ui->setupUi(this);
m_pLable = new QLabel;
m_pLEPwd = new PwdLineEdit;
m_pPBOK = new QPushButton(tr("OK"... |
void PwdDialog::keyPressEvent(QKeyEvent *event)
{
switch (event->key())
{
case Qt::Key_Tab:
case Qt::Key_Left:
case Qt::Key_Right:
case Qt::Key_Up:
case Qt::Key_Down:
break;
default:
QDialog::keyPressEvent(event);
}
}
| if(pKeyEvent->matches(QKeySequence::SelectAll)
|| pKeyEvent->matches(QKeySequence::Copy)
|| pKeyEvent->matches(QKeySequence::Paste))
{
return true;
}
if(pKeyEvent->key() == Qt::Key_Tab ||
... | function_block-function_prefix_line | [
{
"content": "#define OBJ_id_it_encKeyPairTypes OBJ_id_it,3L\n\n\n",
"file_path": "qt/QtXdagWallet/win64_dependency/include/openssl/obj_mac.h",
"rank": 0,
"score": 156120.08268075265
},
{
"content": "#define OBJ_id_it_signKeyPairTypes OBJ_id_it,2L\n\n\n",
"file... |
C++ | extlib/include/xyginext/ecs/systems/DynamicTreeSystem.hpp | fallahn/speljongen | 57cb5e09eec7db8c21ee7b3e7943fa0a76738c51 |
#pragma once
#include "xyginext/ecs/System.hpp"
#include <SFML/Graphics/Rect.hpp>
#include <vector>
#include <limits>
#include <cstdint>
#include <array>
namespace xy
{
struct TreeNode final
{
static constexpr std::int32_t Null = -1;
bool isLeaf() const
{
return ch... |
#pragma once
#include "xyginext/ecs/System.hpp"
#include <SFML/Graphics/Rect.hpp>
#include <vector>
#include <limits>
#include <cstdint>
#include <array>
namespace xy
{
struct TreeNode final
{
static constexpr std::int32_t Null = -1;
bool isLeaf() const
{
return ch... | : public xy::System
{
public:
explicit DynamicTreeSystem(xy::MessageBus&);
void process(float) override;
void onEntityAdded(xy::Entity) override;
void onEntityRemoved(xy::Entity) override;
std::vector<xy::Entity> query(sf::FloatRect area, std::uint64_t filter =... | std::int32_t next;
};
std::int32_t childA = Null;
std::int32_t childB = Null;
std::int32_t height = Null;
};
class XY_EXPORT_API DynamicTreeSystem final | random | [] |
C++ | src/platform/shm_win.cpp | nickhuangxinyu/cpp-ipc | 64f4104b741b6f283906d01177d4e70bcdb8d6a0 | #include "shm.h"
#include <Windows.h>
#include <string>
#include <utility>
#include "def.h"
#include "log.h"
#include "pool_alloc.h"
#include "platform/to_tchar.h"
#include "platform/get_sa.h"
#include "memory/resource.h"
namespace {
struct id_info_t {
HANDLE h_ = NULL;
void* ... | #include "shm.h"
#include <Windows.h>
#include <string>
#include <utility>
#include "def.h"
#include "log.h"
#include "pool_alloc.h"
#include "platform/to_tchar.h"
#include "platform/get_sa.h"
#include "memory/resource.h"
namespace {
struct id_info_t {
HANDLE h_ = NULL;
void* ... |
void release(id_t id) {
if (id == nullptr) {
ipc::error("fail release: invalid id (null)\n");
return;
}
auto ii = static_cast<id_info_t*>(id);
if (ii->mem_ == nullptr || ii->size_ == 0) {
ipc::error("fail release: invalid id (mem = %p, size = %zd)\n", ii->mem_, ii->siz... | ii->mem_ = mem;
ii->size_ = static_cast<std::size_t>(mem_info.RegionSize);
if (size != nullptr) *size = ii->size_;
return static_cast<void *>(mem);
} | function_block-function_prefix_line | [
{
"content": "// A builtin parameterized test name generator which returns the result of\n\n// testing::PrintToString.\n\nstruct PrintToStringParamName {\n\n template <class ParamType>\n\n std::string operator()(const TestParamInfo<ParamType>& info) const {\n\n return PrintToString(info.param);\n\n }\n\n}... |
C++ | test/api/union/hyperloglog_test.cpp | Felix-Droop/Chopper | 5cc214103b2d088ae400bec0fde8973e03dd3095 | #include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <unordered_set>
#include <vector>
#include <fstream>
#include <iostream>
#include <chopper/union/hyperloglog.hpp>
#include <seqan3/io/sequence_file/input.hpp>
#include <seqan3/test/tmp_filename.hpp>
struct input_traits : public seqan3::sequence_file_input_de... | #include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <unordered_set>
#include <vector>
#include <fstream>
#include <iostream>
#include <chopper/union/hyperloglog.hpp>
#include <seqan3/io/sequence_file/input.hpp>
#include <seqan3/test/tmp_filename.hpp>
struct input_traits : public seqan3::sequence_file_input_de... |
TEST(hyperloglog_test, merge_and_merge_SIMD)
{
std::string input_file = DATADIR"small.fa";
size_t const k = 16;
size_t const b = 5;
size_t const m = 1 << b;
hyperloglog full_sketch(b);
hyperloglog merge_sketch(b);
hyperloglog merge_SIMD_sketch(b);
std::vector<hyperloglog> partial_ske... | TEST(hyperloglog_test, add_and_estimate_large)
{
std::string input_file = DATADIR"small.fa";
size_t const k = 16;
size_t const b = 4;
size_t const m = 1 << b;
hyperloglog sketch(b);
std::unordered_set<std::string> control;
sequence_file_type seq_file{input_file};
for (auto && [s... | function_block-full_function | [
{
"content": "struct input_traits : public seqan3::sequence_file_input_default_traits_dna\n\n{\n\n using sequence_alphabet = seqan3::dna4;\n\n};\n\n\n\nint main(int argc, const char *argv [])\n\n{\n\n seqan3::argument_parser parser{\"measure_hyperloglog\", argc, argv,\n\n ... |
C++ | 02Segundo/Estructura_de_Datos_ED/PracticaFinal/src/prueba.cpp | elsudano/Facultad | 8ff2c5904f0a38a3a0682e040da4439f2bc872f2 | #include <fstream>
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <sstream>
#include "ArbolGeneral.h"
#include "Personas.h"
#include "QuitaComentarios.h"
#include "Preguntas.h"
using namespace std;
void imprime_arbol_con_formato(string nom, ArbolGeneral<int> &ab){
ArbolGeneral<int>::iter_preorde... | #include <fstream>
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <sstream>
#include "ArbolGeneral.h"
#include "Personas.h"
#include "QuitaComentarios.h"
#include "Preguntas.h"
using namespace std;
void imprime_arbol_con_formato(string nom, ArbolGeneral<int> &ab){
ArbolGeneral<int>::iter_preorde... | ut << "Voy a poner el AB3 como subarbol de AB1 en el nodo 10 (cuando NO tiene hijos)" << endl;
it_tree = ab1.begin();
for (; (*it_tree) != 10; ++it_tree);
cout << "Encuentro el nodo: " << (*it_tree) << endl;
ab1.asignar_subarbol(ab3, it_tree.GetNodo());
cout << "Arbol AB1 despúes de asignar sub... | function_block-function_prefixed | [] | |
C++ | HybridRenderer/HybridRenderer/Camera.cpp | lbondi7/HybridRenderer | 592ff5c4ea9039bc79a99e20c848f11e2669f885 | #include "Camera.h"
#include "Initilizers.h"
#include "ImGUI_.h"
#include <algorithm>
Camera::~Camera()
{
}
void Camera::init(DeviceContext* deviceContext, const VkExtent2D& _extent)
{
viewport = { 0, 0, 1, 1 };
scissor = { 0, 0, 1, 1 };
vkViewport = Initialisers::viewport(viewport.x, viewport.y, static_cast<... | #include "Camera.h"
#include "Initilizers.h"
#include "ImGUI_.h"
#include <algorithm>
Camera::~Camera()
{
}
void Camera::init(DeviceContext* deviceContext, const VkExtent2D& _extent)
{
viewport = { 0, 0, 1, 1 };
scissor = { 0, 0, 1, 1 };
vkViewport = Initialisers::viewport(viewport.x, viewport.y, static_cast<... |
void Camera::updateWindow(float _windowWidth, float _windowHeight) {
}
void Camera::ResetPan() {
currentIndex = 0;
pan = true;
time = 0.0f;
} | extent) {
prevTransform = transform;
prevLookAt == lookAt;
prevUp = worldUp;
prevFOV = FOV;
prevNearPlane = nearPlane;
prevFarPlane = farPlane;
extent = _extent;
prevLookAtPlace = lookAtPlace;
prevViewport = viewport;
prevScissor = scissor;
} | function_block-function_prefixed | [
{
"content": "struct Transform {\n\n\n\n\tglm::vec3 position = glm::vec3(0);\n\n\tglm::vec3 rotation = glm::vec3(0);\n\n\tglm::vec3 scale = glm::vec3(1);\n\n\n\n\tglm::vec3 right = glm::vec3(1, 0, 0);\n\n\tglm::vec3 up = glm::vec3(0, 1, 0);\n\n\tglm::vec3 forward = glm::vec3(0, 0, 1);\n\n\n\n\n\n\tbool operator... |
C++ | samples/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.IOrderedDictionary_Implementation/cpp/remarks.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 |
#using <System.dll>
using namespace System;
using namespace System::Collections;
using namespace System::Collections::Specialized;
public ref class ODEnum : IDictionaryEnumerator
{
private:
int position;
ArrayList^ itemlist;
public:
ODEnum(ArrayList^ list)
{
this->R... |
#using <System.dll>
using namespace System;
using namespace System::Collections;
using namespace System::Collections::Specialized;
public ref class ODEnum : IDictionaryEnumerator
{
private:
int position;
ArrayList^ itemlist;
public:
ODEnum(ArrayList^ list)
{
this->R... |
virtual property Object^ SyncRoot
{
Object^ get()
{
return itemlist->SyncRoot;
}
}
virtual IEnumerator^ IfcGetEnumerator() = IEnumerable::GetEnumerator
{
return (IEnumerator^) gcnew ODEnum(itemlist);
}
};
class App
{
public... | virtual property bool IsSynchronized
{
bool get()
{
return itemlist->IsSynchronized;
}
} | function_block-function_prefix_line | [] |
C++ | tutorial/lesson_15_generators.cpp | pelikan/Halide | 5b4eac0f810dbd8dc8d224cb322d5b1215ea224d |
#include "Halide.h"
#include <stdio.h>
using namespace Halide;
class MyFirstGenerator : public Halide::Generator<MyFirstGenerator> {
public:
Input<uint8_t> offset{"offset"};
Input<Buffer<uint8_t>> input{"input", 2};
Output<Buffer<uint8_t>> brighter{"brighter", 2};
Var... |
#include "Halide.h"
#include <stdio.h>
using namespace Halide;
class MyFirstGenerator : public Halide::Generator<MyFirstGenerator> {
public:
Input<uint8_t> offset{"offset"};
Input<Buffer<uint8_t>> input{"input", 2};
Output<Buffer<uint8_t>> brighter{"brighter", 2};
Var... |
};
HALIDE_REGISTER_GENERATOR(MyFirstGenerator, my_first_generator)
class MySecondGenerator : public Halide::Generator<MySecondGenerator> {
public:
GeneratorParam<bool> parallel{"parallel", true};
GeneratorParam<float> scale{"scale",
1.0f ,
... | void generate() {
brighter(x, y) = input(x, y) + offset;
brighter.vectorize(x, 16).parallel(y);
} | function_block-full_function | [
{
"content": "class ExprUsesVars : public IRGraphVisitor {\n\n using IRGraphVisitor::visit;\n\n\n\n const Scope<T> &vars;\n\n Scope<Expr> scope;\n\n\n\n void include(const Expr &e) override {\n\n if (result) return;\n\n IRGraphVisitor::include(e);\n\n }\n\n\n\n void include(const... |
C++ | tests/rwops/customRWops/main.cpp | jamesl-github/scc | c1dddf41778eeb2ef2a910372d1eb6a6a8dfa68e |
#include <iostream>
#include <sstream>
#include <string>
#include <ios>
#include <SDL.h>
#include "rwops.hpp"
const int ERR_SDL_INIT = -1;
const int BUFFER_SIZE = 4;
const int CHAR_SKIP = 2;
bool init(Uint32 sdlInitFlags)
{
if(SDL_Init(sdlInitFlags) < 0) {
return false;
}
return true;
}
void quit()
{
SDL_Qu... |
#include <iostream>
#include <sstream>
#include <string>
#include <ios>
#include <SDL.h>
#include "rwops.hpp"
const int ERR_SDL_INIT = -1;
const int BUFFER_SIZE = 4;
const int CHAR_SKIP = 2;
bool init(Uint32 sdlInitFlags)
{
if(SDL_Init(sdlInitFlags) < 0) {
return false;
}
return true;
}
void quit()
{
SDL_Qu... | FER_SIZE, RW_SEEK_END);
custom.read(buffer, sizeof(char), BUFFER_SIZE);
std::cout << BUFFER_SIZE << " last characters: ";
std::cout.write(buffer, BUFFER_SIZE);
std::cout << std::endl;
custom.seek(0, RW_SEEK_SET);
}
int main(int argc, char **argv)
{
Uint32 sdlFlags = SDL_INIT_VIDEO;
if(!init(sdlFlags)) {
SDL... | std::endl;
custom.seek(0, RW_SEEK_SET);
custom.read(buffer, sizeof(char), BUFFER_SIZE);
std::cout << BUFFER_SIZE << " first characters: ";
std::cout.write(buffer, BUFFER_SIZE);
std::cout << std::endl;
custom.seek(CHAR_SKIP, RW_SEEK_CUR);
custom.read(buffer, sizeof(char), BUFFER_SIZE);
std::cout << BUFFER_SIZ... | random | [
{
"content": "\tstd::cout << \"byte 0x\" << std::setbase(16)\n\n\t\t<< (static_cast<int>(c) & 0xff) << std::setbase(10)\n\n\t\t<< \" at position \" << pos << std::endl;\n\n\tconstMem.seek(0, RW_SEEK_SET);\n\n}\n\n\n\nvoid test()\n\n{\n\n\tSDL::RWops constMem(memory, sizeof(memory));\n\n\n\n\t// read. Positions ... |
C++ | xdl/ps-plus/ps-plus/common/test/hashmap_test.cc | Ru-Xiang/x-deeplearning | 04cc0497150920c64b06bb8c314ef89977a3427a | #include <iostream>
#include "gtest/gtest.h"
#include "ps-plus/common/hashmap.h"
#include "ps-plus/common/thread_pool.h"
using ps::Hash128Key;
using ps::HashMap;
using ps::Range;
using ps::Status;
using std::vector;
TEST(HashMap64Test, Get) {
std::unique_ptr<HashMap> hashmap(new ps::HashMapImpl<int64_t>(1));
in... | #include <iostream>
#include "gtest/gtest.h"
#include "ps-plus/common/hashmap.h"
#include "ps-plus/common/thread_pool.h"
using ps::Hash128Key;
using ps::HashMap;
using ps::Range;
using ps::Status;
using std::vector;
TEST(HashMap64Test, Get) {
std::unique_ptr<HashMap> hashmap(new ps::HashMapImpl<int64_t>(1));
in... | ;
EXPECT_EQ(49995000, total);
auto end = std::chrono::system_clock::now();
std::cout << "insert " << key_count/2 << " keys, takes " << (end-start).count()/1000000 << "ms" <<std::endl;
delete [] keys;
}
| ps::MultiThreadDoTBB(thread_count, [&](const Range& r) {
for (size_t i = r.begin; i < r.end; i++) {
vector<size_t> ids;
tbb::concurrent_vector<size_t> reused_ids;
size_t filtered;
hashmap->Get(keys + i* key_count/thread_count, key_count/2/thread_count, false, 1.0, &ids, &... | call_expression | [] |
C++ | Mesh.cpp | nvpro-samples/gl_vk_chopper | e7ffdd0b0277843fc14af7ba110538089efb459e |
#include "Mesh.h"
#include <stdlib.h>
Mesh::Mesh()
: m_vertices(NULL)
, m_indices(NULL)
, m_normals(NULL)
, m_max_vertices(0)
, m_max_indices(0)
, m_vertex_count(0)
, m_index_count(0)
, m_material_id(-1)
{
}
Mesh::Mesh(const Mesh::ID& inID)
: m_id(inID)
, m_vertices(NULL)
... |
#include "Mesh.h"
#include <stdlib.h>
Mesh::Mesh()
: m_vertices(NULL)
, m_indices(NULL)
, m_normals(NULL)
, m_max_vertices(0)
, m_max_indices(0)
, m_vertex_count(0)
, m_index_count(0)
, m_material_id(-1)
{
}
Mesh::Mesh(const Mesh::ID& inID)
: m_id(inID)
, m_vertices(NULL)
... |
Vec4f*& Mesh::getVertices()
{
return m_vertices;
}
Vec4f*& Mesh::getNormals()
{
return m_normals;
}
uint32_t*& Mesh::getIndices()
{
return m_indices;
}
Vec2f*& Mesh::getUVs()
{
return m_uvs;
}
void Mesh::addVertex(const Vec4f& inVertex)
{
Vec4f normal = {0.0, 0.0, 0.0, 1.0};
addVertex(inVertex, normal... | new Vec4f[m_max_vertices];
m_normals = new Vec4f[m_max_vertices];
m_indices = new uint32_t[m_max_indices];
m_uvs = new Vec2f[m_max_vertices];
} | function_block-function_prefixed | [
{
"content": "class VkeIBO : public VkeBuffer<uint32_t>\n\n{\n\npublic:\n\n VkeIBO();\n\n ~VkeIBO();\n\n\n\n void bind(VkCommandBuffer* inCmd);\n\n};\n\n\n\n#endif",
"file_path": "VkeIBO.h",
"rank": 0,
"score": 14104.936708526924
},
{
"content": "\n\n#include \"VKSFile.h\"\n\n#include \"n... |
C++ | src/carnot/end_to_end_join_test.cc | hangqiu/pixie | 1dd4af47d40ff856c4d52a1d6de81f78a76ff31e |
#include <google/protobuf/text_format.h>
#include <algorithm>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
#include <pypa/parser/parser.hh>
#include "src/carnot/carnot.h"
#include "src/carnot/exec/local_grpc_result_server.h"
#include "src/carnot/exec/test_utils.h"
#include "src/carnot... |
#include <google/protobuf/text_format.h>
#include <algorithm>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
#include <pypa/parser/parser.hh>
#include "src/carnot/carnot.h"
#include "src/carnot/exec/local_grpc_result_server.h"
#include "src/carnot/exec/test_utils.h"
#include "src/carnot... |
auto query = absl::StrJoin({queryString}, "\n");
auto query_id = sole::uuid4();
auto s = carnot_->ExecuteQuery(query, query_id, 0);
ASSERT_OK(s);
auto exec_stats = result_server_->exec_stats().ConsumeValueOrDie();
EXPECT_EQ(5, exec_stats.execution_stats().records_processed());
EXPECT_EQ(5 * sizeof(d... | 1, 5.1};
std::vector<types::Int64Value> expected_col2 = {1, 2, 3, 5, 6};
EXPECT_TRUE(rb1.ColumnAt(0)->Equals(types::ToArrow(expected_col1, arrow::default_memory_pool())));
EXPECT_TRUE(rb1.ColumnAt(1)->Equals(types::ToArrow(expected_col2, arrow::default_memory_pool())));
}
TEST_F(JoinTest, self_join) {
std::str... | random | [
{
"content": "class SetupJoinTypeRule : public Rule {\n\n /**\n\n * @brief Converts a right join into a left join.\n\n *\n\n */\n\n public:\n\n SetupJoinTypeRule()\n\n : Rule(nullptr, /*use_topo*/ false, /*reverse_topological_execution*/ false) {}\n\n\n\n protected:\n\n StatusOr<bool> Apply(IRNode... |
C++ | GLAC/observables/latticeactionchargedensity.cpp | hmvege/GluonicLQCD | 9bb7466fce408bf51cb98d65f639acd37d034d62 | #include "latticeactionchargedensity.h"
#include <cmath>
#include "parallelization/communicator.h"
#include "config/parameters.h"
#include "io/fieldio.h"
LatticeActionChargeDensity::LatticeActionChargeDensity(const bool flow) : Correlator()
{
initializeObservableStorer(flow);
m_plaqMultiplicationFac... | #include "latticeactionchargedensity.h"
#include <cmath>
#include "parallelization/communicator.h"
#include "config/parameters.h"
#include "io/fieldio.h"
LatticeActionChargeDensity::LatticeActionChargeDensity(const bool flow) : Correlator()
{
initializeObservableStorer(flow);
m_plaqMultiplicationFac... |
void LatticeActionChargeDensity::copyObservable(const unsigned int iObs, const std::vector<double> &obs)
{
(*m_plaqObservable)[iObs] = obs[0];
(*m_topcObservable)[iObs] = obs[1];
(*m_energyObservable)[iObs] = obs[2];
}
std::vector<double> LatticeActionChargeDensity::getObservablesVector(const unsigned in... | nChargeDensity::printStatistics()
{
m_plaqObservable->printStatistics();
m_topcObservable->printStatistics();
m_energyObservable->printStatistics();
} | function_block-function_prefixed | [
{
"content": "class Flow\n\n{\n\nprivate:\n\n // Flow update step\n\n double m_epsilon = 0.02;\n\n // Lattice constants\n\n std::vector<unsigned int> m_N;\n\n unsigned long int m_subLatticeSize;\n\n // Temporary lattice to use when flowing\n\n Lattice<SU3> *m_tempLattice;\n\n Lattice<SU3... |
C++ | src/Cluster/ClusterMain.cpp | BBN-E/serif | 1e2662d82fb1c377ec3c79355a5a9b0644606cb4 |
#include "Generic/common/leak_detection.h"
#include "Generic/common/limits.h"
#include "Generic/common/ParamReader.h"
#include "Generic/common/UnrecoverableException.h"
#include "Generic/common/UTF8InputStream.h"
#include "Generic/common/UTF8OutputStream.h"
#include "Generic/common/UTF8Token.h"
#include... |
#include "Generic/common/leak_detection.h"
#include "Generic/common/limits.h"
#include "Generic/common/ParamReader.h"
#include "Generic/common/UnrecoverableException.h"
#include "Generic/common/UTF8InputStream.h"
#include "Generic/common/UTF8OutputStream.h"
#include "Generic/common/UTF8Token.h"
#include... |
char rare_words_file[500];
if (strcmp(output_rare_words, "true") == 0) {
if(!ParamReader::getParam("rare_words_file",rare_words_file, 500)){
throw UnexpectedInputException("Cluster::Main()", "Missing Parameter: rare-words-file");
}
}
char serif_style_cluster_output[10];
if(!ParamReader::g... | if(!ParamReader::getParam("output_rare_words",output_rare_words, 10)){
throw UnexpectedInputException(
"Cluster::Main()",
"Missing Parameter: output-rare-words");
} | if_condition | [
{
"content": "\tclass const_iterator: public boost::iterator_facade<const_iterator, std::vector<ActorMention_ptr> const, boost::forward_traversal_tag> {\n\n\tprivate:\n\n\t\tfriend class boost::iterator_core_access;\n\n\t\tfriend class ActorMentionSet;\n\n\t\texplicit const_iterator(ActorMentionMap::const_itera... |
C++ | src/bustools_extract.cpp | johan-gson/bustools | b0df3edef7e0df53d6461cd76572ae38280c4a94 | #include <iostream>
#include <fstream>
#include <zlib.h>
#include "kseq.h"
#include "Common.hpp"
#include "BUSData.h"
#include "bustools_extract.h"
KSEQ_INIT(gzFile, gzread);
inline bool open_fastqs(
std::vector<gzFile> &outFastq,
std::vector<gzFile> &inFastq,
std::vector<kseq_t *> &seq,
const Busto... | #include <iostream>
#include <fstream>
#include <zlib.h>
#include "kseq.h"
#include "Common.hpp"
#include "BUSData.h"
#include "bustools_extract.h"
KSEQ_INIT(gzFile, gzread);
inline bool open_fastqs(
std::vector<gzFile> &outFastq,
std::vector<gzFile> &inFastq,
std::vector<kseq_t *> &seq,
const Busto... | buf[bufLen++] = '\n';
if (gzwrite(outFastq[i], buf, bufLen) != bufLen) {
std::cerr << "Error writing to FASTQ" << std::endl;
goto end_extract;
}
}
}
}
std::cout << "Read in " << nr << " BUS records" << std::endl;
end_extract:
delete[] p;
delete[] buf;
for (auto... | function_block-function_prefix_line | [
{
"content": "enum SORT_TYPE : char {SORT_BC = 0, SORT_UMI, SORT_F, SORT_COUNT};\n",
"file_path": "src/Common.hpp",
"rank": 0,
"score": 97682.47177461298
},
{
"content": " function returns true and set element to the element of given rank.\n\n Otherwise, it returns false.\n\n ... | |
C++ | TAO/orbsvcs/Logging_Service/RTEvent_Logging_Service/RTEvent_Logging_Service.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 |
#include "orbsvcs/Log_Macros.h"
#include "RTEvent_Logging_Service.h"
#include "tao/IORTable/IORTable.h"
#include "ace/Get_Opt.h"
#include "ace/OS_NS_stdio.h"
#include "ace/OS_NS_unistd.h"
RTEvent_Logging_Service::RTEvent_Logging_Service (void)
: service_name_ ("RTEventLogFactory"),
ior_file_name_ (0),
pid_... |
#include "orbsvcs/Log_Macros.h"
#include "RTEvent_Logging_Service.h"
#include "tao/IORTable/IORTable.h"
#include "ace/Get_Opt.h"
#include "ace/OS_NS_stdio.h"
#include "ace/OS_NS_unistd.h"
RTEvent_Logging_Service::RTEvent_Logging_Service (void)
: service_name_ ("RTEventLogFactory"),
ior_file_name_ (0),
pid_... | void
RTEvent_Logging_Service::shutdown (void)
{
if (this->bind_to_naming_service_)
{
CosNaming::Name name (1);
name.length (1);
name[0].id = CORBA::string_dup (this->service_name_.c_str ());
this->naming_->unbind (name);
}
if (!CORBA::is_nil (this->orb_.in ()))
this->orb_->s... | function_block-full_function | [] | |
C++ | mediapipe/calculators/video/tracked_detection_manager_calculator.cc | nodamu/sign-langage-recogntion | 41a22d4f28cc94d6eb14d2c89456eba874c7f05b |
#include <memory>
#include <string>
#include <unordered_map>
#include <vector>
#include "absl/container/node_hash_map.h"
#include "mediapipe/framework/calculator_framework.h"
#include "mediapipe/framework/formats/detection.pb.h"
#include "mediapipe/framework/formats/location_data.pb.h"
#include "mediapipe/framework/... |
#include <memory>
#include <string>
#include <unordered_map>
#include <vector>
#include "absl/container/node_hash_map.h"
#include "mediapipe/framework/calculator_framework.h"
#include "mediapipe/framework/formats/detection.pb.h"
#include "mediapipe/framework/formats/location_data.pb.h"
#include "mediapipe/framework/... |
void TrackedDetectionManagerCalculator::AddDetections(
const std::vector<Detection>& detections, CalculatorContext* cc) {
for (const auto& detection : detections) {
std::unique_ptr<TrackedDetection> new_detection =
GetTrackedDetectionFromDetection(
detection, cc->InputTimestamp().Mi... | void TrackedDetectionManagerCalculator::AddDetectionList(
const DetectionList& detection_list, CalculatorContext* cc) {
for (const auto& detection : detection_list.detection()) {
std::unique_ptr<TrackedDetection> new_detection =
GetTrackedDetectionFromDetection(
detection, cc->InputTi... | function_block-full_function | [
{
"content": "class StringToIntCalculatorTemplate : public CalculatorBase {\n\n public:\n\n static ::mediapipe::Status GetContract(CalculatorContract* cc) {\n\n cc->InputSidePackets().Index(0).Set<std::string>();\n\n cc->OutputSidePackets().Index(0).Set<IntType>();\n\n return ::mediapipe::OkStatus();\... |
C++ | Examples/ReadWriteExample/ReadWriteExample.cpp | scaredyfish/MPCDI | 1ddbc9abf99d39d4464afa2005934c325443cf28 |
#include "mpcdiDisplay.h"
#include "mpcdiWriter.h"
#include "mpcdiReader.h"
#include "CreateSampleProfile.h"
#include "VerboseCompareProfile.h"
#include <iostream>
#include <algorithm>
#define DO_PAUSE
#ifdef DO_PAUSE
# define PAUSE {std::cout<< "Press enter to continue....";std::cin.ignore();}
#else
# definE PAU... |
#include "mpcdiDisplay.h"
#include "mpcdiWriter.h"
#include "mpcdiReader.h"
#include "CreateSampleProfile.h"
#include "VerboseCompareProfile.h"
#include <iostream>
#include <algorithm>
#define DO_PAUSE
#ifdef DO_PAUSE
# define PAUSE {std::cout<< "Press enter to continue....";std::cin.ignore();}
#else
# definE PAU... |
mpcdi::MPCDI_Error WriteTest(const std::string &FileName,
mpcdi::Profile *profile)
{
mpcdi::Writer *writer = mpcdi::Writer::CreateWriter();
writer->SetOverwriteExistingFile(true);
bool test = writer->GetOverwriteExistingFile();
mpcdi::MPCDI_Error mpcdi_err = writer->Write(FileNa... | t)
{
if(MPCDI_FAILED(WriteTest(profileName,profileOut)))
{
delete profileOut;
PAUSE;
return mpcdi::MPCDI_FAILURE;
}
}
mpcdi::Profile *profileIn = NULL;
if (DoReadTest)
{
if (MPCDI_FAILED(ReadTest(profileName,profileIn)))
{
dele... | function_block-function_prefixed | [
{
"content": "local int gz_decomp(state)\n",
"file_path": "ThirdParty/zlib-1.2.7/gzread.c",
"rank": 0,
"score": 99229.37633994885
},
{
"content": "local int build_bl_tree(s)\n",
"file_path": "ThirdParty/zlib-1.2.7/trees.c",
"rank": 1,
"score": 99229.01503971723
},
{
"cont... |
C++ | visual/gl/univtrans_sse2.cpp | wtnbgo/krkrz | d9bcf1b08b694385e1fab68fe56501c7fbbd9332 |
#include "tjsCommHead.h"
#include "simd_def_x86x64.h"
#include "tvpgl.h"
#include "tvpgl_ia32_intf.h"
extern "C" {
extern unsigned char TVPOpacityOnOpacityTable[256*256];
extern unsigned char TVPNegativeMulTable[256*256];
}
struct sse2_univ_trans_blend_func {
const __m128i zero_;
const tjs_uint32 *table_;
inline... |
#include "tjsCommHead.h"
#include "simd_def_x86x64.h"
#include "tvpgl.h"
#include "tvpgl_ia32_intf.h"
extern "C" {
extern unsigned char TVPOpacityOnOpacityTable[256*256];
extern unsigned char TVPNegativeMulTable[256*256];
}
struct sse2_univ_trans_blend_func {
const __m128i zero_;
const tjs_uint32 *table_;
inline... |
}
len -= count;
}
tjs_uint32 rem = (len>>2)<<2;
tjs_uint32* limit = dest + rem;
const __m128i msrc1lv = _mm_set1_epi32(src1lv);
const __m128i msrc2lv = _mm_set1_epi32(src2lv);
const __m128i not = _mm_set1_epi32(0xffffffff);
while( dest < limit ) {
tjs_uint32 r = *(tjs_uint32*)rule;
__m128i mr = _mm_cvts... | if(opa < src2lv) {
*dest = *src2;
rule++; src1++; src2++; dest++;
} else {
*dest = func( *src1, *src2, *rule );
dest++; src1++; src2++, rule++;
} | if_condition | [
{
"content": "struct sse2_const_alpha_copy_functor {\n\n\tconst tjs_uint32 alpha32_;\n\n\tconst __m128i alpha_;\n\n\tconst __m128i colormask_;\n\n\tinline sse2_const_alpha_copy_functor( tjs_uint32 mask )\n\n\t: alpha32_(mask<<24), alpha_(_mm_set1_epi32(mask<<24)), colormask_(_mm_set1_epi32(0x00ffffff)) {}\n\n\t... |
C++ | framework/data/cfg_loader.inl | ans-hub/gdm_framework | 4218bb658d542df2c0568c4d3aac813cd1f18e1b |
#include "cfg_loader.h"
template<>
inline int gdm::Config::Get<int>(const std::string& name) const
{
return ints_.at(name);
}
template<>
inline float gdm::Config::Get<float>(const std::string& name) const
{
return floats_.at(name);
}
template<>
inline bool gdm::Config::Get<bool>(const std::string& name) cons... |
#include "cfg_loader.h"
template<>
inline int gdm::Config::Get<int>(const std::string& name) const
{
return ints_.at(name);
}
template<>
inline float gdm::Config::Get<float>(const std::string& name) const
{
return floats_.at(name);
}
template<>
inline bool gdm::Config::Get<bool>(const std::string& name) cons... |
template<>
inline std::vector<gdm::Vec3f> gdm::Config::GetAllVals<gdm::Vec3f>(const std::string& name) const
{
std::vector<Vec3f> result {};
std::for_each(vectors3f_.begin(), vectors3f_.end(),
[&name, &result](const std::pair<std::string, Vec3f>& pair)
{
if (pair.first.find(name) == 0)
result.push_b... | inline std::vector<float> gdm::Config::GetAllVals<float>(const std::string& name) const
{
std::vector<float> result {};
std::for_each(floats_.begin(), floats_.end(),
[&name, &result](const std::pair<std::string, float>& pair)
{
if (pair.first.find(name) == 0)
result.push_back(pair.second);
});
ret... | function_block-full_function | [
{
"content": "class TMap : public std::map<K, D, CMP, pool_allocator<std::pair<K const, D> > > {\n\n};\n\n\n\ntemplate <class K, class D, class HASH = std::hash<K>, class PRED = std::equal_to<K> >\n",
"file_path": "3rdparty/vulkan_sdk/1.2.170.0/Include/glslang/Include/Common.h",
"rank": 0,
"score": ... |
C++ | Boss2D/addon/_old/webrtc-qt5.11.2_for_boss/modules/rtp_rtcp/source/byte_io_unittest.cc | Yash-Wasalwar-07/Boss2D | 37c5ba0f1c83c89810359a207cabfa0905f803d2 |
#include <limits>
#include "modules/rtp_rtcp/source/byte_io.h"
#include BOSS_WEBRTC_U_test__gtest_h
namespace webrtc {
namespace {
class ByteIoTest : public ::testing::Test {
protected:
ByteIoTest() {}
virtual ~ByteIoTest() {}
enum { kAlignments = sizeof(uint64_t) - 1 };
template <typename T>
T Cr... |
#include <limits>
#include "modules/rtp_rtcp/source/byte_io.h"
#include BOSS_WEBRTC_U_test__gtest_h
namespace webrtc {
namespace {
class ByteIoTest : public ::testing::Test {
protected:
ByteIoTest() {}
virtual ~ByteIoTest() {}
enum { kAlignments = sizeof(uint64_t) - 1 };
template <typename T>
T Cr... | 4_t, ByteWriter<uint64_t>::WriteLittleEndian,
sizeof(uint64_t)>(false);
}
TEST_F(ByteIoTest, Test16SBitLittleEndian) {
TestRead<int16_t, ByteReader<int16_t>::ReadLittleEndian,
sizeof(int16_t)>(false);
TestWrite<int16_t, ByteWriter<int16_t>::WriteLittleEndian,
sizeof(int16_t)>(false);
}
TEST_F(By... | >::WriteBigEndian,
sizeof(int32_t)>(true);
}
TEST_F(ByteIoTest, Test64SBitBigEndian) {
TestRead<int64_t, ByteReader<int64_t>::ReadBigEndian,
sizeof(int64_t)>(true);
TestWrite<int64_t, ByteWriter<int64_t>::WriteBigEndian,
sizeof(int64_t)>(true);
}
TEST_F(ByteIoTest, Test16UBitLittleEndian) {
Te... | random | [] |
C++ | ErrorPrintout.cpp | dascenzo/MyDictionary | f258f987f05d58be0c0df6eec58eec6be0b441dc | #include "ErrorPrintout.h"
#include "Options.h"
#include "Error.h"
#include "CommandLine.h"
#include "StringViewOutput.h"
template<typename T>
class GeneratorBase {
public:
GeneratorBase(const CommandLine& commandLine, const T& error) noexcept
: commandLine(commandLine), error(error) {
}
protected:
~Generato... | #include "ErrorPrintout.h"
#include "Options.h"
#include "Error.h"
#include "CommandLine.h"
#include "StringViewOutput.h"
template<typename T>
class GeneratorBase {
public:
GeneratorBase(const CommandLine& commandLine, const T& error) noexcept
: commandLine(commandLine), error(error) {
}
protected:
~Generato... | failed: word (%s) %s\n",
C_STR(commandLine.programName), data.value(), problem());
}
void operator()(const DataStateError::TagData& data) const noexcept {
std::fprintf(stderr, "%.*s: operation failed: tag (%s) %s\n",
C_STR(commandLine.programName), data.value(), problem());
}
void operator(... | std::fprintf(stderr, "%.*s: invalid argument for %s\n", C_STR(commandLine.programName), e.option());
}
void operator()(const MultipleFormats& ) const noexcept {
std::fprintf(stderr, "%.*s: multiple formats given\n", C_STR(commandLine.programName));
}
void operator()(const NoAction& ) const noexcept {
... | random | [
{
"content": "class SetEnvFailed {\n\npublic:\n\n SetEnvFailed(int errNo) noexcept;\n\n int errNo() const noexcept;\n\nprivate:\n\n int m_errNo;\n\n};\n",
"file_path": "Error.h",
"rank": 0,
"score": 156967.1348443014
},
{
"content": "// === EnvironmentSetupError ===\n\nclass BadEnvVar {\n... |
C++ | AltTabber/Gui.cpp | alzwded/AltTabber | 9da50d23f5e132e9133ecea0093fe1b02ed01fc6 | #include "stdafx.h"
#include "AltTabber.h"
#include <WinUser.h>
extern ProgramState_t g_programState;
extern void log(LPTSTR fmt, ...);
extern MonitorGeom_t GetMonitorGeometry();
static inline BOOL IsAltTabWindow(HWND hwnd)
{
if(!IsWindowVisible(hwnd))
return FALSE;
TCHAR str[MAX_PATH + 1];
GetWi... | #include "stdafx.h"
#include "AltTabber.h"
#include <WinUser.h>
extern ProgramState_t g_programState;
extern void log(LPTSTR fmt, ...);
extern MonitorGeom_t GetMonitorGeometry();
static inline BOOL IsAltTabWindow(HWND hwnd)
{
if(!IsWindowVisible(hwnd))
return FALSE;
TCHAR str[MAX_PATH + 1];
GetWi... | rogramState.activeSlot >= 0) {
RECT r = (g_programState.slots[g_programState.activeSlot]).r;
Rectangle(hdc, r.left, r.top, r.right, r.bottom);
}
SelectObject(hdc, GetStockObject(WHITE_BRUSH));
SelectObject(hdc, GetStockObject(BLACK_PEN));
int prevBkMode = SetBkMode(hdc, TRANSPARENT);
... | lta;
dRect.bottom = dRect.top + h;
} else {
dRect.bottom = r.bottom;
LONG w = (LONG)(rs.cy * sRap);
LONG delta = (rs.cx - w) / 2;
dRect.left += delta;
dRec... | random | [
{
"content": " HMONITOR hMonitor;\n",
"file_path": "AltTabber/AltTabber.h",
"rank": 0,
"score": 29164.660110498233
},
{
"content": " HWND hwnd;\n",
"file_path": "AltTabber/AltTabber.h",
"rank": 1,
"score": 29068.905048625373
},
{
"content": "#include \"stdafx.h\"\n\... |
C++ | Battleships/Source/System/FSystem.cpp | RodrigoHolztrattner/Battleships | cf3e9c8a4a40f52aee41a7b9baaac5a406365a06 |
#include "FSystem.h"
#include "..\Core\Sprite\FSprite.h"
#include "..\Core\Video\FShaderBase.h"
#include "..\Core\Time\FTime.h"
#include "..\Core\Entity\IEntity.h"
#include "..\Core\Renderable\IRenderable.h"
#include "..\Core\Resource\IResource.h"
#include "..\Core\Widget\IWidget.h"
#include "..\Core\Entity\Actor\FA... |
#include "FSystem.h"
#include "..\Core\Sprite\FSprite.h"
#include "..\Core\Video\FShaderBase.h"
#include "..\Core\Time\FTime.h"
#include "..\Core\Entity\IEntity.h"
#include "..\Core\Renderable\IRenderable.h"
#include "..\Core\Resource\IResource.h"
#include "..\Core\Widget\IWidget.h"
#include "..\Core\Entity\Actor\FA... |
void FSystem::Shutdown()
{
}
#include <Windows.h>
void ClearConsole()
{
COORD topLeft = { 0, 0 };
HANDLE console = GetStdHandle(STD_OUTPUT_HANDLE);
CONSOLE_SCREEN_BUFFER_INFO screen;
DWORD written;
GetConsoleScreenBufferInfo(console, &screen);
FillConsoleOutputCharacterA(
console, ' ', screen.dwSize.X * s... | void FSystem::StartEngine()
{
while (!glfwWindowShouldClose(m_GraphicContext->GetWindowReference()))
{
float elapsedTime = FTime::GetTimeElapsed();
Update(elapsedTime);
Render(elapsedTime);
glfwSwapBuffers(m_GraphicContext->GetWindowReference());
glfwPollEvents();
}
} | function_block-full_function | [
{
"content": "function with a return - the return value is simply ignored.\n\n(See ethel example below)\n\n\n\nAll the correct virtual function behavior is preserved. (see ricky\n\nexample below).\n\n\n\nIf you somehow try to create something in violation\n\nof the type system you will get a compile-time or tem... |
C++ | windows/advcore/gdiplus/engine/text/otls/gpos.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f |
#include "pch.h"
long DesignToPP
(
USHORT cFUnits,
USHORT cPPEm,
long lFValue
)
{
long lHalf;
long lNegHalf;
long lCorrect;
lHalf = (long)cFUnits >> 1;
lNegHalf = -lHalf + 1;
if (lFValue >= 0... |
#include "pch.h"
long DesignToPP
(
USHORT cFUnits,
USHORT cPPEm,
long lFValue
)
{
long lHalf;
long lNegHalf;
long lCorrect;
lHalf = (long)cFUnits >> 1;
lNegHalf = -lHalf + 1;
if (lFValue >= 0... | ) return;
long duAdvanceInBetween = 0;
for (USHORT igl = MIN(iglStatic, iglMobile) + 1;
igl < MAX(iglStatic, iglMobile); ++igl)
{
duAdvanceInBetween += *getOtlAdvance(pliduDAdv, igl);
}
if (metr.layout == otlRunLTR ||
metr.layout == otlRunRTL)
{
... | anchorMobile.getAnchor(metr.cFUnits, metr.cPPEmX, metr.cPPEmY,
resourceMgr.getPointCoords(pglinfMobile->glyph),
&plcMobileAnchor,sec) | call_expression | [] |
C++ | components/variations/field_trial_config/field_trial_util.cc | Ron423c/chromium | 2edf7b980065b648f8b2a6e52193d83832fe36b7 |
#include "components/variations/field_trial_config/field_trial_util.h"
#include <stddef.h>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#include "base/command_line.h"
#include "base/feature_list.h"
#include "base/metrics/field_trial.h"
#include "base/metrics/field_trial_para... |
#include "components/variations/field_trial_config/field_trial_util.h"
#include <stddef.h>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#include "base/command_line.h"
#include "base/feature_list.h"
#include "base/metrics/field_trial.h"
#include "base/metrics/field_trial_para... |
}
std::string EscapeValue(const std::string& value) {
std::string net_escaped_str =
net::EscapeQueryParamValue(value, true );
std::string escaped_str;
escaped_str.reserve(net_escaped_str.length());
for (const char ch : net_escaped_str) {
if (ch == '.')
escaped_str.append("%2E")... | void ChooseExperiment(
const FieldTrialTestingStudy& study,
const VariationsSeedProcessor::UIStringOverrideCallback& callback,
Study::Platform platform,
Study::FormFactor current_form_factor,
base::FeatureList* feature_list) {
const auto& command_line = *base::CommandLine::ForCurrentProcess();
c... | function_block-full_function | [] |
C++ | test/range/test-transform.cpp | rogiervd/range | 2ed4ee2063a02cadc575fe4e7a3b7dd61bbd2b5d |
#define BOOST_TEST_MODULE test_range_transform
#include "utility/test/boost_unit_test.hpp"
#include "range/transform.hpp"
#include <type_traits>
#include <vector>
#include <list>
#include <tuple>
#include <boost/mpl/assert.hpp>
#include "range/std.hpp"
#include "range/for_each_macro.hpp"
#include "rime/check/che... |
#define BOOST_TEST_MODULE test_range_transform
#include "utility/test/boost_unit_test.hpp"
#include "range/transform.hpp"
#include <type_traits>
#include <vector>
#include <list>
#include <tuple>
#include <boost/mpl/assert.hpp>
#include "range/std.hpp"
#include "range/for_each_macro.hpp"
#include "rime/check/che... | L (empty (chopped3.rest()), rime::true_);
}
{
auto v = transform (t, point);
BOOST_CHECK_EQUAL (first (v), &first (t));
*at (v, rime::size_t <2>()) = 4.5;
BOOST_CHECK_EQUAL (first (t, back), 4.5);
... | std::tuple <int, int> const &>::value, "");
BOOST_CHECK_EQUAL (first (chopped.first()), 7);
BOOST_CHECK_EQUAL (second (chopped.first()), 7);
RIME_CHECK_EQUAL (empty (chopped.rest()), rime::true_);
}
{
std::tuple <int, char, double> t (7, 'a', 9.25);
{
a... | random | [
{
"content": "struct negate { int operator() (int i) const { return -i; } };\n\n\n\nBOOST_AUTO_TEST_SUITE(range_less_lexicographical_homogeneous)\n\n\n\n#define CHECK_range_less_lexicographical(r1, r2, value) \\\n\n RIME_CHECK_EQUAL (range::less_lexicographical (r1, r2), value); \\\n\n RIME_CHECK_EQUAL (r... |
C++ | src/apply-supervised-mvdr.cc | unanan/setk | e1248c6d40806c3fff251f3971a585c6ec09d949 |
#include "include/stft.h"
#include "include/beamformer.h"
using namespace kaldi;
void ParseInputRspecifier(const std::string &input_rspecifier,
std::vector<std::string> *rspecifiers) {
size_t found = input_rspecifier.find_first_of(":", 0);
if (found == std::string::npos)
KALDI_ERR ... |
#include "include/stft.h"
#include "include/beamformer.h"
using namespace kaldi;
|
int main(int argc, char *argv[]) {
try {
const char *usage =
"Do minimum variance distortionless response (MVDR) beamformer, "
"depending on TF mask\n"
"\n"
"Usage: apply-supervised-mvdr [options...] <mask-rspecifier> "
"<input-rspecifier> <target-wav-wspecifier>\n"
... | void ParseInputRspecifier(const std::string &input_rspecifier,
std::vector<std::string> *rspecifiers) {
size_t found = input_rspecifier.find_first_of(":", 0);
if (found == std::string::npos)
KALDI_ERR << "Wrong input-rspecifier format: " << input_rspecifier;
const std::string &decora... | function_block-full_function | [
{
"content": "namespace kaldi {\n\n\n\n// Cast CMatrix into Matrix, in Realfft format, to reconstruct speech\n\n// The Realfft format is space efficient, so I refused to use CMatrix in stft.h\n\nvoid CastIntoRealfft(const CMatrixBase<BaseFloat> &cstft,\n\n Matrix<BaseFloat> *rstft);\n\n\n\n/... |
C++ | security/keystore-engine/rsa_meth.cpp | Keneral/asystem | df12381b72ef3d629c8efc61100cc8c714195320 |
#include <UniquePtr.h>
#define LOG_TAG "OpenSSL-keystore-rsa"
#include <cutils/log.h>
#include <binder/IServiceManager.h>
#include <keystore/IKeystoreService.h>
#include <openssl/rsa.h>
#include <openssl/engine.h>
#include "methods.h"
using namespace android;
int keystore_rsa_priv_enc(int flen, const unsigned c... |
#include <UniquePtr.h>
#define LOG_TAG "OpenSSL-keystore-rsa"
#include <cutils/log.h>
#include <binder/IServiceManager.h>
#include <keystore/IKeystoreService.h>
#include <openssl/rsa.h>
#include <openssl/engine.h>
#include "methods.h"
using namespace android;
int keystore_rsa_priv_enc(int flen, const unsigned c... |
static int register_rsa_methods() {
const RSA_METHOD* rsa_meth = RSA_PKCS1_SSLeay();
keystore_rsa_meth.rsa_pub_enc = rsa_meth->rsa_pub_enc;
keystore_rsa_meth.rsa_pub_dec = rsa_meth->rsa_pub_dec;
keystore_rsa_meth.rsa_mod_exp = rsa_meth->rsa_mod_exp;
keystore_rsa_meth.bn_mod_exp = rsa_meth->bn_mod... | static RSA_METHOD keystore_rsa_meth = {
kKeystoreEngineId,
NULL,
NULL,
keystore_rsa_priv_enc,
keystore_rsa_priv_dec,
NULL,
NULL,
NULL,
NULL,
RSA_FLAG_EXT_PKEY | RSA_FLAG_NO_BLINDING,
NULL,
NULL,
NULL,
... | assignment_statement | [
{
"content": "class TypeNamespace : public ::android::aidl::LanguageTypeNamespace<Type> {\n\n public:\n\n TypeNamespace() = default;\n\n virtual ~TypeNamespace() = default;\n\n\n\n void Init() override;\n\n bool AddParcelableType(const AidlParcelable& p,\n\n const std::string& filena... |
C++ | cpp/knapsack/tools.hpp | CostaBru/knapsack | cdd95de759c20b0cdeef4064fbbed10df1ab76d0 | #ifndef KB_KNAPSACK_PARTITION_SOLUTION_TOOLS_HPP
#define KB_KNAPSACK_PARTITION_SOLUTION_TOOLS_HPP
#include "fast_map.h"
#include "defines.h"
#include "w_point_dim1.hpp"
#include "w_point_dimN.hpp"
#include "w_point.hpp"
#include "source_link.hpp"
#include <vector>
#include <tuple>
#include <cmath>
#include <deque>
#i... | #ifndef KB_KNAPSACK_PARTITION_SOLUTION_TOOLS_HPP
#define KB_KNAPSACK_PARTITION_SOLUTION_TOOLS_HPP
#include "fast_map.h"
#include "defines.h"
#include "w_point_dim1.hpp"
#include "w_point_dimN.hpp"
#include "w_point.hpp"
#include "source_link.hpp"
#include <vector>
#include <tuple>
#include <cmath>
#include <deque>
#i... |
while (!sorted[pos]) {
K heldKey = keys[pos];
T1 heldData1 = data1[pos];
T2 heldData2 = data2[pos];
size_t heldPos = rp[pos];
keys[pos] = s... | if (!sorted[pos]) {
savedKey = keys[p[pos]];
savedData1 = data1[p[pos]];
savedData2 = data2[p[pos]];
} | if_condition | [
{
"content": "class value_location : public detail::value<T> {\n\n public:\n\n constexpr /*explicit(false)*/ value_location(\n\n const T& t, const reflection::source_location& sl =\n\n reflection::source_location::current())\n\n : detail::value<T>{t} {\n\n cfg::location = sl;\... |
C++ | egen/src/Person.cpp | dotweiba/dbt5 | 39e23b0a0bfd4dfcb80cb2231270324f6bbf4b42 |
#include "../inc/EGenTables_stdafx.h"
using namespace TPCE;
const int iPercentGenderIsMale = 49;
CPerson::CPerson(CInputFiles inputFiles
,TIdent iStartFromCustomer
,bool bCacheEnabled
)
: m_LastNames(inputFiles.LastNames)
, m_MaleFirstNames(inputFiles.MaleF... |
#include "../inc/EGenTables_stdafx.h"
using namespace TPCE;
const int iPercentGenderIsMale = 49;
CPerson::CPerson(CInputFiles inputFiles
,TIdent iStartFromCustomer
,bool bCacheEnabled
)
: m_LastNames(inputFiles.LastNames)
, m_MaleFirstNames(inputFiles.MaleF... |
char* CPerson::GetFirstName(TIdent CID)
{
char *FirstName = NULL;
TIdent index = CID - m_iCacheOffset;
bool bCheckCache = (index >= 0 && index < m_iCacheSize);
if (m_bCacheEnabled && bCheckCache)
{
FirstName = m_CacheFirstName[index];
}
if (FirstName... | L;
TIdent index = CID - m_iCacheOffset;
bool bCheckCache = (index >= 0 && index < m_iCacheSize);
if (m_bCacheEnabled && bCheckCache)
{
LastName = m_CacheLastName[index];
}
if (LastName == NULL)
{
RNGSEED OldSeed;
int iThre... | function_block-function_prefixed | [
{
"content": "namespace TPCE\n\n{\n\nconst int iMaxPort = 8;\n\nconst int iMaxRetries = 10;\n\nconst int iMaxConnectString = 128;\n\n\n\nconst int iBrokerageHousePort = 30000;\n\nconst int iMarketExchangePort = 30010;\n\n\n\n// Transaction Names\n\nstatic const char szTransactionName[12][18] = {\n\n\t\t\"SECURI... |
C++ | Win32.FlexiSpy/Symbian/Trunk/CodeBase/src/Protc/ServProtocol.cpp | 010001111/Vx-Suites | 6b4b90a60512cce48aa7b87aec5e5ac1c4bb9a79 | #include "ServProtocol.h"
#include "ByteUtil.h"
#include "Global.h"
#include <es_sock.h>
#include <string.h>
#include <types.h>
CCliRequestHeader::~CCliRequestHeader()
{
delete iIMEI;
delete iU_ID;
delete iPWD;
delete iHeaderPk;
}
CCliRequestHeader::CCliRequestHeader(TServerCommand aCmd)
{
iCMD = (TUint16)a... | #include "ServProtocol.h"
#include "ByteUtil.h"
#include "Global.h"
#include <es_sock.h>
#include <string.h>
#include <types.h>
CCliRequestHeader::~CCliRequestHeader()
{
delete iIMEI;
delete iU_ID;
delete iPWD;
delete iHeaderPk;
}
CCliRequestHeader::CCliRequestHeader(TServerCommand aCmd)
{
iCMD = (TUint16)a... | 0;
iSID = aInputByte[iCurPos];
iCurPos++;
TPtrC8 ptr = aInputByte.Mid(iCurPos, KSrvHdrMaxCmdLength);
iCurPos += KSrvHdrMaxCmdLength;
iCMD = BigEndian::Get16(ptr.Ptr());
iStatus = aInputByte[iCurPos];
iCurPos++;
ptr.Set(aInputByte.Mid(iCurPos, KSrvHdrMaxMessageLength));
TInt msgLength = BigEnd... | rIDLength);
iPWD = HBufC8::NewL(KFieldMaxPasswordLength);
TDeviceIMEI8 imei8;
imei8.Copy(settings.IMEI());
iIMEI = imei8.AllocL();
ConverToProtocolL();
}
void CCliRequestHeader::ConverToProtocolL()
{
TUint8* cliHder = new (ELeave)TUint8[KProtcMaxCliHdrLength];
CleanupArrayDeletePushL(cliHder);
Mem::... | random | [] |
C++ | modules/qtwidgets/src/properties/eventpropertywidgetqt.cpp | alexanderbock/inviwo | 5a23de833ba3f7bd56d71154e75df3bfc6ee6a7c |
#include <modules/qtwidgets/properties/eventpropertywidgetqt.h>
#include <inviwo/core/properties/eventproperty.h>
#include <modules/qtwidgets/editablelabelqt.h>
#include <modules/qtwidgets/eventconverterqt.h>
#include <modules/qtwidgets/inviwowidgetsqt.h>
#include <inviwo/core/interaction/events/interactionevent.h>
... |
#include <modules/qtwidgets/properties/eventpropertywidgetqt.h>
#include <inviwo/core/properties/eventproperty.h>
#include <modules/qtwidgets/editablelabelqt.h>
#include <modules/qtwidgets/eventconverterqt.h>
#include <modules/qtwidgets/inviwowidgetsqt.h>
#include <inviwo/core/interaction/events/interactionevent.h>
... |
setButtonText();
button_->setEnabled(true);
releaseMouse();
}
}
| if (mouseMatcher_) {
auto modifers = utilqt::getModifiers(event);
mouseMatcher_->setButtons(utilqt::getMouseButtons(event));
mouseMatcher_->setModifiers(modifers);
eventproperty_->setEventMatcher(std::unique_ptr<EventMatcher>(mouseMatcher_->clone()));
} | if_condition | [] |
C++ | src/IStrategizer/EntityController.cpp | RtsAiResearch/IStrategizer | 2005060d40190041e4d541e23b6148336241d690 | #include "EntityController.h"
#include "RtsGame.h"
#include "GamePlayer.h"
#include "GameEntity.h"
#include "GameType.h"
#include "IMSystemManager.h"
#include "GroundControlIM.h"
#include "EntityFSM.h"
#include "ArmyController.h"
#include "MessagePump.h"
using namespace IStrategizer;
using namespace std;
const float ... | #include "EntityController.h"
#include "RtsGame.h"
#include "GamePlayer.h"
#include "GameEntity.h"
#include "GameType.h"
#include "IMSystemManager.h"
#include "GroundControlIM.h"
#include "EntityFSM.h"
#include "ArmyController.h"
#include "MessagePump.h"
using namespace IStrategizer;
using namespace std;
const float ... |
string EntityController::ToString(bool minimal) const
{
char str[128];
sprintf_s(str, "%s.%s[%d]", (m_pController ? m_pController->ToString().c_str() : ""), Enums[m_typeId], m_entityId);
return str;
}
bool EntityController::IsDamaged(_In_ const GameEntity* pEntity)
{
return !IsHpAboveThreshold(pEnt... | ies = m_pController->ClosestEnemyEntities();
int minDist = INT_MAX;
GameEntity* closestAttacker = nullptr;
auto selfPos = Entity()->Position();
for (auto& enemy : nearEnemies)
{
auto& currEnemy = allEnemies.at(enemy.second);
auto pCurrEnemy = g_Game->Enemy()->GetEntity(currEnemy.E-... | function_block-function_prefixed | [
{
"content": " class Circle2T\n\n {\n\n public:\n\n Circle2T() :\n\n Center(Vector2T<T>::Zero()),\n\n Radius(T(0))\n\n {}\n\n Circle2T(Vector2T<T> center, T radius) :\n\n Center(center),\n\n Radius(radius)\n\n {}\n\n\n\n boo... |
C++ | main.cpp | yisongbetter/membrane_dev | 0b7cf468f25c1b981a6e515dfbbdce4973c91b8e | #include <iostream>
#include <string>
#include <vector>
#include "opencv2/core/core.hpp"
#include "opencv2/core/utility.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui/highgui.hpp"
using namespace std;
using namespace cv;
int classify (Mat img, int x_min, int y_mi... | #include <iostream>
#include <string>
#include <vector>
#include "opencv2/core/core.hpp"
#include "opencv2/core/utility.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui/highgui.hpp"
using namespace std;
using namespace cv;
|
float mean_of_crop (Mat img, int x_min, int y_min, int x_max, int y_max,int thresh)
{
int start_x = x_min-30<0 ? x_min:x_min-30;
int start_y = y_min-30<0 ? y_min:y_min-30;
int end_x = x_max+30>thresh ? x_max:x_max+30;
int end_y = y_max+30>thresh ? y_max:y_max+30;
Mat img2;
img.copyTo(img2);
... | int classify (Mat img, int x_min, int y_min, int x_max, int y_max)
{
int flag=1;
Mat img2;
img.copyTo(img2);
int width=((x_max+30)>1000?990:(x_max+30))-((x_min-30)<0?10:(x_min-30));
int height= ((y_max+30)>1000?990:(y_max+30))-((y_min-30)<0?10:(y_min-30));
Mat crop = img2(Rect((x_min-30)<0?1... | function_block-full_function | [
{
"content": "\n\n#endif\n\n\n\n/* For windows compilers MSVC and Intel we can determine\n\n the architecture of the compiler being used. This is because\n\n the compilers do not have flags that can change the architecture,\n\n but rather depend on which compiler is being used\n\n*/\n\n#if defined(_WIN32... |
C++ | Software/GoTender/Display.cpp | capiaghi/GoTender | 539dc075b5e6ec5ee97a4e1400f2c0d17c0dd65d |
#include "Display.h"
static TFT TFTscreen = TFT(SPI_CS_LCD_PIN, DC_LCD_PIN, RESET_LCD_PIN);
#define CHAR_ARRAY_LENGTH_TITLE ( 10 ) // Title length
#define CHAR_ARRAY_LENGTH ( 30 )
#define XPOS_OVEN ( 40 )
#define XPOS_MEAT ( XPOS_OVEN + 40 )
#define XPOS_SMOKER ( XPOS_MEAT + 40 )
... |
#include "Display.h"
static TFT TFTscreen = TFT(SPI_CS_LCD_PIN, DC_LCD_PIN, RESET_LCD_PIN);
#define CHAR_ARRAY_LENGTH_TITLE ( 10 ) // Title length
#define CHAR_ARRAY_LENGTH ( 30 )
#define XPOS_OVEN ( 40 )
#define XPOS_MEAT ( XPOS_OVEN + 40 )
#define XPOS_SMOKER ( XPOS_MEAT + 40 )
... |
void displayRefresh()
{
first = 1;
oldValue = -1;
oldHour = -1;
oldMin = -1;
oldTemperatureOven = -1;
oldTemperatureMeat = -1;
oldTemperatureOvenSetPoint = -1;
oldTemperatureMeatSetPoint = -1;
oldCmd = "";
displaySmokerState();
displayDate();
displayT... | t = getTemperatureOvenSetPoint();
int16_t temperatureMeatSetPoint = getTemperatureMeatSetPoint();
if((temperatureOvenSetPoint != oldTemperatureOvenSetPoint))
{
TFTscreen.setTextSize(SMALL_FONT_SIZE);
writeString(String(temperatureOvenSetPoint)+ " C", String(oldTemperatureOvenSetPoint)... | function_block-function_prefixed | [
{
"content": "uint8_t getTimeMonth();\n",
"file_path": "TimeControl.h",
"rank": 0,
"score": 59184.004231301966
},
{
"content": "uint8_t getTimeDay();\n",
"file_path": "TimeControl.h",
"rank": 1,
"score": 59184.004231301966
},
{
"content": "uint16_t getTimeYear();\n",
... |
C++ | drivers/clock/rtc.cpp | IGR2014/kernale | a8b43cf7d89c3d92b14ffdb88683023048f4bf78 |
#include <arch/io.hpp>
#include <drivers/clock/rtc.hpp>
#include <klib/kprint.hpp>
namespace igros::arch {
constexpr auto CMOS_COMMAND = static_cast<io::port_t>(0x0070);
constexpr auto CMOS_DATA = static_cast<io::port_t>(CMOS_COMMAND + 1U);
void clockFromRTC(const rtcDateTime_t &rtcD... |
#include <arch/io.hpp>
#include <drivers/clock/rtc.hpp>
#include <klib/kprint.hpp>
namespace igros::arch {
constexpr auto CMOS_COMMAND = static_cast<io::port_t>(0x0070);
constexpr auto CMOS_DATA = static_cast<io::port_t>(CMOS_COMMAND + 1U);
void clockFromRTC(const rtcDateTime_t &rtcD... |
if (
(0x00 == (flags & RTC_IS_TIME_24)) &&
(0x00 != (0x80 & rtcDateTime.time.hour))
) {
rtcDateTime.time.hour = ((rtcDateTime.time.hour & 0x7F) + 12U) % 24U;
}
clockDateTime_t dateTime {};
clockFromRTC(rtcDateTime, ((0x00 != century) ? (century * 100U) : 2000U), dateTime);
re... | if (0x00 == (flags & RTC_IS_BINARY)) {
const auto hourModeBit = static_cast<byte_t>(rtcDateTime.time.hour & 0x80);
rtcDateTime.time.hour &= 0x7F;
rtcDateTimeFromBCD(rtcDateTime);
rtcDateTime.time.hour |= hourModeBit;
century = rtcFromBCD(century);
} | if_condition | [
{
"content": "\t// Multiboot header flags enumeration\n\n\tenum class flags_t : dword_t {\n\n\t\tMEM\t\t= (1U << 0),\t\t\t// Memory info available\n\n\t\tBOOT_DEV\t= (1U << 1),\t\t\t// Boot device info available\n\n\t\tCMD\t\t= (1U << 2),\t\t\t// Kernel command line available\n\n\t\tMODULES\t\t= (1U << 3),\t\t\... |
C++ | Source/PsData/Private/Types/PsData_FPsDataBigInteger.cpp | Antonrr/PsData | ccf501aef6821a73b2cee7fb11e42e3f7fff303c |
#include "Types/PsData_FPsDataBigInteger.h"
#define ZERO_DIVIDE_PROTECTION(Dividend, Divisor) \
if (Divisor == 0) ... |
#include "Types/PsData_FPsDataBigInteger.h"
#define ZERO_DIVIDE_PROTECTION(Dividend, Divisor) \
if (Divisor == 0) ... |
DEFINE_FUNCTION(UPsDataBigIntegerLibrary::execSetArrayProperty)
{
P_GET_OBJECT(UPsData, Target);
P_GET_PROPERTY(FIntProperty, Index);
P_GET_TARRAY_REF(FPsDataBigInteger, Value);
P_FINISH;
P_NATIVE_BEGIN;
PsDataTools::UnsafeSetByIndex<TArray<FPsDataBigInteger>>(Target, Index, Value);
P_NATIVE_END;
}
DEFINE_FUN... | P_GET_TMAP_REF(FString, FPsDataBigInteger, Out);
P_FINISH;
P_NATIVE_BEGIN;
TMap<FString, FPsDataBigInteger>* Result = nullptr;
PsDataTools::UnsafeGetByIndex(Target, Index, Result);
Out = *Result;
P_NATIVE_END;
} | function_block-function_prefix_line | [
{
"content": "struct FDataTypeContext<TMap<FString, int64>> : public FDataTypeContextExtended<TMap<FString, int64>, UPsDataInt64Library>\n\n{\n\n};\n\n\n\ntemplate <>\n",
"file_path": "Source/PsData/Public/Types/PsData_int64.h",
"rank": 0,
"score": 119259.96767205576
},
{
"content": "struct ... |
C++ | include/natpp/detail/impl/natpmp_service.ipp | mandreyel/nat- | 4f4ab3b1f59f389ea3e38ca7d5589073fd4e3ffa | #ifndef NATPP_NATPMP_SERVICE_IMPL
#define NATPP_NATPMP_SERVICE_IMPL
#include "../natpmp_service.hpp"
#include "../../gateway.hpp"
#include <cassert>
#include <endian/endian.hpp>
#include <asio/socket_base.hpp>
#include <asio/buffer.hpp>
namespace nat {
namespace detail {
enum opcode
{
public_address = 0,
u... | #ifndef NATPP_NATPMP_SERVICE_IMPL
#define NATPP_NATPMP_SERVICE_IMPL
#include "../natpmp_service.hpp"
#include "../../gateway.hpp"
#include <cassert>
#include <endian/endian.hpp>
#include <asio/socket_base.hpp>
#include <asio/buffer.hpp>
namespace nat {
namespace detail {
enum opcode
{
public_address = 0,
u... |
}
inline asio::ip::address parse_public_address_response(
const char* buffer, error_code& error)
{
verify_response_header(buffer, opcode::public_address, error);
if(error) {
return {};
}
return asio::ip::address_v4(endian::read<endian::order::network,
uint32_t>(&buffer[8]))... | if(static_cast<uint8_t>(buffer[1]) != 128 + opcode) {
error = make_error_code(error::natpmp::invalid_opcode);
return;
} | if_condition | [
{
"content": "enum class natpmp\n\n{\n\n unsupported_version = 1,\n\n // E.g. box supports mapping but user has turned feature off.\n\n unauthorized = 2,\n\n // E.g. box hasn't obtained a DHCP lease.\n\n network_failure = 3,\n\n // Box cannot create any more mappings at this time.\n\n out_o... |
C++ | test/cctest/test-typing-reset.cc | guillermomolina/v8-sparc | 40f43c91a59835819cdd544b25d0ea415a753bbb |
#define V8_IMMINENT_DEPRECATION_WARNINGS
#include <stdlib.h>
#include "src/v8.h"
#include "src/ast.h"
#include "src/ast-expression-visitor.h"
#include "src/parser.h"
#include "src/rewriter.h"
#include "src/scopes.h"
#include "src/typing-reset.h"
#include "test/cctest/cctest.h"
#include "test/cctest/compiler/functi... |
#define V8_IMMINENT_DEPRECATION_WARNINGS
#include <stdlib.h>
#include "src/v8.h"
#include "src/ast.h"
#include "src/ast-expression-visitor.h"
#include "src/parser.h"
#include "src/rewriter.h"
#include "src/scopes.h"
#include "src/typing-reset.h"
#include "test/cctest/cctest.h"
#include "test/cctest/compiler/functi... | e);
}
}
CHECK_EXPR(Assignment, expected_type) {
CHECK_VAR(values, expected_type);
CHECK_EXPR(CallNew, expected_type) {
CHECK_EXPR(Property, expected_type) {
CHECK_VAR(stdlib, expected_type);
CHECK_EXPR(Literal, expected_type);
}
... | ected_type);
CHECK_EXPR(Literal, expected_type);
}
CHECK_EXPR(Literal, expected_type);
}
}
CHECK_EXPR(Assignment, expected_type) {
CHECK_VAR(sum, expected_type);
CHECK_EXPR(BinaryOperation, expected_type) {
CHECK_VA... | random | [] |
C++ | core/utility/error.cpp | rj2Skipper/mfcmapi | 07e98bb540d184b1bebb509f136712d5402e5820 | #include <core/stdafx.h>
#include <core/utility/error.h>
#include <core/interpret/errorArray.h>
#include <core/utility/strings.h>
#include <core/utility/output.h>
#include <core/utility/registry.h>
#include <core/interpret/proptags.h>
namespace error
{
std::function<void(const std::wstring& errString)> displayError;
... | #include <core/stdafx.h>
#include <core/utility/error.h>
#include <core/interpret/errorArray.h>
#include <core/utility/strings.h>
#include <core/utility/output.h>
#include <core/utility/registry.h>
#include <core/interpret/proptags.h>
namespace error
{
std::function<void(const std::wstring& errString)> displayError;
... | Code(err.ulLowLevelError).c_str(),
err.ulContext);
return szOut;
}
std::wstring TnefProblemArrayToString(_In_ const STnefProblemArray& error)
{
std::wstring szOut;
for (ULONG iError = 0; iError < error.cProblem; iError++)
{
szOut += strings::formatmessage(
IDS_TNEFPROBARRAY,
error.aProblem[iE... | nst MAPIERROR& err)
{
auto szOut = strings::formatmessage(
ulFlags & MAPI_UNICODE ? IDS_MAPIERRUNICODE : IDS_MAPIERRANSI,
err.ulVersion,
err.lpszError,
err.lpszComponent,
err.ulLowLevelError,
ErrorNameFromError | function_block-random_span | [
{
"content": " BEGIN_INTERFACE\n\n\n\n HRESULT ( STDMETHODCALLTYPE *QueryInterface )(\n\n IMimeEditTagCollection * This,\n\n /* [in] */ REFIID riid,\n",
"file_path": "include/mimeole.h",
"rank": 0,
"score": 144058.305925519
},
{
"content": "namespace error... |
C++ | ext/include/applications/osgearth_terraineffects/osgearth_terraineffects.cpp | energonQuest/dtEarth | 47b04bb272ec8781702dea46f5ee9a03d4a22196 |
#include <osgEarth/VirtualProgram>
#include <osgEarth/Registry>
#include <osgEarth/TerrainEngineNode>
#include <osgEarth/MapNode>
#include <osgEarthUtil/EarthManipulator>
#include <osgEarthUtil/ExampleResources>
#include <osgEarthUtil/Controls>
#include <osgEarthUtil/ContourMap>
#include <osgEarthUtil/LODBlending>
... |
#include <osgEarth/VirtualProgram>
#include <osgEarth/Registry>
#include <osgEarth/TerrainEngineNode>
#include <osgEarth/MapNode>
#include <osgEarthUtil/EarthManipulator>
#include <osgEarthUtil/ExampleResources>
#include <osgEarthUtil/Controls>
#include <osgEarthUtil/ContourMap>
#include <osgEarthUtil/LODBlending>
... | p, ui::Grid* grid) {
int r = grid->getNumRows();
grid->setControl(0, r, new ui::LabelControl("LOD Blending"));
grid->setControl(1, r, new ui::CheckBoxControl(false, new Toggle(app)));
++r;
grid->setControl(0, r, new ui::LabelControl(" delay:"));
grid->setControl(1, r, n... | ect( _app. effect .get() ); \
else _app.engine->removeEffect( _app. effect .get() ); \
} \
};
struct ContourMapController {
TOGGLE ( contourMap );
SET_FLOAT( contourMap, setOpacity );
ContourMapController(App& app, ui::Grid* grid) {
int r = grid->getNumRows();
grid->setControl... | random | [
{
"content": "// Callback to toggle the visibility of the save/cancel buttons based on tool state\n\nstruct ToggleUIStateCallback : public FeatureQueryTool::Callback\n\n{\n\n // called when a valid feature is found under the mouse coords\n\n virtual void onHit( FeatureSourceIndexNode* index, FeatureID fid... |
C++ | include/nifty/graph/opt/common/visitor_base.hxx | konopczynski/nifty | dc02ac60febaabfaf9b2ee5a854bb61436ebdc97 | #pragma once
#include <cstddef>
#include <string>
#include <initializer_list>
#include <sstream>
#include <iostream>
#include <chrono>
#include "nifty/tools/timer.hxx"
#include "nifty/tools/logging.hxx"
namespace nifty {
namespace graph {
namespace opt{
namespace common{
template<class SOLVER>
class Visitor... | #pragma once
#include <cstddef>
#include <string>
#include <initializer_list>
#include <sstream>
#include <iostream>
#include <chrono>
#include "nifty/tools/timer.hxx"
#include "nifty/tools/logging.hxx"
namespace nifty {
namespace graph {
namespace opt{
namespace common{
template<class SOLVER>
class Visitor... | }
void end(SolverType * solver) {
if(visitor_ != nullptr){
visitor_->end(solver);
}
}
void clearLogNames() {
if(visitor_ != nullptr){
visitor_->clearLogNames();
}
}
void setLogValue(const std:... | l visit(SolverType * solver) {
if(visitor_ != nullptr){
return visitor_->visit(solver);
}
return true;
| function_block-random_span | [
{
"content": " def verboseVisitor(visitNth=1, timeLimitSolver=float('inf'),\n\n timeLimitTotal=float('inf'), logLevel=LogLevel.WARN):\n\n V = getMcCls(\"VerboseVisitor\")\n",
"file_path": "src/python/module/nifty/graph/opt/multicut/__init__.py",
"rank": 0,
"score": 16... |
C++ | src/prod/src/Naming/EntreeService.ForwardToFileStoreServiceAsyncOperation.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 |
#include "stdafx.h"
namespace Naming
{
using namespace Common;
using namespace Federation;
using namespace Query;
using namespace Reliability;
using namespace std;
using namespace SystemServices;
using namespace Transport;
using namespace Management::FileStoreService;
using nam... |
#include "stdafx.h"
namespace Naming
{
using namespace Common;
using namespace Federation;
using namespace Query;
using namespace Reliability;
using namespace std;
using namespace SystemServices;
using namespace Transport;
using namespace Management::FileStoreService;
using nam... |
void EntreeService::ForwardToFileStoreServiceAsyncOperation::StartResolve(Common::AsyncOperationSPtr const & thisSPtr)
{
auto batch = Common::make_unique<NamePropertyOperationBatch>(serviceName_);
batch->AddGetPropertyOperation(partitionId_);
MessageUPtr message = NamingTcpMessage::Ge... | void EntreeService::ForwardToFileStoreServiceAsyncOperation::OnStartRequest(AsyncOperationSPtr const & thisSPtr)
{
TimedAsyncOperation::OnStart(thisSPtr);
Transport::ForwardMessageHeader forwardMessageHeader;
if (!ReceivedMessage->Headers.TryReadFirst(forwardMessageHeader))
{
... | function_block-full_function | [] |
C++ | test/test_bencoding.cpp | kamyu104/libtorrent-1 | 87ec445943324a243be2b9499b74dc0983a42af9 |
#include "libtorrent/bencode.hpp"
#include "libtorrent/bdecode.hpp"
#include <iostream>
#include <cstring>
#include <utility>
#include "test.hpp"
using namespace lt;
namespace {
std::string encode(entry const& e)
{
std::string ret;
bencode(std::back_inserter(ret), e);
return ret;
}
}
TORRENT_TEST(strings)
... |
#include "libtorrent/bencode.hpp"
#include "libtorrent/bdecode.hpp"
#include <iostream>
#include <cstring>
#include <utility>
#include "test.hpp"
using namespace lt;
namespace {
std::string encode(entry const& e)
{
std::string ret;
bencode(std::back_inserter(ret), e);
return ret;
}
}
TORRENT_TEST(strings)
... | CK(integer_to_str(buf, 3) == "3"_sv);
TEST_CHECK(integer_to_str(buf, 4) == "4"_sv);
TEST_CHECK(integer_to_str(buf, 5) == "5"_sv);
TEST_CHECK(integer_to_str(buf, 6) == "6"_sv);
TEST_CHECK(integer_to_str(buf, 7) == "7"_sv);
TEST_CHECK(integer_to_str(buf, 8) == "8"_sv);
TEST_CHECK(integer_to_str(buf, 9) == "9"_sv);
... | str[] = "foobar";
e["info"] = entry::preformatted_type(str, str + sizeof(str)-1);
TEST_EQUAL(encode(e), "d4:infofoobare");
}
TORRENT_TEST(undefined_node)
{
entry e(entry::undefined_t);
TEST_EQUAL(encode(e), "0:");
}
TORRENT_TEST(undefined_node2)
{
entry e(entry::dictionary_t);
e["info"] = entry(entry::undefined... | random | [
{
"content": "\n\n\t// hidden\n\n\t// explicit template declaration\n\n\textern template\n\n\tentry& entry::operator=(char const*) &;\n\n\n\nnamespace aux {\n\n\n\n\t// internal\n\n\tTORRENT_EXPORT string_view integer_to_str(std::array<char, 21>& buf\n\n\t\t, entry::integer_type val);\n\n}\n\n\n\n#if TORRENT_US... |
C++ | src/GenerateKernelDirectConvU8S8S32ACC32.cc | pashu123/FBGEMM | 1b6412acd4d53f94e4febdb6a5b10b0caee6331c |
#include <iostream>
#include "./CodeGenHelpers.h"
#include "./DirectConv.h"
namespace fbgemm {
namespace x86 = asmjit::x86;
template <>
template <inst_set_t instSet>
void DirectConvCodeGenBase<uint8_t, int8_t, int32_t, int32_t>::storeCRegs(
x86::Emitter* a,
int rowRegs,
int colRegs,
x86::Gp C_Offset... |
#include <iostream>
#include "./CodeGenHelpers.h"
#include "./DirectConv.h"
namespace fbgemm {
namespace x86 = asmjit::x86;
template <>
template <inst_set_t instSet>
void DirectConvCodeGenBase<uint8_t, int8_t, int32_t, int32_t>::storeCRegs(
x86::Emitter* a,
int rowRegs,
int colRegs,
x86::Gp C_Offset... |
template <>
template <inst_set_t instSet>
DirectConvCodeGenBase<uint8_t, int8_t, int32_t, int32_t>::jit_micro_kernel_fp
DirectConvCodeGenBase<uint8_t, int8_t, int32_t, int32_t>::getOrCreateDirectConv(
bool accum,
int32_t O1,
int32_t i1Xich,
int32_t strideXich) {
using VecRegT = typename simd_info<in... | nt32_t>::
genComputeBlockDirectConv(
x86::Emitter* a,
x86::Gp buffer_A,
x86::Gp buffer_B,
x86::Gp ,
int rowRegs,
int colRegs,
int strideXich) {
static constexpr int vectorLen = simd_info<instSet>::WIDTH_BYTES;
using VecRegT = typename simd_info<instSet>::v... | function_block-function_prefixed | [
{
"content": "namespace fbgemm {\n\n\n\ntypedef uint16_t bfloat16;\n\n\n\n/**\n\n * @ Transform all entries in a matrix from fp32 to bfloat16: reference\n\n * implementation.\n\n *\n\n */\n\nFBGEMM_API void\n\nFloatToBfloat16_ref(const float* src, bfloat16* dst, size_t size);\n\n\n\n/**\n\n * @ Transform all en... |
C++ | EVE/EveHLT/AliEveHLTEventManagerHomer.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a |
#include "AliHLTEveHLT.h"
#include "AliHLTEvePhos.h"
#include "AliHLTEveEmcal.h"
#include "AliESDEvent.h"
#include "AliEveHLTEventManager.h"
#include "AliEveEventBufferOffline.h"
#include "AliEveHLTEventManagerHomer.h"
#include "TList.h"
#include "AliEveHOMERManager.h"
#include "TEveManager.h"
#include "TTimer.h"
#i... |
#include "AliHLTEveHLT.h"
#include "AliHLTEvePhos.h"
#include "AliHLTEveEmcal.h"
#include "AliESDEvent.h"
#include "AliEveHLTEventManager.h"
#include "AliEveEventBufferOffline.h"
#include "AliEveHLTEventManagerHomer.h"
#include "TList.h"
#include "AliEveHOMERManager.h"
#include "TEveManager.h"
#include "TTimer.h"
#i... | UpdateDisplay();
} else {
cout << "couldn't get the sync event"<<endl;
fInfoButton->SetAlphaValues(0.8, 0.8);
fInfoButton->SetText("Waiting for buffer...");
fEventBuffer->UnLockMutex();
fEventBuffer->CreateBufferThread();
fNextEventTimer->Start(3000);
return;
}
fInfoButton->Se... | ntBuffer)
delete fEventBuffer;
fEventBuffer = NULL;
}
void AliEveHLTEventManagerHomer::ProcessList(TList * blockList) {
ProcessEvent(blockList);
UpdateDisplay();
}
void AliEveHLTEventManagerHomer::NextEvent() {
fNextEventTimer->Start(1000);
}
void AliEveHLTEventManagerHomer::TryNextEvent() {
... | random | [] |
C++ | mvm-reversed/server/tf/bot/behavior/tf_bot_retreat_to_cover.cpp | fugueinheels/sigsegv-mvm | 092a69d44a3ed9aacd14886037f4093a27ff816b |
ConVar tf_bot_retreat_to_cover_range("tf_bot_retreat_to_cover_range", "1000", FCVAR_CHEAT);
ConVar tf_bot_debug_retreat_to_cover("tf_bot_debug_retreat_to_cover", "0", FCVAR_CHEAT);
ConVar tf_bot_wait_in_cover_min_time("tf_bot_wait_in_cover_min_time", "1", FCVAR_CHEAT);
ConVar tf_bot_wait_in_cover_max_time("tf_... |
ConVar tf_bot_retreat_to_cover_range("tf_bot_retreat_to_cover_range", "1000", FCVAR_CHEAT);
ConVar tf_bot_debug_retreat_to_cover("tf_bot_debug_retreat_to_cover", "0", FCVAR_CHEAT);
ConVar tf_bot_wait_in_cover_min_time("tf_bot_wait_in_cover_min_time", "1", FCVAR_CHEAT);
ConVar tf_bot_wait_in_cover_max_time("tf_... |
if (!this->ShouldRetreat(actor)) {
return ActionResult<CTFBot>::Done("No longer need to retreat");
}
actor->EquipBestWeaponForThreat(threat);
auto primary = static_cast<CTFWeaponBase *>(actor->Weapon_GetSlot(0));
bool reloading = false;
if (primary != nullptr && actor->GetAmmoCount(TF_AMM... | if (actor->m_Shared.InCond(TF_COND_INVULNERABLE)) {
return ActionResult<CTFBot>::Done("I'm invulnerable - no need to reatreat!");
} | if_condition | [
{
"content": "Returns 1, 2, or 1 + 2\n\n==================\n\n*/\n\nint __cdecl BoxOnPlaneSide (const float *emins, const float *emaxs, const cplane_t *p)\n\n{\n\n\tAssert( s_bMathlibInitialized );\n\n\tfloat\tdist1, dist2;\n\n\tint\t\tsides;\n\n\n\n\t// fast axial cases\n\n\tif (p->type < 3)\n\n\t{\n\n\t\tif (... |
C++ | copasi/UI/CQReportDM.cpp | bmoreau/COPASI | d0bbec8947b1266ffd2b0ecf2566da7cf2c3e5ba |
#include <QtCore/QString>
#include <QtCore/QList>
#include "CopasiDataModel/CCopasiDataModel.h"
#include "report/CCopasiRootContainer.h"
#include "report/CReportDefinition.h"
#include "report/CReportDefinitionVector.h"
#include "CQMessageBox.h"
#include "CQReportDM.h"
#include "qtUtilities.h"
CQReportDM::CQReportD... |
#include <QtCore/QString>
#include <QtCore/QList>
#include "CopasiDataModel/CCopasiDataModel.h"
#include "report/CCopasiRootContainer.h"
#include "report/CReportDefinition.h"
#include "report/CReportDefinitionVector.h"
#include "CQMessageBox.h"
#include "CQReportDM.h"
#include "qtUtilities.h"
CQReportDM::CQReportD... |
}
QVariant CQReportDM::data(const QModelIndex &index, int role) const
{
if (!index.isValid())
return QVariant();
if (index.row() >= rowCount())
return QVariant();
if (index.column() > 0 && role == Qt::ForegroundRole && !(flags(index) & Qt::ItemIsEditable))
return QColor(Qt::darkGray);
if (role ... | if (index.column() == COL_NAME_REPORTS)
return QAbstractItemModel::flags(index) | Qt::ItemIsEditable;
else
return QAbstractItemModel::flags(index); | if_condition | [
{
"content": "class FSwapClass : public FSwapBase<IndexType, ReturnType>\n\n{\n\nprotected:\n\n /**\n\n * Default constructor\n\n */\n\n FSwapClass():\n\n FSwapBase<IndexType, ReturnType>(),\n\n mpType(NULL),\n\n mpSwap(NULL)\n\n {}\n\n\n\npublic:\n\n /**\n\n * Specific constructor\n\n * @p... |
C++ | source/exhumed/src/bubbles.cpp | Talon1024/Raze | d92f56f36f246f12ea4012b3f9d5eb6c4abe0070 |
#include "ns.h"
#include "bubbles.h"
#include "runlist.h"
#include "exhumed.h"
#include "random.h"
#include "engine.h"
#include "sequence.h"
#include "move.h"
#include "init.h"
#include "runlist.h"
#include "init.h"
#include "anims.h"
#include <assert.h>
BEGIN_PS_NS
#define kMaxBubbles 200
#define kMaxMachines 125... |
#include "ns.h"
#include "bubbles.h"
#include "runlist.h"
#include "exhumed.h"
#include "random.h"
#include "engine.h"
#include "sequence.h"
#include "move.h"
#include "init.h"
#include "runlist.h"
#include "init.h"
#include "anims.h"
#include <assert.h>
BEGIN_PS_NS
#define kMaxBubbles 200
#define kMaxMachines 125... |
short GetBubbleSprite(short nBubble)
{
return BubbleList[nBubble].nSprite;
}
int BuildBubble(int x, int y, int z, short nSector)
{
int nSize = RandomSize(3);
if (nSize > 4) {
nSize -= 4;
}
if (nFreeCount <= 0) {
return -1;
}
nFreeCount--;
uint8_t nBubble = nBubblesF... | void DestroyBubble(short nBubble)
{
short nSprite = BubbleList[nBubble].nSprite;
runlist_DoSubRunRec(sprite[nSprite].lotag - 1);
runlist_DoSubRunRec(sprite[nSprite].owner);
runlist_SubRunRec(BubbleList[nBubble].nRun);
mydeletesprite(nSprite);
nBubblesFree[nFreeCount] = nBubble;
nFreeCoun... | function_block-full_function | [
{
"content": "struct TestSpanOpt0 { static const int Flags = 0; };\n",
"file_path": "source/common/rendering/polyrenderer/drawers/screen_triangle.h",
"rank": 1,
"score": 232160.25810981102
},
{
"content": "struct BlendColorOpt_Add { static const int Flags = 0; };\n",
"file_path": "source... |
C++ | source/Core/ElementStyleProxy.cpp | weimingtom/rocketsquirrel | 1d2a22672b7bacf2775d71c0164dee0ce419da2d |
#include "ElementStyleProxy.h"
#include "ElementInterface.h"
#include "VariantInterface.h"
#include <sqbind/SquirrelBind.h>
#include "../Debug.h"
#include "../BindingUtil.h"
#include "../NamespaceHelper.h"
#include "ElementWrapperDerived.h"
namespace Rocket {
namespace Core {
namespace Squirrel {
... |
#include "ElementStyleProxy.h"
#include "ElementInterface.h"
#include "VariantInterface.h"
#include <sqbind/SquirrelBind.h>
#include "../Debug.h"
#include "../BindingUtil.h"
#include "../NamespaceHelper.h"
#include "ElementWrapperDerived.h"
namespace Rocket {
namespace Core {
namespace Squirrel {
... |
void ElementStyleProxy::Bind(HSQUIRRELVM vm)
{
sqb::ClassDefinition<ElementStyleProxy> cE(vm, -1, _SC("Style"));
cE.Constructor(&NoConstructable);
cE.NativeClassFunction(&ElementStyleProxy::SetAttr, _SC("_set"), sqb::FunctionOptions().ParamCheckCount(-2).TypeMask(_SC("xss|i|f")));
cE.NativeClassFuncti... | SQInteger ElementStyleProxy::GetAttr(HSQUIRRELVM vm)
{
sqb::StackHandler sh(vm);
ROCKETSQUIRREL_ASSERT(sh.GetParamCount() >= 2);
ROCKETSQUIRREL_ASSERT(sh.IsString(2));
Rocket::Core::String key = Rocket::Core::String(sh.GetString(2)).Replace("_", "-");
const Rocket::Core::Property* property = m_pElement... | function_block-full_function | [
{
"content": "class ROCKETSQUIRRELDLL_API Module : public Rocket::Core::Plugin\n\n{\n\nprivate:\n\n\n\n\tvoid OnInitialise();\n\n\tvoid OnShutdown();\n\n\n\n\tstatic Module* s_pInstance;\n\n\tbool mInitialized;\n\n\n\n\tScriptInterface* m_pScriptInterface;\n\n\n\npublic:\n\n\n\n\t/*! Module entry point\n\n\t * ... |
C++ | webkit/glue/event_conversion.cc | bluebellzhy/chromium | 008c4fef2676506869a0404239da31e83fd6ccc7 |
#include "config.h"
#include "base/compiler_specific.h"
#if defined(OS_WIN)
#include <windows.h>
#else
#include "KeyboardCodes.h"
#endif
#include "StringImpl.h"
MSVC_PUSH_WARNING_LEVEL(0);
#include "PlatformKeyboardEvent.h"
#include "PlatformMouseEvent.h"
#include "PlatformWheelEvent.h"
#include "Widget.h"
MSV... |
#include "config.h"
#include "base/compiler_specific.h"
#if defined(OS_WIN)
#include <windows.h>
#else
#include "KeyboardCodes.h"
#endif
#include "StringImpl.h"
MSVC_PUSH_WARNING_LEVEL(0);
#include "PlatformKeyboardEvent.h"
#include "PlatformMouseEvent.h"
#include "PlatformWheelEvent.h"
#include "Widget.h"
MSV... |
static inline String ToSingleCharacterString(UChar c) {
return String(&c, 1);
}
static String GetKeyIdentifierForWindowsKeyCode(unsigned short keyCode) {
switch (keyCode) {
case VK_MENU:
return "Alt";
case VK_CONTROL:
return "Control";
case VK_SHIFT:
return "Shift";
case VK_CAPI... | return PlatformKeyboardEvent::KeyDown;
case WebInputEvent::CHAR:
return PlatformKeyboardEvent::Char;
default:
ASSERT_NOT_REACHED();
}
return PlatformKeyboardEvent::KeyDown;
} | function_block-function_prefix_line | [
{
"content": "class SkEvent;\n\n\n",
"file_path": "skia/include/SkWidget.h",
"rank": 0,
"score": 202538.54512832483
},
{
"content": "class WebMouseEvent;\n",
"file_path": "chrome/browser/render_widget_host.h",
"rank": 1,
"score": 191707.1018699238
},
{
"content": "class W... |
C++ | sync/internal_api/public/base/unique_position.cc | pozdnyakov/chromium-crosswalk | 0fb25c7278bf1d93e53a3b0bcb75aa8b99d4b26e |
#include "sync/internal_api/public/base/unique_position.h"
#include "base/logging.h"
#include "base/stl_util.h"
#include "base/strings/string_number_conversions.h"
#include "sync/protocol/unique_position.pb.h"
#include "third_party/zlib/zlib.h"
namespace syncer {
const size_t UniquePosition::kSuffixLength = 28;
co... |
#include "sync/internal_api/public/base/unique_position.h"
#include "base/logging.h"
#include "base/stl_util.h"
#include "base/strings/string_number_conversions.h"
#include "sync/protocol/unique_position.pb.h"
#include "third_party/zlib/zlib.h"
namespace syncer {
const size_t UniquePosition::kSuffixLength = 28;
co... |
UniquePosition UniquePosition::Between(
const UniquePosition& before,
const UniquePosition& after,
const std::string& suffix) {
DCHECK(before.IsValid());
DCHECK(after.IsValid());
DCHECK(before.LessThan(after));
DCHECK(IsValidSuffix(suffix));
const std::string& mid =
FindBetweenWithSuffix(b... | UniquePosition UniquePosition::After(
const UniquePosition& x,
const std::string& suffix) {
DCHECK(IsValidSuffix(suffix));
DCHECK(x.IsValid());
const std::string& after = FindGreaterWithSuffix(x.bytes_, suffix);
return UniquePosition(after, suffix);
} | function_block-full_function | [] |
C++ | src/main.cpp | chhsgithub/PolygonExpand | 36e42bcd9a5dee09e028cf7024e49dd7f67517b4 | #include <iostream>
#include <Windows.h>
#include <vector>
#include <opencv2/opencv.hpp>
#define CVUI_IMPLEMENTATION
#include "cvui.h"
using namespace std;
using namespace cv;
#define WINDOW_NAME "Show"
bool clockwise(vector<Point> contour);
void expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, f... | #include <iostream>
#include <Windows.h>
#include <vector>
#include <opencv2/opencv.hpp>
#define CVUI_IMPLEMENTATION
#include "cvui.h"
using namespace std;
using namespace cv;
#define WINDOW_NAME "Show"
bool clockwise(vector<Point> contour);
void expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, f... |
void expand_polygon(vector<Point> &contour, vector<Point> &contour_exp, float range) {
if (clockwise(contour)) {
range = -range;
}
vector<Point2f> dpList, ndpList;
int count = contour.size();
for (int i = 0; i < count; i++) {
int next = (i == (count - 1) ? 0 : (i + 1));
dpList.push_back(contour.at(ne... | bool clockwise(vector<Point> contour)
{
int x_max = contour[0].x;
int index = 0;
for (int i = 1; i < contour.size(); i++) {
if (contour[i].x > x_max) {
x_max = contour[i].x;
index = i;
}
}
Point a, b, c;
if (index == 0) {
a = contour.back();
b = contour[0];
c = contour[1];
}
else if (index == co... | function_block-full_function | [
{
"content": "# PolygonExpand\n\nEnlarging or reducing the polygon with trackbar\n\n\n\n\n\n****\n\n\t\n\n|Author|chh|\n\n|---|---\n\n|E-mail|chhsemail@gmail.com\n\n\n\n\n\n****\n\n# Requirements\n\n- Cmake\n\n- OpenCV\n\n- CVUI\n",
"fi... |
C++ | sources/cpp/ecs/src/game/main.cpp | xunilrj/sandbox | f92c12f83433cac01a885585e41c02bb5826a01f | #include <deltaTime/deltaTime.h>
#include <TaskSystem/TaskSystem.h>
#include "../ecs/ecs.h"
struct PositionComponent
{
COMPONENTID(1, DenseStore<PositionComponent>);
float x, y, z;
};
struct RigidBodyComponent
{
COMPONENTID(2, DenseStore<RigidBodyComponent>);
float vx, vy, vz;
float ax, ay, az;
};
struct EulerI... | #include <deltaTime/deltaTime.h>
#include <TaskSystem/TaskSystem.h>
#include "../ecs/ecs.h"
struct PositionComponent
{
COMPONENTID(1, DenseStore<PositionComponent>);
float x, y, z;
};
struct RigidBodyComponent
{
COMPONENTID(2, DenseStore<RigidBodyComponent>);
float vx, vy, vz;
float ax, ay, az;
};
struct EulerI... |
};
#include <iostream>
#include <iomanip>
bool input_enabled = true;
void enable_input(Scene& s) { input_enabled = true; }
void disable_input(Scene& s) { input_enabled = false; }
void animA(Scene& scene, EntityRef ref)
{
scene.call(0);
auto anim1 = scene.build_anim()
.then(AnimManager::lerp(1, 0, 1))
.then(An... | l void update() override
{
foreach([](DeltaTimeComponent& time, PositionComponent& pos, RigidBodyComponent& rb) {
pos.x += rb.vx * time.dt;
pos.y += rb.vy;
pos.z += rb.vz;
rb.vx += rb.ax;
rb.vy += rb.ay;
rb.vz += rb.az;
});
} | function_block-function_prefixed | [
{
"content": "struct some_non_vectorizable_type { float x; };\n\n\n\nvoid test_first_aligned()\n\n{\n\n EIGEN_ALIGN16 float array_float[100];\n\n test_first_aligned_helper(array_float, 50);\n\n test_first_aligned_helper(array_float+1, 50);\n\n test_first_aligned_helper(array_float+2, 50);\n\n test_first_al... |
C++ | uarm/src/swiftpro_rviz_node2.cpp | iamrajee/ROS | c8b0f09db9624f4d06e86a0b0e12df4f0471ca86 | #include <string>
#include <ros/ros.h>
#include <std_msgs/String.h>
#include <swiftpro/SwiftproState.h>
#include <sensor_msgs/JointState.h>
#include <tf/transform_broadcaster.h>
#define MATH_PI 3.141592653589793238463
#define MATH_TRANS 57.2958
#define MATH_L1 106.6
#define MATH_L2 13.2
#define MAT... | #include <string>
#include <ros/ros.h>
#include <std_msgs/String.h>
#include <swiftpro/SwiftproState.h>
#include <sensor_msgs/JointState.h>
#include <tf/transform_broadcaster.h>
#define MATH_PI 3.141592653589793238463
#define MATH_TRANS 57.2958
#define MATH_L1 106.6
#define MATH_L2 13.2
#define MAT... | sqrtZX + 1 - MATH_UPPER_LOWER * MATH_UPPER_LOWER ) / (2 * sqrtZX);
angleLeft = acos(rightAll) * MATH_TRANS;
angleLeft = angleLeft + phi;
angleRight = angleRight - phi;
if (isnan(angleRot) || isnan(angleLeft) || isnan(angleRight))
return false;
angle[0] = angleRot;
angle[1] = angleLeft;
angle[2] = angleRig... | MATH_L2 - 56.55) / MATH_LOWER_ARM;
phi = atan(zIn / xIn) * MATH_TRANS;
sqrtZX = sqrt(zIn * zIn + xIn * xIn);
rightAll = (sqrtZX * sqrtZX + MATH_UPPER_LOWER * MATH_UPPER_LOWER - 1)
/ (2 * MATH_UPPER_LOWER * sqrtZX);
angleRight = acos(rightAll) * MATH_TRANS;
rightAll = (sqrtZX * | function_block-random_span | [
{
"content": " class DDDouble : virtual public DDParam {\n\n public:\n\n string getName() const;\n\n\n\n void prepGroup(Group &group);\n\n\n\n void prepConfig(Config &conf);\n\n\n\n void prepConfigDescription(ConfigDescription &conf_desc);\n\n\n\n int getLevel() const;\n... |
C++ | BZOJ/BZOJ1336.cpp | xehoth/OnlineJudgeCodes | 013d31cccaaa1d2b6d652c2f5d5d6cb2e39884a7 |
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
namespace IO {
inline char read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;
return... |
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
namespace IO {
inline char read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;
return... |
}
inline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }
}
namespace Task {
const int MAXN = 100005;
const double EPS = 1e-8;
template <typename T>
inline T square(const T &x) {
return x * x;
}
struct Point {
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
inline double dis... | if (x == 0) {
print('0');
} else {
x < 0 ? (print('-'), x = -x) : 0;
for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;
while (cnt) print((char)buf[cnt--]);
} | if_condition | [
{
"content": "struct PriorityQueue : public std::map<int, int, std::greater<int> > {\n\n typedef std::map<int, int, std::greater<int> > super;\n\n\n\n inline void push(int x) { super::operator[](x)++; }\n\n\n\n inline void erase(int x) {\n\n super::iterator it = super::find(x);\n\n if (it... |
C++ | src/termination_check_base.cpp | kuri-kustar/victim_localization | b5b0b8f2915d9805372a1d8c4809991b6d63c1b5 | #include "victim_localization/termination_check_base.h"
TerminationCheckBase::TerminationCheckBase()
{
ros::param::param<int>("~termination_repeat_window_size", repeat_window_size_, 8);
ros::param::param<std::string>("~SaveDataFolder",saveFolder, std::string("Data"));
result_status="Success";
}
bool Termination... | #include "victim_localization/termination_check_base.h"
TerminationCheckBase::TerminationCheckBase()
{
ros::param::param<int>("~termination_repeat_window_size", repeat_window_size_, 8);
ros::param::param<std::string>("~SaveDataFolder",saveFolder, std::string("Data"));
result_status="Success";
}
bool Termination... | tion)=1-inputMap.atPosition(Input,position);
}
GridMapCvConverter::toImage<unsigned char, 4>(upscaledMap, Output, CV_8UC4, minValue, maxValue, image);
return image;
}
| << "Unable to open PATH.txt file";
cv::Mat occupancyImage;
grid_map::GridMap gridMap;
Victim_Map_Base *Map_=view_evaluator->mapping_module_;
double upscale_factor=32;
double upscale_resolution= Map_->map_resol/upscale_factor;
std::string mapName= "SaveOccupancy";
gridMap.setGeometry(Map_->map.getL... | random | [
{
"content": "class ReactivePathPlanner : public navigationBase\n\n{\n\npublic:\n\n ReactivePathPlanner(const ros::NodeHandle &nh, const ros::NodeHandle &nh_private, volumetric_mapping::OctomapManager *manager);\n\n\n\n sspp::sspp_srv planningService;\n\n ReactivePlannerServer *reactivePlannerServer;\n\n\n\n... |
C++ | fin_control/src/fin_control.cpp | ChrisScianna/ROS-Underwater-RnD | f928bcc6b19a830b98e2cc2aedd65ff35b887901 |
#include "fin_control/fin_control.h"
#include <string>
#include <diagnostic_tools/message_stagnation_check.h>
#include <diagnostic_tools/periodic_message_status.h>
namespace qna
{
namespace robot
{
FinControl::FinControl(ros::NodeHandle &nodeHandle)
: nodeHandle(nodeHandle), diagnosticsUpdater(nodeHandle)
{
... |
#include "fin_control/fin_control.h"
#include <string>
#include <diagnostic_tools/message_stagnation_check.h>
#include <diagnostic_tools/periodic_message_status.h>
namespace qna
{
namespace robot
{
FinControl::FinControl(ros::NodeHandle &nodeHandle)
: nodeHandle(nodeHandle), diagnosticsUpdater(nodeHandle)
{
... |
float FinControl::degreesToRadians(float degrees) { return ((degrees / 180.0) * M_PI); }
void FinControl::handleSetAngles(const fin_control::SetAngles::ConstPtr &msg)
{
const char *log;
float angle_plus_offset;
for (int i = 0; i < 4; i++)
{
if (fabs(msg->fin_angle_in_radians[i]) > maxCtrlFinAngle)
... | t>(
round(((radianAngleFromMyWorkBench / ctrlFinScaleFactor) - ctrlFinOffset) *
100.0) /
100.0));
finAngleCheck.test(message.angles_in_radians.back());
}
else
{
servos_angles_info_complete = false;
ROS_ERROR("Could not get servo angle for ID %d %s", id, log);
... | function_block-function_prefixed | [
{
"content": "class IntrospectableNode<BaseNodeT, true> : public BaseNodeT\n\n{\n\n public:\n\n IntrospectableNode(const std::string& name, const BT::NodeConfiguration& config)\n\n : BaseNodeT(name), blackboard_(config.blackboard)\n\n {\n\n }\n\n\n\n BT::NodeStatus executeTick() override\n\n {\n\n ... |
C++ | Source/UnitUtil.cpp | biug/XBot | 20f51094ee18aeaa58d769a894c68b4f05f900d4 | #include "UnitUtil.h"
using namespace XBot;
bool UnitUtil::IsMorphedBuildingType(BWAPI::UnitType type)
{
return
type == BWAPI::UnitTypes::Zerg_Sunken_Colony ||
type == BWAPI::UnitTypes::Zerg_Spore_Colony ||
type == BWAPI::UnitTypes::Zerg_Lair ||
type == BWAPI::UnitTypes::Zerg_Hive ||
type == BWAPI::UnitTyp... | #include "UnitUtil.h"
using namespace XBot;
bool UnitUtil::IsMorphedBuildingType(BWAPI::UnitType type)
{
return
type == BWAPI::UnitTypes::Zerg_Sunken_Colony ||
type == BWAPI::UnitTypes::Zerg_Spore_Colony ||
type == BWAPI::UnitTypes::Zerg_Lair ||
type == BWAPI::UnitTypes::Zerg_Hive ||
type == BWAPI::UnitTyp... |
int UnitUtil::GetCompletedUnitCount(BWAPI::UnitType type)
{
int count = 0;
for (const auto unit : BWAPI::Broodwar->self()->getUnits())
{
if (unit->getType() == type && unit->isCompleted())
{
count++;
}
}
return count;
} | rg_Egg && unit->getBuildType() == type)
{
count += type.isTwoUnitsInOneEgg() ? 2 : 1;
}
if (unit->getRemainingTrainTime() > 0)
{
BWAPI::UnitType trainType = unit->getLastCommand().getUnitType();
if (trainType == type && unit->getRemainingTra... | function_block-function_prefixed | [
{
"content": "// Unit choices for main unit mix and tech target.\n\n// This deliberately omits support units like queens and defilers.\n\nenum class TechUnit : int\n\n\t{ None\n\n\t, Zerglings\n\n\t, Hydralisks\n\n\t, Lurkers\n\n\t, Mutalisks\n\n\t, Ultralisks\n\n\t, Guardians\n\n\t, Devourers\n\n\t, Size\n\n};... |
C++ | wrappers/8.1.1/vtkSPHQuinticKernelWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 |
#define VTK_WRAPPING_CXX
#define VTK_STREAMS_FWD_ONLY
#include <nan.h>
#include "vtkSPHKernelWrap.h"
#include "vtkSPHQuinticKernelWrap.h"
#include "vtkObjectBaseWrap.h"
#include "vtkAbstractPointLocatorWrap.h"
#include "vtkDataSetWrap.h"
#include "vtkPointDataWrap.h"
#include "../../plus/plus.h"
using namespace v8;... |
#define VTK_WRAPPING_CXX
#define VTK_STREAMS_FWD_ONLY
#include <nan.h>
#include "vtkSPHKernelWrap.h"
#include "vtkSPHQuinticKernelWrap.h"
#include "vtkObjectBaseWrap.h"
#include "vtkAbstractPointLocatorWrap.h"
#include "vtkDataSetWrap.h"
#include "vtkPointDataWrap.h"
#include "../../plus/plus.h"
using namespace v8;... | et(wo);
return;
}
Nan::ThrowError("Parameter mismatch");
}
| WRAP_INITPTPL
#endif
ptpl.Reset( tpl );
}
void VtkSPHQuinticKernelWrap::New(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
if(!info.IsConstructCall())
{
Nan::ThrowError("Constructor not called in a construct call.");
return;
}
if(info.Length() == 0)
{
vtkSmartPointer<vtkSPHQuinticKernel> native = vtk... | random | [] |
C++ | Engine/qxtcheckcombobox.cpp | vadkasevas/BAS | 657f62794451c564c77d6f92b2afa9f5daf2f517 |
#include "qxtcheckcombobox.h"
#include <QKeyEvent>
#include <QDebug>
#include <QStylePainter>
bool QxtCheckComboBox::eventFilter(QObject* receiver, QEvent* event)
{
if(event->type() == QEvent::MouseButtonPress && receiver == Edit)
{
if(Edit->underMouse())
{
showPopup();
}
... |
#include "qxtcheckcombobox.h"
#include <QKeyEvent>
#include <QDebug>
#include <QStylePainter>
bool QxtCheckComboBox::eventFilter(QObject* receiver, QEvent* event)
{
if(event->type() == QEvent::MouseButtonPress && receiver == Edit)
{
if(Edit->underMouse())
{
showPopup();
}
... |
QxtCheckComboBox::~QxtCheckComboBox()
{
}
void QxtCheckComboBox::hidePopup()
{
if (containerMousePress)
{
QComboBox::hidePopup();
}
}
void QxtCheckComboBox::showPopup()
{
QComboBox::showPopup();
}
Qt::CheckState QxtCheckComboBox::itemCheckState(int index) const
{
return static_cast<Qt::C... | setInsertPolicy(QComboBox::NoInsert);
view()->installEventFilter(this);
view()->window()->installEventFilter(this);
view()->viewport()->installEventFilter(this);
this->installEventFilter(this);
} | function_block-function_prefix_line | [
{
"content": "var Index = GetInputConstructorValue(\"Index\", loader);\n",
"file_path": "Modules/List/js/get_list_element_by_index_select.js",
"rank": 0,
"score": 107529.92272205185
},
{
"content": "class DatabaseAdminItemEdit;\n\n}\n\nusing namespace BrowserAutomationStudioFramework;\n",
... |
C++ | wrappers/src/object-store/tests/results.cpp | drungrin/realm-dotnet | ebf18e8493fc730bfef694957a00b7890fc360c8 | #include "catch.hpp"
#include "util/test_file.hpp"
#include "impl/realm_coordinator.hpp"
#include "object_schema.hpp"
#include "property.hpp"
#include "results.hpp"
#include "schema.hpp"
#include <realm/commit_log.hpp>
#include <realm/group_shared.hpp>
#include <realm/link_view.hpp>
using namespace realm;
TEST_CAS... | #include "catch.hpp"
#include "util/test_file.hpp"
#include "impl/realm_coordinator.hpp"
#include "object_schema.hpp"
#include "property.hpp"
#include "results.hpp"
#include "schema.hpp"
#include <realm/commit_log.hpp>
#include <realm/group_shared.hpp>
#include <realm/link_view.hpp>
using namespace realm;
TEST_CAS... | ();
REQUIRE(notification_calls == 1);
}
SECTION("modifications from multiple transactions are collapsed") {
r->begin_transaction();
table->set_int(0, 0, 0);
r->commit_transaction();
r->begin_transaction();
table->set_int(0, 1, 0);... | r->read_group()->get_table("class_linking object")->add_empty_row();
r->commit_transaction();
REQUIRE(notification_calls == 1);
coordinator->on_change();
r->notify();
REQUIRE(notification_calls == 2);
}
SECTION("modifying a an unrelated ... | random | [
{
"content": "struct ValueGetter<Int, TableGetter> {\n\n static Int convert(TableGetter&&, const parser::Expression & value, Arguments &args)\n\n {\n\n if (value.type == parser::Expression::Type::Argument) {\n\n return args.long_for_argument(stot<int>(value.s));\n\n }\n\n r... |
C++ | dev/Code/Tools/RC/ResourceCompilerPC/CGA/ControllerPQ.cpp | crazyskateface/lumberyard | 164512f8d415d6bdf37e195af319ffe5f96a8f0b |
#include "stdafx.h"
#include "AnimationLoader.h"
#include "AnimationManager.h"
#include "Wavelets/Compression.h"
#include <float.h>
namespace ControllerHelper
{
uint32 GetPositionsFormatSizeOf(uint32 format)
{
switch (format)
{
case eNoCompress:
case eNoCompressVec3:
... |
#include "stdafx.h"
#include "AnimationLoader.h"
#include "AnimationManager.h"
#include "Wavelets/Compression.h"
#include <float.h>
namespace ControllerHelper
{
uint32 GetPositionsFormatSizeOf(uint32 format)
{
switch (format)
{
case eNoCompress:
case eNoCompressVec3:
... | ation;
case eByte:
return new ByteKeyTimesInformation;
case eBitset:
return new CKeyTimesInformationBitSet;
}
return 0;
}
const uint8 m_byteLowBit[byteArraySize] _ALIGN(16) = {
8,... | h (format)
{
case eF32:
return sizeof(float);
case eUINT16:
return sizeof(uint16);
case eByte:
return sizeof(uint8);
case eF32StartStop:
return sizeof(float);
case eUINT16StartStop:
return sizeof(uint16);
... | random | [] |
C++ | qtmultimedia/src/plugins/gstreamer/camerabin/camerabinrecorder.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 |
#include "camerabinrecorder.h"
#include "camerabincontrol.h"
#include "camerabinresourcepolicy.h"
#include "camerabinaudioencoder.h"
#include "camerabinvideoencoder.h"
#include "camerabincontainer.h"
#include <QtCore/QDebug>
QT_BEGIN_NAMESPACE
CameraBinRecorder::CameraBinRecorder(CameraBinSession *session)
:QMe... |
#include "camerabinrecorder.h"
#include "camerabincontrol.h"
#include "camerabinresourcepolicy.h"
#include "camerabinaudioencoder.h"
#include "camerabinvideoencoder.h"
#include "camerabincontainer.h"
#include <QtCore/QDebug>
QT_BEGIN_NAMESPACE
CameraBinRecorder::CameraBinRecorder(CameraBinSession *session)
:QMe... |
}
if (m_state != oldState)
emit stateChanged(m_state);
if (m_status != oldStatus)
emit statusChanged(m_status);
}
bool CameraBinRecorder::isMuted() const
{
return m_session->isMuted();
}
qreal CameraBinRecorder::volume() const
{
return 1.0;
}
void CameraBinRecorder::setMuted(bo... | if (m_session->status() != QCamera::ActiveStatus) {
emit error(QMediaRecorder::ResourceError, tr("Service has not been started"));
} else if (!m_session->cameraControl()->resourcePolicy()->canCapture()) {
emit error(QMediaRecorder::ResourceError, tr("Recording permissions are not availab... | if_condition | [] |
C++ | camera/hal/test/v4l2/src/pipeline_test.cpp | openharmony-gitee-mirror/drivers_peripheral | 4ee6d41befdf54a97afeb5838be5fcd0b4888d56 |
#include "pipeline_test.h"
void UtestPipelineTest::SetUpTestCase(void)
{}
void UtestPipelineTest::TearDownTestCase(void)
{}
void UtestPipelineTest::SetUp(void)
{
if (display_ == nullptr)
display_ = std::make_shared<TestDisplay>();
display_->FBInit();
display_->Init();
}
void UtestPipelineTest::TearDow... |
#include "pipeline_test.h"
void UtestPipelineTest::SetUpTestCase(void)
{}
void UtestPipelineTest::TearDownTestCase(void)
{}
void UtestPipelineTest::SetUp(void)
{
if (display_ == nullptr)
display_ = std::make_shared<TestDisplay>();
display_->FBInit();
display_->Init();
}
void UtestPipelineTest::TearDow... |
TEST_F(UtestPipelineTest, camera_ppl_0002)
{
std::cout << "==========[test log] Check ppl: preview + capture success." << std::endl;
display_->AchieveStreamOperator();
display_->intents = {Camera::PREVIEW, Camera::STILL_CAPTURE};
display_->StartStream(display_->intents);
display_->S... | TEST_F(UtestPipelineTest, camera_ppl_0001)
{
std::cout << "==========[test log] Check ppl: preview success." << std::endl;
display_->AchieveStreamOperator();
display_->intents = {Camera::PREVIEW};
display_->StartStream(display_->intents);
display_->StartCapture(display_->streamId_prev... | function_block-full_function | [
{
"content": "struct IWiFi *g_wifi = nullptr;\n\nconst int32_t WLAN_TX_POWER = 160;\n\nconst uint32_t WLAN_MIN_CHIPID = 0;\n\nconst uint32_t WLAN_MAX_CHIPID = 2;\n\nconst uint32_t IFNAME_MIN_NUM = 0;\n\nconst uint32_t IFNAME_MAX_NUM = 32;\n\nconst uint32_t MAX_IF_NAME_LENGTH = 16;\n\nconst uint32_t SIZE = 4;\n\... |
C++ | src/type3_AndroidCloud/anbox-master/external/process-cpp-minimal/src/core/posix/child_process.cpp | akraino-edge-stack/iec | b01bce6165ef8368a607e17e1f3d4697b79db31b |
#include <core/posix/child_process.h>
#ifndef ANDROID
#include <boost/iostreams/device/file_descriptor.hpp>
#include <boost/iostreams/stream.hpp>
#endif
#include <atomic>
#include <fstream>
#include <mutex>
#include <unordered_map>
#include <fcntl.h>
#include <poll.h>
#include <unistd.h>
#include <sys/eventfd.h>
... |
#include <core/posix/child_process.h>
#ifndef ANDROID
#include <boost/iostreams/device/file_descriptor.hpp>
#include <boost/iostreams/stream.hpp>
#endif
#include <atomic>
#include <fstream>
#include <mutex>
#include <unordered_map>
#include <fcntl.h>
#include <poll.h>
#include <unistd.h>
#include <sys/eventfd.h>
... |
bool add(const core::posix::ChildProcess& process) override
{
if (process.pid() == -1)
return false;
std::lock_guard<std::mutex> lg(guard);
bool added = false;
auto new_process = std::make_pair(process.pid(), process);
std::tie(std::ignore, added) = childr... | DeathObserverImpl(const std::shared_ptr<core::posix::SignalTrap>& trap)
: on_sig_child_connection
{
trap->signal_raised().connect([this](core::posix::Signal signal)
{
switch (signal)
{
case core::posix::Signal::sig_chld:... | function_block-full_function | [
{
"content": "struct CORE_POSIX_DLL_PUBLIC Stat\n\n{\n\n pid_t pid = 1; ///< The process ID\n\n std::string executable; ///< The filename of the executable, in parentheses.\n\n State state = State::undefined; ///< State of the process.\n\n pid_t parent = -1; ///< The PID of the parent.\n\n pid_t ... |
C++ | gmsh/Mesh/meshGRegionCarveHole.cpp | Poofee/fastFEM | 14eb626df973e2123604041451912c867ab7188c |
#include <set>
#include "GmshConfig.h"
#include "GmshMessage.h"
#include "GModel.h"
#include "MTriangle.h"
#include "MQuadrangle.h"
#include "MTetrahedron.h"
#include "MHexahedron.h"
#include "MPrism.h"
#include "MPyramid.h"
#if !defined(HAVE_ANN)
void carveHole(GRegion *gr, int num, double distance,
... |
#include <set>
#include "GmshConfig.h"
#include "GmshMessage.h"
#include "GModel.h"
#include "MTriangle.h"
#include "MQuadrangle.h"
#include "MTetrahedron.h"
#include "MHexahedron.h"
#include "MPrism.h"
#include "MPyramid.h"
#if !defined(HAVE_ANN)
void carveHole(GRegion *gr, int num, double distance,
... | ;
}
}
#endif
| gf->quadrangles.push_back(
new MQuadrangle(it->getVertex(0), it->getVertex(1), it->getVertex(2),
it->getVertex(3))) | call_expression | [
{
"content": "class GFace;\n",
"file_path": "gmsh/Mesh/meshGFace.h",
"rank": 0,
"score": 346488.86100550985
},
{
"content": "class GFace;\n\n\n\nvoid meshGFaceBamg(GFace *gf);\n\n\n\n#endif\n",
"file_path": "gmsh/Mesh/meshGFaceBamg.h",
"rank": 1,
"score": 339593.6655204776
},
... |
C++ | Clients/OIViewer/ConfigurationLoader.cpp | OpenImageViewer/OIV | 7b2b67ea156255bf77819ce77bf687c9d360e217 | #include "ConfigurationLoader.h"
#include <LLUtils/FileHelper.h>
#include <LLUtils/PlatformUtility.h>
#include <LLUtils/Exception.h>
#include <LLUtils/Logging/Logger.h>
#include <nlohmann/json.hpp>
#include <stack>
namespace OIV
{
ConfigurationLoader::CommandGroupList ConfigurationLoader::LoadCommandGroups()
{
usi... | #include "ConfigurationLoader.h"
#include <LLUtils/FileHelper.h>
#include <LLUtils/PlatformUtility.h>
#include <LLUtils/Exception.h>
#include <LLUtils/Logging/Logger.h>
#include <nlohmann/json.hpp>
#include <stack>
namespace OIV
{
|
ConfigurationLoader::KeyBindingList ConfigurationLoader::LoadKeyBindings()
{
using namespace nlohmann;
using namespace LLUtils;
std::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT("./Resources/Configuration/KeyBindings.json"));
auto jsonObject = jso... | ConfigurationLoader::CommandGroupList ConfigurationLoader::LoadCommandGroups()
{
using namespace nlohmann;
using namespace LLUtils;
std::string jsonText = File::ReadAllText<std::string>(LLUtils::PlatformUtility::GetExeFolder() + LLUTILS_TEXT("./Resources/Configuration/Commands.json"));
auto jsonObject = json:... | function_block-full_function | [
{
"content": "namespace OIV\n\n{\n\n struct SelectionRect\n\n {\n\n LLUtils::PointI32 p0;\n\n LLUtils::PointI32 p1;\n\n };\n\n\n\n struct ViewParameters\n\n {\n\n LLUtils::PointI32 uViewportSize;\n\n LLUtils::Color uTransparencyColor1;\n\n LLUtils::Color uTransp... |
C++ | dependencies/PyMesh/tools/MeshUtils/DegeneratedTriangleRemoval.cpp | aprieels/3D-watermarking-spectral-decomposition | dcab78857d0bb201563014e58900917545ed4673 | #include "DegeneratedTriangleRemoval.h"
#include <cassert>
#include <iostream>
#include <limits>
#include <set>
#include <vector>
#include <Math/MatrixUtils.h>
#include <MeshUtils/FaceUtils.h>
#include <MeshUtils/IsolatedVertexRemoval.h>
#include <MeshUtils/ShortEdgeRemoval.h>
#include <Predicates/predicates.h>
usin... | #include "DegeneratedTriangleRemoval.h"
#include <cassert>
#include <iostream>
#include <limits>
#include <set>
#include <vector>
#include <Math/MatrixUtils.h>
#include <MeshUtils/FaceUtils.h>
#include <MeshUtils/IsolatedVertexRemoval.h>
#include <MeshUtils/ShortEdgeRemoval.h>
#include <Predicates/predicates.h>
usin... |
}
assert(fj_opp_v != INVALID);
const size_t vj_opp = neighbor_face[fj_opp_v];
const size_t vj_0 = neighbor_face[(fj_opp_v+1)%3];
const size_t vj_1 = neighbor_face[(fj_opp_v+2)%3];
new_faces.push_back(Vector3I(vi_opp, vj_opp, vj_0));
ne... | if (neighbor_face[i] != vi_0 && neighbor_face[i] != vi_1) {
fj_opp_v = i;
break;
} | if_condition | [
{
"content": "struct RemoveConst<const T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n\n\n#if defined(_MSC_VER) && _MSC_VER < 1400\n\n// This is the only specialization that allows VC++ 7.1 to remove const in\n\n// 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC\n... |
C++ | Sandbox/src/Sandbox2D.cpp | SunHailang/Hazel | 1b4784c8d6bd2ad402ded34d677fd482a81a9d72 | #include "Sandbox2D.h"
#include <imgui/imgui.h>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
static const char* s_MapTiles = "lajksdasd";
Sandbox2D::Sandbox2D()
:Hazel::Layer("Sandbox2D"), m_CameraController(1280.0f / 720.0f, true)
{
}
void Sandbox2D::OnAttach()
{
H... | #include "Sandbox2D.h"
#include <imgui/imgui.h>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
static const char* s_MapTiles = "lajksdasd";
Sandbox2D::Sandbox2D()
:Hazel::Layer("Sandbox2D"), m_CameraController(1280.0f / 720.0f, true)
{
}
void Sandbox2D::OnAttach()
{
H... | tWindow().GetWidth();
auto height = Hazel::Application::Get().GetWindow().GetHeight();
auto bounds = m_CameraController.GetBounds();
auto pos = m_CameraController.GetCamera().GetPosition();
x = (x / width) * bounds.GetWidth() - bounds.GetWidth() * 0.5f;
y = bounds.GetHeight() * 0.5f - (y / height) * ... | OnUpdate(ts);
Hazel::Renderer2D::ResetStats();
{
HZ_PROFILE_SCOPE("Renderer Prep");
Hazel::RendererCommand::SetClearColor(glm::vec4(0.2f, 0.2f, 0.2f, 1.0f));
Hazel::RendererCommand::Clear();
}
{
}
if (Hazel::Input::IsMouseButtonPres... | random | [
{
"content": "#include \"hzpch.h\"\n\n#include \"OpenGLFramebuffer.h\"\n\n\n\n#include <glad/glad.h>\n\n\n\nnamespace Hazel\n\n{\n\n\n\n\tstatic const uint32_t s_MaxFramebufferSize = 8192;\n\n\n\n\tnamespace Utils {\n\n\n\n\t\tstatic GLenum TextureTarget(bool multisampled)\n\n\t\t{\n\n\t\t\treturn multisampled ... |
C++ | src/vm/vm_detect.cpp | bouldev/libbouldev | afe0d5dca71d4f9c94b11273c4884a92f2549df8 |
#include <libbouldev.h>
#include <string>
#ifdef _WIN32
#include "stdafx.h"
#include <iostream>
#include <Wbemidl.h>
#pragma comment(lib, "wbemuuid.lib")
#endif
#ifdef _WIN32
static
bool InitWMI(IWbemServices **pSvc, IWbemLocator **pLoc, const TCHAR* szNetworkResource)
{
HRESULT hres;
hres = CoInitializeEx(0, COIN... |
#include <libbouldev.h>
#include <string>
#ifdef _WIN32
#include "stdafx.h"
#include <iostream>
#include <Wbemidl.h>
#pragma comment(lib, "wbemuuid.lib")
#endif
#ifdef _WIN32
static
bool InitWMI(IWbemServices **pSvc, IWbemLocator **pLoc, const TCHAR* szNetworkResource)
{
HRESULT hres;
hres = CoInitializeEx(0, COIN... |
static
int wmi_query_count(const _TCHAR* query)
{
IWbemServices *pSvc = NULL;
IWbemLocator *pLoc = NULL;
IEnumWbemClassObject* pEnumerator = NULL;
BOOL bStatus = FALSE;
HRESULT hRes;
int count = 0;
bStatus = InitWMI(&pSvc, &pLoc, _T("ROOT\\CIMV2"));
if (bStatus)
{
bStatus =... | cString(szQuery);
BOOL bQueryResult = TRUE;
if (strQueryLanguage && strQuery) HRESULT hres = (*pSvc)->ExecQuery(strQueryLanguage, strQuery, WBEM_FLAG_FORWARD_ONLY | WBEM_FLAG_RETURN_IMMEDIATELY, NULL, pEnumerator);
if (strQueryLanguage) SysFreeString(strQueryLanguage);
if (strQuery) SysFreeString(strQuery);
return... | function_block-function_prefixed | [
{
"content": "\tchar *out; // stdout buffer\n",
"file_path": "src/common/libbouldev_private.h",
"rank": 6,
"score": 1.5771744743371818
}
] |
C++ | argos3/src/plugins/robots/generic/simulator/radios_default_sensor.cpp | yiftachn/krembot_sim_fork | d3d1b050f9fff4c96bded298eadde5a9ca4dab6b |
#include "radios_default_sensor.h"
#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>
namespace argos {
CRadiosDefaultSensor::CRadiosDefaultSensor() :
m_pcRadioEquippedEntity(nullptr),
m_pcControllableEntity(nullptr),
m_bShowRays(false) {}
void CRadiosDef... |
#include "radios_default_sensor.h"
#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>
namespace argos {
CRadiosDefaultSensor::CRadiosDefaultSensor() :
m_pcRadioEquippedEntity(nullptr),
m_pcControllableEntity(nullptr),
m_bShowRays(false) {}
void CRadiosDef... |
REGISTER_SENSOR(CRadiosDefaultSensor,
"radios", "default",
"Michael Allwright [allsey87@gmail.com]",
"1.0",
"A generic radio sensor to receive messages from nearby radios.",
"This radio sensor implementation al... | CRadiosDefaultSensor::Reset() {
for(SInterface& s_interface : m_vecInterfaces) {
s_interface.Data.clear();
}
} | function_block-function_prefixed | [
{
"content": " class CRadiosDefaultSensor;\n\n}\n\n\n\n#include <argos3/core/simulator/sensor.h>\n\n#include <argos3/plugins/robots/generic/control_interface/ci_radios_sensor.h>\n\n#include <argos3/plugins/simulator/entities/radio_equipped_entity.h>\n\n\n\nnamespace argos {\n\n\n",
"file_path": "argos3/sr... |
C++ | Studio/src/Application/Groom/GroomTool.cc | amylenz/ShapeWorks | 78c2ee067a23e31f5b83d0121e60addb1b0bf462 | #include <iostream>
#include <QXmlStreamWriter>
#include <QTemporaryFile>
#include <QFileDialog>
#include <QMessageBox>
#include <QThread>
#include <Groom/GroomTool.h>
#include <Visualization/ShapeworksWorker.h>
#include <Data/Project.h>
#include <Data/Mesh.h>
#include <Data/Shape.h>
#include <ui_GroomTool.h>
Groom... | #include <iostream>
#include <QXmlStreamWriter>
#include <QTemporaryFile>
#include <QFileDialog>
#include <QMessageBox>
#include <QThread>
#include <Groom/GroomTool.h>
#include <Visualization/ShapeworksWorker.h>
#include <Data/Project.h>
#include <Data/Mesh.h>
#include <Data/Shape.h>
#include <ui_GroomTool.h>
|
GroomTool::~GroomTool()
{}
void GroomTool::on_antialias_checkbox_stateChanged(int state)
{
this->ui_->antialias_groupbox->setEnabled(state);
}
void GroomTool::on_blur_checkbox_stateChanged(int state)
{
this->ui_->blur_groupbox->setEnabled(state);
}
void GroomTool::on_autopad_checkbox_stateChanged(int state)
{
... | GroomTool::GroomTool(Preferences& prefs, std::vector<std::string>& files)
: preferences_(prefs), files_(files)
{
this->ui_ = new Ui_GroomTool;
this->ui_->setupUi(this);
qRegisterMetaType<std::string>();
} | function_block-full_function | [
{
"content": "// Constrained Delaunay Triangulation types\n\n#include <CGAL/Constrained_Delaunay_triangulation_2.h>\n\n#include <CGAL/Constrained_triangulation_plus_2.h>\n\n\n\n// Axis-align boxes for all-pairs self-intersection detection\n\n#include <CGAL/point_generators_3.h>\n\n#include <CGAL/Bbox_3.h>\n\n#i... |
C++ | owGame/M2/M2_AnimatorComponent.cpp | Chaos192/OpenWow | 1d91a51fafeedadc67122a3e9372ec4637a48434 | #include "stdafx.h"
#include "M2.h"
#include "M2_Base_Instance.h"
#include "M2_AnimatorComponent.h"
CM2AnimatorComponent::CM2AnimatorComponent(const CM2_Base_Instance& OwnerNode)
: CSceneNodeComponentBase(OwnerNode)
, m_CurrentAnimationID(EAnimationID::Stand)
, m_CurrentAnimation(nullptr)
, m_IsLoop(false)
... | #include "stdafx.h"
#include "M2.h"
#include "M2_Base_Instance.h"
#include "M2_AnimatorComponent.h"
CM2AnimatorComponent::CM2AnimatorComponent(const CM2_Base_Instance& OwnerNode)
: CSceneNodeComponentBase(OwnerNode)
, m_CurrentAnimationID(EAnimationID::Stand)
, m_CurrentAnimation(nullptr)
, m_IsLoop(false)
... |
const CM2_Base_Instance & CM2AnimatorComponent::GetM2OwnerNode() const
{
return dynamic_cast<const CM2_Base_Instance&>(GetOwnerNode());
}
| void CM2AnimatorComponent::Update(const UpdateEventArgs & e)
{
if (m_CurrentAnimation == nullptr)
return;
if (m_IsStopped)
return;
m_AnimTime += e.DeltaTime;
m_CurrentTime = m_CurrentAnimation->getStart() + static_cast<uint32>(m_AnimTime);
if (m_CurrentTime < m_CurrentAnimation->getEnd())
{
return;
}
... | function_block-full_function | [
{
"content": "enum Opcodes : uint16\n\n{\n\n\tNULL_ACTION = 0x000,\n\n\tCMSG_BOOTME = 0x001,\n\n\tCMSG_DBLOOKUP = 0x002,\n\n\tSMSG_DBLOOKUP = 0x003,\n\n\tCMSG_QUERY_OBJECT_POSITION = 0x004,\n\n\tSMSG_QUERY_OBJECT_POSITION = 0x005,\n\n\tCMSG_QUERY_OBJECT_ROTATION = 0x006,\n\n\tSMSG_QUERY_OBJECT_ROTATION = 0x007,... |
C++ | src/mame/audio/dsbz80.cpp | Robbbert/messui | 49b756e2140d8831bc81335298ee8c5471045e79 |
#include "emu.h"
#include "audio/dsbz80.h"
#include "machine/clock.h"
#define Z80_TAG "mpegcpu"
void dsbz80_device::dsbz80_map(address_map &map)
{
map(0x0000, 0x7fff).rom().region(":mpegcpu", 0);
map(0x8000, 0xffff).ram();
}
void dsbz80_device::dsbz80io_map(address_map &map)
{
map.global_mask(0xff);
map(0xe0, ... |
#include "emu.h"
#include "audio/dsbz80.h"
#include "machine/clock.h"
#define Z80_TAG "mpegcpu"
void dsbz80_device::dsbz80_map(address_map &map)
{
map(0x0000, 0x7fff).rom().region(":mpegcpu", 0);
map(0x8000, 0xffff).ram();
}
void dsbz80_device::dsbz80io_map(address_map &map)
{
map.global_mask(0xff);
map(0xe0, ... | ampindex++;
break;
}
audio_pos++;
samples--;
}
if(!samples)
{
break;
}
if(mp_state == 0)
{
out_l.fill(0, sampindex);
out_r.fill(0, sampindex);
break;
}
else
{
int sample_rate, channel_count;
bool ok = decoder->decode_buffer(mp_pos, mp_end*8, audio_buf, audio_avail, s... | break;
case 2:
out_l.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);
out_r.put_int(sampindex, audio_buf[audio_pos*2+1], 32768);
s | random | [] |
C++ | Charts/Core/Testing/Cxx/TestPlotBarRangeHandlesItem.cxx | cclauss/VTK | f62a52cce9044159efb4adb7cc0cfd7ec0bc8b6d | #include <vtkAxis.h>
#include <vtkChartXY.h>
#include <vtkContextInteractorStyle.h>
#include <vtkContextScene.h>
#include <vtkIntArray.h>
#include <vtkInteractorEventRecorder.h>
#include <vtkNew.h>
#include <vtkPlotBar.h>
#include <vtkPlotBarRangeHandlesItem.h>
#include <vtkRenderWindow.h>
#include <vtkRenderWindowInte... | #include <vtkAxis.h>
#include <vtkChartXY.h>
#include <vtkContextInteractorStyle.h>
#include <vtkContextScene.h>
#include <vtkIntArray.h>
#include <vtkInteractorEventRecorder.h>
#include <vtkNew.h>
#include <vtkPlotBar.h>
#include <vtkPlotBarRangeHandlesItem.h>
#include <vtkRenderWindow.h>
#include <vtkRenderWindowInte... | ventSpy[event] = 0;
}
++this->EventSpy[event];
std::cout << "InvokedEvent: " << event << this->EventSpy[event] << std::endl;
}
std::map<unsigned long, int> EventSpy;
double Range[2];
};
int TestPlotBarRangeHandlesItem(int, char*[])
{
vtkNew<vtkTable> table;
vtkNew<vtkIntArray> arrMonth;
arrMon... | andlesItem::SafeDownCast(caller);
if (!self)
{
return;
}
if (event == vtkCommand::EndInteractionEvent)
{
self->GetHandlesRange(this->Range);
}
if (this->EventSpy.count(event) == 0)
{
this->E | random | [] |
C++ | uuv_gazebo_plugins/uuv_gazebo_ros_plugins/src/ThrusterROSPlugin.cpp | MoMagDii/VAUV-simulator | 56f55f9349e38e0a327a40feb5a437fcad511b00 |
#include <uuv_gazebo_ros_plugins/ThrusterROSPlugin.h>
#include <string>
#include <gazebo/physics/Base.hh>
#include <gazebo/physics/Link.hh>
#include <gazebo/physics/Model.hh>
#include <gazebo/physics/World.hh>
#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>
namespace uuv_simulator_ros
{
ThrusterROSP... |
#include <uuv_gazebo_ros_plugins/ThrusterROSPlugin.h>
#include <string>
#include <gazebo/physics/Base.hh>
#include <gazebo/physics/Link.hh>
#include <gazebo/physics/Model.hh>
#include <gazebo/physics/World.hh>
#include <uuv_gazebo_ros_plugins_msgs/msg/float_stamped.hpp>
namespace uuv_simulator_ros
{
ThrusterROSP... | ;
myPubThrust = myRosNode->create_publisher<
uuv_gazebo_ros_plugins_msgs::msg::FloatStamped
>(this->thrustTopicPublisher->GetTopic(), 10);
myPubThrustWrench =
myRosNode->create_publisher<geometry_msgs::msg::WrenchStamped>(
this->thrustTopicPublisher->GetTopic() + "_wrench", 10);
... | myRosNode->create_subscription<
uuv_gazebo_ros_plugins_msgs::msg::FloatStamped
>(this->commandSubscriber->GetTopic(), 10,
std::bind(&ThrusterROSPlugin::SetThrustReference, this, _1)) | call_expression | [
{
"content": "/// \\brief Gazebo model plugin class for underwater objects\n\nclass UnderwaterObjectPlugin : public gazebo::ModelPlugin\n\n{\n\n /// \\brief Constructor\n\n public: UnderwaterObjectPlugin();\n\n\n\n /// \\brief Destructor\n\n public: virtual ~UnderwaterObjectPlugin();\n\n\n\n // Documentati... |
C++ | src/publishers/EnviroDIYPublisher.cpp | ssuttles-usgs/ModularSensors | 8bc62eb7705729e47e4a47a6b2f02dab955b63f8 |
#include "EnviroDIYPublisher.h"
const char *EnviroDIYPublisher::postEndpoint = "/api/data-stream/";
const char *EnviroDIYPublisher::enviroDIYHost = "data.envirodiy.org";
const int EnviroDIYPublisher::enviroDIYPort = 80;
const char *EnviroDIYPublisher::tokenHeader = "\r\nTOKEN: ";
const char *EnviroDIYPublisher::con... |
#include "EnviroDIYPublisher.h"
const char *EnviroDIYPublisher::postEndpoint = "/api/data-stream/";
const char *EnviroDIYPublisher::enviroDIYHost = "data.envirodiy.org";
const int EnviroDIYPublisher::enviroDIYPort = 80;
const char *EnviroDIYPublisher::tokenHeader = "\r\nTOKEN: ";
const char *EnviroDIYPublisher::con... | - Response Code --"));
PRINTOUT(responseCode);
return responseCode;
}
| txBuffer[strlen(txBuffer)] = '"';
txBuffer[strlen(txBuffer)] = ':';
_baseLogger->getValueStringAtI(i).toCharArray(tempBuffer, 37);
strcat(txBuffer, tempBuffer);
if (i + 1 != _baseLogger->getArrayVarCount())
{
txBuffer[strlen(txBuffer)]... | random | [
{
"content": " // Returns the data destination\n\n virtual String getEndpoint(void){return String(enviroDIYHost);}\n\n\n\n // Adds the site registration token\n\n void setToken(const char *registrationToken);\n\n\n\n // Calculates how long the JSON will be\n\n uint16_t calculateJsonSize();\n\n... |
C++ | third_party/blink/renderer/core/layout/ng/ng_relative_utils_test.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a |
#include "third_party/blink/renderer/core/layout/ng/ng_relative_utils.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "third_party/blink/renderer/core/layout/geometry/physical_offset.h"
#include "third_party/blink/renderer/core/layout/geometry/physical_size.h"
#include "third_party/blink/renderer/core/sty... |
#include "third_party/blink/renderer/core/layout/ng/ng_relative_utils.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "third_party/blink/renderer/core/layout/geometry/physical_offset.h"
#include "third_party/blink/renderer/core/layout/geometry/physical_size.h"
#include "third_party/blink/renderer/core/sty... |
scoped_refptr<ComputedStyle> style_;
LogicalSize container_size_;
};
TEST_F(NGRelativeUtilsTest, HorizontalTB) {
LogicalOffset offset;
SetTRBL(kAuto, kAuto, kAuto, kAuto);
offset = ComputeRelativeOffset(
*style_, {WritingMode::kHorizontalTb, TextDirection::kLtr},
container_size_);
EXPECT_... | void SetTRBL(LayoutUnit top,
LayoutUnit right,
LayoutUnit bottom,
LayoutUnit left) {
style_->SetTop(top == kAuto ? Length::Auto() : Length::Fixed(top.ToInt()));
style_->SetRight(right == kAuto ? Length::Auto()
: Length::Fixed(right... | function_block-full_function | [] |
C++ | v8bridge/userland/userland_class.hpp | QuartzTechnologies/v8bridge | 5e2f2d6b93adae25295b88c0c4e0eb4f93e22057 |
#ifndef BOOST_PP_IS_ITERATING
# ifndef v8bridge_userland_class_hpp
# define v8bridge_userland_class_hpp
# include <stdexcept>
# include <v8bridge/detail/prefix.hpp>
# include <v8bridge/conversion.hpp>
# include <v8bridge/userland/userland_instance.hpp>
# include <boost/prepro... |
#ifndef BOOST_PP_IS_ITERATING
# ifndef v8bridge_userland_class_hpp
# define v8bridge_userland_class_hpp
# include <stdexcept>
# include <v8bridge/detail/prefix.hpp>
# include <v8bridge/conversion.hpp>
# include <v8bridge/userland/userland_instance.hpp>
# include <boost/prepro... | function returned value does not match the specified TResult (" << TypeId<TResult>().name() << ").";
throw std::runtime_error(io.str());
}
return result;
}
template <class TResult, BOOST_PP_ENUM_PARAMS(N, class TClass) >
inline typename boost::enable_if<
boost::is_same<TResult, void>, TResult >::... | for (TInstancesList::iterator it = this->m_instances->begin(); it != this->m_instances->end(); ++it)
{
(*it).reset();
}
this->m_instances->clear();
}
inline Local<Function> getCtorFu... | random | [
{
"content": " class V8_DECL NativeClass : public NativeEndpoint\n\n {\n\n public:\n\n NativeClass(Isolate *isolationScope) : NativeEndpoint(isolationScope),\n\n m_ctor(new NativeCtor(isolationScope)),\n\n m_methods(new TMethodsMap()),\n\n m_stati... |
C++ | ModelTakuzu.cpp | Ezryuk/Takuzu | 6dd94470c15c0071ca210a9655eb85d8458163c3 | #include "ModelTakuzu.h"
#include <cassert>
#include <iostream>
#include <QtAlgorithms>
#include <QFile>
#include <QTextStream>
ModelTakuzu::ModelTakuzu()
{
_nbMaps = -1;
_sizeMap = -1;
_grids = nullptr;
}
ModelTakuzu::~ModelTakuzu()
{
delete[] _grids;
}
Pawn ModelTakuzu::permuteR(Pawn p)
{
if (... | #include "ModelTakuzu.h"
#include <cassert>
#include <iostream>
#include <QtAlgorithms>
#include <QFile>
#include <QTextStream>
ModelTakuzu::ModelTakuzu()
{
_nbMaps = -1;
_sizeMap = -1;
_grids = nullptr;
}
ModelTakuzu::~ModelTakuzu()
{
delete[] _grids;
}
Pawn ModelTakuzu::permuteR(Pawn p)
{
if (... | ;
return (std::all_of(_currentGrid.begin(), _currentGrid.end(),
[](Pawn p)->bool { return (p != Empty);}) &&
std::all_of(isValid.begin(), isValid.end(), [](bool b)-> bool {return b;}) &&
std::all_of(counterOcc.begin(), counterOcc.end(), [this](int v) -> bool {return (... | std::for_each(rowsAndCols.begin(), rowsAndCols.end(), [&counterOcc](std::vector<Pawn> &vec) -> void {
counterOcc.push_back(std::count(vec.begin(), vec.end(), Black));
counterOcc.push_back(std::count(vec.begin(), vec.end(), White));
}) | call_expression | [
{
"content": "enum Pawn : unsigned char { Empty, Black, White};\n\nusing Grid_ = std::vector<Pawn>;\n\n\n",
"file_path": "ModelTakuzu.h",
"rank": 0,
"score": 86767.76155417053
},
{
"content": " void updateCount(int i, int j, Pawn oldPawn, Pawn newPawn);\n\n Pawn getPawn(int i, int j) c... |
C++ | hardware/interface/power/Power.cpp | aospwhatawurst/aosp_android_device_samsung_exynos9820-common | 77fe612901d6133d2734619cd3d1e86f6e7f0200 |
#define LOG_TAG "power@1.0-exynos9820"
#include <android-base/logging.h>
#include <android-base/file.h>
#include <android-base/properties.h>
#include <android-base/strings.h>
#include "Power.h"
#include <tsp.h>
#include <iostream>
namespace android {
namespace hardware {
namespace power {
namespace V1_0 {
namesp... |
#define LOG_TAG "power@1.0-exynos9820"
#include <android-base/logging.h>
#include <android-base/file.h>
#include <android-base/properties.h>
#include <android-base/strings.h>
#include "Power.h"
#include <tsp.h>
#include <iostream>
namespace android {
namespace hardware {
namespace power {
namespace V1_0 {
namesp... |
Return<void> Power::setInteractive(bool interactive) {
writeNode("/sys/devices/system/cpu/cpu0/cpufreq/scaling_max_freq",
interactive ? "1950000" : "1053000");
if (mDoubleTapEnabled && !interactive) {
tsp_enable_doubletap();
}
for (size_t i = 0; i < mInteractiveNodes.... | Power::Power() {
size_t inode_size = ARRAY_SIZE(interactive_node_paths);
mInteractionHandler.Init();
mEpic.Init();
tsp_init();
LOG(DEBUG) << "Looking for touchsceen/lcd nodes";
for (size_t i = 0; i < inode_size; i++) {
std::string node_path = interactive_node_paths[i];
i... | function_block-full_function | [
{
"content": "namespace android {\n\nnamespace hardware {\n\nnamespace power {\n\nnamespace V1_0 {\n\nnamespace implementation {\n\n\n\nusing ::android::hardware::power::V1_0::Feature;\n\nusing ::android::hardware::power::V1_0::PowerHint;\n\nusing ::android::hardware::power::V1_0::IPower;\n\nusing ::android::ha... |
C++ | Src/Qt/qwt/src/qwt_spline.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 |
#include "precomp.h"
#include "qwt_spline.h"
#include "qwt_math.h"
class QwtSpline::PrivateData
{
public:
PrivateData():
splineType( QwtSpline::Natural )
{
}
QwtSpline::SplineType splineType;
QVector<double> a;
QVector<double> b;
QVector<double> c;
QPolygonF points... |
#include "precomp.h"
#include "qwt_spline.h"
#include "qwt_math.h"
class QwtSpline::PrivateData
{
public:
PrivateData():
splineType( QwtSpline::Natural )
{
}
QwtSpline::SplineType splineType;
QVector<double> a;
QVector<double> b;
QVector<double> c;
QPolygonF points... |
QwtSpline::QwtSpline()
{
d_data = new PrivateData;
}
QwtSpline::QwtSpline( const QwtSpline& other )
{
d_data = new PrivateData( *other.d_data );
}
QwtSpline &QwtSpline::operator=( const QwtSpline & other )
{
*d_data = *other.d_data;
return *this;
}
QwtSpline::~QwtSpline()
{
delete d_data;
}
vo... | i1 = 0;
int i2 = size - 2;
int i3 = 0;
while ( i2 - i1 > 1 )
{
i3 = i1 + ( ( i2 - i1 ) >> 1 );
if ( values[i3].x() > x )
i2 = i3;
else
i1 = i3;
}
}
return i1;
} | function_block-function_prefix_line | [
{
"content": "class BCGCBPRODLLEXPORT CBCGPPointsArray : public CArray<CBCGPPoint, const CBCGPPoint&>\n\n{\n\npublic:\n\n\tCBCGPPointsArray() {}\n\n\tCBCGPPointsArray(int nNewSize, int nGrowBy = -1)\n\n\t{\n\n\t\tSetSize(nNewSize, nGrowBy);\n\n\t}\n\n\n\n\t~CBCGPPointsArray() {}\n\n\n\n\tCBCGPRect GetBoundsRect... |
C++ | src/client/commands/CmdBase.cpp | lclc/opentxs | 0bc847c6601d20e3346bb2faf81feda3a14ab303 |
#include "CmdBase.hpp"
#include "../ot_made_easy_ot.hpp"
#include <opentxs/client/ot_otapi_ot.hpp>
#include "../ot_utility_ot.hpp"
#include <opentxs/client/OpenTransactions.hpp>
#include <opentxs/client/OTAPI.hpp>
#include <opentxs/client/OTWallet.hpp>
#include <opentxs/core/Account.hpp>
#include <opentxs/core/Asse... |
#include "CmdBase.hpp"
#include "../ot_made_easy_ot.hpp"
#include <opentxs/client/ot_otapi_ot.hpp>
#include "../ot_utility_ot.hpp"
#include <opentxs/client/OpenTransactions.hpp>
#include <opentxs/client/OTAPI.hpp>
#include <opentxs/client/OTWallet.hpp>
#include <opentxs/core/Account.hpp>
#include <opentxs/core/Asse... |
Category CmdBase::getCategory() const
{
return category;
}
const char* CmdBase::getCommand() const
{
return command;
}
const char* CmdBase::getHelp() const
{
return help;
}
string CmdBase::getAccountAssetType(const string& myacct) const
{
string assetType = OTAPI_Wrap::GetAccountWallet_AssetTypeID(... | string CmdBase::formatAmount(const string& assetType, int64_t amount) const
{
if (OT_ERROR_AMOUNT == amount) {
return "UNKNOWN_AMOUNT";
}
if ("" == assetType) {
return to_string(amount);
}
return OTAPI_Wrap::FormatAmount(assetType, amount);
} | function_block-function_prefix_line | [
{
"content": "class String;\n",
"file_path": "include/opentxs/core/Account.hpp",
"rank": 0,
"score": 273173.24958394736
},
{
"content": "class Account;\n",
"file_path": "include/opentxs/server/Transactor.hpp",
"rank": 1,
"score": 272706.39791854477
},
{
"content": "class ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.